263 results about "Numbering scheme" patented technology

A network device includes a first switch, a second switch, address resolution logic (ARL), and a CPU. The first and second switch having a groups of ports which are a subset of the plurality of ports and are numbered by a different numbering schemes. The CPU coupled to the first switch and the second switch and configured to control the first switch, the second switch, and the ARL. A first link port of the first group of ports is coupled to a second link port of the second group of ports. The ARL is configured to perform address resolution based on the first and second numbering schemes such that when the first network port a data packet received at the first network port destined for the second network port is directly routed from the first network port to the second network port.

A distributed computing system, having a sufficient number of devices and requiring a sufficiently large number of devices to select any proposal, can maintain synchronization between its constituent devices and respond to client requests with as few as two message delays. A leader can synchronize the devices of the system and establish a safe proposal number for all current and future steps of the system. Devices can then receive client requests directly, treating the request as a proposal having the proposal number determined previously by the leader, and voting for the proposal. If the client receives an indication from a least a quorum of devices, where a quorum can be the minimum number of devices that can be operational at a given time, the client can know that the request was selected. If two or more clients attempt to request different functions at approximately the same time, the system may not select either request, in which case a leader can be requested to determine if any requests may have been selected, and to reestablish a safe proposal number. Systems with fewer devices can also implement the message-delay-reducing algorithm if they can also revert to the standard Paxos algorithm if an insufficient number of devices are operational. Such algorithms can be used to provide an efficient method for determining whether to commit or abort a client transaction.

The invention discloses a user-oriented cloud storage data integrity protection method. The method includes the steps of 1, uploading, wherein a user side segments and numbers a file to generate intra-block redundancy check codes, the hash value of each file block is calculated and saved as a range-based 2-3 tree, the hash values are linked into one value and signed with private keys, and inter-block redundancy check codes are generated and encrypted with stream substitution secret keys; 2, verification, wherein a cloud management node sends a verification request to a corresponding cloud storage server, corresponding original data and algebraic signatures of the inter-block redundancy check codes corresponding to the original data are calculated and returned to the user side for data integrity verification, and the step 3 is executed if data destruction is found; 3, recovery, wherein the user side acquires all the file blocks on corresponding branch trees from a cloud side according to tree information and performs error recovery on the file blocks through erasure codes of the file blocks. According to the method, integrity verification and recovery are performed on the dynamic data stored in the cloud side from the user perspective.

Documents containing information about product offerings in various natural languages are passed through transitional translation layers which convert the data to a single computer language using a universal character set encompassing the character sets used in all supported natural languages. The documents are stored in their original natural languages and in English with documents segmented into components which components are identified by search terms arranged in a taxonomy tree based on product types. The names of the products in the national languages are added to the English language documents enabling quick keyword searches when the product name or number is known. A bi-directional inverted index is provided for access by the keyword search terms so that keywords with the same meaning in different languages are accessible together when the keyword in one of the languages is queried.

A system and method specifies batch execution ordering of requests in a cluster of storage systems or nodes. Each node is generally organized as a network element and a disk element. One or more sessions are established between the elements in the cluster. Each session comprises a plurality of channels disposed over connections, wherein each channel enables multiple requests to be sent over a connection. Each request is identified by a unique identifier (“request id”) that is generally defined as the combination of a channel number and a sequence number. The request id is extended to include a batch number that provides an execution ordering directive within a channel. All requests with the same batch number in a channel can be executed in arbitrary order or concurrently. Ordering is imposed only when the batch number changes, e.g., increases. Although more than one request in a channel can have the same batch number, all requests with the same batch number are executed before any request with a higher batch number.

When a television receiver is connected to a DVD player via an HDMI cable, HDMI authentication is carried out. EDID data is then acquired from the television receiver and a manufacturer name is determined. When the manufacturer name is determined to be, for example, “company A”, a table indicating a correspondence relationship of manufacturer names and remote control codes is referred to and remote control codes corresponding to the determined company A are selected. The selected remote control codes are then transmitted after selection of remote control codes of the company A is carried out. Remote control codes corresponding to the manufacturer name of the company A received from the DVD player are then stored in a memory in a manner corresponding to operation key numbers allocated in advance to a plurality of operation keys at a remote control unit.

