1549 results about "Buffer zone" patented technology

Described herein are semiconductor structures comprising (i) a Si substrate; (ii) a buffer region formed directly over the Si substrate, wherein the buffer region comprises (a) a Ge layer having a threading dislocation density below about 105 cm−2; or (b) a Ge1-xSnx layer formed directly over the Si substrate and a Ge1-x-ySixSny layer formed over the Ge1-xSnx layer; and (iii) a plurality of III-V active blocks formed over the buffer region, wherein the first III-V active block formed over the buffer region is lattice matched or pseudomorphically strained to the buffer region. Further, methods for forming the semiconductor structures are provided and novel Ge1-x-ySixSny, alloys are provided that are lattice matched or pseudomorphically strained to Ge and have tunable band gaps ranging from about 0.80 eV to about 1.4O eV.

The present invention relates to a method for scheduling data retransmissions, a method for use in a data retransmission scheme and a method for updating a soft buffer of a base station in a mobile communication system during a soft-handover. The present invention relates to a base station executing the controlling and updating method, a communication terminal for executing the scheduling method and to a mobile communication system comprising at least one the base station and communication terminal. To prevent erroneous combining of data packets in a packet retransmission scheme at the receiver, the present invention provides a method that may flush the soft bufferregion associated to areceived data packet upon its correct reception. Further, a method is provided that monitors the time elapsed since the last storing of a data packet in a buffer region of a base station to be able to trigger the flush of the buffer region upon expiry of a threshold time period.

A method and system are provided for counting moving objects in a digital video stream. In contrast to known computationally-expensive methods, areas of motion are determined by threshold subtracting a current video frame from a short term average video scene. An object box surrounding an object is determined by threshold subtracting the current video frame from a long term average video scene. Coordinates of the moving object are identified by associating the area of motion with the object box, if it overlaps the area of motion, to define a moving object box. An event counter can be incremented when the moving object box is in a buffer zone in the current frame, and was in a detection zone in an earlier frame, and was initially detected in a buffer zone on the opposite side of the detection zone.

An optical device includes at least one optical fiber cable receiving area for receiving at least one optical fiber cable, the receiving area being sized to receive a covering for covering at least a portion of the transition area, and at least one optical fiber cable transition portion disposed at the receiving area, the optical fiber cable transition portion being responsive to and supporting the covering when pressure from the covering is applied to the transition area and the covering and said transition area together form a buffer zone associated with at least a portion of the cable receiving area. Methods include providing a multi-port optical connection terminal having a stub cable port; connecting a stub cable assembly including a stub cable to the stub cable port; and forming a sloped buffer zone between the stub cable port and the stub cable to relieve stress in the stub cable.

A chemical vapor deposition method and apparatus is disclosed. The process is carried out in an apparatus having a number reactive zones, each surrounded by a corresponding exhaust zone, all of which are both contained within a buffer zone. Pressure relationships are controlled such that buffer gas from the buffer zone flows into the exhaust zones and reactive gas from the reactive zones flow into the exhaust zones. As a result, cross-contamination of gases between the reactive zones is avoided.

Interventional catheter assemblies that operate over a guide wire and incorporate guide wire management systems are disclosed. Specifically, a guide wire buffer zone is provided between a proximal end of the interventional catheter and the guide wire clamp that accommodates variable lengths of exposed guide wire in an unrestrained condition when the guide wire is clamped, allowing the distal end of the operating catheter to be advanced and retracted over the distal end of the guide wire without repositioning and reclamping the proximal end of the guide wire. The configuration of the guide wire buffer zone may be adjusted prior to or during an intervention based on the anticipated range of axial motion of the catheter and operating head relative to the guide wire.

The invention discloses a method for processing audio stream playback in the network terminal buffer zone for solving the problem of voice pausing and jamming in the network communication. The aim of the invention is achieved by performing real time audio (e.g. voice) communication on the packet-switching network (e.g. IP network), arranging a shake buffer zone on the receiving end, after the receiving end receives the audio package, it first performs decoding based on the normal sequence, then places it into the shake buffer zone, when the shake buffer zone is to be filled, lower the sampling rate to the audio data to realize the fast playback of the audio data stream, when the shake buffer zone is to be empty, raise the sampling rate to the audio data to realize the low speed playback of the audio data stream, when the audio data in the shake buffer is within the normal range, playback the audio stream with the original sampling rate.

