Patent application number | Description | Published |
20100031127 | SCHEME FOR ERASURE LOCATOR POLYNOMIAL CALCULATION IN ERROR-AND-ERASURE DECODER - A method to generate an erasure locator polynomial in an error-and-erasure decode. The method generally includes the steps of (A) storing current values in multiple registers at a current moment, (B) generating first values by multiplying each current value by a respective one of multiple constants, (C) generating second values by gating at least all but one of the first values with a current one of multiple erasure values of an erasure position vector, (D) generating next values by combining each one of the second values with a corresponding one of the first values, (E) loading the next values into the registers in place of the current values at a next moment and (F) generating an output signal carrying the current values at a last moment such that the current values form the coefficients of the erasure locator polynomial. | 02-04-2010 |
20100153478 | PARALLEL TRUE RANDOM NUMBER GENERATOR ARCHITECTURE - A system having an entropy module, a memory module and a main module is disclosed. The entropy module may be configured to generate a plurality of first random numbers. The memory module may be configured to buffer (i) the first random numbers and (ii) a plurality of second random numbers. The main module is generally configured to (i) control a first transfer of the first random numbers from the entropy module to the memory module, (ii) control a second transfer of the first random numbers from the memory module to the main module, (iii) generate the second random numbers by encrypting the first random numbers and (iv) control a third transfer of the second random numbers from the main module to the memory module. The generation of the first random numbers and the generation of the second random numbers may be performed in parallel. | 06-17-2010 |
20100281344 | SOFT REED-SOLOMON DECODER BASED ON ERROR-AND-ERASURE REED-SOLOMON DECODER - An apparatus having a first circuit and a second circuit is disclosed. The first circuit may (i) generate a decoded codeword by decoding a first codeword a plurality of times based on a respective plurality of erasure location vectors and (ii) assert a fail signal upon each failure of the decoding of the first codeword, the decoding comprising an error-and-erasure Reed-Solomon decoding. The second circuit may (i) generate a count of the assertions of the fail signal and (ii) generate the erasure location vectors based on (a) the count and (b) a plurality of reliability items corresponding to the first codeword. | 11-04-2010 |
20100299580 | BCH OR REED-SOLOMON DECODER WITH SYNDROME MODIFICATION - An apparatus generally having a first circuit, a second circuit and a third circuit is disclosed. The first circuit may be configured to calculate a plurality of preliminary syndromes from a plurality of received symbols. The second circuit may be configured to calculate a plurality of normal syndromes by modifying the preliminary syndromes using at most two Galois Field multiplications. The third circuit is generally configured to calculate an errata polynomial based on the normal syndromes. | 11-25-2010 |
20110239079 | PROGRAMMABLE CIRCUIT FOR HIGH SPEED COMPUTATION OF THE INTERLEAVER TABLES FOR MULTIPLE WIRELESS STANDARDS - A circuit having a first circuit and a memory is disclosed. The first circuit may be configured to (i) receive a control signal that identifies a current one of a plurality of wireless communication standards and a code word size and (ii) generate a plurality of tables corresponding to both the current wireless communication standard and the code word size. Each of the tables generally has a plurality of indices. Up to two of the indices may be generated by the first circuit per clock cycle. Each of the tables generally comprises a permutation table of a turbo code interleaver. The memory may be configured to store the tables. | 09-29-2011 |
20120284731 | TWO-PASS LINEAR COMPLEXITY TASK SCHEDULER - A method for two-pass scheduling of a plurality of tasks generally including steps (A) to (C). Step (A) may assign each of the tasks to a corresponding one or more of a plurality of processors in a first pass through the tasks. The first pass may be non-iterative. Step (B) may reassign the tasks among the processors to shorten a respective load on one or more of the processors in a second pass through the tasks. The second pass may be non-iterative and may begin after the first pass has completed. Step (C) may generate a schedule in response to the assigning and the reassigning. The schedule generally maps the tasks to the processors. | 11-08-2012 |
20120288084 | FAST ECHO GAIN CHANGE DETECTION - An apparatus generally having a first circuit and a second circuit is disclosed. The first circuit may be configured to synthesize a first vector by filtering a second vector based on a third vector. The second circuit may be configured to (i) generate a gain corresponding to a fourth vector, (ii) compare the gain to a plurality of thresholds and (iii) update the third vector as a function of the gain where the compare determines that the gain is not between the thresholds. The fourth vector may be received from a network as an echo of the second vector. | 11-15-2012 |
20140362289 | METHOD AND APPARATUS FOR INCREASING FRAME RATE OF AN IMAGE STREAM USING AT LEAST ONE HIGHER FRAME RATE IMAGE STREAM - An image processing system comprises an image processor configured to obtain a first image stream having a first frame rate and a second image stream having a second frame rate lower than the first frame rate, to recover additional frames for the second image stream based on existing frames of the first and second image streams, and to utilize the additional frames to provide an increased frame rate for the second image stream. Recovering additional frames for the second image stream based on existing frames of the first and second image streams illustratively comprises determining sets of one or more additional frames for insertion between respective pairs of consecutive existing frames in the second image stream in respective iterations. | 12-11-2014 |
20150030232 | IMAGE PROCESSOR CONFIGURED FOR EFFICIENT ESTIMATION AND ELIMINATION OF BACKGROUND INFORMATION IN IMAGES - An image processing system comprises an image processor implemented using at least one processing device and adapted for coupling to an image source, such as a depth imager. The image processor is configured to compute a convergence matrix and a noise threshold matrix, to estimate background information of an image utilizing the convergence matrix, and to eliminate at least a portion of the background information from the image utilizing the noise threshold matrix. The background estimation and elimination may involve the generation of static and dynamic background masks that include elements indicating which pixels of the image are part of respective static and dynamic background information. The computing, estimating and eliminating operations may be performed over a sequence of depth images, such as frames of a 3D video signal, with the convergence and noise threshold matrices being recomputed for each of at least a subset of the depth images. | 01-29-2015 |
20150043807 | DEPTH IMAGE COMPRESSION AND DECOMPRESSION UTILIZING DEPTH AND AMPLITUDE DATA - In one embodiment, an image processing system comprises an image processor configured to obtain depth and amplitude data associated with a depth image, to identify a region of interest based on the depth and amplitude data, to separately compress the depth and amplitude data based on the identified region of interest to form respective compressed depth and amplitude portions, and to combine the separately compressed portions to provide a compressed depth image. The image processor may additionally or alternatively be configured to obtain a compressed depth image, to divide the compressed depth image into compressed depth and amplitude portions, and to separately decompress the compressed depth and amplitude portions to provide respective depth and amplitude data associated with a depth image. Other embodiments of the invention can be adapted for compressing or decompressing only depth data associated with a given depth image or sequence of depth images. | 02-12-2015 |
Patent application number | Description | Published |
20110321031 | UPDATING NODES CONSIDERING SERVICE MODEL CONSTRAINTS - Methods, systems, and computer-readable media for deploying an update to nodes propagated throughout a data center are provided. Launching new upgrade to hosting environment residing on the nodes typically invokes a mechanism (e.g., fabric controller) to form a group of nodes that are independent of one another with respect to upgrade domains, which are assigned to tenants (e.g., program components of service applications running within the data center) presently hosted by the nodes. The constraints of the update domains are articulated by service level agreements established for the service applications, respectively. Forming the group involves identifying independent nodes for membership, where no two members of the group host analogous tenants (belonging to a common service application) that are assigned to distinct update domains. However, it is acceptable to join to the group those nodes hosting analogous tenants that are each assigned to the same update domain. | 12-29-2011 |
20120066541 | CONTROLLED AUTOMATIC HEALING OF DATA-CENTER SERVICES - Subject matter described herein is directed to reallocating an application component from a faulty data-center resource to a non-faulty data-center resource. Background monitors identify data-center resources that are faulty and schedule migration of application components from the faulty data-center resources to non-faulty data-center resources. Migration is carried out in an automatic manner that allows an application to remain available. Thresholds are in place to control a rate of migration, as well as, detect when resource failure might be resulting from data-center-wide processes or from an application failure. | 03-15-2012 |
20120290706 | STATE CONTROL OF REMOTE HOSTS FOR MANAGEMENT OF DISTRIBUTED APPLICATIONS - Configuring a node. A method includes determining a current state of a target node. The current state of the target node refers to objects currently deployed or running in the remote target node. It includes at least one of an operating system, one or more applications, or configuration setting at the target node. The method further includes determining a desired state for the target node to change the current state. The method further includes accessing a dependency graph based on the version of an agent running on the target node. The dependency graph is supplied to a state machine. The state machine is particular to the target node. The state machine using the current state of the target node, the desired state and the dependency graph, performs operations to drive the target node toward its goal. | 11-15-2012 |
20130332921 | VIRTUAL MACHINE IMAGE WRITE LEASING - A system that includes multiple hosts, each having physical resources, a hypervisor, and a host agent that causes the virtual machines to operate above the hypervisor so as to be abstracted from the physical resources. A host fabric reviews requests to instantiate or upgrade a virtual machine, identifies a corresponding virtual machine image to instantiate the virtual machine from in order to honor the request, and determines whether the virtual machine to be instantiated has a valid lease on the virtual machine image. If the requestor does not have a valid lease, the request is blocked. If the requestor does have a valid lease, the host fabric facilitates the instantiation of the virtual machine from the virtual machine image. This prevents or eliminates the chances of multiple instances of the same virtual machine image writing to the virtual machine image at the same time. | 12-12-2013 |
20140109088 | AUGMENTED ALLOCATION OF VIRTUAL MACHINES FOR APPLICATION - The starting up of an application involving multiple virtual machines by overallocating virtual machines. In response to a request to allocate a certain number of virtual machines corresponding to the application, an augmented number of virtual machines is determined to be allocated in response to the request. The augmented number includes both the initially requested number of virtual machines in addition to a surplus number of virtual machines. The virtual machines are then initiated startup if they are not already started up. Before all of the virtual machines are started up, code is bound to the virtual machines. Thus, because more virtual machines were initiated startup than are required for the application, the code may be bound to some of the virtual machines in the application before all of the virtual machine have started up. | 04-17-2014 |
Patent application number | Description | Published |
20080262822 | Simulation using resource models - Operational resource modeling is usable to analyze application and computer system performance over a wide range of hypothetical scenarios. Operational resource modeling involves creating and training one or more resource models, and/or simulating hypothetical scenarios using resource models. | 10-23-2008 |
20080262823 | Training of resource models - Operational resource modeling is usable to analyze application and computer system performance over a wide range of hypothetical scenarios. Operational resource modeling involves creating and training one or more resource models, and/or simulating hypothetical scenarios using resource models. | 10-23-2008 |
20080262824 | Creation of resource models - Operational resource modeling is usable to analyze application and computer system performance over a wide range of hypothetical scenarios. Operational resource modeling involves creating and training one or more resource models, and/or simulating hypothetical scenarios using resource models. | 10-23-2008 |
20090006071 | Methods for Definition and Scalable Execution of Performance Models for Distributed Applications - A method and system for defining performance models of distributed applications such as distributed systems or network systems in a way that combines discrete and analytical models and simulating such performance models for analyzing software performance and impacts on devices of the distributed applications is described. Also described is a method for accelerating the simulation process by converting the discrete load into aggregate load dynamically based on the statistical analysis of the simulation results. | 01-01-2009 |
20090254555 | Modeling and Simulating Software Contention - Aspects of the subject matter described herein relate to modeling and simulating software contention. In aspects, a model declares properties of a scarce software object and models software components that need the scarce software object to execute. A simulator uses the model to set up data structures that track locking activity related to the software object. The simulator simulates the interaction between software components and hardware including seizing and releasing locks on the software object. The simulator may use a function or other similar mechanism to distribute seize and release operations with respect to a lock across multiple instances of the software object. The simulator may use data generated by a simulation to provide an indication of lock objects and hardware utilization, transaction latencies, and other statistics. | 10-08-2009 |
20120084394 | METHODS AND SYSTEMS FOR PROVIDING SECURE ACCESS TO A HOSTED SERVICE VIA A CLIENT APPLICATION - The present invention discloses methods and systems for providing secure user access to services offered by a service provider to a client application over a network. One embodiment includes receiving an application cookie from the client application and populating a service cookie based on information in the application cookie. Information in the service cookie is utilized as a basis for regulating a provision of services to the client application. | 04-05-2012 |
Patent application number | Description | Published |
20100033812 | SYSTEM AND METHOD FOR ADJUSTING THE SPHERICAL ABERRATION OF OBJECTIVE LENSES - A spherical aberration adjustment system is disclosed, which includes a plurality of objective lenses, where at least one of the plurality of objective lenses has a spherical aberration collar. The plurality of objective lenses are mounted onto an objective holder, where the objective holder is configured to place the at least one of the plurality of objective lenses in an imaging position. A driving mechanism is coupled by a mechanical link to the at least one of the plurality of objective lenses, where the mechanical link is configured to transmit motion from the driving mechanism to the spherical aberration collar. A control system is configured to manipulate the driving mechanism to move the spherical aberration collar of the at least one of the plurality of objective lenses in the imaging position to a specific spherical aberration adjustment setting. | 02-11-2010 |
20100090127 | TIME RESOLVED FLUORESCENT IMAGING SYSTEM - This invention provides a system and method that allows for time-resolved fluorescent imaging of fluorescent samples. The user is able to receive temporally filtered pictures of the sample with a reduced amount of the scattered excitation light and the short lived background fluorescence. The system allows for adjustment of fluorescent gating time and delay time. | 04-15-2010 |
20110261175 | MULTIPLE CHANNEL IMAGING SYSTEM AND METHOD FOR FLUORESCENCE GUIDED SURGERY - The invention relates to an imaging system for use in operating rooms and other applications. According to one example, the imaging system includes a plurality of imaging sensors that receive image information from a subject via a plurality of spectral channels and that convert the image information into an image signal. The imaging system may include a plurality of independent imaging optics systems, such as an independent visible imaging optics system and an independent fluorescent imaging optics system, that optically couple the image information to the plurality of imaging sensors. The plurality of independent imaging optics systems corresponds to the plurality of image sensors in order to independently adjust a plurality of optical parameters, such as a size of a field of view, a position of a focal plane, and a size of an optical aperture. The imaging system may further include a plurality of motion controllers that independently control the plurality of independent imaging optics systems and a control unit that is configured to receive the image signals from the plurality of imaging sensors and to generate a plurality of image frames for transmission to a display device. | 10-27-2011 |
20110261179 | IMAGING SYSTEM FOR FLUORESCENCE GUIDED SURGERY BASED ON FIXED MAGNIFICATION LENS AND DIGITAL ZOOM - The invention relates to an imaging system for use in operating rooms and other applications. According to one example, the imaging system may include a visible light source configured to illuminate a surgical field with visible light and an excitation source configured to generate excitation light to excite a fluorescent substance in an organism within the surgical field. The imaging system may also include an imaging lens system including a first sensor configured to receive visible light reflected from the surgical field via a first spectral channel and a second sensor configured to receive a fluorescent emission emitted from the fluorescent substance in the organism via a second spectral channel. The imaging system may further include a plurality of fixed magnification lenses configured to optically couple image signals to the first sensor and the second sensor, and a control unit configured to receive and digitally process the image signals to generate a plurality of image frames in order to rescale the plurality of image frames for display to a surgeon. | 10-27-2011 |
20130129212 | METHOD FOR REDUCING IMAGE ARTIFACTS PRODUCED BY A CMOS CAMERA - The present invention relates to a system and method for reducing image artifacts for a CMOS camera used as an optical detector for a line confocal fluorescent imager. The method for reducing image artifacts in a monochromatic image comprises subtracting RGB channel offset mismatch; and correcting random row offset for each row. Preferably, the method also comprises correcting random column offset and gain. Optionally, the method also comprises clipping of defective pixels, and/or subtracting dark current. When the monochromatic image is a fluorescence image, the method also comprises a step of compressing CMOS camera noise. Also provided are a system for reducing image artifacts in a monochromatic image from a CMOS camera, as well as an image artifact reduction system for a CMOS camera-based line confocal fluorescent microscope. | 05-23-2013 |
20140140595 | MICROSCOPY SYSTEM AND METHOD FOR BIOLOGICAL IMAGING - Microscopy system for biological imaging, comprising an image quality monitoring system for monitoring image quality of an image of a biological sample comprising a biological object selection means arranged to let a user of the system to select one or more Biological Reference Objects (BRO) in the image of the biological sample, and an image quality evaluation means arranged to compare the signal level of image pixels of the one or more BROs with an image background signal level to calculate one or more image quality parameters for the image of the biological sample. The system is arranged to present the image quality parameters to the user as an indication of the image quality specific for the BRO(s). | 05-22-2014 |
20140152800 | IMAGE QUALITY OPTIMIZATION OF BIOLOGICAL IMAGING - Microscopy system for biological imaging, comprising an image quality optimizer for optimizing image quality of an image of a biological sample, allowing a user to select an optimization mode from a list of functionally defined optimization modes, and wherein the system is arranged to automatically set one or more image acquisition parameters to achieve optimal imaging for the selected optimization mode based on at least one image quality parameter derived from one or more Biological Reference Objects (BRO) in the image of the biological sample selected by the user or automatically by the system. | 06-05-2014 |