Patent application number | Description | Published |
20110113679 | METHODS OF REFINING AND PRODUCING FUEL FROM NATURAL OIL FEEDSTOCKS - Methods are provided for refining natural oil feedstocks. The methods comprise reacting the feedstock in the presence of a metathesis catalyst under conditions sufficient to form a metathesized product comprising olefins and esters. In certain embodiments, the methods further comprise separating the olefins from the esters in the metathesized product. In certain embodiments, the methods further comprise hydrogenating the olefins under conditions sufficient to form a fuel composition. In certain embodiments, the methods further comprise transesterifying the esters in the presence of an alcohol to form a transesterified product. | 05-19-2011 |
20110237850 | METHODS OF PRODUCING JET FUEL FROM NATURAL OIL FEEDSTOCKS THROUGH METATHESIS REACTIONS - Methods are provided for producing a jet fuel composition from a feedstock comprising a natural oil. The methods comprise reacting the feedstock with a low-weight olefin in the presence of a metathesis catalyst under conditions sufficient to form a metathesized product. The methods further comprise hydrogenating the metathesized product under conditions sufficient to form a jet fuel composition. | 09-29-2011 |
20130035502 | METHODS OF REFINING AND PRODUCING FUEL AND SPECIALTY CHEMICALS FROM NATURAL OIL FEEDSTOCKS - Methods are provided for refining natural oil feedstocks. The methods comprise reacting the feedstock with a low-molecular-weight olefin or mid-weight olefin in the presence of a metathesis catalyst under conditions sufficient to form a metathesized product comprising olefins and esters. In certain embodiments, the methods further comprise separating the olefins from the esters in the metathesized product. In certain embodiments, the methods further comprise transesterifying the esters in the presence of an alcohol to form a transesterified product. | 02-07-2013 |
20130217906 | DIENE-SELECTIVE HYDROGENATION OF METATHESIS DERIVED OLEFINS AND UNSATURATED ESTERS - Methods are provided for refining natural oil feedstocks and partially hydrogenating polyunsaturated olefins and polyunsaturated esters. The methods comprise reacting the feedstock in the presence of a metathesis catalyst under conditions sufficient to form a metathesized product comprising olefins and esters. In certain embodiments, the methods further comprise separating the polyunsaturated olefins from the polyunsaturated esters in the metathesized product. In certain embodiments, the methods further comprise partially hydrogenating the polyunsaturated olefins in the presence of a hydrogenation catalyst, wherein at least a portion of the polyunsaturated olefins are converted to monounsaturated olefins. In other embodiments, the methods further comprise partially hydrogenating the polyunsaturated esters in the presence of a hydrogenation catalyst, wherein at least a portion of the polyunsaturated esters are converted to monounsaturated esters. | 08-22-2013 |
20140336398 | METHODS OF REFINING AND PRODUCING FUEL AND SPECIALTY CHEMICALS FROM NATURAL OIL FEEDSTOCKS - Methods are provided for refining natural oil feedstocks. The methods include reacting the feedstock with a low-molecular-weight olefin or mid-weight olefin in the presence of a metathesis catalyst under conditions sufficient to form a metathesized product including olefins and esters. In certain embodiments, the methods further include separating the olefins from the esters in the metathesized product. In certain embodiments, the methods further include transesterifying the esters in the presence of an alcohol to form a transesterified product. | 11-13-2014 |
20140336399 | Methods of Refining and Producing Fuel and Specialty Chemicals from Natural Oil Feedstocks - Methods are provided for refining natural oil feedstocks. The methods include reacting the feedstock with a molar excess of low-molecular-weight olefins in the presence of a metathesis catalyst. In certain embodiments, the methods further include separating at least a portion of the unreacted low-molecular-weight olefins. In certain embodiments, the methods further include recycling the separated unreacted low-molecular-weight olefins. | 11-13-2014 |
20150094504 | METHODS OF PRODUCING JET FUEL FROM NATURAL OIL FEEDSTOCKS THROUGH METATHESIS REACTIONS - Methods are provided for producing a jet fuel composition from a feedstock including a natural oil. The methods include reacting the feedstock with a low-weight olefin in the presence of a metathesis catalyst under conditions sufficient to form a metathesized product. The methods further include hydrogenating the metathesized product under conditions sufficient to form a jet fuel composition. | 04-02-2015 |
20150119602 | HIGH PURITY DIBASIC ACID COMPOSITIONS AND METHODS OF MAKING THE SAME - High-purity dibasic acid compositions are generally disclosed. In some embodiments, the dibasic acid compositions are solutions or suspensions. In some other embodiments, the compositions are solid-state compositions. In some such embodiments, the solid-state compositions include a dibasic acid as a crystalline solid and further include a low quantity of certain impurities, such as monobasic acids, various esters, and the like. Methods and systems for making such high-purity dibasic acid compositions are also disclosed. | 04-30-2015 |
Patent application number | Description | Published |
20120084761 | Interprocedural Exception Method - An interprocedural exception analysis and transformation framework for computer programming languages such as C++ that (1) captures the control-flow induced by exceptions precisely, and (2) transforms the given computer program into an exception-free program that is amenable for precise static analysis, verification, and optimizations. | 04-05-2012 |
20120117547 | EMBEDDING CLASS HIERARCHY INTO OBJECT MODELS FOR MULTIPLE CLASS INHERITANCE - A model is provided for transforming a program with a priori given class hierarchy that is induced by inheritance. An inheritance remover is configured to remove inheritance from a given program to produce an analysis-friendly program which does not include virtual-function pointer tables and runtime libraries associated with inheritance-related operations. The analysis-friendly program preserves the semantics of the given program with respect to a given class hierarchy. A clarifier is configured to identify implicit expressions and function calls and transform the given program into at least one intermediate program having explicit expressions and function calls. | 05-10-2012 |
20120233584 | Analysis of Interactions of C and C++ Strings - A computer implemented method for analyzing a computer software program comprising both C++ and C string components, wherein the method includes building a memory model abstraction of any memory used by the program strings. Various memory models are presented that find invalid memory accesses in terms of validity of memory regions and buffer overflows. The model supports analyzing the interaction of C and C++ components—in particular, it focuses on the interaction of C and C++ strings. The conversion of C++ strings to C strings is accomplished through a non-transferable ownership attribute that is to be respected by the C strings. The models can then be analyzed using static analysis techniques such as abstract interpretation and model checking, or through dynamic analysis. In so doing we allow discovery of potential memory safety violations in programs involving conversions between C and C++ strings. | 09-13-2012 |
20120246626 | DONUT DOMAINS - EFFICIENT NON-CONVEX DOMAINS FOR ABSTRACT INTERPRETATION - A computer implemented program analysis method employing a set of new abstract domains applicable to non-convex invarients. The method analyzes programs statically using abstract interpretation while advantageously considering non-convex structures and in particular those situations in which an internal region of an unreachable state exists within a larger region of reachable states. The method employs a new set of non-convex domains (donut domains) based upon the notion of an outer convex region of reachable states (Domain D1) and an inner region of unreachable states (Domain D2) which advantageously permits capture of non-convex properties by using convex regions and operations. | 09-27-2012 |
20140019946 | LAYERED DECOMPOSITION FOR SCALABLE STATIC DATA RACE DETECTION OF CONCURRENT PROGRAMS - Disclosed is a method of performing static data race detection in concurrent programs wherein a control flow graph (CFG) is decomposed into layers of bounded call-depth which are then used to perform a resulting analysis. Next, a set of pointers of interest are segmented into classes such that each pointer may only be aliased to pointers within its own class, these classes related to computation of shared variables, locksets, waitsets, and notifysets. A flow sensitive context sensitive points-to-analysis for program statements that impact aliases of members within the given class is performed—advantageously reducing the overall size of the problem at hand. Notably, the analysis for individual threads is performed independently of one another, on multiple layers of the CFG, and subsequently merging the results from the individual layers. | 01-16-2014 |
20140289712 | Effective Lifetime Dependency Analysis and Typestate Analysis - Disclosed are typestate and lifetime dependency analysis methods for identifying bugs in C++ programs. Disclosed are an abstract representation (ARC++) that models C++ objects and which makes object creation/destruction, usage, lifetime and pointer operations explicit in the abstract model thereby providing a basis for static analysis on the C++ program. Also disclosed is a lifetime dependency analysis that tracks implied dependency relationships between lifetimes of objects, to capture an effective high-level abstraction for issues involving temporary objects and internal buffers, and subsequently used in the static analysis that supports typestate checking for the C++ program. Finally disclosed a framework that automatically genarates ARC++ representations from C++ programs and performs typestate checking to detect bugs that are specified as typestate automata over ARC++ representations. | 09-25-2014 |
20140337674 | Network Testing - A network testing method implemented in a software-defined network (SDN) is disclosed. The network testing method comprising providing a test scenario including one or more network events, injecting said one or more network events to the SDN using an SDN controller, and gathering network traffic statistics. A network testing apparatus used in a software-defined network (SDN) also is disclosed. The network testing apparatus comprising a testing system to provide a test scenario including one or more network events, to inject said one or more network events to the SDN using an SDN controller, and to gather network traffic statistics. Other methods, apparatuses, and systems also are disclosed. | 11-13-2014 |
20150081243 | Setsudo: Pertubation-based Testing Framework for Scalable Distributed Systems - Disclosed are a testing framework—SETSUD Ō—that uses perturbation-based exploration for robustness testing of modern scalable distributed systems. In sharp contrast to existing testing techniques and tools that are limited in that they are typically based on black-box approaches or they focus mostly on failure recovery testing, SETSUD Ō is a flexible framework to exercise various perturbations to create stressful scenarios. SETSUD Ō is built on an underlying instrumentation infrastructure that provides abstractions of internal states of the system as labeled entities. Both novice and advanced testers can use these labeled entities to specify scenarios of interest at the high level, in the form of a declarative style test policy. SETSUD Ō automatically generates perturbation sequences and applies them to system-level implementations, without burdening the tester with low-level details. | 03-19-2015 |
Patent application number | Description | Published |
20090193401 | PATH-SENSITIVE ANALYSIS THROUGH INFEASIBLE-PATH DETECTION AND SYNTACTIC LANGUAGE REFINEMENT - A system and method for infeasible path detection includes performing a static analysis on a program to prove a property of the program. If the property is not proved, infeasible paths in the program are determined by performing a path-insensitive abstract interpretation. Information about such infeasible paths is used to achieve the effects of path-sensitivity in path-insensitive program analysis. | 07-30-2009 |
20090292941 | PROOF-GUIDED ERROR DIAGNOSIS (PED) BY TRIANGULATION OF PROGRAM ERROR CAUSES - Systems and methods are disclosed for performing error diagnosis of software errors in a program by from one or more error traces, building a repair program containing one or more modified program semantics corresponding to fixes to observed errors; encoding the repair program with constraints, biases and priortization into a constraint weighted problem; and solving the constraint weighted problem to generate one or more repair solutions, wherein the encoding includes at least one of: a) constraining one or more repairs choices guided by automatically inferring one or more partial specifications of intended program behaviors and program structure; b) biasing one or more repair choices guided by typical programming mistakes; and c) prioritizing the repair solutions based on error locations and possible changes in program semantics. | 11-26-2009 |
20100005454 | PROGRAM VERIFICATION THROUGH SYMBOLIC ENUMERATION OF CONTROL PATH PROGRAMS - Systems and methods are disclosed to verify a program by symbolically enumerating path programs; verifying each path program to determine if the path program is correct or leads to a violation of a correctness property; determining a conflict set from the path program if the path program is proved correct; using the conflict set to avoid enumerating other related path programs that are also correct. | 01-07-2010 |
20100205592 | CONTROL STRUCTURE REFINEMENT OF LOOPS USING STATIC ANALYSIS - A system and method for discovering a set of possible iteration sequences for a given loop in a software program is described, to transform the loop representation. In a program containing a loop, the loop is partitioned into a plurality of portions based on splitting criteria. Labels are associated with the portions, and an initial loop automaton is constructed that represents the loop iterations as a regular language over the labels corresponding to the portions in the program. Subsequences of the labels are analyzed to determine infeasibility of the subsequences permitted in the automaton. The automaton is refined by removing all infeasible subsequences to discover a set of possible iteration sequences in the loop. The resulting loop automaton is used in a subsequent program verification or analysis technique to find violations of correctness properties in programs. | 08-12-2010 |
20130091495 | FEEDBACK-DIRECTED RANDOM CLASS UNIT TEST GENERATION USING SYMBOLIC EXECUTION - Methods and systems for generating software analysis test inputs include generating a path query to cover a target branch of a program by executing a symbolic test driver concretely and partially symbolically, where at least one symbolic expression is partially concretized with concrete values; determining whether it is feasible to execute the target branch based on whether the generated path query is satisfiable or unsatisfiable using a constraint solver; if the target branch is feasible, generating a new test driver by replacing symbolic values in the symbolic test driver with generated solution values; and if the target branch is not feasible, analyzing an unsatisfiable core to determine whether unsatisfiability is due to a concretization performed during generation of the path query. | 04-11-2013 |
20130227537 | CONTROL STRUCTURE REFINEMENT OF LOOPS USING STATIC ANALYSIS - A system and method for discovering a set of possible iteration sequences for a given loop in a software program is described, to transform the loop representation. In a program containing a loop, the loop is partitioned into a plurality of portions based on splitting criteria. Labels are associated with the portions, and an initial loop automaton is constructed that represents the loop iterations as a regular language over the labels corresponding to the portions in the program. Subsequences of the labels are analyzed to determine infeasibility of the subsequences permitted in the automaton. The automaton is refined by removing all infeasible subsequences to discover a set of possible iteration sequences in the loop. The resulting loop automaton is used in a subsequent program verification or analysis technique to find violations of correctness properties in programs. | 08-29-2013 |
Patent application number | Description | Published |
20120213307 | Rateless and Rated Coding Using Spinal Codes - In one aspect, a wireless system includes an encoder configured to encode data using a spinal code which uses a function over the message bits to directly produce a sequence of constellation symbols for transmission. The wireless system also includes a decoder configured to decode the spinal code. The function may be at least one of a non-linear function and a hash function. | 08-23-2012 |
20130191650 | METHODS AND APPARATUS FOR SECURING A DATABASE - Methods and apparatus for a system to maintain confidentiality of data in a database management system by selecting encryption schemes for data items, storing encrypted data in databases, transforming SQL queries to run over encrypted data, and executing queries over encrypted data on the database server. | 07-25-2013 |
20140211881 | Rateless And Rated Coding Using Spinal Codes - In one aspect, a wireless system includes an encoder configured to encode data using a spinal code which uses a function over the message bits to directly produce a sequence of constellation symbols for transmission. The wireless system also includes a decoder configured to decode the spinal code. The function may be at least one of a non-linear function and a hash function. | 07-31-2014 |
20140278206 | INFERENCE OF VEHICULAR TRAJECTORY CHARACTERISTICS WITH PERSONAL MOBILE DEVICES - Accurate longitudinal acceleration, lateral acceleration (perpendicular to the principal direction of motion, and velocity, is inferred by processing raw data from a commodity three-axis accelerometer that may be oriented arbitrarily in a moving vehicle (or carried by a moving user), and whose orientation and position may change arbitrarily during the motion. The approach is applicable to a range of applications, including insurance telematics, driver behavior and risk assessment, and road surface quality assessment. | 09-18-2014 |
20150300827 | TELEMATICS USING PERSONAL MOBILE DEVICES - An approach to telematics using mobile devices provides battery-efficient trajectory and mileage inference from inaccurate and intermittent location data. Accurate trajectories of how users or vehicles move in the physical world are formed by processing raw position estimates obtained from noisy, inaccurate, and error-prone position sensors on mobile devices, where the position data may also arrive intermittently with long time gaps. The trajectory is formed using the process of map matching, which determines the trajectory on a map that best explains the sequence of position observations. | 10-22-2015 |
20150312655 | System and Method for Obtaining Vehicle Telematics Data - A sensor tag which in use will be affixed to a vehicle for obtaining vehicle telematics data includes a battery for powering the tag and a processor running executable code to process accelerometer data. An accelerometer measures the acceleration of the tag and thereby of the vehicle, and also controls the operation of the processor. A memory is used for storing a unique tag identifier of the tag and for storing trip data including information about trips and acceleration data. Finally, a communication module is used for short range wireless communication with a mobile communications device located in the vehicle via a short range wireless communications protocol, the communication module transmitting the tag's unique identifier and a sequence of time stamped acceleration data. The mobile communications device obtains GPS data, combines this with the acceleration date and transmits this to a server for analysis. | 10-29-2015 |
Patent application number | Description | Published |
20100022406 | Methods and Systems for Universal Carrier Screening - Provided herein are methods, systems, and devices for genetic screening. The genetic screening of two or more individuals can be utilized to predict the phenotype of a child from the group of individuals. Also disclosed is prediction of a phenotype of a child from a subset of biological relatives, such as a potential mother and father, before conception. In many instances, the methods, systems and devices herein are utilized to predict the probability of a child developing a rare genetic disease. | 01-28-2010 |
20130225417 | METHODS AND SYSTEMS FOR UNIVERSAL CARRIER SCREENING - Provided herein are methods, systems, and devices for genetic screening. The genetic screening of two or more individuals can be utilized to predict the phenotype of a child from the group of individuals. Also disclosed is prediction of a phenotype of a child from a subset of biological relatives, such as a potential mother and father, before conception. In many instances, the methods, systems and devices herein are utilized to predict the probability of a child developing a rare genetic disease. | 08-29-2013 |
20160103959 | Methods and Systems for Universal Carrier Screening - Provided herein are methods, systems, and devices for genetic screening. The genetic screening of two or more individuals can be utilized to predict the phenotype of a child from the group of individuals. Also disclosed is prediction of a phenotype of a child from a subset of biological relatives, such as a potential mother and father, before conception. In many instances, the methods, systems and devices herein are utilized to predict the probability of a child developing a rare genetic disease. | 04-14-2016 |
Patent application number | Description | Published |
20130334483 | METHODS OF FORMING RESISTIVE MEMORY ELEMENTS AND RELATED RESISTIVE MEMORY ELEMENTS, RESISTIVE MEMORY CELLS, AND RESISTIVE MEMORY DEVICES - A method of forming a resistive memory element comprises forming an oxide material over a first electrode. The oxide material is exposed to a plasma process to form a treated oxide material. A second electrode is formed on the treated oxide material. Additional methods of forming a resistive memory element, as well as related resistive memory elements, resistive memory cells, and resistive memory devices are also described. | 12-19-2013 |
20140306172 | INTEGRATED CIRCUIT SYSTEM WITH NON-VOLATILE MEMORY AND METHOD OF MANUFACTURE THEREOF - An integrated circuit system, and a method of manufacture thereof, including: an integrated circuit die having an address switch; a bottom electrode contact, free of halogen constituents, characteristic of a chemical vapor deposition or an atomic layer deposition, and coupled to the address switch; a transition material layer directly on the bottom electrode contact; and a top electrode contact, directly on the transition material layer, for forming a non-volatile memory array on the integrated circuit die. | 10-16-2014 |
20150333257 | RESISTIVE MEMORY ELEMENTS, RESISTIVE MEMORY CELLS, AND RESISTIVE MEMORY DEVICES - A method of forming a resistive memory element comprises forming an oxide material over a first electrode. The oxide material is exposed to a plasma process to form a treated oxide material. A second electrode is formed on the treated oxide material. Additional methods of forming a resistive memory element, as well as related resistive memory elements, resistive memory cells, and resistive memory devices are also described. | 11-19-2015 |
20150340247 | METHOD FOR FORMING A METAL CAP IN A SEMICONDUCTOR MEMORY DEVICE - Exemplary embodiments of the present invention are directed towards a method for fabricating a semiconductor memory device comprising selectively depositing a material to form a cap above a recessed cell structure in order to prevent degradation of components inside the cell structure in oxidative or corrosive environments. | 11-26-2015 |
Patent application number | Description | Published |
20100241787 | SENSOR PROTECTION USING A NON-VOLATILE MEMORY CELL - A method and apparatus for protecting an electrical device using a non-volatile memory cell, such as an STRAM or RRAM memory cell. In some embodiments, a memory element is connected in parallel with a sensor element, where the memory element is configured to be repetitively reprogrammable between a high resistance state and a low resistance state. The memory element is programmed to the low resistance state when the sensor element is in a non-operational state and reprogrammed to the high resistance state when the sensor element is in an operational state. | 09-23-2010 |
20110006275 | NON-VOLATILE RESISTIVE SENSE MEMORY - A resistive sense memory cell includes a layer of crystalline praseodymium calcium manganese oxide and a layer of amorphous praseodymium calcium manganese oxide disposed on the layer of crystalline praseodymium calcium manganese oxide forming a resistive sense memory stack. A first and second electrode are separated by the resistive sense memory stack. The resistive sense memory cell can further include an oxygen diffusion barrier layer separating the layer of crystalline praseodymium calcium manganese oxide from the layer of amorphous praseodymium calcium manganese oxide a layer. Methods include depositing an amorphous praseodymium calcium manganese oxide disposed on the layer of crystalline praseodymium calcium manganese oxide forming a resistive sense memory stack. | 01-13-2011 |
20110007544 | Non-Volatile Memory with Active Ionic Interface Region - A non-volatile memory cell and method of use therefore are disclosed. In accordance with various embodiments, the memory cell comprises a tunneling region disposed between a conducting region and a metal region, wherein the tunneling region comprises an active interface region disposed between a first tunneling barrier and a second tunneling barrier. A high resistive film is formed in the active interface region with migration of ions from both the metal and conducting regions responsive to a write current to program the memory cell to a selected resistive state. | 01-13-2011 |
20120273744 | NON-VOLATILE RESISTIVE SENSE MEMORY WITH IMPROVED SWITCHING - A resistive sense memory cell includes a layer of crystalline praseodymium calcium manganese oxide and a layer of amorphous praseodymium calcium manganese oxide disposed on the layer of crystalline praseodymium calcium manganese oxide forming a resistive sense memory stack. A first and second electrode are separated by the resistive sense memory stack. The resistive sense memory cell can further include an oxygen diffusion barrier layer separating the layer of crystalline praseodymium calcium manganese oxide from the layer of amorphous praseodymium calcium manganese oxide a layer. Methods include depositing an amorphous praseodymium calcium manganese oxide disposed on the layer of crystalline praseodymium calcium manganese oxide forming a resistive sense memory stack. | 11-01-2012 |
Patent application number | Description | Published |
20090283740 | OPTIMIZED SOLID ELECTROLYTE FOR PROGRAMMABLE METALLIZATION CELL DEVICES AND STRUCTURES - A microelectronic programmable structure suitable for storing information and array including the structure and methods of forming and programming the structure are disclosed. The programmable structure generally includes an ion conductor and a plurality of electrodes. Electrical properties of the structure may be altered by applying energy to the structure, and thus information may be stored using the structure. | 11-19-2009 |
20100109085 | MEMORY DEVICE DESIGN - Memory elements and methods for making memory elements. One method of making a memory element includes forming a first electrode, forming an electrically conductive current densifying element and a memory cell on the first electrode, the memory cell and the current densifying element adjacent to each other. A second electrode is formed over the current densifying element and the memory cell. The memory elements may be resistance random access memory elements. | 05-06-2010 |
20100193758 | PROGRAMMABLE METALLIZATION MEMORY CELL WITH PLANARIZED SILVER ELECTRODE - Programmable metallization memory cells having a planarized silver electrode and methods of forming the same are disclosed. The programmable metallization memory cells include a first metal contact and a second metal contact, an ion conductor solid electrolyte material is between the first metal contact and the second metal contact, and either a silver alloy doping electrode separates the ion conductor solid electrolyte material from the first metal contact or the second metal contact, or a silver doping electrode separates the ion conductor solid electrolyte material from the first metal contact. The silver electrode includes a silver layer and a metal seed layer separating the silver layer from the first metal contact. | 08-05-2010 |
20120138884 | PROGRAMMABLE METALLIZATION MEMORY CELL WITH PLANARIZED SILVER ELECTRODE - Programmable metallization memory cells having a planarized silver electrode and methods of forming the same are disclosed. The programmable metallization memory cells include a first metal contact and a second metal contact, an ion conductor solid electrolyte material is between the first metal contact and the second metal contact, and either a silver alloy doping electrode separates the ion conductor solid electrolyte material from the first metal contact or the second metal contact, or a silver doping electrode separates the ion conductor solid electrolyte material from the first metal contact. The silver electrode includes a silver layer and a metal seed layer separating the silver layer from the first metal contact. | 06-07-2012 |
20120142169 | PROGRAMMABLE METALLIZATION MEMORY CELL WITH PLANARIZED SILVER ELECTRODE - Programmable metallization memory cells having a planarized silver electrode and methods of forming the same are disclosed. The programmable metallization memory cells include a first metal contact and a second metal contact, an ion conductor solid electrolyte material is between the first metal contact and the second metal contact, and either a silver alloy doping electrode separates the ion conductor solid electrolyte material from the first metal contact or the second metal contact, or a silver doping electrode separates the ion conductor solid electrolyte material from the first metal contact. The silver electrode includes a silver layer and a metal seed layer separating the silver layer from the first metal contact. | 06-07-2012 |
Patent application number | Description | Published |
20130190903 | Action Detection and Activity Classification - Activities, actions and events during user performance of physical activity may be detected using various algorithms and templates. Templates may include an arrangement of one or more states that may identify particular event types and timing between events. Templates may be specific to a particular type of activity (e.g., types of sports, drills, events, etc.), user, terrain, time of day and the like. | 07-25-2013 |
20150151160 | FLIGHT TIME - Systems and methods for monitoring athletic performances include determining “flight time,” e.g., the amount of time both feet are off the ground, and optionally “flight time” resulting from different types of activities, such as jogging, running, sprinting, jumping, etc. “Flight time” may help a player or coach better understand the effort the athlete is putting out, compare efforts of two or more players, gauge the athlete's performance change over time, and/or identify conditioning needs and/or areas for improvement. Such systems and methods also may generate and display various athletic performance metrics, such as: instantaneous flight time; average flight time; cumulative flight time during an athletic performance or other time period; instantaneous jump height; average jump height; cumulative jump height during an athletic performance or other time period; and comparisons of any flight time and/or jump height metric(s) of one player against another player and/or against himself/herself; etc. | 06-04-2015 |
20150153374 | FLIGHT TIME - Systems and methods for monitoring athletic performances include determining “flight time,” e.g., the amount of time both feet are off the ground, and optionally “flight time” resulting from different types of activities, such as jogging, running, sprinting, jumping, etc. “Flight time” may help a player or coach better understand the effort the athlete is putting out, compare efforts of two or more players, gauge the athlete's performance change over time, and/or identify conditioning needs and/or areas for improvement. Such systems and methods also may generate and display various athletic performance metrics, such as: instantaneous flight time; average flight time; cumulative flight time during an athletic performance or other time period; instantaneous jump height; average jump height; cumulative jump height during an athletic performance or other time period; and comparisons of any flight time and/or jump height metric(s) of one player against another player and/or against himself/herself; etc. | 06-04-2015 |
Patent application number | Description | Published |
20140039351 | SENSING SYSTEM FOR PATIENT SUPPORTS - A sensing system for a patient support, such as a bed, cot, stretcher, or the like, provides data about the patient and/or the patient support itself. The sensing system may include a flexible sheet that houses a sensor array that detects interface pressures between the patient and the support surface on the patient support. A user interface allows a caregiver to control operational parameters of the sensor array, including alarms. A color coded map may be displayed on the user interface highlighting the patient's currently experienced interface pressures. A control system coupled to the sensor array may map the sensor outputs to the body of the patient in order to correlate the interface pressures to specific parts of the patient's body. Shear pressure may, in some embodiments, also be detected by the sensor sheet. | 02-06-2014 |
20150106052 | Calculating Pace and Energy Expenditure from Athletic Movement Attributes - Systems and methods configured to process motion data associated with a user. The systems and methods are configured to receive motion data from a sensor, calculate motion attributes from the data, and classify the motion data using one or more mathematical models. Further, the systems and methods are configured to identify and quantify, using the one or more mathematical models, the motion data as linear travel motion associated with the user running or walking. | 04-16-2015 |
20160045159 | Calculating Pace and Energy Expenditure from Athletic Movement Attributes - Systems and methods configured to process motion data associated with a user. The systems and methods are configured to receive motion data from a sensor, calculate motion attributes from the data, and classify the motion data using one or more mathematical models. Attributes may be calculated without classifying the motion data into an activity type (such as walking, running, swimming, or any specific or general activity). Attributes may be compared to activity models comprising motion data from several individuals, which may not include the user. Motion data within the models and attributes of the user may be independent of any activity type. Attributes may be compared to select an energy expenditure model from one or more energy expenditure models, which may be selected as a best-match to the one or more motion attributes. An energy expenditure associated with the motion of the user may then be calculated. | 02-18-2016 |
Patent application number | Description | Published |
20140074263 | Athletic Performance Monitoring Systems and Methods in a Team Sports Environment - Systems, apparatuses, and methods for determining when an athlete is in possession of a ball by analyzing image data are provided. A camera is worn by an athlete and is turned on when the athlete is in proximity of a ball. The camera is used to generate an image of a ball. The size of the ball is determined and compared to a threshold. The athlete is considered to be in possession of the ball when the size of the image exceeds the threshold. | 03-13-2014 |
20140278125 | Apparel and Location Information System - Systems and methods are provided for calculating athletic activity parameters. Multiple housings are position at different locations on a user's body. The housings are configured to be removably engaged with an electronic module that includes a sensor and a processor configured to calculate athletic activity parameters. Each housing is connected to or includes an identification memory that stores information identifying a location of the housing. The electronic module uses the location information to select an algorithm to use when calculating the athletic activity parameters. | 09-18-2014 |
20140288682 | Athletic Performance Monitoring Systems and Methods in a Team Sports Environment - Systems, apparatuses, and methods for determining when an athlete is in possession of a ball by analyzing image data are provided. A camera is worn by an athlete and is turned on when the athlete is in proximity of a ball. The camera is used to generate an image of a ball. The size of the ball is determined and compared to a threshold. The athlete is considered to be in possession of the ball when the size of the image exceeds the threshold. | 09-25-2014 |
20150157272 | Action Detection and Activity Classification - Activities, actions and events during user performance of physical activity may be detected using various algorithms and templates. Templates may include an arrangement of one or more states that may identify particular event types and timing between events. Templates may be specific to a particular type of activity (e.g., types of sports, drills, events, etc.), user, terrain, time of day and the like. | 06-11-2015 |
20150174468 | Action Detection and Activity Classification - Activities, actions and events during user performance of physical activity may be detected using various algorithms and templates. Templates may include an arrangement of one or more states that may identify particular event types and timing between events. Templates may be specific to a particular type of activity (e.g., types of sports, drills, events, etc.), user, terrain, time of day and the like. | 06-25-2015 |
20150217163 | Visualization of Athletic Activity - Example embodiments relate to systems, methods, apparatuses, and computer readable media relating to a user interface, that may for example, receive and/or process physical activity data and allow interaction with the received information in novel implementations. | 08-06-2015 |
20150265877 | Flight Time - Systems and methods for monitoring athletic performances include determining “flight time,” e.g., the amount of time both feet are off the ground, and optionally “flight time” resulting from different types of activities, such as jogging, running, sprinting, jumping, etc. “Flight time” may help a player or coach better understand the effort the athlete is putting out, compare efforts of two or more players, gauge the athlete's performance change over time, and/or identify conditioning needs and/or areas for improvement. Such systems and methods also may generate and display various athletic performance metrics, such as: instantaneous flight time; average flight time; cumulative flight time during an athletic performance or other time period; instantaneous jump height; average jump height; cumulative jump height during an athletic performance or other time period; and comparisons of any flight time and/or jump height metric(s) of one player against another player and/or against himself/herself; etc. | 09-24-2015 |
20150362519 | Flight Time - Systems and methods for monitoring athletic performances include determining “flight time,” e.g., the amount of time both feet are off the ground, and optionally “flight time” resulting from different types of activities, such as jogging, running, sprinting, jumping, etc. “Flight time” may help a player or coach better understand the effort the athlete is putting out, compare efforts of two or more players, gauge the athlete's performance change over time, and/or identify conditioning needs and/or areas for improvement. Such systems and methods also may generate and display various athletic performance metrics, such as: instantaneous flight time; average flight time; cumulative flight time during an athletic performance or other time period; instantaneous jump height; average jump height; cumulative jump height during an athletic performance or other time period; and comparisons of any flight time and/or jump height metric(s) of one player against another player and/or against himself/herself; etc. | 12-17-2015 |
Patent application number | Description | Published |
20120257820 | IMAGE ANALYSIS TOOLS - A master image can be generated based upon evaluation of virtual machine images. The master image includes single instances of data segments that are shared across virtual machine images within a virtual machine environment. The master image can be further be constructed as a function of a peer pressure technique that includes data segments common to a majority of the virtual machine images within the master image. The data segments included within the master image can further be defined by prioritizing data within virtual machine images as well as identifying influential data with a peer pressure technique. | 10-11-2012 |
20120323853 | VIRTUAL MACHINE SNAPSHOTTING AND ANALYSIS - Described are techniques for capturing and analyzing snapshots of virtual machines. One or more computers may automatically obtain snapshots of virtual machines as they are executing to form a pool of virtual machine snapshots. The virtual machine snapshots are then read to obtain a set of features properties of the virtual machine snapshots, including information about a running guest operating system, software installed on the virtual machine, metadata about the virtual machine itself, and others. The features or properties are analyzed, in one embodiment using a machine learning algorithm, to automatically compute and store information about the virtual machines. | 12-20-2012 |
20140270407 | ASSOCIATING METADATA WITH IMAGES IN A PERSONAL IMAGE COLLECTION - Various technologies pertaining to assigning metadata to images in a personal image collection of a user based upon images and associated metadata assigned thereto that are accessible to the user by way of a social network application are described. An account of the user in a social network application is accessed to retrieve images and metadata that is accessible to the user. A face recognition algorithm is trained based upon the retrieved images and metadata, and the trained face recognition algorithm is executed over the personal image collection of the user, where the personal image collection of the user is external to the social network application. | 09-18-2014 |
Patent application number | Description | Published |
20080213996 | Designs and methods for conductive bumps - Methods, techniques, and structures relating to die packaging. In one exemplary implementation, a die package interconnect structure includes a semiconductor substrate and a first conducting layer in contact with the semiconductor substrate. The first conducting layer may include a base layer metal. The base layer metal may include Cu. The exemplary implementation may also include a diffusion barrier in contact with the first conducting layer and a wetting layer on top of the diffusion barrier. A bump layer may reside on top of the wetting layer, in which the bump layer may include Sn, and Sn may be electroplated. The diffusion barrier may be electroless and may be adapted to prevent Cu and Sn from diffusing through the diffusion barrier. Furthermore, the diffusion barrier may be further adapted to suppress a whisker-type formation in the bump layer. | 09-04-2008 |
20090166881 | AIR-GAP ILD WITH UNLANDED VIAS - A spacer is adjacent to a conductive line. Vias that do not completely land on the conductive line land on the spacer and do not punch through into a volume below the spacer. | 07-02-2009 |
20090169760 | COPPER METALLIZATION UTILIZING REFLOW ON NOBLE METAL LINERS - Methods for making copper (Cu) interconnects in semiconductor devices for interconnect dimensions less than 50 nm are described. The processes form Cu interconnects using a sequence of barrier layer, liner layer, and Cu deposition layer depositions, followed by a thermally assisted Cu reflow of the Cu deposition layer, and then a chemical mechanical polish (CMP) to removed excess portions of the reflowed Cu. The liner layer comprises noble metals such as Ru, Ir, Os, Rh, Re, Pd, Pt, and Au. Such processes avoids the formation of voids in copper interconnects with dimensions less than 50 nm. | 07-02-2009 |
20090321935 | Methods of forming improved electromigration resistant copper films and structures formed thereby - Methods and associated structures of forming a microelectronic structure are described. Those methods may comprise forming a doping material on an overburden region of a conductive structure, diffusing a portion of the doping material into a portion of the conductive structure, and then removing the overburden region. | 12-31-2009 |
20100200991 | Dopant Enhanced Interconnect - Techniques are disclosed that enable an interconnect structure that is resistance to electromigration. A liner is deployed underneath a seed layer of the structure. The liner can be a thin continuous and conformal layer, and may also limit oxidation of an underlying barrier (or other underlying surface). A dopant that is compatible (non-alloying, non-reactive) with the liner is provided to alloy the seed layer, and allows for dopant segregation at the interface at the top of the seed layer. Thus, electromigration performance is improved. | 08-12-2010 |
20110084387 | DESIGNS AND METHODS FOR CONDUCTIVE BUMPS - Methods, techniques, and structures relating to die packaging. In one exemplary implementation, a die package interconnect structure includes a semiconductor substrate and a first conducting layer in contact with the semiconductor substrate. The first conducting layer may include a base layer metal. The base layer metal may include Cu. The exemplary implementation may also include a diffusion barrier in contact with the first conducting layer and a wetting layer on top of the diffusion barrier. A bump layer may reside on top of the wetting layer, in which the bump layer may include Sn, and Sn may be electroplated. The diffusion barrier may be electroless and may be adapted to prevent Cu and Sn from diffusing through the diffusion barrier. Furthermore, the diffusion barrier may be further adapted to suppress a whisker-type formation in the bump layer. | 04-14-2011 |
20110247872 | DEBOND INTERCONNECT STRUCTURES - The present subject matter relates to the field of fabricating microelectronic devices. In at least one embodiment, the present subject matter relates to forming an interconnect that has a portion thereof which becomes debonded from the microelectronic device during cooling after attachment to an external device. The debonded portion allows the interconnect to flex and absorb stress. | 10-13-2011 |
20130260553 | SELF-FORMING, SELF-ALIGNED BARRIERS FOR BACK-END INTERCONNECTS AND METHODS OF MAKING SAME - Processes of forming an insulated wire into an interlayer dielectric layer (ILD) of a back-end metallization includes thermally treating a metallic barrier precursor under conditions to cause at least one alloying element in the barrier precursor to form a dielectric barrier between the wire and the ILD. The dielectric barrier is therefore a self-forming, self-aligned barrier. Thermal processing is done under conditions to cause the at least one alloying element to migrate from a zone of higher concentration thereof to a zone of lower concentration thereof to further form the dielectric barrier. Various apparatus are made by the process. | 10-03-2013 |
20140106560 | DEBOND INTERCONNECT STRUCTURES - The present subject matter relates to the field of fabricating microelectronic devices. In at least one embodiment, the present subject matter relates to forming an interconnect that has a portion thereof which becomes debonded from the microelectronic device during cooling after attachment to an external device. The debonded portion allows the interconnect to flex and absorb stress. | 04-17-2014 |
Patent application number | Description | Published |
20120077053 | BARRIER LAYERS - Methods for fabricating integrated circuit electrical interconnects and electrical interconnects are provided. Methods include providing a substrate having a surface, the surface having a feature formed therein wherein the feature is a trench or via, depositing a metal layer, the metal of the metal layer being selected from the group consisting of Ru, Co, Pt, Ir, Pd, Re, and Rh, onto surfaces of the feature, depositing a copper seed layer wherein the copper seed layer comprises a dopant and the dopant is selected from the group consisting of Mn, Mg, MgB | 03-29-2012 |
20120248608 | SELF-FORMING, SELF-ALIGNED BARRIERS FOR BACK-END INTERCONNECTS AND METHODS OF MAKING SAME - Processes of forming an insulated wire into an interlayer dielectric layer (ILD) of a back-end metallization includes thermally treating a metallic barrier precursor under conditions to cause at least one alloying element in the barrier precursor to form a dielectric barrier between the wire and the ILD. The dielectric barrier is therefore a self-forming, self-aligned barrier. Thermal processing is done under conditions to cause the at least one alloying element to migrate from a zone of higher concentration thereof to a zone of lower concentration thereof to further form the dielectric barrier. Various apparatus are made by the process. | 10-04-2012 |
Patent application number | Description | Published |
20110099012 | SYSTEM AND METHOD FOR ESTIMATING THE RELIABILITY OF ALTERNATE SPEECH RECOGNITION HYPOTHESES IN REAL TIME - Disclosed herein are systems, methods, and computer-readable storage media for estimating reliability of alternate speech recognition hypotheses. A system configured to practice the method receives an N-best list of speech recognition hypotheses and features describing the N-best list, determines a first probability of correctness for each hypothesis in the N-best list based on the received features, determines a second probability that the N-best list does not contain a correct hypothesis, and uses the first probability and the second probability in a spoken dialog. The features can describe properties of at least one of a lattice, a word confusion network, and a garbage model. In one aspect, the N-best lists are not reordered according to reranking scores. The determination of the first probability of correctness can include a first stage of training a probabilistic model and a second stage of distributing mass over items in a tail of the N-best list. | 04-28-2011 |
20110131048 | SYSTEM AND METHOD FOR AUTOMATICALLY GENERATING A DIALOG MANAGER - Disclosed herein are systems, methods, and computer-readable storage media for automatically generating a dialog manager for use in a spoken dialog system. A system practicing the method receives a set of user interactions having features, identifies an initial policy, evaluates all of the features in a linear evaluation step of the algorithm to identify a set of most important features, performs a cubic policy improvement step on the identified set of most important features, repeats the previous two steps one or more times, and generates a dialog manager for use in a spoken dialog system based on the resulting policy and/or set of most important features. Evaluating all of the features can include estimating a weight for each feature which indicates how much each feature contributes to at least one of the identified policies. The system can ignore features not in the set of most important features. | 06-02-2011 |
20130238333 | System and Method for Automatically Generating a Dialog Manager - Disclosed herein are systems, methods, and computer-readable storage media for automatically generating a dialog manager for use in a spoken dialog system. A system practicing the method receives a set of user interactions having features, identifies an initial policy, evaluates all of the features in a linear evaluation step of the algorithm to identify a set of most important features, performs a cubic policy improvement step on the identified set of most important features, repeats the previous two steps one or more times, and generates a dialog manager for use in a spoken dialog system based on the resulting policy and/or set of most important features. Evaluating all of the features can include estimating a weight for each feature which indicates how much each feature contributes to at least one of the identified policies. The system can ignore features not in the set of most important features. | 09-12-2013 |
Patent application number | Description | Published |
20120143802 | Adaptive Pairwise Preferences in Recommenders - Methods, systems, and products adapt recommender systems with pairwise feedback. A pairwise question is posed to a user. A response is received that selects a preference for a pair of items in the pairwise question. A latent factor model is adapted to incorporate the response, and an item is recommended to the user based on the response. | 06-07-2012 |
20120150532 | SYSTEM AND METHOD FOR FEATURE-RICH CONTINUOUS SPACE LANGUAGE MODELS - Disclosed herein are systems, methods, and non-transitory computer-readable storage media for predicting probabilities of words for a language model. An exemplary system configured to practice the method receives a sequence of words and external data associated with the sequence of words and maps the sequence of words to an X-dimensional vector, corresponding to a vocabulary size. Then the system processes each X-dimensional vector, based on the external data, to generate respective Y-dimensional vectors, wherein each Y-dimensional vector represents a dense continuous space, and outputs at least one next word predicted to follow the sequence of words based on the respective Y-dimensional vectors. The X-dimensional vector, which is a binary sparse representation, can be higher dimensional than the Y-dimensional vector, which is a dense continuous space. The external data can include part-of-speech tags, topic information, word similarity, word relationships, a particular topic, and succeeding parts of speech in a given history. | 06-14-2012 |
20140040176 | Adaptive Pairwise Preferences in Recommenders - Methods, systems, and products adapt recommender systems with pairwise feedback. A pairwise question is posed to a user. A response is received that selects a preference for a pair of items in the pairwise question. A latent factor model is adapted to incorporate the response, and an item is recommended to the user based on the response. | 02-06-2014 |
20140098141 | Method and Apparatus for Securing Input of Information via Software Keyboards - Data entry using a software keyboard such as a touchscreen keyboard is secured by varying key sizes in the keyboard from key to key and from software keyboard configuration to software keyboard configuration, decoupling display locations from keys. Multiple software keyboard configurations are generated, each having different sets of key sizes. The keyboard configuration may be changed with each keystroke, or may be changed for each prompted entry including multiple keystrokes. | 04-10-2014 |
20140109123 | METHOD AND APPARATUS FOR MANAGING ADVERTISING - A system that incorporates teachings of the subject disclosure may include, for example, determining identified impressions that are detected from consumption data collected from a group of media processors where the identified impressions represent viewing of selected content and where the consumption data indicates channel tuning events at the group of media processors including changing of channels, applying a ridge regression analysis to the identified impressions to determine a predicted number of target impressions per advertisement slot, and generating a media plan based on a ratio of an advertisement slot cost to the predicted number of target impressions per advertisement slot. Other embodiments are disclosed. | 04-17-2014 |
20150163235 | METHODS AND APPARATUS TO IDENTIFY AN INTERNET PROTOCOL ADDRESS BLACKLIST BOUNDARY - Methods, apparatus, systems and articles of manufacture are disclosed to identify an Internet protocol address blacklist boundary. An example method includes identifying a netblock associated with a malicious Internet protocol address, the netblock having a lower boundary and an upper boundary, collecting netflow data associated with a plurality of Internet protocol addresses in the netblock, establishing a first window associated with a lower portion of Internet protocol addresses numerically lower than a candidate Internet protocol address, establishing a second window associated with an upper portion of Internet protocol addresses numerically higher than a candidate Internet protocol address, calculating a breakpoint score based on a comparison between a behavioral profile of the first window and a behavioral profile of the second window, and identifying a first sub-netblock when the breakpoint score exceeds a threshold value. | 06-11-2015 |
20150312269 | METHODS AND APPARATUS TO IDENTIFY AN INTERNET PROTOCOL ADDRESS BLACKLIST BOUNDARY - Methods, apparatus, systems and articles of manufacture are disclosed to identify candidate boundaries of Internet protocol addresses associated with a malicious Internet protocol address. An example method includes collecting, with a processor, netflow data associated with the Internet protocol addresses within a netblock having a lower boundary Internet protocol address and an upper boundary Internet protocol address, generating, with the processor, a first window of Internet protocol addresses numerically lower than the malicious Internet protocol address, generating, with the processor, a second window of Internet protocol addresses numerically higher than the malicious Internet protocol address, for respective Internet protocol addresses in the first and second windows, calculating, with the processor, occurrence counts associated with behavior features, and identifying candidate boundaries within the netblock based on divergence values caused by the behavior features. | 10-29-2015 |
20150326905 | METHOD AND APPARATUS FOR MANAGING ADVERTISING - A system that incorporates teachings of the subject disclosure may include, for example, determining identified impressions that are detected from consumption data collected from a group of media processors where the identified impressions represent viewing of selected content and where the consumption data indicates channel tuning events at the group of media processors including changing of channels, applying a ridge regression analysis to the identified impressions to determine a predicted number of target impressions per advertisement slot, and generating a media plan based on a ratio of an advertisement slot cost to the predicted number of target impressions per advertisement slot. Other embodiments are disclosed. | 11-12-2015 |
Patent application number | Description | Published |
20110320605 | Provisioning Multiple Network Resources - A resource provisioning service allows users to provision multiple, different network resources in an atomic manner and with a single call to a resource provisioning service. In some instances, the multiple, different network resources comprise individual types of resources that form a portion of one or more cloud-computing platforms. For instance, one or more entities may host and operate a cloud-computing platform that includes different types of network resources, such a storage service, a load balancing service, a compute service, a security service, or any other similar or different type of network-accessible service. | 12-29-2011 |
20140365668 | USING A TEMPLATE TO UPDATE A STACK OF RESOURCES - Techniques are described that enable a user to upgrade a stack of resources by providing a template that reflects the desired end state of the stack. Upon receiving a new template, the system automatically detects changes that should be performed and determines the order in which the changes should be performed. The system can also detect if the desired changes to the stack are a result of direct modifications; because parameters to the resources have changed; or the changes are indirectly caused by other dependency/attribute changing. Additionally, the system determines whether the changes require creating new resources or if the changes can be made to the resources live. In case of replacement of resources, the system will first create the new resource, move that new resource into the stack and remove the old resource(s). In case of failures, the system ensures that the stack rolls back to the initial state. | 12-11-2014 |
20150150081 | TEMPLATE REPRESENTATION OF SECURITY RESOURCES - Systems and methods are described for enabling users to model security resources and user access keys as resources in a template language. The template can be used to create and update a stack of resources that will provide a network-accessible service. The security resources and access keys can be referred to in the template during both stack creation process and the stack update process. The security resources can include users, groups and policies. Additionally, users can refer to access keys in the template as dynamic parameters without any need to refer to the access keys in plaintext. The system securely stores access keys within the system and allows for templates to refer to them once defined. These key references can then be passed within a template to resources that need them as well as passing them on securely to resources like server instances through the use of the user-data field. | 05-28-2015 |
20160072920 | PROVISIONING MULTIPLE NETWORK RESOURCES - A resource provisioning service allows users to provision multiple, different network resources in an atomic manner and with a single call to a resource provisioning service. In some instances, the multiple, different network resources comprise individual types of resources that form a portion of one or more cloud-computing platforms. For instance, one or more entities may host and operate a cloud-computing platform that includes different types of network resources, such a storage service, a load balancing service, a compute service, a security service, or any other similar or different type of network-accessible service. | 03-10-2016 |