The invention discloses a data storage method of a cloud storage system, which comprises the steps of: carrying out coding fragmentation on a file on the basis of a buffer zone erasure code technology to obtain data fragments and check fragments; processing the data fragments and the check fragments to obtain a check identification; storing the check identification in an index server; requesting storage resource information to the index server according to the quantity of the data fragments and the check fragments; sending the data fragments and the check fragments to a plurality of storage nodes according to the storage resource information; judging whether needing to carry out integrity check on the data fragments and the check fragments in the storage nodes; if needing to carry out integrity check on the data fragments and the check fragments in the storage nodes, sending the data integrity check information to the storage nodes, receiving an identification information set returned by the storage nodes, and judging whether data storage errors or data losses exist according to the identification information set, if yes, coding for recovering the data, and sending the recovered data to the corresponding storage nodes.

A method of reducing propagation of threading dislocations into active areas of an optoelectronic device having a III–V material system includes growing a metamorphic buffer region in the presence of an isoelectronic surfactant. A first buffer layer may be lattice matched to an adjacent substrate and a second buffer layer may be lattice matched to device layers disposed upon the second buffer layer. Moreover, multiple metamorphic buffer layers fabricated in this manner may be used in a single given device allowing multiple layers to have their band gaps and lattice constants independently selected from those of the rest of the device.

The invention provides a detector for binary-code buffer-zone overflow bugs, and a detection method thereof. The detector comprises six functional modules, namely a debugger module, an input point positioning module, a disassembling module, a symbolic execution module, a loop operation analysis module and an intelligent FUZZ test module. Differing from static symbolic execution, the detection method dynamically loads programs through the self-developed debugger module to synchronously performing symbolic execution and single-step practical execution, and then applies a model to solve each difficulty in binary code analysis so as to test path coverage and detect overflow bugs in accordance with all executable programs of PE format under a Windows platform. The detection can also provide propagation paths of input data and other important information related to bug formation cause while positioning the bugs, only analyzes the selves of the executable programs, needs no source codes, is unrelated to the species of source codes and development tools, and is extensive in applicable occasions, so the detection method has good prospects for popularization and application.

A method and system is provided to efficiently manage memory in a network device that receives packets of variable size. The memory is allocated into portions whereby each portion, comprising multiple equally-sized buffers, receives packets of a particular size. One portion is used for smaller packet sizes and another portion is for larger packet sizes, although other portions may be created. As packets are received at the network device, they are stored into the appropriate memory portion based on their size. The number of available buffers in each portion is monitored so that, when it falls below a threshold, buffers are reallocated to the other thereby increasing the overall memory efficiency.

A method to provide and implement a collision avoidance system for a vehicle. The method includes receiving a buffer zone boundary input defining a buffer zone at an on-board processor in the vehicle from a controlling supervisor, calculating a positively invariant set based on vehicle states and dynamic characteristics, the positively invariant set operable to define a protection zone enclosed within the buffer zone and centered about the vehicle, determining an object is traversing the buffer zone boundary; and implementing an emergency maneuver procedure after a collision avoidance maneuver fails, wherein the object does not enter the protection zone.

The invention provides a method for dispatching I / O of an asymmetry virtual machine based on multi-core dynamic partitioning, which comprises the following steps: when a system is started, firstly an I / O dispatching initialization module completes the configuration of dispatching parameters and the allocation of a buffer zone; subsequently, when the system runs, an I / O status monitoring and information processing module dynamically collects and processes the runtime parameters of driving Domain and customer Domain, carries out statistics on parameters such as types, time and frequency of happened I / O event, and then sends the statistics result to a dispatching decision module for judgment; and the dispatching decision module makes dispatching decision according to preset conditions, and gives out commands to a multi-core dynamic partitioning module to execute the operation of multi-core dynamic partitioning or recovering, thus changing the core partitioning mode and dispatching status of a processor of the system and leading the using mode of processor resources and the dispatching switching strategy of Domain to better adapt to I / O load requirements of the current system, and achieving the purpose of optimizing I / O performance.

A method, apparatus, and article of manufacture provide the ability to conduct global illumination. A three-dimensional (3D) model of a scene is obtained in a computer graphics application. A section of the scene is identified as a region of interest. A photon tree is then obtained that consists of a set of buffers that represents the region of interest, with every pixel in the region of interest necessary for every view being represented in at least one buffer in the set of buffers. The set of buffers are concatenated into a single large buffer. One or more full screen draw operations is performed over the single large buffer. The draw operation performs a lighting and optional shadowing operation on every pixel represented in the set of buffers. Any view of the region of interest is then displayed based on the lighting information thus incorporated into the photon tree.