A method for detection of page numbers in a document includes identifying a plurality of text fragments associated with a plurality of pages of a document. From the identified text fragments, at least one sequence is identified. Each identified sequence includes a plurality of terms. Each term of the sequence is derived from a text fragment selected from the plurality text fragments. The terms of an identified sequence comply with at least one predefined numbering scheme which defines a form and an incremental state of the terms in a sequence. A subset of the identified sequences which cover at least some of the pages of the document is computed. Terms of at least some of the subset of the identified sequences are construed as page numbers of pages of the document. Additional page numbers may be identified by considering one or more features of the terms in the subset of identified sequences.

A network device having a plurality of ports including address resolution logic (ARl), a first switch, a second switch, and a CPU. The first and second switches include groups of ports which are a subset of the plurality of ports and are numbered by different numbering schemes, rate control logic for performing rate control functions related to switching data packets between the network ports, and local communications channels for transmitting messages between the groups of ports and the rate control logic. The first switch is configured to generate a rate control message and relay the rate control message to the second switch, and the second switch is configured to generate a second rate control message based on the first rate control message, where the second rate control message is different than the first message.

The present invention relates generally to logical telephone numbers. In particular, dynamic number users are able to obtain dynamic numbers and to map those numbers to routable numbers of their choosing. The present invention provides a tool for protecting privacy while sharing and/or publicizing a number for public purposes. The present invention relates to a Dynamic Telephone Number Service (DTNS.) wherein users are provided with a logical temporary telephone number that is mapped dynamically to a physically addressable number. The use of the DTNS allows a dynamic number user to publish the logical number, thus avoiding the need to publish private information and phone numbers for public purposes. Further, the logical number is not permanently assigned, but rather is temporary and provided to the dynamic number user for a relatively short period of time.

A reminder system is provided. The system provides a user-friendly interface to a user's existing email, and in some embodiments to the user's document management, calendar and other systems, in order to ensure that an appropriate user is notified when action should be taken, and also provides notation to the user indicating the appropriate course of action to be taken. The system provides a calendaring feature where a supervisor or manager can determine the workload of a group of workers for an upcoming time period. The system provides an easily accessible and traceable database of information pertaining to a project checklist, document, a client name, a client matter number, a document type, or other customizable fields in order for a user to search and sort the information for their own use.

A system and method for managing logical versions of a filesystem made through a near-instantaneous copy process is provided. Each logical version of the filesystem, including the primary version, is assigned a unique epoch number or other identifying value, and each filesystem object is assigned two epoch numbers that define the space of logical versions for which the object exists. A list of all valid epoch numbers are maintained in a version table. The near-instantaneous creation of a logical version of the filesystem requires inserting a unique epoch number entry in the version table (106) and the next epoch number to the new logical version. An original state of the system is preserved through the use of a copy-on-write procedure for filesystem objects that are reference by that logical filesystem version (120). Accordingly, filesystem versions are maintained and original states of previous states of the logical filesystem versions are preserved.

A computer-implemented method for mapping between part numbers that are based on different part numbering schemes includes receiving a first part number associated with an item, the first part number associated with the item being defined according to a first part numbering scheme. A database is searched for one or more second part numbers that are associated with the item and also cross-referenced to the first part number associated with the item, the one or more second part numbers associated with the item being defined according to one or more corresponding second part numbering schemes. In response to identifying the one or more second part numbers associated with the item, a database is searched for a third part number that is associated with the item and also cross-referenced to at least one second part number associated with the item, the third part number associated with the item being defined according to a third part numbering scheme, the first part number associated with the item being mapped to the third part number associated with the item through the at least one second part number associated with the item.

