152 results about "Sequential allocation" patented technology

A method of managing rule entries of a Ternary Content Addressable Memory (TCAM) in a routing system includes: creating a hash table having a hash key corresponding to each entry; creating a single linked list for linking nodes, the single linked list using the entry of the hash table as a head node and including rule IDs and sequence IDs assigned according to a rule input order; and a double linked list having an independent head node, the double linked list bidirectionally linking the nodes constituting the single linked list according to an order of the sequence IDs. Thus, the packet classifying / filtering rule can be easily added to the TCAM or deleted from the TCAM only with minimal information. Also, the sequence ID reassignment process, required for storing as many rules in the TCAM as possible according to the priority of the rules, is performed when a certain time elapses following rule addition or deletion, thereby reducing a latency that may be caused upon setting the packet classifying / filtering rule.

A method and system are described for re-arranging a display in a viewable area. The method comprises dividing the viewable area into units; determining the contents of units of the viewable area; prioritizing the availability of the units by content; and allocating one or more display items in the prioritized available units. A plurality of display items is provided and the display items are allocated according to a determined order which may depend on one or more of a user preference, the contents of the viewable area, the activity of the user, and environmental parameters.

The use of music in connection with cancer therapy and other conditions is described. A computer-implemented method of modulating a mood in a person includes selecting an appropriate target mood, filtering a play list of music tracks based on an initial mood and vectoring by further filtering the play list to allocate the music tracks to play in order of appropriate stages creating a progressive modulation of mood from the initial mood to the target mood. A method of treating a patient with debilitating condition by administering to the patient a computer-implemented methodology is also provided.

The invention discloses a bus arbitration method and a bus arbitration device. The bus arbitration method comprises the following steps: the bus arbitration device regulates the each access request to obtain the priority of access authority according to the waiting time of each access request; wherein the priority distributed to the access request is raised as the increase of the waiting time of the access request; and the bus arbitration device distributes the access authority according to the access request priority sequence from high level to low level. The bus arbitration device comprises a priority regulation module and an access authority distribution module. With the method of the invention, the difference of access requests can be taken into account and the situation that the access request with the low priority cannot obtain the access authority can be avoided simultaneously so as to avoid the data overflow of the system buffer and enhance the system performance.

Systems and techniques are disclosed relating to management of a database. A method may include maintaining, by a computer system, a multi-tenant database operable to store a plurality of objects. Each object may be capable of including up to a maximum potential number of definable fields. Each field may have an associated index number that has been assigned sequentially. The method may include receiving user-defined data values for a subset of the maximum potential number of fields of a particular object, and storing, for the particular object, a boundary value indicating a range of index values that have been defined for the particular object. The method may further include, in response to determining that the particular object has been accessed, selectively processing a number of fields of the particular object. The number of fields may be determined based on the stored boundary value for the particular object.

A XLANG / s compilation method is provided that uses data flow analysis of a program's flow graph to determine lifetimes of a data object. A flowgraph is created according to abstract computer instructions. A depth-first order is assigned to basic blocks and a dominance relationship between the basic blocks is determined. A determination is made as to whether any loops are present within the flowgraph and, if so, the loops are identified. A creation point, destruction point and lock point for the data object is determined. Instructions are inserted into the computer code to create the at least one data object at the creation point, to destroy the data object at the destruction point and to lock the data object at the lock point.

A method for using resources in a multi-cell communication system is disclosed. The method includes dividing a frequency band used in the multi-cell communication system into a plurality of unit subchannels; and allocating the unit subchannels according to a sequence which is predefined in each cell in an allocation order of the unit subchannels depending on identifier information of the multiple cells.

A system and method for receiving and tracking a plurality of transactions and distributing the transactions to at least two replication queues over a network. The system and method comprise a global queue for storing a number of the received transactions in a first predetermined order. The system and method also comprise a sequencer coupled to the global queue for creating a copy of each of the transactions for each of said at least two replication queues and for distributing in a second predetermined order each said copy to each of said at least two replication queues respectively, said copy containing one or more of the received transactions.

