| Patent application number | Description | Published |
|---|
| 20100328311 | SYSTEM AND METHOD FOR ESTABLISHING CORRESPONDENCE, MATCHING AND REPAIRING THREE DIMENSIONAL SURFACES OF ARBITRARY GENUS AND ARBITRARY TOPOLOGY IN TWO DIMENSIONS USING GLOBAL PARAMETERIZATION - A system, method and computer program product for parameterizing a 3D surface of genus g and arbitrary topology to the 2D plane. The method includes receiving an input 3D mesh of genus g; computing n discrete harmonic one-forms on the surface of the mesh to obtain n numbers for every edge in the graph represented by an input mesh; selecting two compatible linearly independent discrete harmonic one-forms for parameterization; assigning an arbitrary vertex in the mesh as an origin, and then summing each of the two harmonic one-forms along the edges of the graph using a traversal strategy to form 2D coordinates for every other vertex of the mesh to form the 2D parameterization of the 3D surface; detecting all singularities in the 2D parameterization; and, removing faces connected to the singularity and parameterizing the vertices of the removed faces using a 2D parameterization method, and connecting these vertices using a 2D polygonalization algorithm. Using the 3D mapping methodology employed, a correspondence function is computed that can be used to match two 3D object surfaces and repair meshes of arbitrary genus. | 12-30-2010 |
| 20110055426 | DYNAMIC AND EVOLUTIONARY PLACEMENT IN AN EVENT-DRIVEN COMPONENT-ORIENTED NETWORK DATA PROCESSING SYSTEM - Method, system and computer readable program code for dynamic and evolutionary component placement in an event processing system having producers, consumers, a plurality of nodes between the producers and the consumers, and a flow graph representing operator components to be executed between the producers and the consumers. A description of a change to the system is received. At each node, next-hop neighbor nodes for each consumer are identified. A routing value is assigned to each next-hop neighbor node for each consumer and the routing values are updated according to an update rule that represents a chromosome in a routing probe. The update rule in a routing probe is selectively updated from a plurality of update rules at the consumer. The probability of selecting a particular update rule is reinforced or decayed based on the success of an update rule in allowing routing probes to create many different efficient routes. At each producer, nests of scouting probes are adaptively selected from an available set of nests and dispatched to execute hypothetical placement of a query by an independent agent called a “leader”. A placement of the operator components that minimizes performance cost of the system relative to the hypothetical placement is selected. Each scouting probe contains chromosomes that guide placement. Scouting probes in two different nests have different chromosomes. The performance cost of the hypothetical changed placement is evaluated and the performance evaluation is used to evolve at least one chromosome of a scouting ant in each nest. | 03-03-2011 |
| 20110087732 | LINKING VIRTUAL WORLDS AND COLLABORATION PLATFORMS BI-DIRECTIONALLY USING A CENTRAL IDENTITY MANAGEMENT SYSTEM - A method, information processing system, and computer program storage product link information associated with a virtual world with information associated with a social collaboration platform. A virtual world user identifier and a social collaboration platform user identifier are stored. The virtual world identifier is associated with a set of virtual world contacts for the respective user. The social collaboration platform user identifier is associated with a set of social collaboration contacts for the user. The virtual world user identifier is linked to the social collaboration platform user identifier. An association is determined between at least one of the set of social collaboration contacts and the virtual world identifier set of virtual world contacts and the social collaboration platform user identifier, respectively, for the respective user. An information set associated with at least one of the virtual world user identifier and the social collaboration identifier is updated to include the association. | 04-14-2011 |
| 20110087968 | MANAGING CONNECTIONS BETWEEN REAL WORLD AND VIRTUAL WORLD COMMUNITIES - A method, information processing system, and computer program storage product manage connections between a virtual world and a social network. A set of virtual world information and a set of social network information are analyzed. A graph including a plurality of vertices is generated. Each vertex represents one of virtual world information and social network information. Each vertex is coupled to at least one other vertex by a respective edge. At least one edge of the graph couples a first vertex representing virtual world information and a second vertex representing social network information. At least one vertex is determined to be an articulation point having a respective edge. The removal of the respective edge of the articulation point causes a disconnection of the virtual world information from the social network information within the graph. A user is notified via a graphical user interface that the graph comprises the articulation point. | 04-14-2011 |
| Patent application number | Description | Published |
|---|
| 20090259769 | Dynamic Component Placement in an Event-Driven Component-Oriented Network Data Processing System - Method, system and computer usable program code for dynamic component placement in an event processing system having producers, consumers, a plurality of nodes between the producers and the consumers, and a flow graph representing computational components to be executed between the producers and the consumers. A description of a change to the system is received. At each node, next-hop neighbor nodes for each consumer are identified. A routing value is assigned to each next-hop neighbor node for each consumer. Using the routing values in a context of the change, a performance cost of the system is estimated based on hypothetical changed placements of the computational components at nodes along paths from a producer to a consumer through the next-hop neighbor nodes for each consumer, and a changed placement of the computational components that minimizes performance cost of the system relative to the hypothetical changed placements is selected. | 10-15-2009 |
| 20110047554 | DECENTRALIZED LOAD DISTRIBUTION TO REDUCE POWER AND/OR COOLING COSTS IN AN EVENT-DRIVEN SYSTEM - A computer-implemented method, computer program product and computer readable storage medium directed to decentralized load placement in an event-driven system so as to minimize energy and cooling related costs. Included are receiving a data flow to be processed by a plurality of tasks at a plurality of nodes in the event-driven system having stateful and stateless event processing components, wherein the plurality of tasks are selected from the group consisting of hierarchical tasks (a task that is dependent on the output of another task), nonhierarchical tasks (a task that is not dependent on the output of another task) and mixtures thereof. Nodes are considered for quiescing whose current tasks can migrate to other nodes while meeting load distribution and energy efficiency parameters and the expected duration of the quiesce provides benefits commensurate with the costs of quiesce and later restart. Additionally, tasks are considered for migrating to neighbor nodes to distribute the system load of processing the tasks and reduce cooling costs. | 02-24-2011 |
| 20110047555 | DECENTRALIZED LOAD DISTRIBUTION IN AN EVENT-DRIVEN SYSTEM - A computer-implemented method, computer program product and computer readable storage medium directed to decentralized load distribution in an event-driven system. Included are receiving a data flow to be processed by a plurality of tasks at a plurality of nodes in the event-driven system having stateful and stateless event processing components, wherein the plurality of tasks are selected from the group consisting of hierarchical tasks (a task that is dependent on the output of another task), nonhierarchical tasks (a task that is not dependent on the output of another task) and mixtures thereof. Tasks are considered for migration to distribute the system load of processing tasks. The target node, to which the at least one target task is migrated, is chosen wherein the target node meets predetermined criteria in terms of load distribution quality. The computer-implemented method, computer program product and computer readable storage medium of the present invention may also include migrating tasks to target nodes to reduce cooling costs and selecting at least one node to go into quiescent mode. | 02-24-2011 |
| 20110267350 | Adaptive Process Simplification of Mined Business Process Graphs Using Tutte Parameterizations - A method of graph simplification includes receiving a connected process graph having a plurality of edges and nodes, parameterizing the connected process graph to determine a mapping where none of the edges overlap, defining respective energies for a plurality of triangles formed by the edges and the nodes in the connected process graph, identifying node clusters in the connected process graph, and collapsing, for each node cluster, ones of the edges and nodes in the connected process graph that are not critical edges or critical nodes according to the energies. | 11-03-2011 |
| 20110267351 | Dynamic Adaptive Process Discovery and Compliance - A method for modeling a process includes collecting data pertaining to executed process steps from one or more activity log files. The collected data is parsed to determine a set of process steps that have been performed. An incidence value representing how many times each performed process step follows each of the other performed process steps is determined. A graph representing a model of the executed process by representing each process step that has been performed as a node of the graph and each transition between process steps within each process thread as an edge on the graph is generated. The edges connecting the pairs of nodes are assigned numbers that depend upon the incidence value corresponding to how many times the process step represented by a first node of the pair is followed by the process step represented by a second node of the pair. | 11-03-2011 |
| 20110270853 | Dynamic Storage and Retrieval of Process Graphs - A method for modeling a process includes receiving a plurality of graphs representing processes wherein for each graph. A sequence of process steps of the processes are represented as nodes and edges connecting pairs of nodes represent transitions between process steps. A numeric value representative of graph appearance for each of the plurality of received graphs is calculated. Each of the plurality of received graphs is stored within a tree-like data structure according to its corresponding numeric value. Each of the above steps is performed using a computer system. | 11-03-2011 |
| 20120059820 | Aggregation, Organization and Provision of Professional and Social Information - A method for performing a search for information pertaining to a search subject includes receiving a name of a person. A social/professional value is received. A search is performed based on the received name. A plurality of personal candidates is identified from results of the search and profiles of the same person in different search domains are automatically linked. A search subject is selected from among the identified plurality of candidates based on user input. The search results are characterized along a scale from social information to professional information. The search results are filtered based on the received value indicative of the desired level and the characterization of each item of results found. The filtered search results are displayed. | 03-08-2012 |
| Patent application number | Description | Published |
|---|
| 20090125323 | OBTAINMENT OF PRODUCTS AND SERVICES USING NON-FINANCIAL TRANSACTIONS CONDUCTED OVER A FINANCIAL NETWORK - Methods and systems for facilitating obtaining products and/or services using non-financial transactions over a financial transaction network are provided. Example embodiments provide a Single Swipe Obtainment System, which initiates providing requested product(s) in response to a non-financial transaction via a financial network. A non-financial entity supplies a card to each user. Items may be subsequently ordered by a user swiping the card in a point-of-sale device and entering a code associated with the requested item. When the code is received via the financial network by the non-financial entity, a product or service associated with the code is determined and supplied to the user, such as by shipping the associated product or service to the user. This abstract is provided to comply with rules requiring an abstract, and it is submitted with the intention that it will not be used to interpret or limit the scope or meaning of the claims. | 05-14-2009 |
| 20090192863 | Incentive card program for attracting persons to product or service displays - Methods, systems, and techniques for marketing products are provided. Example embodiments provide an Incentive Card Program System (“ICPS”), which enables vendors to attract potential customers to product displays. In one embodiment, the ICPS comprises an incentive card program along with services in the form of hardware, software, or firmware to implement the functions of the program running for example on a computing system associated with product displays, such as a kiosk. In some embodiments, the ICPS optionally includes a portal, accessible over a network such as the Internet, for incentive card holders to obtain information related to their incentive cards. These components cooperate to provide services relating to incentive card programs. This abstract is provided to comply with rules requiring an abstract, and it is submitted with the intention that it will not be used to interpret or limit the scope or meaning of the claims. | 07-30-2009 |
| Patent application number | Description | Published |
|---|
| 20100056059 | SYSTEMS AND METHODS FOR ADAPTIVE BEAMFORMING IN INDOOR WIRELESS NETWORKS - Systems and methods are disclosed for transmitting signals between a transmitter and a receiver by differentially estimating channel coefficients for each of the antenna elements relative to a reference antenna element; determining beam weights to remove oscillator induced phase or offset; and applying a correction (beamforming solution) at the transmitter to make the phase of the received signal from different antenna elements to be coherently combined at the receiver. | 03-04-2010 |
| 20100214983 | WIRELESS COMMUNICATION COLLISION CODING DEVICES, SYSTEMS, & METHODS - Wireless communication collision coding devices, systems, and methods are provided. According to some embodiments, wireless communication systems can generally comprise a plurality of wireless access points and wireless clients. The wireless access points can be controlled by a network controller. The wireless access points can be configured to enable a plurality of wireless clients to wirelessly connect to the wireless access points. The wireless access points can be configured to encode data packets destined for the wireless clients with a collision coding scheme so that wireless data packets concurrently transmitted from at least two wireless access points colliding in air can be decoded at the wireless clients with the collision coding scheme so that data packets are not affected by collisions with another data packet. Other aspects, embodiments, and features, are also claimed and described. | 08-26-2010 |
| 20100285752 | BEAMFORMING METHODS AND SYSTEMS EMPLOYING MEASURED POWER AT A RECEIVER TO PERFORM CHANNEL ESTIMATION - Beamforming methods and systems are described in which differential channel estimation can be computed based on measured power at receiver. Simultaneous activation of antennas in separate pairs can be used to determine relative phases of antennas with respect to a reference antenna based on the power measurements. In turn, the beam forming signals can be weighted in accordance with the relative phases to adapt the signals to a multipath environment. Existing power measurement capabilities of conventional receivers can be employed to achieve approximate channel estimates. | 11-11-2010 |
| Patent application number | Description | Published |
|---|
| 20080222273 | Adaptive rendering of web pages on mobile devices using imaging technology - Described is browsing websites with a small form-factor (e.g., mobile) device that is similar to a desktop browsing experience, without requiring websites to redesign pages for such devices. A server responds to client requests for page content by providing server-rendered image data to the requesting client, along with properties of elements of the page represented in the image data. The client displays a representation of the page based on the image data, and uses the property data to emulate interaction with the page rather than the image that is actually being displayed. The server may provide tiles corresponding to zoomed-in portions of the page, or the client device may generate tiles from the image data. Using the tiles, element properties and a moveable/resize-able zoom rectangle provided to the user, the client device can zoom into the page to facilitate interaction with the elements in that area. | 09-11-2008 |
| 20080222530 | Navigating user interface controls on a two-dimensional canvas - Described is a technology for two-dimensional navigation among user interface controls of a canvas based on up, down, left or right navigational commands received from a two-dimensional directional input mechanism such as a D-Pad, such as on a mobile device. Navigation includes iterating over candidate controls to determine which will control be chosen receive focus based on a received navigational command, the control that currently has focus, and criteria including distance and relative position of each candidate control to the control currently having focus. Vertical distance (alignment) as well as absolute distance may be used to determine the candidate control having the least computed distance. Direction and whether the candidate control is also currently visible in a viewport when the control having focus is currently visible in the viewport are other criteria that may be used in selecting a chosen control on which focus will be set. | 09-11-2008 |
| 20090176451 | ENCODED COLOR INFORMATION FACILITATING DEVICE PAIRING FOR WIRELESS COMMUNICATION - Pairing information is encoded as color information by a color coding device. The encoded color information is displayed by the color coding device and viewed by a color decoding device. The color decoding device decodes the encoded pairing information and uses the decoded pairing information to establish wireless communication with the color coding device. | 07-09-2009 |
| Patent application number | Description | Published |
|---|
| 20090051006 | N CELL HEIGHT DECOUPLING CIRCUIT - A decoupling circuit disposed between a first rail and a second rail, where a third power rail is disposed between the first and second rails. A resistor having a first electrode and a second electrode is disposed between the first and second rails. Two capacitors are disposed between the first and second rails. The resistor is connected to the third rail and the two capacitors. In this manner, the two capacitors are connected in series with respect to the resistor, and in parallel with respect to one another. A first of the two capacitors is connected to the first rail, and a second of the two capacitors is connected to the second rail. At least one of the resistor and the two capacitors is disposed at least in part beneath the third rail. | 02-26-2009 |
| 20090271755 | Unified Layer Stack Architecture - A method for producing a family of digital integrated circuit designs, where the family has a highest level design and at least one lower level design. The highest level design is first produced. Then, in a programmed computing system without user intervention, the highest level design is automatically processed to selectively remove at least one predetermined metal layer. A closest remaining overlying layer to the at least one removed metal layer is automatically mapped to a closest remaining underlying layer to the at least one removed metal layer, thereby producing the at least one lower level design. | 10-29-2009 |
| 20100070936 | WAIVER MECHANISM FOR PHYSICAL VERIFICATION OF SYSTEM DESIGNS - A method of waiving verification failures is disclosed. The method generally includes the steps of (A) generating a plurality of circuit error files by performing a plurality of physical verifications on a plurality of circuit designs, the circuit error files containing a plurality of circuit errors of the circuit designs, (B) generating a system error file by performing an additional physical verification on a system design, the system error file containing a plurality of system errors of the system design, the system design incorporating the circuit designs, (C) generating a valid error file by removing the circuit errors from the system error file, the valid error file containing a plurality of valid errors comprising a subset of the system errors and (D) storing the valid error file in a recording medium. | 03-18-2010 |
