Showing papers on "State (computer science) published in 2010"

YANG - A Data Modeling Language for the Network Configuration Protocol (NETCONF)

Abstract: YANG is a data modeling language used to model configuration and state data manipulated by the Network Configuration Protocol (NETCONF) protocol, NETCONF remote procedure calls, and NETCONF notifications.

Logic-Based Models for the Analysis of Cell Signaling Networks

Abstract: Computational models are increasingly used to analyze the operation of complex biochemical networks, including those involved in cell signaling networks. Here we review recent advances in applying logic-based modeling to mammalian cell biology. Logic-based models represent biomolecular networks in a simple and intuitive manner without describing the detailed biochemistry of each interaction. A brief description of several logic-based modeling methods is followed by six case studies that demonstrate biological questions recently addressed using logic-based models and point to potential advances in model formalisms and training procedures that promise to enhance the utility of logic-based methods for studying the relationship between environmental inputs and phenotypic or signaling state outputs of complex signaling networks.

Synthesizing a novel genetic sequential logic circuit: a push-on push-off switch

Abstract: Design and synthesis of basic functional circuits are the fundamental tasks of synthetic biologists. Before it is possible to engineer higher-order genetic networks that can perform complex functions, a toolkit of basic devices must be developed. Among those devices, sequential logic circuits are expected to be the foundation of the genetic information-processing systems. In this study, we report the design and construction of a genetic sequential logic circuit in Escherichia coli. It can generate different outputs in response to the same input signal on the basis of its internal state, and 'memorize' the output. The circuit is composed of two parts: (1) a bistable switch memory module and (2) a double-repressed promoter NOR gate module. The two modules were individually rationally designed, and they were coupled together by fine-tuning the interconnecting parts through directed evolution. After fine-tuning, the circuit could be repeatedly, alternatively triggered by the same input signal; it functions as a push-on push-off switch.

State of the Art Report: Audio-Based Music Structure Analysis.

Abstract: Humans tend to organize perceived information into hierarchies and structures, a principle that also applies to music. Even musically untrained listeners unconsciously analyze and segment music with regard to various musical aspects, for example, identifying recurrent themes or detecting temporal boundaries between contrasting musical parts. This paper gives an overview of state-of-theart methods for computational music structure analysis, where the general goal is to divide an audio recording into temporal segments corresponding to musical parts and to group these segments into musically meaningful categories. There are many different criteria for segmenting and structuring music audio. In particular, one can identify three conceptually different approaches, which we refer to as repetition-based, novelty-based, and homogeneitybased approaches. Furthermore, one has to account for different musical dimensions such as melody, harmony, rhythm, and timbre. In our state-of-the-art report, we address these different issues in the context of music structure analysis, while discussing and categorizing the most relevant and recent articles in this field.

All-DNA finite-state automata with finite memory

Abstract: Biomolecular logic devices can be applied for sensing and nano-medicine. We built three DNA tweezers that are activated by the inputs H+/OH-; ; nucleic acid linker/complementary antilinker to yield a 16-states finite-state automaton. The outputs of the automata are the configuration of the respective tweezers (opened or closed) determined by observing fluorescence from a fluorophore/quencher pair at the end of the arms of the tweezers. The system exhibits a memory because each current state and output depend not only on the source configuration but also on past states and inputs.

Specification and Verification of Declarative Open Interaction Models: A Logic-Based Approach

