517results about How to "Short delay" patented technology

Three-dimensional (3D) integration schemes of fabricating a 3D integrated circuit in which the pFETs are located on an optimal crystallographic surface for that device and the nFETs are located on a optimal crystallographic surface for that type of device are provided. In accordance with a first 3D integration scheme of the present invention, first semiconductor devices are pre-built on a semiconductor surface of a first silicon-on-insulator (SOI) substrate and second semiconductor devices are pre-built on a semiconductor surface of a second SOI substrate. After pre-building those two structures, the structure are bonded together and interconnect through wafer-via through vias. In a second 3D integration scheme, a blanket silicon-on-insulator (SOI) substrate having a first SOI layer of a first crystallographic orientation is bonded to a surface of a pre-fabricating wafer having second semiconductor devices on a second SOI layer that has a different crystallographic orientation than the first SOI layer; and forming first semiconductor device on the first SOI layer.

A mobile payment platform and service provides a fast, easy way to make payments by users of mobile devices. The platform also interfaces with nonmobile channels and devices such as e-mail, instant messenger, and Web. In an implementation, funds are accessed from an account holder's mobile device such as a mobile phone or a personal digital assistant to make or receive payments. Financial transactions can be conducted on a person-to-person (P2P) or person-to-merchant (P2M) basis where each party is identified by a unique indicator such as a telephone number or bar code. Transactions can be requested through any number of means including SMS messaging, Web, e-mail, instant messenger, a mobile client application, an instant messaging plug-in application or “widget.” The mobile client application, resident on the mobile device, simplifies access and performing financial transactions in a fast, secure manner.

A method and device that interrogates the availability of a called party before placing a communication from the calling party to the called party. A callback may be initiated so that both communications are completed simultaneously. The routing of communication may take place through any one of a number of different networks and at another time of the day, even if the caller does not otherwise have access to those networks.

A system and process for controlling the coding bit rate of streaming media data is presented where a server streams data that exhibits one of a number of coding bit rates supported by the server. Initially, the server chooses the coding bit rate. However, after this startup period, the client provides coding bit rate requests. The server transmits the streaming media data at the most appropriate supported coding bit rate closest to the rate requested. The coding bit rates requested are those estimated to provide a high quality playback of the streaming data while still keeping a decoder buffer of the client filled to a desired level. A leaky bucket model is incorporated so that the changes in buffer duration due to natural variation in the instantaneous coding bit rate are not mistaken for changes in buffer duration due to network congestion.

Bi-ventricular cardiac pacing systems and systems for improving cardiac function for heart failure patients that pace and sense in right and left ventricles of the heart and particularly pace in one of the right and left ventricles after an AV delay timed from a preceding atrial event and after a spontaneous depolarization in the other of the right and left ventricles to achieve fusion pacing. An A-RVp delay and an A-LVp delay are each determined from an intrinsic sensed A-RVs delay and an intrinsic A-LVs delay. If the derived A-LVp delay becomes substantially equal to or shorter than the intrinsic A-RVs delay, then the A-RVp delay is decremented to be shorter than the A-LVp delay. Bi-ventricular pacing of the RV and LV is then established closely timed to the intrinsic RV and LV depolarizations.

A mobile payment platform and service provides a fast, easy way to make payments by users of mobile devices. The platform also interfaces with nonmobile channels and devices such as e-mail, instant messenger, and Web. In an implementation, funds are accessed from an account holder's mobile device such as a mobile phone or a personal digital assistant to make or receive payments. Financial transactions can be conducted on a person-to-person (P2P) or person-to-merchant (P2M) basis where each party is identified by a unique indicator such as a telephone number or bar code. Transactions can be requested through any number of means including SMS messaging, Web, e-mail, instant messenger, a mobile client application, an instant messaging plug-in application or “widget.” The mobile client application, resident on the mobile device, simplifies access and performing financial transactions in a fast, secure manner.

Decoder retrieval timing information, ROI information and tile identification information are conveyed within a video data stream at a level which allows for an easy access by network entities such as MANEs or decoder. In order to reach such a level, information of such types are conveyed within a video data stream by way of packets interspersed into packets of access units of a video data stream. In accordance with an embodiment, the interspersed packets are of a removable packet type, i.e. the removal of these interspersed packets maintains the decoder's ability to completely recover the video content conveyed via the video data stream.

