| Patent application number | Description | Published |
|---|
| 20080235636 | Identifying Radiation-Induced Inversions - A semiconductor layout design analyzer alerts a user of areas in a semiconductor layout design that may be candidates for radiation induced inversion. The analyzer includes means for gathering information, means for identifying, and means for alerting the user. The means for gathering gathers, from the layout design, placement information for thick oxide, low-doped p-type single crystal silicon, and n-type silicon. The means for identifying identifies, in the layout design, thick oxide overlaying low-doped p-type single crystal silicon and abutting n-type silicon. The means for alerting the user alerts the user of the identified areas of thick oxide. | 09-25-2008 |
| 20110110171 | POWERLESS EXTERNAL EVENT DETECTION DEVICE - The external event detection device comprises an electronic unit ( | 05-12-2011 |
| 20110115540 | SELF-POWERED DETECTION DEVICE WITH A NON-VOLATILE MEMORY - The self-powered detection device comprises a Non-Volatile Memory (NVM) unit ( | 05-19-2011 |
| 20110115548 | SELF-POWERED EVENT DETECTION DEVICE - The self-powered detection device comprises at least a non-volatile memory cell ( | 05-19-2011 |
| 20110119017 | SELF-POWERED DETECTION DEVICE WITH A NON-VOLATILE MEMORY - The self-powered detection device comprises a Non-Volatile Memory (NVM) unit ( | 05-19-2011 |
| 20120299641 | TRANSPONDER WITH A MODULATOR - A RFID transponder includes an electronic circuit and an antenna, the electronic circuit being integrated in a p-type substrate and comprising a modulator formed by a PMOS transistor whose drain, electrically connected to a pad of the antenna, and source, connected to the ground of the electronic circuit, are arranged in an n-type well provided in the p-type substrate. The PMOS transistor has a gate driven by a driving circuit which is arranged for providing at least a negative voltage, this negative voltage being low enough for turning on this PMOS transistor in response to a control signal provided by a logical unit of the electronic circuit. | 11-29-2012 |
| 20130320096 | RFID TRANSPONDER CHIP WITH A PROGRAMMABLE WAKE-UP - An RFID transponder chip includes at least one antenna to pick-up and transmit radio-frequency signals, a rectifier to store charge on at least one capacitor at a rectified voltage from the picked-up radio-frequency signals, a power-on reset circuit to maintain a logic unit in a reset state if the rectified voltage level is less than a power-on reset or wake-up voltage of the power-on reset circuit for operating the logic unit. The RFID transponder chip further includes a non-volatile memory, in which are stored one or several trim values. Said non-volatile memory is directly connected to the power-on reset circuit to be able to provide at least one trim value to trim the power-on reset circuit at a rectified voltage level below a wake-up voltage level. | 12-05-2013 |
| Patent application number | Description | Published |
|---|
| 20110029569 | DDL AND DML SUPPORT FOR HYBRID COLUMNAR COMPRESSED TABLES - Techniques for storing and manipulating tabular data are provided. According to one embodiment, a user may control whether tabular data is stored in row-level or column-major format. Furthermore, the user may control the level of data compression to achieve an optimal balance between query performance and compression ratios. Tabular data from within the same table may be stored in both column-major and row-major format and compressed at different levels. In addition, tabular data can migrate between column-major format and row-major format in response to various events. For example, in response to a request to update or lock a row stored in column-major format, the row may be migrated and subsequently stored into row-major format. In one embodiment, table partitions are used to enhance data compression techniques. For example, compression tests are performed on a representative table partition, and a compression map is generated and applied to other table partitions. | 02-03-2011 |
| 20130151567 | TECHNIQUES FOR MORE EFFICIENT USAGE OF MEMORY-TO-CPU BANDWIDTH - Techniques are provided for more efficiently using the bandwidth of the I/O path between a CPU and volatile memory during the performance of database operation. Relational data from a relational table is stored in volatile memory as column vectors, where each column vector contains values for a particular column of the table. A binary-comparable format may be used to represent each value within a column vector, regardless of the data type associated with the column. The column vectors may be compressed and/or encoded while in volatile memory, and decompressed/decoded on-the-fly within the CPU. Alternatively, the CPU may be designed to perform operations directly on the compressed and/or encoded column vector data. In addition, techniques are described that enable the CPU to perform vector processing operations on the column vector values. | 06-13-2013 |
| 20130151568 | TECHNIQUES FOR MAINTAINING COLUMN VECTORS OF RELATIONAL DATA WITHIN VOLATILE MEMORY - Techniques are provided for more efficiently using the bandwidth of the I/O path between a CPU and volatile memory during the performance of database operation. Relational data from a relational table is stored in volatile memory as column vectors, where each column vector contains values for a particular column of the table. A binary-comparable format may be used to represent each value within a column vector, regardless of the data type associated with the column. The column vectors may be compressed and/or encoded while in volatile memory, and decompressed/decoded on-the-fly within the CPU. Alternatively, the CPU may be designed to perform operations directly on the compressed and/or encoded column vector data. In addition, techniques are described that enable the CPU to perform vector processing operations on the column vector values. | 06-13-2013 |
| 20130275473 | TECHNIQUES FOR MAINTAINING COLUMN VECTORS OF RELATIONAL DATA WITHIN VOLATILE MEMORY - Techniques are provided for more efficiently using the bandwidth of the I/O path between a CPU and volatile memory during the performance of database operation. Relational data from a relational table is stored in volatile memory as column vectors, where each column vector contains values for a particular column of the table. A binary-comparable format may be used to represent each value within a column vector, regardless of the data type associated with the column. The column vectors may be compressed and/or encoded while in volatile memory, and decompressed/decoded on-the-fly within the CPU. Alternatively, the CPU may be designed to perform operations directly on the compressed and/or encoded column vector data. In addition, techniques are described that enable the CPU to perform vector processing operations on the column vector values. | 10-17-2013 |
| 20140013076 | EFFICIENT HARDWARE INSTRUCTIONS FOR SINGLE INSTRUCTION MULTIPLE DATA PROCESSORS - A method and apparatus for efficiently processing data in various formats in a single instruction multiple data (“SIMD”) architecture is presented. Specifically, a method to unpack a fixed-width bit values in a bit stream to a fixed width byte stream in a SIMD architecture is presented. A method to unpack variable-length byte packed values in a byte stream in a SIMD architecture is presented. A method to decompress a run length encoded compressed bit-vector in a SIMD architecture is presented. A method to return the offset of each bit set to one in a bit-vector in a SIMD architecture is presented. A method to fetch bits from a bit-vector at specified offsets relative to a base in a SIMD architecture is presented. A method to compare values stored in two SIMD registers is presented. | 01-09-2014 |
| 20140013077 | EFFICIENT HARDWARE INSTRUCTIONS FOR SINGLE INSTRUCTION MULTIPLE DATA PROCESSORS - A method and apparatus for efficiently processing data in various formats in a single instruction multiple data (“SIMD”) architecture is presented. Specifically, a method to unpack a fixed-width bit values in a bit stream to a fixed width byte stream in a SIMD architecture is presented. A method to unpack variable-length byte packed values in a byte stream in a SIMD architecture is presented. A method to decompress a run length encoded compressed bit-vector in a SIMD architecture is presented. A method to return the offset of each bit set to one in a bit-vector in a SIMD architecture is presented. A method to fetch bits from a bit-vector at specified offsets relative to a base in a SIMD architecture is presented. A method to compare values stored in two SIMD registers is presented. | 01-09-2014 |
| 20140013078 | EFFICIENT HARDWARE INSTRUCTIONS FOR SINGLE INSTRUCTION MULTIPLE DATA PROCESSORS - A method and apparatus for efficiently processing data in various formats in a single instruction multiple data (“SIMD”) architecture is presented. Specifically, a method to unpack a fixed-width bit values in a bit stream to a fixed width byte stream in a SIMD architecture is presented. A method to unpack variable-length byte packed values in a byte stream in a SIMD architecture is presented. A method to decompress a run length encoded compressed bit-vector in a SIMD architecture is presented. A method to return the offset of each bit set to one in a bit-vector in a SIMD architecture is presented. A method to fetch bits from a bit-vector at specified offsets relative to a base in a SIMD architecture is presented. A method to compare values stored in two SIMD registers is presented. | 01-09-2014 |
| 20140074805 | STORING COMPRESSION UNITS IN RELATIONAL TABLES - A database server stores compressed units in data blocks of a database. A table (or data from a plurality of rows thereof) is first compressed into a “compression unit” using any of a wide variety of compression techniques. The compression unit is then stored in one or more data block rows across one or more data blocks. As a result, a single data block row may comprise compressed data for a plurality of table rows, as encoded within the compression unit. Storage of compression units in data blocks maintains compatibility with existing data block-based databases, thus allowing the use of compression units in preexisting databases without modification to the underlying format of the database. The compression units may, for example, co-exist with uncompressed tables. Various techniques allow a database server to optimize access to data in the compression unit, so that the compression is virtually transparent to the user. | 03-13-2014 |
| 20140281247 | METHOD TO ACCELERATE QUERIES USING DYNAMICALLY GENERATED ALTERNATE DATA FORMATS IN FLASH CACHE - A method for accelerating queries using dynamically generated columnar data in a flash cache is provided. In an embodiment, a method comprises a storage device receiving a first request for data that is stored in the storage device in a base major format in one or more primary storage devices. The storage device comprises a cache. The base major format is any one of: a row-major format, a column-major format and a hybrid-columnar format. Based on first one or more criteria, it is determined whether to rewrite the data into rewritten data in a rewritten major format. In response to determining to rewrite the data into rewritten data in a rewritten major format, the storage device rewrites at least a portion of the data into particular rewritten data in the rewritten major format. The rewritten data is stored in the cache. | 09-18-2014 |
| 20150032763 | QUERY AND EXADATA SUPPORT FOR HYBRID COLUMNAR COMPRESSED DATA - A method and apparatus is provided for optimizing queries received by a database system that relies on an intelligent data storage server to manage storage for the database system. Storing compression units in hybrid columnar format, the storage manager evaluates simple predicates and only returns data blocks containing rows that satisfy those predicates. The returned data blocks are not necessarily stored persistently on disk. That is, the storage manager is not limited to returning disc block images. The hybrid columnar format enables optimizations that provide better performance when processing typical database workloads including both fetching rows by identifier and performing table scans. | 01-29-2015 |
| 20150088824 | GRANULAR CREATION AND REFRESH OF COLUMNAR DATA - Techniques are provided for granular load and refresh of columnar data. In an embodiment, a particular data object that contains particular data formatted different from column-major format is maintained, the particular data including first data and second data. First and second data objects contain the first and second data, respectively, organized in the column-major format. In response to changes being committed to the first data in the particular data object, invalidating one or more rows of the first data object. In response to a number of invalidated rows of the first data object exceeding a threshold, automatically performing a refresh operation on the first data object independent of any refresh operation on the second data object. | 03-26-2015 |
| 20150088830 | MIRRORING, IN MEMORY, DATA FROM DISK TO IMPROVE QUERY PERFORMANCE - Techniques are provided for maintaining data persistently in one format, but making that data available to a database server in more than one format. For example, one of the formats in which the data is made available for query processing is based on the on-disk format, while another of the formats in which the data is made available for query processing is independent of the on-disk format. Data that is in the format that is independent of the disk format may be maintained exclusively in volatile memory to reduce the overhead associated with keeping the data in sync with the on-disk format copies of the data. | 03-26-2015 |
| 20150089134 | CORE IN-MEMORY SPACE AND OBJECT MANAGEMENT ARCHITECTURE IN A TRADITIONAL RDBMS SUPPORTING DW AND OLTP APPLICATIONS - Techniques are provided for managing in-memory space and objects. In one embodiment, a set of in-memory objects are maintained within an area in volatile memory that is accessible to a database server. An in-memory object in this context includes a set of one or more in-memory segments where each respective in-memory segment includes a set of in-memory extents and each respective in-memory extent is a contiguous chunk of memory from the area in volatile memory that is accessible to the database server. The area in volatile memory is managed as a set of stripes, where each stripe is a contiguous chunk of in-memory extents. Stripe control blocks are used to locate free in-memory extents for allocation and registration with an in-memory segment. | 03-26-2015 |
| 20150269180 | OZIP COMPRESSION AND DECOMPRESSION - A method, apparatus, and system for OZIP, a data compression and decompression codec, is provided. OZIP utilizes a fixed size static dictionary, which may be generated from a random sampling of input data to be compressed. Compression by direct token encoding to the static dictionary streamlines the encoding and avoids expensive conditional branching, facilitating hardware implementation and high parallelism. By bounding token definition sizes and static dictionary sizes to hardware architecture constraints such as word size or processor cache size, hardware implementation can be made fast and cost effective. For example, decompression may be accelerated by using SIMD instruction processor extensions. A highly granular block mapping in optional stored metadata allows compressed data to be accessed quickly at random, bypassing the processing overhead of dynamic dictionaries. Thus, OZIP can support low latency random data access for highly random workloads, such as for OLTP systems. | 09-24-2015 |
| 20160034214 | MIRRORING, IN MEMORY, DATA FROM DISK TO IMPROVE QUERY PERFORMANCE - Techniques are provided for maintaining data persistently in one format, but making that data available to a database server in more than one format. For example, one of the formats in which the data is made available for query processing is based on the on-disk format, while another of the formats in which the data is made available for query processing is independent of the on-disk format. Data that is in the format that is independent of the disk format may be maintained exclusively in volatile memory to reduce the overhead associated with keeping the data in sync with the on-disk format copies of the data. | 02-04-2016 |
| 20160085781 | TECHNIQUES FOR MAINTAINING COLUMN VECTORS OF RELATIONAL DATA WITHIN VOLATILE MEMORY - Techniques are provided for more efficiently using the bandwidth of the I/O path between a CPU and volatile memory during the performance of database operation. Relational data from a relational table is stored in volatile memory as column vectors, where each column vector contains values for a particular column of the table. A binary-comparable format may be used to represent each value within a column vector, regardless of the data type associated with the column. The column vectors may be compressed and/or encoded while in volatile memory, and decompressed/decoded on-the-fly within the CPU. Alternatively, the CPU may be designed to perform operations directly on the compressed and/or encoded column vector data. In addition, techniques are described that enable the CPU to perform vector processing operations on the column vector values. | 03-24-2016 |
| 20160085834 | PRIORITIZING REPOPULATION OF IN-MEMORY COMPRESSION UNITS - To prioritize repopulation of in-memory compression units (IMCU), a database server compresses, into an IMCU, a plurality of data units from a database table. In response to changes to any of the plurality of data units within the database table, the database server performs the steps of: (a) invalidating corresponding data units in the IMCU; (b) incrementing an invalidity counter of the IMCU that reflects how many data units within the IMCU have been invalidated; (c) receiving a data request that targets one or more of the plurality of data units of the database table; (d) in response to receiving the data request, incrementing an access counter of the IMCU; and (e) determining a priority for repopulating the IMCU based, at least in part, on the invalidity counter and the access counter. | 03-24-2016 |
| Patent application number | Description | Published |
|---|
| 20100278446 | STRUCTURE OF HIERARCHICAL COMPRESSED DATA STRUCTURE FOR TABULAR DATA - A highly flexible and extensible structure is provided for physically storing tabular data. The structure, is referred to as a compression unit, and may be used to physically store tabular data that logically resides in any type of table-like structure. According to one embodiment, compression units are recursive. Thus, a compression unit may have a “parent” compression unit to which it belongs, and may have one or more “child” compression units that belong to it. In one embodiment, compression units include metadata that indicates how the tabular data is stored within them. The metadata for a compression unit may indicate, for example, whether the data within the compression unit is stored in row-major or column major-format (or some combination thereof), the order of the columns within the compression unit (which may differ from the logical order of the columns dictated by the definition of their logical container), a compression technique for the compression unit, the child compression units (if any), etc. | 11-04-2010 |
| 20100281004 | STORING COMPRESSION UNITS IN RELATIONAL TABLES - A database server stores compressed units in data blocks of a database. A table (or data from a plurality of rows thereof) is first compressed into a “compression unit” using any of a wide variety of compression techniques. The compression unit is then stored in one or more data block rows across one or more data blocks. As a result, a single data block row may comprise compressed data for a plurality of table rows, as encoded within the compression unit. Storage of compression units in data blocks maintains compatibility with existing data block-based databases, thus allowing the use of compression units in preexisting databases without modification to the underlying format of the database. The compression units may, for example, co-exist with uncompressed tables. Various techniques allow a database server to optimize access to data in the compression unit, so that the compression is virtually transparent to the user. | 11-04-2010 |
| 20100281079 | COMPRESSION ANALYZER - Techniques are described herein for automatically selecting the compression techniques to be used on tabular data. A compression analyzer gives users high-level control over the selection process without requiring the user to know details about the specific compression techniques that are available to the compression analyzer. Users are able to specify, for a given set of data, a “balance point” along the spectrum between “maximum performance” and “maximum compression”. The point thus selected is used by the compression analyzer in a variety of ways. For example, in one embodiment, the compression analyzer uses the user-specified balance point to determine which of the available compression techniques qualify as “candidate techniques” for the given set of data. The compression analyzer selects the compression technique to use on a set of data by actually testing the candidate compression techniques against samples from the set of data. After testing the candidate compression techniques against the samples, the resulting compression ratios are compared. The compression technique to use on the set of data is then selected based, in part, on the compression ratios achieved during the compression tests performed on the sample data. | 11-04-2010 |
| 20120117038 | LAZY OPERATIONS ON HIERARCHICAL COMPRESSED DATA STRUCTURE FOR TABULAR DATA - A highly flexible and extensible structure is provided for physically storing tabular data. The structure, referred to as a compression unit, may be used to physically store tabular data that logically resides in any type of table-like structure. Techniques are employed to avoid changing tabular data within existing compression units. Deleting tabular data within compression units is avoided by merely tracking deletion requests, without actually deleting the data. Inserting new tabular data into existing compression units is avoided by storing the new data external to the compression units. If the number of deletions exceeds a threshold, and/or the number of new inserts exceeds a threshold, new compression units may be generated. When new compression units are generated, the previously-existing compression units may be discarded to reclaim storage, or retained to allow reconstruction of prior states of the tabular data. | 05-10-2012 |
| 20120143833 | STRUCTURE OF HIERARCHICAL COMPRESSED DATA STRUCTURE FOR TABULAR DATA - A highly flexible and extensible structure is provided for physically storing tabular data. The structure, referred to as a compression unit, may be used to store tabular data that logically resides in any type of table-like structure. According to one embodiment, compression units are recursive. Thus, a compression unit may have a “parent” compression unit to which it belongs, and may have one or more “child” compression units that belong to it. In one embodiment, compression units include metadata that indicates how the tabular data is stored within them. The metadata for a compression unit may indicate, for example, whether the data is stored in row-major or column major-format the order of the columns within the compression unit (which may differ from the logical order of the columns dictated by the definition of their logical container), a compression technique for the compression unit, the child compression units (if any), etc. | 06-07-2012 |
| Patent application number | Description | Published |
|---|
| 20120103108 | ANTI-ROTATION MECHANISM FOR PITOT TUBE - A valve assembly is provided and includes a pitot tube having an angled tip to extract from a duct formed by a housing a sample of a fluid to be communicated to an actuator configured to operate the duct, the pitot tube being disposed within the housing whereby the pitot tube is fixed longitudinally between the actuator and the housing and laterally within the housing and an anti-rotation mechanism coupled with the pitot tube to rotationally secure the pitot tube such that the angled tip is fixed to face rearwardly. | 05-03-2012 |
| 20120198697 | ANTI-ROTATION MECHANISM FOR PITOT TUBE - A valve assembly is provided and includes a pitot tube having an angled tip to extract from a duct formed by a housing a sample of a fluid to be communicated to an actuator configured to operate the duct, the pitot tube being disposed within the housing whereby the pitot tube is fixed longitudinally between the actuator and the housing and laterally within the housing and an anti-rotation mechanism coupled with the pitot tube to rotationally secure the pitot tube such that the angled tip is fixed to face rearwardly. | 08-09-2012 |
| 20130276892 | PNEUMATIC BUTTERFLY VALVE - A butterfly valve includes a duct defining a flow pathway and a valve disc rotably disposed in the flow pathway. A pneumatic actuator includes an intermediate chamber housing an actuator piston and is operably connected to the valve disc to drive rotation of the valve disc. A downstream bleed conduit extends from the flow pathway downstream of the valve disc to the intermediate chamber to pressurize the intermediate chamber thereby reducing a rate of movement of the valve disc in the flow pathway. | 10-24-2013 |
| 20140202562 | CHECK VALVE WITH SELF-TRAPPING INSERT - A check valve is provided and includes a body including a seat, a hinge bifurcating the seat to define openings and a housing coupled to the hinge and a self-trapping insert of compliant material. The self-trapping insert includes an end portion and is securable in the housing such that the end portion protrudes from a side of the housing to contact with a corresponding check valve flapper in a respective open position. | 07-24-2014 |
| 20140251461 | CHECK VALVE HAVING PETALS WITH LIFT GENERATING ELEMENTS - A check valve is provided. The check valve includes a petal pivotably coupled to a hinge to occupy respective open and closed positions in accordance with a pressure differential of a fluid flow across the check valve and a lift generating element coupled to the petal and configured to aerodynamically interact with the fluid flow to generate a lift force on the petal. | 09-11-2014 |
| 20140366964 | REVERSE FLOW RELIEF VALVE - A bleed valve system includes a bleed valve, a valve regulator, a valve actuator and a reverse flow relief valve. The bleed valve is opened and closed to control a flow of bleed air from an upstream inlet to a downstream outlet. The valve regulator provides a servo pressure used to regulate the position of the bleed valve, and the valve actuator is mechanically connected to open/close the bleed valve based on the servo pressure provided by the valve regulator. The reverse flow relief valve compares a pressure upstream of the bleed valve to a pressure downstream of the bleed valve and in response to the downstream pressure exceeding the upstream pressure creates a fluid communication path between the servo pressure and an ambient pressure to decrease the servo pressure such that the bleed valve is closed. | 12-18-2014 |
| 20140366966 | HIGH PRESSURE CHECK VALVE FLANGE JOINT - A valve flange joint includes a valve flange and first and second duct flanges. The first and second duct flanges include respective first and second mating portions. The first mating portion includes a first duct rim, a first duct face in contact with a first face of the valve flange, and a first slot. The second mating portion includes a second duct face in contact with a second face of the valve flange, and a second rim. In an embodiment, the valve flange includes a tab that extends in an axial direction through the first slot and includes an inner surface radially inward of an outermost portion of the second mating portion. In another embodiment, a first thickness is defined between the first flange face and the second flange face. Second and third thicknesses are also defined for the first and second mating portions. The three thicknesses are substantially similar. | 12-18-2014 |
| 20150267824 | CHECK VALVE WITH REDUCED OPENING SPEED - A check valve for a housing with adjacent first and second apertures separated by a septum comprises a hinge pin, a first flapper, and a second flapper. The hinge pin is located downstream of the septum. The first flapper is anchored via the hinge pin, and is rotatable about the hinge pin to block the first aperture when in a closed position. The second flapper is anchored via the hinge pin, and comprises a primary flapper section and a counterbalance section. The primary flapper section is rotatable about the hinge pin to block the second aperture when in a closed position. The counterbalance section extends upstream from and substantially parallel to the primary flapper section, towards the first aperture. | 09-24-2015 |
| 20160040792 | CHECK VALVE FLAPPER - A check valve flapper for a check valve is provided and includes a flapper body and a hinge portion extending from the flapper body. The hinge portion includes a lower ear, a middle ear, and an upper ear. The lower ear, the middle ear, and the upper ear each include a hinge pin hole having a hinge pin hole diameter and an ear outer radius. A ratio of the hinge pin hole diameter to the ear outer radius is between 0.83 and 0.91. | 02-11-2016 |
| 20160040799 | CHECK VALVE HOUSING - A check valve housing for a check valve is provided and includes check valve housing body. First and second hinge supports extend from the check valve housing body. A stop is coupled to the first and second hinge supports. The first hinge support includes a first hinge pin interface having a first hinge pin hole to receive a hinge pin. A ratio of a diameter of the first hinge pin hole to a thickness of the first hinge pin interface is between 2.44 and 2.66. | 02-11-2016 |
| Patent application number | Description | Published |
|---|
| 20160063477 | PROXIMITY-BASED TRANSACTION DEVICE SELECTION - Various embodiments herein each include at least one of systems, methods, software, and devices for proximity-based transaction device selection. One embodiment in the form of a method performed on a mobile device includes receiving a positioning signal and identifying a terminal associated with the positioning signal. An instruction may then be transmitted to the identified terminal via a wireless data communication device of the mobile device. | 03-03-2016 |
| 20160092954 | MOBILE DEVICE LOCATION-ENABLED SERVICE PROVISIONING - Various embodiments each include at least one of systems, devices, methods, and software for mobile device location-enabled service provisioning. One embodiment, in the form of a method, includes receiving, via a network from a mobile device, data including a customer account identifier and an identifier of at least one beacon device. The method then determines, based on the received data, a location of a customer of the customer account identifier relative to each beacon device for which a beacon device identifier is included in the received data. The method then identifies any activities to be initiated with regard to the customer based on a stored customer profile associated with the customer account identifier, the determined location, and at least one activity rule. The method may then execute instructions associated with each identified activity. | 03-31-2016 |
| 20160125514 | ON-DEMAND ROUTING UPON LOCATION DETECTION - Various embodiments herein each include at least one of systems, devices, methods, and software for on-demand routing upon location detection. One such embodiment is in the form of a method. This embodiment includes detecting a mobile device is present at a facility and retrieving available order data associated with an account registered with the mobile device. When order data is available and retrieved, the method may then output the order data to facilitate fulfillment of one or more orders included in the retrieved data. | 05-05-2016 |
| Patent application number | Description | Published |
|---|
| 20120018525 | AEROSOL GENERATING AND DELIVERY DEVICE - Particular aspects provide novel atomizers for generating particles over a broad range of MMAD size distributions, the eliminating the requirement for an impaction baffle in generating the desired particle sizes. In particular aspects, the atomization means communicates with a remote particle filter member configured and positioned to provide for particle size filtering. In additional aspects, the atomization means communicates with a particle dispersion chamber suitable to impart a desired particle flow pattern to particles within and exiting the dispersion chamber. In further aspects, the atomization means communicates with a nasal, ocular, oral or ‘vicinity’ adapter. The novel devices provide for targeted (e.g., nasal, ocular, oral, local vicinity), systemic, and/or topical delivery of an atomized liquid (e.g., via the nasal cavity, olfactory region, and mouth). Further exemplary aspects relate to aerosolization and delivery of perfume, fragrance, essential oil or cosmeceutical agents and the like. | 01-26-2012 |
| 20140251320 | AEROSOL GENERATING AND DELIVERY DEVICE - Particular aspects provide novel atomizers for generating particles over a broad range of MMAD size distributions, the eliminating the requirement for an impaction baffle in generating the desired particle sizes. In particular aspects, the atomization means communicates with a remote particle filter member configured and positioned to provide for particle size filtering. In additional aspects, the atomization means communicates with a particle dispersion chamber suitable to impart a desired particle flow pattern to particles within and exiting the dispersion chamber. In further aspects, the atomization means communicates with a nasal, ocular, oral or ‘vicinity’ adapter. The novel devices provide for targeted (e.g., nasal, ocular, oral, local vicinity), systemic, and/or topical delivery of an atomized liquid (e.g., via the nasal cavity, olfactory region, and mouth). Further exemplary aspects relate to aerosolization and delivery of perfume, fragrance, essential oil or cosmeceutical agents and the like. | 09-11-2014 |
| Patent application number | Description | Published |
|---|
| 20150140658 | LINEAGE REPROGRAMMING TO INDUCED CARDIAC PROGENITOR CELLS (iCPC) BY DEFINED FACTORS - Animal cells, notably adult fibroblasts, are advantageously reprogrammed in direct lineage reprogramming methods using defined factors to produce proliferative and multipotent induced cardiac progenitor cells (iCPC). The iCPC thus produced can be differentiated under suitable differentiation conditions to cardiac lineage cells including cardiomyocytes, smooth muscle cells, and endothelial cells, as evidenced by expression of lineage specific markers. Sets of factors effective in combination to reprogram the fibroblasts can include a set that includes some or all of 5 factors (Mesp1, Baf60c, Nkx2.5, Gata4, Tbx5), a set that includes some or all of 11 factors (Mesp1, Mesp2, Gata4, Gata6, Baf60c, SRF, Isl1, Nkx2.5, Irx4, Tbx5, Tbx20), a set that includes some or all of 18 factors (T, Mesp1, Mesp2, Tbx5, Tbx20, Isl1, Gata4, Gata6, Irx4, Nkx2.5, Hand1, Hand2, Tbx20, Tbx18, Tip60, Baf60c, SRF, Hey2), and a set that includes some or all of 22 factors (T, Mesp1, Mesp2, Tbx5, Tbx20, Isl1, Gata4, Gata6, Irx4, Nkx2.5, Hand1, Hand2, Tbx20, Tbx18, Tip60, Baf60c, SRF, Hey2, Oct4, Klf4, Sox2, L-myc). | 05-21-2015 |