Abstract: The advent of distributed and heterogeneous systems has laid the foundation for the birth of new architectural paradigms, in which many separated and autonomous entities collaborate and interact to the aim of achieving complex strategic goals, impossible to be accomplished on their own. A non exhaustive list of systems targeted by such paradigms includes Business Process Management, Clinical Guidelines and Careflow Protocols, Service-Oriented and Multi-Agent Systems. It is largely recognized that engineering these systems requires novel modeling techniques. In particular, many authors are claiming that an open, declarative perspective is needed to complement the closed, procedural nature of the state of the art specification languages. For example, the ConDec language has been recently proposed to target the declarative and open specification of Business Processes, overcoming the over-specification and over-constraining issues of classical procedural approaches. On the one hand, the success of such novel modeling languages strongly depends on their usability by non-IT savvy: they must provide an appealing, intuitive graphical front-end. On the other hand, they must be prone to verification, in order to guarantee the trustworthiness and reliability of the developed model, as well as to ensure that the actual executions of the system effectively comply with it. In this dissertation, we claim that Computational Logic is a suitable framework for dealing with the specification, verification, execution, monitoring and analysis of these systems. We propose to adopt an extended version of the ConDec language for specifying interaction models with a declarative, open flavor. We show how all the (extended) ConDec constructs can be automatically translated to the CLIMB Computational Logic-based language, and illustrate how its corresponding reasoning techniques can be successfully exploited to provide support and verification capabilities along the whole life cycle of the targeted systems.

Algorithmic Verification of Single-Pass List Processing Programs

Abstract: We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) sequences of data values, tagged with symbols from a finite set, over a potentially infinite data domain that supports only the operations of equality and ordering. The transducer uses a finite set of states, a finite set of variables ranging over the data domain, and a finite set of variables ranging over data strings. At every step, it can make decisions based on the next input symbol, updating its state, remembering the input data value in its data variables, and updating data-string variables by concatenating data-string variables and new symbols formed from data variables, while avoiding duplication. We establish that the problems of checking functional equivalence of two streaming transducers, and of checking whether a streaming transducer satisfies pre/post verification conditions specified by streaming acceptors over input/output data-strings, are in PSPACE. We identify a class of imperative and a class of functional programs, manipulating lists of data items, which can be effectively translated to streaming data-string transducers. The imperative programs dynamically modify a singly-linked heap by changing next-pointers of heap-nodes and by adding new nodes. The main restriction specifies how the next-pointers can be used for traversal. We also identify an expressively equivalent fragment of functional programs that traverse a list using syntactically restricted recursive calls. Our results lead to algorithms for assertion checking and for checking functional equivalence of two programs, written possibly in different programming styles, for commonly used routines such as insert, delete, and reverse.

Method and computer program product of switching locked state of electronic device

Abstract: In a method of switching a locked state of an electronic device with a user-verifying function, a biologic feature data from a user is captured while receiving an input from the user for an operation when the electronic device is in a locked state. Whether the biologic feature data conforms to a reference biologic feature data is then determined. If it is determined that the biologic feature data conforms to the reference biologic feature data, the electronic device is switched from the locked state into a non-locked state and directly controls the electronic device to perform the operation according to the input when the biologic feature data is determined conforming to the reference biologic feature data.

Power management method and related power management system

Abstract: A power management method is disclosed. The power management method comprises the step of a computer system checking existence of a manufacturing identifier (ID) of a human interface device (HID) when the computer system is operated in a first mode; the computer system continuously detecting whether the HID exist when the manufacturing ID exists; the computer system starting a timer when the computer system detects that the HID does not exist; the computer system entering a second mode when the timer expires; the HID determining whether the computer system is operated in the second mode, when plugged into the computer system; the HID performing state transition on the computer system when determining that the computer system is in the second mode; and the computer system entering the first mode when detecting the state transition.

Method and system for migrating the state of a virtual cluster

Abstract: The administrative work needed to configure a virtual cluster is a major obstacle that limits its adoption by customers. Moreover, an organization can spend much time and effort testing a cluster configuration and would like to deploy this cluster configuration at many sites. To address these problems, the disclosed embodiments provide a mechanism that facilitates migrating a virtual cluster from a first computer system to a second computer system. During operation, the system captures the virtual cluster configuration state, including application configuration state and executables. The system then instantiates this captured state on a second computer system, thus re-creating the virtual cluster state of the first computer system on the second computer system.

Biometric interface for a handheld device

Abstract: Methods and systems for applying biometric data to an interactive program executed by a portable device are provided. According to embodiments of the invention, raw bio-signal data is captured and filtered so as to determine the bio-signal of the user of the interactive program. The bio-signal is analyzed so as to determine biometrics of the user, which are applied as input to the interactive program. A setting or state of the interactive program is modified based on the biometrics. An updated state of the interactive program is rendered to the user, reflecting the modification of the setting or state of the interactive program.