A system and method for supporting handovers between different radio access technologies is provided. A method for communications device operations includes sending a request to a controller of the communications device to change an operating mode of the communications device, and receiving a transmission responsive to the request. The method also includes in response to determining that the controller has granted the request to change the operating mode and that the communications device is operating in a border cell, changing the operating mode of the communications device, tuning at least one receiver of the communications device to an alternate radio access technology (RAT), and initiating a handover with the alternate RAT.

A system and process for controlling the coding bit rate of streaming media data is presented. This coding bit rate control involves dynamically adjusting the coding bit rate to control client buffer duration to prevent the buffer from underflowing, while keeping the average coding bit rate close to the average transmission bit rate of the network (an thus maximizing the quality of the data playback). Using the theory of optimal linear quadratic control, the client buffer duration is kept as close as possible to a target level while still keeping the coding bit rate (and hence the quality) as constant as possible. In addition, a leaky bucket model is incorporated into the control loop so that the changes in buffer duration due to natural variation in the instantaneous coding bit rate are not mistaken for changes in buffer duration due to network congestion.

The present invention relates to an architecture for stack robust fine granularity scalability (SRFGS), more particularly, SRFGS providing simultaneously temporal scalability and SNR scalability. SRFGS first simplifies the RFGS temporal prediction architecture and then generalizes the prediction concept as the following: the quantization error of the previous layer can be inter-predicted by the reconstructed image in the previous time instance of the same layer. With this concept, the RFGS architecture can be extended to multiple layers that forming a stack to improve the temporal prediction efficiency. SRFGS can be optimized at several operating points to fit the requirements of various applications while the fine granularity and error robustness of RFGS are still remained. The experiment results show that SRFGS can improve the performance of RFGS by 0.4 to 3.0 dB in PSNR.

In an adaptive device and an adaptive method for adapting the stomach opening of a patient, a gastric band having a non-elastic back part on the exterior and a first expandable chamber on the interior are placed around the stomach of the patient for adapting the stomach opening, and the stomach opening of the patient is adapted by modifying the amount of fluid in the first expandable chamber. For this purpose, the adaptive device includes a second expandable chamber, so that the second expandable chamber is connected to the first expandable chamber, and whereby the fluid is displaced from the one expandable chamber to the other expandable chamber in order to modify the stomach opening of the patient. The adaptive device can in particular be controlled by changing the position of the body of the patient.

A system and process for performing an exponentially weighted moving average on streaming data to establish a moving average bit rate of data units is presented. In general, the system or process computes, on a unit-by-unit basis, the product of the moving average bit rate computed for a data unit immediately prior to a unit under consideration and a first fractional weighting factor, added to the product of the instantaneous bit rate of the data unit under consideration and a second fractional weighting factor, wherein at least one fractional weighting factor is not a constant but instead based on the time between data units.

A method for calculating a timeout parameter in a communication session, comprises the steps of initiating a session; calculating a throughput of the connection during initialisation of the session by measuring a time span between sending and receiving a data packet on a target communication device 101 including a fixed computational time delay of the initiator communication device 102, wherein the packets are smaller than a maximum packet size; calculating a maximum round trip time for the maximum data packet that is possible to be sent and received based on the calculated throughput; and setting a session timeout parameter equal to the calculated maximum round trip time.

The invention discloses a modeling and optimizing method for AGV dispatching management, and belongs to the technical field of AGV operation dispatching. The objective lies in providing the modeling and optimizing method for AGV dispatching management, and the method not only can achieve no-collision operation, but also can improve the overall operation efficiency of a system through obtaining an optimal path. The method comprises the following steps: 1, carrying out the network modeling of an AGV operation path; 2, storing a path network map; 3, carrying out the binary modeling of a multi-AGV system; 4, carrying out dynamic path optimization of local search. The method is suitable for the dispatching management and path planning optimization of AGV operation in a multi-AVG dispatching management system.