This invention relates generally to the field of computer graphics display, and more particularly to reducing the amount of time needed to render complex virtual scenes on a computer graphics display. This invention combines the advantages of the prior art methods of list priority and depth buffering (e.g. Z-buffering) with new simplified and enhanced full buffer processes. In one embodiment, a simplified full buffer arrangement enables the elimination of rendering primitives prior to pixel shading for regions of the screen which have previously been covered by closer primitives. Another embodiment provides for an enhanced full buffer that combines the coverage of a previously rendered primitive in a partial buffer and associates it with a current primitive to cover pixel arrays. This enhanced full buffer technique enables the use of higher order model primitives such as strips, fans and meshes, to increase the effectiveness of the full buffer by allowing more than one primitive to combine to fill a scanned pixel region on the screen.

An optical device includes at least one optical fiber cable receiving area for receiving at least one optical fiber cable, the receiving area being sized to receive a covering for covering at least a portion of the transition area, and at least one optical fiber cable transition portion disposed at the receiving area, the optical fiber cable transition portion being responsive to and supporting the covering when pressure from the covering is applied to the transition area and the covering and said transition area together form a buffer zone associated with at least a portion of the cable receiving area. Methods include providing a multi-port optical connection terminal having a stub cable port; connecting a stub cable assembly including a stub cable to the stub cable port; and forming a sloped buffer zone between the stub cable port and the stub cable to relieve stress in the stub cable.

A buffer structure for storing symbols received via a number of (e.g., physical or transport) channels. Each channel is associated with a particular time interval (e.g., a radio frame period or a transmission time interval (TTI)) over which the received symbols are processed (e.g., interleaved). The buffer structure includes a buffer and an address generator. The buffer is partitioned into a number of sections. One section is assigned to each channel being processed. Each section can be operated as a circular buffer. The address generator provides addresses for writing symbols to the assigned sections. If the buffer structure is used for the transport channels, the sections can be assigned to the transport channels based on the associated TTIs (e.g., in descending order of TTIs). For each coded composite transport channel (CCTrCH), the transport channels in the CCTrCH can be assigned to sections defined starting from a respective initial location (e.g., the top or bottom of the buffer) and continuing along a respective direction of the buffer (e.g., downward or upward).

The invention relates to an object file organization method based on an object storage device, comprising the following steps of: establishing the layout of an object file system in a disk, loading information including object description, object bitmap and the like in a memory; detecting the size of the object file by a space allocator before allocating the space; if the size of the object file is acquired, adopting a pre-allocating method to allocate space for the object file on the disk; if the size of the object file can not be acquired, firstly writing part data of the object file into a buffer zone; detecting whether the buffer zone is fully filled or whether the client needs to release the caching data, allocating space for the data in the buffer zone on the disk, and writing the data into the disk; and when the data in the buffer zone is far larger than size of the logic data sub-block, allocating storage space for the data by the space allocator. The invention adopts the method of continuously allocating a plurality of data blocks, thus reducing the time for searching and allocating free blocks, and making up the limitation and disadvantage of object file system disk space allocation in the current distribution-type file system.

An apparatus and method are disclosed for maintaining free buffer information for a network switch. A first Random Access Memory (RAM), located on the network switch, functions to store values that indicate whether or not free buffers, located in a second RAM, are available for storing received data frames. An input logic is provided for placing values in the first RAM to indicate which free buffers are available for storing the data frames. When free buffers are required to store data frames, the output logic searches the first RAM and locates values that indicate available free buffers in the second RAM. The output logic then generates buffer pointers that address the locations of the free buffers in the second RAM. The buffer pointers that are generated are stored in a small capacity queue on the network switch to provide immediate availability to free buffers.

The invention relates to an automated system (1) for preparing parcels (100) of products, comprising: a storage assembly (2) housing product containers (7); a pick station (11); a main conveyor (12) which conveys the product container (7) between the inlet / outlet of the storage assembly (2) and the pick station (11); and a central management computer system (13) which manages the product order list associated with each parcel, said main conveyor (12) including means for arranging the containers (7) according to the order list, which means, in turn, comprise a first conveyor belt section (14), a second conveyor belt section (17) adjacent to the pick station (11) and a buffer zone between the outlet of the storage assembly (2) and the first belt section (14). The containers (7) are moved between the belt sections (14, 17) by transfer members in transfer zones (18, 181).

Said invention provides a method to realize time shifting function sow in network interactive tv ( IPTV ), system obtaining data from multicasting stream and putting in buffer zone , real time scanning buffer zone marking key frame. It promises a current system time reference time reference between Set-top box and stream medium server. When user given off skip forward, skip backwards, dragging, playing after pause etc request, set-top box exiting multicasting group, transmitting ordering request to stream medium server which responses request from set-top box and calculating time reference and client request required playing time difference finding out beginning playing position in buffer zone, then stream medium server relevant playing according to user different request, said invention can effectively complete skip forward, skip backwards, dragging time shifting function.

