Patent application number | Description | Published |
20100023565 | Separate Swap Files Corresponding to Different Virtual Machines in a Host Computer System - A swap space is provided for a host computer system, where the swap space includes a plurality of swap files with each individual swap file for swapping data only for a single corresponding virtual machine (VM). The per-VM swap space is used solely by the single, corresponding VM, such that only that particular VM's memory is allowed to be swapped out to the swap file. | 01-28-2010 |
20100241785 | MANAGEMENT OF HOST PHYSICAL MEMORY ALLOCATION TO VIRTUAL MACHINES WITH A BALLOON APPLICATION - Methods and systems for managing distribution of host physical memory (HPM) among virtual machines (VMs) executing on a host via a hypervisor are presented, where each VM has guest system software including an operating system. A method includes an operation for reserving, by a balloon application executing in a first VM, a guest virtual memory (GVM) location in the first VM. The GVM location is mapped to a guest physical memory (GPM) location, which is mapped to a host physical memory (HPM) location. The balloon application is responsive to the hypervisor for reserving memory. Further, the method includes operations for writing a value to the reserved GVM location and for remapping a plurality of GPM locations containing the value to a single HPM location. The remapping is performed by a content-based page sharing component of the hypervisor. Additionally, the method reclaims the HPM location when the HPM location is freed due to the remapping, and assigns the reclaimed HPM location to a different VM or to a pool of available HPM locations. | 09-23-2010 |
20110302389 | MEMORY MANAGEMENT METHODS IN A COMPUTER SYSTEM WITH SHARED MEMORY MAPPINGS - A memory management sub-system includes code executable by a processor fir performing selecting a plurality of contexts, and selecting a sample of the separately allocable portions of an address space for each of the contexts. For each of the selected allocable portions, a corresponding portion of the host memory to which the selected allocable portion is mapped is determined, and a count corresponding to a number of separately allocable portions of any context that are commonly mapped to the corresponding portion of the host memory. For each context, a metric is computed that is a function of the counts for that context. Host memory is allocated among the contexts at least in part based on their respective metrics. | 12-08-2011 |
20120110577 | CONTROLLING MEMORY CONDITIONS IN A VIRTUAL MACHINE - A method of managing host physical memory using a balloon application executing within a guest virtual machine (GVM) running on a host platform is described. The balloon application receives allocation parameters from an entity outside the GVM, the allocation parameters identifying an amount of memory for the balloon application to allocate. The balloon application adjusts the allocated amount of memory according to the allocated amount. Physical memory backing up the allocated memory can then be assigned by virtualization software for use by another virtual machine running on the host platform. | 05-03-2012 |
20130132957 | SYSTEM AND METHOD FOR COOPERATIVE VIRTUAL MACHINE MEMORY SCHEDULING - A resource scheduler for managing a distribution of host physical memory (HPM) among a plurality of virtual machines (VMs) monitors usage by each of the VMs of respective guest physical memories (GPM) to determine how much of the HPM should be allocated to each of the VMs. On determining that an amount of HPM allocated to a source VM should be reallocated to a target VM, the scheduler sends allocation parameters to a balloon application executing in the source VM causing it to reserve and write a value to a guest virtual memory (GVM) location in the source VM. The scheduler identifies the HPM location that corresponds to the reserved GVM and allocates it to the target VM by mapping a guest physical memory location of the target VM to the HPM location. | 05-23-2013 |
20130145377 | SYSTEM AND METHOD FOR COOPERATIVE VIRTUAL MACHINE MEMORY SCHEDULING - A resource scheduler for managing a distribution of host physical memory (HPM) among a plurality of virtual machines (VMs) monitors usage by each of the VMs of respective guest physical memories (GPM) to determine how much of the HPM should be allocated to each of the VMs. On determining that an amount of HPM allocated to a source VM should be reallocated to a target VM, the scheduler sends allocation parameters to a balloon application executing in the source VM causing it to reserve and write a value to a guest virtual memory (GVM) location in the source VM. The scheduler identifies the HPM location that corresponds to the reserved GVM and allocates it to the target VM by mapping a guest physical memory location of the target VM to the HPM location. | 06-06-2013 |
20140189195 | PROVIDING MEMORY CONDITION INFORMATION TO GUEST APPLICATIONS - Virtualization software can improve the effectiveness of a guest application running inside a virtual machine (VM) by providing information to the guest application indicative of a memory condition of the VM. The memory condition is indicative of an availability of memory resources to the guest application. When guest physical memory can be reserved by a balloon application running in the (VM), providing memory condition data indicative of the memory condition provides more accurate information regarding the availability of memory resources to the guest application than could be provided by the guest operating system of the VM. | 07-03-2014 |
20150019906 | Transparent and Lightweight Recovery From Hardware Memory Errors - Systems and methods are disclosed that allow for transparently recovering from an uncorrected multi-bit error of arbitrary length located at a memory address. Storing one or more parity pages, for a set of pages in system memory, such that a page in the set of pages may be reconstructed using one of the parity pages is disclosed. Storing an indication of one or more page'disk location such that the one or more pages may be reconstructed by refilling the page from disk is also disclosed. | 01-15-2015 |
Patent application number | Description | Published |
20080281893 | Optimization Of Spectrum Extrapolation For Causal Impulse Response Calculation Using The Hilbert Transform - A causal impulse response function is calculated from a truncated spectrum by extending the real part of the spectrum beyond the truncation frequency and computing the imaginary part with the Hilbert transform to enforce causality. The out of band extrapolation is optimized to reduce the discrepancy between the computed and the original imaginary part in the in band frequency range so that the causal impulse response accurately represents the original spectrum. The technique can be applied to spectral with the delay phase subtracted to enforce delay causality. The Hilbert transform may be employed to maintain causality in S-parameter passivity violation correction. At frequencies where violation happens, the S-parameter matrix is scaled down by the inverse of the magnitude of the largest eigenvalue. Magnitudes at other frequencies are unchanged. An additional phase calculated by the magnitude phase Hilbert transform is added to the scaled spectrum to maintain the causality. | 11-13-2008 |
20090240150 | BREAST CANCER SCREENING WITH ADJUNCTIVE ULTRASOUND MAMMOGRAPHY - An adjunctive ultrasound mammography system and associated methods are described, comprising a scanning apparatus for facilitating standardized, repeatable breast ultrasound scans, and further comprising an adjunctive ultrasound display apparatus configured for fast, intuitive viewing of adjunctive ultrasound data concurrently with x-ray mammogram information. In one preferred embodiment, thick-slice ultrasound images are displayed near an x-ray mammogram such that a screening radiologist can quickly view the thick-slice images for assistance in interpreting the x-ray mammogram. Methods for concurrently acquiring and displaying vibrational resonance image (VDI) data are described. Computer-aided diagnosis (CAD) algorithms that incorporate acoustically-based feature vectors are described, the feature vectors including lateral shadow metrics, vertical shadow metrics, posterior enhancement metrics, and VDI-based metrics. Algorithms are also described that combine x-ray mammogram CAD results with adjunctive ultrasound CAD results without requiring complex image registrations therebetween. Many of the practical, economic, and political barriers to acceptance and integration of ultrasound mammography into existing mass breast cancer screening environments are mitigated. | 09-24-2009 |
20090312640 | ADJUNCTIVE ULTRASOUND PROCESSING AND DISPLAY FOR BREAST CANCER SCREENING - An adjunctive ultrasound mammography system and associated methods are described comprising an adjunctive ultrasound display configured for quick, intuitive, interactive viewing of data derived from volumetric ultrasound scans, the data being displayed near a conventional x-ray mammogram display. Preferred embodiments for navigating among a thick-slice image array, a selected enlarged thick-slice image, and planar ultrasound views are described, including a preferred embodiment in which the planar ultrasound views are updated in real time as a cursor is moved across an active thick-slice image. In one preferred embodiment the thick-slice images are inverted prior to display, with non-breast areas of the image preferably segmented out and reset to dark. The inverted thick-slice images are of more familiar significance to radiologists having years of expertise in analyzing conventional x-ray mammograms. For example, the inverted thick-slice images allow benign features to be more easily dismissed as compared to non-inverted thick-slice images. Preferred embodiments for computing thick-slice image values from the volumetric scan data are also described that emphasize larger mass lesions in the resulting thick-slice images, and that compensate for mass lesions that straddle thick-slice region borders. | 12-17-2009 |
20130289405 | ADJUNCTIVE ULTRASOUND PROCESSING AND DISPLAY FOR BREAST CANCER SCREENING - An adjunctive ultrasound mammography system and associated methods use an adjunctive ultrasound display configured for quick, intuitive, interactive viewing of volumetric ultrasound scans, displayed near a conventional x-ray mammogram display. Preferred navigations among a thick-slice image array, a selected enlarged thick-slice image, and planar ultrasound views are described, including a mode in which the planar ultrasound views are updated in real time as a cursor is moved across an active thick-slice image. In one example the thick-slice images are inverted prior to display, with non-breast areas of the image preferably segmented out and reset to dark. The inverted thick-slice images are of more familiar significance to radiologists as they are more like conventional x-ray mammograms and allow benign features to be more easily dismissed as compared to non-inverted thick-slice images. Preferred embodiments emphasize larger mass lesions and that compensate for mass lesions that straddle thick-slice region borders. | 10-31-2013 |
Patent application number | Description | Published |
20090216774 | VIRTUALIZATION OF METADATA FOR FILE OPTIMIZATION - Mechanisms are provided for optimizing files while allowing application servers access to metadata associated with preoptimized versions of the files. During file optimization involving compression and/or compaction, file metadata changes. In order to allow file optimization in a manner transparent to application servers, the metadata associated with preoptimized versions of the files is maintained in a metadata database as well as in an optimized version of the files themselves. | 08-27-2009 |
20090216788 | MULTIPLE FILE COMPACTION FOR NETWORK ATTACHED STORAGE - Mechanisms are provided for optimizing multiple files in an efficient format that allows maintenance of the original namespace. Multiple files and associated metadata are written to a suitcase file. The suitcase file includes index information for accessing compressed data associated with compacted files. A hardlink to the suitcase file includes an index number used to access the appropriate index information. A simulated link to a particular file maintains the name of the particular file prior to compaction. | 08-27-2009 |
20090240718 | DEFLATE FILE DATA OPTIMIZATION - Mechanisms are provided for optimizing file data compressed using deflate mechanisms such as the ZLIB Compressed Data Format Specification and the DEFLATE Compressed Data Format Specification. Deflate mechanisms output different deflate file data depending on specific file data parameters. An optimization tool decompresses the deflate file data and outputs an optimized data stream. When a client application attempts to access the deflate data, the tool deoptimizes the optimized data stream and applies the same deflate algorithm to generate deflate file data. Although the deflate algorithm is applied without using the file data parameters used to generate the original deflate file data, substitute deflate file data is produced. | 09-24-2009 |
20100088277 | OBJECT DEDUPLICATION AND APPLICATION AWARE SNAPSHOTS - Embodiments deploy delayering techniques, and the relationships between successive versions of a rich-media file become apparent. With this, modified rich-media files suddenly present far smaller storage overhead as compared to traditional application-unaware snapshot and versioning implementations. Optimized file data is stored in suitcases. As a file is versioned, each new version of the file is placed in the same suitcase as the previous version, allowing embodiments to employ correlation techniques to enhance optimization savings. | 04-08-2010 |
20100094813 | REPRESENTING AND STORING AN OPTIMIZED FILE SYSTEM USING A SYSTEM OF SYMLINKS, HARDLINKS AND FILE ARCHIVES - A data de-duplication system is used with network attached storage and serves to reduce data duplication and file storage costs. Techniques utilizing both symlinks and hardlinks ensure efficient deletion file/data cleanup and avoid data loss in the event of crashes. | 04-15-2010 |
20110071989 | FILE AWARE BLOCK LEVEL DEDUPLICATION - A system provides file aware block level deduplication in a system having multiple clients connected to a storage subsystem over a network such as an Internet Protocol (IP) network. The system includes client components and storage subsystem components. Client components include a walker that traverses the namespace looking for files that meet the criteria for optimization, a file system daemon that rehydrates the files, and a filter driver that watches all operations going to the file system. Storage subsystem components include an optimizer resident on the nodes of the storage subsystem. The optimizer can use idle processor cycles to perform optimization. Sub-file compression can be performed at the storage subsystem. | 03-24-2011 |
20110125722 | METHODS AND APPARATUS FOR EFFICIENT COMPRESSION AND DEDUPLICATION - Mechanisms are provided for performing efficient compression and deduplication of data segments. Compression algorithms are learning algorithms that perform better when data segments are large. Deduplication algorithms, however, perform better when data segments are small, as more duplicate small segments are likely to exist. As an optimizer is processing and storing data segments, the optimizer applies the same compression context to compress multiple individual deduplicated data segments as though they are one segment. By compressing deduplicated data segments together within the same context, data reduction can be improved for both deduplication and compression. Mechanisms are applied to compensate for possible performance degradation. | 05-26-2011 |
20110302409 | METHOD AND SYSTEM FOR VERIFICATION OF AN ENDPOINT SECURITY SCAN - A method of granting access to resources includes the step of receiving a request from a node to access a resource. A scanning agent is generated to gather information about the node. A key is generated and embedded in the scanning agent. The scanning agent is transmitted to the node and gathers information regarding the node. The scanning agent encrypts the gathered information using the at least one generated key. The encrypted gathered information is received from the scanning agent and decrypted. | 12-08-2011 |
20130297572 | FILE AWARE BLOCK LEVEL DEDUPLICATION - A system provides file aware block level deduplication in a system having multiple clients connected to a storage subsystem over a network such as an Internet Protocol (IP) network. The system includes client components and storage subsystem components. Client components include a walker that traverses the namespace looking for files that meet the criteria for optimization, a file system daemon that rehydrates the files, and a filter driver that watches all operations going to the file system. Storage subsystem components include an optimizer resident on the nodes of the storage subsystem. The optimizer can use idle processor cycles to perform optimization. Sub-file compression can be performed at the storage subsystem. | 11-07-2013 |
Patent application number | Description | Published |
20090158418 | SYSTEMS AND METHODS FOR PROVIDING A VPN SOLUTION - A system, apparatus and a method for implementing a secured communications link at a layer other than that at which packets are filtered are disclosed. In one embodiment, a computer system is configured to form a virtual private network (“VPN”) and comprises an address inspection driver to identify initial target packet traffic addressed to a target server. Also, the computer system includes a pseudo server module to receive rerouted initial target packet traffic from the address inspection driver. The pseudo server module is configured to convey packet regeneration instructions to a VPN gateway. The address inspection driver functions to identify additional target packet traffic addressed to the target server and routes the additional target packet traffic to the pseudo server. In one embodiment, the pseudo server is configured to strip header information from the additional target packet traffic to form a payload, and thereafter, to route the payload to the target. | 06-18-2009 |
20100002693 | METHOD AND SYSTEMS FOR ROUTING PACKETS FROM AN ENDPOINT TO A GATEWAY - A method for routing packets from an endpoint to a gateway includes receiving, by a driver of a process for providing secure communications to a gateway from an endpoint, a filtering table. The driver may intercept an outbound packet, the driver terminating a first transport layer connection with an application of the endpoint. The driver may transmit the outbound packet to a client application, responsive to the filtering table. The client application provides a second transport layer connection from the endpoint to the gateway. Responsive to an application of a policy to the outbound packet, the client application may transmit the outbound packet to the gateway. | 01-07-2010 |
20100005288 | SYSTEMS AND METHODS FOR ADJUSTING THE MAXIMUM TRANSMISSION UNIT BY AN INTERMEDIARY DEVICE - The present invention is generally directed towards a remote access architecture for providing peer-to-peer communications and remote access connectivity. In one embodiment, the remote access architecture of the present invention provides a method for establishing a direct connection between peer computing devices via a third computing device, such as a gateway. Additionally, the present invention provides the following techniques to optimize peer-to-peer communications: 1) false acknowledgement of receipt of network packets allowing communications via a lossless protocol of packets constructed for transmission via a lossy protocol, 2) payload shifting of network packets allowing communications via a lossless protocol of packets constructed for transmission via a lossy protocol, 3) reduction of packet fragmentation by adjusting the maximum transmission unit (MTU) parameter, accounting for overhead due to encryption, 4) application-aware prioritization of client-side network communications, and 5) network disruption shielding for reliable and persistent network connectivity and access. | 01-07-2010 |
20100232429 | SYSTEMS AND METHODS FOR COMMUNICATING A LOSSY PROTOCOL VIA A LOSSLESS PROTOCOL - The present invention is generally directed towards a remote access architecture for providing peer-to-peer communications and remote access connectivity. In one embodiment, the remote access architecture of the present provides a method for establishing a direct connection between peer computing devices via a third computing device, such as a gateway. Additionally, the present invention provides the following techniques to optimize peer-to peer communications: 1) false acknowledgement of receipt of network packets allowing communications via a lossless protocol of packets constructed for transmission via a lossy protocol, 2) payload shifting of network packets allowing communications via a lossless protocol of packets constructed for transmission via a lossy protocol, 3) reduction of packet fragmentation by adjusting the maximum transmission unit (MTU) parameter, accounting for overhead due to encryption, 4) application-aware prioritization of client-side network communications, and 5) network disruption shielding for reliable and persistent network connectivity and access. | 09-16-2010 |
20100325299 | Systems and Methods for Communicating a Lossy Protocol Via a Lossless Protocol Using False Acknowledgements - The present invention is generally directed towards a remote access architecture for providing peer-to-peer communications and remote access connectivity. In one embodiment, the remote access architecture of the present provides a method for establishing a direct connection between peer computing devices via a third computing device, such as a gateway. Additionally, the present invention provides the following techniques to optimize peer-to-peer communications: 1) false acknowledgement of receipt of network packets allowing communications via a lossless protocol of packets constructed for transmission via a lossy protocol, 2) payload shifting of network packets allowing communications via a lossless protocol of packets constructed for transmission via a lossy protocol, 3) reduction of packet fragmentation by adjusting the maximum transmission unit (MTU) parameter, accounting for overhead due to encryption, 4) application-aware prioritization of client-side network communications, and 5) network disruption shielding for reliable and persistent network connectivity and access. | 12-23-2010 |
20110231929 | SYSTEMS AND METHODS FOR PROVIDING A VPN SOLUTION - A system, apparatus and a method for implementing a secured communications link at a layer other than that at which packets are filtered are disclosed. In one embodiment, a computer system is configured to form a virtual private network (“VPN”) and comprises an address inspection driver to identify initial target packet traffic addressed to a target server. Also, the computer system includes a pseudo server module to receive rerouted initial target packet traffic from the address inspection driver. The pseudo server module is configured to convey packet regeneration instructions to a VPN gateway. The address inspection driver functions to identify additional target packet traffic addressed to the target server and routes the additional target packet traffic to the pseudo server. In one embodiment, the pseudo server is configured to strip header information from the additional target packet traffic to form a payload, and thereafter, to route the payload to the target. | 09-22-2011 |
20130014206 | METHOD AND SYSTEMS FOR SECURING REMOTE ACCESS TO PRIVATE NETWORKS - A method for securing remote access to private networks includes a receiver intercepting from a data link layer a packet in a first plurality of packets destined for a first system on a private network. A filter intercepts from the data link layer a packet in a second plurality of packets transmitted from a second system on the private network, destined for an system on a second network. A transmitter in communication with the receiver and the filter performing a network address translation on at least one intercepted packet and transmitting the at least one intercepted packet to a destination. | 01-10-2013 |
20130128892 | METHOD AND SYSTEMS FOR ROUTING PACKETS FROM A GATEWAY TO AN ENDPOINT - A method for routing packets from a gateway to an endpoint includes the step of associating a private internet protocol (IP) address with an endpoint having a public IP address. A packet addressed to the private IP address of the endpoint is captured. A policy is applied to the packet. The packet is transmitted to the public IP address of the endpoint, responsive to the application of the policy to the packet. | 05-23-2013 |
20140007218 | SYSTEMS AND METHODS FOR PROVIDING A VPN SOLUTION | 01-02-2014 |
Patent application number | Description | Published |
20080222123 | METHOD AND SYSTEM FOR CLEANSING SEQUENCE-BASED DATA AT QUERY TIME - A method and system for cleansing anomalies from sequence-based data at query time. Sequence-based data such as RFID data is loaded into a database. One or more cleansing rules are received at a cleansing rules engine. The cleansing rule engine converts the cleansing rule(s) to a template that includes logic to compensate for anomalies in the sequence-based data. A query to retrieve the sequence-based data is received by a query rewrite engine. The query rewrite engine rewrites the query by applying the template logic. The rewritten query is executed at query time. The result of the rewritten query execution is identical to the result of executing the original query on a data set generated by applying the cleansing rule to all of the sequence-based data. | 09-11-2008 |
20080263001 | SYSTEM AND METHOD FOR AUTOMATING DATA PARTITIONING IN A PARALLEL DATABASE - A system for automating data partitioning in a parallel database includes plural nodes connected in parallel. Each node includes a database server and two databases connected thereto. Each database server includes a query optimizer. Moreover, a partitioning advisor communicates with the database server and the query optimizer. The query optimizer and the partitioning advisor include a program for recommending and evaluating data table partitions that are useful for processing a workload of query statements. The data table partitions are recommended and evaluated without requiring the data tables to be physically repartitioned. | 10-23-2008 |
20090106244 | DISCOVERING INTERESTINGNESS IN FACETED SEARCH - Exemplary embodiments of the present invention relate to enhanced faceted search support for OLAP queries over unstructured text as well as structured dimensions by the dynamic and automatic discovery of dimensions that are determined to be most “interesting” to a user based upon the data. Within the exemplary embodiments “interestingness” is defined as how surprising a summary along some dimensions is from a user's expectation. Further, multi-attribute facets are determined and a user is optionally permitted to specify the distribution of values that she expects, and/or the distance metric by which actual and expected distributions are to be compared. | 04-23-2009 |
20100211572 | INDEXING AND SEARCHING JSON OBJECTS - Disclosed is a method of encoding JavaScript Object Notation (JSON) documents in an inverted index, wherein a tree representation of a JSON document is first generated, and, next, the JSON document is shredded into a list of tuples for each atom node, n, in the tree, where value is a label associated with n, path is a concatenation of node labels associated with ancestors of n, type is a description of a type of value, and jdewey of n is a partial Dewey code of its closest ancestor array node, if one exists, or empty, otherwise. Lastly, an inverted index is built using as index term, and jdewey as payload. A method is also described to search the inverted index. | 08-19-2010 |
20120179684 | SEMANTICALLY AGGREGATED INDEX IN AN INDEXER-AGNOSTIC INDEX BUILDING SYSTEM - A computer program product for an indexer-agnostic index building system includes a computer readable storage medium to store a computer readable program, wherein the computer readable program, when executed on a computer, causes the computer to perform operations for creating a semantically aggregated index. The operations include: extracting documents from a data source, wherein each document includes a data object; distributing the documents to a plurality of processing nodes within the system; for each node: indexing the data objects for each document into fields using semantic rules; and grouping indexed data objects for related fields by: classifying the documents into logical groups based on the semantic rules; and creating a searchable index shard for related logical groups. | 07-12-2012 |
20120254089 | Vector throttling to control resource use in computer systems - Embodiments of the invention relate to building a distributed reverse semantic index. In one general embodiment a plurality of documents are received with each document having at least one defined rule and or semantic. The documents are distributed among a plurality of nodes of a system. The documents are processed in a generally parallel fashion. Processing the documents includes processing text data of each of the document and breaking each document into fields to index the text data to create index data by deferring how to categorize the text data based upon the defined rule and or semantics. The indexed data is combined back together to create an indexer-agnostic semantic index including a plurality of the semantic index shards and to semantically classify the documents based on the index shards into groups based on document type to create the distributed reverse semantic index. | 10-04-2012 |
20120271795 | SCALABLE ROW-STORE WITH CONSENSUS-BASED REPLICATION - A method for updating a scalable row-store, including: receiving an update to a key within a range of keys in a database table, wherein the database table is distributed across nodes in a cluster of computing devices; and replicating the update over a group of the nodes using a consensus-based replication algorithm, wherein the replication algorithm includes completing the update in response to receiving acknowledgement messages from a majority of the nodes in the group indicating that the majority has received notification of the update. | 10-25-2012 |
20120323919 | DISTRIBUTED REVERSE SEMANTIC INDEX - Embodiments of the invention relate to building a distributed reverse semantic index. In one general embodiment a plurality of documents are received with each document having at least one defined rule and or semantic. The documents are distributed among a plurality of nodes of a system. The documents are processed in a generally parallel fashion. Processing the documents includes processing text data of each of the document and breaking each document into fields to index the text data to create index data by deferring how to categorize the text data based upon the defined rule and or semantics. The indexed data is combined back together to create an indexer-agnostic semantic index including a plurality of the semantic index shards and to semantically classify the documents based on the index shards into groups based on document type to create the distributed reverse semantic index. | 12-20-2012 |
20120323920 | CREATING A SEMANTICALLY AGGREGATED INDEX IN AN INDEXER-AGNOSTIC INDEX BUILDING SYSTEM - A method for creating a semantically aggregated index in an indexer-agnostic index building system includes: extracting documents from a data source, each document including a data object; distributing the documents to a plurality of processing nodes within the system; for each node: indexing the data objects for each document into fields using semantic rules; and grouping indexed data objects for related fields by: classifying the documents into logical groups based on the semantic rules; and creating a searchable index shard for related logical groups. | 12-20-2012 |
Patent application number | Description | Published |
20100140680 | Double Polysilicon Process for Non-Volatile Memory - A process flow for creating a non-volatile memory cell, the process flow including the steps of forming a doped well in a semiconducting portion of a substrate, forming a gate dielectric layer on top of the substrate, depositing a first polysilicon layer on top of the gate dielectric layer, patterning and etching the first polysilicon layer, selectively oxidizing the first polysilicon layer, implanting lightly-doped source/drain regions into the well, forming sidewall spacers adjacent the first polysilicon layer, implanting source/drain regions into the well, thereby forming a channel area, depositing a dielectric layer on top of the first polysilicon layer, depositing a second polysilicon layer on top of the dielectric layer, forming a masking layer on the second polysilicon layer, and etching both the second polysilicon layer and the dielectric layer using the masking layer. | 06-10-2010 |
20100205504 | Automatic refresh for improving data retention and endurance characteristics of an embedded non-volatile memory in a standard CMOS logic process - A method for selectively refreshing data in a nonvolatile memory array based on failure type detected by an error correction code. If the page is determined to be error-free, no refresh operation takes place. Otherwise, if single-error words on a page contain erased and programmed bit errors, then a refresh operation, consisting of an erase and program, takes place. The erase operation is skipped if single-error words on a page solely contain a program failure. | 08-12-2010 |
20100208530 | Two Bits Per Cell Non-Volatile Memory Architecture - A memory circuit for holding a single binary value. A first bit cell holds one of a logical high value and a logical low value, and a second bit cell also holds one of a logical high value and a logical low value. Circuitry is provided for placing a logical high value in the first bit cell when the binary value in the memory circuit is to be a logical high value, and circuitry is provided for placing a logical high value in the second bit cell when the binary value in the memory circuit is to be a logical low value. In this manner, a logical high value exists within the memory circuit, whether the single binary value within the memory circuit is a logical high value or a logical low value. The difference between the two values of the binary value is which of the two bit cells holds the logical high value. Thus, this memory circuit can be sensed without the use of a sense amplifier. | 08-19-2010 |
Patent application number | Description | Published |
20140195595 | INPUT REDIRECTION WITH A CLOUD CLIENT DEVICE - In one embodiment, a cloud client device identifies one or more devices within a pre-determined range of the cloud client device operable to communicate with the cloud client device. The cloud client device pairs with one or more of the devices. The cloud client device receives first input from a client device coupled to the cloud client device. The cloud client device translates the first input from a first format to a second format and sends the translated first input to one of the one or more devices. The cloud client device receives second input from one of the one or more devices, translates the second input from a third format to a fourth format, and provides the translated second input to the client device. | 07-10-2014 |
20140196117 | RECOVERY OR UPGRADE OF A CLOUD CLIENT DEVICE - In one embodiment, a cloud client device sends authentication data to a cloud services system. When the cloud services system determines the cloud client device is authenticated, the cloud client device receives data for configuring the cloud client device from the cloud services system, the data including one or more software modules associated with a communication protocol. When the cloud services system determines the cloud client device is not authenticated, the cloud client device conducts a data wipe of the cloud client device. | 07-10-2014 |
20140196137 | UNIFIED COMMUNICATIONS WITH A CLOUD CLIENT DEVICE - In one embodiment, a cloud client device receives an indication of a coupling with a client device. The cloud client device sends authentication data to a cloud services system and receives data for configuring the cloud client device from the cloud services system, the data including one or more software modules associated with a communication protocol. The cloud client device receives input from a user of the client device and transmits the input in accordance with the communication protocol. | 07-10-2014 |
Patent application number | Description | Published |
20090318949 | SEALING APPARATUS AND METHODS OF USE - A system for treating an aneurysm comprises at least a first double-walled filling structure having an outer wall and an inner wall and the filling structure is adapted to be filled with a hardenable fluid filling medium so that the outer wall conforms to the inside surface of the aneurysm and the inner surface forms a generally tubular lumen to provide blood flow. The first filling structure comprises a sealing feature which forms a fluid seal between the filling structure and the aneurysm or an adjacent endograft when the filling structure is filled with the hardenable fluid filling medium, thereby minimizing or preventing blood flow downstream of the seal. | 12-24-2009 |
20090319029 | DOCKING APPARATUS AND METHODS OF USE - A system for treating an aneurysm in a blood vessel comprises a docking scaffold having with upstream and downstream ends, and a central passageway therebetween. The upstream end engages the blood vessel upstream of the aneurysm. A portion of a first and second scaffolds are slidably received in the central passageway such that an outside surface of the first and second scaffolds engage an inside surface of the docking scaffold. A double-walled filling structure has outer and inner walls and the filling structure is adapted to be filled with a hardenable fluid filling medium so that the outer wall conforms to an inside surface of the aneurysm and the inner wall forms a substantially tubular lumen to provide a path for blood flow therethrough. The double-walled filling structure is coupled with at least one of the first and second leg scaffolds in expanded configuration. | 12-24-2009 |
20100004728 | GRAFT ENDOFRAME HAVING AXIALLY VARIABLE CHARACTERISTICS - A prosthesis comprises a tubular body that is expandable from a contracted configuration to a radially expanded configuration. The tubular body has a total length and comprises a first section, a second section and a central section disposed therebetween. The total length of the tubular body in the expanded configuration is at least 95% of the total length of the tubular body in the contracted configuration. The three sections have a plurality of tubular rings, each with a plurality of struts having a length and coupled together to form a series of peaks and valleys. A connector couples adjacent tubular rings together. The length of the central section struts is different than the length of the other struts and the central section is coupled with both the first and second sections. | 01-07-2010 |
20100036360 | STENT GRAFT DELIVERY SYSTEM - A system for treating an aneurysm comprises an elongate flexible shaft and an expandable member. An expandable scaffold is disposed over the expandable member and may be expanded from a collapsed configuration to an expanded configuration. A double-walled filling structure is disposed over the scaffold and has an outer wall and an inner wall. The filling structure is adapted to be filled with a hardenable fluid filing medium so that the outer wall conforms to an inside surface of the aneurysm and the inner wall forms a substantially tubular lumen to provide a path for blood flow. In the expanded configuration the scaffold engages the inner wall of the filling structure. A tether is releasably coupled with the filling structure and the flexible shaft thereby constraining axial movement of the structures relative to each other. | 02-11-2010 |
20110276078 | FILLING STRUCTURE FOR A GRAFT SYSTEM AND METHODS OF USE - A system for treating an aneurysm includes a first double-walled filling structure having an outer wall and an inner wall. The filling structure is adapted to be filled with a hardenable fluid filling medium so that the outer wall conforms to an inside surface of the aneurysm and the inner wall forms a generally tubular lumen to permit blood flow therethrough. The inner wall comprises a blood contacting layer and a reinforcing layer. The reinforcing layer prevents circumferential creep or elastic expansion of the lumen. | 11-10-2011 |
20120016456 | Stent Graft Delivery System - A system for treating an aneurysm comprises an elongate flexible shaft and an expandable member. An expandable scaffold is disposed over the expandable member and may be expanded from a collapsed configuration to an expanded configuration. A double-walled filling structure is disposed over the scaffold and has an outer wall and an inner wall. The filling structure is adapted to be filled with a hardenable fluid filing medium so that the outer wall conforms to an inside surface of the aneurysm and the inner wall forms a substantially tubular lumen to provide a path for blood flow. In the expanded configuration the scaffold engages the inner wall of the filling structure. A tether is releasably coupled with the filling structure and the flexible shaft thereby constraining axial movement of the structures relative to each other. | 01-19-2012 |
20120203264 | Graft Systems Having Semi-Permeable Filling Structures and Methods for Their Use - Aneurysms are treated by filling at least one double-walled filling structure with a filling medium within the aneurysm, such as filling structures having a membrane that allows water molecules to permeate across the membrane in response to a water potential differential across the membrane. The transport of fluid across the membrane allows the bag to expand or shrink to accommodate changes in the size or shape of the aneurysm, thereby maintaining a seal between the filling structure against the vessel wall and maintaining apposition of the filling structure against the inside surface of the aneurysm. Transport of water molecules into or out of the filling structure is controlled by adjusting for the osmolarity of the filling fluid medium. The filling structures may be delivered over balloon deployment mechanisms in order to shape occlude the aneurysm and open a tubular lumen for flow of blood through the filling structure. | 08-09-2012 |
20150148892 | SEALING APPRATUS AND METHODS OF USE - A system for treating an aneurysm comprises at least a first double-walled filling structure having an outer wall and an inner wall and the filling structure is adapted to be filled with a hardenable fluid filling medium so that the outer wall conforms to the inside surface of the aneurysm and the inner surface forms a generally tubular lumen to provide blood flow. The first filling structure comprises a sealing feature which forms a fluid seal between the filling structure and the aneurysm or an adjacent endograft when the filling structure is filled with the hardenable fluid filling medium, thereby minimizing or preventing blood flow downstream of the seal. | 05-28-2015 |
20150216535 | STENT GRAFT DELIVERY SYSTEM - A system for treating an aneurysm comprises an elongate flexible shaft and an expandable member. An expandable scaffold is disposed over the expandable member and may be expanded from a collapsed configuration to an expanded configuration. A double-walled filling structure is disposed over the scaffold and has an outer wall and an inner wall. The filling structure is adapted to be filled with a hardenable fluid filing medium so that the outer wall conforms to an inside surface of the aneurysm and the inner wall forms a substantially tubular lumen to provide a path for blood flow. In the expanded configuration the scaffold engages the inner wall of the filling structure. A tether is releasably coupled with the filling structure and the flexible shaft thereby constraining axial movement of the structures relative to each other. | 08-06-2015 |
Patent application number | Description | Published |
20090076754 | Methods, systems and apparatuses for modeling optical images - Methods, systems and apparatuses for modeling high resolution images which significantly shortens computation time and reduces image artifacts, as compared to known methods. Embodiments implement a look-up table, to compute once and store the point spread functions for various points of an image. During modeling of the optical system, previously stored point spread functions may be used to determine the point spread function for a specified point using a weighted interpolation of the point spread functions that have been stored for nearby points. | 03-19-2009 |
20090297056 | METHOD AND APPARATUS FOR EXTENDED DEPTH-OF-FIELD IMAGE RESTORATION - A method and apparatus are disclosed for restoring an image captured through an extended depth-of-field lens. Preprocessed data relating to image degradation is stored and used during an image restoration process. | 12-03-2009 |
20100110241 | MULTI ILLUMINANT SHADING CORRECTION USING SINGULAR VALUE DECOMPOSITION - Methods and systems for determining shading correction coefficients of an imaging device. An inversion surface is determined based on an image captured by the imaging device. The inversion surface is approximated using the captured image and eigenvectors associated with singular values of the inversion surface, to form multiple reconstruction weights. A polynomial fit is applied to: i) the multiple reconstruction weights to determine a first set of polynomial coefficients and ii) the eigenvectors to determine a second set of polynomial coefficients. The first and second sets of polynomial coefficients are used to form the shading correction coefficients. | 05-06-2010 |
20130175429 | IMAGE SENSOR, IMAGE SENSING METHOD, AND IMAGE CAPTURING APPARATUS INCLUDING THE IMAGE SENSOR - An image sensor that includes a pixel array including pixels that sample a plurality of modulation signals having different phases from the reflected light and that output pixel output signals corresponding to the plurality of modulation signals, the output pixel output signals being used to generate first images, an integral time adjusting unit that detects a change in an integral time applied to generate the first images such that the integral time adjusting unit compares intensities of the first images to a reference intensity and determines an adjusted integral time when the change in the integral time is detected, and when the change in the integral time is detected, the pixel array generates second images that are subsequent to the first images by applying the adjusted integral time determined by the integral time adjusting unit based on the first images. | 07-11-2013 |
20130176426 | IMAGE SENSOR, METHOD OF SENSING IMAGE, AND IMAGE CAPTURING APPARATUS INCLUDING THE IMAGE SENSOR - The image sensor for sensing an image of an object by receiving reflected light obtained after output light is reflected by the object includes a pixel array that includes color pixels and depth pixels which receive the reflected light and a shuttering unit that facilitates outputting of color pixel signals by resetting the color pixels in units of a color integration time and reading the color pixels in units of the color integration time, and facilitates outputting depth pixel signals by resetting the depth pixels in units of a depth integration time, different from the color integration time, and reading the depth pixels in units of the depth integration time. | 07-11-2013 |
20130176550 | IMAGE SENSOR, IMAGE SENSING METHOD, AND IMAGE PHOTOGRAPHING APPARATUS INCLUDING THE IMAGE SENSOR - An image sensor includes a pixel array sensing a plurality of modulation signals having different phases from the reflected light and outputting pixel output signals corresponding to the plurality of modulation signals, a depth information calculation unit for estimating a delay between the output light and the reflected light from images formed from the pixel output signals and calculating depth information regarding the object, and an integration time register. When integration times corresponding to the images used to calculate the depth information in the depth information calculation unit are different from each other, the integration time register obtains a gain corresponding to a difference between the integration times and the depth information calculation unit applies the gain to images having different integration times. | 07-11-2013 |