| Patent application number | Description | Published |
|---|
| 20080246362 | Radial airgap, transverse flux machine - A radial gap, transverse flux dynamoelectric machine comprises stator and rotor assemblies. The rotor assembly comprises at least two axially spaced, planar rotor layers having equal numbers of magnetic poles of alternating polarity disposed equiangularly about the rotor peripheral circumference. A magnetically permeable member optionally links adjacent rotor magnets. The stator assembly comprises a plurality of amorphous metal stator cores terminating in first and second polefaces. The cores are disposed equiangularly about the peripheral circumference of the stator assembly with their polefaces axially aligned. Respective first and second polefaces are in layers radially adjacent corresponding rotor layers. Stator windings encircle the stator cores. The device is operable at a high commutating frequency and may have a high pole count, providing high efficiency, torque, and power density, along with flexibility of design, ease of manufacture, and efficient use of magnetic materials. | 10-09-2008 |
| 20090072639 | Segmented composite rotor - A composite rotor for an axial airgap, permanent magnet dynamoelectric machine comprises a plurality of magnet subassemblies adhesively bonded together to form the rotor. Each magnet subassembly comprises a rotor permanent magnet and an optional spacer. A fibrous belt is wrapped around the periphery of each subassembly to provide high tensile strength at least along the radial sides of the subassembly. The belt is preferably infiltrated with an adhesive agent, such as an epoxy resin, that is used to bond the subassemblies. The rotor is thereby provided with high strength and low mass, making it suitable for use in a high-speed, high pole count electric machine. | 03-19-2009 |
| Patent application number | Description | Published |
|---|
| 20080235307 | LOCALITY WITH PARALLEL HIERARCHICAL COPYING GARBAGE COLLECTION - Disclosed is a garbage collection algorithm that achieves hierarchical copy order with parallel garbage collection threads. More specifically, the present invention provides a garbage collection method and system for copying objects from a from-space to a to-space. The method comprises the steps of (a) having multiple threads that simultaneously perform work for garbage collection (GC), (b) examining the placement of objects on blocks, and (c) changing the placement of objects on blocks based on step (b). Preferably, the method includes the additional step of calculating a placement of object(s) based on step (b), and using the result of the calculation for step (c). For example, the calculation may be used to increase the frequency of intra-block pointers and/or to increase the frequency of siblings on the same block. | 09-25-2008 |
| 20080235308 | LOCALITY WITH PARALLEL HIERARCHICAL COPYING GARBAGE COLLECTION - Disclosed is a garbage collection algorithm that achieves hierarchical copy order with parallel garbage collection threads. More specifically, the present invention provides a garbage collection method and system for copying objects from a from-space to a to-space. The method comprises the steps of (a) having multiple threads that simultaneously perform work for garbage collection (GC), (b) examining the placement of objects on blocks, and (c) changing the placement of objects on blocks based on step (b). Preferably, the method includes the additional step of calculating a placement of object(s) based on step (b), and using the result of the calculation for step (c). For example, the calculation may be used to increase the frequency of intra-block pointers and/or to increase the frequency of siblings on the same block. | 09-25-2008 |
| 20080250089 | IMPROVING LOCALITY WITH PARALLEL HIERARCHICAL COPYING GARBAGE COLLECTION - Disclosed is a garbage collection algorithm that achieves hierarchical copy order with parallel garbage collection threads. More specifically, the present invention provides a garbage collection method and system for copying objects from a from-space to a to-space. The method comprises the steps of (a) having multiple threads that simultaneously perform work for garbage collection (GC), (b) examining the placement of objects on blocks, and (c) changing the placement of objects on blocks based on step (b). Preferably, the method includes the additional step of calculating a placement of object(s) based on step (b), and using the result of the calculation for step (c). For example, the calculation may be used to increase the frequency of intra-block pointers and/or to increase the frequency of siblings on the same block. | 10-09-2008 |
| Patent application number | Description | Published |
|---|
| 20110247007 | OPERATORS WITH REQUEST-RESPONSE INTERFACES FOR DATA STREAM PROCESSING APPLICATIONS - Processing streaming data in a data processing system is facilitated by: declaring and defining, by a processor, a request-response interface as part of a stream processing operator defined using a stream processing language; processing a stream of data using the stream processing operator with the request-response interface defined as a part thereof; and communicating with the stream processing operator through the request-response interface via a communication path separate from the stream of data, the communicating accessing or controlling a state of the stream processing operator while the stream processing operator is processing the stream of data. | 10-06-2011 |
| 20110295939 | STATE SHARING IN A DISTRIBUTED DATA STREAM PROCESSING SYSTEM - State sharing is facilitated in stream processing environments, including distributed stream processing environments. A customized shared state implementation representing the state to be shared is automatically created based on at least one of user preferences, hints of usage, and system performance. | 12-01-2011 |
| 20120059839 | PROXYING OPEN DATABASE CONNECTIVITY (ODBC) CALLS - An Open Database Connectivity (ODBC) proxy infrastructure to transparently route incoming queries to one or more selected query engines. The ODBC proxy receives a query from an application, and determines based on the characteristics of the query and the capabilities of the query engines which one or more query engines are to perform the query. The proxy then routes the query to the one or more query engines, which perform the query. The results are then returned to the proxy, which provides the results to the application. | 03-08-2012 |