Context-based state change for an adaptive input device

Abstract: Various embodiments of systems and methods to implement a context-based state change for an adaptive input device are provided. For example, a method is disclosed that may include receiving a state input indicating a change in a system state, changing adaptive input device data in response to the state input, the adaptive input device data including one or more of image data or adaptive input device mapping data, and adjusting an adaptive input device display state using the adaptive input device data. Adjusting the adaptive input device display state may include one or more of displaying the image data on an adaptive input device display or adjusting an adaptive input device mapping state according to the adaptive input device mapping data.

Model Checking Infinite-State Systems: Generic and Specific Approaches

Abstract: University of Edinburgh, PhD in Informatics, September 2006 – August 2010 Thesis: Model Checking Infinite-state Systems: Generic and Specific Approaches Supervisors: Prof. Leonid Libkin and Dr. Richard Mayr Examiners: Prof. Chih-Hao Luke Ong and Prof. Colin Stirling University of Melbourne, BSc (Honours) in Computer Science & Mathematics, February 2001 – December 2004 Thesis: On Unary-conjunctive-view Queries Adviser: Prof. James Bailey

A rely-guarantee proof system for x86-TSO

Abstract: Current multiprocessors provide weak or relaxed memory models. Existing program logics assume sequential consistency, and are therefore typically unsound for weak memory. We introduce a novel Rely-Guarantee style proof system for reasoning about x86 assembly programs running against the weak x86-TSO memory model. Interesting features of the logic include processor assertions which can refer to the local state of other processors (including their program counters), and a syntactic operation of closing an assertion under write buffer interference. We use the expressivity of the proof system to construct a new correctness proof for an x86-TSO version of Simpson's four slot algorithm. Mechanization in the Hol theorem prover provides a flexible tool to support semi-automated verification.

Zzyzx: Scalable fault tolerance through Byzantine locking

Abstract: Zzyzx is a Byzantine fault-tolerant replicated state machine protocol that outperforms prior approaches and provides near-linear throughput scaling. Using a new technique called Byzantine Locking, Zzyzx allows a client to extract state from an underlying replicated state machine and access it via a second protocol specialized for use by a single client. This second protocol requires just one round-trip and 2 f + 1 responsive servers—compared to Zyzzyva, this results in 39–43% lower response times and a factor of 2.2−2.9× higher throughput. Furthermore, the extracted state can be transferred to other servers, allowing non-overlapping sets of servers to manage different state. Thus, Zzyzx allows throughput to be scaled by adding servers when concurrent data sharing is not common. When data sharing is common, performance can match that of the underlying replicated state machine protocol.

Method and apparatus for a motion state aware headset

Abstract: A device comprising a motion context logic that receives data from at least one motion sensor is described. The motion context logic determines a user's motion context. Context based action logic manages the device based on the user's motion context.

Method and apparatus for user interaction while device is locked

Abstract: A method, apparatus, user interface and computer program product for detecting an invalid passcode state of a device when the device is in a locked state, prompting a communication from the device to a trusted contact while the device is in the locked state, the trusted contact being designated by the device, and transmitting the communication to the trusted contact with a lost passcode request while the device is in the locked state.

From total store order to sequential consistency: a practical reduction theorem

Abstract: When verifying a concurrent program, it is usual to assume sequentially consistent memory. However, most modern multiprocessors buffer their stores, providing native sequential consistency only at a substantial performance penalty. To regain sequential consistency, a programmer has to follow an appropriate programming discipline. However, existing naive disciplines, such as protecting all shared accesses with locks to avoid data races, or flushing store buffers according to a protocol that allows arbitrary data races, are not flexible enough for building high-performance multiprocessor software. We present a new discipline for concurrent programming under TSO (total store order, with store buffer forwarding). Instead of using concurrency primitives, such as locks, it is based on maintaining ownership information in ghost state, allowing the discipline to be expressed as a state invariant and verified through conventional program reasoning. If every execution of a program in a system without store buffers follows the discipline, then every execution of the program in a system with store buffers is sequentially consistent.

