Abstract: A method and apparatus for dynamic allocation of radio resources in a wireless communication system is provided. The method includes receiving a plurality of traffic arrival information for a first time interval. The plurality of traffic arrival information includes a one or more traffic buffer demand, a one or more traffic arrival information for the first-time interval and a one or more average deficit value for the first-time interval. Further, the method includes, estimating a next average deficit for a second time interval based on the one or more average deficit value for the first-time interval. Furthermore, computing a forecast allocation based on the one or more traffic buffer demand, the one or more average deficit value for the first-time interval and the estimated next average deficit for the second time interval and allocating at least one physical resource block (PRB) based on the computed forecast allocation.

Abstract: A method and apparatus for dynamic allocation of radio resources in a wireless communication system is provided. The method includes receiving a plurality of traffic parameters for a first time interval. The plurality of traffic parameters comprises at least one traffic arrival information for the first time interval. Further, the method includes estimating the at least one traffic arrival information for a second time interval based on the received at least one traffic arrival information for the first time interval. Furthermore, the method includes determining a bandwidth demand for the second time interval based on the estimated at least one traffic arrival information for the second time interval and the plurality of traffic parameters for the first time interval and allocating at least one resource block during the second time interval based on the determined bandwidth demand for the second time interval.

Abstract: The present disclosure provides methods for treating a patient with cancer, such as metastatic breast cancer, comprising administering tesetaxel and capecitabine to the patient.

Abstract: A device for controlling access to a vehicle, the device including: a housing, the housing including a transmitter, a receiver, a microcontroller and an unlocking mechanism, wherein the housing is configured to be mounted to a vehicle and, in response to a triggering event at the unlocking mechanism, the microcontroller is configured to advertise itself to allow a previously linked remote device to connect and, once a connection is established with the remote device, the transmitter is configured to send an unlock signal to an electronic control unit inside the vehicle to unlock a door of the vehicle.

Abstract: A device for controlling access to a vehicle, the device including: a housing, the housing including a transmitter, a receiver, a microcontroller and an unlocking mechanism, wherein the housing is configured to be mounted to a vehicle and, in response to a triggering event at the unlocking mechanism, the microcontroller is configured to advertise itself to allow a previously linked remote device to connect and, once a connection is established with the remote device, the transmitter is configured to send an unlock signal to an electronic control unit inside the vehicle to unlock a door of the vehicle.

Abstract: Systems and methods facilitate long-range, accurate fiducial tracking using a mixture of pan-tilt and camera devices enabling generalized 3D tracking of fiducials with the automatic mapping of flaw data to component models within standard CAD packages. The invention is suitable to many various tracking applications, particularly large inspection sites such as aircraft surfaces which require vast coverage with a medium-degree of accuracy. A method of surface inspection comprises the steps of moving a fiducial target over a surface under inspection, and tracking the fiducial as it is moved by capturing and storing the coordinates of the fiducial in a database for subsequent retrieval. Machine vision is used to acquire surface inspection data associated with the coordinates of the fiducial as it is moved. The inspection data is integrated into a CAD model, enabling the use of finite element analysis (FEA) to determine or predict flaw and material behavior over time.

Abstract: A heterogeneous wireless communication network includes a home access network with a home network characteristic and a home network policy, and a visiting access network with a visiting network characteristic and a visiting network policy. A packet data node gateway is adapted to communicate with the home access network and the visiting access network over a first communication path. An out-of-band communication path substantially separate from the first communication path is adapted to carry the visiting network policy from the visiting access network to the packet data node gateway. When the terminal is handed off from the home network to the visiting network, the packet data node gateway retrieves the visiting network policy, and the terminal accesses the visiting network over the first communication path using the visiting network policy.

Abstract: An architecture by which combined scheduling and network coding can be used in mesh networks, and more particularly wireless mesh networks. In various embodiments, this architecture includes a scheduling MAC protocol for scheduling nodes in the mesh network in order to take advantage of network coding opportunities. The schedule takes advantage of these opportunities by assigning a gain to transmit packets based upon the number of packets that are transmitted concurrently and choosing a schedule which minimizes the gain over the scheduling horizon. Regarding the assigned gain, in one embodiment this value is one for basic non-encoded operations and two or more for encoded operations. A scheduling MAC protocol is also used to announce and arbitrate network coding opportunities by indicating which packets (as characterized by their transmission slot) are to be encoded with each other.

Abstract: An intelligent system for automatically monitoring, diagnosing, and repairing complex hardware and software systems is presented. A number of functional modules enable the system to collect relevant data from both hardware and software components, analyze the incoming data to detect faults, further monitor sensor data and historical knowledge to predict potential faults, determine an appropriate response to fix the faults, and finally automatically repair the faults when appropriate. The system leverages both software and hardware modules to interact with the complex system being monitored. Additionally, the lessons learned on one system can be applied to better understand events occurring on the same or similar systems.

Abstract: A method includes receiving at a gateway mesh node a channel set list indicating radio channels that are allowed for use by the gateway mesh node, scanning channels in the channel set list and creating a list of channels in order of interference that is present, allocating channels from the list of channels to a plurality of radios that comprise the gateway mesh node, and initiating transmission of beacon frames from each of the plurality of radios on a main channel. Each beacon frame includes information descriptive of a path cost representing a sum of all link costs back to a central point, a primary radio channel used by the radio transmitting the beacon frame, a channel set indicating only those channels that an associated portion of the mesh network is allowed to use, and a set of meshed nodes associated with the radio.

