Patent application number | Description | Published |
20120111013 | SYSTEM FOR DIRECTING AIR FLOW IN A FUEL NOZZLE ASSEMBLY - According to various embodiments, a system includes a fuel nozzle assembly. The fuel nozzle assembly includes a hub, a shroud disposed about the hub, a flow sleeve disposed about the shroud, and an air flow path extending between the flow sleeve and the shroud in an upstream direction toward an opening region between the shroud and the hub, wherein the air flow path extends between the hub and the shroud in a downstream direction from the opening region toward an outlet region of the fuel nozzle assembly. The fuel nozzle assembly also includes a fuel flow path extending to at least one fuel port along the air flow path, and a flow guide disposed along the air flow path in the opening region, wherein the flow guide includes a first guide portion configured to guide an air flow radially outward from the hub toward the shroud. | 05-10-2012 |
20120125004 | COMBUSTOR PREMIXER - A combustor premixer is provided and includes a burner tube having a bell mouth-shaped opening, a plurality of tubular bodies telescopically disposed within the burner tube to deliver combustible materials to a premixing passage defined between the burner tube and an outermost one of the plurality of tubular bodies and a plurality of swirler vanes arrayed circumferentially in the opening, each one of the plurality of swirler vanes including a body extending along a radial dimension from the burner tube to the outermost tubular body and a leading edge protruding upstream from the opening. | 05-24-2012 |
20120186255 | SYSTEM FOR PRE-MIXING IN A FUEL NOZZLE - A system includes a fuel nozzle. The fuel nozzle includes a hub having an axis, a shroud disposed about the hub, an airflow path between the hub and the shroud, multiple vanes extending between the hub and the shroud, and a first fuel path leading to multiple first fuel outlets disposed on the multiple vanes. The fuel nozzle also includes a second fuel path leading to multiple second fuel outlets disposed on at least one of the hub and/or the shroud, wherein the multiple second fuel outlets are disposed at an axial distance upstream from a downstream end of the hub. | 07-26-2012 |
20120324896 | PREMIXER FUEL NOZZLE FOR GAS TURBINE ENGINE - In an embodiment, a system includes a turbine fuel nozzle having a hub with an axis, a shroud surrounding the hub along the axis, an air flow path between the hub and the shroud, and a fuel flow path. The turbine fuel nozzle also includes a swirl vane extending between the hub and the shroud in a radial direction relative to the axis. The swirl vane includes a fuel inlet coupled to the fuel flow path, a fuel chamber extending from the fuel inlet, and a plurality of fuel outlets extending from the fuel chamber to the air flow path. The plurality of fuel outlets is positioned at an axial distance of at least approximately ⅔ of an axial length of the fuel chamber downstream from an upstream point along an upstream edge of the fuel chamber. | 12-27-2012 |
20130086910 | SYSTEM FOR FUEL INJECTION IN A FUEL NOZZLE - A system includes a fuel nozzle. The fuel nozzle includes a hub, a shroud disposed about the hub, an airflow path between the hub and the shroud, multiple first fuel outlets disposed on the hub, and multiple swirl vanes disposed in the airflow path downstream from the multiple first fuel outlets. | 04-11-2013 |
20130111909 | Combustion System Having A Venturi For Reducing Wakes In An Airflow - A combustion system is provided having a liner, a flow sleeve, a flow-obstructing element, and a venturi. The liner is disposed around a combustion region. The flow sleeve is disposed around the liner. The liner and the flow sleeve cooperate to create an air passage having an airflow located between the liner and the flow sleeve. The flow-obstructing element is disposed within the air passage, and generally obstructs the airflow in the air passage to create wakes in the airflow. The venturi is disposed downstream from the flow-obstructing element, and generally restricts and diffuses the airflow in the air passage to reduce wakes in the airflow. | 05-09-2013 |
20130180248 | Combustor Nozzle/Premixer with Curved Sections - An apparatus for premixing fuel and air prior to combustion in a gas turbine engine includes an annular fuel passage receiving fuel from a fuel source. The annular fuel passage includes a fuel plenum and has a wave shape with a peak section surrounded by trough sections. An annular air passage surrounds the annular fuel passage. The annular air passage receives air to be mixed with the fuel in the fuel passage for downstream combustion. A plurality of swirler vanes are disposed in the annular air passage adjacent the fuel plenum. | 07-18-2013 |
Patent application number | Description | Published |
20100077759 | Tubular Fuel Injector for Secondary Fuel Nozzle - A fuel injector for a secondary fuel nozzle in a gas turbine includes axially oriented air slots and a plurality of fuel injection holes disposed between the air slots. The plurality of fuel injection holes include axially oriented injection holes and circumferentially oriented injection holes such that fuel input through the plurality of fuel injection holes is injected in both a circumferential direction and an axial direction to mix with air flowing through the air slots. | 04-01-2010 |
20110167828 | COMBUSTOR ASSEMBLY FOR A TURBINE ENGINE THAT MIXES COMBUSTION PRODUCTS WITH PURGE AIR - A combustor assembly for a turbine engine includes a fuel nozzle located at an upstream end of the combustor assembly. The fuel nozzle includes both a fuel delivery passageway and a purge air passageway. The purge air passageway conveys a flow of purge air to cool the fuel nozzle. The combustor assembly also includes a combustion product return line that conveys a flow of combustion products from a position downstream of a combustion zone of the combustor back to the fuel nozzle. The combustion products are mixed with purge air, and the mixture is delivered into a combustion zone located just downstream of the fuel nozzle. The addition of the combustion products into the purge air reduces the amount of oxygen in mixed flow, which helps to reduce the generation of undesirable nitrogen oxide combustion byproducts. Also, the greater heat of the combustion products helps to increase the temperature of the mixture, which helps to maintain the stability of a pilot flame fed by the mixture. | 07-14-2011 |
20130232979 | SYSTEM FOR ENHANCING MIXING IN A MULTI-TUBE FUEL NOZZLE - A system includes a multi-tube fuel nozzle including a fuel nozzle head and multiple tubes. The fuel nozzle head includes an outer wall surrounding a chamber, and the outer wall includes a downstream wall portion that faces a combustion region. The multiple tubes extend through the chamber to the downstream wall portion, and each tube includes an air inlet into the tube, a fuel inlet including a protrusion extending radially into the tube in a crosswise direction relative to a longitudinal axis of the tube, and an outlet from the tube. | 09-12-2013 |
20140331674 | WAKE REDUCING STRUCTURE FOR A TURBINE SYSTEM AND METHOD OF REDUCING WAKE - A wake reducing structure for a turbine system includes a combustor liner having an inner surface and an outer surface, the inner surface defining a combustor chamber. Also included is an airflow path located along the outer surface of the combustor liner. Further included is a wake generating component disposed in the airflow path and proximate the combustor liner, wherein the wake generating component generates a wake region located downstream of the wake generating component. Yet further included is an airfoil at least partially disposed in the wake region, the airfoil comprising at least one airfoil hole. | 11-13-2014 |
Patent application number | Description | Published |
20090113432 | METHOD AND SYSTEM FOR SIMULATING A MULTI-QUEUE SCHEDULER USING A SINGLE QUEUE ON A PROCESSOR - A method and system for scheduling tasks on a processor, the tasks being scheduled by an operating system to run on the processor in a predetermined order, the method comprising identifying and creating task groups of all related tasks; assigning the tasks in the task groups into a single common run-queue; selecting a task at the start of the run-queue; determining if the task at the start of the run-queue is eligible to be run based on a pre-defined timeslice allocated and on the presence of older starving tasks on the runqueue; executing the task in the pre-defined time slice; associating a starving status to all unexecuted tasks and running all until all tasks in the run-queue complete execution and the run-queue become empty. | 04-30-2009 |
20090307442 | Memory Access Control - An embodiment of a method of controlling memory access includes an initial step of receiving a first request to control memory access. The embodiment of the method also includes the step of creating an instance of a data structure based on the first request. In addition to the previous two steps the embodiment of the method also includes the steps of receiving a second request to access a memory, and examining the instance of the data structure to determine whether the memory can be accessed. | 12-10-2009 |
20090313611 | Dynamically Patching Computer Code Using Breakpoints - A first section of executable computer code of a computer program is dynamically patched by performing the following. A breakpoint is inserted at the first section of executable computer code. During execution of the computer program, an instruction counter is incremented on an instruction-by-instruction basis through the computer program. The instruction counter indicates a current instruction of the computer program being executed. The breakpoint where the instruction counter points to the first section of executable computer code is encountered, which results in a breakpoint handler being called. The breakpoint handler changes the instruction pointer to instead point to a second section of executable computer code. The second section of executable computer code is a patched version of the first section of executable computer code. Upon the breakpoint handler returning, the second section of executable computer code is executed in lieu of the first section of executable computer code. | 12-17-2009 |
20120124269 | Organizing Memory for Effective Memory Power Management - A kernel of the operating system reorganizes a plurality of memory units into a plurality of virtual nodes in a virtual non-uniform memory access architecture in response to receiving a configuration of the plurality of memory units from a firmware. A subsystem of the operating system determines an order of allocation of the plurality of virtual nodes calculated to maintain a maximum number of the plurality of memory units devoid of references. The memory controller transitions one or more memory units into a lower power state in response to the one or more memory units being devoid of one or more references for the period of time. | 05-17-2012 |
20120144170 | DYNAMICALLY SCALABLE PER-CPU COUNTERS - Embodiments include a reference counting system and method for a multiprocessor system including distributed per-CPU counters having a dynamically variable batch size. A global counter is dynamically updated as each per-CPU counter reaches its associated batch size. An initial batch size provides a desired scalability. The batch size is automatically reduced as the global count approaches a predefined target, to increase the accuracy of the global count. Counting can be performed atomically using architecturally supported atomic operations. Using synchronized counters, counting can be done with a lock held by each processor to provide the necessary mutual exclusion for performing the atomic operations. | 06-07-2012 |
20120272246 | DYNAMICALLY SCALABLE PER-CPU COUNTERS - Embodiments include a multiprocessing method including obtaining a local count of a processor event at each of a plurality of processors in a multiprocessor system. A total count of the processor event is dynamically updated to include the local count at each processor having reached an associated batch size. The batch size associated with one or more of the processors is dynamically varied according to the value of the total count. | 10-25-2012 |
20120324443 | REDUCING DATA TRANSFER OVERHEAD DURING LIVE MIGRATION OF A VIRTUAL MACHINE - A computer-implemented method is provided for reducing network traffic associated with live migration. The method comprises selecting a virtual machine on a first physical host for migration to a second physical host, and providing each application running in the selected virtual machine with notification that the migration has started. In response to receiving the notification that the migration has started, each application reducing the number of memory pages in use during the migration. The selected virtual machine and each application is then migrated from the first physical host to the second physical host, wherein the migration of each application includes migration of the reduced number of memory pages. Non-limiting examples of methods that may be used to reduce the number of memory pages includes identifying memory that contains garbage, reducing the size of the heap, increasing the pause time used for garbage collection, deferring just-in-time compilation of hot methods, and releasing caches and buffers. | 12-20-2012 |
Patent application number | Description | Published |
20110191562 | Apparatus and method for partitioning, sandboxing and protecting external memories - A technique to provide an integrated circuit that performs memory partitioning to partition a memory into a plurality of regions, in which the memory is accessed by a plurality of heterogeneous processing devices that operate to access the memory. The integrated circuit also assigns a security level for each region of the memory and permits a memory access by a transaction to a particular region of the memory, only when a level of security assigned to the transaction meets or exceeds the assigned security level for the particular region. The integrated circuit also performs sandboxing by assigning which of the plurality of processing devices are permitted access to each of the plurality of regions. The integrated circuit may implement only the security level function or only the sandboxing function, or the integrated circuit may implement them both. In some instances, a scrambling/descrambling function is included to scramble/descramble data. In one application, the integrated circuit is included within a mobile phone. | 08-04-2011 |
20150089579 | WEB-BASED SINGLE SIGN-ON WITH FORM-FILL PROXY APPLICATION - Web-based single sign-on can enable a user to log in to a single interface (such as through a web browser or thin client) and then provide SSO services to the user for one or more web applications. The web-based SSO system can be extended to support one or more different access control methods, such as form-fill, Federated (OIF), SSO Protected (OAM), and other policies. The web-based SSO system can include a user interface through which the user can access different web applications, systems, etc. and manage their credentials. Each SSO service can be associated with a web interface allowing the SSO services to be accessed over the web. The web interfaces can provide CRUD (create, read, update, delete) functionality for each SSO service. To support different access policy types, the web-based SSO system can include an extensible data manager that can manage data access to different types of repositories transparently. | 03-26-2015 |
20150089580 | WEB-BASED SINGLE SIGN-ON LOGON MANAGER - Web-based single sign-on can enable a user to log in to a single interface (such as through a web browser or thin client) and then provide SSO services to the user for one or more web applications. The web-based SSO system can be extended to support one or more different access control methods, such as form-fill, Federated (OIF), SSO Protected (OAM), and other policies. The web-based SSO system can include a user interface through which the user can access different web applications, systems, etc. and manage their credentials. Each SSO service can be associated with a web interface allowing the SSO services to be accessed over the web. The web interfaces can provide CRUD (create, read, update, delete) functionality for each SSO service. To support different access policy types, the web-based SSO system can include an extensible data manager that can manage data access to different types of repositories transparently. | 03-26-2015 |
20150089619 | WEB-BASED INTERFACE INTEGRATION FOR SINGLE SIGN-ON - Web-based single sign-on can enable a user to log in to a single interface (such as through a web browser or thin client) and then provide SSO services to the user for one or more web applications. The web-based SSO system can be extended to support one or more different access control methods, such as form-fill, Federated (OIF), SSO Protected (OAM), and other policies. The web-based SSO system can include a user interface through which the user can access different web applications, systems, etc. and manage their credentials. Each SSO service can be associated with a web interface allowing the SSO services to be accessed over the web. The web interfaces can provide CRUD (create, read, update, delete) functionality for each SSO service. To support different access policy types, the web-based SSO system can include an extensible data manager that can manage data access to different types of repositories transparently. | 03-26-2015 |
20150089620 | VIRTUALIZED DATA STORAGE AND MANAGEMENT OF POLICY AND CREDENTIAL DATA SOURCES - Web-based single sign-on can enable a user to log in to a single interface (such as through a web browser or thin client) and then provide SSO services to the user for one or more web applications. The web-based SSO system can be extended to support one or more different access control methods, such as form-fill, Federated (OIF), SSO Protected (OAM), and other policies. The web-based SSO system can include a user interface through which the user can access different web applications, systems, etc. and manage their credentials. Each SSO service can be associated with a web interface allowing the SSO services to be accessed over the web. The web interfaces can provide CRUD (create, read, update, delete) functionality for each SSO service. To support different access policy types, the web-based SSO system can include an extensible data manager that can manage data access to different types of repositories transparently. | 03-26-2015 |
Patent application number | Description | Published |
20120317443 | VIRTUAL DEBUGGING SESSIONS - An approach to providing multiple concurrently executing debugging sessions for a currently executing operating system. The approach involves providing one first debugging session for debugging the currently executing operating system. The first debugging session has read access and write access to the data of the currently executing operating system. The approach also involves providing one or more second debugging sessions for the currently executing operating system. Each of the second debugging sessions has read-only access to the data of the currently executing operating system. The second debugging sessions run simultaneously with the first debugging session if the second debugging sessions are started while the first debugging session is active. As a result, multiple users can simultaneously debug the currently executing operating system. A lock may be used to ensure that only the first debugging session has write access to the data. The lock may be shared between the various debugging sessions for the operating system. | 12-13-2012 |
20130124930 | CONTROLLING IPSEC OFFLOAD ENABLEMENT DURING HARDWARE FAILURES - Provided are techniques for receiving a packet transmitted in conjunction with a security association associated with Internet Protocol Security (IPSec); determining, based upon the security Association that the packet is faulty; incrementing a count corresponding to previous faulty packets received; determining that the count exceeds a threshold; and disabling IPSec accelerator hardware in response to the determining that the count exceeds the threshold. | 05-16-2013 |
20130232575 | CONTROLLING IPSEC OFFLOAD ENABLEMENT DURING HARDWARE FAILURES - Provided are techniques for receiving a packet transmitted in conjunction with a security association associated with Internet Protocol Security (IPSec); determining, based upon the security Association that the packet is faulty; incrementing a count corresponding to previous faulty packets received; determining that the count exceeds a threshold; and disabling IPSec accelerator hardware in response to the determining that the count exceeds the threshold. | 09-05-2013 |
20140082428 | Dynamic Hardware Watchpoint - An apparatus for monitoring changes to a block of data is disclosed. A first hardware watchpoint is set to monitor changes to the block of data at a current location of the block of data in memory and a second hardware watchpoint is set to monitor changes at a selected location in the memory where a reference to the block of data is located. Responsive to the second hardware watchpoint being triggered by a change at the selected location where the reference to the block of data is located, a new location of the block of data in the memory is identified based on the change that triggered the second hardware watchpoint. Subsequent to identifying the new location of the block of data, the first hardware watchpoint is reset to monitor changes to the block of data at the new location of the block of data. | 03-20-2014 |
Patent application number | Description | Published |
20090029003 | Process for Tea Manufacture - The present invention provides a process for manufacturing a leaf tea product. The process comprises the steps of providing fresh tea leaf, recovering aroma from the fresh tea leaf, and drying the fresh tea leaf to form the leaf tea product. The aroma is recovered whilst at least partially drying the fresh leaf in a low-convection dryer. | 01-29-2009 |
20090169679 | Process for recovering aroma from tea - Disclosed is a process for recovering volatile aroma compounds from a tea material. The process comprises the steps of: incubating the tea material in an aqueous medium; subjecting the incubated tea material to evaporation to obtain aroma-laden vapours; and condensing the aroma-laden vapours to recover an aroma condensate comprising volatile aroma compounds. The tea material is subjected to a step of extraction of soluble solids prior to step (a) and the aqueous medium in step (a) comprises an enzyme selected from cellulase, pectinase, β-glucosidase, primeverosidase or a mixture thereof. | 07-02-2009 |
20090169692 | Process for recovering volatile tea compounds - Disclosed is a process for recovering volatile compounds from an aqueous tea extract by distilling the said extract by fractional distillation comprising condensing of vapours, separating the oil phase condensate from the aqueous phase and refluxing the substantially oil-free aqueous phase. | 07-02-2009 |
20090191309 | Process for recovering aroma from tea - Disclosed is a process for recovering volatile aroma compounds from a tea material. The process comprises the steps of: generating aroma-laden vapours at a pressure of from 0.5 to 1.4 bar absolute from the tea material contacted with water or water vapours, and then condensing the aroma-laden vapours to recover aroma condensate. The process is controlled such that the mass of aroma condensate generated per unit dry mass of tea material is greater than 2 and the aroma-laden vapours comprise no more than 1% by weight entrained liquid. | 07-30-2009 |
Patent application number | Description | Published |
20110107424 | Rollback Feature - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for rolling back protection processes. In one aspect, a method includes determining that a file is a malicious file, storing a duplicate of the file in a quarantine area, performing one or more protection processes on the file, if the determination that the file is a malicious file is a false positive determination, restoring the file by a pre-boot rollback process to a state prior to the one or more protection processes performed on the file, and booting the computer with the restored file, and if the determination that the file is a malicious file is not a false positive determination, not restoring the file to a state prior to the one or more protection processes performed on the file, and booting the computer. | 05-05-2011 |
20120311708 | SYSTEM AND METHOD FOR NON-SIGNATURE BASED DETECTION OF MALICIOUS PROCESSES - Systems and methods for detecting malicious processes in a non-signature based manner are disclosed. The system and method may include gathering features of processes running on an electronic device, applying a set of rules to the features, and applying a statistical analysis to the results of the rules application to determine whether a process should be classified into one or more of a plurality of process categories. | 12-06-2012 |
20130031111 | SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT FOR SEGMENTING A DATABASE BASED, AT LEAST IN PART, ON A PREVALENCE ASSOCIATED WITH KNOWN OBJECTS INCLUDED IN THE DATABASE - A system, method, and computer program product are provided for segmenting a database based, at least in part, on a prevalence associated with known objects included in the database. In operation, a database including a plurality of known objects is identified. Additionally, the database is segmented into a plurality of segments. Furthermore, each of the plurality of known objects are assigned to one of the plurality of segments, based at least in part on a prevalence associated with each of the plurality of known objects. | 01-31-2013 |
20130061325 | Dynamic Cleaning for Malware Using Cloud Technology - A method for providing malware cleaning includes detecting potential malware on a first device connected to a network. A request including information to allow a second device connected to the network to determine an appropriate cleaning response is sent from the first device to the second device over the network. Upon receiving the request, the second device attempts to identify an appropriate cleaning response and, if a response is identified, sends the cleaning response over the network to the first device. The cleaning response is usable by the first device to address the detected potential malware. | 03-07-2013 |
20140026218 | ROLLBACK FEATURE - A file stored in a first portion of a computer memory of a computer is determined to be a malicious file. A duplicate of the file is stored in a quarantine area in the computer memory, the quarantine area being in a second portion of the computer memory that is different from the first portion of the computer memory. One or more protection processes are performed on the file. The determination that the file is a malicious file is determined to be a false positive and the file is restored, during a boot sequence, to a state prior to the one or more protection processes being performed on the file. | 01-23-2014 |
Patent application number | Description | Published |
20120127370 | ADAPTIVE FILTER FOR LOW-LIGHT NOISE REDUCTION - In general, in one embodiment, low-light noise is removed from an image by separately filtering luma and chroma components of the image, by adaptively filtering the image based at least in part on a Gaussian distribution of the image, and/or by dividing the image into separate regions and filtering each region separately. | 05-24-2012 |
20120128243 | COMPONENT FILTERING FOR LOW-LIGHT NOISE REDUCTION - In general, in one embodiment, low-light noise is removed from an image by separately filtering luma and chroma components of the image, by adaptively filtering the image based at least in part on a Gaussian distribution of the image, and/or by dividing the image into separate regions and filtering each region separately. | 05-24-2012 |
20120128244 | DIVIDE-AND-CONQUER FILTER FOR LOW-LIGHT NOISE REDUCTION - In general, in one embodiment, low-light noise is removed from an image by separately filtering luma and chroma components of the image, by adaptively filtering the image based at least in part on a Gaussian distribution of the image, and/or by dividing the image into separate regions and filtering each region separately. | 05-24-2012 |
20140176571 | BLOCK-BASED SIGNAL PROCESSING - Signal flows for data-processing applications may be implemented so as to enable each processing node in the flow when it contains a sufficient amount of input data at its input buffer. In various embodiments, such signal flows can be graphically defined in a GUI tool which, thereafter, auto-generates suitable code for implementing the signal flow. | 06-26-2014 |
20140241636 | SYSTEM AND METHOD FOR REMOVING IMAGE NOISE - A system and method for removing noise from images are disclosed herein. An exemplary system includes an edge-detection-based adaptive filter that identifies edge pixels and non-edge pixels in an image and selects a filtering technique for at least one non-edge pixel based on a comparison of the at least one non-edge pixel to a neighboring pixel region, wherein such comparison indicates whether the at least one non-edge pixel is a result of low-light noise. | 08-28-2014 |
Patent application number | Description | Published |
20100088334 | HIERARCHY MANAGER FOR MASTER DATA MANAGEMENT - A method, apparatus, and article of manufacture is configured to define a structured view of data in a computer system. A relational database management system (RDBMS) stores information in the computer system. As part of a process and framework, a series of business rules and process workflows that manage data (that is hierarchical in nature) that resides in one or more RDBMS tables are maintained. User input is accepted that defines a hierarchical structure that is projected onto the data. The hierarchical structure is stored as metadata in the RDBMS. The hierarchical structure is utilized to graphically visualize, manage, and manipulate the data. | 04-08-2010 |
20110137957 | TECHNIQUES FOR MANAGING DATA RELATIONSHIPS - Techniques for managing data relationships are presented. A database element from a first database table is linked with a database element of a second database table via a Graphical User Interface as directed by a user. The link establishes a data relationship having attributes and properties. The relationship along with the attributes and properties are graphically presented to the user for inspection and analysis. | 06-09-2011 |
20110137961 | TECHNIQUES FOR CROSS REFERENCING DATA - Techniques for cross referencing data are presented. A first database object and a second database object are linked together. The linkage is automatically cross referenced to a third database object. Access to any of the database objects can be achieved via any of the remaining database objects and vice versa. Additionally, the link and cross reference can be visualized and visually manipulated and modified. | 06-09-2011 |
20140279972 | CLEANSING AND STANDARDIZING DATA - Data cleansing and standardization techniques are provided. A user interactively defines rules for cleansing and standardizing data of a source dataset. The rules are applied to the data and varying degrees of results and metrics associated with applying the rules are presented to the user for inspection and analysis. | 09-18-2014 |
Patent application number | Description | Published |
20090302893 | High Speed "Pseudo" Current Mode Logic (CML) Integrated Circuit Memory Latch - “Negative And” (NAND) logic gate metal oxide semiconductor field effect transistor (MOSFET) switch(es) are incorporated in the first stage of a “pseudo” current mode logic (CML) latch to provide a low-resistance (or high-resistance) circuit path to the output depending on the input voltage. These switch(es) are also used to deactivate (or “switch-off”) the first stage of the circuit during the second half of a timing clock cycle, so as to permit the first stage to be activated (or “switched-on”) only during the first half of a clock cycle. “Cross-coupled” inverter(s) are also used in the second stage of the circuit to provide acceptable “rail-to-rail” output voltage differential “swing” using less current. In addition, the second stage also has MOSFET switch(es) which activate (or “switch-on”) only during the second half of a timing clock cycle and are deactivated (or “switched-off”) during the first half of a clock cycle, which (in combination with operation of the first stage circuit) requires use of less current and thus reduces power consumption. | 12-10-2009 |
20090302915 | Low Power and Full Rail-to-Rail Swing Pseudo CML Latch - The incorporation of MOS (metal oxide semiconductor) switches in the first stage of a CML latch, which act to bring about a significant savings in current usage, and thus lower power, as well as full rail-to-rail output swing. This/these switch(es) are also used to deactivate the first stage of the circuit during the second half of a timing clock cycle, so as to permit the first stage to be activated only during the first half of a clock cycle. “Cross-coupled” inverter(s) are also used in the second stage of the circuit to provide acceptable “rail-to-rail” output voltage differential “swing” using less current. In addition, the second stage also has MOSFET switch(es) which activate only during the second half of a timing clock cycle and are deactivated during the first half of a clock cycle, which requires use of less current and thus reduces power consumption. | 12-10-2009 |
20090302916 | Low Power and Full Swing Pseudo CML Latched Logic-Gates - “Negative And” (NAND) logic gate metal oxide semiconductor field effect transistor (MOSFET) switch(es) incorporated in the first stage of a “pseudo” current mode logic (CML) latch to provide a low-resistance (or high-resistance) circuit path to the output depending on the input voltage. This/these switch(es) are also used to deactivate the first stage of the circuit during the second half of a timing clock cycle, so as to permit the first stage to be activated only during the first half of a clock cycle. “Cross-coupled” inverter(s) are also used in the second stage of the circuit to provide acceptable “rail-to-rail” output voltage differential “swing” using less current. In addition, the second stage also has MOSFET switch(es) which activate only during the second half of a timing clock cycle and are deactivated during the first half of a clock cycle, which requires use of less current and thus reduces power consumption. | 12-10-2009 |
20140253236 | Generating Negative Impedance Compensation - Apparatuses for generating negative impedance compensation are provided. Embodiments include a differential amplifier having a first output and a second output; a capacitor coupled between the first output and the second output of the differential amplifier; a first negative impedance cross-coupled circuit having a first output and a second output; and a resistance control circuit coupled in series between the first output and the second output of the differential amplifier and the first output and the second output of the first negative impedance cross-coupled circuit. | 09-11-2014 |
Patent application number | Description | Published |
20120158670 | FINGERPRINTS DATASTORE AND STALE FINGERPRINT REMOVAL IN DE-DUPLICATION ENVIRONMENTS - A storage server is coupled to a storage device that stores blocks of data, and generates a fingerprint for each data block stored on the storage device. The storage server creates a fingerprints datastore that is divided into a primary datastore and a secondary datastore. The primary datastore comprises a single entry for each unique fingerprint and the secondary datastore comprises an entry having an identical fingerprint as an entry in the primary datastore. The storage server merges entries in a changelog with the entries in the primary datastore to identify duplicate data blocks in the storage device and frees the identified duplicate data blocks in the storage device. The storage server stores the entries that correspond to the freed data blocks to a third datastore and overwrites the primary datastore with the entries from the merged data that correspond to the unique fingerprints to create an updated primary datastore. | 06-21-2012 |
20140344538 | SYSTEMS, METHODS, AND COMPUTER PROGRAM PRODUCTS FOR DETERMINING BLOCK CHARACTERISTICS IN A COMPUTER DATA STORAGE SYSTEM - Systems, methods, and non-transitory machine readable media for determining block characteristics include one or more processors, a memory for storing instructions for the one or more processors, persistent storage, and a file system implemented in the persistent storage and storing data in the persistent storage using a plurality of blocks. When the stored instructions are executed by the one or more processors, the one or more processors are configured to traverse the plurality of blocks, read contents of a first block selected from the plurality of blocks, determine one or more characteristics of the first block from metadata within the block, and selectively perform or not perform a storage operation with respect to the first data block in response to determining the one or more characteristics. In some embodiments, the storage operation is a replication operation or a deduplication operation. | 11-20-2014 |
20150046409 | FINGERPRINTS DATASTORE AND STALE FINGERPRINT REMOVAL IN DE-DUPLICATION ENVIRONMENTS - A storage server is coupled to a storage device that stores blocks of data, and generates a fingerprint for each data block stored on the storage device. The storage server creates a fingerprints datastore that is divided into a primary datastore and a secondary datastore. The primary datastore comprises a single entry for each unique fingerprint and the secondary datastore comprises an entry having an identical fingerprint as an entry in the primary datastore. The storage server merges entries in a changelog with the entries in the primary datastore to identify duplicate data blocks in the storage device and frees the identified duplicate data blocks in the storage device. The storage server stores the entries that correspond to the freed data blocks to a third datastore and overwrites the primary datastore with the entries from the merged data that correspond to the unique fingerprints to create an updated primary datastore. | 02-12-2015 |
Patent application number | Description | Published |
20110118932 | FAULT DIAGNOSIS AND PROGNOSIS USING DIAGNOSTIC TROUBLE CODE MARKOV CHAINS - A system and method for fault diagnosis includes receiving information defining a relationship between failure modes and diagnostic trouble codes and extracting diagnostic trouble code data, including set times, frequency data and diagnostic trouble code sequence information for a plurality of diagnostic trouble codes relating to a plurality of failure modes. The system and method further include constructing a Markov chain using the diagnostic trouble code data for each of the plurality of failure modes, training the Markov chain to learn a set of state parameters using the diagnostic trouble code data, and computing a likelihood of a diagnostic trouble code sequence for each of the plurality of failure modes using the trained Markov chains. | 05-19-2011 |
20110137711 | DETECTING ANOMALIES IN FIELD FAILURE DATA - A method of detecting anomalies in the service repairs data of equipment. A failure mode-symptom correlation matrix correlates failure modes to symptoms. Diagnostic trouble codes are collected for an actual repair for the equipment. The diagnostic trouble codes are provided to a diagnostic reasoner for identifying failure modes. Diagnostic assessment is applied by the diagnostic reasoner for determining the recommended repairs to perform on the equipment in response to identifying the failure modes. Each of the recommended repairs is compared with the actual repair used to repair the equipment. A mismatch is identified in response to any recommended repair not matching the actual repair. Reports are generated for displaying all of the identified mismatches. The reports are analyzed for determining repair codes having an increase in a number of anomalies. Service centers are alerted of a correct repair for the identified failure mode. | 06-09-2011 |
20110144853 | MINING METHODOLOGY TO ELIMINATE INAPPROPRIATE SETTING OF ERROR CONDITIONS USING OPERATING PARAMETERS - A system and method for reducing or eliminating built-in tests and diagnostic trouble codes that are set as a result of improper parameter values. The method includes collecting field failure data that identifies diagnostic trouble codes and parameters of the system that are used to set diagnostic trouble codes. The method transforms the collected data into a format more appropriate for human analysis and pre-processes the transferred data to identify and remove information that could bias the human analysis. The method includes plotting linear and nonlinear combinations of operation parameters, performing data mining and analysis for detecting inappropriate settings of fault codes in the pre-processed data and providing the mined data to a subject matter expert for review to determine whether a diagnostic trouble code has been issued because of improper parameters. | 06-16-2011 |
20110145026 | SOFTWARE-CENTRIC METHODOLOGY FOR VERIFICATION AND VALIDATION OF FAULT MODELS - A method for verifying and improving a vehicle fault model is disclosed. The method includes analyzing the available field failure data that includes vehicle symptoms and failures for many vehicles. The method performs an analysis using the field failure data that includes using subject matter expert knowledge to determine the most significant failure modes and the most significant symptoms. The method also includes learning simulation parameters from the field failure data and simulating faults using the learned simulation parameters. The method further includes verifying and validating the fault model based on the most significant failure modes and the most significant symptoms from the what-if analysis and the faults identifies by the simulation, and using a diagnostic reasoner to analyze the revised fault model to generate estimated faults. The method then compares the estimated faults to the simulated faults to determine true detection and false alarm rates for a benefit analysis. | 06-16-2011 |
20110238258 | EVENT-DRIVEN FAULT DIAGNOSIS FRAMEWORK FOR AUTOMOTIVE SYSTEMS - Systems and methods for capturing and analyzing significant parameter data from vehicle systems whenever a diagnostic trouble code (DTC) is triggered. A multi-dimensional matrix is constructed, with vehicles, DTCs, and parameter data comprising three dimensions of the matrix. The data matrix is populated with DTC and parameter data from many different vehicles, either when vehicles are taken to a dealer for service, or via wireless data download. Time can be added as a fourth dimension of the matrix, providing an indication of whether a particular system or component is temporally degrading. When sufficient data is accumulated, the data matrix is pre-processed, features are extracted from the data, and the features are classified, using a variety of mathematical techniques. Trained classifiers are then used to diagnose the root cause of any particular fault signal, and also to provide a prognosis of system health and remaining useful life. | 09-29-2011 |
20120035803 | Event-Driven Data Mining Method for Improving Fault Code Settings and Isolating Faults - A parameter identification-based fault isolation technique is provided for improving fault code settings and isolating faults. DTCs and PIDs are retrieved from a current serviced vehicle. PID data is obtained from prior serviced vehicles having same vehicle specifications as and under substantially similar operating conditions as the current serviced vehicles. A plurality of clusters is formed using PID data of the prior serviced vehicles using mutual dependence to one another. A joint probability distribution is determined as a function of a mutual dependence of the PID data. PID data is selected of the current serviced vehicle having coherence to the PID of the prior service vehicles. A mutual dependence of the PID data of the current serviced vehicle is projected on onto the corresponding joint probability distribution. An anomaly in the PID data of the current serviced vehicle is detected in response to the probability distribution of parameter identification data being outside of a predetermined variance. | 02-09-2012 |
20120151290 | GRAPH MATCHING SYSTEM FOR COMPARING AND MERGING FAULT MODELS - A method and system for comparing and merging fault models which are derived from different data sources. Two or more fault models are first represented as bipartite weighted graphs, which define correlations between failure modes and symptoms. The nodes of the graphs are compared to find failure modes and symptoms which are the same even though the specific terminology may be different. A graph matching method is then used to compare the graphs and determine which failure mode and symptom correlations are common between them. Finally, smoothing techniques and domain expert knowledge are used to merge and update the fault models, producing an integrated fault model which can be used by onboard vehicle systems, service facilities, and others. | 06-14-2012 |
20120232743 | DEVELOPING FAULT MODEL FROM SERVICE PROCEDURES - A method and system for developing fault models from structured text documents, such as service procedures. A service procedure or other structured text document is parsed using diagnostic rules to extract symptoms, failure modes, and correlations. Testing procedures and repair instructions are also parsed to create a fault tree and identify additional symptoms and failure modes. Reachability analysis is then used to find hidden dependencies in the fault tree, thus yielding additional correlations. The resultant symptoms, failure modes, and correlations are then assembled into a fault model, which can be used for real-time fault diagnosis onboard a vehicle, or for off-board diagnosis at service shops. | 09-13-2012 |
20120233112 | DEVELOPING FAULT MODEL FROM UNSTRUCTURED TEXT DOCUMENTS - A method and system for developing fault models from unstructured text documents, such as text verbatim descriptions from customers and service technicians. An ontology, or data model, and heuristic rules are used to identify and extract descriptive terms from the text verbatim document. The descriptive terms are then classified into types, including symptoms, failure modes, and parts. Like-meaning but differently-worded descriptive terms are then merged using text similarity scoring techniques. The resultant symptoms, failure modes, parts, and correlations are then assembled into a fault model, which can be used for real-time fault diagnosis onboard a vehicle, or off-board at service shops. | 09-13-2012 |
20120303205 | DETECTING ANOMALIES IN FAULT CODE SETTINGS AND ENHANCING SERVICE DOCUMENTS USING ANALYTICAL SYMPTOMS - A method is provided for identifying a root cause of a fault in a serviced vehicle based on analytical symptoms. Parameter identification data associated with identified DTCs is retrieved. Parameter identification data from a plurality of vehicles experiencing the DTCs is collected. A first set of diagnostic rules is generated that identify vehicle operating parameters for executing a DTC algorithm or for triggering a DTC. A second set of diagnostic rules is generated that identify vehicle operating parameters used for selecting field failure data obtained when the DTC is triggered. Statistically significant rules are extracted from the second set of diagnostic rules. The first set of rules and the statistically significant rules are cooperatively applied to the parameter identification data for identifying a subset of the parameter identification data that represents anomalies. A subject matter expert analyzes the anomalies for identifying a root cause of the fault. | 11-29-2012 |
20130124032 | REPAIR ASSIST SYSTEM FOR VEHICLE SERVICING - A vehicle repair assist system for repairing a vehicle fault in a vehicle. A symptom input module is provided for entering vehicle symptom information relating to the fault. A diagnostic code module retrieves diagnostic trouble codes from the vehicle. The diagnostic trouble codes are generated in response to a fault occurrence. A knowledge-based fault module identifies potential causes of the vehicle fault based on at least one of the symptom information and diagnostic trouble codes. A repair assistant module identifies recommended repair parts and repair procedures for repairing the cause of the vehicle fault. The repair assistant module communicates with the knowledge-based fault module for obtaining a prioritized listing of the recommended repair parts and repair procedures for repairing the vehicle fault. | 05-16-2013 |
20130159240 | METHOD AND SYSTEM FOR ROOT CAUSE ANALYSIS AND QUALITY MONITORING OF SYSTEM-LEVEL FAULTS - System fault codes, component fault codes, and failure modes may be received at a system. A first level model comprising first level causal relationships and first level causal weights between the system fault codes and the component fault codes may be generated. A second level model comprising second level causal relationships and second level causal weights between the component fault codes and the failure modes may be generated. The first level model and the second level model may be combined to generate a model such as graphical model. One or more causal probabilities may be determined using the graphical model. | 06-20-2013 |
20130262067 | COLLABORATIVE VEHICLE HEALTH MODEL - A method includes collecting vehicle health data from a plurality of vehicles. A peer group is identified among the plurality of vehicles. The collected vehicle health data from the peer group into a collaborative vehicle health model, the collaborative vehicle health model being applicable to a current vehicle to predict a state of at least a component of the current vehicle. | 10-03-2013 |
20140129528 | Semantics Mismatch in Service Information - A method for correcting service manual textual inconsistencies. Extracting textual procedures from service documents stored in a memory of a service document storage device. Each term of an extracted textual procedure terminology is compared to a correlating target name terminology for identifying any matching terms by a processor. An overlap similarity is computed as a function of the identified matching terms from the extracted textual procedure terminology and the correlating target name terminology. A determination is made whether the overlap similarity is greater than a predetermined similarity threshold. The service documents are modified to change the extracted textual procedure terminology to the correlating target name terminology in response to the overlap similarity being greater than the predetermined similarity threshold and the extracted textual procedure terminology not exactly matching the correlating target name terminology. | 05-08-2014 |
Patent application number | Description | Published |
20090278516 | TRANSIENT RECOVERY CIRCUIT FOR SWITCHING DEVICES - A transient recovery circuit for switching devices. The transient recovery circuit includes a detecting circuit for detecting a rapid transient in an output voltage of a switching device by detecting a rate of the output voltage transient; an auxiliary controlling circuit in a feedback loop of the switching device for correcting the output voltage by changing a bandwidth of the feedback loop if the rapid transient is detected; and an initializing circuit for initializing the feedback loop to expected operating points in a continuous conduction mode after correcting the output voltage. | 11-12-2009 |
20100283439 | EFFICIENT SWITCH CASCODE ARCHITECTURE FOR SWITCHING DEVICES - Efficient switch cascode architecture for switching devices, such as switching regulators. The cascode architecture includes a switching stage responsive to an external driver signal for switching transitions, and a bias generator operative to bias the cascode transistor of the switching stage to protect the switching stage from damage during the switching transitions. | 11-11-2010 |
20120176112 | CIRCUIT FOR SENSING LOAD CURRENT OF A VOLTAGE REGULATOR - A circuit for sensing load current of a voltage regulator. The circuit includes a power transistor and a minor transistor. A first transistor sizing circuit is coupled to the power transistor and is operable to control size of the power transistor based on a bias voltage of the power transistor, thereby regulating a first voltage for varying load conditions. The circuit also includes a feedback amplifier coupled to the power transistor and the mirror transistor. A transistor is coupled to the feedback amplifier and the mirror transistor. An analog to digital converter (ADC) is coupled to the transistor. A second transistor sizing circuit is coupled to the mirror transistor, the transistor, and the ADC. The second transistor sizing circuit is responsive to an output voltage to control size of the minor transistor, thereby ensuring that accuracy of output voltage sensed by ADC is not limited by ADC's resolution. | 07-12-2012 |
20120193986 | HARVESTING POWER FROM DC (DIRECT CURRENT) SOURCES - In a solar panel array, each solar panel in a series-connected string has a current source connected across its output terminals. The current source generates a programmable output current equal to the difference of the load current drawn from the panel and the current corresponding to the maximum power point (MPP) of the panel. As a result, each of the panels in the string is operated at its MPP. When the array contains multiple strings connected in parallel, a voltage source is additionally connected in series with each string. The voltage sources are programmable to generate corresponding output voltages to enable operation of each panel in each of the multiple strings at its MPP. Respective control blocks providing the current sources and voltage sources automatically determine the MPP of the corresponding panels. In an embodiment, the control blocks are implemented as DC-DC converters in conjunction with measurement and communication units. | 08-02-2012 |
20120193989 | OPERATING DIRECT CURRENT (DC) POWER SOURCES IN AN ARRAY FOR ENHANCED EFFICIENCY - In a solar panel array that includes a string of series-connected panels, the load current flowing through the string is measured. The peak current (Ipp) of a panel in the string is determined. A current equal to the difference of the load current and the peak current (Ipp) is generated in a current source connected across the output terminals of the panel. The panel is thereby operated at its maximum power point (MPP). To determine the peak current (Ipp) of the panel, the magnitude of current flowing through the panel is iteratively changed and the corresponding power generated by the panel is computed. The change in the current through the panel and the measurement of the corresponding power are repeated until a maximum power is determined as being generated by the panel. The maximum power corresponds to the maximum power point (MPP) and the peak current (Ipp) of the panel. | 08-02-2012 |
20120299580 | TRANSIENT RECOVERY CIRCUIT FOR SWITCHING DEVICES - A transient recovery circuit for switching devices. The transient recovery circuit includes a detecting circuit for detecting a rapid transient in an output voltage of a switching device by detecting a rate of the output voltage transient; an auxiliary controlling circuit in a feedback loop of the switching device for correcting the output voltage by changing a bandwidth of the feedback loop if the rapid transient is detected; and an initializing circuit for initializing the feedback loop to expected operating points in a continuous conduction mode after correcting the output voltage. | 11-29-2012 |
20140091774 | SPREAD-SPECTRUM SWITCHING REGULATOR FOR ELIMINATING MODULATION RIPPLE - A spread-spectrum switching regulator for eliminating modulation ripple includes high gain amplifier that is responsive to reference voltage and feedback voltage of feedback loop to generate differential voltage, the feedback voltage being one of output voltage of the spread-spectrum switching regulator and a fraction of the output voltage; compensation circuit, coupled to the high gain amplifier, that maintains stability of the feedback loop to generate error level voltage in response to differential voltage; ramp generator that generates ramp waveform with slope adaptable to switching frequency to maintain duty cycle at constant value; pulse width modulator, coupled to compensation circuit and ramp generator, that compares error level voltage and ramp waveform to generate pulsed waveform; driver circuit, coupled to pulse width modulator, that drives the pulsed waveform to alternately switch a pair of transistors; and LC network, coupled to the pair of transistors, to average pulsed waveform to the output voltage. | 04-03-2014 |
20140239725 | MAXIMIZING POWER OUTPUT OF SOLAR PANEL ARRAYS - A system for generating electric power includes a first DC source, a second DC source and a shared optimizer. The first DC source provides a first voltage across a first node and a second node, while the second DC source provides a second voltage across the second node and a third node. The shared optimizer is designed to provide a first programmable current source between the first node and the second node as well as a second programmable current source between the second node and the third node. In an embodiment, the first and second DC sources are solar panels, and the optimizer includes a DC-DC converter, which operates to maximize power output of the solar panels. The use of a single (shared) optimizer may obviate the need for separate optimizers for each solar panel, and thereby reduce system cost. | 08-28-2014 |
Patent application number | Description | Published |
20120102060 | Query Optimization - A first query is received including a logical expression as a set of predicates in Disjunctive Normal Form. Each predicate from is represented as a bitwise predicate pattern to generate a set of bitwise predicate patterns. A set of valid bitwise patterns from the set of bitwise predicate patterns is identified using the first query. The set of valid bitwise patterns is parsed using logical operators to generate a logical bitwise expression. The logical bitwise expression is factored and the factored logical bitwise expression is mapped to corresponding predicates to generate a logical predicate expression. A second query is generated, which includes modifying the first query using the logical predicate expression and at least one logical operator. A subset of data is retrieved from the data repository using the second query. | 04-26-2012 |
20120130982 | OPTIMIZING DATABASE QUERY - Embodiments of the present invention relate to a method, computer program product and system for optimizing database transactions configured for receiving a query. The query specifies a set of predicates supplied to the query and a minimal number of predicates to be satisfied for the query to be true. An operation using the query is performed on a repository that is stored in a computer readable storage medium. A set of results satisfying the minimal number of predicated is rendered. | 05-24-2012 |
20130297586 | OPTIMIZING QUERIES USING PREDICATE MAPPERS - Provided are a computer implemented method, computer program product, and system for re-writing a query. A query including a query predicate is received. It is determined that the query predicate includes one column with an associated predicate mapper. An equivalent predicate is generated for the query predicate using the predicate mapper that provides a mapping from the one column to another column. A cost of the query with the equivalent predicate is evaluated. In response to determining that the cost of the query is optimal, the query is rewritten to replace the query predicate with the equivalent predicate. | 11-07-2013 |
20130297587 | OPTIMIZING QUERIES USING PREDICATE MAPPERS - Provided are a computer implemented method, computer program product, and system for re-writing a query. A query including a query predicate is received. It is determined that the query predicate includes one column with an associated predicate mapper. An equivalent predicate is generated for the query predicate using the predicate mapper that provides a mapping from the one column to another column. A cost of the query with the equivalent predicate is evaluated. In response to determining that the cost of the query is optimal, the query is rewritten to replace the query predicate with the equivalent predicate. | 11-07-2013 |