A XLANG / s compilation method is provided that uses data flow analysis of a program's flow graph to determine lifetimes of a data object. A flowgraph is created according to abstract computer instructions. A depth-first order is assigned to basic blocks and a dominance relationship between the basic blocks is determined. A determination is made as to whether any loops are present within the flowgraph and, if so, the loops are identified. A creation point, destruction point and lock point for the data object is determined. Instructions are inserted into the computer code to create the at least one data object at the creation point, to destroy the data object at the destruction point and to lock the data object at the lock point.

Traditional systems and methods of billing for text messages for prepaid customers are improved by offering a service provider a series of features relating to intelligent and customized billing. These features include the ability to determine priority of messages sent for certain purposes such as SMS Voting, participating in contests, and other uses, and subsequently processing the billing requests generated by these messages in a dynamic manner in real time or close to real time through dynamic late-billing. The service provider has the option of arranging relevant billing requests in queues and queue groups, and allocating system resources for processing billing requests in order of priority. The end result is increased revenue for the mobile operator and greater customer satisfaction.

A method for transmitting / receiving resource allocation information in a mobile communication system using a shared control channel. The transmission method includes performing scheduling for resource allocation to a plurality of terminals; generating, in a bitmap, information indicating allocation / non-allocation of resources which are not sequentially allocated beginning from a particular terminal using the scheduling result; and transmitting, over the shared control channel, resource allocation information including a terminal identifier and a resource allocation bitmap of each terminal. The reception method includes receiving from a wireless network a shared control channel including resource allocation information; determining whether a terminal identifier included in the resource allocation information is equal to a terminal identifier of the terminal; and updating a size of an available resource set according to a resource allocation bitmap for reception of next resource allocation information, if the included terminal identifier is not equal to the terminal identifier of the terminal.

A method for providing broadcast service includes: (a) receiving schedule information for a multiple number of broadcast programs from a headend; (b) outputting a program selected by a user as a full screen; and (c) outputting a program navigation page by using the schedule information of the multiple broadcast programs if a pre-designated hand motion is detected. The program navigation page includes one of a category list page and a program list page, the category list page containing categories grouped according to use time, and the program list page containing programs belonging to each category. Depths are assigned in the order of the category list page, the program list page, and the A / V page, from higher to lower depths. A movement from a higher to a lower depth and a movement from a lower to a higher depth are performed via hand motions having different directionalities.

A memory system having a memory controller and several separate memory devices connected to the controller by a system bus. The memory devices each included an array of memory cells, addressing circuitry used to address the cells and an address storage circuit which stores a local address unique to each of the memory devices. The local addresses are sequentially assigned to the memory devices by selecting a first one of the devices and forwarding an address assign command to the selected device. A command decoder, having detected the address assign command, will permit a local address placed on the bus by the controller to be loaded into the selected memory device. This sequence will continue until all of the memory devices have been assigned local addresses at which time the memory devices can be accessed to perform memory read, program, erase and other operations.

According to an embodiment of the present invention, a filer or other storage server is coupled to a network to store files for users of the network. An agent is coupled to the filer, and performs a scan or file walk for a Multi-Appliance Management Application (MMA) which is coupled to the filer and can monitor and manage the filer. The agent assigns identification (ID) numbers to the directories while scanning them. The ID numbers are assigned in a depth first search (DFS) order to reduce the amount of resources required for specific queries that may later be required. Several types of queries, including determining the parent of a node, determining all of the children of a node, determining the immediate children of a node, and determining all of the ancestors of a node may be easily accomplished using the ID numbers.

This invention relates to a distribution and instruction method for system resources including: applying a resource DVRB continuous distribution method for the dispatched scattered UE from the given simple mapping from DVRB to PRB and indicating a first UE to occupy the start position of the DVRB and all UE to occupy the length of the DVRB when instructing each UE to distribute the resource, or distributing the continuous resource from long to short according to the length occupied by UE so as to minimize the spending of the DVRB resource distribution instruction signaling in the way of combined coding of control signaling of scattered users then to determine physical resource occupied by UE according to the mapping relation from DVRB to PRB.