The present invention provides a cluster load balancing method transparent to an operation system. Main functional modules comprise a load balancing module, a processor migrating module and a communication module. The method is characterized by comprising the following steps: 1, driving a virtual processor to migrate; 2, driving balance migration; 3, sending a migrating request to a target node and negotiating; 4, storing and restoring a state of the virtual processor; and 5, communicating. The method better solves the problem of low resource utilization rate of a cluster system. Along with the development of more popularization of the cluster system and the continuous development of hardware virtualization technology in the future, the method can be a good solution for the low resource utilization rate of the cluster system and has good application prospect.

A method and system for erasing a page in a flash memory system including a CPU (11), a flash memory (12) including an array of flash memory cells (1), a flash memory controller (12A) coupled to the flash memory (12) and also coupled by a memory bus (19) to the CPU (11) operate the CPU (11) in response to a page erase signal produced during execution by the CPU (11) of a user application program to erase a page of the flash memory by causing the CPU (11) to generate a first incremental erase interval of substantially shorter duration than a total erase time required to erase the flash memory, cause the memory controller (12A) to take control of the memory bus and apply erase signals to the flash memory cells of the page during the first incremental erase interval, and cause the CPU (11) to take control of the memory bus (19) after the first incremental erase interval and execute a pending task. This procedure is repeated for a plurality of additional incremental erase intervals, respectively, the cumulative amount of time of all of the incremental erase intervals being sufficient to result in erasure of the page with a determined retention time.

The efficiency of transmitting lower priority data traffic along with higher priority traffic is improved by segmenting a data packet in such a way so as to reduce transmission delay of the higher priority traffic. The data packet is segmented so that all its segments, including the last segment, are approximately the same size. The segment size is set smaller than a maximum permitted segment size. Indeed, it is desirable (though not necessary) to set the segment size as small as design parameters, (e.g., minimize segment header overhead), allow in order to reduce transmission delay of the higher priority traffic. Because the last segment is set at the same size or a larger size than the other segments, delay in transmitting the data packet is also reduced. The last segment may be sized as large as practical to minimize the transmission delay of the data packet. Once segmented, the data packet segments are transmitted along with the higher priority traffic.

The present invention discloses a data protection transmission method for peer-to-peer network. The method has an encryption server arranged in a peer-to-peer network, and comprises following the steps that: A. a data publication party sends data needing to be published to the encryption server; B. the encryption server encrypts the data needing to be published, saves a corresponding key and returns the encrypted data to the data publication party; C. the data publication party publishes the encrypted data in different pieces; D. a data request client collects the published encrypted data pieces through the peer-to-peer network; the data request client acquires the corresponding key from the encryption server and decrypts the collected encrypted data pieces according to the key. The present invention can be applicable to the characteristics of the peer-to-peer network, improve the data transmission security of the peer-to-peer network, prevent hackers from attacking the peer-to-peer network data and guarantee the rights and benefits of data owners and users.

The invention provides an anti-single-event-upset error checking and correction method for memory, which comprises: (1) receiving K-bit information data from CPU; (2) generating N-bit check data A corresponding to the K-bit information data; (3) storing the K-bit information data and the N-bit check data A to a memory; (4) reading the K-bit information data from the memory and regenerating a N-bit check data B corresponding to the K-bit information data; (5) performing XOR operation on the check data A and the check data B to obtain a corrector; and (6) locating error in the information data and the check data A by the corrector. If one or two bits of data error occurs, the data error is corrected and correct data is outputted; if two bits or testable more than three bits of data error occurs, the information that non-correctable error occurs is prompted. The method has strong error correction ability, simple operation, and one-bit or two-bit error of memory caused by single event effect is effectively corrected.

A method for withdrawing and filtering a partial volume of a particle-containing process fluid enclosed in a container, a combination of a container enclosing a process fluid and an assembly for continuously withdrawing and filtering a partial volume of a process fluid and a cross-flow filtering device are disclosed. The method, the assembly and the filtering device can be used in connection with biological process systems, in which the removal of sand, sludge, fibers and alike from partial volumes of the process fluid is necessary before additional filtration and subsequent sample analysis.

A method and apparatuses are disclosed for handling digital data packets at a logical borderline that separates an untrusted packet-switched information network from a protected domain. A packet processor part intercepts a packet that is in transit between the untrusted packet-switched information network and the protected domain. The packet is examined at the packet processor part in order to determine, whether the packet contains digital data that pertains to a certain protocol. If the packet is not found to contain such digital data, it is processed at the packet processor part. If the packet is found to contain digital data that pertains to said certain protocol, it gets redirected to an application gateway part that processes the packet according to a set of processing rules based on obedience to said certain protocol. The packet processor part is a kernel mode process running in a computer device and the application gateway part is a user mode process running in a computer device.

