58 results about "Unique element" patented technology

Modular data center containers with modular components suitable for use with rack or shelf mount computing systems currently use cooling methods that do not include economizers due to size constraints of structural steel support infrastructure associated with modular data centers and removable economizers to facilitate portability of modular data centers. The modules allows introduction of outside air to the cooling cycle with the unique elements embodied within airside economizer components. The modules in conjunction with the data center represents a new and useful process to allow the economizer elements to bring outside air into the modular data center cooling cycle.

An apparatus comprises a check bit encoder circuit and a check/correct circuit. The apparatus operates on encoded data blocks, wherein each encoded data block includes a data block, a first plurality of check bits, and a second plurality of check bits. The encoded data block is logically arranged as an array of R rows and N columns, and each of the N columns comprises data bits from a respective one of the plurality of components. The first check bits form a first column of the array, and each of the first check bits covers a row of the array. The second check bits form a second column of the array and are defined to cover bits in the array according to a plurality of check vectors. Each check vector corresponds to a different bit in the array and is an element of a Galois Field (GF(2^R)). The check vectors are derived from a plurality of unique elements of GF(2^R), each of which corresponds to a different column of the array. The check vector in row X of the column is the product, in GF(2^R), of the unique element for that column and alpha^X, wherein alpha is a primitive element of GF(2^R).

There is provided a method for secure communication between a secure hardware device connected to a computer and said computer,

said method comprising the steps of:

• a) defining a group of secret sets including at least two secret sets, each of which includes a secret and an assigned identifier,
• b) storing the group of secret sets in the secure hardware device in such a manner that the secure hardware device can retrieve the secret of any of said secret sets from the assigned identifier,
• c) selecting a first one of said secret sets and storing said selected first secret set in a first application,
• d) delivering the first application which includes the first secret set to a user who executes the first application on a computer being connected to the secure hardware device,
• e) wherein the first application defines a first session key and generates first session key indication data based on the first secret set, said first session key indication data including the identifier of the first secret set as the only element from the first secret set, and transmits said first session key indication data to the secure hardware device, which retrieves, as a first secret, the secret of the first secret set based on the identifier included in said first session key indication data, and further retrieves the first session key from said first session key indication data based on the first secret, so that for secure communication the first session key for encrypting and decrypting of data to be transmitted between the secure hardware device and the computer is shared.

A call processing architecture treats a call connection as having two halves an originating half and a terminating half. An agent is associated with each call half, the originating agent being assigned by a switching center of a telecommunications system to establish the originating half of a call. The originating agent interacts with a translator and router to process the dated digits for a call to route the call to a terminating agent, the terminating agent establishing the terminating half of the call to complete the call connection. An agent interworking protocol (AIP) provides a generic superset protocol containing the common elements and unique elements for all call types so that an originating agent converts its call messages to the AIP and is connected to a terminating agent via an AIP connector, the terminating agent converting the AIP formatted call messages to the native protocol of the terminating agent. Agents for different call types are each able to convert call messages to or translate call messages from the agents's unique protocol to the AIP format and each type of agent does not need to know the type of agent being connected to as communication with other agents is via the AIP.

Succinct data and index structures aim to maximize the efficiency of update and search operations on any data while setting the constraint of storage size to be close to the theoretical optimum. The succinct index structure of the invention indexes data represented in a hierarchical structure. The index is comprised of a symbol table of all distinct root-to-leaf paths as keys or unique element tag names as keys, wherein an entry for a key in the symbol table holds transformed topological information of nodes associated with the key together (FIG. 22) with an indication of the method of transformation used on the topological information (FIG. 17), and wherein the method of transformation used is based on the topological relationship between nodes that are associated with the key. The invention also concerns methods, computer systems and computer software for constructing, using and updating the succinct index structure.

A safe and fun exercise and walking-training apparatus and method that is ideal for infants in the approximate age range of 10 months to 18 months is disclosed. The apparatus is lightweight, very sturdy, very simple, consisting of only six unique elements, and may be assembled and disassembled by hand without tools. A system of attachable play features is also disclosed.

Systems and methods for performing latency-free database searches using two-level indexed data structures having decreasing integer sets as identifiers to represent actual data. The indexed data structures are stored in distributed memory. Data operations such as intersection and union are performed using the indexed data structures. A binary interval reduction technique is used to quickly move through the data sets looking for common elements for the intersection set, or unique elements to add to the union set.

Systems and methods for performing latency-free contact searches using two-level indexed data structures having decreasing integer sets as identifiers to represent actual contact data. The indexed data structures are stored in distributed memory. Data operations such as intersection and union are performed using the indexed data structures. A binary interval reduction technique is used to quickly move through the data sets looking for common elements for the intersection set, or unique elements to add to the union set.

