International Business Machines Corporation

Frank Suits

William Pettit Horn

James Thomas Klosowski

Peicheng Du

Ramachandra Rao Kolluri

Gerard Lecina

Timothy Michael Lynar

Shawn Anthony Hall

Sergiy Zhuk

Emanuele Ragnoli

Paul Borrel

Fearghal O'Donncha

William Louis Luken

Fatemeh Jalali

Ioana Maria Martin

Stanislav Polonsky

Julian De Hoog

Filiz Isabell Kiral

Julia Anatolyevna Valuyeva

James T Klosowski

William P Horn

Embodiments of the present invention are directed to a noise-model based sensor converter configured to map a sensor measurement output to discrete, nonlinear steps of constant uncertainty. In a non-limiting embodiment of the invention, the sensor converter receives an output signal from a sensor. The output signal can include a measurement. The sensor converter can also receive a noise model. The output signal is mapped to a discrete set of steps based on the noise model. The discrete set of steps are nonlinearly spaced to provide constant uncertainty between adjacent steps. The sensor converter generates an output based on the discrete set of steps.

Noise model-based converter with signal steps based on uncertainty

A system for allocating tasks within a moving multi-hop mesh network includes a processor operatively coupled to memory. The processor is configured to implement the steps of: sending a bid request from a first network node to two or more other network nodes for computing a task, wherein the first network node has a first geographical location relative to a first geographical location of the two or more other network nodes; in response to the first network node receiving a bid from at least two of the two or more other network nodes for computing the task; predicting a second geographical location for each of the at least two of the two or more other network nodes relative to a second geographical location of the first network node based on the time when the task will be completed; predicting a total task completion time for the at least two of the two or more other network nodes; comparing the total task completion time predicted for the at least two of the two or more other network nodes to generate a winning bid; and allocating the task to the winning bid.

Dynamic task allocation and node reconfiguration in mesh network

A mechanism is provided in a data processing system for minimizing uncertainty envelopes in trajectories of evolving ensemble members. The mechanism generates a trajectory forecast of each member object of an ensemble based on an initial state-space and a model for predicting trajectories of the member objects to generate a plurality of trajectory forecasts. Each of the plurality of trajectory forecasts has an individual uncertainty envelope. The mechanism applies a classification algorithm on the plurality of trajectory forecasts to identify at least one group of member objects having similar trajectory forecasts, generates a reduced ensemble of member objects including the identified group of member objects, and reconfigures the state-space and the model for predicting trajectories. The mechanism generates an updated trajectory forecast of each member object of the reduced ensemble based on the reconfigured state-space and the reconfigured model for predicting trajectories of the member objects.

Minimizing uncertainty envelopes in trajectories of evolving ensemble members

A system, method and program product for managing a moving peer-to-peer network. A system is provided that a node tracking system that collects tracking information of nodes in a moving P2P network including position, connection status and computation capability; a network representation system that stores the tracking information in a dynamic graph that specifies nodes and connections between the nodes; a task manager for receiving a task submitted by a requesting node for a service implemented by a provider node; and a network allocation system that determines and allocates an optimal path back and forth between the requesting node and the provider node, wherein the optimal path is selected to minimize an overall wall-time, and wherein the network allocation system estimates future positions of moving nodes for determining the optimal path.

System and method for managing a moving peer-to-peer network

Techniques for power sharing in DC networks using virtual impedance frequency droop control are provided. In one aspect, a method for power sharing in a DC network having multiple electrical energy generation sources connected to at least one load includes the steps of, at each of the electrical energy generation sources: generating a controllable DC voltage; superimposing a controllable AC signal on top of the DC voltage; regulating the AC signal using virtual impedance frequency droop control; and determining a desired DC voltage output using the regulated AC signal. The DC voltage can then be regulated to match the desired DC voltage output. A system for power sharing in a DC network is also provided.

Power sharing for DC microgrids

The problem of aligning multiple liquid chromatography mass spectrometry (LC-MS) runs to a common reference time frame is solved to facilitate comparison among LC-MS runs. The alignment of multiple LCMS can be achieved by solving a sparse system of linear equations to optimally stretch or compress local retention times for maximal similarity among the multiple runs. The multiple LCMS runs can be aligned simultaneously, thereby providing the advantage of efficient use of data by employing a sparse solver. A method of quality control in retention time alignment is also provided.

Alignment of multiple liquid chromatography-mass spectrometry runs

A method that identifies common peaks among unidentified peaks in the data from different LC-MS or LC-MS/MS runs is provided. The method employs an algorithm, herein referred to as 'Precision Peak Matching (PPM).' The different runs can be from different laboratories, instruments, and biological samples that result in a significant variability in the data. PPM allows estimation and control of precision, defined as the fraction of truly identical peptide pairs among all pairs retrieved, in the matching process. PPM finds the maximal number of peptide pairs at a prescribed precision, thereby allowing quantitative control over the trade off between the number of true pairs missed, and false pairs found. PPM finds common peptides from a database of LC-MS runs of heterogeneous origins, and at the specified precision. PPM fills a much-needed role in proteomics by extracting useful information from disparate LC-MS databases in a statistically rigorous and interpretable manner.

Precision peak matching in liquid chromatography-mass spectroscopy

Semiconductor devices, chromatography devices and integrated circuits for detecting one or more molecules and methods for forming a semiconductor device for detecting one or more molecules are presented. For example, a semiconductor device for detecting one or more molecules includes a channel formed within a semiconductor structure, and at least one detector formed within the semiconductor structure. The at least one detector detects the one or more molecules in the channel. The semiconductor device may optionally comprise one or more additional channels formed within the semiconductor structure. The semiconductor device may, for example, be operative to detect a single molecule.

Molecule detection device formed in a semiconductor structure

Vertices of an annotation are projected onto a surface of a (2D or 3D) model and reconnected to preserve the original appearance of the annotation. The result of our method is a new set of geometry for the annotation that geometrically conforms to the surface of the model. A plane is defined by the midpoint of the original line segment and the two projected vertices. This plane is used to create the new line segments that conform to the surface, e.g. by doing a 'surface walk' between the projected points along the line defined by the intersection of the plane and the surface.

Apparatus, system, and method for draping annotations on to a geometric surface

A system simplifies a geometric model to accelerate the rendering of the geometric model. A surface description of the geometric model is stored in one or more of the system memories. A wire-frame description of the geometric model is also stored. A surface simplification process alters the surface description to create an approximation of the original surface description. A wire-frame draping process drapes the wire-frame description onto the simplified surface and simplifies one or more of the line segments that are draped, the simplified line segments and the simplified surface description are rendered onto a display device.

System and method for the coordinated simplification of surface and wire-frame descriptions of a geometric model

A system for providing interactive views of 3-dimensional models with surface properties is disclosed. The system provides a compact representation of a 3D model and its surface features and provides for efficiently viewing and interacting with the model using dynamically switched texture maps. The compact representation is beneficial for transmission of the model across a network as well as for local storage of the model in the computer memory. The dynamically switched texture maps allow for more accurate surface details on the 3D model, as well as speedy interaction between a user and the 3D model.

Growing community of inventors

Garrison, NY, United States of America

Frank Suits