A memory architecture is provided to enable parallel access along any dimension of an n-dimensional data array. To enable parallel access of s data elements along any dimension, the data elements of n-dimensional data array are mapped to s parallel memory banks in such a way that consecutive s data elements along any dimension are mapped to different memory banks. This mapping is defined by two functions, which define the memory bank number and location within a memory bank for each data element in n-dimensional data array. The necessary and sufficient conditions, which the mapping functions should satisfy in order to enable parallel data access, are described. These generic function pairs are described for all combinations of (n, s). Two particular instances of the mapping, namely circular permutation (rotation) along 0th dimension and dyadic permutation along 0th dimension have been discussed in detail. The mapping defined as dyadic permutation along 0th dimension holds only for values of s, which is integer power of 2. The mapping defined as circular rotation holds for any integer value of s. For these mappings, the basic architecture as well as its extensions are discussed. The basic architecture is for n-dimensional data array which has only s data elements along each dimension, whereas the extensions are for data arrays with m data elements along each dimension under the constraint that m is an integer multiple of s.

A communication system, such as a computer system, with a plurality of processing nodes coupled by communication links stores a database of abstract topologies that provides a node adjacency matrix and abstract routing between nodes. A breadth-first discovery of the actual communication fabric is performed starting from an arbitrary root node to discover the actual topography. A graph isomorphism algorithm finds a match between the discovered topology and one of the stored abstract topologies. The graph isomorphism algorithm provides a mapping between the ‘abstract’ node numbers and the discovered node numbers. That mapping may be used to rework the stored routing tables into the specific format needed. The computed routing tables are loaded into the fabric starting at the leaf nodes, working back towards the root node (i.e., start loading from the highest node number and work back to the lowest numbered node).

A computer based banking system is provided in which at least selected clients termed participating system members have access to a remote device adapted to communicate with the computer base banking system such that financial transactions can be conducted by remote operation of the remote device by the participating system member to result in the debiting of a financial data base record associated with an instructing participating system member and in the crediting of a different financial data base record. Each data base record is identified by a conventional account number generated to conform to banking numbering standards as well as a linked communication number different from the relevant bank account number and composed of at least two component strings of numbers and/or letters, one of which is a number regionally unique to the participating system member, and the other of which is a bank identifying number unique to the particular bank at least on a regional basis. The communication number preferably also includes the two digit international dialing code; the telecommunications area code or the mobile operator code; and a check digit.

The invention relates to a task scheduling method in a multi-core DSP system. A shared task pool is established in a shared memory in the multi-core DSP system, tasks are input into the task pool, the tasks are firstly classified into two categories of time-related and non-time-related, then each task is carried out the numbering, the time-related tasks have the same serial number, the non-time-related tasks are independently carried out the numbering, the initial states of the tasks with the different serial numbers are set as the non-locked states; and a task obtaining device of each idle slave core carries out the inquiry to the shared task pool and carries out the processing of the task after obtaining the task. The task scheduling method changes the technical proposal of using a main core for distributing tasks by the traditional multi-core DSP system and adopts the method of using the slave cores to actively obtain the tasks during the idle time, which can effectively reduce the requirements on the reliability of priori knowledge and reduce the load balance of the multi-core system.

For enabling a fast reverse lookup of parent directories storing records of hard links to a specified regular file, a file system manager maintains a hard link database (HLDB) storing information for addressing hard links to the regular files having multiple hard links. The HLDB contains a corresponding HLDB file for each regular file having multiple hard links. In a preferred implementation, the inode of each regular file stores the addressing information for one hard link to the regular file, a corresponding HLDB file stores the addressing information for other hard links to the regular file, each HLDB file is a directory accessed by invoking file system manager directory access routines, and the HLDB has a directory tree providing a multi-level hash index for searching the HLDB given the inode number of a regular file.

The embodiment of the invention discloses a file system. The file system comprises a superblock region, an index node region and a data block region, wherein the superblock region comprises at least two superblocks serving as search entrances of different attributes of a file; the index node region comprises attribute index entry lists corresponding to each superblock, and index nodes corresponding to each file stored in the data block region, wherein each attribute index entry list stores a corresponding relationship between file attributes and index node serial numbers; the index nodes store the file attributes and storage addresses; and each storage address points to a data block, storing the file, of the data block region. The invention also provides a method and a device for retrieving, writing, modifying or deleting the file. By using the file system provided by the invention, the problem that the file system in the prior art cannot provide a single retrieving mode of retrieving by taking a file name as an attribute is solved by providing different retrieving modes through the superblocks and the attribute index entry lists of the different attributes of corresponding file.

