Patent application number | Description | Published |
20090217213 | REUSE OF CIRCUIT LABELS FOR VERIFICATION OF CIRCUIT RECOGNITION - A method for indentifying instances of a smaller circuit in a larger circuit is disclosed. Both the smaller circuit and the larger circuit have a plurality of vertices. A vertex is one of a device or a net. The device, such a transistor, includes a Gate, a Drain, and a Source. The net is a wired connection between devices. The method includes recursively relabeling of each of the plurality of vertices until labels of all neighboring vertices of a selected vertex are zero. The neighboring vertices of a vertex are vertices that are directly connected to the vertex. Each successive iteration of the relabeling uses labels of each of the plurality of vertices after a previous iteration of the relabeling. Then, a recursive circuit tracing operation is performed starting from the selected vertex until each of the plurality of vertices in the smaller circuit is matched with one of the plurality of vertices in the larger circuit. The circuit tracing operation includes matching a label of each of the plurality of vertices neighboring the selected vertex in the smaller circuit with a label of each of the plurality of vertices in the larger circuit neighboring a vertex corresponding to the selected vertex, wherein labels at a same depth of relabeling iteration is matched. | 08-27-2009 |
20090217214 | UNIDIRECTIONAL RELABELING FOR SUBCIRCUIT RECOGNITION - A method for indentifying instances of a smaller circuit in a larger circuit is disclosed. Both the smaller circuit and the larger circuit have a plurality of vertices. A vertex is one of a device or a net. The device, such a transistor, includes a Gate, a Drain, and a Source. The net is a wired connection between devices. In this method, one initial unique label is assigned to each of the plurality of vertices, each of a plurality of connection-types, power connection, and ground connection. A zero label is assigned to each of an input/output ports and a same initial unique label is assigned to same types of circuit components. Then each net is relabeled using labels of neighboring vertices. The neighboring vertices of a vertex are vertices that are directly connected to the vertex. Then, each device in the plurality of vertices is relabeled using labels of neighboring vertices excluding a label of a vertex that is connected to the Gate of the each device. The new labels of each vertex are stored in a data store and these labels are used in the calculation of the new labels of the vertices in a next iteration of relabeling. | 08-27-2009 |
20100042964 | REUSE OF CIRCUIT LABELS IN SUBCIRCUIT RECOGNITION - Method, apparatus and system for finding instances of a pattern in a main netlist include reading in the main netlist and the pattern that is used for finding pattern matches in the main netlist. The main netlist and the pattern include a plurality of vertices. Each of the vertices is a device or a net. Labels for the vertices are computed in both the pattern and the main netlist up to a depth appropriate for the pattern. A vertex of the pattern is identified and used in matching with one or more vertices in the main netlist at the depth appropriate for the pattern using the computed labels. The computed labels for each of the vertices of the main netlist are stored for possible reuse in subsequent pattern matches. | 02-18-2010 |
Patent application number | Description | Published |
20090307038 | SYSTEM AND METHOD FOR CREATION OF DATA FEEDS BASED ON CALENDER MEETING PARTICIPANTS - In some embodiments, a method for determining data feeds in an electronic calendar comprises identifying participants of a meeting scheduled in the electronic calendar and determining topics relevant to the participants of the meeting. The method can also comprise selecting data feeds based on the topics relevant to the participants of the meeting, wherein the data feeds provide information about the topics. The method can also include presenting the data feeds to one or more of the participants of the meeting. | 12-10-2009 |
20090307044 | System and method for consolidation of calendar appointments - A system and method for dynamically consolidating an appointment schedule. The system includes a client computer, a calendar server, and a server calendar management agent (CMA). The client computer displays a calendar user interface to show a first candidate appointment. The calendar server facilitates a scheduling consolidation session. The server CMA searches for a second candidate appointment for consolidation with the first candidate appointment based on at least one consolidation parameter. The server CMA also identifies a consolidated appointment for at least the first and second candidate appointments. The consolidated appointment combines the first and second candidate appointments according to the consolidation parameter. | 12-10-2009 |
20090307045 | SYSTEM AND METHOD FOR OPTIMIZATION OF MEETINGS BASED ON SUBJECT/PARTICIPANT RELATIONSHIPS - In some embodiments, a method for determining meeting participants in an electronic calendar comprises identifying, based on user input, a first set of participants to invite to a meeting scheduled in the electronic calendar, wherein the meeting is associated with a topic. The method can also comprise identifying a second set of participants based on the topic associated with the meeting. The method can include determining a union of the first and second sets of participants and generating, for this union, calendar entries in the electronic calendar. The method can also include presenting the calendar entries in the electronic calendar. | 12-10-2009 |
20090327227 | MEETING ROOM AND RESOURCE SCHEDULING AND PRIORITIZATION BASED ON ATTENDEE LOCATION - A method for meeting room scheduling includes receiving a specification for a meeting, including a list of attendees, and determining respective physical locations for each of the attendees. One or more optimal locations in which to have the meeting is found by calculating which ones of the physical locations has a highest concentration of attendees located there. An optimal room at each of the one or more optimal locations is found by selecting a room that is within a smallest average proximity to a highest number of attendees. The optimal room at each of the one or more optimal locations is then scheduled for the meeting. | 12-31-2009 |
20100317304 | Enhanced Radio - A system and method of controlling a portable radio may involve tuning a first receiver of the portable radio to a first broadcast from a first station, where the first broadcast includes specific program content. A switching event can be detected at the portable radio, where a second receiver of the portable radio may be tuned to a second broadcast from a second station in response to the switching event. The second broadcast can include the specific program content. | 12-16-2010 |