An enclosed two-part computer controlled cyclical and sequential through-flow conveying, usage and metering System (200) is disclosed, for use in the electric vehicle motive power provision industries, for said two-part enclosed System to sequentially convey small-volume rechargeable Cell-Modules by sequential conveyor-means in a metered through-flow sequential conveying manner within said two-part System wherein the first part is a Stationary Part that includes a specially manufactured Cell-Module dispensing Bowser and a specially manufactured Cell-Module Charging-Bay and wherein the second part is a Movable Part that includes a specially manufactured or specially adapted Cell-Module powered electric Vehicle having a specially manufactured Cell-Module Chamber installed within.A Nozzle (3) and a Portal (4) respectively provide means for the Stationary Part and the Movable Part to exchange a choosable plurality of small-volume rechargeable Cell-Modules (100) and (500).A System (200) provides a succinct fully enclosed matingly-co-operative interconnection means for the System (200) to sequentially dispense Charged Cell-Modules and remove depleted Cell-Modules. The System also removes faulty Cell-Modules and if necessary extinguishes, and isolates for fire safety purposes, over-heating, deformed, or ignited Cell-Modules.The invention provides means that parallel, mimic or improve upon the metered bowser dispensing manner by which a choosable sequential plurality of small volumes of fossil fuel are sequentially delivered to a conventional fossil fuel vehicle by a dispensing bowser at a conventional fuel Service Station facility. The invention also provides optional means for Cell-Modules to be recharged in situ by use of a specially manufactured charger.

The present invention provides a method and device for resource allocation. The method is: if there are T remaining time-frequency resources of data transmission time (symbol) in the time domain range occupied by the previous type of downlink sub-transmission block, then Among the remaining time-frequency resources of T symbols, allocate time-frequency resources to the current type of downlink sub-transport blocks in a fixed order in the frequency domain direction; if the remaining time-frequency resources of the T symbols are not enough to allocate the current type of downlink The sub-transport block continues to allocate the time-frequency resources of the next T symbols to the current type of downlink sub-transport block in a fixed order in the frequency domain direction; the downlink sub-transport block uses T symbols as the smallest unit in the time domain, In the frequency domain, F subcarriers are used as the minimum unit, the number of symbols in the downlink frame is an integer multiple of T, and the number of subcarriers in the entire bandwidth is an integer multiple of F, thereby avoiding waste of time-frequency resources and simple implementation.

A resource allocation and scheduling method for a cellular communication system, which can avoid interference between cells. The method includes dividing the frequency band of the system into frames, each frame having a preferred allocation block and a general allocation block on the time axis; classifying the terminals in each cell into an interference-sensitive terminal group and an interference-insensitive terminal group the terminal group; and the resource is allocated by the terminal group according to the priority order assigned to the terminal group. The preferred allocated resources designed to be orthogonal to interfering cells, ie sectors, on the time axis are allocated to interference-sensitive terminals, and the remaining resources are allocated to interference-insensitive terminals.

A method and system for optimizing and issuing order allocations to the supply chain network for organizations with multiple continuous or semi-continuous production units; the uncertain parameters of each major component of the supply chain network, and the random nature of customer orders are accounted for through stochastic analysis. The application updates dynamically allowing changeable objective priorities so that users are provided real-time optimized order allocation decisions on the basis of current information.

The present description refers in particular to a computer-implemented method, a computer program product, and a computer system for processing and managing test data. The computer-implemented method for processing and managing test data may comprise:providing a plurality of questions for a test in a tool, the tool being located in a first shared folder;providing a data storage device on a second shared folder, wherein the data storage device comprises a plurality of database files, wherein each database file of the plurality of database files is assigned to a user name from a list of user names used to identify a plurality of users;retrieving date-times of time-stamps of the database files and assigning the date-times to the corresponding user names in the list of user names;if a user from the plurality of users accesses the test, providing a subset of questions from the plurality of questions to the user, wherein the subset of questions is randomly determined by making an order assignment to each of the plurality of questions, wherein the order assignment is based on random numbers associated with each of the plurality of questions;storing a test result of the test in a database file corresponding to a user name of the user; andupdating the time-stamp of said corresponding database file.

The invention relates to an internal memory releasing method for embedded real-time operating systems, portioning off a block of internal memory region in a system in advance; setting the region into K kinds of 2km memory pools; at the time of system initialization, establishing an index; when the programs need memory blocks, first search idle memory blocks in a description array: if there are idle memory blocks, allocating them to these programs in sequence; otherwise applying for memory blocks in the memory region in sequence; at the time of releasing memory, first obtaining the subscript of the index, and determine which memory pool the released memory block belongs to by the index; then further obtaining the position of the released memory block in a memory pool, and finally releasing the memory block. It can heighten the system efficiency and reduce the hazard of release error.

