Patent application number | Description | Published |
20080199727 | Buffer Layer - Electroluminescent devices with an improved buffer layer on the anode, wherein the buffer material is selected from metal tetra-p-tolyl porphonato complexes, and bianthryl compounds of Formula (I) or (II). | 08-21-2008 |
20080265210 | Electroluminescent Materials and Devices - Lithium quinolate is a host material for organometallic electroluminescent materials to form an electroluminescent layer in an electroluminescent device. | 10-30-2008 |
20090009060 | Electroluminescent Materials and Devices - Novel iridium complexes are electroluminescent. | 01-08-2009 |
20100025671 | ELECTROLUMINESCENT DEVICES - The invention relates to an optical light emitting diode device having an electroluminescent layer and an electron transport layer, wherein the electron transport layer contains zirconium or hafnium quinolate for slowing loss of luminance at a given current density with increase of the time for which the device has been operative. The invention also relates to OLEDs, improved efficiency and/or lifetime is obtained by using zirconium or hafnium quino late as electron transport material. | 02-04-2010 |
20100038632 | ELECTROLUMINESCENT DEVICE - An OLED with a donor which is doped metal quinolate in which the metal is a transition metal in the four or five valent state. | 02-18-2010 |
Patent application number | Description | Published |
20140331011 | SYSTEMS AND METHODS FOR INSTANTANEOUS CLONING - Techniques to clone a writeable data object in non-persistent memory are disclosed. The writeable data object is stored in a storage structure in non-persistent memory that corresponds to a portion of a persistent storage. The techniques enable cloning of the writeable data object without having to wait until the writeable data object is saved to the persistent storage and without needing to quiesce incoming operations (e.g., reads and writes) to the writeable data object. | 11-06-2014 |
20150058554 | Systems, Methods, and Computer Program Products Implementing Hybrid File Structures for Data Storage - Systems, methods, and computer program products implementing hybrid file structures for data storage are provided. One embodiment of a method performed in a computer-based storage system includes writing a file as data blocks in an array of storage devices. The method includes associating the data blocks with metadata related to at least one location in the array of storage devices for later access to the data blocks. The file is represented as a hierarchical data structure having a plurality of nodes. A first portion of nodes has a first span type, and a second portion of nodes has a second span type. The data structure includes a buftree. The first span type includes a fixed-span type. The second span type includes a variable-span type. | 02-26-2015 |
20150248466 | DATA TRANSFER BETWEEN STORAGE SYSTEMS USING DATA FINGERPRINTS - A system and method for data replication is described. A destination storage system receives a message from a source storage system as part of a replication process. The message includes an identity of a first file, information about where the first file is stored in the source storage system, a name of a first data being used by the first file and stored at a first location of the source storage system, and a fingerprint of the first data. The destination storage system determines that a mapping database is unavailable or inaccurate, and accesses a fingerprint database using the fingerprint of the first data received with the message to determine whether data stored in the destination storage system has a fingerprint identical to the fingerprint of the first data. | 09-03-2015 |
20160070495 | LOGICAL REPLICATION MAPPING FOR ASYMMETRIC COMPRESSION - A system and method for logically organizing compressed data. In one aspect, a destination storage server receives a write request that includes multiple data blocks and specifies corresponding file block numbers. An extent-based file system executing on the storage server accesses intermediate block entries that each associates one of the file block numbers with a respective extent block number. The file system, in cooperation with a compression engine, compresses the data blocks into a set of one or more compressed data blocks. The file system stores the compressed data blocks at physical locations corresponding to physical block numbers and allocates, within an extent map, pointers from an extent ID to the extent block numbers, and pointers from the extent ID to the physical block numbers. | 03-10-2016 |
Patent application number | Description | Published |
20120278382 | EXTENT-BASED STORAGE ARCHITECTURE - An extent-based storage architecture is implemented by a storage server receiving a read request for an extent from a client, wherein the extent includes a group of contiguous blocks and the read request includes a file block number. The storage server retrieves an extent identifier from a first sorted data structure, wherein the storage server uses the received file block number to traverse the first sorted data structure to the extent identifier. The storage server retrieves a reference to the extent from a second sorted data structure, wherein the storage server uses the retrieved extent identifier to traverse the second sorted data structure to the reference, and wherein the second sorted data structure is global across a plurality of volumes. The storage server retrieves the extent from a storage device using the reference and returns the extent to the client. | 11-01-2012 |
20120330903 | DEDUPLICATION IN AN EXTENT-BASED ARCHITECTURE - A request is received to remove duplicate data. A log data container associated with a storage volume in a storage server is accessed. The log data container includes a plurality of entries. Each entry is identified by an extent identifier in a data structures stored in a volume associated with the storage server. For each entry in the log data container, a determination is made if the entry matches another entry in the log data container. If the entry matches another entry in the log data container, a determination is made of a donor extent and a recipient extent. If an external reference count associated with the recipient extent equals a first predetermined value, block sharing is performed for the donor extent and the recipient extent. A determination is made if the reference count of the donor extent equals a second predetermined value. If the reference count of the donor extent equals the second predetermined value, the donor extent is freed. | 12-27-2012 |
20140201168 | DEDUPLICATION IN AN EXTENT-BASED ARCHITECTURE - A request is received to remove duplicate data. A log data container associated with a storage volume in a storage server is accessed. The log data container includes a plurality of entries. Each entry is identified by an extent identifier in a data structures stored in a volume associated with the storage server. For each entry in the log data container, a determination is made if the entry matches another entry in the log data container. If the entry matches another entry in the log data container, a determination is made of a donor extent and a recipient extent. If an external reference count associated with the recipient extent equals a first predetermined value, block sharing is performed for the donor extent and the recipient extent. A determination is made if the reference count of the donor extent equals a second predetermined value. If the reference count of the donor extent equals the second predetermined value, the donor extent is freed. | 07-17-2014 |
20140258648 | OVERWRITING PART OF COMPRESSED DATA WITHOUT DECOMPRESSING ON-DISK COMPRESSED DATA - Overwriting part of compressed data without decompressing on-disk compressed data is includes by receiving a write request for a block of data in a compression group from a client, wherein the compression group comprises a group of data blocks that is compressed, wherein the block of data is uncompressed. The storage server partially overwrites the compression group, wherein the compression group remains compressed while the partial overwriting is performed. The storage server determines whether the partially overwritten compression group including the uncompressed block of data should be compressed. The storage server defers compression of the partially overwritten compression group if the partially overwritten compression group should not be compressed. The storage server compresses the partially overwritten compression group if the partially overwritten compression group should be compressed. | 09-11-2014 |
Patent application number | Description | Published |
20100146653 | MACROPHAGE CELL-LINES FOR PROPAGATION OF PORCINE REPRODUCTIVE AND RESPIRATORY SYNDROME VIRUS - Particular aspects provide novel recombinant cells and cell lines (e.g., macrophage cell lines) that are permissive for propagation of porcine reproductive and respiratory syndrome virus (PRRSV) propagation in vitro or in vivo. In certain aspects, novel nucleic acid sequences encoding porcine sialoadhesin were transfected into existing macrophage cell-lines from other species, rendering them permissive to PRRSV infection, and suitable for propagation of PRRSV. Particular aspects provide exemplary recombinant cloned cell lines that support the replication of PRRSV, with an obtainable PRRSV titre of between 2×10 | 06-10-2010 |
20110296545 | COMPOSITIONS AND METHODS FOR TREATING OR PREVENTING CONDITIONS AND DISEASES ASSOCIATED WITH MANNHEIMIA HAEMOLYTICA - Particular aspects show that the signal peptide remains intact on the mature CD18 molecule on ruminant leukocytes rendering these cells susceptible to cytolysis by Lkt. Comparative amino acid sequence analysis of the signal peptide of CD18 of eight ruminants and five non-ruminants revealed that the ruminant CD18 signal peptides contain ‘cleavage-inhibiting’ glutamine (Q), compared to ‘cleavage-conducive’ glycine in non-ruminants, at position −5 relative to the cleavage site. Mutagenesis of Q at position −5 of the bovine CD18 signal peptide to G resulted in the abrogation of Lkt-mediated cytolysis of transfectants expressing bovine CD18 carrying the Q(−5)G mutation. Provided is novel technology to clone cattle and other ruminants expressing CD18 without the signal peptide on their leukocytes, providing ruminants that are less susceptible to | 12-01-2011 |
20150327522 | COMPOSITIONS AND METHODS FOR TREATING OR PREVENTING CONDITIONS AND DISEASES ASSOCIATED WITH MANNHEIMIA HAEMOLYTICA - Particular aspects show that the signal peptide remains intact on the mature CD18 molecule on ruminant leukocytes rendering these cells susceptible to cytolysis by Lkt. Comparative amino acid sequence analysis of the signal peptide of CD18 of eight ruminants and five non-ruminants revealed that the ruminant CD18 signal peptides contain ‘cleavage-inhibiting’ glutamine (Q), compared to ‘cleavage-conducive’ glycine in non-ruminants, at position −5 relative to the cleavage site. Mutagenesis of Q at position −5 of the bovine CD18 signal peptide to G resulted in the abrogation of Lkt-mediated cytolysis of transfectants expressing bovine CD18 carrying the Q(−5)G mutation. Provided is novel technology to clone cattle and other ruminants expressing CD18 without the signal peptide on their leukocytes, providing ruminants that are less susceptible to | 11-19-2015 |
Patent application number | Description | Published |
20130151632 | METHOD AND SYSTEM FOR MANAGING SOCIAL RELATIONSHIPS - A system and method to manage social relationships by gathering information about social relationships for a particular user from a variety of sources, and automatically to recommend or execute potential socially desirable actions by the particular user with respect to the relationship. The method includes automatically aggregating social relation data from a plurality of social media, maintaining social relationship information for a plurality of social relations based on aggregated social relation data, automatically identifying potentially socially desirable actions by the user, and alerting the user to the identified desirable actions, or automatically executing the desirable actions. | 06-13-2013 |
20130204670 | METHOD AND SYSTEM FOR AUTOMATED BUSINESS CASE TRACKING - A method and system to provide automated tracking of a business case with respect to a targeted aspect of the business process, such as an enterprise IT initiative pertaining to a change in the enterprise IT applications for introduction of a new enterprise IT application. Elements of a business case definition may be incorporated in an enterprise IT application and/or, for a Business Process Management Application, in a business process model. A business case tracking engine may automatically measure benefit indicators to produce a real-time or near real-time display that shows how well the business case is realized in practice, and to identify when the business case is fulfilled or invalidated. Additional methods and systems are disclosed. | 08-08-2013 |
20130304530 | AUTOMATED GENERATION OF PROCESS MONITORING SYSTEM COMPONENTS - Systems and methods provide automatic configuration of a process monitoring system to monitor some or all business activity in a business process. Structured business process information that defines the business process is accessed and parsed, to automatically generate one or more process monitoring components to form part of the process monitoring system. The process monitoring system monitors events with respect to a plurality of unmanaged enterprise applications that perform business process activities. The unmanaged enterprise applications perform the process activities without central orchestration by a business process management application. | 11-14-2013 |