The invention discloses a matching method based on public transport IC card lines, and belongs to the field of public transport information treatment and integration. The method comprises the steps of matching public transport IC card line numbers, matching vehicle running directions, and judging bus getting-on station platforms based on cluster analysis; matching the non-matched lines for many times according to the public transport IC card station platform attribute, vehicle number and attribute of driver number; associating the line serial number with the vehicle serial number and the public transport scheduling information list in a many-to-one manner according to the card swiping time records of the data of a universal public transport card; performing cluster analysis for the card swiping data according to the card swiping time difference of different station platforms, and selecting a proper time difference threshold value; and identifying the bus getting-on station platforms according to the selection of time difference threshold value. The invention performs pre-treatment including filtration, integration and convention for IC card data, deeply excavates the data, and finally obtains the station platform passenger number of the line. The invention provides planning evidence for public transport designers and provides evidence of public transport operation policy for public transport managers.

The present invention relates to the field of data storage, and more particularly to a method, an apparatus, and an electronic device for building a file system in a key value storage system. In the method for building a file system in a key value storage system disclosed by the present invention, first directory sequence numbers corresponding to directory paths of all levels of directories are acquired, and keys corresponding to directories and files are then built according to the directory sequence numbers and files stored in all levels of directories; in this case, the directory sequence numbers in the Keys occupy small space, and each directory sequence number is unique without a phenomenon of any repetition, thereby effectively saving storage space; in addition, a directory Key corresponding to a directory is built according to the directory sequence number, and when a directory needs to be operated, the directory to be operated can be directly acquired according to the Key of the directory, so that the operation process is simplified.

A method and system for sequential ordering of missing sequence numbered information frames within a telecommunication system using selective reject (SREJ) frames is disclosed. Upon receiving a sequence numbered information frame from a transmit terminal, a receive terminal determines if it is out of sequence. If the sequence numbered information frame is out of sequence, the receive terminal further checks the sequence numbered information frame to see if a poll bit has been set. If the poll bit is not set, the sequence numbered information frame further checks to see if the sequence numbered information frame is new or retransmitted. If the sequence numbered information frame is new, a list of missing sequence numbers is constructed in ascending sequential order beginning with the missing sequence number one greater than the largest number in the receive queue and ending with N(S)-1. If the sequence numbered information frame is retransmitted, a list of missing sequence numbers is constructed in ascending sequential order beginning with the next smaller missing sequence number in the receive queue plus one and ending with N(S)-1. In either case the ascending sequential order is constructed with respect to the transmit window and the modulo 128 sequence numbering scheme of the LAPD protocol. Thereafter, a select reject frame (SREJ) is sent to the transmit terminal containing a list of the out-of-sequence numbered information frame(s) for re-transmittal.

Systems and methods for lottery-style games are disclosed. In one particular exemplary embodiment, a computer-implemented method may comprise: establishing an online game that is scheduled to have lottery drawings on a number of drawing days; accepting enrollment of a plurality of players in the online game, each player being assigned at least one unique identifier and being committed to participate in a plurality of the lottery drawings; receiving, from each player, a designated number of tokens to be entered for each unique identifier in each lottery drawing said player is committed to participate in, each designated number being at least one and up to a predetermined maximum; and executing the online game on each drawing day by conducting a drawing, from unique identifiers of the participating players, to select one winner and by providing a fraction of a jackpot to the selected winner based on a calculated proportional value.

An aspect of the invention is directed to a plurality of MDSs (metadata servers) in a distributed storage system which includes data servers storing file contents, each MDS having a processor and a memory and storing file system metadata. Directories of a file system namespace are distributed to the MDSs through referral directories referring to real directories using hash value of inode number of each of the referral directories. During a process to create a directory in the file system namespace, a first MDS dynamically creates a referral directory in the first MDS, and creates a real directory in a second MDS, the referral directory in the first MDS referring to the real directory in the second MDS by maintaining location information of the real directory in the second MDS, the real directory in the second MDS containing the file system metadata for the directory in the file system namespace.