It's a kind of unbuffered memory dynamic distribution method in embedded real time operation system. It comprises the following steps: applying a large memory area to operation system in advance; setting this memory area as user reserved area; setting unbuffered description array; searching the unbuffered block that have released and free and identified as non-distribuion among the unbuffered description array, assignning to the required program in sequence; changing the memory identifier to assignned state in the unbuffered description array; searching the location of the memory block in the unbuffered description array and releasing; changing the memory identifier to unassignned state in the unbuffered description array. This invention resolvesthe problem of statistic operation and space wasting in previous algorithm. Its flexibility can fit embedded system with different scale.

A digital temperature sensor and a system and a method for measuring a temperature are provided. The system includes a reference signal generator including one or more resistance elements; a temperature sensor including a plurality of discrete resistance elements arranged parallel with one another; a multiplexer multiplexing the plurality of discrete resistance elements and the reference resistance element so that the plurality of discrete resistance elements sequentially distribute a power voltage together with the reference resistance element; a comparator having the voltages distributed by the reference resistance element and a discrete resistance element selected by the multiplexer; and a counter counting sequential switchings of the multiplexer. The counter information of the output level transit time of the comparator is provided to the controller, and the system obtains temperature information according to temperature change information from turn information of the discrete resistance elements according to the counter information.

The invention discloses a quick sorting method by grouping. The method includes the following steps: firstly, a scanning gun reads in and writes goods labels in a goods database in a computer; the computer reads goods priority level computation rules from a rule bank, allocates a delivery priority level for each piece of goods and writes the delivery priority level in a corresponding unit of the goods database; a vehicle team scanning gun reads in and writes vehicle labels in a vehicle team database in the computer; the computer reads the adaptive rule of goods in vehicles from the rule bank, inquires about goods matched with the driving path in the goods database and allocates the goods to vehicles according to the sequence of priority level; and the computer reads the goods numbers and corresponding license plate numbers in the goods database, the numbers are printed on delivery labels, and after taking out the labels from a printer, and workers attach the labels to the front of goods and arrange the goods by classification on the basis of destinations. Therefore, the matching of vehicles and goods is realized, the possibility of mixing goods and delivering wrong goods is eliminated and the utilization rate of vehicles is improved.

The invention discloses a method for planning frequency of an orthogonal frequency division multiplexing system. The method includes the following steps: (a) available spectrum resources in the orthogonal frequency division multiplexing system are divided into (number of base stations N multiplied by number of sectors per base station S) groups of carriers / sub-channels; (b) N carriers / sub-channels multiplexed in each sector in various base station are determined and priorities of the carriers / sub-channels in the corresponding sectors are determined, and the priorities of the same carriers / sub-channels in different sectors in the same base station are different; and (c) the available carriers / sub-channels are allocated in hi-low order of priority according to actual service quantity in various sectors. The method of the invention supports that multiplexing degree of the carrier / channel dynamically varies following system capacity, with the advantages of small co-channel interference and simple implementation. For the entire network, the frequency planning can be realized in one step and has stronger adaptability to the dynamic variation of coverage and capacity, and thus the network needs not to be configured once again when the service and the capacity of the network vary.

The present invention relates to a method for a page-level address mapping based on flash memory and a system thereof. A method for a page-level address mapping based on a flash memory according to an embodiment of the present invention includes the steps of: receiving a write operation from a file system; generating condensed mapping information using a size of data information of the write operation and a start logical address of sequentially allocated logical addresses of the write operation; and storing the condensed mapping information as a first mapping table in a memory of a flash translation.

A system and method for performing device-specific testing and acquiring parametric data on integrated circuits, for example ASICs, such that each chip is tested individually without excessive test time requirements, additional silicon, or special test equipment. The testing system includes a device test structure integrated into unused backfill space in an IC design which tests a set of dummy devices that are identical to a selected set of devices contained in the IC. The device test structures are selected from a library according to customer requirements and design requirements. The selected test structures are further prioritized and assigned to design elements within the design in order of priority. Placement algorithms use design, layout, and manufacturing requirements to place the selected test structures into the final layout of the design to be manufactured.