| Patent application number | Description | Published |
|---|
| 20100036976 | DEVICE AND METHOD FOR TESTING A DIRECT MEMORY ACCESS CONTROLLER - A device and a method for testing a DMA controller. The device includes: (i) a DMA controller that includes a first data transfer path and a second data transfer path, wherein the first data transfer path and the second data transfer path are mutually independent; (ii) a test unit, connected to the first and second data transfer paths, that is adapted to control a transfer of data between the first data transfer path and the second data transfer path during a test mode, while masking from a first memory unit coupled to the DMA controller, at least one control signal associated with the transfer of data. | 02-11-2010 |
| 20100114508 | DEVICE AND METHOD FOR TESTING A CIRCUIT - A device and a method. The device includes: (i) a processor, connected to the receiver, (ii) an interface adapted to receive a test vector and to output a test response, the test vector includes a first group of signals that include idle signals and at least one information frame and a second group of signals that include timing signals and data signals; and (iii) a receiver, connected to the interface. The receiver is adapted to receive the first group of signals and filter out the idle signals and at least one instruction frame delimiters to provide at least one instruction. The device is adapted to send the at least one instruction to at least one instruction buffer. The processor is adapted to execute at least one instruction stored in the at least one instruction buffer and to respond to the second group of signals such as to provide test responses. | 05-06-2010 |
| 20100228894 | DEVICE HAVING DATA SHARING CAPABILITIES AND A METHOD FOR SHARING DATA - A method and device for sharing data. The method include: receiving by a direct memory access controller, a data read instruction; wherein the read data instruction can be a shared data read instruction or a non-shared data read instruction; determining whether to fetch a requested data block from a first memory unit to a second memory unit by applying a direct memory address control operation; wherein the second memory unit is accessible by a processor that generated the shared data read instruction; fetching the requested data block from the first memory unit to the second memory unit by applying a direct memory access control operation, if the read data instruction is a non-shared data instruction or if the read data instruction is a shared data instruction but the requested data is not stored in the second memory unit; and retrieving a requested data block from a second memory unit. | 09-09-2010 |
| Patent application number | Description | Published |
|---|
| 20090219849 | APPARATUS FOR AND METHOD OF MULTICAST AND BROADCAST SERVICE (MBS) MACRO-DIVERSITY BASED INFORMATION PROCESSING - A novel and useful apparatus for and method of multicast and broadcast service (MBS) macro-diversity based information processing for use in MBS enabled wireless communication systems. MBS allocations and transmissions from base stations are not coordinated and independent of each other. The characteristics of the MBS signal, such as waveform, modulation, timing and frequency domain, used for transmissions in one or more MBS zones by a base station are uncoordinated and unsynchronized with respect to transmissions in other base stations or MBS zones. They all, however, contain the same information content and relate to the same CID (MCID and/or SA). The MS, using multiple detection techniques, uses time and frequency diversity reception techniques to combine MBS transmissions received from multiple base stations. Base stations and/or the network inform mobile stations of whether or not uncoordinated MBS data transmission is supported on the network via a TLV transmitted during the MBS connection setup process. If supported, mobile stations can receive multiple MBS data signals, combining them to generate a single MBS data output stream. | 09-03-2009 |
| 20090290555 | Autonomous anonymous association between a mobile station and multiple network elements in a wireless communication system - A novel and useful autonomous association mechanism for use in user equipment (UE) network connections in one or more cellular communications systems. The handover process is optimized by improving the selection of target base stations and optimizing the discontinuity period from the time of disconnection from a serving base station and connection to a target base station and by establishing anonymous bidirectional communications with base stations. The mechanism facilitates multiple cell association in a network unaware manner while preserving single endpoint connectivity. The UE does not need to negotiate for or receive pre-allocated opportunities from the network for making associations with neighboring base stations. Association opportunities are created by the UE autonomously in accordance with UE activity patterns. Association opportunities are used to exchange preliminary information needed for handover between the UE and candidate base stations over the same or a plurality of access technologies. The information includes any parameter that can affect the handover process, e.g., link quality, etc. | 11-26-2009 |
| 20090291686 | Autonomous connectivity between a mobile station and multiple network elements for minimizing service discontinuities during handovers in a wireless communication system - A novel and useful autonomous connectivity mechanism for use in user equipment (UE) connectivity in one or more cellular communications systems. The handover process is optimized by improving the selection of target base stations and optimizing the discontinuity period from the time of disconnection from a serving base station and connection to a target base station. The mechanism facilitates multiple cell connectivity in a network unaware manner while preserving single endpoint connectivity. The UE does not need to negotiate for or receive pre-allocated opportunities from the network for making neighboring base stations measurements. Measurement opportunities are created by the UE autonomously in accordance with UE activity patterns. Measurement opportunities are used to measure and maintain a candidate target base station list over the same or a plurality of access technologies. The parameter set tracked includes parameters that can be measured without any assistance from the target base station and which can effect the handover process, e.g., link quality, etc. | 11-26-2009 |
| Patent application number | Description | Published |
|---|
| 20080273103 | TECHNIQUES FOR MODIFYING IMAGE FIELD DATA AS A FUNCTION OF RADIUS ACROSS THE IMAGE FIELD - A technique for modifying data of an image, such as can be implemented in a still camera or video recorder in order to correct for defects in its optical and/or electronic systems, includes generating data to modify the image as a function of radial position across it. A variation of the intensity across an image (lens shading) that appears in data from a two-dimensional detector is an example of an application of the technique. In order to make modifications to the data, positions of a two-dimensional raster scan pattern of an image sensor are converted to radial positions and this is then used to generate the modification data. The modification data is generated on the fly, at the same rate as the image data is being acquired, so that the modification takes place without slowing down data transfer from the image sensor. | 11-06-2008 |
| 20110025889 | TECHNIQUES OF MODIFYING IMAGE FIELD DATA BY EXTRAPOLATION - Techniques for modifying data of an image that can be implemented in a digital camera, video image capturing device and other optical systems are provided to correct for Image image shading variations appearing in data from a two-dimensional photo-sensor. These variations can be caused by imperfect lenses, non-uniform sensitivity across the photo-sensor, and internal reflections within a housing of the optical system, for example. In order to correct for these variations, a small amount of modification data is stored in a small memory within the camera or other optical system, preferably separate correction data for each primary color. Image data from individual pixels are corrected on the fly by interpolating individual pixel corrections from the stored modification data, at the same rate as the image data is being acquired, so that the correction takes place without slowing down data transfer of picture data from the image sensor. | 02-03-2011 |
| Patent application number | Description | Published |
|---|
| 20110228781 | Combined Hardware/Software Forwarding Mechanism and Method - A forwarding system comprises a identification engine, a hardware forwarding engine configured to process an ingressing packet, a software forwarding engine configured to process the ingressing packet, and a selection engine. The selection engine is configured to select one of the hardware forwarding engine or the software forwarding engine to process the ingressing packet. The selection is based on at least one of an indication of resource availability or a classification of the ingressing packet based on a priority of a flow as determined by the identification engine. In some embodiments, the selection engine selects different forwarding engines to process different packets of a same flow based on changes in resource availability or classification of the ingressing packet. | 09-22-2011 |
| 20110229131 | VERSATILE OPTICAL NETWORK INTERFACE METHODS AND SYSTEMS - Methods and systems for implementing versatile optical terminals that detect optical transmission protocols and subsequently adapt to the correct protocol are disclosed. In an embodiment, an interface device for providing an interface for a first network with a passive optical network (PON) is disclosed. The interface device includes a protocol detection circuit for determining whether optical communication signals received from the PON conform to a first optical communication protocol, and a switchover control circuit that reconfigures the interface device to work with a second optical communication protocol when the received optical communication signals do not conform to the first optical communication protocol. | 09-22-2011 |
| 20120036415 | Systems and Methods for Performing Forward Error Correction - In accordance with the teachings described herein, systems and methods are provided for performing forward error correction. A decoder for performing forward error correction for a frame in a data stream includes a state machine configured to determine if a code block within the frame received by the decoder is a complete code block or a partial code block, the frame including a plurality of code blocks. A decoding unit is configured to receive the code block, and, when the code block is a partial code block, to generate an output based on decoding the partial code block and an additional partial decoding result that is input to the decoding unit. | 02-09-2012 |
| Patent application number | Description | Published |
|---|
| 20100034133 | Systems and methods for efficiently positioning a directional antenna module to receive and transmit the most effective band width of wireless transmissions - Wireless systems and methods establish an optimal wireless communication link by efficiently positioning an antenna module to receive/transmit the most effective signal. An antenna module scans and rotates and receives data such as available networks and the qualities of received signals. Received networks are analyzed, recorded and mapped to antenna variables such as azimuth, elevation and polarity. Automatic or manual selection of a wireless network is based upon antenna variables, qualities of received network signals and predefined conditions. If desired, a more refined antenna position is obtained by the addition of spiral antenna rotations and additional recordings of received data are mapped to antenna elevation, azimuth and polarity. In the event the measured effective signal reception diminishes, the center destination of the spiral path shifts and the process repeats until the highest effective signal reception is found. The disclosed technique acknowledges the realities of complicated modern day signal topography. | 02-11-2010 |
| 20110143673 | AUTOMATIC POSITIONING OF DIVERSITY ANTENNA ARRAY - Embodiments of the invention provide an antenna system for connecting to a wireless device through a communication link. The antenna system comprising an antenna array configured to pre-scan frequency bands of radio signals in a plurality of antenna array directions, a transceiver connected to the antenna array. The transceiver is configured to analyze the signals received from the antenna array to obtain one or more parameters from one or more MIMO channels of the antenna array, and transmit the one or more parameters to the antenna controller. Further, the antenna system comprises a platform connected to the antenna array, wherein the platform is configured to position the antenna array, and a motor controller connected to the platform. The motor controller is configured to receive one or more position signals from the device, wherein the position signals correspond to a pre-scanned performance level of the communication link based on the parameters, and control the position of the antenna array by rotating the platform based on the position signals. | 06-16-2011 |
| Patent application number | Description | Published |
|---|
| 20080281886 | Concurrent, lock-free object copying - Described is a technology by which a real-time data relocating mechanism is provided for multiprocessing environments, including supporting lock-free programs that run in parallel. The relocating mechanism moves an object by using a status field related to the data field, possibly in an interim (wide) object space, which is then copied to a to-space object. The status information for each data field of the original object contains information indicating where a current version of the data for each field is present, that is, in the original, wide or to-space object. In one example, a handshake mechanism of a garbage collector establishes preparation and copy phases between the mechanism and other threads that determine where memory accesses occur. Also described is support for program thread compare-and-swap (CAS) operations and/or multi-word atomic operations. | 11-13-2008 |
| 20090144712 | PATH SPECIALIZATIONS FOR RUNTIME CODE WITH PHASE BEHAVIOR - Mechanism that employs code cloning and specialized code execution for barriers to minimize runtime overhead. This is facilitated by duplicating code and inserting specializations of the barriers in the code copies. The mechanism is effective for garbage collection when the garbage collection executes through different phases, and the barrier behavior and overheads depend on these phases. The duplicated and specialized code enables the program to run efficiently by reducing the dynamic count of a phase check when the phase is well-known and phase checks can be avoided. | 06-04-2009 |
| 20090222494 | OPTIMISTIC OBJECT RELOCATION - Object relocation often involves a multi-word copy of the object from a source address to a destination address, followed by updating the references (e.g., pointers) to the object. However, during the relocation, other threads may write to portions of the object that have already been relocated, and the updates may be lost when the references are updated to point to the destination address. A non-blocking relocation technique may be implemented to permit threads to write to the object during the relocation, wherein the memory accesses are monitored for a write to the object. If a write is detected during the relocation, the relocation fails and the memory at the destination address is deallocated; but if no write is detected, the relocation succeeds and the references are updated to point to the destination address. Refinements of this technique may be implemented to reduce other synchronization issues. | 09-03-2009 |
| 20090222634 | PROBABILISTIC OBJECT RELOCATION - Object relocation often involves a multi-word copy of the object from a source memory to a destination memory, followed by updating the references (e.g., pointers) to the object. However, during the relocation, other threads may write to portions of the object that have already been relocated, and the updates may be lost when the references are updated to point to the destination memory. The object relocation may therefore mark the words of the object during relocation with a relocation value to indicate transfer to the destination memory without locking the threads. The threads may be configured to check the value the source memory during object access, and to access the corresponding word of the destination memory if the source memory word comprises the relocation value. While the probability of a large (e.g., 64-bit) relocation value appearing in the object is small, safety measures are provided to detect and mitigate conflicts. | 09-03-2009 |
| 20090327621 | VIRTUAL MEMORY COMPACTION AND COMPRESSION USING COLLABORATION BETWEEN A VIRTUAL MEMORY MANAGER AND A MEMORY MANAGER - Enhanced performance and functionality in virtual memory is possible when a virtual memory manager and a memory manager are configured to collaborate. | 12-31-2009 |
| 20100114998 | Incremental lock-free stack scanning for garbage collection - Concurrent, incremental, and lock-free stack scanning for garbage collectors is disclosed. This method uses a summary table and return barriers to allow high responsiveness. The method also supports programs that employ fine-synchronization to avoid locks, imposes negligible overhead on program execution, can be used with existing concurrent collectors, and supports the special in-stack references existing in languages such as C#. | 05-06-2010 |
| 20100179971 | Concurrent, Lock-Free Object Copying - Described is a technology by which a real-time data relocating mechanism is provided for multiprocessing environments, including supporting lock-free programs that run in parallel. The relocating mechanism moves an object by using a status field related to the data field, possibly in an interim (wide) object space, which is then copied to a to-space object. The status information for each data field of the original object contains information indicating where a current version of the data for each field is present, that is, in the original, wide or to-space object. In one example, a handshake mechanism of a garbage collector establishes preparation and copy phases between the mechanism and other threads that determine where memory accesses occur. Also described is support for program thread compare-and-swap (CAS) operations and/or multi-word atomic operations. | 07-15-2010 |
| Patent application number | Description | Published |
|---|
| 20080205301 | SYSTEM AND PROGRAM FOR SELECTING ONE OF MULTIPLE PATHS TO COMMUNICATE WITH A DEVICE - Provided are a system, program, and data structure for selecting one of multiple data paths to a device. A selection is made of one of multiple paths indicated as enabled to transmit data. A path is indicated as enabled or disabled. Transfer time data is gathered for each enabled path capable of being selected. Paths having transfer time data satisfying a threshold are indicated as disabled. Paths indicated as disabled are not capable of being selected to use to transmit data. | 08-28-2008 |
| 20080243950 | ADVANCED CLOCK SYNCHRONIZATION TECHNIQUE - An advanced clock synchronization technique is adapted for use with a replication service in a data backup and recovery storage environment. The storage environment includes a plurality of source storage systems and target storage systems, wherein the source storage systems are illustratively embodied as source replication nodes. The advanced clock synchronization technique establishes a software-only, loosely-accurate global clock based on a timestamp and an associated error boundary. Notably, the timestamp and its error boundary are used as global clock information to enable synchronization (i.e., ordering of storage requests) among the source replication nodes and/or the target storage systems, thereby ensuring consistent replication of the storage requests on the target storage systems. | 10-02-2008 |
| 20080243951 | WRITE ORDERING STYLE ASYNCHRONOUS REPLICATION UTILIZING A LOOSELY-ACCURATE GLOBAL CLOCK - A write ordering style asynchronous replication service utilizes a loosely-accurate global clock in a data backup and recovery storage environment. The storage environment includes a set of source storage systems illustratively embodied as source replication nodes that cooperate to maintain a consistency group that may span multiple geographical sites. The storage environment also includes one or more target storage systems illustratively embodied as target replication nodes configured to service the consistency group. The write ordering style service utilizes the loosely-accurate global clock to provide consistent replication of a storage space of the consistency group. | 10-02-2008 |
| 20080243952 | Group Stamping Style Asynchronous Replication Utilizing A Loosely-Accurate Global Clock - A group stamping style asynchronous replication service utilizes a loosely-accurate global clock in a data backup and recovery storage environment. The storage environment includes a set of source storage systems illustratively embodied as source replication nodes that cooperate to maintain a consistency group that may span multiple geographical sites. The storage environment also includes one or more target storage systems illustratively embodied as target replication nodes configured to service the consistency group. The group stamping style service utilizes the loosely-accurate global clock to provide consistent replication of a storage space, e.g., a target storage space, of the consistency group. | 10-02-2008 |
| 20120124282 | SCALABLE BLOCK DATA STORAGE USING CONTENT ADDRESSING - A device for scalable block data storage and retrieval uses content addressing. Data storage devices store data blocks, and are connected over a network to computing modules. The modules comprise control modules and data modules and carry out content addressing for both storage and retrieval. The network defines separate control paths via the control modules and data paths via the data modules. | 05-17-2012 |
| Patent application number | Description | Published |
|---|
| 20090286550 | Tempo Spatial Data Extraction From Network Connected Devices - A computer implemented data processing system for extracting user related tempo-spatial data from a cellular network comprising a plurality of cells, each cell comprising at least one cell sector, wherein each cell sector is in communication with a plurality of network-connected devices, and wherein each device is associated with a user profile. The system comprising: a computer component aggregation module, wherein the cellular network comprises: a network-connected raw database, a network-connected device profiles database, a unique identifier and a location module. The aggregation module receives from the cellular network combined data exhibiting identified network-connected devices with their corresponding profiles, and aggregates in response, profile each identified network-connected device with the corresponding location code thereby creating an anonymous aggregated user related data. The system may create, using geo-statistical methods a geographic information system (GIS) layer presenting the anonymous aggregated profiles classes associated with geographical locations. | 11-19-2009 |
| 20090286554 | USING CUSTOMER RELATIONSHIP MANAGEMENT DATA EXHIBITING UNIQUE USER IDENTIFIERS IN A CELLULAR NETWORK FOR CREATING GEO STATISTICAL REPRESENTATIONS OF THE USERS - A computer implemented data processing system for using customer relationship management (CRM) data exhibiting unique user identifiers in a cellular network for creating geo-statistical representations of the users. The system is arranged to: repeatedly identify all network-connected devices which are both active and idle in each location area using the unique identifier; repeatedly create a table for all location areas, each table exhibiting: location area identifier, unique user identifier, time of inflow to the location area, time of outflow from the location area; and differentiate table of time N−1 over table of time N thereby detecting inflow outflow quantities of unique identifiers for each location area; decipher the difference table by the authentication center of the network; analyze the deciphered tables using CRM profiles; and join over time, the deciphered tables with corresponding location area thereby creating at least one GIS data layer. | 11-19-2009 |
| 20090286555 | USING CUSTOMER RELATIONSHIP MANAGEMENT DATA NON EXHIBITING UNIQUE USER IDENTIFIERS FOR CREATING GEO STATISTICAL REPRESENTATIONS OF THE USERS - A computer implemented data processing system for using customer relationship management (CRM) non-exhibiting unique user identifiers in a cellular network for creating geo-statistical representations of the users. The system is arranged to: repeatedly identify all active network-connected devices in each location area using the unique identifier; repeatedly create a table, for all location areas, each table exhibiting: location area identifier, unique user identifier, time of inflow to the location area, time of outflow from the location area; and differentiate table of time N−1 over table of time N thereby detecting inflow and outflow quantities of unique identifiers for each location area; factorizing said difference by the ratio of stationary non-active network-connected device and the total number of network-connected devices; decipher the difference table; analyze the deciphered tables using CRM profiles; and join over time, the deciphered tables with corresponding location area thereby creating at least one GIS data layer. | 11-19-2009 |
| 20110055216 | TEMPO SPATIAL DATA EXTRACTION FROM NETWORK CONNECTED DEVICES - A computer implemented data processing system for estimating an amount of people situated in a specific location and their geo-demographic classification within time range is provided herein. The system is combined of a collector that is configured to collect data on signals and each signal is given a unique ID; an association module configured to associate each signal with a respective location, namely, place of origin; a processing unit configured to calculate total number of users subscribed to a specific network service provider situated in a specific location and time range; calculate a dynamic ratio by research and statistical data; and an estimation module configured to estimate the amount of people originated from a specific location and the overall amount of people in a location within a time range, by applying the calculated dynamic ratio, that was calculated to each time stamp separately. | 03-03-2011 |
| Patent application number | Description | Published |
|---|
| 20090081264 | Cleansing article - A cleansing article which is a sponge impregnated with cosmetic soap, in which encapsulated beneficial agents are embedded and methods for its manufacturing are provided. The shell of a capsule according to one preferred embodiment of the present invention is made of materials soluble in water such as capsules typically utilized in the pharmaceutical industry. Alternatively a shell of a capsule may comprise the soap matrix and segments of the sponge. The beneficial agents considered include soothing materials, cosmetic agents, anhydrous self warming compositions, cooling agents, water in oil emulsions, foam generating compositions, natural fats, essential oils, waxes, crushed dried vegetables, crushed dried fruits, fruit extracts, honey, yogurt, vitamins, salts, minerals, cleansing solvents, salts from the Dead Sea, minerals from the Dead Sea and any combination thereof. | 03-26-2009 |
| 20100044458 | Fragrance Dispensing Device - Fragrance dispensing device providing for an artistic display combining visual and olfactory appealing elements is disclosed. The display is related to evolving processes, such as natural unfolding, growing, flowering, or fruit maturation, or changing a status of an object such as by moving a doll or a toy modeling a car, or by setting it into motion, simultaneously effected with fragrance dispensing. The fragrance dispensing device has at least one evolving artifact capable of changing from a state of standby into displaying and back to standby, a reservoir of perfume and a control unit. Activating a display is accomplished manually by means of an on/off switch, or a remote control unit; detecting an illuminating light by means of a light detector; detecting moving object such as human motion by means of a movement sensor; or preferably by interpreting sounds by means of an audio receiver. | 02-25-2010 |
| 20120003286 | COSMETIC CANDLE - A cosmetic candle comprising tiny grains embedded therein. The grains impart a mechanical property that can be exploited for scrubbing skin to peel off old or dead tissue with a concomitant massaging of molten waxes into the skin. Crushed pits and seeds of olives, apricots, peaches, citrus fruits and/or plums are natural products that can be used as grains in embodiments of the invention. In addition, solid salt grains, such as natural salts from the Dead Sea, or sugar grains, may also be used to that effect. | 01-05-2012 |
