Hewlett-packard Development Company, L.p.

Hewlett Packard Enterprise Development LP

Lifescan Corporation

Remec Broadband Wireless, LLC

Gtat Corporation

Remec Broadband Wireless Holdings, Inc.

Bridgewave Communications, Inc.

Bin Zhang

Meichun Hsu

Ren Wu

Qiming Chen

Umeshwar Dayal

Kemal Guler

Julie Ward Drew

Eliezer Pasternak

Idan Bar-Sade

George H Forman

Robert E Tarjan

Ronald Christopher Chatelier

William Kevin Wilkinson

Alastair McIndoc Hodges

Maria G Castellanos

Fereydoon Safai

Yunhong Zhou

Sherry Guo

Qi Feng

Evan Randy Kirshenbaum

Hsiu-Khuern Tang

Robert Brainard

Sachin Kulkarni

David W Birdsall

Kay-Yut Chen

Kenneth O Stanley

Ron Chatelier

Shailendra K Jain

Gregg Levin

John Park

Andy Therber

Hans Zeller

Ivo Jimenez

Igor Kleyner

A method for combining data values through associative operations. The method includes, with a processor, arranging any number of data values into a plurality of columns according to natural parallelism of the associative operations and reading each column to a register of an individual processor. The processors are directed to combine the data values in the columns in parallel using a first associative operation. The results of the first associative operation for each column are stored in a register of each processor.

Parallel processing in plural processors with result register each performing associative operation on respective column data

One embodiment is a method that uses MapReduce and Relation Valued Functions (RVFs) with parallel processing to search a database and obtain search results.

Map-reduce and parallel processing in databases

A communications system are provided that provides integrated encryption capabilities. In particular, a digital microwave system, terminal and method are provided in which the encryption functions are integrated into the digital microwave terminals. The digital microwave system may also be implemented with external encryption units.

Digital microwave radio system and method with encryption

A representation of a flow network having vertices connected by arcs is provided. The vertices include a first set of vertices that provide flow to a second set of vertices over arcs connecting the first set and second set of vertices. A balancing procedure in the network is performed that includes redistributing flows on arcs incident on the second set of vertices. The balancing procedure includes selecting a batch of the vertices in the second set, and redistributing flows on arcs incident on the selected batch of vertices. The selecting and redistributing are repeated for other batches of vertices in the second set.

Network balancing procedure that includes redistributing flows on arcs incident on a batch of vertices

Densest subgraphs of a graph are determined. The graph includes vertices and edges interconnecting the vertices. Each edge connects two of the vertices and has a weight. The vertices and the edges form subgraphs from which the densest subgraphs are determined as those subgraphs having densities greater than a threshold. Clusters at levels of a hierarchy are determined based on the densest subgraphs. Each cluster includes a set of the vertices and a set of the edges of the graph. Each level corresponds to a different density of the clusters. The hierarchy is ordered from a most-dense level of the clusters to a least-dense level of the clusters.

Hierarchical cluster determination based on subgraph density

To coordinate tasks executed by a plurality of threads that each includes plural task sections, a call of a mark primitive to mark a first point after a first of the plural task sections is provided. Also, a call of a second primitive is provided to indicate that a second of the plural task sections is not allowed to begin until after the plurality of threads have each reached the first point.

Coordination of tasks executed by a plurality of threads using two synchronization primitive calls

The current application discloses a database management system that provides multiple-input, multiple-output-per-input user-defined-function-based operations. The database management system comprises at least one processor and electronic memory, a database-query processor, executed on a computer processor controlled by computer instructions stored in a computer-readable memory, that makes multiple calls to a multiple-input, multiple-output-per-input user-defined-function, in each call transmitting a next input to the multiple-input, multiple-output-per-input user-defined-function, and the multiple-input, multiple-output-per-input user-defined-function, executed on a computer processor controlled by computer instructions stored in a computer-readable memory, that uses three different memory buffers, the contents of which are maintained for three different time periods, to compute and return to the database-query processor multiple outputs in response to at least one of the multiple inputs.

Multi-input, multi-output-per-input user-defined-function-based database operations

A nested chain of densest subgraphs is derived by a computer from a given graph that has multiple vertices and edges. The two ends of each edge are assigned with respective incident weights, and each vertex is given a vertex weight. A weight balancing process is carried out by the computer to iteratively go through the edges to adjust the incident weights of each edge and the vertex weights of the vertices connected by that edge to reduce a difference between the vertex weights of the two vertices. After the balancing, the vertex weights are put in an ordered sequence according to their values, and a nested chain of densest subgraphs is derived from the ordered sequence.

Deriving a nested chain of densest subgraphs from a graph

A method of generating discrete event simulation data using a query is provided herein. The method includes retrieving a trajectory specifying a service access event for a customer accessing a service in a simulation. The method also includes processing, in a relational database query, one or more pending events corresponding to one or more customers accessing the service before the customer. Additionally, the method includes processing, in the relational database query, the service access event. Processing the service access event occurs after processing the one or more pending events. The method also includes providing a result for the relational database query. The result comprises the trajectory, and the one or more trajectories.

Generating discrete event simulation data

A method is described for forming a permanently supported thin lamina using decomposable adhesives between a lamina and a temporary support element. The temporary support element may be bonded to a first surface of the lamina. A permanent support element may be applied to a second surface of the lamina, and the temporary support element debonded from the lamina by decomposing the adhesive.

Method of forming a permanently supported lamina

A method for product portfolio analysis includes selecting a set of solution points along a curve of order benefit as a function of the number of products in a product portfolio and performing a heuristic between an adjacent pair of solution points that approximates the curve between the adjacent pair of solution points. An apparatus that can perform the product portfolio analysis is also described.

Method and apparatus for product management

A microwave radio terminal capable of multiple gigabits/sec bit rate is provided. The radio terminal may use QAM modulation, including the two lowest modulation formats of BPSK and QPSK. The serial bit stream, including forward error correction (FEC) and all other overhead, is prepared in a digital circuit, such as a filed programmable gate array (FPGA) and is output serially, using SERDES devices inside the FPGA, as two separate channels known as 'I-channel' and 'Q-channel'.

Digital microwave radio link with a variety of ports

A digital microwave link and system are provided that has an adaptive data rate.

Digital microwave radio link with adaptive data rate

Embodiments include methods, apparatus, and systems for using range queries in multidimensional data in a database. One embodiment is a method that defines a query box from a search for multidimensional data in a database. The method examines an intersection between a Z-interval and the query box by decomposing the Z-interval into hyper-boxes that are also Z-intervals in Z space. Items in the query box that match the search are discovered.

Methods and apparatus using range queries for multi-dimensional data in a database

A method is disclosed that includes computing, using at least one uniformly fine-grain data parallel computing unit, a mean-square error regression within a regression clustering algorithm. The mean-square error regression is represented in the form of at least one summation of a vector-vector multiplication. A computer program product and a computer system are also disclosed.

Growing community of inventors

Fremont, CA, United States of America

Bin Zhang