Analytic real-time analysis and timed automata: a hybrid methodology for the performance analysis of embedded real-time systems

Abstract: This paper presents a compositional and hybrid approach for the performance analysis of distributed real-time systems. The developed methodology abstracts system components by either flow-oriented and purely analytic descriptions or by state-based models in the form of timed automata. The interaction among the heterogeneous components is modeled by streams of discrete events. In total this yields a hybrid framework for the compositional analysis of embedded systems. It supplements contemporary techniques for the following reasons: (a) state space explosion as intrinsic to formal verification is limited to the level of isolated components; (b) computed performance metrics such as buffer sizes, delays and utilization rates are not overly pessimistic, because coarse-grained analytic models are used only for components that conform to the stateless model of computation. For demonstrating the usefulness of the presented ideas, a corresponding tool-chain has been implemented. It is used to investigate the performance of a two-staged computing system, where one stage exhibits state-dependent behavior that is only coarsely coverable by a purely analytic and stateless component abstraction. Finally, experiments are performed to ascertain the scalability and the accuracy of the proposed approach.

System and method for controlling state tokens

Abstract: The system and method for controlling state tokens described herein may secure sensitive application state tokens, link one application state token to other state tokens that represent certain identities or communication sessions, and maintain application state tokens to integrate various different systems or applications. In particular, the system and method described herein may provide a mechanism to override scheme that applications use to manage state information and thereby enforce policies that provide fine-grained control over any semantics the applications otherwise use to manage state information. Furthermore, a first application state token may be linked to another state token representing a session or identity to validate whether the session or identity represented therein created the first application state token, and state tokens that represent active communication sessions may be copied from browser processes to various external clients to integrate or otherwise share state information across the various external clients.

From state- to delta-based bidirectional model transformations

Abstract: Existing bidirectional model transformation languages are mainly state-based: a transformation is considered composed from functions whose inputs and outputs only consist of original and updated models, but alignment relationships between the models are not specified. In the paper we identify and discuss three major problems caused by this under-specification. We then propose a novel formal framework based on a graphical language: models are nodes and updates are arrows, and show how the three problems can be fixed.

Non-volatile multilevel memory cell programming

Abstract: Embodiments of the present disclosure provide methods, devices, modules, and systems for programming multilevel non-volatile multilevel memory cells. One method includes increasing a threshold voltage (Vt) for each of a number of memory cells until the Vt reaches a verify voltage (VFY) corresponding to a program state among a number of program states. The method includes determining whether the Vt of each of the cells has reached a pre-verify voltage (PVFY) associated with the program state, selectively biasing bit lines coupled to those cells whose Vt has reached the PVFY, adjusting the PVFY to a different level, and selectively biasing bit lines coupled to cells whose Vt has reached the adjusted PVFY, wherein the PVFY and the adjusted PVFY are less than the VFY.

Method and an apparatus for controlling a machine using motion based signals and inputs

Abstract: The present invention provides a method and apparatus for controlling a machine, such as a crane or other industrial equipment, based on motion-based input to motion sensors such as accelerometers. An input state is selected according to an integrated user input to determine a mapping between motion-based signals, corresponding to motion-based input, and one or more of a plurality of machine control signals provided for controlling the machine. Machine control signals are provided via the mapping when the input state is an operational state, and are not provided via the mapping when the input state is a standby state.

Methods and apparatus for initiating image capture on a hand-held device

Abstract: A computer implemented method for initiating capture of an image on a computer system, performed by the computer system that is programmed to perform the method includes determining by a physical sensor of the computer system, a change in physical state of the computer system, wherein the change in physical state is associated with a magnitude of change in physical state, determining by the computer system, whether the magnitude of change in physical state by the physical sensor exceeds a threshold level, determining by the computer system, a plurality of parameters for a camera associated with the computer system, and initiating by the computer system, capture of one or more images using the camera after the magnitude of change in physical state by the physical sensor exceeds the threshold level.

SF6 high-voltage circuit breaker state intelligent monitoring and health management system

