Patent application number | Description | Published |
20080226918 | Cable Semiconducting Shield - A cable comprising one or more electrical conductors or communications media or a core of two or more electrical conductors or communications media, each electrical conductor, communications medium, or core being surrounded by a layer comprising: | 09-18-2008 |
20080242171 | Production of nanofibers by melt spinning - A process and apparatus for forming nanofibers from a spinning melt utilizing a high speed rotating distribution disc. The fibers can be collected into a uniform web for selective barrier end uses. Fibers with an average fiber diameter of less that 1,000 nm can be produced. | 10-02-2008 |
20120183668 | AQUACULTURE FEED COMPOSITIONS - A method of microbial cell disruption for use in making an aquaculture feed composition is disclosed, wherein a microbial biomass having a moisture level less than 10 weight percent and comprising oil-containing microbes is disrupted, resulting in a disruption efficiency of at least 30% of the oil-containing microbes to produce a disrupted microbial biomass, and, the disrupted microbial biomass is mixed with at least one aquaculture feed component to form an aquaculture feed composition. | 07-19-2012 |
20130012637 | IMPROVED PROCESS FOR FORMING POLYARYLENE SULFIDE FIBERS - An improved process for forming polyarylene sulfide fibers is provided. The process comprises forming at least one fiber from a polymer melt comprising a polyarylene sulfide and at least one tin additive comprising a branched tin(II) carboxylate. Using such a melt, the fiber forming continuity is improved compared to that of the native polyarylene sulfide melt processed under the same conditions. | 01-10-2013 |
20130012638 | METHODS OF DECREASING VISCOSITY OF A POLYARYLENE SULFIDE-CONTAINING POLYMER MELT - This invention relates to methods for decreasing the complex viscosity of a polyarylene sulfide polymer melt while maintaining the molecular weight of the polyarylene sulfide with time. This invention also relates to polymer melt compositions comprising a polyarylene sulfide, wherein the complex viscosity of the composition is decreased relative to the complex viscosity of the native polyarylene sulfide measured under the same conditions, and the weight average molecular weight of the polyarylene sulfide is maintained. The methods of decreasing the complex viscosity of a polyarylene sulfide-containing polymer melt, and the polymer melt compositions so obtained, are useful in processes to produce fibers, films, nonwovens, and molded parts from polyarylene sulfides. | 01-10-2013 |
20130045226 | METHOD FOR FORMING AND EXTRACTING SOLID PELLETS COMPRISING OIL-CONTAINING MICROBES - A process including: (a) mixing a microbial biomass, comprising oil-containing microbes, and at least one grinding agent capable of absorbing oil, to provide a disrupted biomass mix; (b) blending at least one binding agent with said disrupted biomass mix to provide a fixable mix capable of forming a solid pellet; and, (c) forming the solid pellet from the fixable mix. The process optionally includes extracting the solid pellet with a solvent to provide an extracted microbial oil. | 02-21-2013 |
20130046105 | METHOD FOR OBTAINING A LIPID-CONTAINING COMPOSITION FROM MICROBIAL BIOMASS - Methods are provided for pelletizing a microbial biomass, extracting a refined lipid composition from the pelletized biomass under supercritical conditions and distilling the refined lipid composition, at least once under short path distillation conditions, to obtain a lipid-containing fraction. Also disclosed are methods of making lipid-containing oil concentrates therefrom, by transesterifying and enriching the lipid-containing fraction. | 02-21-2013 |
20140329295 | METHOD FOR FORMING AND EXTRACTING SOLID PELLETS COMPRISING OIL-CONTAINING MICROBES - A process including: (a) mixing a microbial biomass, comprising oil-containing microbes, and at least one grinding agent capable of absorbing oil, to provide a disrupted biomass mix; (b) blending at least one binding agent with said disrupted biomass mix to provide a fixable mix capable of forming a solid pellet; and, (c) forming the solid pellet from the fixable mix. The process optionally includes extracting the solid pellet with a solvent to provide an extracted microbial oil. | 11-06-2014 |
20150218484 | METHOD FOR OBTAINING A LIPID-CONTAINING COMPOSITION FROM MICROBIAL BIOMASS - Methods are provided for pelletizing a microbial biomass, extracting a refined lipid composition from the pelletized biomass under supercritical conditions and distilling the refined lipid composition, at least once under short path distillation conditions, to obtain a lipid-containing fraction. Also disclosed are methods of making lipid-containing oil concentrates therefrom, by transesterifying and enriching the lipid-containing fraction. | 08-06-2015 |
Patent application number | Description | Published |
20100318519 | Incremental Maintenance of Inverted Indexes for Approximate String Matching - In embodiments of the disclosed technology, indexes, such as inverted indexes, are updated only as necessary to guarantee answer precision within predefined thresholds which are determined with little cost in comparison to the updates of the indexes themselves. With the present technology, a batch of daily updates can be processed in a matter of minutes, rather than a few hours for rebuilding an index, and a query may be answered with assurances that the results are accurate or within a threshold of accuracy. | 12-16-2010 |
20120323870 | Incremental Maintenance of Inverted Indexes for Approximate String Matching - In embodiments of the disclosed technology, indexes, such as inverted indexes, are updated only as necessary to guarantee answer precision within predefined thresholds which are determined with little cost in comparison to the updates of the indexes themselves. With the present technology, a batch of daily updates can be processed in a matter of minutes, rather than a few hours for rebuilding an index, and a query may be answered with assurances that the results are accurate or within a threshold of accuracy. | 12-20-2012 |
20140156642 | Generating And Using Temporal Metadata Partitions - Concepts and technologies are disclosed herein for generating and using temporal metadata partitions. Metadata can be stored in temporal metadata partitions based upon a time range included in the metadata. Furthermore, metadata can be stored in multiple temporal metadata partitions to which the metadata is relevant. As such, metadata can be stored in manner that allows event data to be understood in the context of temporally accurate and/or relevant metadata. Functionality for executing queries of event data and providing results in view of metadata, as well as the merging of multiple temporal metadata partitions also are disclosed. | 06-05-2014 |
20140164409 | Generating And Using Temporal Data Partition Revisions - Concepts and technologies are disclosed herein for generating and using temporal data partition revisions. In some embodiments, a server computer can execute a data management application. The server computer can obtain a data partition associated with a data stream. The data partition can include a data point and a timestamp. The server computer can analyze the timestamp to determine if the data partition corresponds to an update of a base data record. If the server computer determines that the data corresponds to an update, the server computer can compute a revision comprising a delta and a timestamp and store the revision. | 06-12-2014 |
20140164430 | Managing A Distributed Database - Concepts and technologies are disclosed herein for managing a distributed database. A data management application can obtain a query. The data management application can analyze the query to determine a number of data structures relevant to the query. The data management application also can analyze data stores storing the data structures and move or assign data structures to other data stores within a distributed database. The movement of the data structures within the distributed database can be based upon greedy algorithms for moving data and/or executing queries. | 06-12-2014 |
20150095326 | Generating And Using Temporal Metadata Partitions - Concepts and technologies are disclosed herein for generating and using temporal metadata partitions. Metadata can be stored in temporal metadata partitions based upon a time range included in the metadata. Furthermore, metadata can be stored in multiple temporal metadata partitions to which the metadata is relevant. As such, metadata can be stored in manner that allows event data to be understood in the context of temporally accurate and/or relevant metadata. Functionality for executing queries of event data and providing results in view of metadata, as well as the merging of multiple temporal metadata partitions also are disclosed. | 04-02-2015 |
20160042029 | Managing a Distributed Database - Concepts and technologies are disclosed herein for managing a distributed database. A data management application can obtain a query. The data management application can analyze the query to determine a number of data structures relevant to the query. The data management application also can analyze data stores storing the data structures and move or assign data structures to other data stores within a distributed database. The movement of the data structures within the distributed database can be based upon greedy algorithms for moving data and/or executing queries. | 02-11-2016 |
20160098457 | Generating and Using Temporal Metadata Partitions - Concepts and technologies are disclosed herein for generating and using temporal metadata partitions. Metadata can be stored in temporal metadata partitions based upon a time range included in the metadata. Furthermore, metadata can be stored in multiple temporal metadata partitions to which the metadata is relevant. As such, metadata can be stored in manner that allows event data to be understood in the context of temporally accurate and/or relevant metadata. Functionality for executing queries of event data and providing results in view of metadata, as well as the merging of multiple temporal metadata partitions also are disclosed. | 04-07-2016 |
Patent application number | Description | Published |
20090171944 | Set Similarity selection queries at interactive speeds - The similarity between a query set comprising query set tokens and a database set comprising database set tokens is determined by a similarity score. The database sets belong to a data collection set, which contains all database sets from which information may be retrieved. If the similarity score is greater than or equal to a user-defined threshold, the database set has information relevant to the query set. The similarity score is calculated with an inverse document frequency method (IDF) similarity measure independent of term frequency. The document frequency is based at least in part on the number of database sets in the data collection set and the number of database sets which contain at least one query set token. The length of the query set and the length of the database set are normalized. | 07-02-2009 |
20100125559 | SELECTIVITY ESTIMATION OF SET SIMILARITY SELECTION QUERIES - The invention relates to a system and/or methodology for selectivity estimation of set similarity queries. More specifically, the invention relates to a selectivity estimation technique employing hashed sampling. The invention providing for samples constructed a priori that can efficiently and quickly provide accurate estimates for arbitrary queries, and can be updated efficiently as well. | 05-20-2010 |
20100132036 | VERIFICATION OF OUTSOURCED DATA STREAMS - Embodiments disclosed herein are directed to verifying query results of an untrusted server. A data owner outsources a data stream to the untrusted server, which is configured to respond to a query from a client with the query result, which is returned to the client. The data owner can maintain a vector associated with query results returned by the server and can generate a verification synopsis using the vector and a seed. The verification synopsis includes a polynomial, where coefficients of the polynomial are determined based on the seed. The data owner outputs the verification synopsis and the seed to a client for verification of the query results. | 05-27-2010 |
Patent application number | Description | Published |
20110219447 | Identification of Unauthorized Code Running in an Operating System's Kernel - Computer implemented methods, system and apparatus for managing execution of a running-page in a virtual machine include associating an execution trace code with the running page by a security virtual machine. The execution trace code generates a notification upon initiation of the execution of the running page by the virtual machine. The notification is received by the security virtual machine running independent of the virtual machine executing the running-page. The running page associated with the execution trace code is validated by the security virtual machine as authorized for execution. An exception is generated if the running-page is not authorized for execution. The generated exception is to prevent the execution of the running page in the virtual machine. | 09-08-2011 |
20130312096 | ON-DEMAND DATA SCAN IN A VIRTUAL MACHINE - A system is provided to facilitate on-demand data scan operation in a guest virtual machine. During operation, the system generates an on-demand scan request at a scanning virtual machine, wherein the request specifies a scope for the on-demand scan. The system communicates the on-demand scan request to the guest virtual machine and receives data from the guest virtual machine in response to the request. The system identifies the data as candidate for on-demand scanning and scans the data in furtherance of a security or data integrity objective. | 11-21-2013 |
20140019962 | SCAN SYSTEMS AND METHODS OF SCANNING VIRTUAL MACHINES - A method and a system scan a virtual machine (VM). The method stores a first copy of a scan token associated with a first scan operation within a VM and stores a second copy of the scan token in a database accessible by a management module. Upon restarting of the VM, a scan token in the restarted VM is compared with a scan token associated with the restarted VM in the database. The scan token in the restarted VM is current when the scan token in the restarted VM matches the scan token in the database. A first scan operation is resumed on the restarted VM when it is determined that the scan token in the restarted VM is current, and a new first scan operation of the restarted VM is initiated when it is determined that the scan token in the restarted VM is not current. | 01-16-2014 |
20140215226 | METHOD AND SYSTEM FOR PREVENTING TAMPERING WITH SOFTWARE AGENT IN A VIRTUAL MACHINE - Techniques are disclosed for monitoring a software agent running in a virtual machine to prevent execution of the software agent from being tampered with. In one embodiment, the software agent bootstraps such monitoring by ensuring that its code is present in memory and providing the code, memory addresses associated with the code, and a cryptographic signature of the code, to a monitoring process upon request. In response to receiving the code, the monitoring process checks the code using the cryptographic signatures and further ensures that the code is present in memory at the provided address. The monitoring process may then placing write traces on all memory pages of the agent and execution trace(s) on certain pages of the agent. By tracking writes to and execution of the respective pages, the monitoring process may determine whether the agent has been modified and whether the agent is still running | 07-31-2014 |
Patent application number | Description | Published |
20100014718 | Computationally Efficient Feature Extraction and Matching Iris Recognition - A method and system for uniquely identifying a subject based on an iris image. After obtaining the iris image, the method produces a filtered iris image by applying filters to the iris image to enhance discriminative features of the iris image. The method analyzes an intensity value for pixels in the filtered iris image to produce an iris code that uniquely identifies the subject. The method also creates a segmented iris image by detecting an inner and outer boundary for an iris region in the iris image, and remapping pixels in the iris region, represented in a Cartesian coordinate system, to pixels in the segmented iris image, represented in a log-polar coordinate system, by employing a logarithm representation process. The method also creates a one-dimensional iris string from the iris image by unfolding the iris region by employing a spiral sampling method to obtain sample pixels in the iris region, wherein the sample pixels are the one-dimensional iris string. | 01-21-2010 |
20120183238 | Rapid 3D Face Reconstruction From a 2D Image and Methods Using Such Rapid 3D Face Reconstruction - Creating a 3D face reconstruction model using a single 2D image and a generic facial depth map that provides depth information. In one example, the generic facial depth map is selected based on gender and ethnicity/race. In one embodiment, a set of facial features of the 2D image is mapped to create a facial-feature map, and a 2D mesh is created using the map. The same set of facial features is also mapped onto a generic facial depth map, and a 3D mesh is created therefrom. The 2D image is then warped by transposing depth information from the 3D mesh of the generic facial depth map onto the 2D mesh of the 2D image so as to create a reconstructed 3D model of the face. The reconstructed 3D model can be used, for example, to create one or more synthetic off-angle-pose images of the subject of the original 2D image. | 07-19-2012 |
20130236067 | Computationally Efficient Feature Extraction and Matching Iris Recognition - A method and system for uniquely identifying a subject based on an iris image. After obtaining the iris image, the method produces a filtered iris image by applying filters to the iris image to enhance discriminative features of the iris image. The method analyzes an intensity value for pixels in the filtered iris image to produce an iris code that uniquely identifies the subject. The method also creates a segmented iris image by detecting an inner and outer boundary for an iris region in the iris image, and remapping pixels in the iris region, represented in a Cartesian coordinate system, to pixels in the segmented iris image, represented in a log-polar coordinate system, by employing a logarithm representation process. The method also creates a one-dimensional iris string from the iris image by unfolding the iris region by employing a spiral sampling method to obtain sample pixels in the iris region, wherein the sample pixels are the one-dimensional iris string. | 09-12-2013 |
20160019422 | Computationally Efficient Feature Extraction and Matching Iris Recognition - A method and system for uniquely identifying a subject based on an iris image. After obtaining the iris image, the method produces a filtered iris image by applying filters to the iris image to enhance discriminative features of the iris image. The method analyzes an intensity value for pixels in the filtered iris image to produce an iris code that uniquely identifies the subject. The method also creates a segmented iris image by detecting an inner and outer boundary for an iris region in the iris image, and remapping pixels in the iris region, represented in a Cartesian coordinate system, to pixels in the segmented iris image, represented in a log-polar coordinate system, by employing a logarithm representation process. The method also creates a one-dimensional iris string from the iris image by unfolding the iris region by employing a spiral sampling method to obtain sample pixels in the iris region, wherein the sample pixels are the one-dimensional iris string. | 01-21-2016 |
Patent application number | Description | Published |
20140099029 | Face Age-Estimation and Methods, Systems, and Software Therefor - Age-estimation of a face of an individual is represented in image data. In one embodiment, age-estimation techniques involves combining a Contourlet Appearance Model (CAM) for facial-age feature extraction and Support Vector Regression (SVR) for learning aging rules in order to improve the accuracy of age-estimation over the current techniques. In a particular example, characteristics of input facial images are converted to feature vectors by CAM, then these feature vectors are analyzed by an aging-mechanism-based classifier to estimate whether the images represent faces of younger or older people prior to age-estimation, the aging-mechanism-based classifier being generated in one embodiment by running Support Vector Machines (SVM) on training images. In an exemplary binary youth/adult classifier, faces classified as adults are passed to an adult age-estimation function and the others are passed to a youth age-estimation function. | 04-10-2014 |
20140212044 | Image Matching Using Subspace-Based Discrete Transform Encoded Local Binary Patterns - Determining a match between the subjects of first and second images as a function of decimal-number representations of regions of the first and second images. The decimal-number representations are generated by performing discrete transforms on the regions so as to obtain discrete-transform coefficients, performing local-bit-pattern encoding of the coefficients to create data streams, and converting the data streams to decimal numbers. In one embodiment, the first and second images depict periocular facial regions, and the disclosed techniques can be used for face recognition, even where a small portion of a person's face is captured in an image. Subspace modeling may be used to improve accuracy. | 07-31-2014 |
20140250523 | Continuous Authentication, and Methods, Systems, and Software Therefor - Controlling a registered-user session of a registered user on a device using first and second authentication processes and a handoff from the first process to the second process. In one embodiment, the first authentication process is a stronger process performed at the outset of a session, and the second authentication process is a weaker process iteratively performed during the session. The stronger authentication process may require cooperation from the user, while the weaker authentication process is preferably one that requires little or no user cooperation. In other embodiments, a strong authentication process may be iteratively performed during the session. | 09-04-2014 |
Patent application number | Description | Published |
20120155266 | SYNCHRONIZING STATE AMONG LOAD BALANCER COMPONENTS - The present invention extends to methods, systems, and computer program products for synchronizing state among load balancer components. Embodiments of the invention include load balancers using a consistent hashing algorithm to decide how new connections should be load balanced. Use of consistent hashing algorithm permits load balancers to work in a stateless manner in steady state. Load balancers start keeping flow state information (destination address for a given flow) about incoming packets when it is needed, i.e. such as, for example, when a change in destination host configuration is detected. State information is shared across load balancers in a deterministic way, which allows knowing which load balancer is authoritative (e.g., is the owner) for a given flow. Each load balancer can reach the authoritative load balancer to learn about a flow that cannot be determined locally. | 06-21-2012 |
20120303809 | OFFLOADING LOAD BALANCING PACKET MODIFICATION - The present invention extends to methods, systems, and computer program products for off loading load balancing packet modification. Embodiments of the invention can be used to offload the load of forwarding packets back to packet senders. Load balancers and/or the NAT devices can handle the first few packets of a connection to formulate connection mappings and then are removed from further communication for the connections. For example, a load balancer or NAT device makes the corresponding load balancing or the NAT decision based on a first packet and then informs the sender of the data of the decision. From then on, the sender can directly send the data to the receiver without having to go through the load balancer or NAT. | 11-29-2012 |
20140185446 | SYNCHRONIZING STATE AMONG LOAD BALANCER COMPONENTS - The present invention extends to methods, systems, and computer program products for synchronizing state among load balancer components. Embodiments of the invention include load balancers using a consistent hashing algorithm to decide how new connections should be load balanced. Use of consistent hashing algorithm permits load balancers to work in a stateless manner in steady state. Load balancers start keeping flow state information (destination address for a given flow) about incoming packets when it is needed, i.e. such as, for example, when a change in destination host configuration is detected. State information is shared across load balancers in a deterministic way, which allows knowing which load balancer is authoritative (e.g., is the owner) for a given flow. Each load balancer can reach the authoritative load balancer to learn about a flow that cannot be determined locally. | 07-03-2014 |
20140351395 | LOAD BALANCING FOR SINGLE-ADDRESS TENANTS - When a load balancer detects that a virtual address is associated with a single destination address, the load balancer sets a flag to distinguish the virtual address from virtual addresses that are associated with a plurality of destination addresses. The load balancer instructs the router to bypass the load balancer for network packets that are addressed to the virtual address, and refrains from storing subsequent flow state for the virtual address. When the virtual address is to be scaled up with an additional destination address, the load balancer sets a flag to distinguish the virtual address from virtual addresses that are associated with a single destination addresses. The load balancer instructs the router to route network packets that are addressed to the virtual address through the load balancer, instead of bypassing the load balancer, and starts storing flow state for the virtual address. | 11-27-2014 |
20140373146 | DOS DETECTION AND MITIGATION IN A LOAD BALANCER - A load balancer that is able to detect and mitigate a Denial of Service (DOS) attack. The load balancer is placed in the flow path of network data packets that are destined for one or more tenant addresses. The load balancer analyzes performance parameters regarding the network data packets that are destined for the one or more tenant addresses and are received at the load balancer. The performance parameters describe network data packet flow to the tenant addresses. The load balancer detects, based on the analysis of the performance parameters, that one or more of the tenant addresses are being subjected to a DOS attack. The load balancer performs a mitigation operation to isolate the one or more tenant addresses being subjected to the DOS attack. | 12-18-2014 |
20150063115 | SYNCHRONIZING STATE AMONG LOAD BALANCER COMPONENTS - The present invention extends to methods, systems, and computer program products for synchronizing state among load balancer components. Embodiments of the invention include load balancers using a consistent hashing algorithm to decide how new connections should be load balanced. Use of consistent hashing algorithm permits load balancers to work in a stateless manner in steady state. Load balancers start keeping flow state information (destination address for a given flow) about incoming packets when it is needed, i.e. such as, for example, when a change in destination host configuration is detected. State information is shared across load balancers in a deterministic way, which allows knowing which load balancer is authoritative (e.g., is the owner) for a given flow. Each load balancer can reach the authoritative load balancer to learn about a flow that cannot be determined locally. | 03-05-2015 |
20160026505 | LOAD BALANCING FOR SINGLE-ADDRESS TENANTS - When a load balancer detects that a virtual address is associated with a single destination address, the load balancer sets a flag to distinguish the virtual address from virtual addresses that are associated with a plurality of destination addresses. The load balancer instructs the router to bypass the load balancer for network packets that are addressed to the virtual address, and refrains from storing subsequent flow state for the virtual address. When the virtual address is to be scaled up with an additional destination address, the load balancer sets a flag to distinguish the virtual address from virtual addresses that are associated with a single destination addresses. The load balancer instructs the router to route network packets that are addressed to the virtual address through the load balancer, instead of bypassing the load balancer, and starts storing flow state for the virtual address. | 01-28-2016 |
20160043951 | ROUTING REQUESTS WITH VARIED PROTOCOLS TO THE SAME ENDPOINT WITHIN A CLUSTER - Embodiments are directed to routing requests with different protocols to the same destination. In one scenario, a computer system receives a request that uses a specified protocol. The request includes a request source identifier and a request destination identifier. The computer system identifies, based on both the request source identifier and the request destination identifier, a destination to send the request to and generates a routing entry for the request that indicates which destination the first request was sent to. The computer system receives another request that uses a different protocol. This request includes a request source identifier and a request destination identifier of its own. The computer system determines that the request source identifier and request destination identifier of the subsequent request match those of the generated routing entry, and routes the subsequent request to the destination indicated in the routing entry. | 02-11-2016 |