The subject invention provides a method of retrieving information (10) associated with an object (12) present in a media stream (14). The method includes the steps of accessing the information (10) during playback of the media stream (14) on any device and defining user-selectable regions (18) in a layer (20) separate from the media stream (14). The layer (20) is preferably a clear applet for receiving and storing the user-selectable regions (18). The defining of the user-selectable region (18) is performed without editing individual frames of the media stream (14). A link (34) is associated between the user-selectable region (18) and the information (10) associated with the object (12) to identify the location where information (10) associated with the object (12) is stored. In operation, the layer (20) is disposed adjacent the media stream (14) without interfering with playback of the media stream (14) in the player. During playback of the media stream (14), the user-selectable regions (18) are capable of being selected. Once the user-selectable region (18) is selected, the information (10) associated with the object (12) is then displayed.

The invention discloses wireless parallel test system and test method based on ZigBee, which relate to the technical field of test. The invention solves the problems of large field wiring construction amount and influence of a test signal by field wiring quality caused by the fact that the traditional test system acquires a test signal in a wire communication way. The test system forms a ZigBee network by adopting main wireless communication equipment and a plurality of wireless communication modules; the main wireless communication equipment is connected with a test control terminal by adopting a UART interface; and the wireless communication module in each kind of test equipment is connected with a built-in test module by adopting the UART interface. In the method for realizing test of the test system, the test control terminal is connected with the main communication equipment by the UART interface to realize the transmission of a test command and a test result, and the main wireless communication equipment and a plurality of kinds of equipment to be tested realize data communication by adopting the ZigBee network. The invention is suitable for a modern automatic test system, can realize the mutual coordination of hundreds of equipment to realize communication, and has high test efficiency.

Methods and devices are provided for use in streaming a Virtual Reality [VR] video to a VR rendering device. The VR video may be represented by a plurality of streams each providing different image data of a scene. The VR rendering device may render a selected view of the scene on the basis of a first subset of streams. A second subset of streams may then be identified which provides image data of the scene which is spatially adjacent to the image data of the first subset of streams, e.g., on the basis of spatial relation data. Having identified the second subset of streams, a caching of the second subset may be effected in a network cache which is comprised downstream of the one or more stream sources in the network and upstream of the VR rendering device. The second subset of streams may effectively represent a ‘guard band’ for the image data of the first subset of streams. By caching this ‘guard band’ in the network cache, the delay between the requesting of one or more streams from the second subset and their receipt by the VR rendering device may be reduced.

The invention provides a data writing technology. A first controller receives a first write request, which comprises a fist data, a first write address, and an LUN ID; the first controller requests to lock the write permission of the first write address in the LUN; after the first controller obtains the write permission of the first write address, the first controller writes the first data into the first controller according to the first write request and sends a first write sub-request to a second controller, wherein the first write sub-request carries the same content as that of the first write request; and after the first controller finishes writing the first data in the first controller and receives the response message that the first write sub-request is successfully written, the first controller releases the locked write permission of the first write address.

A concatenated encoder capable of coding multiple data bits in parallel and including a first (outer) encoder, a memory, and a second (inner) encoder coupled in cascade. The first encoder receives and codes M data bits in parallel in accordance with a first coding scheme to generate MR code bits. The memory receives and stores unpunctured ones of the MR code bits from the first encoder. The second encoder receives and codes N code bits in parallel in accordance with a second coding scheme to generate coded data. M and N can be any values (e.g., M>=8, N>=4). Each encoder can be a (e.g., a rate ½) convolutional encoder that implements a particular polynomial generator, and can be implemented with one or more look-up tables, a state machine, or some other design.

The present invention provides a method for establishing an inter-domain path that satisfies wavelength continuity constraint. The fPCE stores a virtual topology comprised by border nodes of all domains. The present invention uses parallel inter-domain path establishment method to decrease the influence from WCC. Compared with the sequential process way in prior art, it enhanced the resource utilization and decreased computation delay.