Aspects of the present invention generally relate to approaches for forming a semiconductor device such as a TSV device having a “buffer zone” or gap layer between the TSV and transistor(s). The gap layer is typically filled with a low stress thin film fill material that controls stresses and crack formation on the devices. Further, the gap layer ensures a certain spatial distance between TSVs and transistors to reduce the adverse effects of temperature excursion.

A graphical user interface displays a shape. Further, a buffer region that is adjacent to an edge of the shape is displayed at the graphical user interface. In addition, a set of drawing data located within the buffer region is received from a user input device. A first subset of the drawing data that is located in the buffer region at a predetermined distance from the edge and a second subset of the drawing data in the buffer region that is located at a distance from the edge that exceeds the predetermined distance are determined with a processor. Further, the first subset of drawing data is displayed. In addition, the second subset of drawing data is prevented from being displayed at the distance. The process also displays the second subset of drawing data at the predetermined distance.

One embodiment of the present invention sets forth a technique for rendering paths by first generating a stencil buffer indicating pixels of the path that should be covered and then covering the path. The paths may be filled or stroked without tessellating the paths. Path rendering may be accelerated when a graphics processing unit or other processor that is configured to perform operations to generate the stencil buffer and cover the path to fill or stroke the path.

The invention relates to an in-situ biological-ecological recovery integrated system for an urban river water body. The in-situ biological-ecological recovery integrated system is capable of effectively preventing the problems of unqualified fluvial cross section water body and aquatic ecosystem damage and further improving the landscape effect. According to the technical scheme adopted by the invention, the method is as follows: close-to-nature riverside buffer zones are constructed on side banks of a river reach from upstream to downstream; the river reach, at which the close-to-nature riverside buffer zones are positioned, is internally and sequentially provided with a pretreatment unit, a first ecological floating bed unit, a first ecological filtration dam unit, an aquatic plant unit, a second ecological floating bed unit, a second ecological filtration dam unit, a biomembrane-enhanced purification unit including a plug-flow aeration unit, a habitat improvement unit and an aquatic organism functional group construction zone from upstream to downstream. The in-situ biological-ecological recovery integrated system does not need to occupy land area except for a riverway, is stable in treatment effect, does not influence drawing off of floodwater in the riverway, can be used for solving the problems of unqualified fluvial cross section water body and aquatic ecosystem damage and improving the landscape effect, and has great economical and social benefits.

The invention discloses a TCP stream restructuring and / or packetizing method and a device. The method comprises the following steps that: a current processing packet is received and the TCP stream records of the current processing packet information are recorded, the packet is divided into header information and load data, and the load data is written into a packet load data FIFO queue; whether the caching of the current processing packet needs to apply for a novel buffer area is judged; if yes, a request for distributing the buffer area is sent, a vacant unit buffer block in a caching space is distributed for the load data of the current processing packet, the address index of the vacant unit buffer block is returned, and the TCP stream records are updated; and otherwise, the load data is read from the packet load data FIFO queue and written into the load data buffer area according to the positions specified by the new TCP stream records so as to complete restructuring and / or packetizing.

The invention relates to a congestion control method for a wireless sensor network, which comprises the following five steps: 1) at a source end of the sensor network, choosing representative nodes instead of all sensing nodes to report events; 2) detecting the congestion by the nodes according to an occupancy rate of a local buffer zone; 3) dividing the nodes between the source and a gathering node sink into far sink nodes and near sink nodes according to the distances from the nodes to the gathering node sink; 4) if detecting the congestion by the far sink nodes, sending a backward congestion report and spreading the report information along the direction of a data source, and adopting a congestion processing method based on flow scheduling by the node which receives the report information; and 5) if detecting the congestion by the near sink nodes, sending a forward congestion report to the gathering node sink, and adjusting the speed or quantity of the representative nodes by the gathering node sink according to an application requirement after receiving the congestion report information. According to the method, the congestion problems probably occurring in different areas of the wireless sensor network are solved by using different processing methods, thereby timely and efficiently avoiding or relieving congestion.

This invention discloses a data synchronization method for data of multiple databases, which applies a R-T separation system for data synchronization, in which, the data synchronization is guaranteed by real time synchronization, polling all fall-out-of-step queues by the timer and all data synchronization, which can increase efficiency of data synchronization and will not influence the data completeness even if information packets are lost occasionally, the buffer zone stores key words of corrected recordings only, so small storage space is needed.