Abstract: A heterogeneous wireless communication network includes a home access network with a home network characteristic and a home network policy, and a visiting access network with a visiting network characteristic and a visiting network policy. A packet data node gateway is adapted to communicate with the home access network and the visiting access network over a first communication path. An out-of-band communication path substantially separate from the first communication path is adapted to carry the visiting network policy from the visiting access network to the packet data node gateway. When the terminal is handed off from the home network to the visiting network, the packet data node gateway retrieves the visiting network policy, and the terminal accesses the visiting network over the first communication path using the visiting network policy.

Abstract: Resource allocations in stream data processing systems are performed to allocate the resources in a cost-effective manner by formulating the resource allocation problem as a linear program. For a problem with a single output, a backward algorithm or method is used that produces an optimal solution in linear time. For a problem with multiple outputs and the network has a tree structure, a backward shrink algorithm or method is used to provide an optimal solution in linear time. These algorithms are fully distributed, they require only local exchange of parameters between neighboring nodes, and are adaptive to the dynamic changes in network conditions and flow rate fluctuations.

Abstract: A method includes receiving at a gateway mesh node a channel set list indicating radio channels that are allowed for use by the gateway mesh node, scanning channels in the channel set list and creating a list of channels in order of interference that is present, allocating channels from the list of channels to a plurality of radios that comprise the gateway mesh node, and initiating transmission of beacon frames from each of the plurality of radios on a main channel. Each beacon frame includes information descriptive of a path cost representing a sum of all link costs back to a central point, a primary radio channel used by the radio transmitting the beacon frame, a channel set indicating only those channels that an associated portion of the mesh network is allowed to use, and a set of meshed nodes associated with the radio.

Abstract: Various example embodiment are disclosed. An example embodiment may include sending, by a relay node in a wireless network, a ready to send message to a plurality of wireless nodes. The ready to send message may indicate access channels for each of the wireless nodes to send clear to send messages. This example may also include receiving, via the indicated access channels for sending the clear to send messages, the clear to send messages from each of the wireless nodes. This example may also include sending an XOR-ed packet to the wireless nodes in response to receiving the clear to send messages. The XOR-ed packet may indicate access channels for each of the wireless nodes to send acknowledgment messages.

Abstract: An architecture by which combined scheduling and network coding can be used in mesh networks, and more particularly wireless mesh networks. In various embodiments, this architecture includes a scheduling MAC protocol for scheduling nodes in the mesh network in order to take advantage of network coding opportunities. The schedule takes advantage of these opportunities by assigning a gain to transmit packets based upon the number of packets that are transmitted concurrently and choosing a schedule which minimizes the gain over the scheduling horizon. Regarding the assigned gain, in one embodiment this value is one for basic non-encoded operations and two or more for encoded operations. A scheduling MAC protocol is also used to announce and arbitrate network coding opportunities by indicating which packets (as characterized by their transmission slot) are to be encoded with each other.

Abstract: A device comprises a first binding unit which provides for a binding to a first tunnelling server using a first protocol, a second binding unit which provides for a binding to a second tunnelling server using a second protocol different from the first protocol, and an authorizing unit which causes the first or second binding unit to provide the binding.

Abstract: A method comprising transmitting a busy signal from a first node; receiving said busy signal at a second node; and transmitting data from said second node to said first node on a channel associated with said busy signal.

Abstract: Resource allocations in stream data processing systems are performed to allocate the resources in a cost-effective manner by formulating the resource allocation problem as a linear program. For a problem with a single output, a backward algorithm or method is used that produces an optimal solution in linear time. For a problem with multiple outputs and the network has a tree structure, a backward shrink algorithm or method is used to provide an optimal solution in linear time. These algorithms are fully distributed, they require only local exchange of parameters between neighboring nodes, and are adaptive to the dynamic changes in network conditions and flow rate fluctuations.

Abstract: A graphics system and method for displaying lines on a display device. The system may comprise a sample buffer, a rendering unit and a sample-to-pixel calculation unit. The rendering unit may (a) generate a plurality of sample positions in a two-dimensional space, (b) determine a sample normal distance for each of the sample positions with respect to a line defined by the line-draw command, (c) assign sample values to the sample positions based on the sample normal distance of each of the sample positions, and (d) store the sample values in the sample buffer. The sample-to-pixel calculation unit may read sample values from the sample buffer, filter them to determine a pixel value, and transmit the pixel value to the display device. The rendering unit may render the line sample values with a narrower width to pre-compensate for the line-expanding effect of the filtering performed by the sample-to-pixel calculation unit.

Abstract: A system and method for rasterizing and rendering graphics data is disclosed. Vertices may be grouped to form primitives such as triangles, which are rasterized using two-dimensional arrays of samples bins. Individual samples may be selected from the bins according to different criteria such as memory bank allocation to improve utilization of the system's rendering pipeline. Since the arrays may have more bins than the number of evaluation units in the rendering pipeline, the samples from the bins may be stored to FIFO memories to allow invalid or empty samples (those outside the primitive being rendered) to be removed. The samples may then be filtered to form pixels that are displayable to form an image on a display device.