Abstract: The invention relates to an SF6 high-voltage circuit breaker intelligent monitoring and health management system which comprises hardware and software, wherein the hardware is divided into a lower computer and an upper computer; the lower computer hardware comprises an intelligent control and processing unit based on an FPGA and an ARM, a data acquisition unit, a data storage unit, an intelligent control output unit and a CAN bus communication unit; the upper computer hardware consists of a monitoring center server unit and a PCI 1680U board card; and the communication between the upper computer and the lower computer is realized by a CAN bus network. The software is also divided into a lower computer and an upper computer, wherein the lower computer software is in charge of driving the lower computer hardware to complete mechanical, electrical and insulating state data acquisition and feature extraction, realizes intelligent reasoning and intelligent control by combining system information, and drives the CAN bus communication unit to send the result obtained by processing into the upper computer; and the upper computer software is in charge of driving the PCI 1680U board card of the upper computer to complete communication, and realizes the man-machine interaction interface and intelligent monitoring information management. The system realizes the comprehensive monitoring for the SF6 high-voltage circuit breaker state and performance.

Fast computer startup

Abstract: Fast computer startup is provided by, upon receipt of a shutdown command, recording state information representing a target state. In this target state, the computing device may have closed all user sessions, such that no user state information is included in the target state. However, the operating system may still be executing. In response to a command to startup the computer, this target state may be quickly reestablished from the recorded target state information. Portions of a startup sequence may be performed to complete the startup process, including establishing user state. To protect user expectations despite changes in response to a shutdown command, creation and use of the file holding the recorded state information may be conditional on dynamically determined events. Also, user and programmatic interfaces may provide options to override creation or use of the recorded state information.

Data recovery for non-volatile memory based on count of data state-specific fails

Abstract: An error detection and data recovery operation for a non-volatile memory system. Even after a programming operation for a set of storage elements is successfully completed, the data of some storage elements may be corrupted. For example, erased state storage element may be disturbed by programming of other storage elements. To allow recovery of data in such situations, associated data latches can be configured to allow the erased state storage elements to be distinguished from other data states once programming is completed. Furthermore, a single read operation can be performed after programming is completed. Logical operations are performed using results from the read operation, and values in the data latches, to identify erased state storage elements which have strayed to another data state. If the number of errors exceeds a threshold, a full recovery operation is initiated in which read operations are performed for the remaining states.

State of the Art of Data Dissemination in VANETs

Abstract: (Road Side Units) and vehicles disseminate safety and non safety messages. The aim of VANETs is to enable dissemination of traffic information and road conditions as detected by independently moving vehicles. For VANETs applications, it is important to disseminate data from an information source vehicle to many destination vehicles on the road. Dissemination of data in VANETs is used to improve the quality of driving in terms of time, distance, and safety. In this paper, a solution of ensuring data dissemination in vehicular ad-hoc networks for sparse and dense vehicular network is presented. Architecture for data dissemination is also proposed.

Maintaining the Domain Access of a Virtual Machine

Abstract: A method for maintaining domain access of a virtual machine is described. According to one embodiment, a generation of a new computer account password by an operating system is identified. The new computer account password is copied to an auxiliary storage location. An existing computer account password is replaced with the new computer account password when it is determined that a file system of the computer has been restored to a previous state. The copying of the new computer account password may be performed in response to the generation of the new computer account password. The replacing of the existing computer account password may be performed in response to the restoring of file system to the previous state.

A symbolic approach to controlling piecewise affine systems

Abstract: We present a computational framework for automatic synthesis of a feedback control strategy for a piecewise affine (PWA) system from a specification given as a Linear Temporal Logic (LTL) formula over an arbitrary set of linear predicates in its state variables. First, by defining partitions for its state and input spaces, we construct a finite abstraction of the PWA system in the form of a control transition system. Second, we develop an algorithm to generate a control strategy for the finite abstraction. While provably correct and robust to small perturbations in both state measurements and applied inputs, the overall procedure is conservative and expensive. The proposed algorithms have been implemented and are available for download. Illustrative examples are included