34results about How to "Avoid reallocation" patented technology

The invention relates to a method for reconfiguring a cellular radio network connection comprising a network part having a connection to a mobile station through at least one radio bearer. According to the invention, a first party of the connection, i.e. the network part or the mobile station, sends a second party of the connection, i.e. the mobile station or the network part, a reconfiguration request message concerning at least one radio bearer. The second party of the connection possibly replies to this by sending the first party of the connection a reply message to the radio bearer reconfiguration request message. The radio bearer reconfiguration request message comprises at least one radio bearer identifier and, for example, bearer quality of service of the radio bearer in question. The possible reply message comprises at least one radio bearer identifier and possibly also bearer quality of service assigned to the radio bearer in question, or a cause for a failed reconfiguration of the radio bearer in question.

A semiconductor device, methods for manufacturing the semiconductor device, and an integrated circuit including the semiconductor device are disclosed. The semiconductor device includes an LDMOS transistor and a MOS transistor, both formed simultaneously on a same substrate. The gate electrodes and the gate oxide layers of the LDMOS and the MOS are formed independently from one another. The source and drain regions of the LDMOS and the MOS are respectively formed in a self-aligned manner. In this way, the LDMOS and the MOS can be formed, in an effective manner, while sustaining the respective desired characteristics.

A data processing apparatus has processing circuitry for processing threads using resources accessible to the processing circuitry. Thread handling circuitry handles pending threads which are waiting for resources required for processing. When a request is made for a resource which is not available, a lock is set to ensure that once the resource becomes available, the resource remains available until the lock is removed. This prevents other threads reallocating the resource. When a subsequent pending thread requests access to the same locked unavailable resource, the lock is transferred to that subsequent thread so that the latest thread accessing that resource is considered the lock owning thread. The lock is removed once the lock owning thread is ready for processing.

A device for warming a human body. The device is a gown (100, 1500) that has a thorax portion (110, 1502) and a leg portion (112, 1504). One embodiment prevents redistribution hypothermia with a distributor (206) attached to the inside of the leg portion (112). The sleeves (108), leg portion (112), and posterior of the gown (100) are heat reflective. The anterior of the thorax portion (110) of the gown is non-reflective. The distributor (206) inflates when heated air is supplied and exhausts air into the gown (100). Temperature is maintained at a desired level for the extremities, while preventing the thorax area from being elevated to an uncomfortable level. Another embodiment is a perioperative warming device. The device is a gown (1500) that has a thorax portion (1502) and a leg portion (1504). Each portion has an independent air chamber and inlet. The two portions are releasably connected. The sleeves (1508), leg portion (1504), and anterior of the gown (1500) are heat reflective.

In a storage management system, a host recognizes a plurality of storage apparatuses as one virtual storage apparatus. The user divides each of the volumes that the storage apparatuses have into a plurality of classes in accordance with a policy. When a user specifies moving target data and a class or a policy of a moving destination, the data is reallocated to a class that meets it. The class or policy is held as a data allocation policy. If a sufficient empty space is not present in the moving destination class, by finding out from allocated data, data that also complies with a policy of other class, target data to be expelled and a class of expelling destination are determined for expelling data, so as to ensure a sufficient empty space for reallocation.

A driving method for a solid state image pickup device, having four or more transfer stages as one transfer unit, includes reading signal charge from the charge accumulation regions to the vertical charge transfer channels. The reading step includes (b-1) applying the barrier forming voltage to a first transfer electrode to form a barrier of at least one stage per the transfer unit; (b-2) applying the read pulse to a second transfer electrode to read signal charge from a corresponding charge accumulation region to a corresponding vertical charge transfer channel; and (b-3) applying a cancellation pulse to a third transfer electrode spaced by at least one transfer stage from the first transfer electrode, the cancellation pulse cancelling out a potential change in the charge accumulation region to be caused by the read pulse.

Provided a computer-implemented method for optimizing highly distributed charging stations efficiency and user experience, it is an objective of the present invention to optimally allocate charging stations. The objective is solved by the steps: a) receiving charging station data, the charging station data identifying one or more charging stations and charging station locations (lc1, lc2); b) receiving one or more requests (R) to charge one or more requesting vehicles, each request comprising data identifying a departure location (ls1, ls2) and an arrival location (le1, le2) of the respective requesting vehicle, being able to know feasible routes; c) receiving and / or determining detours data, the detours data indicating at least one charging station detour distance for a plurality of vehicles, the plurality of vehicles including the requesting vehicles; d) identifying charging station candidates for the requesting vehicles by optimizing an objective function (F) with linear constraints; and e) allocate at least some of the charging station candidates to the requesting vehicles; wherein optimizing the objective function (F) with linear constraints includes reducing a waiting time in the queue, price, a total detour distance for the requesting vehicles.

The present invention relates to a method for automatically allocating addresses for the same node on a communication bus, comprising: step S1, setting a global variable address allocation flag, initializing the address allocation flag as address unallocated, judging whether the address allocation flag of this node is unallocated, if not, Execute step S2, yes, execute step S3; step S2, judge whether the address of this node conflicts with the stored address, yes, execute step S3, no, execute step S5; step S3, assign the initial address to the node as the minimum address on the bus No. "1"; step S4, judge whether the address of this node conflicts with the stored address, if no, execute step S5, if yes, increase the address of this node by 1, and execute step S4 again; step S5, change the address assignment flag to address assigned , and remain unchanged. The present invention avoids address redistribution when the CAN bus is changed due to node movement, automatically rearranges repeated addresses in time, and avoids bus data errors caused by address repetition.