Certain example embodiments relate to systems and/or methods for identifying corresponding elements in different models (e.g., two or more different models), where multiple non-unique elements are connected with one another. The techniques of certain example embodiments are suitable for comparing the different models and identifying corresponding elements, regardless of whether the different models are different versions of one another, represent transformed and/or merged models, and/or were copied and subsequently modified from a source model. The techniques also advantageously leverage a more deterministic approach that is more consistent across different comparisons and when the source and target models are swapped.

A method of creating font format data from source font data includes analyzing the source font data to obtain glyph data for a plurality of glyphs, dissecting the glyph data, extracting midline data from the dissected glyph data, classifying the midline data as unique element data and common element data, associating unique element data and common element data to each glyph of the plurality of glyphs.

A method for preventing malicious code being embedded within a scripting language of a web application accessed by a web browser (308), the method comprising: monitoring all incoming traffic (310), generated by the web browser, and outgoing traffic (326) generated by a server (318) to form monitored traffic; determining whether a unique element, defined in a configuration file, is matched with an input value of the monitored traffic to form a matched input value; responsive to a determination that the unique element is matched with an input value of the monitored traffic, saving the matched input value, determining whether an output contains the matched input value in an expected location; responsive to a determination that the output contains the matched input value in an expected location, encoding the matched input value using a respective definition from the configuration file; and returning the output (330) to the requester.

A closed end financial instrument for the monetization of greenhouse gases is disclosed. The closed end security has unique features providing for the securitization of greenhouse gas reductions (e.g., avoidance, sequestration, transformation) on global and sub-global scales. A universal carbon index based on the computed value for metric tons fossil fuel derived CO₂ from measurements of the carbon 14 isotope, directly linked to fossil fuel emissions, is also disclosed. The 14C based universal index provides a unique and novel market mechanism to value and track fossil fuel carbon across all reduction genres and measurement platforms. Sub-global indexes for 14C and other GHGs representing partial carbon budgets for specific regions are accounted for within the global budget. The global and sub-global GHG indexes may operate in real time across all GHG currency transactions constituting a live GHG trading regime. An asset allocation system, based on trace gas emissions over small to large scales is also disclosed providing a means to manage and reduce GHG emissions with market-based risk assessment versus return and modern portfolio theory paradigms. Features such as small, mid and large, growth and value are applied to GHG reduction efforts by trace gas type. The unique elements of financial mechanism, global and sub-global carbon indexes and asset allocation options provide a means to manage, reduce and monetize the burden of GHGs to the atmosphere and resultant global warming.

The invention discloses a method for coding XBRL (extensible business reporting language) elements. The method includes setting element codes for the elements; creating coding label link libraries; setting the coding label link libraries as link library files which can be cited by XBRL taxonomy schema files. The coding label link libraries contain coding labels of the various elements, and values of the coding labels are the element codes of the elements. The method has the advantages that the unique element codes which contain taxonomy information, serial numbers and technological type information are provided for the various elements in XBRL taxonomy and are published and demonstrated along with the elements, so that information disclosure persons and information disclosure organizations can manage the elements by the aid of computers in a unified manner, and data exchange can be facilitated; global indexes are created, so that the element service and management efficiency can be improved, and social resources can be saved; users can acquire additional information from the element codes so as to easily understand and identify the elements.

A game court and method of play are provided which allow players to compete and score points by throwing a ball through their opponent's goal or throwing the ball and hitting their opponent. The game provides a court bound on all sides to facilitate retention of balls during game play and features an opaque dividing fence which splits the court into two halves each occupied by a different team. The fence is oriented such that each team has on its side of the fence an area of the court protruding past the midpoint of the court. The configuration and orientation of the dividing fence creates unique elements of strategy including the possibility that players from one team may attempt to score points from a position behind players of the opposing team.

The invention describes a surface covering that comprises modules, made up of elements with irregular undulating edge, imitating natural warping of wood. At least one element with irregular undulating edge of a module is unique and an element with at least one irregular undulating edge can be matched, according to the predefined specification, side to side, with at least one adjacent element with irregular undulating edge. Unique element of each module, featuring at least one irregular undulating edge, will be interchangeable with the unique element with an equivalent irregular undulating edge that forms a part of another module. Modules can be matched mutually, at horizontal plane, to the shape of irregular undulating edge of the outmost element of module, at least in part, according to the predefined specification, given above; the modules can be also matched to each other at ends, according to the predefined specification, thus forming a repeating pattern.