Turner, NC
Al Turner, Elizabeth City, NC US
Patent application number | Description | Published |
---|---|---|
20120279667 | TIRE RUN-FLAT REMOVAL AND INSTALLATION MACHINE - The tire run-flat ring removal and installation machine includes three basic embodiments, each having a tire support table ( | 11-08-2012 |
Andrew John Turner, Durham, NC US
Patent application number | Description | Published |
---|---|---|
20110086768 | TRANSFERRIN FUSION PROTEIN LIBRARIES - Fusion proteins comprising a transferrin moiety and integrin binding domain and peptide libraries thereof are disclosed. The present invention includes a method of screening transferrin and integrin peptide libraries displayed in fusion proteins expressed by host cells. The fusion proteins of the present invention include transferrin fusion proteins capable of expression in yeast. | 04-14-2011 |
Bryan Turner, Cary, NC US
Patent application number | Description | Published |
---|---|---|
20080215734 | Gracefully Changing a Node in a Distributed Computing Network - In one embodiment, a method includes determining to change a number of objects controlled by a particular node in a network. Each object is a resource provided by the network and has a unique object position in a coordinate space of N dimensions. Each node has a unique node position in the coordinate space of N dimensions. Each node controls operation of objects in a control set of zero or more objects which are closest to the node using an agreed definition of scalar distance between two positions. A different N+1 dimension from the N dimensions is added. The N+1 dimension has a zero value for the plurality of objects. A particular value is determined for the N+1 dimension for the particular node such that a change in a number of objects in a particular control set of the particular node is not greater than a threshold change. | 09-04-2008 |
20080239997 | Distributed Real-time Data Mixing for Conferencing - In one embodiment, a method includes receiving data that indicates a maximum number of end nodes with which to set up real-time data sessions that is less than a conference number of nodes whose data is mixed in a single real-time data conference. Real-time data sessions are established with a connected set of a connected number of nodes not greater than the maximum number. A mix of the real-time data received from the connected set is presented to a user of the first node. Local real-time data is received from a user. The received real-time data is distributed by mixing and sending. This includes, for each individual node in the connected set, mixing received local real-time data with real-time data received from other nodes in the connected set different from the individual node to form individual mixed real-time data, and sending the individual mixed real-time data to the individual node. | 10-02-2008 |
20100228841 | GRACEFULLY CHANGING A NODE IN A DISTRIBUTED COMPUTING NETWORK - In one embodiment, a method includes determining to change a number of objects controlled by a particular node in a network. Each object is a resource provided by the network and has a unique object position in a coordinate space of N dimensions. Each node has a unique node position in the coordinate space of N dimensions. Each node controls operation of objects in a control set of zero or more objects which are closest to the node using an agreed definition of scalar distance between two positions. A different N+1 dimension from the N dimensions is added. The N+1 dimension has a zero value for the plurality of objects. A particular value is determined for the N+1 dimension for the particular node such that a change in a number of objects in a particular control set of the particular node is not greater than a threshold change. | 09-09-2010 |
Bryan Turner, Durham, NC US
Patent application number | Description | Published |
---|---|---|
20120159459 | OPTIMIZING SYMBOL MANIPULATION LANGUAGE-BASED EXECUTABLE APPLICATIONS FOR DISTRIBUTED EXECUTION - In one embodiment, a method comprises receiving an application that describes functions according to a prescribed symbol manipulation language, the prescribed symbol manipulation language a non-Turing complete language that does not permit partial functions and describes the functions independent of any attribute of any computing system; identifying, in the application, a distribution annotation that identifies a candidate element in the application, the candidate element configured for execution in a distributed computing operation by a distributed computing system comprising two or more distributed computing devices; generating one or more variants of the application based on executing a nondestructive transformation of the application relative to prescribed equality axioms, at least one of the variants containing a corresponding semantically-equivalent variation of the candidate element; and selecting one of the variants as an optimization for execution of the application by the distributed computing system relative to prescribed metrics. | 06-21-2012 |
20120265750 | AD HOC GEOSPATIAL DIRECTORY OF USERS IN A DISTRIBUTED AND DECENTRALIZED SYSTEM BASED ON OPTIMIZING SYMBOL MANIPULATION LANGUAGE-BASED EXECUTABLE APPLICATION - In one embodiment, a method comprises receiving from a user interface, by a computing device, a request for execution of at least one lambda function in an operation of a geospatial application, the geospatial application having lambda functions for operating on one or more entities of an ad hoc geospatial directory accessible by the computing device, the lambda functions having strongly typed definitions according to a prescribed symbol manipulation language that is a non-Turing complete language, that does not permit partial functions, and that is independent of any attribute of any computing system; optimizing execution by the computing device of the operation on the ad hoc geospatial directory; and the computing device returning to the user interface a response to the request based on the optimizing execution of the operation, the response including a data structure including at least one of the lambda functions for a corresponding at least one of generating a query of the ad hoc geospatial directory, modifying a state of at least a first of the entities, or accessing the first of the entities. | 10-18-2012 |
20120331472 | AD HOC GENERATION OF WORK ITEM ENTITY FOR GEOSPATIAL ENTITY BASED ON SYMBOL MANIPULATION LANGUAGE-BASED WORKFLOW ITEM - In one embodiment, a method comprises receiving from a user interface, by a computing device, a request for execution of at least one lambda function in an operation of a geospatial application, the geospatial application having lambda functions for operating on at least one of a workflow item or one or more entities of an ad hoc geospatial directory, the workflow item including at least one of the lambda functions for a workflow in the geospatial application; and executing by the computing device the at least one lambda function to form, in the geospatial application, a work entity that associates the workflow item with one of the entities, the work entity defining execution of the workflow on the one entity. | 12-27-2012 |
20130198729 | AUTOMATED IMPROVEMENT OF EXECUTABLE APPLICATIONS BASED ON EVALUATING INDEPENDENT EXECUTION HEURISTICS - In one embodiment, a method comprises generating a first executable program optimized for an executable system based on compiling a program relative to an initial set of independent optimization metrics; determining first performance metrics based on the executable system executing the first executable program; adjusting the initial set of independent optimization metrics based on the first performance metrics to generate a second set of independent optimization metrics; and generating a second executable program, based on compiling the program relative to the second set of independent optimization metrics, for improved execution of the program in the executable system. | 08-01-2013 |
Bryan C. Turner, Apex, NC US
Patent application number | Description | Published |
---|---|---|
20090287825 | DISTRIBUTED CLIENT SERVICES BASED ON EXECUTION OF SERVICE ATTRIBUTES AND DATA ATTRIBUTES BY MULTIPLE NODES IN RESOURCE GROUPS - A network provides distributed client services based on participation in respective resource groups by computing nodes, each resource group including a corresponding resource requirement for any computing node that joins the corresponding resource group for execution of the corresponding distributed client service. Each computing node, in response to determining its corresponding available node capacity, is configured for selectively creating and joining at least one new resource group for execution of a corresponding distributed client service having a corresponding resource requirement, and/or selectively joining at least one of the available resource groups, based on the corresponding available node capacity satisfying the corresponding resource requirement. Each distributed client service also includes service attributes that define parameters for execution of the distributed client service, and data attributes that define the attributes required for data to be used in the distributed client service. | 11-19-2009 |
20100250668 | ARRANGEMENT FOR SELECTING A SERVER TO PROVIDE DISTRIBUTED SERVICES FROM AMONG MULTIPLE SERVERS BASED ON A LOCATION OF A CLIENT DEVICE - A selection resource executed within the network is configured for selecting from among a plurality of servers, distributed throughout the network at respective network-based server locations and each configured for providing a specified service, a selected server for providing the specified service for a client device at a network-based client location. The selection resource selects the selected server based on the corresponding server location relative to the client location, and causes a request having been generated by the client device to be sent to the selected server. Hence, the selection resource optimizes client-server interactions in a distributed computing network, based on the client location and the server location. | 09-30-2010 |
20110016351 | ARRANGEMENT FOR RECOVERY OF DATA BY NETWORK NODES BASED ON RETRIEVAL OF ENCODED DATA DISTRIBUTED AMONG THE NETWORK NODES - Distributed data, having been stored in a distributed storage system as a collection of distributed data elements, is recovered based on connection of multiple user nodes, each user node having stored selected distributed data elements as a corresponding portion of the distributed data during replication of the distributed data elements throughout the distributed storage system. Each distributed data element is identifiable by a corresponding unique object identifier (OID). Each user node includes a discovery resource for discovering reachable user nodes, a local cache configured for identifying at least the corresponding portion of the distributed data based on the respective OIDs, and an identification service module configured for resolving a data object to a corresponding OID, via the corresponding local cache, or based on sending a query to the reachable user nodes. Hence, user nodes can recover distributed data based on exchanging resolution information and OID information. | 01-20-2011 |
20110252078 | DISTRIBUTED CLIENT SERVICES BASED ON EXECUTION OF SERVICE ATTRIBUTES AND DATA ATTRIBUTES BY MULTIPLE NODES IN RESOURCE GROUPS - A network provides distributed client services based on participation in respective resource groups by computing nodes, each resource group including a corresponding resource requirement for any computing node that joins the corresponding resource group for execution of the corresponding distributed client service. Each computing node, in response to determining its corresponding available node capacity, is configured for selectively creating and joining at least one new resource group for execution of a corresponding distributed client service having a corresponding resource requirement, and/or selectively joining at least one of the available resource groups, based on the corresponding available node capacity satisfying the corresponding resource requirement. Each distributed client service also includes service attributes that define parameters for execution of the distributed client service, and data attributes that define the attributes required for data to be used in the distributed client service. | 10-13-2011 |
20110314160 | DISTRIBUTED COMPUTING BASED ON MULTIPLE NODES WITH DETERMINED CAPACITY SELECTIVELY JOINING RESOURCE GROUPS HAVING RESOURCE REQUIREMENTS - A network provides distributed computing services based on participation in respective resource groups by computing nodes, each resource group including a corresponding resource requirement for any computing node that joins the corresponding resource group for execution of the corresponding distributed computing service. Each computing node, in response to determining its corresponding available node capacity, is configured for selectively creating and joining at least one new resource group for execution of a corresponding distributed computing service having a corresponding resource requirement, and/or selectively joining at least one of the available resource groups, based on the corresponding available node capacity satisfying the corresponding resource requirement. Each computing node also is configured for selectively leaving any one of the joined resource groups based on determined conditions. Hence, each computing node may choose to participate in as many resource groups as needed for respective computing services, based on the corresponding available node capacity. | 12-22-2011 |
20120096312 | ARRANGEMENT FOR RECOVERY OF DATA BY NETWORK NODES BASED ON RETRIEVAL OF ENCODED DATA DISTRIBUTED AMONG THE NETWORK NODES - Distributed data, having been stored in a distributed storage system as a collection of distributed data elements, is recovered based on connection of multiple user nodes, each user node having stored selected distributed data elements as a corresponding portion of the distributed data during replication of the distributed data elements throughout the distributed storage system. Each distributed data element is identifiable by a corresponding unique object identifier (OID). Each user node includes a discovery resource for discovering reachable user nodes, a local cache configured for identifying at least the corresponding portion of the distributed data based on the respective OIDs, and an identification service module configured for resolving a data object to a corresponding OID, via the corresponding local cache, or based on sending a query to the reachable user nodes. Hence, user nodes can recover distributed data based on exchanging resolution information and OID information. | 04-19-2012 |
20120265782 | ARRANGEMENT FOR A DISTRIBUTED FILE SYSTEM HAVING DATA OBJECTS MAPPED INDEPENDENT OF ANY DATA OBJECT ATTRIBUTE - Each data file of a distributed file system is identified by a corresponding globally-unique object identifier that is independent of any attribute of the data file. A node in the distributed file system has a file system that includes a plurality of directory entries, where each directory entry has a file name field, an attributes field, and an object identifier field configured for specifying a globally-unique object identifier. The globally-unique object identifier is universally reachable by any node of the distributed file system and uniquely identifies the data file, enabling the data file to be universally identifiable by any node based on the corresponding object identifier. The data file can be stored independently of a device file system based on providing a resolution between the data file name and its object identifier, followed by a resolution between the object identifier and a selected location for the data file. | 10-18-2012 |
20120271944 | DISTRIBUTED COMPUTING BASED ON MULTIPLE NODES WITH DETERMINED CAPACITY SELECTIVELY JOINING RESOURCE GROUPS HAVING RESOURCE REQUIREMENTS - A network provides distributed computing services based on participation in respective resource groups by computing nodes, each resource group including a corresponding resource requirement for any computing node that joins the corresponding resource group for execution of the corresponding distributed computing service. Each computing node, in response to determining its corresponding available node capacity, is configured for selectively creating and joining at least one new resource group for execution of a corresponding distributed computing service having a corresponding resource requirement, and/or selectively joining at least one of the available resource groups, based on the corresponding available node capacity satisfying the corresponding resource requirement. Each computing node also is configured for selectively leaving any one of the joined resource groups based on determined conditions. Hence, each computing node may choose to participate in as many resource groups as needed for respective computing services, based on the corresponding available node capacity. | 10-25-2012 |
20120323964 | ARRANGEMENT FOR A DISTRIBUTED FILE SYSTEM HAVING DATA OBJECTS MAPPED INDEPENDENT OF ANY DATA OBJECT ATTRIBUTE - Each data file of a distributed file system is identified by a corresponding globally-unique object identifier that is independent of any attribute of the data file. A node in the distributed file system has a file system that includes a plurality of directory entries, where each directory entry has a file name field, an attributes field, and an object identifier field configured for specifying a globally-unique object identifier. The globally-unique object identifier is universally reachable by any node of the distributed file system and uniquely identifies the data file, enabling the data file to be universally identifiable by any node based on the corresponding object identifier. The data file can be stored independently of a device file system based on providing a resolution between the data file name and its object identifier, followed by a resolution between the object identifier and a selected location for the data file. | 12-20-2012 |
20130290264 | ARRANGEMENT FOR A DISTRIBUTED FILE SYSTEM HAVING DATA OBJECTS MAPPED INDEPENDENT OF ANY DATA OBJECT ATTRIBUTE - Each data file of a distributed file system is identified by a corresponding globally-unique object identifier that is independent of any attribute of the data file. A node in the distributed file system has a file system that includes a plurality of directory entries, where each directory entry has a file name field, an attributes field, and an object identifier field configured for specifying a globally-unique object identifier. The globally-unique object identifier is universally reachable by any node of the distributed file system and uniquely identifies the data file, enabling the data file to be universally identifiable by any node based on the corresponding object identifier. The data file can be stored independently of a device file system based on providing a resolution between the data file name and its object identifier, followed by a resolution between the object identifier and a selected location for the data file. | 10-31-2013 |
Bryan C. Turner, Cary, NC US
Patent application number | Description | Published |
---|---|---|
20080320104 | Streaming network coding - In one embodiment, a method comprises supplying, by a network node to a peer network node, a randomization seed assigned to the network node for generating a prescribed sequence of pseudorandom numbers according to a prescribed pseudorandom number generation function; encoding each data block having a corresponding position in an ordered sequence of a stream of data blocks, by the network node into a corresponding differentially-encoded data block based on applying a product of the corresponding data block and the corresponding pseudorandom number, having the corresponding position in the prescribed sequence, to a corresponding successively-preceding differentially-encoded data block from the prescribed ordered sequence, the data block recoverable solely based on a determined difference between the corresponding differentially-encoded data block and the corresponding successively-preceding differentially-encoded data block relative to the corresponding pseudorandom number; and outputting each differentially-encoded data block in a corresponding packet that identifies the network node and the corresponding position. | 12-25-2008 |
20130067030 | STREAMING NETWORK CODING - In one embodiment, a method comprises supplying, by a network node to a peer network node, a randomization seed assigned to the network node for generating a prescribed sequence of pseudorandom numbers according to a prescribed pseudorandom number generation function; encoding each data block having a corresponding position in an ordered sequence of a stream of data blocks, into a corresponding differentially-encoded data block based on applying a product of the corresponding data block and the corresponding pseudorandom number, having the corresponding position in the prescribed sequence, to a corresponding successively-preceding differentially-encoded data block from the prescribed ordered sequence, the data block recoverable solely based on a determined difference between the corresponding differentially-encoded data block and the corresponding successively-preceding differentially-encoded data block relative to the corresponding pseudorandom number; and outputting each differentially-encoded data block in a corresponding packet that identifies the network node and the corresponding position. | 03-14-2013 |
Craig W. Turner, Raleigh, NC US
Patent application number | Description | Published |
---|---|---|
20090103967 | PEN RETENTION APPARATUS - A pen retention bracket for releasably securing a pen tether retracting reel therein is disclosed. The pen retention bracket includes four surfaces that define a rectangular cavity having four sides and a top opening and a bottom opening. A first protrusion and a second protrusion are disposed upon a first surface and extend from the first surface toward a second surface, a distance between the first protrusion and the second protrusion greater than a height of the pen tether retracting reel. The first surface is responsive to an application of force to the pen tether retracting reel to elastically deform and increase a depth between the second surface and at least one of the first protrusion and the second protrusion, thereby releasing the pen tether retracting reel via either of the top opening and the bottom opening. | 04-23-2009 |
David Turner, Mt. Olive, NC US
Patent application number | Description | Published |
---|---|---|
20140352194 | WILDLIFE CAPTURING DEVICE - A fish capturing device is provided. The device includes a pair of cage members having a first position in which an opening is defined therebetween through which a fish may be passed and a second position in which each of the cage members are pivoted until the cage members are nested together to form an enclosure for enclosing a fish therein. A latch is configured for latching the pair of cage members into the first position and releasing the pair of cage members into the second position. A tensioner applies tension to the pair of cage members to bias the cage members into the second position to enclose the fish within the pair of cages. | 12-04-2014 |
David Turner, Asheville, NC US
Patent application number | Description | Published |
---|---|---|
20150208748 | CONVENIENT-TO-CARRY HELMET STAND - There is provided a convenient-to-carry helmet stand. The portable helmet stand includes a first body portion, a second body portion, and a receipt surface on which a crown portion of a helmet can be placed in an operating mode of the portable helmet stand. The first body portion and the second body portion are operationally connected to one another such that the first body portion and the second body portion can be disposed, in an operating mode of the portable helmet stand, to delimit an operating mode width between themselves. | 07-30-2015 |
Donna Dee Turner, Huntersville, NC US
Patent application number | Description | Published |
---|---|---|
20110131122 | BEHAVIORAL BASELINE SCORING AND RISK SCORING - Embodiments of the present invention relate to systems, apparatus, methods and computer program products for integrated risk management. More specifically, embodiments of the present invention provides for determining one or more behavioral baseline scores, each score associated with one or more behaviors and based at least in part on financial institution data from multiple financial institutions. The behavioral baseline score defines a normal risk or baseline behavior for a customer, a customer segment or customer population. Further, the invention provides for monitoring at least the financial institution data to determine deviations from the behavioral baseline score(s) and generating and initiating communication of risk score alerts and/or behavioral baseline deviation alerts based on predetermined behavioral baseline deviations. Additional embodiments provide for determining a risk score based on risk patterns associated with financial institution data and, in some embodiments, non-financial institution data. | 06-02-2011 |
20110131123 | COMPREHENSIVE SUSPICIOUS ACTIVITY MONITORING AND ALERT SYSTEM - Embodiments of the present invention relate to systems, apparatus, methods and computer program products for integrated risk management. More specifically, embodiments of the present invention provide for monitoring financial institution data from a plurality of financial institutions, including transactional data associated with multiple products and channels, to identify suspicious activity potentially associated with identity theft incidents and, in specific embodiments, communicate suspicious activity and/or identity theft alerts and/or reports in response to identifying the suspicious activities and/or confirming an identity theft incident associated with the suspicious activity. In further embodiments, the monitored financial institution may include one or more, and in some embodiments all of, account data, asset data, liability data, negative file data, customer data, device data, credit data, or biometric data. In addition, in certain embodiments, the monitored data may include non-financial institution data. | 06-02-2011 |
20110131130 | INTEGRATED RISK ASSESSMENT AND MANAGEMENT SYSTEM - Embodiments of the present invention relate to systems, apparatus, methods and computer program products for integrated risk assessment and management. More specifically, embodiments of the present invention provide for a risk database that collects and/or receives transaction data. In other embodiments of the present invention, the risk database collects and/or receives asset data and liability data associated with multiple financial institutions. The data is accessed to monitor customers' risk and one or more risk management actions are initiated based on the monitored customer risk. | 06-02-2011 |
20110131131 | RISK PATTERN DETERMINATION AND ASSOCIATED RISK PATTERN ALERTS - Embodiments of the present invention relate to systems, apparatus, methods and computer program products for integrated risk assessment and mitigation. More specifically, embodiments of the present invention provide for determining risk patterns and, in particular embodiments, emerging risk patterns associated with emerging risk, based on a combination of, or in some embodiments all, financial institution data from multiple financial institutions, data aggregator data, non-financial institution data, negative activity data and/or risk deviation data. As a result of the determination of risk patterns, risk pattern alerts may be communicated to designated recipients for the purpose of managing the risk. In additional embodiments, a health risk indicator is determined that indicates the current condition of risk for a customer, a company, an industry or industry segment. | 06-02-2011 |
20120109802 | VERIFYING IDENTITY THROUGH USE OF AN INTEGRATED RISK ASSESSMENT AND MANAGEMENT SYSTEM - Embodiments of the present invention relate to systems, apparatus, methods and computer program products for integrated risk management. More specifically, embodiments of the present invention provide for identity verification based, at least in part, on comparing transaction data received from multiple financial institutions to data associated with a current financial transactions, such as type of transaction, transaction amount or the like. The transaction data provides for basing identity verification on how a customer, a counterparty or both previously transacted, in that transaction patterns can be identified to understanding who the transacting customer or counterparty is. In additional embodiments the identity verification may be based, at least in part on other data, such as financial institution relationship data, non-financial institution transaction and/or relationship data, customer/counterparty data or the like. | 05-03-2012 |
20150066772 | INTEGRATED RISK ASSESSMENT AND MANAGEMENT SYSTEM - Embodiments of the present invention relate to systems, apparatus, methods and computer program products for integrated risk assessment and management. More specifically, embodiments of the present invention provide for a risk database that collects and/or receives transaction data. In other embodiments of the present invention, the risk database collects and/or receives asset data and liability data associated with multiple financial institutions. The data is accessed to monitor customers' risk and one or more risk management actions are initiated based on the monitored customer risk. | 03-05-2015 |
Elizabeth Madalena Turner, Durham, NC US
Patent application number | Description | Published |
---|---|---|
20100227880 | CHEMICAL COMPOUNDS - The present invention provides compounds of formula (I): | 09-09-2010 |
Erica L. Turner, Charlotte, NC US
Patent application number | Description | Published |
---|---|---|
20100191670 | Quantifying The Output Of Credit Research Systems - A method of quantifying the value added by an internal company credit rating system is described. The method includes determining an internal company credit rating for a plurality of securities. The internal company credit rating for the plurality of securities and an external credit research agency original credit rating for each of the securities are inputted in a ratings history database. Data representative of a change of the external credit research agency original credit rating for at least one security of the plurality of securities to a new credit rating is received. Responsive to the change, data representative of a current price of the at least one security and a benchmark price of the at least one security is received. At least one metric is calculated to determine a correlation between the internal company credit ratings and the new external credit research agency for each of the plurality of securities. | 07-29-2010 |
Frank B. Turner, Charlotte, NC US
Patent application number | Description | Published |
---|---|---|
20080288415 | Equity Protection - Systems and methods are illustrated for providing an equity protection product to a borrower of a loan. Aspects of the equity protection product may be implemented using an equity protection agreement. The equity protection product may be used to safeguard a borrower's investment in the event of a housing market downturn. In some examples, once the equity protection is purchased, the borrower's equity can only increase or remain stable (i.e., flat) regardless of market conditions. The payoff amount of the borrower's loan may be reduced to compensate for a change in the market value of the borrower's home. The equity protection product may be provided by a lending institution, bank, or any other comparable entity/person. A trading desk may also be used to hedge against the risk created by the equity protection product. In addition, an appraiser may also be used to evaluate and provide current market values of the relevant property. | 11-20-2008 |
20110178920 | EQUITY PROTECTION - Systems and methods are illustrated for providing an equity protection product to a borrower of a loan. Aspects of the equity protection product may be implemented using an equity protection agreement. The equity protection product may be used to safeguard a borrower's investment in the event of a housing market downturn. In some examples, once the equity protection is purchased, the borrower's equity can only increase or remain stable (i.e., flat) regardless of market conditions. The payoff amount of the borrower's loan may be reduced to compensate for a change in the market value of the borrower's home. The equity protection product may be provided by a lending institution, bank, or any other comparable entity/person. A trading desk may also be used to hedge against the risk created by the equity protection product. In addition, an appraiser may also be used to evaluate and provide current market values of the relevant property. | 07-21-2011 |
James Luke Turner, Raleigh, NC US
Patent application number | Description | Published |
---|---|---|
20100186091 | Methods to dynamically establish overall national security or sensitivity classification for information contained in electronic documents; to provide control for electronic document/information access and cross domain document movement; to establish virtual security perimeters within or among computer networks for electronic documents/information; to enforce physical security perimeters for electronic documents between or among networks by means of a perimeter breach alert system - The invention is an a document classification and marking engine/method that functions in a real-time compatible mode with off-the-shelf word processors, e-mail programs and presentation or other document development software applications. The software engine is used for the security classification of sensitive or national security classified information in electronic format and is enhanced by methods and processes that ensure that the software classification engine considers all document informational elements regardless of attributes assigned to the text that may hide text from the user. The software engine provides a complete and reliable document classification determination interface method based on user selections and uniquely codes the full text classification determination in a persistent manner within the electronic shell of the document in real-time and dynamically displays the text based full classification determination in the banner of the host document development application. The unique codes of the full classification embedded in the electronic shell of the document enable effective and reliable software processes and methods that establish controls for access, movement, storage etc. for electronic documents, as well as virtual electronic security perimeters, on a computer, networks of computers and/or among computer networks and domains of networks. The full or complete and persistent classification codes embedded in the document shell also enables reliable software processes and methods that immediately warn or alert security personnel of a beach of a physical security perimeter between or among computers networks or domains of networks established to protect the information contained in electronic document format. | 07-22-2010 |
20140013433 | Methods to dynamically establish overall national security for sensitivity classification... - A method to establish virtual security perimeters for classified electronic documents on a computer system. The security perimeters are based upon a full classification determination of all informational content of an electronic document file. The full classification determination is uniquely coded to identify a classification value, the classification regime used to classify the information as well as ownership of the electronic information of the electronic document, and is embedded in the electronic document. The classification determination code is matrixed with identification codes for elements of a file management system and used to control computer events initiated on a computer involving the electronic document. Computer events on computers are monitored for the coded full classification determination. The code scheme is also used to identify a breach of a security perimeter on a computer of an unauthorized classified electronic document and warning of the breach. | 01-09-2014 |
Jennifer Turner, Elizabeth City, NC US
Patent application number | Description | Published |
---|---|---|
20120279667 | TIRE RUN-FLAT REMOVAL AND INSTALLATION MACHINE - The tire run-flat ring removal and installation machine includes three basic embodiments, each having a tire support table ( | 11-08-2012 |
Larry A. Turner, Chapel Hill, NC US
Patent application number | Description | Published |
---|---|---|
20090284211 | METHOD AND APPARATUS FOR ESTIMATING INDUCTION MOTOR ELECTRICAL PARAMETERS - A method and apparatus to provide estimates of electrical parameters for line-connected induction motors during either steady-state or dynamic motor operations. The electrical parameters are calculated from the motor nameplate data and voltage and current measurements. No speed sensors or electronic injection circuits are needed. The method can be divided into 4 major steps. First, complex space vectors are synthesized from voltage and current measurements. Second, the instantaneous rotor speed is detected by calculating the rotational speed of a single rotor slot harmonic component with respect to the rotational speed of the fundamental frequency component. Third, the positive sequence fundamental frequency components are extracted from complex space vectors. Finally, least-squares estimates of the electrical parameters are determined from a dynamic induction motor equivalent circuit model. | 11-19-2009 |
20090284212 | METHODS AND APPARATUSES FOR ESTIMATING TRANSIENT SLIP - A method of determining a slip estimate associated with an induction motor through analysis of voltage and current signals. A fundamental frequency is calculated from a representation (e.g., complex representation) of the voltage signal, and a saliency frequency is calculated from a representation of the current signal. An estimation of slip quantity is calculated according to a slip estimation function that includes the saliency frequency, a saliency order, the fundamental frequency, a quantity of rotor slots, and a quantity of poles of the motor. | 11-19-2009 |
20090287437 | COMPLEX PHASE LOCKED LOOP - A method of estimating an instantaneous frequency of a component of interest in a complex primary signal via a complex Phase Locked Loop (PLL). A complex incident signal including a complex exponential evaluated at a synthesis frequency is calculated according to a complex Voltage Controlled Oscillator (VCO) function. A complex mixed signal is calculated according to a function that includes multiplying the complex primary signal by a representation of the complex incident signal. A complex baseband signal is calculated according to a function that includes filtering the complex mixed signal such that the bandwidth of the complex baseband signal is less than or equal to the bandwidth of the complex mixed signal. A residual frequency of the complex baseband signal is calculated via a complex Phase Discriminator (PD). The synthesis frequency is modified according to a function that includes the synthesis frequency and the residual frequency, such that the residual frequency is minimized. The instantaneous frequency is calculated according to a function that includes a representation of the synthesis frequency and stored. | 11-19-2009 |
20090287463 | METHODS AND APPARATUS FOR ESTIMATING ROTOR SLOTS - A method of determining a quantity of rotor slots in an induction motor through analysis of voltage and current signals. An approximate slip is calculated according to an approximate slip function that is independent of a rotor slots quantity. A fundamental frequency is calculated from a representation of the voltage signal. A saliency frequency is calculated from a representation of the current signal. For each rotor slots index in a set of rotor slots indices, a slip estimate is calculated according to a slip estimation function that includes the saliency frequency, a saliency order, the fundamental frequency, a rotor slots index in the set of rotor slots indices, and a quantity of poles of the motor, such that the slip estimate is evaluated at respective ones of the set rotor slots indices. A slip estimation error signal is calculated according to a slip estimation error function that includes a difference between the approximate slip and respective ones of the slip estimates. A rotor slots performance surface representative of an aggregate of the slip estimation error signals evaluated over the set of the rotor slots indices is calculated. A rotor slots quantity equal to the rotor slots index corresponding to a minimum of the rotor slots performance surface over at least a portion of the set of the rotor slots indices is defined. | 11-19-2009 |
20120098477 | METHODS AND DEVICES FOR ESTIMATION OF INDUCTION MOTOR INDUCTANCE PARAMETERS - Methods and devices are presented herein for estimating induction motor inductance parameters based on instantaneous reactive power. The induction motor inductance parameters, e.g., the stator inductance and the total leakage factor, can be estimated from motor nameplate data and instantaneous reactive power without involving speed sensors or electronic injection circuits. In one embodiment, the method includes: measuring voltages and currents; converting the measured voltages and currents into discrete-time voltage and current samples by analog-to-digital converters; synthesizing a complex voltage from the discrete-time voltage samples; synthesizing a complex current from the discrete-time current samples; acquiring and storing motor nameplate data; detecting instantaneous rotor speed by calculating an instantaneous rotor slot harmonic frequency with respect to an instantaneous fundamental frequency; calculating, via an induction motor inductance estimator, the motor's instantaneous reactive power and other intermediate quantities; and outputting the stator inductance and the total leakage factor. | 04-26-2012 |
20120123755 | METHODS AND APPARATUS FOR ESTIMATING ROTOR SLOTS - Methods of determining a quantity of rotor slots in an induction motor are disclosed. An approximate slip is calculated according to an approximate slip function. A fundamental frequency is calculated from a representation of the voltage signal. A saliency frequency is calculated from a representation of the current signal. For each rotor slots index in a set of rotor slots indices, a slip estimate is calculated according to a slip estimation function. A slip estimation error signal is calculated. A rotor slots performance surface representative of an aggregate of the slip estimation error signals is calculated. A rotor slots quantity equal to the rotor slots index corresponding to a minimum of the rotor slots performance surface over at least a portion of the set of the rotor slots indices is defined. | 05-17-2012 |
20120140805 | COMPLEX ADAPTIVE PHASE ESTIMATION - A Complex Adaptive Phase Estimation (PE) filter, as presented in some concepts of the present disclosure, is an adaptive filter that accurately estimates the phase difference between signals. For example, the PE filter can estimate the phase difference between a complex primary signal and a complex incident signal, iteratively adapting the phase of a complex exponential by minimizing the mean squared error of a complex error signal. The PE filter can demonstrate accurate phase estimation and rapid convergence, with low computational complexity and storage requirements. In addition, the PE filter construction can be simplified to support absolute phase estimation of a single complex signal. Efficient complex normalization approximation can be developed to support practical PE filter implementation in computationally restrictive environments, including systems with real-time response constraints, and systems without efficient native or functional support for division or square root operations. | 06-07-2012 |
20120140806 | COMPLEX ADAPTIVE PHASE DISCRIMINATOR - A Complex Adaptive Phase Discriminator (PD), as presented in some concepts of the present disclosure, is an adaptive filter that accurately estimates the instantaneous frequency of a dynamic complex signal. The PD can demonstrate accurate instantaneous frequency estimation and rapid convergence in dynamic complex signal environments, even when the frequency of its input may change rapidly. A direct PD architecture can estimate the instantaneous frequency of a complex primary signal, iteratively adapting a phase of a complex exponential by minimizing the mean squared error of a complex error signal. Instantaneous frequency can be directly estimated from the phase of the complex exponential. In contrast, an indirect PD architecture can estimate the instantaneous frequency of a complex primary signal, iteratively adapting a complex coefficient by minimizing the mean squared error of a complex error signal. Instantaneous frequency can be indirectly estimated by extracting the phase of the complex coefficient. | 06-07-2012 |
20120153935 | Systems, Methods, and Devices for Demodulating Induction Motor Instantaneous Rotor Slot Harmonic Frequency - A method and apparatus to dynamically and adaptively demodulate induction motor instantaneous rotor slot harmonic frequency for line-connected squirrel-cage polyphase induction motors. The instantaneous rotor slot harmonic frequency carries essential information on the instantaneous rotor speed. Based on a correlation between the motor's input power and its rotor slot harmonic frequency, a dynamically varying carrier frequency is computed and used in a rotor slot harmonic frequency detector. The rotor slot harmonic frequency detector is based on a superheterodyne principle. It contains a generalized linear-phase low-pass filter, whose bandwidth is estimated dynamically by a filter bandwidth estimator. The rotor slot harmonic frequency detector also includes a latency compensator, which receives the dynamically varying carrier frequency signal and synchronizes it with the output of a frequency demodulator. | 06-21-2012 |
Larry A. Turner, Raleigh, NC US
Patent application number | Description | Published |
---|---|---|
20090284204 | METHOD AND APPARATUS FOR ESTIMATING INDUCTION MOTOR ROTOR TEMPERATURE - A method and apparatus to provide continuous and reliable rotor temperature estimates for line-connected induction motors during steady-state and/or dynamic motor operations. Rotor temperature is calculated from voltage and current measurements without any temperature or speed sensors. First, complex space vectors are synthesized from voltage and current measurements. Second, the instantaneous rotor speed is detected by calculating the rotational speed of a single rotor slot harmonic component with respect to the rotational speed of the fundamental frequency component. Third, the positive sequence fundamental frequency components are extracted from complex space vectors. Fourth, the rotor time constant is estimated in a model-reference adaptive system based on a dynamic induction motor equivalent circuit model. Finally, the rotor temperature is calculated according to the linear relationship between the rotor temperature and the estimated rotor time constant. Real-time induction motor thermal protection is achieved through this continuous tracking of the rotor temperature. | 11-19-2009 |
Marsha J. Turner, Chapel Hill, NC US
Patent application number | Description | Published |
---|---|---|
20140156039 | Method and Apparatus for Performance Optimization Through Physical Perturbation of Task Elements - The invention is an apparatus and method of biofeedback training for attaining a physiological state optimally consistent with the successful performance of a task, wherein the probability of successfully completing the task is made is inversely proportional to a physiological difference value, computed as the absolute value of the difference between at least one physiological signal optimally consistent with the successful performance of the task and at least one corresponding measured physiological signal of a trainee performing the task. The probability of successfully completing the task is made inversely proportional to the physiological difference value by making one or more measurable physical attributes of the environment in which the task is performed, and upon which completion of the task depends, vary in inverse proportion to the physiological difference value. | 06-05-2014 |
Nichole Turner, Raleigh, NC US
Patent application number | Description | Published |
---|---|---|
20150089717 | Interchangeable Fashion Accessory - An interchangable fashion accessory is disclosed that may be used with different articles of clothing. In a first configuration, the fashion accessory may be worn around a user's waist to provide a different appearance for a dress. In a second configuration, the fashion accessory may be secured around a hat or other article of headwear. | 04-02-2015 |
Patrick Farrell Turner, Winston-Salem, NC US
Patent application number | Description | Published |
---|---|---|
20100191071 | Methods and Systems for Diagnosing, Treating, or Tracking Spinal Disorders - A method of patient assessment, treatment, and outcome modeling is disclosed. The method includes obtaining patient characteristic information from a current patient, defining a plurality of therapeutic factors based on the characteristic information of the current patient, and weighting the therapeutic factors. The method also includes accessing at least one database having medical records of prior patients, the medical records including prior patient characteristic information, prior patient treatment plan, and prior patient outcome, comparing the weighted factors of the current patient to the medical records of the prior patients to identify one or more relevant prior patient records, and retrieving at least a portion of the relevant prior patient records, the portion including at least the prior patient treatment plan and the prior patient outcome. The method also includes performing a simulation of at least one of the prior patient treatment plans based on the current patient's characteristic information and selecting a treatment plan for the current patient. | 07-29-2010 |
Rachael Turner, Carrboro, NC US
Patent application number | Description | Published |
---|---|---|
20110274666 | METHOD OF ENGRAFTING CELLS FROM SOLID TISSUES - A method of repairing diseased or dysfunctional organs or of establishing a model system of a disease state is provided. For repairing diseased organs, the method involves engraftment of cells from healthy tissue of the diseased or dysfunctional organ admixed with gel-forming biomaterials and nutrient medium, signaling molecules and extracellular matrix components that can be made insoluble rapidly upon transplantation to form a graft. In this way, the graft mimics the complexity of the native microenvironment with a minimum number of components that allow transplantation of cells to successfully engraft, expand and then rebuild part or the entirety of the diseased or dysfunctional organ. In the case of using grafting methods for establishing a disease model, diseased cells may be transplanted in the biomaterials and into experimental hosts. | 11-10-2011 |
Richard W. Turner, Mooresville, NC US
Patent application number | Description | Published |
---|---|---|
20140162480 | Electrical Outlet Cover with Safety Lock - An outlet cover for an electrical outlet. The outlet cover includes a plate having at least one opening sized and positioned to receive an electrical outlet, a lid hingedly attached to the plate so that the lid can be moved between an open position that allows access to the electrical outlet and a closed position wherein the lid is in a locked position covering the electrical outlet, and a locking assembly having a locking pin. The lid includes a latch which cooperates with the locking pin in order to lock the lid in a closed position or release the lid for opening it for access to the electrical outlet. | 06-12-2014 |
Ronald D. Turner, Greensboro, NC US
Patent application number | Description | Published |
---|---|---|
20160065147 | RECEIVERS FOR DIGITAL PREDISTORTION - Aspects of this disclosure relate to a receiver for digital predistortion (DPD). The receiver includes an analog-to-digital converter (ADC) having a sampling rate that is lower than a signal bandwidth of an output of a circuit having an input that is predistorted by DPD. DPD can be updated based on feedback from the receiver. According to certain embodiments, the receiver can be a narrowband receiver configured to observe sub-bands of the signal bandwidth. In some other embodiments, the receiver can include a sub-Nyquist ADC. | 03-03-2016 |
Timothy L. Turner, Chapel Hill, NC US
Patent application number | Description | Published |
---|---|---|
20080305445 | PROCESS FOR COMBUSTION OF HIGH VISCOSITY LOW HEATING VALUE LIQUID FUELS - The present invention is directed to a process for the clean and convenient combustion of high viscosity liquid fuels, such as glycerol, as well as an apparatus useful for carrying such processes. In certain embodiments, the invention provides a process for glycerol combustion comprising providing a combustion apparatus with a glycerol combustion chamber that facilitates reflective heating, pre-heating the glycerol combustion chamber, atomizing the reduced viscosity glycerol, and combining the atomized glycerol with air in the glycerol combustion chamber to thereby completely combust the glycerol. In one embodiment, such as when using a pressure-atomizing nozzle, the inventive method may further comprise treating the glycerol to reduce the glycerol viscosity. | 12-11-2008 |
20090069610 | PROCESS FOR CONVERSION OF BIOMASS TO FUEL - The present invention is directed to processes for the direct conversion of lipidic biomass fuelstock to combustible fuels. In particular, the invention provides a process for the direct conversion of animal fats to transportations fuels suitable as replacement for petroleum-derived transportation fuels. In one embodiment, the method comprises the steps of hydrolyzing a lipidic biomass to form free fatty acids, catalytically deoxygenating the free fatty acids to form n-alkanes, and reforming at least a portion of the n-alkanes into a mixture of compounds in the correct chain length, conformations, and ratio to be useful transportation fuels. Particularly, the product prepared according to the invention comprises mixtures of hydrocarbon compounds selected from the group consisting of n-alkanes, isoalkanes, aromatics, cycloalkanes, and combinations thereof. | 03-12-2009 |
20110105813 | PROCESS FOR CONVERSION OF BIOMASS TO FUEL - The present invention is directed to processes for the direct conversion of lipidic biomass fuelstock to combustible fuels. In particular, the invention provides a process for the direct conversion of animal fats to transportations fuels suitable as replacement for petroleum-derived transportation fuels. In one embodiment, the method comprises the steps of hydrolyzing a lipidic biomass to form free fatty acids, catalytically deoxygenating the free fatty acids to form n-alkanes, and reforming at least a portion of the n-alkanes into a mixture of compounds in the correct chain length, conformations, and ratio to be useful transportation fuels. Particularly, the product prepared according to the invention comprises mixtures of hydrocarbon compounds selected from the group consisting of n-alkanes, isoalkanes, aromatics, cycloalkanes, and combinations thereof. | 05-05-2011 |
20120108861 | PROCESS FOR CONVERSION OF BIOMASS TO FUEL - The present invention is directed to processes for the direct conversion of lipidic biomass fuelstock to combustible fuels. In particular, the invention provides a process for the direct conversion of animal fats to transportations fuels suitable as replacement for petroleum-derived transportation fuels. In one embodiment, the method comprises the steps of hydrolyzing a lipidic biomass to form free fatty acids, catalytically deoxygenating the free fatty acids to form n-alkanes, and reforming at least a portion of the n-alkanes into a mixture of compounds in the correct chain length, conformations, and ratio to be useful transportation fuels. Particularly, the product prepared according to the invention comprises mixtures of hydrocarbon compounds selected from the group consisting of n-alkanes, isoalkanes, aromatics, cycloalkanes, and combinations thereof. | 05-03-2012 |
20130102818 | PROCESS OF CONVERSION OF BIOMASS TO FUEL - The present invention is directed to processes for the direct conversion of lipidic biomass fuelstock to combustible fuels. In particular, the invention provides a process for the direct conversion of animal fats to transportations fuels suitable as replacement for petroleum-derived transportation fuels. In one embodiment, the method comprises the steps of hydrolyzing a lipidic biomass to form free fatty acids, catalytically deoxygenating the free fatty acids to form n-alkanes, and reforming at least a portion of the n-alkanes into a mixture of compounds in the correct chain length, conformations, and ratio to be useful transportation fuels. Particularly, the product prepared according to the invention comprises mixtures of hydrocarbon compounds selected from the group consisting of n-alkanes, isoalkanes, aromatics, cycloalkanes, and combinations thereof. | 04-25-2013 |
William S. Turner, Chapel Hill, NC US
Patent application number | Description | Published |
---|---|---|
20080248570 | Complexes of hyaluronans, other matrix components, hormones and growth factors for maintenance, expansion and/or differentiation of cells - A method is provided of propagating hepatic cells including hepatic progenitors ex vivo on or in hyaluronans with or without other extracellular matrix components (such as collagens, basal adhesion molecules, proteoglycans or their glycosaminoglycans) and with or without hormones and/or growth factors. Compositions comprising the matrix are also disclosed. Also, the complex can be used for ex vivo tissue engineering or can be used as a scaffold for grafts of cells to be transplanted in vivo. | 10-09-2008 |