Graph rigidity, cyclic belief propagation, and point pattern matching.

PubMed

McAuley, Julian J; Caetano, Tibério S; Barbosa, Marconi S

2008-11-01

A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal graphical model. Its fundamental result is that the chordal graph in question is shown to be globally rigid, implying that exact inference provides the same matching solution as exact inference in a complete graphical model. This implies that the algorithm is optimal when there is no noise in the point patterns. In this paper, we present a new graph that is also globally rigid but has an advantage over the graph proposed in [1]: Its maximal clique size is smaller, rendering inference significantly more efficient. However, this graph is not chordal, and thus, standard Junction Tree algorithms cannot be directly applied. Nevertheless, we show that loopy belief propagation in such a graph converges to the optimal solution. This allows us to retain the optimality guarantee in the noiseless case, while substantially reducing both memory requirements and processing time. Our experimental results show that the accuracy of the proposed solution is indistinguishable from that in [1] when there is noise in the point patterns.

Learning neural connectivity from firing activity: efficient algorithms with provable guarantees on topology.

PubMed

Karbasi, Amin; Salavati, Amir Hesam; Vetterli, Martin

2018-04-01

The connectivity of a neuronal network has a major effect on its functionality and role. It is generally believed that the complex network structure of the brain provides a physiological basis for information processing. Therefore, identifying the network's topology has received a lot of attentions in neuroscience and has been the center of many research initiatives such as Human Connectome Project. Nevertheless, direct and invasive approaches that slice and observe the neural tissue have proven to be time consuming, complex and costly. As a result, the inverse methods that utilize firing activity of neurons in order to identify the (functional) connections have gained momentum recently, especially in light of rapid advances in recording technologies; It will soon be possible to simultaneously monitor the activities of tens of thousands of neurons in real time. While there are a number of excellent approaches that aim to identify the functional connections from firing activities, the scalability of the proposed techniques plays a major challenge in applying them on large-scale datasets of recorded firing activities. In exceptional cases where scalability has not been an issue, the theoretical performance guarantees are usually limited to a specific family of neurons or the type of firing activities. In this paper, we formulate the neural network reconstruction as an instance of a graph learning problem, where we observe the behavior of nodes/neurons (i.e., firing activities) and aim to find the links/connections. We develop a scalable learning mechanism and derive the conditions under which the estimated graph for a network of Leaky Integrate and Fire (LIf) neurons matches the true underlying synaptic connections. We then validate the performance of the algorithm using artificially generated data (for benchmarking) and real data recorded from multiple hippocampal areas in rats.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Duchaineau, M.; Wolinsky, M.; Sigeti, D.E.

Real-time terrain rendering for interactive visualization remains a demanding task. We present a novel algorithm with several advantages over previous methods: our method is unusually stingy with polygons yet achieves real-time performance and is scalable to arbitrary regions and resolutions. The method provides a continuous terrain mesh of specified triangle count having provably minimum error in restricted but reasonably general classes of permissible meshes and error metrics. Our method provides an elegant solution to guaranteeing certain elusive types of consistency in scenes produced by multiple scene generators which share a common finest-resolution database but which otherwise operate entirely independently. Thismore » consistency is achieved by exploiting the freedom of choice of error metric allowed by the algorithm to provide, for example, multiple exact lines-of-sight in real-time. Our methods rely on an off-line pre-processing phase to construct a multi-scale data structure consisting of triangular terrain approximations enhanced ({open_quotes}thickened{close_quotes}) with world-space error information. In real time, this error data is efficiently transformed into screen-space where it is used to guide a greedy top-down triangle subdivision algorithm which produces the desired minimal error continuous terrain mesh. Our algorithm has been implemented and it operates at real-time rates.« less

A Max-Flow Based Algorithm for Connected Target Coverage with Probabilistic Sensors

PubMed Central

Shan, Anxing; Xu, Xianghua; Cheng, Zongmao; Wang, Wensheng

2017-01-01

Coverage is a fundamental issue in the research field of wireless sensor networks (WSNs). Connected target coverage discusses the sensor placement to guarantee the needs of both coverage and connectivity. Existing works largely leverage on the Boolean disk model, which is only a coarse approximation to the practical sensing model. In this paper, we focus on the connected target coverage issue based on the probabilistic sensing model, which can characterize the quality of coverage more accurately. In the probabilistic sensing model, sensors are only be able to detect a target with certain probability. We study the collaborative detection probability of target under multiple sensors. Armed with the analysis of collaborative detection probability, we further formulate the minimum ϵ-connected target coverage problem, aiming to minimize the number of sensors satisfying the requirements of both coverage and connectivity. We map it into a flow graph and present an approximation algorithm called the minimum vertices maximum flow algorithm (MVMFA) with provable time complex and approximation ratios. To evaluate our design, we analyze the performance of MVMFA theoretically and also conduct extensive simulation studies to demonstrate the effectiveness of our proposed algorithm. PMID:28587084

A Max-Flow Based Algorithm for Connected Target Coverage with Probabilistic Sensors.

PubMed

Shan, Anxing; Xu, Xianghua; Cheng, Zongmao; Wang, Wensheng

2017-05-25

Coverage is a fundamental issue in the research field of wireless sensor networks (WSNs). Connected target coverage discusses the sensor placement to guarantee the needs of both coverage and connectivity. Existing works largely leverage on the Boolean disk model, which is only a coarse approximation to the practical sensing model. In this paper, we focus on the connected target coverage issue based on the probabilistic sensing model, which can characterize the quality of coverage more accurately. In the probabilistic sensing model, sensors are only be able to detect a target with certain probability. We study the collaborative detection probability of target under multiple sensors. Armed with the analysis of collaborative detection probability, we further formulate the minimum ϵ -connected target coverage problem, aiming to minimize the number of sensors satisfying the requirements of both coverage and connectivity. We map it into a flow graph and present an approximation algorithm called the minimum vertices maximum flow algorithm (MVMFA) with provable time complex and approximation ratios. To evaluate our design, we analyze the performance of MVMFA theoretically and also conduct extensive simulation studies to demonstrate the effectiveness of our proposed algorithm.

The universal numbers. From Biology to Physics.

PubMed

Marchal, Bruno

2015-12-01

I will explain how the mathematicians have discovered the universal numbers, or abstract computer, and I will explain some abstract biology, mainly self-reproduction and embryogenesis. Then I will explain how and why, and in which sense, some of those numbers can dream and why their dreams can glue together and must, when we assume computationalism in cognitive science, generate a phenomenological physics, as part of a larger phenomenological theology (in the sense of the greek theologians). The title should have been "From Biology to Physics, through the Phenomenological Theology of the Universal Numbers", if that was not too long for a title. The theology will consist mainly, like in some (neo)platonist greek-indian-chinese tradition, in the truth about numbers' relative relations, with each others, and with themselves. The main difference between Aristotle and Plato is that Aristotle (especially in its common and modern christian interpretation) makes reality WYSIWYG (What you see is what you get: reality is what we observe, measure, i.e. the natural material physical science) where for Plato and the (rational) mystics, what we see might be only the shadow or the border of something else, which might be non physical (mathematical, arithmetical, theological, …). Since Gödel, we know that Truth, even just the Arithmetical Truth, is vastly bigger than what the machine can rationally justify. Yet, with Church's thesis, and the mechanizability of the diagonalizations involved, machines can apprehend this and can justify their limitations, and get some sense of what might be true beyond what they can prove or justify rationally. Indeed, the incompleteness phenomenon introduces a gap between what is provable by some machine and what is true about that machine, and, as Gödel saw already in 1931, the existence of that gap is accessible to the machine itself, once it is has enough provability abilities. Incompleteness separates truth and provable, and machines can justify this in some way. More importantly incompleteness entails the distinction between many intensional variants of provability. For example, the absence of reflexion (beweisbar(⌜A⌝) → A with beweisbar being Gödel's provability predicate) makes it impossible for the machine's provability to obey the axioms usually taken for a theory of knowledge. The most important consequence of this in the machine's possible phenomenology is that it provides sense, indeed arithmetical sense, to intensional variants of provability, like the logics of provability-and-truth, which at the propositional level can be mirrored by the logic of provable-and-true statements (beweisbar(⌜A⌝) ∧ A). It is incompleteness which makes this logic different from the logic of provability. Other variants, like provable-and-consistent, or provable-and-consistent-and-true, appears in the same way, and inherits the incompleteness splitting, unlike beweisbar(⌜A⌝) ∧ A. I will recall thought experience which motivates the use of those intensional variants to associate a knower and an observer in some canonical way to the machines or the numbers. We will in this way get an abstract and phenomenological theology of a machine M through the true logics of their true self-referential abilities (even if not provable, or knowable, by the machine itself), in those different intensional senses. Cognitive science and theoretical physics motivate the study of those logics with the arithmetical interpretation of the atomic sentences restricted to the "verifiable" (Σ1) sentences, which is the way to study the theology of the computationalist machine. This provides a logic of the observable, as expected by the Universal Dovetailer Argument, which will be recalled briefly, and which can lead to a comparison of the machine's logic of physics with the empirical logic of the physicists (like quantum logic). This leads also to a series of open problems. Copyright © 2015 Elsevier Ltd. All rights reserved.

Fast Collaborative Filtering from Implicit Feedback withProvable Guarantees

DTIC Science & Technology

2016-11-22

n2 = Ω (( ε d̃2sσK(M2) )2) • n3 = Ω ( K2 ( 10 d̃2sσK(M2)5/2 + 2 √ 2 d̃3sσK(M2)3/2 )2 ε2 ) 212 Fast Collaborative Filtering for some constants c1 and c2...drawback of Method of Moments is that it will not work when there are only a few users available such that N < Θ( K2 ). However, modern recommendation systems...2 √ 2 d̃3sσK(M2)3/2 ) 2ε√ N ≤ c1 1 K √ πmax Since πmax ≤ 1, we need N ≥ Ω ( K2 ( 10 d̃2sσK(M2)5/2 + 2 √ 2 d̃3sσK(M2)3/2 )2 ε2 ) . This con- tributes

Degree of quantum correlation required to speed up a computation

NASA Astrophysics Data System (ADS)

Kay, Alastair

2015-12-01

The one-clean-qubit model of quantum computation (DQC1) efficiently implements a computational task that is not known to have a classical alternative. During the computation, there is never more than a small but finite amount of entanglement present, and it is typically vanishingly small in the system size. In this paper, we demonstrate that there is nothing unexpected hidden within the DQC1 model—Grover's search, when acting on a mixed state, provably exhibits a speedup over classical, with guarantees as to the presence of only vanishingly small amounts of quantum correlations (entanglement and quantum discord)—while arguing that this is not an artifact of the oracle-based construction. We also present some important refinements in the evaluation of how much entanglement may be present in the DQC1 and how the typical entanglement of the system must be evaluated.

Enabling Genomic-Phenomic Association Discovery without Sacrificing Anonymity

PubMed Central

Heatherly, Raymond D.; Loukides, Grigorios; Denny, Joshua C.; Haines, Jonathan L.; Roden, Dan M.; Malin, Bradley A.

2013-01-01

Health information technologies facilitate the collection of massive quantities of patient-level data. A growing body of research demonstrates that such information can support novel, large-scale biomedical investigations at a fraction of the cost of traditional prospective studies. While healthcare organizations are being encouraged to share these data in a de-identified form, there is hesitation over concerns that it will allow corresponding patients to be re-identified. Currently proposed technologies to anonymize clinical data may make unrealistic assumptions with respect to the capabilities of a recipient to ascertain a patients identity. We show that more pragmatic assumptions enable the design of anonymization algorithms that permit the dissemination of detailed clinical profiles with provable guarantees of protection. We demonstrate this strategy with a dataset of over one million medical records and show that 192 genotype-phenotype associations can be discovered with fidelity equivalent to non-anonymized clinical data. PMID:23405076

When Proofs Reflect More on Assumptions than Conclusions

ERIC Educational Resources Information Center

Dawkins, Paul Christian

2014-01-01

This paper demonstrates how questions of "provability" can help students engaged in reinvention of mathematical theory to understand the axiomatic game. While proof demonstrates how conclusions follow from assumptions, "provability" characterizes the dual relation that assumptions are "justified" when they afford…

Case Study of the Minimum Provable Risk Considering the Variation in Background Risk: Effect of Residual Risk on Epidemiological Studies and a Comparative Assessment of Fatal Disease Risk Due to Radiation Exposure.

PubMed

Sasaki, Michiya; Ogino, Haruyuki; Hattori, Takatoshi

2018-06-08

In order to prove a small increment in a risk of concern in an epidemiological study, a large sample of a population is generally required. Since the background risk of an end point of interest, such as cancer mortality, is affected by various factors, such as lifestyle (diet, smoking, etc.), adjustment for such factors is necessary. However, it is impossible to inclusively and completely adjust for such factors; therefore, uncertainty in the background risk remains for control and exposed populations, indicating that there is a minimum limit to the lower bound for the provable risk regardless of the sample size. In this case study, we developed and discussed the minimum provable risk considering the uncertainty in background risk for hypothetical populations by referring to recent Japanese statistical information to grasp the extent of the minimum provable risk. Risk of fatal diseases due to radiation exposure, which has recently been the focus of radiological protection, was also examined by comparative assessment of the minimum provable risk for cancer and circulatory diseases. It was estimated that the minimum provable risk for circulatory disease mortality was much greater than that for cancer mortality, approximately five to seven times larger; circulatory disease mortality is more difficult to prove as a radiation risk than cancer mortality under the conditions used in this case study.This is an open-access article distributed under the terms of the Creative Commons Attribution-Non Commercial-No Derivatives License 4.0 (CCBY-NC-ND), where it is permissible to download and share the work provided it is properly cited. The work cannot be changed in any way or used commercially without permission from the journal.

Provably secure identity-based identification and signature schemes from code assumptions

PubMed Central

Zhao, Yiming

2017-01-01

Code-based cryptography is one of few alternatives supposed to be secure in a post-quantum world. Meanwhile, identity-based identification and signature (IBI/IBS) schemes are two of the most fundamental cryptographic primitives, so several code-based IBI/IBS schemes have been proposed. However, with increasingly profound researches on coding theory, the security reduction and efficiency of such schemes have been invalidated and challenged. In this paper, we construct provably secure IBI/IBS schemes from code assumptions against impersonation under active and concurrent attacks through a provably secure code-based signature technique proposed by Preetha, Vasant and Rangan (PVR signature), and a security enhancement Or-proof technique. We also present the parallel-PVR technique to decrease parameter values while maintaining the standard security level. Compared to other code-based IBI/IBS schemes, our schemes achieve not only preferable public parameter size, private key size, communication cost and signature length due to better parameter choices, but also provably secure. PMID:28809940

Provably secure identity-based identification and signature schemes from code assumptions.

PubMed

Song, Bo; Zhao, Yiming

2017-01-01

Code-based cryptography is one of few alternatives supposed to be secure in a post-quantum world. Meanwhile, identity-based identification and signature (IBI/IBS) schemes are two of the most fundamental cryptographic primitives, so several code-based IBI/IBS schemes have been proposed. However, with increasingly profound researches on coding theory, the security reduction and efficiency of such schemes have been invalidated and challenged. In this paper, we construct provably secure IBI/IBS schemes from code assumptions against impersonation under active and concurrent attacks through a provably secure code-based signature technique proposed by Preetha, Vasant and Rangan (PVR signature), and a security enhancement Or-proof technique. We also present the parallel-PVR technique to decrease parameter values while maintaining the standard security level. Compared to other code-based IBI/IBS schemes, our schemes achieve not only preferable public parameter size, private key size, communication cost and signature length due to better parameter choices, but also provably secure.

Fundamental problems in provable security and cryptography.

PubMed

Dent, Alexander W

2006-12-15

This paper examines methods for formally proving the security of cryptographic schemes. We show that, despite many years of active research and dozens of significant results, there are fundamental problems which have yet to be solved. We also present a new approach to one of the more controversial aspects of provable security, the random oracle model.

The Witness-Voting System

NASA Astrophysics Data System (ADS)

Gerck, Ed

We present a new, comprehensive framework to qualitatively improve election outcome trustworthiness, where voting is modeled as an information transfer process. Although voting is deterministic (all ballots are counted), information is treated stochastically using Information Theory. Error considerations, including faults, attacks, and threats by adversaries, are explicitly included. The influence of errors may be corrected to achieve an election outcome error as close to zero as desired (error-free), with a provably optimal design that is applicable to any type of voting, with or without ballots. Sixteen voting system requirements, including functional, performance, environmental and non-functional considerations, are derived and rated, meeting or exceeding current public-election requirements. The voter and the vote are unlinkable (secret ballot) although each is identifiable. The Witness-Voting System (Gerck, 2001) is extended as a conforming implementation of the provably optimal design that is error-free, transparent, simple, scalable, robust, receipt-free, universally-verifiable, 100% voter-verified, and end-to-end audited.

A survey of provably correct fault-tolerant clock synchronization techniques

NASA Technical Reports Server (NTRS)

Butler, Ricky W.

1988-01-01

Six provably correct fault-tolerant clock synchronization algorithms are examined. These algorithms are all presented in the same notation to permit easier comprehension and comparison. The advantages and disadvantages of the different techniques are examined and issues related to the implementation of these algorithms are discussed. The paper argues for the use of such algorithms in life-critical applications.

Provably secure Rabin-p cryptosystem in hybrid setting

NASA Astrophysics Data System (ADS)

Asbullah, Muhammad Asyraf; Ariffin, Muhammad Rezal Kamel

2016-06-01

In this work, we design an efficient and provably secure hybrid cryptosystem depicted by a combination of the Rabin-p cryptosystem with an appropriate symmetric encryption scheme. We set up a hybrid structure which is proven secure in the sense of indistinguishable against the chosen-ciphertext attack. We presume that the integer factorization problem is hard and the hash function that modeled as a random function.

Requirements to Design to Code: Towards a Fully Formal Approach to Automatic Code Generation

NASA Technical Reports Server (NTRS)

Hinchey, Michael G.; Rash, James L.; Rouff, Christopher A.

2004-01-01

A general-purpose method to mechanically transform system requirements into a provably equivalent model has yet to appear. Such a method represents a necessary step toward high-dependability system engineering for numerous possible application domains, including sensor networks and autonomous systems. Currently available tools and methods that start with a formal model of a system and mechanically produce a provably equivalent implementation are valuable but not sufficient. The gap that current tools and methods leave unfilled is that their formal models cannot be proven to be equivalent to the system requirements as originated by the customer. For the classes of systems whose behavior can be described as a finite (but significant) set of scenarios, we offer a method for mechanically transforming requirements (expressed in restricted natural language, or in other appropriate graphical notations) into a provably equivalent formal model that can be used as the basis for code generation and other transformations.

A Formal Approach to Requirements-Based Programming

NASA Technical Reports Server (NTRS)

Hinchey, Michael G.; Rash, James L.; Rouff, Christopher A.

2005-01-01

No significant general-purpose method is currently available to mechanically transform system requirements into a provably equivalent model. The widespread use of such a method represents a necessary step toward high-dependability system engineering for numerous application domains. Current tools and methods that start with a formal model of a system and mechanically produce a provably equivalent implementation are valuable but not sufficient. The "gap" unfilled by such tools and methods is that the formal models cannot be proven to be equivalent to the requirements. We offer a method for mechanically transforming requirements into a provably equivalent formal model that can be used as the basis for code generation and other transformations. This method is unique in offering full mathematical tractability while using notations and techniques that are well known and well trusted. Finally, we describe further application areas we are investigating for use of the approach.

One-step estimation of networked population size: Respondent-driven capture-recapture with anonymity.

PubMed

Khan, Bilal; Lee, Hsuan-Wei; Fellows, Ian; Dombrowski, Kirk

2018-01-01

Size estimation is particularly important for populations whose members experience disproportionate health issues or pose elevated health risks to the ambient social structures in which they are embedded. Efforts to derive size estimates are often frustrated when the population is hidden or hard-to-reach in ways that preclude conventional survey strategies, as is the case when social stigma is associated with group membership or when group members are involved in illegal activities. This paper extends prior research on the problem of network population size estimation, building on established survey/sampling methodologies commonly used with hard-to-reach groups. Three novel one-step, network-based population size estimators are presented, for use in the context of uniform random sampling, respondent-driven sampling, and when networks exhibit significant clustering effects. We give provably sufficient conditions for the consistency of these estimators in large configuration networks. Simulation experiments across a wide range of synthetic network topologies validate the performance of the estimators, which also perform well on a real-world location-based social networking data set with significant clustering. Finally, the proposed schemes are extended to allow them to be used in settings where participant anonymity is required. Systematic experiments show favorable tradeoffs between anonymity guarantees and estimator performance. Taken together, we demonstrate that reasonable population size estimates are derived from anonymous respondent driven samples of 250-750 individuals, within ambient populations of 5,000-40,000. The method thus represents a novel and cost-effective means for health planners and those agencies concerned with health and disease surveillance to estimate the size of hidden populations. We discuss limitations and future work in the concluding section.

A Provably-Secure Transmission Scheme for Wireless Body Area Networks.

PubMed

Omala, Anyembe Andrew; Robert, Niyifasha; Li, Fagen

2016-11-01

Wireless body area network (WBANs) is composed of sensors that collect and transmit a person's physiological data to health-care providers in real-time. In order to guarantee security of this data over open networks, a secure data transmission mechanism between WBAN and application provider's servers is of necessity. Modified medical data does not provide a true reflection of an individuals state of health and its subsequent use for diagnosis could lead to an irreversible medical condition. In this paper, we propose a lightweight certificateless signcryption scheme for secure transmission of data between WBAN and servers. Our proposed scheme not only provides confidentiality of data and authentication in a single logical step, it is lightweight and resistant to key escrow attacks. We further provide security proof that our scheme provides indistinguishability against adaptive chosen ciphertext attack and unforgeability against adaptive chosen message attack in random oracle model. Compared with two other Diffie-Hellman based signcryption schemes proposed by Barbosa and Farshim (BF) and another by Yin and Liang (YL), our scheme consumes 46 % and 8 % less energy during signcryption than BF and YL scheme respectively.

Compatible diagonal-norm staggered and upwind SBP operators

NASA Astrophysics Data System (ADS)

Mattsson, Ken; O'Reilly, Ossian

2018-01-01

The main motivation with the present study is to achieve a provably stable high-order accurate finite difference discretisation of linear first-order hyperbolic problems on a staggered grid. The use of a staggered grid makes it non-trivial to discretise advective terms. To overcome this difficulty we discretise the advective terms using upwind Summation-By-Parts (SBP) operators, while the remaining terms are discretised using staggered SBP operators. The upwind and staggered SBP operators (for each order of accuracy) are compatible, here meaning that they are based on the same diagonal norms, allowing for energy estimates to be formulated. The boundary conditions are imposed using a penalty (SAT) technique, to guarantee linear stability. The resulting SBP-SAT approximations lead to fully explicit ODE systems. The accuracy and stability properties are demonstrated for linear hyperbolic problems in 1D, and for the 2D linearised Euler equations with constant background flow. The newly derived upwind and staggered SBP operators lead to significantly more accurate numerical approximations, compared with the exclusive usage of (previously derived) central-difference first derivative SBP operators.

On-Line Algorithms and Reverse Mathematics

NASA Astrophysics Data System (ADS)

Harris, Seth

In this thesis, we classify the reverse-mathematical strength of sequential problems. If we are given a problem P of the form ∀X(alpha(X) → ∃Zbeta(X,Z)) then the corresponding sequential problem, SeqP, asserts the existence of infinitely many solutions to P: ∀X(∀nalpha(Xn) → ∃Z∀nbeta(X n,Zn)). P is typically provable in RCA0 if all objects involved are finite. SeqP, however, is only guaranteed to be provable in ACA0. In this thesis we exactly characterize which sequential problems are equivalent to RCA0, WKL0, or ACA0.. We say that a problem P is solvable by an on-line algorithm if P can be solved according to a two-player game, played by Alice and Bob, in which Bob has a winning strategy. Bob wins the game if Alice's sequence of plays 〈a0, ..., ak〉 and Bob's sequence of responses 〈 b0, ..., bk〉 constitute a solution to P. Formally, an on-line algorithm A is a function that inputs an admissible sequence of plays 〈a 0, b0, ..., aj〉 and outputs a new play bj for Bob. (This differs from the typical definition of "algorithm", though quite often a concrete set of instructions can be easily deduced from A.). We show that SeqP is provable in RCA0 precisely when P is solvable by an on-line algorithm. Schmerl proved this result specifically for the graph coloring problem; we generalize Schmerl's result to any problem that is on-line solvable. To prove our separation, we introduce a principle called Predictk(r) that is equivalent to -WKL0 for standard k, r.. We show that WKL0 is sufficient to prove SeqP precisely when P has a solvable closed kernel. This means that a solution exists, and each initial segment of this solution is a solution to the corresponding initial segment of the problem. (Certain bounding conditions are necessary as well.) If no such solution exists, then SeqP is equivalent to ACA0 over RCA 0 + ISigma02; RCA0 alone suffices if only sequences of standard length are considered. We use different techniques from Schmerl to prove this separation, and in the process we improve some of Schmerl's results on Grundy colorings. In Chapter 4 we analyze a variety of applications, classifying their sequential forms by reverse-mathematical strength. This builds upon similar work by Dorais and Hirst and Mummert. We consider combinatorial applications such as matching problems and Dilworth's theorems, and we also consider classic algorithms such as the task scheduling and paging problems. Tables summarizing our findings can be found at the end of Chapter 4.

Requirements to Design to Code: Towards a Fully Formal Approach to Automatic Code Generation

NASA Technical Reports Server (NTRS)

Hinchey, Michael G.; Rash, James L.; Rouff, Christopher A.

2005-01-01

A general-purpose method to mechanically transform system requirements into a provably equivalent model has yet to appear. Such a method represents a necessary step toward high-dependability system engineering for numerous possible application domains, including distributed software systems, sensor networks, robot operation, complex scripts for spacecraft integration and testing, and autonomous systems. Currently available tools and methods that start with a formal model of a system and mechanically produce a provably equivalent implementation are valuable but not sufficient. The gap that current tools and methods leave unfilled is that their formal models cannot be proven to be equivalent to the system requirements as originated by the customer. For the classes of systems whose behavior can be described as a finite (but significant) set of scenarios, we offer a method for mechanically transforming requirements (expressed in restricted natural language, or in other appropriate graphical notations) into a provably equivalent formal model that can be used as the basis for code generation and other transformations.

Requirements to Design to Code: Towards a Fully Formal Approach to Automatic Code Generation

NASA Technical Reports Server (NTRS)

Hinchey, Michael G.; Rash, James L.; Rouff, Christopher A.

2005-01-01

A general-purpose method to mechanically transform system requirements into a provably equivalent model has yet to appear. Such a method represents a necessary step toward high-dependability system engineering for numerous possible application domains, including distributed software systems, sensor networks, robot operation, complex scripts for spacecraft integration and testing, and autonomous systems. Currently available tools and methods that start with a formal model of a: system and mechanically produce a provably equivalent implementation are valuable but not sufficient. The "gap" that current tools and methods leave unfilled is that their formal models cannot be proven to be equivalent to the system requirements as originated by the customer. For the ciasses of systems whose behavior can be described as a finite (but significant) set of scenarios, we offer a method for mechanically transforming requirements (expressed in restricted natural language, or in other appropriate graphical notations) into a provably equivalent formal model that can be used as the basis for code generation and other transformations.

Diffusion archeology for diffusion progression history reconstruction.

PubMed

Sefer, Emre; Kingsford, Carl

2016-11-01

Diffusion through graphs can be used to model many real-world processes, such as the spread of diseases, social network memes, computer viruses, or water contaminants. Often, a real-world diffusion cannot be directly observed while it is occurring - perhaps it is not noticed until some time has passed, continuous monitoring is too costly, or privacy concerns limit data access. This leads to the need to reconstruct how the present state of the diffusion came to be from partial diffusion data. Here, we tackle the problem of reconstructing a diffusion history from one or more snapshots of the diffusion state. This ability can be invaluable to learn when certain computer nodes are infected or which people are the initial disease spreaders to control future diffusions. We formulate this problem over discrete-time SEIRS-type diffusion models in terms of maximum likelihood. We design methods that are based on submodularity and a novel prize-collecting dominating-set vertex cover (PCDSVC) relaxation that can identify likely diffusion steps with some provable performance guarantees. Our methods are the first to be able to reconstruct complete diffusion histories accurately in real and simulated situations. As a special case, they can also identify the initial spreaders better than the existing methods for that problem. Our results for both meme and contaminant diffusion show that the partial diffusion data problem can be overcome with proper modeling and methods, and that hidden temporal characteristics of diffusion can be predicted from limited data.

Diffusion archeology for diffusion progression history reconstruction

PubMed Central

Sefer, Emre; Kingsford, Carl

2015-01-01

Diffusion through graphs can be used to model many real-world processes, such as the spread of diseases, social network memes, computer viruses, or water contaminants. Often, a real-world diffusion cannot be directly observed while it is occurring — perhaps it is not noticed until some time has passed, continuous monitoring is too costly, or privacy concerns limit data access. This leads to the need to reconstruct how the present state of the diffusion came to be from partial diffusion data. Here, we tackle the problem of reconstructing a diffusion history from one or more snapshots of the diffusion state. This ability can be invaluable to learn when certain computer nodes are infected or which people are the initial disease spreaders to control future diffusions. We formulate this problem over discrete-time SEIRS-type diffusion models in terms of maximum likelihood. We design methods that are based on submodularity and a novel prize-collecting dominating-set vertex cover (PCDSVC) relaxation that can identify likely diffusion steps with some provable performance guarantees. Our methods are the first to be able to reconstruct complete diffusion histories accurately in real and simulated situations. As a special case, they can also identify the initial spreaders better than the existing methods for that problem. Our results for both meme and contaminant diffusion show that the partial diffusion data problem can be overcome with proper modeling and methods, and that hidden temporal characteristics of diffusion can be predicted from limited data. PMID:27821901

Sparse Tensor Decomposition for Haplotype Assembly of Diploids and Polyploids.

PubMed

Hashemi, Abolfazl; Zhu, Banghua; Vikalo, Haris

2018-03-21

Haplotype assembly is the task of reconstructing haplotypes of an individual from a mixture of sequenced chromosome fragments. Haplotype information enables studies of the effects of genetic variations on an organism's phenotype. Most of the mathematical formulations of haplotype assembly are known to be NP-hard and haplotype assembly becomes even more challenging as the sequencing technology advances and the length of the paired-end reads and inserts increases. Assembly of haplotypes polyploid organisms is considerably more difficult than in the case of diploids. Hence, scalable and accurate schemes with provable performance are desired for haplotype assembly of both diploid and polyploid organisms. We propose a framework that formulates haplotype assembly from sequencing data as a sparse tensor decomposition. We cast the problem as that of decomposing a tensor having special structural constraints and missing a large fraction of its entries into a product of two factors, U and [Formula: see text]; tensor [Formula: see text] reveals haplotype information while U is a sparse matrix encoding the origin of erroneous sequencing reads. An algorithm, AltHap, which reconstructs haplotypes of either diploid or polyploid organisms by iteratively solving this decomposition problem is proposed. The performance and convergence properties of AltHap are theoretically analyzed and, in doing so, guarantees on the achievable minimum error correction scores and correct phasing rate are established. The developed framework is applicable to diploid, biallelic and polyallelic polyploid species. The code for AltHap is freely available from https://github.com/realabolfazl/AltHap . AltHap was tested in a number of different scenarios and was shown to compare favorably to state-of-the-art methods in applications to haplotype assembly of diploids, and significantly outperforms existing techniques when applied to haplotype assembly of polyploids.

Linear {GLP}-algebras and their elementary theories

NASA Astrophysics Data System (ADS)

Pakhomov, F. N.

2016-12-01

The polymodal provability logic {GLP} was introduced by Japaridze in 1986. It is the provability logic of certain chains of provability predicates of increasing strength. Every polymodal logic corresponds to a variety of polymodal algebras. Beklemishev and Visser asked whether the elementary theory of the free {GLP}-algebra generated by the constants \\mathbf{0}, \\mathbf{1} is decidable [1]. For every positive integer n we solve the corresponding question for the logics {GLP}_n that are the fragments of {GLP} with n modalities. We prove that the elementary theory of the free {GLP}_n-algebra generated by the constants \\mathbf{0}, \\mathbf{1} is decidable for all n. We introduce the notion of a linear {GLP}_n-algebra and prove that all free {GLP}_n-algebras generated by the constants \\mathbf{0}, \\mathbf{1} are linear. We also consider the more general case of the logics {GLP}_α whose modalities are indexed by the elements of a linearly ordered set α: we define the notion of a linear algebra and prove the latter result in this case.

Data Confidentiality Challenges in Big Data Applications

DOE Office of Scientific and Technical Information (OSTI.GOV)

Yin, Jian; Zhao, Dongfang

In this paper, we address the problem of data confidentiality in big data analytics. In many fields, much useful patterns can be extracted by applying machine learning techniques to big data. However, data confidentiality must be protected. In many scenarios, data confidentiality could well be a prerequisite for data to be shared. We present a scheme to provide provable secure data confidentiality and discuss various techniques to optimize performance of such a system.

A Convex Approach to Fault Tolerant Control

NASA Technical Reports Server (NTRS)

Maghami, Peiman G.; Cox, David E.; Bauer, Frank (Technical Monitor)

2002-01-01

The design of control laws for dynamic systems with the potential for actuator failures is considered in this work. The use of Linear Matrix Inequalities allows more freedom in controller design criteria than typically available with robust control. This work proposes an extension of fault-scheduled control design techniques that can find a fixed controller with provable performance over a set of plants. Through convexity of the objective function, performance bounds on this set of plants implies performance bounds on a range of systems defined by a convex hull. This is used to incorporate performance bounds for a variety of soft and hard failures into the control design problem.

Provably unbounded memory advantage in stochastic simulation using quantum mechanics

NASA Astrophysics Data System (ADS)

Garner, Andrew J. P.; Liu, Qing; Thompson, Jayne; Vedral, Vlatko; Gu, mile

2017-10-01

Simulating the stochastic evolution of real quantities on a digital computer requires a trade-off between the precision to which these quantities are approximated, and the memory required to store them. The statistical accuracy of the simulation is thus generally limited by the internal memory available to the simulator. Here, using tools from computational mechanics, we show that quantum processors with a fixed finite memory can simulate stochastic processes of real variables to arbitrarily high precision. This demonstrates a provable, unbounded memory advantage that a quantum simulator can exhibit over its best possible classical counterpart.

Provably trustworthy systems.

PubMed

Klein, Gerwin; Andronick, June; Keller, Gabriele; Matichuk, Daniel; Murray, Toby; O'Connor, Liam

2017-10-13

We present recent work on building and scaling trustworthy systems with formal, machine-checkable proof from the ground up, including the operating system kernel, at the level of binary machine code. We first give a brief overview of the seL4 microkernel verification and how it can be used to build verified systems. We then show two complementary techniques for scaling these methods to larger systems: proof engineering, to estimate verification effort; and code/proof co-generation, for scalable development of provably trustworthy applications.This article is part of the themed issue 'Verified trustworthy software systems'. © 2017 The Author(s).

Exact Bayesian Inference for Phylogenetic Birth-Death Models.

PubMed

Parag, K V; Pybus, O G

2018-04-26

Inferring the rates of change of a population from a reconstructed phylogeny of genetic sequences is a central problem in macro-evolutionary biology, epidemiology, and many other disciplines. A popular solution involves estimating the parameters of a birth-death process (BDP), which links the shape of the phylogeny to its birth and death rates. Modern BDP estimators rely on random Markov chain Monte Carlo (MCMC) sampling to infer these rates. Such methods, while powerful and scalable, cannot be guaranteed to converge, leading to results that may be hard to replicate or difficult to validate. We present a conceptually and computationally different parametric BDP inference approach using flexible and easy to implement Snyder filter (SF) algorithms. This method is deterministic so its results are provable, guaranteed, and reproducible. We validate the SF on constant rate BDPs and find that it solves BDP likelihoods known to produce robust estimates. We then examine more complex BDPs with time-varying rates. Our estimates compare well with a recently developed parametric MCMC inference method. Lastly, we performmodel selection on an empirical Agamid species phylogeny, obtaining results consistent with the literature. The SF makes no approximations, beyond those required for parameter quantisation and numerical integration, and directly computes the posterior distribution of model parameters. It is a promising alternative inference algorithm that may serve either as a standalone Bayesian estimator or as a useful diagnostic reference for validating more involved MCMC strategies. The Snyder filter is implemented in Matlab and the time-varying BDP models are simulated in R. The source code and data are freely available at https://github.com/kpzoo/snyder-birth-death-code. kris.parag@zoo.ox.ac.uk. Supplementary material is available at Bioinformatics online.

A new graph-based method for pairwise global network alignment

PubMed Central

Klau, Gunnar W

2009-01-01

Background In addition to component-based comparative approaches, network alignments provide the means to study conserved network topology such as common pathways and more complex network motifs. Yet, unlike in classical sequence alignment, the comparison of networks becomes computationally more challenging, as most meaningful assumptions instantly lead to NP-hard problems. Most previous algorithmic work on network alignments is heuristic in nature. Results We introduce the graph-based maximum structural matching formulation for pairwise global network alignment. We relate the formulation to previous work and prove NP-hardness of the problem. Based on the new formulation we build upon recent results in computational structural biology and present a novel Lagrangian relaxation approach that, in combination with a branch-and-bound method, computes provably optimal network alignments. The Lagrangian algorithm alone is a powerful heuristic method, which produces solutions that are often near-optimal and – unlike those computed by pure heuristics – come with a quality guarantee. Conclusion Computational experiments on the alignment of protein-protein interaction networks and on the classification of metabolic subnetworks demonstrate that the new method is reasonably fast and has advantages over pure heuristics. Our software tool is freely available as part of the LISA library. PMID:19208162

The HACMS program: using formal methods to eliminate exploitable bugs

PubMed Central

Launchbury, John; Richards, Raymond

2017-01-01

For decades, formal methods have offered the promise of verified software that does not have exploitable bugs. Until recently, however, it has not been possible to verify software of sufficient complexity to be useful. Recently, that situation has changed. SeL4 is an open-source operating system microkernel efficient enough to be used in a wide range of practical applications. Its designers proved it to be fully functionally correct, ensuring the absence of buffer overflows, null pointer exceptions, use-after-free errors, etc., and guaranteeing integrity and confidentiality. The CompCert Verifying C Compiler maps source C programs to provably equivalent assembly language, ensuring the absence of exploitable bugs in the compiler. A number of factors have enabled this revolution, including faster processors, increased automation, more extensive infrastructure, specialized logics and the decision to co-develop code and correctness proofs rather than verify existing artefacts. In this paper, we explore the promise and limitations of current formal-methods techniques. We discuss these issues in the context of DARPA’s HACMS program, which had as its goal the creation of high-assurance software for vehicles, including quadcopters, helicopters and automobiles. This article is part of the themed issue ‘Verified trustworthy software systems’. PMID:28871050

Differentially private distributed logistic regression using private and public data.

PubMed

Ji, Zhanglong; Jiang, Xiaoqian; Wang, Shuang; Xiong, Li; Ohno-Machado, Lucila

2014-01-01

Privacy protecting is an important issue in medical informatics and differential privacy is a state-of-the-art framework for data privacy research. Differential privacy offers provable privacy against attackers who have auxiliary information, and can be applied to data mining models (for example, logistic regression). However, differentially private methods sometimes introduce too much noise and make outputs less useful. Given available public data in medical research (e.g. from patients who sign open-consent agreements), we can design algorithms that use both public and private data sets to decrease the amount of noise that is introduced. In this paper, we modify the update step in Newton-Raphson method to propose a differentially private distributed logistic regression model based on both public and private data. We try our algorithm on three different data sets, and show its advantage over: (1) a logistic regression model based solely on public data, and (2) a differentially private distributed logistic regression model based on private data under various scenarios. Logistic regression models built with our new algorithm based on both private and public datasets demonstrate better utility than models that trained on private or public datasets alone without sacrificing the rigorous privacy guarantee.

Computing Generalized Matrix Inverse on Spiking Neural Substrate.

PubMed

Shukla, Rohit; Khoram, Soroosh; Jorgensen, Erik; Li, Jing; Lipasti, Mikko; Wright, Stephen

2018-01-01

Emerging neural hardware substrates, such as IBM's TrueNorth Neurosynaptic System, can provide an appealing platform for deploying numerical algorithms. For example, a recurrent Hopfield neural network can be used to find the Moore-Penrose generalized inverse of a matrix, thus enabling a broad class of linear optimizations to be solved efficiently, at low energy cost. However, deploying numerical algorithms on hardware platforms that severely limit the range and precision of representation for numeric quantities can be quite challenging. This paper discusses these challenges and proposes a rigorous mathematical framework for reasoning about range and precision on such substrates. The paper derives techniques for normalizing inputs and properly quantizing synaptic weights originating from arbitrary systems of linear equations, so that solvers for those systems can be implemented in a provably correct manner on hardware-constrained neural substrates. The analytical model is empirically validated on the IBM TrueNorth platform, and results show that the guarantees provided by the framework for range and precision hold under experimental conditions. Experiments with optical flow demonstrate the energy benefits of deploying a reduced-precision and energy-efficient generalized matrix inverse engine on the IBM TrueNorth platform, reflecting 10× to 100× improvement over FPGA and ARM core baselines.

Approximate Algorithms for Computing Spatial Distance Histograms with Accuracy Guarantees

PubMed Central

Grupcev, Vladimir; Yuan, Yongke; Tu, Yi-Cheng; Huang, Jin; Chen, Shaoping; Pandit, Sagar; Weng, Michael

2014-01-01

Particle simulation has become an important research tool in many scientific and engineering fields. Data generated by such simulations impose great challenges to database storage and query processing. One of the queries against particle simulation data, the spatial distance histogram (SDH) query, is the building block of many high-level analytics, and requires quadratic time to compute using a straightforward algorithm. Previous work has developed efficient algorithms that compute exact SDHs. While beating the naive solution, such algorithms are still not practical in processing SDH queries against large-scale simulation data. In this paper, we take a different path to tackle this problem by focusing on approximate algorithms with provable error bounds. We first present a solution derived from the aforementioned exact SDH algorithm, and this solution has running time that is unrelated to the system size N. We also develop a mathematical model to analyze the mechanism that leads to errors in the basic approximate algorithm. Our model provides insights on how the algorithm can be improved to achieve higher accuracy and efficiency. Such insights give rise to a new approximate algorithm with improved time/accuracy tradeoff. Experimental results confirm our analysis. PMID:24693210

The HACMS program: using formal methods to eliminate exploitable bugs.

PubMed

Fisher, Kathleen; Launchbury, John; Richards, Raymond

2017-10-13

For decades, formal methods have offered the promise of verified software that does not have exploitable bugs. Until recently, however, it has not been possible to verify software of sufficient complexity to be useful. Recently, that situation has changed. SeL4 is an open-source operating system microkernel efficient enough to be used in a wide range of practical applications. Its designers proved it to be fully functionally correct, ensuring the absence of buffer overflows, null pointer exceptions, use-after-free errors, etc., and guaranteeing integrity and confidentiality. The CompCert Verifying C Compiler maps source C programs to provably equivalent assembly language, ensuring the absence of exploitable bugs in the compiler. A number of factors have enabled this revolution, including faster processors, increased automation, more extensive infrastructure, specialized logics and the decision to co-develop code and correctness proofs rather than verify existing artefacts. In this paper, we explore the promise and limitations of current formal-methods techniques. We discuss these issues in the context of DARPA's HACMS program, which had as its goal the creation of high-assurance software for vehicles, including quadcopters, helicopters and automobiles.This article is part of the themed issue 'Verified trustworthy software systems'. © 2017 The Authors.

Systems, methods and apparatus for generation and verification of policies in autonomic computing systems

NASA Technical Reports Server (NTRS)

Rouff, Christopher A. (Inventor); Sterritt, Roy (Inventor); Truszkowski, Walter F. (Inventor); Hinchey, Michael G. (Inventor); Gracanin, Denis (Inventor); Rash, James L. (Inventor)

2011-01-01

Described herein is a method that produces fully (mathematically) tractable development of policies for autonomic systems from requirements through to code generation. This method is illustrated through an example showing how user formulated policies can be translated into a formal mode which can then be converted to code. The requirements-based programming method described provides faster, higher quality development and maintenance of autonomic systems based on user formulation of policies.Further, the systems, methods and apparatus described herein provide a way of analyzing policies for autonomic systems and facilities the generation of provably correct implementations automatically, which in turn provides reduced development time, reduced testing requirements, guarantees of correctness of the implementation with respect to the policies specified at the outset, and provides a higher degree of confidence that the policies are both complete and reasonable. The ability to specify the policy for the management of a system and then automatically generate an equivalent implementation greatly improves the quality of software, the survivability of future missions, in particular when the system will operate untended in very remote environments, and greatly reduces development lead times and costs.

Evaluating the effects of real power losses in optimal power flow based storage integration

DOE PAGES

Castillo, Anya; Gayme, Dennice

2017-03-27

This study proposes a DC optimal power flow (DCOPF) with losses formulation (the `-DCOPF+S problem) and uses it to investigate the role of real power losses in OPF based grid-scale storage integration. We derive the `- DCOPF+S problem by augmenting a standard DCOPF with storage (DCOPF+S) problem to include quadratic real power loss approximations. This procedure leads to a multi-period nonconvex quadratically constrained quadratic program, which we prove can be solved to optimality using either a semidefinite or second order cone relaxation. Our approach has some important benefits over existing models. It is more computationally tractable than ACOPF with storagemore » (ACOPF+S) formulations and the provably exact convex relaxations guarantee that an optimal solution can be attained for a feasible problem. Adding loss approximations to a DCOPF+S model leads to a more accurate representation of locational marginal prices, which have been shown to be critical to determining optimal storage dispatch and siting in prior ACOPF+S based studies. Case studies demonstrate the improved accuracy of the `-DCOPF+S model over a DCOPF+S model and the computational advantages over an ACOPF+S formulation.« less

Convex relaxations for gas expansion planning

DOE PAGES

Borraz-Sanchez, Conrado; Bent, Russell Whitford; Backhaus, Scott N.; ...

2016-01-01

Expansion of natural gas networks is a critical process involving substantial capital expenditures with complex decision-support requirements. Here, given the non-convex nature of gas transmission constraints, global optimality and infeasibility guarantees can only be offered by global optimisation approaches. Unfortunately, state-of-the-art global optimisation solvers are unable to scale up to real-world size instances. In this study, we present a convex mixed-integer second-order cone relaxation for the gas expansion planning problem under steady-state conditions. The underlying model offers tight lower bounds with high computational efficiency. In addition, the optimal solution of the relaxation can often be used to derive high-quality solutionsmore » to the original problem, leading to provably tight optimality gaps and, in some cases, global optimal solutions. The convex relaxation is based on a few key ideas, including the introduction of flux direction variables, exact McCormick relaxations, on/off constraints, and integer cuts. Numerical experiments are conducted on the traditional Belgian gas network, as well as other real larger networks. The results demonstrate both the accuracy and computational speed of the relaxation and its ability to produce high-quality solution« less

Empirical Analysis of Using Erasure Coding in Outsourcing Data Storage With Provable Security

DTIC Science & Technology

2016-06-01

the fastest encoding performance among the four tested schemes. We expected to observe that Cauchy Reed-Solomonwould be faster than Reed- Solomon for all...providing recoverability for POR. We survey MDS codes and select Reed- Solomon and Cauchy Reed- Solomon MDS codes to be implemented into a prototype POR...tools providing recoverability for POR. We survey MDS codes and select Reed- Solomon and Cauchy Reed- Solomon MDS codes to be implemented into a

78 FR 25444 - Federal Acquisition Regulation; Submission for OMB Review; Bid Guarantees, Performance and...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-05-01

...; Submission for OMB Review; Bid Guarantees, Performance and Payment Bonds, and Alternative Payment Protections... concerning bid guarantees, performance and payment bonds, and alternative payment protections. A notice was...- 0045, Bid Guarantees, Performance, and Payment Bonds, and Alternative Payment Protections by any of the...

A provably-secure ECC-based authentication scheme for wireless sensor networks.

PubMed

Nam, Junghyun; Kim, Moonseong; Paik, Juryon; Lee, Youngsook; Won, Dongho

2014-11-06

A smart-card-based user authentication scheme for wireless sensor networks (in short, a SUA-WSN scheme) is designed to restrict access to the sensor data only to users who are in possession of both a smart card and the corresponding password. While a significant number of SUA-WSN schemes have been suggested in recent years, their intended security properties lack formal definitions and proofs in a widely-accepted model. One consequence is that SUA-WSN schemes insecure against various attacks have proliferated. In this paper, we devise a security model for the analysis of SUA-WSN schemes by extending the widely-accepted model of Bellare, Pointcheval and Rogaway (2000). Our model provides formal definitions of authenticated key exchange and user anonymity while capturing side-channel attacks, as well as other common attacks. We also propose a new SUA-WSN scheme based on elliptic curve cryptography (ECC), and prove its security properties in our extended model. To the best of our knowledge, our proposed scheme is the first SUA-WSN scheme that provably achieves both authenticated key exchange and user anonymity. Our scheme is also computationally competitive with other ECC-based (non-provably secure) schemes.

A Provably-Secure ECC-Based Authentication Scheme for Wireless Sensor Networks

PubMed Central

Nam, Junghyun; Kim, Moonseong; Paik, Juryon; Lee, Youngsook; Won, Dongho

2014-01-01

A smart-card-based user authentication scheme for wireless sensor networks (in short, a SUA-WSN scheme) is designed to restrict access to the sensor data only to users who are in possession of both a smart card and the corresponding password. While a significant number of SUA-WSN schemes have been suggested in recent years, their intended security properties lack formal definitions and proofs in a widely-accepted model. One consequence is that SUA-WSN schemes insecure against various attacks have proliferated. In this paper, we devise a security model for the analysis of SUA-WSN schemes by extending the widely-accepted model of Bellare, Pointcheval and Rogaway (2000). Our model provides formal definitions of authenticated key exchange and user anonymity while capturing side-channel attacks, as well as other common attacks. We also propose a new SUA-WSN scheme based on elliptic curve cryptography (ECC), and prove its security properties in our extended model. To the best of our knowledge, our proposed scheme is the first SUA-WSN scheme that provably achieves both authenticated key exchange and user anonymity. Our scheme is also computationally competitive with other ECC-based (non-provably secure) schemes. PMID:25384009

Formal Requirements-Based Programming for Complex Systems

NASA Technical Reports Server (NTRS)

Rash, James L.; Hinchey, Michael G.; Rouff, Christopher A.; Gracanin, Denis

2005-01-01

Computer science as a field has not yet produced a general method to mechanically transform complex computer system requirements into a provably equivalent implementation. Such a method would be one major step towards dealing with complexity in computing, yet it remains the elusive holy grail of system development. Currently available tools and methods that start with a formal model of a system and mechanically produce a provably equivalent implementation are valuable but not sufficient. The gap that such tools and methods leave unfilled is that the formal models cannot be proven to be equivalent to the system requirements as originated by the customer For the classes of complex systems whose behavior can be described as a finite (but significant) set of scenarios, we offer a method for mechanically transforming requirements (expressed in restricted natural language, or appropriate graphical notations) into a provably equivalent formal model that can be used as the basis for code generation and other transformations. While other techniques are available, this method is unique in offering full mathematical tractability while using notations and techniques that are well known and well trusted. We illustrate the application of the method to an example procedure from the Hubble Robotic Servicing Mission currently under study and preliminary formulation at NASA Goddard Space Flight Center.

Input-Guarantee Versus Performance-Guarantee Approaches to School Accountability: Cross-State Comparisons of Policies, Resources, and Outcomes

ERIC Educational Resources Information Center

Lee, Jaekyung

2006-01-01

States' policy approaches to accountability tend to divide between a primary emphasis on input guarantees and a primary emphasis on performance guarantees. In the midst of keen controversies about the impact of high-stakes testing under the No Child Left Behind Act, this article examines separate and joint effects of input-guarantee versus…

Differentially private distributed logistic regression using private and public data

PubMed Central

2014-01-01

Background Privacy protecting is an important issue in medical informatics and differential privacy is a state-of-the-art framework for data privacy research. Differential privacy offers provable privacy against attackers who have auxiliary information, and can be applied to data mining models (for example, logistic regression). However, differentially private methods sometimes introduce too much noise and make outputs less useful. Given available public data in medical research (e.g. from patients who sign open-consent agreements), we can design algorithms that use both public and private data sets to decrease the amount of noise that is introduced. Methodology In this paper, we modify the update step in Newton-Raphson method to propose a differentially private distributed logistic regression model based on both public and private data. Experiments and results We try our algorithm on three different data sets, and show its advantage over: (1) a logistic regression model based solely on public data, and (2) a differentially private distributed logistic regression model based on private data under various scenarios. Conclusion Logistic regression models built with our new algorithm based on both private and public datasets demonstrate better utility than models that trained on private or public datasets alone without sacrificing the rigorous privacy guarantee. PMID:25079786

Computing Generalized Matrix Inverse on Spiking Neural Substrate

PubMed Central

Shukla, Rohit; Khoram, Soroosh; Jorgensen, Erik; Li, Jing; Lipasti, Mikko; Wright, Stephen

2018-01-01

Emerging neural hardware substrates, such as IBM's TrueNorth Neurosynaptic System, can provide an appealing platform for deploying numerical algorithms. For example, a recurrent Hopfield neural network can be used to find the Moore-Penrose generalized inverse of a matrix, thus enabling a broad class of linear optimizations to be solved efficiently, at low energy cost. However, deploying numerical algorithms on hardware platforms that severely limit the range and precision of representation for numeric quantities can be quite challenging. This paper discusses these challenges and proposes a rigorous mathematical framework for reasoning about range and precision on such substrates. The paper derives techniques for normalizing inputs and properly quantizing synaptic weights originating from arbitrary systems of linear equations, so that solvers for those systems can be implemented in a provably correct manner on hardware-constrained neural substrates. The analytical model is empirically validated on the IBM TrueNorth platform, and results show that the guarantees provided by the framework for range and precision hold under experimental conditions. Experiments with optical flow demonstrate the energy benefits of deploying a reduced-precision and energy-efficient generalized matrix inverse engine on the IBM TrueNorth platform, reflecting 10× to 100× improvement over FPGA and ARM core baselines. PMID:29593483

Air traffic surveillance and control using hybrid estimation and protocol-based conflict resolution

NASA Astrophysics Data System (ADS)

Hwang, Inseok

The continued growth of air travel and recent advances in new technologies for navigation, surveillance, and communication have led to proposals by the Federal Aviation Administration (FAA) to provide reliable and efficient tools to aid Air Traffic Control (ATC) in performing their tasks. In this dissertation, we address four problems frequently encountered in air traffic surveillance and control; multiple target tracking and identity management, conflict detection, conflict resolution, and safety verification. We develop a set of algorithms and tools to aid ATC; These algorithms have the provable properties of safety, computational efficiency, and convergence. Firstly, we develop a multiple-maneuvering-target tracking and identity management algorithm which can keep track of maneuvering aircraft in noisy environments and of their identities. Secondly, we propose a hybrid probabilistic conflict detection algorithm between multiple aircraft which uses flight mode estimates as well as aircraft current state estimates. Our algorithm is based on hybrid models of aircraft, which incorporate both continuous dynamics and discrete mode switching. Thirdly, we develop an algorithm for multiple (greater than two) aircraft conflict avoidance that is based on a closed-form analytic solution and thus provides guarantees of safety. Finally, we consider the problem of safety verification of control laws for safety critical systems, with application to air traffic control systems. We approach safety verification through reachability analysis, which is a computationally expensive problem. We develop an over-approximate method for reachable set computation using polytopic approximation methods and dynamic optimization. These algorithms may be used either in a fully autonomous way, or as supporting tools to increase controllers' situational awareness and to reduce their work load.

7 CFR 2201.25 - Performance Agreement.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 7 Agriculture 15 2010-01-01 2010-01-01 false Performance Agreement. 2201.25 Section 2201.25... LOCAL TELEVISION LOAN GUARANTEE PROGRAM-PROGRAM REGULATIONS Loan Guarantees § 2201.25 Performance Agreement. (a) The Borrower of a Loan guaranteed under the Program shall enter into a Performance Agreement...

7 CFR 2201.25 - Performance Agreement.

Code of Federal Regulations, 2012 CFR

2012-01-01

... 7 Agriculture 15 2012-01-01 2012-01-01 false Performance Agreement. 2201.25 Section 2201.25... LOCAL TELEVISION LOAN GUARANTEE PROGRAM-PROGRAM REGULATIONS Loan Guarantees § 2201.25 Performance Agreement. (a) The Borrower of a Loan guaranteed under the Program shall enter into a Performance Agreement...

7 CFR 2201.25 - Performance Agreement.

Code of Federal Regulations, 2013 CFR

2013-01-01

... 7 Agriculture 15 2013-01-01 2013-01-01 false Performance Agreement. 2201.25 Section 2201.25... LOCAL TELEVISION LOAN GUARANTEE PROGRAM-PROGRAM REGULATIONS Loan Guarantees § 2201.25 Performance Agreement. (a) The Borrower of a Loan guaranteed under the Program shall enter into a Performance Agreement...

Audit Mechanisms for Provable Risk Management and Accountable Data Governance

DTIC Science & Technology

2012-09-04

the same violation) and the effectiveness of policy interventions (e.g., data breach notification laws and government audits) in encouraging organizations to adopt accountable data governance practices.

One Size Doesn’t Fit All: Measuring Individual Privacy in Aggregate Genomic Data

PubMed Central

Simmons, Sean; Berger, Bonnie

2017-01-01

Even in the aggregate, genomic data can reveal sensitive information about individuals. We present a new model-based measure, PrivMAF, that provides provable privacy guarantees for aggregate data (namely minor allele frequencies) obtained from genomic studies. Unlike many previous measures that have been designed to measure the total privacy lost by all participants in a study, PrivMAF gives an individual privacy measure for each participant in the study, not just an average measure. These individual measures can then be combined to measure the worst case privacy loss in the study. Our measure also allows us to quantify the privacy gains achieved by perturbing the data, either by adding noise or binning. Our findings demonstrate that both perturbation approaches offer significant privacy gains. Moreover, we see that these privacy gains can be achieved while minimizing perturbation (and thus maximizing the utility) relative to stricter notions of privacy, such as differential privacy. We test PrivMAF using genotype data from the Wellcome Trust Case Control Consortium, providing a more nuanced understanding of the privacy risks involved in an actual genome-wide association studies. Interestingly, our analysis demonstrates that the privacy implications of releasing MAFs from a study can differ greatly from individual to individual. An implementation of our method is available at http://privmaf.csail.mit.edu. PMID:29202050

Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs

NASA Astrophysics Data System (ADS)

Alias, Christophe; Darte, Alain; Feautrier, Paul; Gonnord, Laure

Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a well-founded set, which strictly decreases at each program step. A standard method to automatically generate such a function is to compute invariants for each program point and to search for a ranking in a restricted class of functions that can be handled with linear programming techniques. Previous algorithms based on affine rankings either are applicable only to simple loops (i.e., single-node flowcharts) and rely on enumeration, or are not complete in the sense that they are not guaranteed to find a ranking in the class of functions they consider, if one exists. Our first contribution is to propose an efficient algorithm to compute ranking functions: It can handle flowcharts of arbitrary structure, the class of candidate rankings it explores is larger, and our method, although greedy, is provably complete. Our second contribution is to show how to use the ranking functions we generate to get upper bounds for the computational complexity (number of transitions) of the source program. This estimate is a polynomial, which means that we can handle programs with more than linear complexity. We applied the method on a collection of test cases from the literature. We also show the links and differences with previous techniques based on the insertion of counters.

Dynamic earthquake rupture simulation on nonplanar faults embedded in 3D geometrically complex, heterogeneous Earth models

NASA Astrophysics Data System (ADS)

Duru, K.; Dunham, E. M.; Bydlon, S. A.; Radhakrishnan, H.

2014-12-01

Dynamic propagation of shear ruptures on a frictional interface is a useful idealization of a natural earthquake.The conditions relating slip rate and fault shear strength are often expressed as nonlinear friction laws.The corresponding initial boundary value problems are both numerically and computationally challenging.In addition, seismic waves generated by earthquake ruptures must be propagated, far away from fault zones, to seismic stations and remote areas.Therefore, reliable and efficient numerical simulations require both provably stable and high order accurate numerical methods.We present a numerical method for:a) enforcing nonlinear friction laws, in a consistent and provably stable manner, suitable for efficient explicit time integration;b) dynamic propagation of earthquake ruptures along rough faults; c) accurate propagation of seismic waves in heterogeneous media with free surface topography.We solve the first order form of the 3D elastic wave equation on a boundary-conforming curvilinear mesh, in terms of particle velocities and stresses that are collocated in space and time, using summation-by-parts finite differences in space. The finite difference stencils are 6th order accurate in the interior and 3rd order accurate close to the boundaries. Boundary and interface conditions are imposed weakly using penalties. By deriving semi-discrete energy estimates analogous to the continuous energy estimates we prove numerical stability. Time stepping is performed with a 4th order accurate explicit low storage Runge-Kutta scheme. We have performed extensive numerical experiments using a slip-weakening friction law on non-planar faults, including recent SCEC benchmark problems. We also show simulations on fractal faults revealing the complexity of rupture dynamics on rough faults. We are presently extending our method to rate-and-state friction laws and off-fault plasticity.

Sustainable IT and IT for Sustainability

NASA Astrophysics Data System (ADS)

Liu, Zhenhua

Energy and sustainability have become one of the most critical issues of our generation. While the abundant potential of renewable energy such as solar and wind provides a real opportunity for sustainability, their intermittency and uncertainty present a daunting operating challenge. This thesis aims to develop analytical models, deployable algorithms, and real systems to enable efficient integration of renewable energy into complex distributed systems with limited information. The first thrust of the thesis is to make IT systems more sustainable by facilitating the integration of renewable energy into these systems. IT represents the fastest growing sectors in energy usage and greenhouse gas pollution. Over the last decade there are dramatic improvements in the energy efficiency of IT systems, but the efficiency improvements do not necessarily lead to reduction in energy consumption because more servers are demanded. Further, little effort has been put in making IT more sustainable, and most of the improvements are from improved "engineering" rather than improved "algorithms". In contrast, my work focuses on developing algorithms with rigorous theoretical analysis that improve the sustainability of IT. In particular, this thesis seeks to exploit the flexibilities of cloud workloads both (i) in time by scheduling delay-tolerant workloads and (ii) in space by routing requests to geographically diverse data centers. These opportunities allow data centers to adaptively respond to renewable availability, varying cooling efficiency, and fluctuating energy prices, while still meeting performance requirements. The design of the enabling algorithms is however very challenging because of limited information, non-smooth objective functions and the need for distributed control. Novel distributed algorithms are developed with theoretically provable guarantees to enable the "follow the renewables" routing. Moving from theory to practice, I helped HP design and implement industry's first Net-zero Energy Data Center. The second thrust of this thesis is to use IT systems to improve the sustainability and efficiency of our energy infrastructure through data center demand response. The main challenges as we integrate more renewable sources to the existing power grid come from the fluctuation and unpredictability of renewable generation. Although energy storage and reserves can potentially solve the issues, they are very costly. One promising alternative is to make the cloud data centers demand responsive. The potential of such an approach is huge. To realize this potential, we need adaptive and distributed control of cloud data centers and new electricity market designs for distributed electricity resources. My work is progressing in both directions. In particular, I have designed online algorithms with theoretically guaranteed performance for data center operators to deal with uncertainties under popular demand response programs. Based on local control rules of customers, I have further designed new pricing schemes for demand response to align the interests of customers, utility companies, and the society to improve social welfare.

CHRR: coordinate hit-and-run with rounding for uniform sampling of constraint-based models

DOE Office of Scientific and Technical Information (OSTI.GOV)

Haraldsdóttir, Hulda S.; Cousins, Ben; Thiele, Ines

In constraint-based metabolic modelling, physical and biochemical constraints define a polyhedral convex set of feasible flux vectors. Uniform sampling of this set provides an unbiased characterization of the metabolic capabilities of a biochemical network. However, reliable uniform sampling of genome-scale biochemical networks is challenging due to their high dimensionality and inherent anisotropy. Here, we present an implementation of a new sampling algorithm, coordinate hit-and-run with rounding (CHRR). This algorithm is based on the provably efficient hit-and-run random walk and crucially uses a preprocessing step to round the anisotropic flux set. CHRR provably converges to a uniform stationary sampling distribution. Wemore » apply it to metabolic networks of increasing dimensionality. We show that it converges several times faster than a popular artificial centering hit-and-run algorithm, enabling reliable and tractable sampling of genome-scale biochemical networks.« less

CHRR: coordinate hit-and-run with rounding for uniform sampling of constraint-based models

DOE PAGES

Haraldsdóttir, Hulda S.; Cousins, Ben; Thiele, Ines; ...

2017-01-31

In constraint-based metabolic modelling, physical and biochemical constraints define a polyhedral convex set of feasible flux vectors. Uniform sampling of this set provides an unbiased characterization of the metabolic capabilities of a biochemical network. However, reliable uniform sampling of genome-scale biochemical networks is challenging due to their high dimensionality and inherent anisotropy. Here, we present an implementation of a new sampling algorithm, coordinate hit-and-run with rounding (CHRR). This algorithm is based on the provably efficient hit-and-run random walk and crucially uses a preprocessing step to round the anisotropic flux set. CHRR provably converges to a uniform stationary sampling distribution. Wemore » apply it to metabolic networks of increasing dimensionality. We show that it converges several times faster than a popular artificial centering hit-and-run algorithm, enabling reliable and tractable sampling of genome-scale biochemical networks.« less

An Efficient User Authentication and User Anonymity Scheme with Provably Security for IoT-Based Medical Care System.

PubMed

Li, Chun-Ta; Wu, Tsu-Yang; Chen, Chin-Ling; Lee, Cheng-Chi; Chen, Chien-Ming

2017-06-23

In recent years, with the increase in degenerative diseases and the aging population in advanced countries, demands for medical care of older or solitary people have increased continually in hospitals and healthcare institutions. Applying wireless sensor networks for the IoT-based telemedicine system enables doctors, caregivers or families to monitor patients' physiological conditions at anytime and anyplace according to the acquired information. However, transmitting physiological data through the Internet concerns the personal privacy of patients. Therefore, before users can access medical care services in IoT-based medical care system, they must be authenticated. Typically, user authentication and data encryption are most critical for securing network communications over a public channel between two or more participants. In 2016, Liu and Chung proposed a bilinear pairing-based password authentication scheme for wireless healthcare sensor networks. They claimed their authentication scheme cannot only secure sensor data transmission, but also resist various well-known security attacks. In this paper, we demonstrate that Liu-Chung's scheme has some security weaknesses, and we further present an improved secure authentication and data encryption scheme for the IoT-based medical care system, which can provide user anonymity and prevent the security threats of replay and password/sensed data disclosure attacks. Moreover, we modify the authentication process to reduce redundancy in protocol design, and the proposed scheme is more efficient in performance compared with previous related schemes. Finally, the proposed scheme is provably secure in the random oracle model under ECDHP.

Trusted Storage: Putting Security and Data Together

NASA Astrophysics Data System (ADS)

Willett, Michael; Anderson, Dave

State and Federal breach notification legislation mandates that the affected parties be notified in case of a breach of sensitive personal data, unless the data was provably encrypted. Self-encrypting hard drives provide the superior solution for encrypting data-at-rest when compared to software-based solutions. Self-encrypting hard drives, from the laptop to the data center, have been standardized across the hard drive industry by the Trusted Computing Group. Advantages include: simplified management (including keys), no performance impact, quick data erasure and drive re-purposing, no interference with end-to-end data integrity metrics, always encrypting, no cipher-text exposure, and scalability in large data centers.

Exact solution of large asymmetric traveling salesman problems.

PubMed

Miller, D L; Pekny, J F

1991-02-15

The traveling salesman problem is one of a class of difficult problems in combinatorial optimization that is representative of a large number of important scientific and engineering problems. A survey is given of recent applications and methods for solving large problems. In addition, an algorithm for the exact solution of the asymmetric traveling salesman problem is presented along with computational results for several classes of problems. The results show that the algorithm performs remarkably well for some classes of problems, determining an optimal solution even for problems with large numbers of cities, yet for other classes, even small problems thwart determination of a provably optimal solution.

77 FR 61580 - Federal Acquisition Regulation; Information Collection; Bid Guarantees, Performance and Payment...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-10-10

..., Performance and Payment Bonds, and Alternative Payment Protections AGENCY: Department of Defense (DOD... previously approved information collection requirement concerning bid guarantees, performance and payment... collection of information is necessary for the proper performance of functions of the Federal Acquisition...

48 CFR 970.0970 - Performance guarantees.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 48 Federal Acquisition Regulations System 5 2013-10-01 2013-10-01 false Performance guarantees. 970.0970 Section 970.0970 Federal Acquisition Regulations System DEPARTMENT OF ENERGY AGENCY SUPPLEMENTARY REGULATIONS DOE MANAGEMENT AND OPERATING CONTRACTS Contractor Qualifications 970.0970 Performance...

48 CFR 970.0970 - Performance guarantees.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 48 Federal Acquisition Regulations System 5 2014-10-01 2014-10-01 false Performance guarantees. 970.0970 Section 970.0970 Federal Acquisition Regulations System DEPARTMENT OF ENERGY AGENCY SUPPLEMENTARY REGULATIONS DOE MANAGEMENT AND OPERATING CONTRACTS Contractor Qualifications 970.0970 Performance...

48 CFR 970.0970 - Performance guarantees.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 48 Federal Acquisition Regulations System 5 2012-10-01 2012-10-01 false Performance guarantees. 970.0970 Section 970.0970 Federal Acquisition Regulations System DEPARTMENT OF ENERGY AGENCY SUPPLEMENTARY REGULATIONS DOE MANAGEMENT AND OPERATING CONTRACTS Contractor Qualifications 970.0970 Performance...

48 CFR 970.0970 - Performance guarantees.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 48 Federal Acquisition Regulations System 5 2010-10-01 2010-10-01 false Performance guarantees. 970.0970 Section 970.0970 Federal Acquisition Regulations System DEPARTMENT OF ENERGY AGENCY SUPPLEMENTARY REGULATIONS DOE MANAGEMENT AND OPERATING CONTRACTS Contractor Qualifications 970.0970 Performance...

The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks

NASA Astrophysics Data System (ADS)

Ristenpart, Thomas; Yilek, Scott

Multiparty signature protocols need protection against rogue-key attacks, made possible whenever an adversary can choose its public key(s) arbitrarily. For many schemes, provable security has only been established under the knowledge of secret key (KOSK) assumption where the adversary is required to reveal the secret keys it utilizes. In practice, certifying authorities rarely require the strong proofs of knowledge of secret keys required to substantiate the KOSK assumption. Instead, proofs of possession (POPs) are required and can be as simple as just a signature over the certificate request message. We propose a general registered key model, within which we can model both the KOSK assumption and in-use POP protocols. We show that simple POP protocols yield provable security of Boldyreva's multisignature scheme [11], the LOSSW multisignature scheme [28], and a 2-user ring signature scheme due to Bender, Katz, and Morselli [10]. Our results are the first to provide formal evidence that POPs can stop rogue-key attacks.

Neural-Learning-Based Telerobot Control With Guaranteed Performance.

PubMed

Yang, Chenguang; Wang, Xinyu; Cheng, Long; Ma, Hongbin

2017-10-01

In this paper, a neural networks (NNs) enhanced telerobot control system is designed and tested on a Baxter robot. Guaranteed performance of the telerobot control system is achieved at both kinematic and dynamic levels. At kinematic level, automatic collision avoidance is achieved by the control design at the kinematic level exploiting the joint space redundancy, thus the human operator would be able to only concentrate on motion of robot's end-effector without concern on possible collision. A posture restoration scheme is also integrated based on a simulated parallel system to enable the manipulator restore back to the natural posture in the absence of obstacles. At dynamic level, adaptive control using radial basis function NNs is developed to compensate for the effect caused by the internal and external uncertainties, e.g., unknown payload. Both the steady state and the transient performance are guaranteed to satisfy a prescribed performance requirement. Comparative experiments have been performed to test the effectiveness and to demonstrate the guaranteed performance of the proposed methods.

Rigorous Free-Fermion Entanglement Renormalization from Wavelet Theory

NASA Astrophysics Data System (ADS)

Haegeman, Jutho; Swingle, Brian; Walter, Michael; Cotler, Jordan; Evenbly, Glen; Scholz, Volkher B.

2018-01-01

We construct entanglement renormalization schemes that provably approximate the ground states of noninteracting-fermion nearest-neighbor hopping Hamiltonians on the one-dimensional discrete line and the two-dimensional square lattice. These schemes give hierarchical quantum circuits that build up the states from unentangled degrees of freedom. The circuits are based on pairs of discrete wavelet transforms, which are approximately related by a "half-shift": translation by half a unit cell. The presence of the Fermi surface in the two-dimensional model requires a special kind of circuit architecture to properly capture the entanglement in the ground state. We show how the error in the approximation can be controlled without ever performing a variational optimization.

An Efficient User Authentication and User Anonymity Scheme with Provably Security for IoT-Based Medical Care System

PubMed Central

Wu, Tsu-Yang; Chen, Chin-Ling; Lee, Cheng-Chi; Chen, Chien-Ming

2017-01-01

In recent years, with the increase in degenerative diseases and the aging population in advanced countries, demands for medical care of older or solitary people have increased continually in hospitals and healthcare institutions. Applying wireless sensor networks for the IoT-based telemedicine system enables doctors, caregivers or families to monitor patients’ physiological conditions at anytime and anyplace according to the acquired information. However, transmitting physiological data through the Internet concerns the personal privacy of patients. Therefore, before users can access medical care services in IoT-based medical care system, they must be authenticated. Typically, user authentication and data encryption are most critical for securing network communications over a public channel between two or more participants. In 2016, Liu and Chung proposed a bilinear pairing-based password authentication scheme for wireless healthcare sensor networks. They claimed their authentication scheme cannot only secure sensor data transmission, but also resist various well-known security attacks. In this paper, we demonstrate that Liu–Chung’s scheme has some security weaknesses, and we further present an improved secure authentication and data encryption scheme for the IoT-based medical care system, which can provide user anonymity and prevent the security threats of replay and password/sensed data disclosure attacks. Moreover, we modify the authentication process to reduce redundancy in protocol design, and the proposed scheme is more efficient in performance compared with previous related schemes. Finally, the proposed scheme is provably secure in the random oracle model under ECDHP. PMID:28644381

Robust guaranteed cost tracking control of quadrotor UAV with uncertainties.

PubMed

Xu, Zhiwei; Nian, Xiaohong; Wang, Haibo; Chen, Yinsheng

2017-07-01

In this paper, a robust guaranteed cost controller (RGCC) is proposed for quadrotor UAV system with uncertainties to address set-point tracking problem. A sufficient condition of the existence for RGCC is derived by Lyapunov stability theorem. The designed RGCC not only guarantees the whole closed-loop system asymptotically stable but also makes the quadratic performance level built for the closed-loop system have an upper bound irrespective to all admissible parameter uncertainties. Then, an optimal robust guaranteed cost controller is developed to minimize the upper bound of performance level. Simulation results verify the presented control algorithms possess small overshoot and short setting time, with which the quadrotor has ability to perform set-point tracking task well. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Cost Comparison Among Provable Data Possession Schemes

DTIC Science & Technology

2016-03-01

possession,” in Proceedings of the 11th International Conference on Ap- plied Cryptography and Network Security. Berlin, Heidelberg: Springer-Verlag, 2013...curves,” in Security and Cryptography (SECRYPT), 2013 International Conference on, July 2013, pp. 1–12. [19] R. S. Kumar and A. Saxena, “Data integrity

A Provably Necessary Symbiosis

ERIC Educational Resources Information Center

Hochberg, Robert; Gabric, Kathleen

2010-01-01

The "new biology" of the 21st century is increasingly dependent on mathematics, and preparing high school students to have both strong science and math skills has created major challenges for both disciplines. Researchers and educators in biology and mathematics have been working long hours on a project to create high school teaching modules…

48 CFR 32.304-3 - Asset formula.

Code of Federal Regulations, 2010 CFR

2010-10-01

... extent for the time actually necessary for contract performance, if the contractor's working capital and... guaranteed loans made primarily for working capital purposes, the agency shall normally limit the guarantee... entitled to payment on performance or termination. The formula shall exclude— (1) Amounts for which the...

Expert Meeting Report: Energy Savings You Can Bank On

DOE Office of Scientific and Technical Information (OSTI.GOV)

Beman, M.; Springer, J.; Smith, P.

In October 2011, ARBI organized and conducted an Experts' Meeting on the topic of performance guarantees and financing vehicles for Energy Efficiency Upgrades. The meeting brought together technical, policy, and financial experts, including researchers, experienced installation contractors, and innovative energy business leaders, in order to discuss the opportunities and challenges for the energy efficiency upgrade industry to increase market uptake of Home Energy Upgrades (HEUs) through innovative offerings, such as performance guarantees. The meeting had several primary goals. First, it sought to understand how other industries have developed successful models for financing renewable energy installations while providing performance guarantees. Thismore » has been most recently demonstrated by the solar leasing industry. Second, the meeting explored the applicability of such business models to the energy efficiency upgrade industry. Third, the meeting sought to identify technical impediments to performance guarantees for energy efficiency retrofits. Fourth, the meeting sought to provide a common framework for these goals within the context of current financing mechanisms for energy efficiency upgrades.« less

Provable classically intractable sampling with measurement-based computation in constant time

NASA Astrophysics Data System (ADS)

Sanders, Stephen; Miller, Jacob; Miyake, Akimasa

We present a constant-time measurement-based quantum computation (MQC) protocol to perform a classically intractable sampling problem. We sample from the output probability distribution of a subclass of the instantaneous quantum polynomial time circuits introduced by Bremner, Montanaro and Shepherd. In contrast with the usual circuit model, our MQC implementation includes additional randomness due to byproduct operators associated with the computation. Despite this additional randomness we show that our sampling task cannot be efficiently simulated by a classical computer. We extend previous results to verify the quantum supremacy of our sampling protocol efficiently using only single-qubit Pauli measurements. Center for Quantum Information and Control, Department of Physics and Astronomy, University of New Mexico, Albuquerque, NM 87131, USA.

Target Coverage in Wireless Sensor Networks with Probabilistic Sensors

PubMed Central

Shan, Anxing; Xu, Xianghua; Cheng, Zongmao

2016-01-01

Sensing coverage is a fundamental problem in wireless sensor networks (WSNs), which has attracted considerable attention. Conventional research on this topic focuses on the 0/1 coverage model, which is only a coarse approximation to the practical sensing model. In this paper, we study the target coverage problem, where the objective is to find the least number of sensor nodes in randomly-deployed WSNs based on the probabilistic sensing model. We analyze the joint detection probability of target with multiple sensors. Based on the theoretical analysis of the detection probability, we formulate the minimum ϵ-detection coverage problem. We prove that the minimum ϵ-detection coverage problem is NP-hard and present an approximation algorithm called the Probabilistic Sensor Coverage Algorithm (PSCA) with provable approximation ratios. To evaluate our design, we analyze the performance of PSCA theoretically and also perform extensive simulations to demonstrate the effectiveness of our proposed algorithm. PMID:27618902

Key Reconciliation for High Performance Quantum Key Distribution

PubMed Central

Martinez-Mateo, Jesus; Elkouss, David; Martin, Vicente

2013-01-01

Quantum Key Distribution is carving its place among the tools used to secure communications. While a difficult technology, it enjoys benefits that set it apart from the rest, the most prominent is its provable security based on the laws of physics. QKD requires not only the mastering of signals at the quantum level, but also a classical processing to extract a secret-key from them. This postprocessing has been customarily studied in terms of the efficiency, a figure of merit that offers a biased view of the performance of real devices. Here we argue that it is the throughput the significant magnitude in practical QKD, specially in the case of high speed devices, where the differences are more marked, and give some examples contrasting the usual postprocessing schemes with new ones from modern coding theory. A good understanding of its implications is very important for the design of modern QKD devices. PMID:23546440

CHRR: coordinate hit-and-run with rounding for uniform sampling of constraint-based models.

PubMed

Haraldsdóttir, Hulda S; Cousins, Ben; Thiele, Ines; Fleming, Ronan M T; Vempala, Santosh

2017-06-01

In constraint-based metabolic modelling, physical and biochemical constraints define a polyhedral convex set of feasible flux vectors. Uniform sampling of this set provides an unbiased characterization of the metabolic capabilities of a biochemical network. However, reliable uniform sampling of genome-scale biochemical networks is challenging due to their high dimensionality and inherent anisotropy. Here, we present an implementation of a new sampling algorithm, coordinate hit-and-run with rounding (CHRR). This algorithm is based on the provably efficient hit-and-run random walk and crucially uses a preprocessing step to round the anisotropic flux set. CHRR provably converges to a uniform stationary sampling distribution. We apply it to metabolic networks of increasing dimensionality. We show that it converges several times faster than a popular artificial centering hit-and-run algorithm, enabling reliable and tractable sampling of genome-scale biochemical networks. https://github.com/opencobra/cobratoolbox . ronan.mt.fleming@gmail.com or vempala@cc.gatech.edu. Supplementary data are available at Bioinformatics online. © The Author 2017. Published by Oxford University Press.

Towards secure quantum key distribution protocol for wireless LANs: a hybrid approach

NASA Astrophysics Data System (ADS)

Naik, R. Lalu; Reddy, P. Chenna

2015-12-01

The primary goals of security such as authentication, confidentiality, integrity and non-repudiation in communication networks can be achieved with secure key distribution. Quantum mechanisms are highly secure means of distributing secret keys as they are unconditionally secure. Quantum key distribution protocols can effectively prevent various attacks in the quantum channel, while classical cryptography is efficient in authentication and verification of secret keys. By combining both quantum cryptography and classical cryptography, security of communications over networks can be leveraged. Hwang, Lee and Li exploited the merits of both cryptographic paradigms for provably secure communications to prevent replay, man-in-the-middle, and passive attacks. In this paper, we propose a new scheme with the combination of quantum cryptography and classical cryptography for 802.11i wireless LANs. Since quantum cryptography is premature in wireless networks, our work is a significant step forward toward securing communications in wireless networks. Our scheme is known as hybrid quantum key distribution protocol. Our analytical results revealed that the proposed scheme is provably secure for wireless networks.

An Approach to Quad Meshing Based On Cross Valued Maps and the Ginzburg-Landau Theory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Viertel, Ryan; Osting, Braxton

2017-08-01

A generalization of vector fields, referred to as N-direction fields or cross fields when N=4, has been recently introduced and studied for geometry processing, with applications in quadrilateral (quad) meshing, texture mapping, and parameterization. We make the observation that cross field design for two-dimensional quad meshing is related to the well-known Ginzburg-Landau problem from mathematical physics. This identification yields a variety of theoretical tools for efficiently computing boundary-aligned quad meshes, with provable guarantees on the resulting mesh, for example, the number of mesh defects and bounds on the defect locations. The procedure for generating the quad mesh is to (i)more » find a complex-valued "representation" field that minimizes the Dirichlet energy subject to a boundary constraint, (ii) convert the representation field into a boundary-aligned, smooth cross field, (iii) use separatrices of the cross field to partition the domain into four sided regions, and (iv) mesh each of these four-sided regions using standard techniques. Under certain assumptions on the geometry of the domain, we prove that this procedure can be used to produce a cross field whose separatrices partition the domain into four sided regions. To solve the energy minimization problem for the representation field, we use an extension of the Merriman-Bence-Osher (MBO) threshold dynamics method, originally conceived as an algorithm to simulate motion by mean curvature, to minimize the Ginzburg-Landau energy for the optimal representation field. Lastly, we demonstrate the method on a variety of test domains.« less

HPC-NMF: A High-Performance Parallel Algorithm for Nonnegative Matrix Factorization

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kannan, Ramakrishnan; Sukumar, Sreenivas R.; Ballard, Grey M.

NMF is a useful tool for many applications in different domains such as topic modeling in text mining, background separation in video analysis, and community detection in social networks. Despite its popularity in the data mining community, there is a lack of efficient distributed algorithms to solve the problem for big data sets. We propose a high-performance distributed-memory parallel algorithm that computes the factorization by iteratively solving alternating non-negative least squares (NLS) subproblems formore » $$\\WW$$ and $$\\HH$$. It maintains the data and factor matrices in memory (distributed across processors), uses MPI for interprocessor communication, and, in the dense case, provably minimizes communication costs (under mild assumptions). As opposed to previous implementation, our algorithm is also flexible: It performs well for both dense and sparse matrices, and allows the user to choose any one of the multiple algorithms for solving the updates to low rank factors $$\\WW$$ and $$\\HH$$ within the alternating iterations.« less

Real-Time Robust Adaptive Modeling and Scheduling for an Electronic Commerce Server

NASA Astrophysics Data System (ADS)

Du, Bing; Ruan, Chun

With the increasing importance and pervasiveness of Internet services, it is becoming a challenge for the proliferation of electronic commerce services to provide performance guarantees under extreme overload. This paper describes a real-time optimization modeling and scheduling approach for performance guarantee of electronic commerce servers. We show that an electronic commerce server may be simulated as a multi-tank system. A robust adaptive server model is subject to unknown additive load disturbances and uncertain model matching. Overload control techniques are based on adaptive admission control to achieve timing guarantees. We evaluate the performance of the model using a complex simulation that is subjected to varying model parameters and massive overload.

13 CFR 500.211 - Lender responsibilities.

Code of Federal Regulations, 2010 CFR

2010-01-01

...) Monitoring. In accordance with the Guarantee the Lender shall monitor Borrower's performance under the Loan... borrower, as provided in the Guarantee; (2) Projected balance sheet, income statement, and cash flows for...

22 CFR 211.9 - Liability for loss damage or improper distribution of commodities.

Code of Federal Regulations, 2014 CFR

2014-04-01

... sponsors may add to the value any provable costs they have incurred prior to delivery by the ocean carrier... TRANSFER OF FOOD COMMODITIES FOR FOOD USE IN DISASTER RELIEF, ECONOMIC DEVELOPMENT AND OTHER ASSISTANCE... or damage to commodities. (See paragraph (c)(2)(iii) of this section.) (B) The value of commodities...

22 CFR 211.9 - Liability for loss damage or improper distribution of commodities.

Code of Federal Regulations, 2013 CFR

2013-04-01

... sponsors may add to the value any provable costs they have incurred prior to delivery by the ocean carrier... TRANSFER OF FOOD COMMODITIES FOR FOOD USE IN DISASTER RELIEF, ECONOMIC DEVELOPMENT AND OTHER ASSISTANCE... or damage to commodities. (See paragraph (c)(2)(iii) of this section.) (B) The value of commodities...

Fusion And Inference From Multiple And Massive Disparate Distributed Dynamic Data Sets

DTIC Science & Technology

2017-07-01

principled methodology for two-sample graph testing; designed a provably almost-surely perfect vertex clustering algorithm for block model graphs; proved...3.7 Semi-Supervised Clustering Methodology ...................................................................... 9 3.8 Robust Hypothesis Testing...dimensional Euclidean space – allows the full arsenal of statistical and machine learning methodology for multivariate Euclidean data to be deployed for

Isogeometric Divergence-conforming B-splines for the Steady Navier-Stokes Equations

DTIC Science & Technology

2012-04-01

discretizations produce pointwise divergence-free velocity elds and hence exactly satisfy mass conservation. Consequently, discrete variational formulations...cretizations produce pointwise divergence-free velocity fields and hence exactly satisfy mass conservation. Consequently, discrete variational ... variational formulation. Using a combination of an advective for- mulation, SUPG, PSPG, and grad-div stabilization, provably convergent numerical methods

A Few Observations and Remarks on Time Effectiveness of Interactive Electronic Testing

ERIC Educational Resources Information Center

Magdin, Martin; Turcáni, Milan

2015-01-01

In the paper, we point out several observations and remarks on time effectiveness of electronic testing, in particular of its new form (interactive tests). A test is often used as an effective didactic tool for evaluating the extent of gained cognitive capabilities. According to authors Rudman (1989) and Wang (2003) it is provable that the…

Zero Autocorrelation Waveforms: A Doppler Statistic and Multifunction Problems

DTIC Science & Technology

2006-01-01

by ANSI Std Z39-18 It is natural to refer to A as the ambiguity function of u, since in the usual setting on the real line R, the analogue ambiguity...Doppler statistic |Cu,uek(j)| is excellent and provable for detecting deodorized Doppler frequency shift [11] (see Fig. 2). Also, if one graphs only

Guaranteed cost control with poles assignment for a flexible air-breathing hypersonic vehicle

NASA Astrophysics Data System (ADS)

Li, Hongyi; Si, Yulin; Wu, Ligang; Hu, Xiaoxiang; Gao, Huijun

2011-05-01

This article investigates the problem of guaranteed cost control for a flexible air-breathing hypersonic vehicle (FAHV). The FAHV includes intricate coupling between the engine and flight dynamics as well as complex interplay between flexible and rigid modes, which results in an intractable system for the control design. A longitudinal model is adopted for control design due to the complexity of the vehicle. First, for a highly nonlinear and coupled FAHV, a linearised model is established around the trim condition, which includes the state of altitude, velocity, angle of attack, pitch angle and pitch rate, etc. Secondly, by using the Lyapunov approach, performance analysis is carried out for the resulting closed-loop FAHV system, whose criterion with respect to guaranteed performance cost and poles assignment is expressed in the framework of linear matrix inequalities (LMIs). The established criterion exhibits a kind of decoupling between the Lyapunov positive-definite matrices to be determined and the FAHV system matrices, which is enabled by the introduction of additional slack matrix variables. Thirdly, a convex optimisation problem with LMI constraints is formulated for designing an admissible controller, which guarantees a prescribed performance cost with the simultaneous consideration of poles assignment for the resulting closed-loop system. Finally, some simulation results are provided to show that the guaranteed cost controller could assign the poles into the desired regional and achieve excellent reference altitude and velocity tracking performance.

Computing danger zones for provably safe closely spaced parallel approaches: Theory and experiment

NASA Astrophysics Data System (ADS)

Teo, Rodney

In poor visibility, paired approaches to airports with closely spaced parallel runways are not permitted, thus halving the arrival rate. With Global Positioning System technology, datalinks and cockpit displays, this could be averted. One important problem is ensuring safety during a blundered approach by one aircraft. This is on-going research. A danger zone around the blunderer is required. If the correct danger zone could be calculated, then it would be possible to get 100% of clear-day capacity in poor-visibility days even on 750 foot runways. The danger zones vary significantly (during an approach) and calculating them in real time would be very significant. Approximations (e.g. outer bounds) are not good enough. This thesis presents a way to calculate these danger zones in real time for a very broad class of blunder trajectories. The approach in this thesis differs from others in that it guarantees safety for any possible blunder trajectory as long as the speeds and turn rates of the blunder are within certain bounds. In addition, the approach considers all emergency evasive maneuvers whose speeds and turn rates are within certain bounds about a nominal emergency evasive maneuver. For all combinations of these blunder and evasive maneuver trajectories, it guarantees that the evasive maneuver is safe. For more than 1 million simulation runs, the algorithm shows a 100% rate of Successful Alerts and a 0% rate of Collisions Given an Alert. As an experimental testbed, two 10-ft wingspan fully autonomous unmanned aerial vehicles and a ground station are developed together with J. S. Jang. The development includes the design and flight testing of automatic controllers. The testbed is used to demonstrate the algorithm implementation through an autonomous closely spaced parallel approach, with one aircraft programmed to blunder. The other aircraft responds according to the result of the algorithm on board it and evades autonomously when required. This experimental demonstration is successfully conducted, showing the implementation of the algorithm, in particular, demonstrating that it can run in real time. Finally; with the necessary sensors and datalink, and the appropriate procedures in place, the algorithm developed in this thesis will enable 100% of clear-day capacity in poor-visibility days even on 750 foot runways.

Abstraction and Assume-Guarantee Reasoning for Automated Software Verification

NASA Technical Reports Server (NTRS)

Chaki, S.; Clarke, E.; Giannakopoulou, D.; Pasareanu, C. S.

2004-01-01

Compositional verification and abstraction are the key techniques to address the state explosion problem associated with model checking of concurrent software. A promising compositional approach is to prove properties of a system by checking properties of its components in an assume-guarantee style. This article proposes a framework for performing abstraction and assume-guarantee reasoning of concurrent C code in an incremental and fully automated fashion. The framework uses predicate abstraction to extract and refine finite state models of software and it uses an automata learning algorithm to incrementally construct assumptions for the compositional verification of the abstract models. The framework can be instantiated with different assume-guarantee rules. We have implemented our approach in the COMFORT reasoning framework and we show how COMFORT out-performs several previous software model checking approaches when checking safety properties of non-trivial concurrent programs.

77 FR 19835 - Grant of Individual Exemption Involving BlackRock, Inc. and Its Investment Advisory, Investment...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-04-02

... implicit U.S. Government guarantee as opposed to an explicit U.S. Government guarantee, (a) the BlackRock... 2510.3-101(i) which is accompanied by an implicit U.S. Government guarantee as opposed to an explicit U... or any member of the ECO Function in the performance of his or her duties; 6. The ECO is responsible...

Probabilistic double guarantee kidnapping detection in SLAM.

PubMed

Tian, Yang; Ma, Shugen

2016-01-01

For determining whether kidnapping has happened and which type of kidnapping it is while a robot performs autonomous tasks in an unknown environment, a double guarantee kidnapping detection (DGKD) method has been proposed. The good performance of DGKD in a relative small environment is shown. However, a limitation of DGKD is found in a large-scale environment by our recent work. In order to increase the adaptability of DGKD in a large-scale environment, an improved method called probabilistic double guarantee kidnapping detection is proposed in this paper to combine probability of features' positions and the robot's posture. Simulation results demonstrate the validity and accuracy of the proposed method.

Crafting a Usable Microkernel, Processor, and I/O System with Strict and Provable Information Flow Security

DTIC Science & Technology

2011-01-01

OS level, Flume [22] has even been shown to be information flow secure through abstractions such as processes, pipes, file systems etc, while seL4 ...Andronick, D. Cock, P. Derrin, D. Elkaduwe, K. Engelhardt, R. Kolanski, M. Norrish, T. Sewell, H. Tuch, and S. Winwood. sel4 : formal verification of an

True Randomness from Big Data.

PubMed

Papakonstantinou, Periklis A; Woodruff, David P; Yang, Guang

2016-09-26

Generating random bits is a difficult task, which is important for physical systems simulation, cryptography, and many applications that rely on high-quality random bits. Our contribution is to show how to generate provably random bits from uncertain events whose outcomes are routinely recorded in the form of massive data sets. These include scientific data sets, such as in astronomics, genomics, as well as data produced by individuals, such as internet search logs, sensor networks, and social network feeds. We view the generation of such data as the sampling process from a big source, which is a random variable of size at least a few gigabytes. Our view initiates the study of big sources in the randomness extraction literature. Previous approaches for big sources rely on statistical assumptions about the samples. We introduce a general method that provably extracts almost-uniform random bits from big sources and extensively validate it empirically on real data sets. The experimental findings indicate that our method is efficient enough to handle large enough sources, while previous extractor constructions are not efficient enough to be practical. Quality-wise, our method at least matches quantum randomness expanders and classical world empirical extractors as measured by standardized tests.

True Randomness from Big Data

NASA Astrophysics Data System (ADS)

Papakonstantinou, Periklis A.; Woodruff, David P.; Yang, Guang

2016-09-01

Generating random bits is a difficult task, which is important for physical systems simulation, cryptography, and many applications that rely on high-quality random bits. Our contribution is to show how to generate provably random bits from uncertain events whose outcomes are routinely recorded in the form of massive data sets. These include scientific data sets, such as in astronomics, genomics, as well as data produced by individuals, such as internet search logs, sensor networks, and social network feeds. We view the generation of such data as the sampling process from a big source, which is a random variable of size at least a few gigabytes. Our view initiates the study of big sources in the randomness extraction literature. Previous approaches for big sources rely on statistical assumptions about the samples. We introduce a general method that provably extracts almost-uniform random bits from big sources and extensively validate it empirically on real data sets. The experimental findings indicate that our method is efficient enough to handle large enough sources, while previous extractor constructions are not efficient enough to be practical. Quality-wise, our method at least matches quantum randomness expanders and classical world empirical extractors as measured by standardized tests.

True Randomness from Big Data

PubMed Central

Papakonstantinou, Periklis A.; Woodruff, David P.; Yang, Guang

2016-01-01

Generating random bits is a difficult task, which is important for physical systems simulation, cryptography, and many applications that rely on high-quality random bits. Our contribution is to show how to generate provably random bits from uncertain events whose outcomes are routinely recorded in the form of massive data sets. These include scientific data sets, such as in astronomics, genomics, as well as data produced by individuals, such as internet search logs, sensor networks, and social network feeds. We view the generation of such data as the sampling process from a big source, which is a random variable of size at least a few gigabytes. Our view initiates the study of big sources in the randomness extraction literature. Previous approaches for big sources rely on statistical assumptions about the samples. We introduce a general method that provably extracts almost-uniform random bits from big sources and extensively validate it empirically on real data sets. The experimental findings indicate that our method is efficient enough to handle large enough sources, while previous extractor constructions are not efficient enough to be practical. Quality-wise, our method at least matches quantum randomness expanders and classical world empirical extractors as measured by standardized tests. PMID:27666514

Study of Allocation Guaranteed Time Slot Wireless Body Area Networks Based on IEEE 802.15.4

NASA Astrophysics Data System (ADS)

Yundra, E.; Harsono, G. D.

2018-04-01

This paper aims to determine the size of the Guaranteed Time Slot (GTS) on the super frame structure required for each sensor as well as to know the performance of the GTS resized system compared to the GTS standard on IEEE 802.15.4. This article proposes a scheme to improve IEEE 802.15.4 medium access control, called allocation Guaranteed Time Slot (ALGATIS). ALGATIS is expected to effectively allocate guaranteed time slot to the requested sensors, it adjusts the length of the slot in super frame duration based on the length of the packet data. This article presents a simulation experiment of IEEE 802.15.4, especially for star network, to predict the throughput of networks and average energy consumption. The simulation experiments show that the performance of ALGATIS is better than that of IEEE 802.15.4 standard in term of the throughput of networks and average energy consumption

GEO-6 project for Galileo data scientific utilization

NASA Astrophysics Data System (ADS)

Buresova, Dalia; Lastovicka, Jan; Boska, Josef; Sauli, Petra; Kouba, Daniel; Mosna, Zbysek

The future GNSS Galileo system offer a number of benefits (e.g. availability of better accuracy positioning, new frequencies bands allowing the implementation of specific techniques, provable time-stamp and location data using SIS authorisation, integrity, better support ad-hoc algorithms for data analysis and other service guarantee for liability and regulated applications) are widely spread among different disciplines. Also applications which are less interesting from the commercial and market point of view could successfully contribute to the numerous social benefits and support the innovation in the international research. The aim of the GEO-6 project "Scientific research Using GNSS" is to propose and broaden scientific utilization of future GNSS Galileo system data in research. It is a joint project of seven institutions from six countries led by the Atos Origin Company from Spain. The core of the project consists from six projects in five priority areas: PA-1 Remote sensing of the ocean using GNSS reflections, PA-2a Investigating GNSS ionospheric data assimilation, PA-2b 3-D gravity wave detection and determination (both PA-2a and PA-2b are ionospheric topics), PA-3 Demonstration of capability for operational forecasting of atmospheric delays, PA-4 GNSS seismometer, PA-5 Spacecraft formation flying using global navigation satellite systems. Institute of Atmospheric Physics, Prague, Czech Republic is responsible for the project PA-2b, where we developed and tested (to the extent allowed by available data) an algorithm and computer code for the 3-D detection of gravity waves and determination of their characteristics. The main drivers of the GEO-6 project are: high levels of accuracy even with the support of local elements, sharing of solutions and results for the worldwide scientific community. The paper will present basic description of the project with more details concerning Czech participation in it.

Optimal trace inequality constants for interior penalty discontinuous Galerkin discretisations of elliptic operators using arbitrary elements with non-constant Jacobians

NASA Astrophysics Data System (ADS)

Owens, A. R.; Kópházi, J.; Eaton, M. D.

2017-12-01

In this paper, a new method to numerically calculate the trace inequality constants, which arise in the calculation of penalty parameters for interior penalty discretisations of elliptic operators, is presented. These constants are provably optimal for the inequality of interest. As their calculation is based on the solution of a generalised eigenvalue problem involving the volumetric and face stiffness matrices, the method is applicable to any element type for which these matrices can be calculated, including standard finite elements and the non-uniform rational B-splines of isogeometric analysis. In particular, the presented method does not require the Jacobian of the element to be constant, and so can be applied to a much wider variety of element shapes than are currently available in the literature. Numerical results are presented for a variety of finite element and isogeometric cases. When the Jacobian is constant, it is demonstrated that the new method produces lower penalty parameters than existing methods in the literature in all cases, which translates directly into savings in the solution time of the resulting linear system. When the Jacobian is not constant, it is shown that the naive application of existing approaches can result in penalty parameters that do not guarantee coercivity of the bilinear form, and by extension, the stability of the solution. The method of manufactured solutions is applied to a model reaction-diffusion equation with a range of parameters, and it is found that using penalty parameters based on the new trace inequality constants result in better conditioned linear systems, which can be solved approximately 11% faster than those produced by the methods from the literature.

Rapid Onboard Trajectory Design for Autonomous Spacecraft in Multibody Systems

NASA Astrophysics Data System (ADS)

Trumbauer, Eric Michael

This research develops automated, on-board trajectory planning algorithms in order to support current and new mission concepts. These include orbiter missions to Phobos or Deimos, Outer Planet Moon orbiters, and robotic and crewed missions to small bodies. The challenges stem from the limited on-board computing resources which restrict full trajectory optimization with guaranteed convergence in complex dynamical environments. The approach taken consists of leveraging pre-mission computations to create a large database of pre-computed orbits and arcs. Such a database is used to generate a discrete representation of the dynamics in the form of a directed graph, which acts to index these arcs. This allows the use of graph search algorithms on-board in order to provide good approximate solutions to the path planning problem. Coupled with robust differential correction and optimization techniques, this enables the determination of an efficient path between any boundary conditions with very little time and computing effort. Furthermore, the optimization methods developed here based on sequential convex programming are shown to have provable convergence properties, as well as generating feasible major iterates in case of a system interrupt -- a key requirement for on-board application. The outcome of this project is thus the development of an algorithmic framework which allows the deployment of this approach in a variety of specific mission contexts. Test cases related to missions of interest to NASA and JPL such as a Phobos orbiter and a Near Earth Asteroid interceptor are demonstrated, including the results of an implementation on the RAD750 flight processor. This method fills a gap in the toolbox being developed to create fully autonomous space exploration systems.

Final Report of Technical Assistance Provided to Guarantee Agencies with Recommendations for Further Improving Program Performance.

ERIC Educational Resources Information Center

Touche Ross and Co., Washington, DC.

Technical assistance provided to loan guarantee agencies by Touche Ross and Co. under contract to the U.S. Office of Education (OE) is described. Objectives of the report are: to summarize the work performed and the results of each of the projects that were conducted; to describe certain prototype systems that were developed for the guarantee…

AIB-OR: improving onion routing circuit construction using anonymous identity-based cryptosystems.

PubMed

Wang, Changji; Shi, Dongyuan; Xu, Xilei

2015-01-01

The rapid growth of Internet applications has made communication anonymity an increasingly important or even indispensable security requirement. Onion routing has been employed as an infrastructure for anonymous communication over a public network, which provides anonymous connections that are strongly resistant to both eavesdropping and traffic analysis. However, existing onion routing protocols usually exhibit poor performance due to repeated encryption operations. In this paper, we first present an improved anonymous multi-receiver identity-based encryption (AMRIBE) scheme, and an improved identity-based one-way anonymous key agreement (IBOWAKE) protocol. We then propose an efficient onion routing protocol named AIB-OR that provides provable security and strong anonymity. Our main approach is to use our improved AMRIBE scheme and improved IBOWAKE protocol in onion routing circuit construction. Compared with other onion routing protocols, AIB-OR provides high efficiency, scalability, strong anonymity and fault tolerance. Performance measurements from a prototype implementation show that our proposed AIB-OR can achieve high bandwidths and low latencies when deployed over the Internet.

AIB-OR: Improving Onion Routing Circuit Construction Using Anonymous Identity-Based Cryptosystems

PubMed Central

Wang, Changji; Shi, Dongyuan; Xu, Xilei

2015-01-01

The rapid growth of Internet applications has made communication anonymity an increasingly important or even indispensable security requirement. Onion routing has been employed as an infrastructure for anonymous communication over a public network, which provides anonymous connections that are strongly resistant to both eavesdropping and traffic analysis. However, existing onion routing protocols usually exhibit poor performance due to repeated encryption operations. In this paper, we first present an improved anonymous multi-receiver identity-based encryption (AMRIBE) scheme, and an improved identity-based one-way anonymous key agreement (IBOWAKE) protocol. We then propose an efficient onion routing protocol named AIB-OR that provides provable security and strong anonymity. Our main approach is to use our improved AMRIBE scheme and improved IBOWAKE protocol in onion routing circuit construction. Compared with other onion routing protocols, AIB-OR provides high efficiency, scalability, strong anonymity and fault tolerance. Performance measurements from a prototype implementation show that our proposed AIB-OR can achieve high bandwidths and low latencies when deployed over the Internet. PMID:25815879

Automated Assume-Guarantee Reasoning by Abstraction Refinement

NASA Technical Reports Server (NTRS)

Pasareanu, Corina S.; Giannakopoulous, Dimitra; Glannakopoulou, Dimitra

2008-01-01

Current automated approaches for compositional model checking in the assume-guarantee style are based on learning of assumptions as deterministic automata. We propose an alternative approach based on abstraction refinement. Our new method computes the assumptions for the assume-guarantee rules as conservative and not necessarily deterministic abstractions of some of the components, and refines those abstractions using counter-examples obtained from model checking them together with the other components. Our approach also exploits the alphabets of the interfaces between components and performs iterative refinement of those alphabets as well as of the abstractions. We show experimentally that our preliminary implementation of the proposed alternative achieves similar or better performance than a previous learning-based implementation.

Quantum cryptography protocols robust against photon number splitting attacks for weak laser pulse implementations.

PubMed

Scarani, Valerio; Acín, Antonio; Ribordy, Grégoire; Gisin, Nicolas

2004-02-06

We introduce a new class of quantum key distribution protocols, tailored to be robust against photon number splitting (PNS) attacks. We study one of these protocols, which differs from the original protocol by Bennett and Brassard (BB84) only in the classical sifting procedure. This protocol is provably better than BB84 against PNS attacks at zero error.

Properties of a certain stochastic dynamical system, channel polarization, and polar codes

NASA Astrophysics Data System (ADS)

Tanaka, Toshiyuki

2010-06-01

A new family of codes, called polar codes, has recently been proposed by Arikan. Polar codes are of theoretical importance because they are provably capacity achieving with low-complexity encoding and decoding. We first discuss basic properties of a certain stochastic dynamical system, on the basis of which properties of channel polarization and polar codes are reviewed, with emphasis on our recent results.

7 CFR 1720.6 - Application process.

Code of Federal Regulations, 2010 CFR

2010-01-01

... able to repay the guaranteed bonds in accordance with their terms; (5) Consolidated financial... certified public accountant, including any associated notes, as well as any interim financial statements and... pledged to assure the applicant's performance under, the guarantee agreement; (3) A statement by the...

Towards a Compositional SPIN

NASA Technical Reports Server (NTRS)

Pasareanu, Corina S.; Giannakopoulou, Dimitra

2006-01-01

This paper discusses our initial experience with introducing automated assume-guarantee verification based on learning in the SPIN tool. We believe that compositional verification techniques such as assume-guarantee reasoning could complement the state-reduction techniques that SPIN already supports, thus increasing the size of systems that SPIN can handle. We present a "light-weight" approach to evaluating the benefits of learning-based assume-guarantee reasoning in the context of SPIN: we turn our previous implementation of learning for the LTSA tool into a main program that externally invokes SPIN to provide the model checking-related answers. Despite its performance overheads (which mandate a future implementation within SPIN itself), this approach provides accurate information about the savings in memory. We have experimented with several versions of learning-based assume guarantee reasoning, including a novel heuristic introduced here for generating component assumptions when their environment is unavailable. We illustrate the benefits of learning-based assume-guarantee reasoning in SPIN through the example of a resource arbiter for a spacecraft. Keywords: assume-guarantee reasoning, model checking, learning.

Dynamic earthquake rupture simulations on nonplanar faults embedded in 3D geometrically complex, heterogeneous elastic solids

DOE Office of Scientific and Technical Information (OSTI.GOV)

Duru, Kenneth, E-mail: kduru@stanford.edu; Dunham, Eric M.; Institute for Computational and Mathematical Engineering, Stanford University, Stanford, CA

Dynamic propagation of shear ruptures on a frictional interface in an elastic solid is a useful idealization of natural earthquakes. The conditions relating discontinuities in particle velocities across fault zones and tractions acting on the fault are often expressed as nonlinear friction laws. The corresponding initial boundary value problems are both numerically and computationally challenging. In addition, seismic waves generated by earthquake ruptures must be propagated for many wavelengths away from the fault. Therefore, reliable and efficient numerical simulations require both provably stable and high order accurate numerical methods. We present a high order accurate finite difference method for: a)more » enforcing nonlinear friction laws, in a consistent and provably stable manner, suitable for efficient explicit time integration; b) dynamic propagation of earthquake ruptures along nonplanar faults; and c) accurate propagation of seismic waves in heterogeneous media with free surface topography. We solve the first order form of the 3D elastic wave equation on a boundary-conforming curvilinear mesh, in terms of particle velocities and stresses that are collocated in space and time, using summation-by-parts (SBP) finite difference operators in space. Boundary and interface conditions are imposed weakly using penalties. By deriving semi-discrete energy estimates analogous to the continuous energy estimates we prove numerical stability. The finite difference stencils used in this paper are sixth order accurate in the interior and third order accurate close to the boundaries. However, the method is applicable to any spatial operator with a diagonal norm satisfying the SBP property. Time stepping is performed with a 4th order accurate explicit low storage Runge–Kutta scheme, thus yielding a globally fourth order accurate method in both space and time. We show numerical simulations on band limited self-similar fractal faults revealing the complexity of rupture dynamics on rough faults.« less

Dynamic earthquake rupture simulations on nonplanar faults embedded in 3D geometrically complex, heterogeneous elastic solids

NASA Astrophysics Data System (ADS)

Duru, Kenneth; Dunham, Eric M.

2016-01-01

Dynamic propagation of shear ruptures on a frictional interface in an elastic solid is a useful idealization of natural earthquakes. The conditions relating discontinuities in particle velocities across fault zones and tractions acting on the fault are often expressed as nonlinear friction laws. The corresponding initial boundary value problems are both numerically and computationally challenging. In addition, seismic waves generated by earthquake ruptures must be propagated for many wavelengths away from the fault. Therefore, reliable and efficient numerical simulations require both provably stable and high order accurate numerical methods. We present a high order accurate finite difference method for: a) enforcing nonlinear friction laws, in a consistent and provably stable manner, suitable for efficient explicit time integration; b) dynamic propagation of earthquake ruptures along nonplanar faults; and c) accurate propagation of seismic waves in heterogeneous media with free surface topography. We solve the first order form of the 3D elastic wave equation on a boundary-conforming curvilinear mesh, in terms of particle velocities and stresses that are collocated in space and time, using summation-by-parts (SBP) finite difference operators in space. Boundary and interface conditions are imposed weakly using penalties. By deriving semi-discrete energy estimates analogous to the continuous energy estimates we prove numerical stability. The finite difference stencils used in this paper are sixth order accurate in the interior and third order accurate close to the boundaries. However, the method is applicable to any spatial operator with a diagonal norm satisfying the SBP property. Time stepping is performed with a 4th order accurate explicit low storage Runge-Kutta scheme, thus yielding a globally fourth order accurate method in both space and time. We show numerical simulations on band limited self-similar fractal faults revealing the complexity of rupture dynamics on rough faults.

Performance Guaranteed Inertia Emulation forDiesel-Wind System Feed Microgrid via ModelReference Control

DOE Office of Scientific and Technical Information (OSTI.GOV)

Melin, Alexander M.; Zhang, Yichen; Djouadi, Seddik

In this paper, a model reference control based inertia emulation strategy is proposed. Desired inertia can be precisely emulated through this control strategy so that guaranteed performance is ensured. A typical frequency response model with parametrical inertia is set to be the reference model. A measurement at a specific location delivers the information of disturbance acting on the diesel-wind system to the referencemodel. The objective is for the speed of the diesel-wind system to track the reference model. Since active power variation is dominantly governed by mechanical dynamics and modes, only mechanical dynamics and states, i.e., a swing-engine-governor system plusmore » a reduced-order wind turbine generator, are involved in the feedback control design. The controller is implemented in a three-phase diesel-wind system feed microgrid. The results show exact synthetic inertia is emulated, leading to guaranteed performance and safety bounds.« less

Auditing Rational Adversaries to Provably Manage Risks

DTIC Science & Technology

2012-05-23

series of white papers on accountability-based privacy governance in which one recommendation is that organisations should have in place policies and...that this state of affairs raises is how to design effective audit and punishment schemes. This paper articulates a desirable property and presents an...In this section, we provide an overview of our model using a motivating scenario that will serve as a running example for this paper . Consider a

Solving LP Relaxations of Large-Scale Precedence Constrained Problems

NASA Astrophysics Data System (ADS)

Bienstock, Daniel; Zuckerberg, Mark

We describe new algorithms for solving linear programming relaxations of very large precedence constrained production scheduling problems. We present theory that motivates a new set of algorithmic ideas that can be employed on a wide range of problems; on data sets arising in the mining industry our algorithms prove effective on problems with many millions of variables and constraints, obtaining provably optimal solutions in a few minutes of computation.

A Model of Onion Routing With Provable Anonymity

DTIC Science & Technology

2006-08-30

Lysyanskaya. “A Formal Treatment of Onion Routing.” CRYPTO 2005, pp. 169.187, 2005. [4] David Chaum . “The dining cryptographers problem...1988. [5] David Chaum . “Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms.” Communi- cations of the ACM, 24(2), pp. 84-88, 1981...network layer.” ACM Conference on Computer and Communications Security, pp. 193-206, 2002. [11] David Goldschlag, Michael Reed, and Paul Syverson

Tractable Algorithms for Proximity Search on Large Graphs

DTIC Science & Technology

2010-07-01

development in information retrieval, 2005. 5.1 164 A. K. Chandra, P. Raghavan, W. L. Ruzzo, and R. Smolensky. The electrical resistance of a graph captures...2007] show how to use hitting times for designing provably manipulation resistant reputation systems. Harmonic func- tions have been used for...commute times with electrical net- works (Doyle and Snell [1984]). Consider an undirected graph. Now think of each edge as a resistor with conductance

Provably secure and high-rate quantum key distribution with time-bin qudits

DOE PAGES

Islam, Nurul T.; Lim, Charles Ci Wen; Cahall, Clinton; ...

2017-11-24

The security of conventional cryptography systems is threatened in the forthcoming era of quantum computers. Quantum key distribution (QKD) features fundamentally proven security and offers a promising option for quantum-proof cryptography solution. Although prototype QKD systems over optical fiber have been demonstrated over the years, the key generation rates remain several orders of magnitude lower than current classical communication systems. In an effort toward a commercially viable QKD system with improved key generation rates, we developed a discrete-variable QKD system based on time-bin quantum photonic states that can generate provably secure cryptographic keys at megabit-per-second rates over metropolitan distances. Wemore » use high-dimensional quantum states that transmit more than one secret bit per received photon, alleviating detector saturation effects in the superconducting nanowire single-photon detectors used in our system that feature very high detection efficiency (of more than 70%) and low timing jitter (of less than 40 ps). Our system is constructed using commercial off-the-shelf components, and the adopted protocol can be readily extended to free-space quantum channels. In conclusion, the security analysis adopted to distill the keys ensures that the demonstrated protocol is robust against coherent attacks, finite-size effects, and a broad class of experimental imperfections identified in our system.« less

Provably secure and high-rate quantum key distribution with time-bin qudits

PubMed Central

Islam, Nurul T.; Lim, Charles Ci Wen; Cahall, Clinton; Kim, Jungsang; Gauthier, Daniel J.

2017-01-01

The security of conventional cryptography systems is threatened in the forthcoming era of quantum computers. Quantum key distribution (QKD) features fundamentally proven security and offers a promising option for quantum-proof cryptography solution. Although prototype QKD systems over optical fiber have been demonstrated over the years, the key generation rates remain several orders of magnitude lower than current classical communication systems. In an effort toward a commercially viable QKD system with improved key generation rates, we developed a discrete-variable QKD system based on time-bin quantum photonic states that can generate provably secure cryptographic keys at megabit-per-second rates over metropolitan distances. We use high-dimensional quantum states that transmit more than one secret bit per received photon, alleviating detector saturation effects in the superconducting nanowire single-photon detectors used in our system that feature very high detection efficiency (of more than 70%) and low timing jitter (of less than 40 ps). Our system is constructed using commercial off-the-shelf components, and the adopted protocol can be readily extended to free-space quantum channels. The security analysis adopted to distill the keys ensures that the demonstrated protocol is robust against coherent attacks, finite-size effects, and a broad class of experimental imperfections identified in our system. PMID:29202028

Provably secure and high-rate quantum key distribution with time-bin qudits.

PubMed

Islam, Nurul T; Lim, Charles Ci Wen; Cahall, Clinton; Kim, Jungsang; Gauthier, Daniel J

2017-11-01

The security of conventional cryptography systems is threatened in the forthcoming era of quantum computers. Quantum key distribution (QKD) features fundamentally proven security and offers a promising option for quantum-proof cryptography solution. Although prototype QKD systems over optical fiber have been demonstrated over the years, the key generation rates remain several orders of magnitude lower than current classical communication systems. In an effort toward a commercially viable QKD system with improved key generation rates, we developed a discrete-variable QKD system based on time-bin quantum photonic states that can generate provably secure cryptographic keys at megabit-per-second rates over metropolitan distances. We use high-dimensional quantum states that transmit more than one secret bit per received photon, alleviating detector saturation effects in the superconducting nanowire single-photon detectors used in our system that feature very high detection efficiency (of more than 70%) and low timing jitter (of less than 40 ps). Our system is constructed using commercial off-the-shelf components, and the adopted protocol can be readily extended to free-space quantum channels. The security analysis adopted to distill the keys ensures that the demonstrated protocol is robust against coherent attacks, finite-size effects, and a broad class of experimental imperfections identified in our system.

Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-state Phylogeny

NASA Astrophysics Data System (ADS)

Misra, Navodit; Blelloch, Guy; Ravi, R.; Schwartz, Russell

Accurate reconstruction of phylogenies remains a key challenge in evolutionary biology. Most biologically plausible formulations of the problem are formally NP-hard, with no known efficient solution. The standard in practice are fast heuristic methods that are empirically known to work very well in general, but can yield results arbitrarily far from optimal. Practical exact methods, which yield exponential worst-case running times but generally much better times in practice, provide an important alternative. We report progress in this direction by introducing a provably optimal method for the weighted multi-state maximum parsimony phylogeny problem. The method is based on generalizing the notion of the Buneman graph, a construction key to efficient exact methods for binary sequences, so as to apply to sequences with arbitrary finite numbers of states with arbitrary state transition weights. We implement an integer linear programming (ILP) method for the multi-state problem using this generalized Buneman graph and demonstrate that the resulting method is able to solve data sets that are intractable by prior exact methods in run times comparable with popular heuristics. Our work provides the first method for provably optimal maximum parsimony phylogeny inference that is practical for multi-state data sets of more than a few characters.

Provably secure and high-rate quantum key distribution with time-bin qudits

DOE Office of Scientific and Technical Information (OSTI.GOV)

Islam, Nurul T.; Lim, Charles Ci Wen; Cahall, Clinton

The security of conventional cryptography systems is threatened in the forthcoming era of quantum computers. Quantum key distribution (QKD) features fundamentally proven security and offers a promising option for quantum-proof cryptography solution. Although prototype QKD systems over optical fiber have been demonstrated over the years, the key generation rates remain several orders of magnitude lower than current classical communication systems. In an effort toward a commercially viable QKD system with improved key generation rates, we developed a discrete-variable QKD system based on time-bin quantum photonic states that can generate provably secure cryptographic keys at megabit-per-second rates over metropolitan distances. Wemore » use high-dimensional quantum states that transmit more than one secret bit per received photon, alleviating detector saturation effects in the superconducting nanowire single-photon detectors used in our system that feature very high detection efficiency (of more than 70%) and low timing jitter (of less than 40 ps). Our system is constructed using commercial off-the-shelf components, and the adopted protocol can be readily extended to free-space quantum channels. In conclusion, the security analysis adopted to distill the keys ensures that the demonstrated protocol is robust against coherent attacks, finite-size effects, and a broad class of experimental imperfections identified in our system.« less

Getting it right the first time: predicted performance guarantees from the analysis of emergent behavior in autonomous and semi-autonomous systems

NASA Astrophysics Data System (ADS)

Arkin, Ronald C.; Lyons, Damian; Shu, Jiang; Nirmal, Prem; Zafar, Munzir

2012-06-01

A crucially important aspect for mission-critical robotic operations is ensuring as best as possible that an autonomous system be able to complete its task. In a project for the Defense Threat Reduction Agency (DTRA) we are developing methods to provide such guidance, specifically for counter-Weapons of Mass Destruction (C-WMD) missions. In this paper, we describe the scenarios under consideration, the performance measures and metrics being developed, and an outline of the mechanisms for providing performance guarantees.

22 CFR 221.15 - Fiscal Agent obligations.

Code of Federal Regulations, 2014 CFR

2014-04-01

... 22 Foreign Relations 1 2014-04-01 2014-04-01 false Fiscal Agent obligations. 221.15 Section 221.15 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEE STANDARD TERMS AND CONDITIONS The Guarantee § 221.15 Fiscal Agent obligations. Failure of the Fiscal Agent to perform any of its...

22 CFR 221.15 - Fiscal Agent obligations.

Code of Federal Regulations, 2012 CFR

2012-04-01

... 22 Foreign Relations 1 2012-04-01 2012-04-01 false Fiscal Agent obligations. 221.15 Section 221.15 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEE STANDARD TERMS AND CONDITIONS The Guarantee § 221.15 Fiscal Agent obligations. Failure of the Fiscal Agent to perform any of its...

22 CFR 221.15 - Fiscal Agent obligations.

Code of Federal Regulations, 2013 CFR

2013-04-01

... 22 Foreign Relations 1 2013-04-01 2013-04-01 false Fiscal Agent obligations. 221.15 Section 221.15 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEE STANDARD TERMS AND CONDITIONS The Guarantee § 221.15 Fiscal Agent obligations. Failure of the Fiscal Agent to perform any of its...

22 CFR 221.15 - Fiscal Agent obligations.

Code of Federal Regulations, 2011 CFR

2011-04-01

... 22 Foreign Relations 1 2011-04-01 2011-04-01 false Fiscal Agent obligations. 221.15 Section 221.15 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEE STANDARD TERMS AND CONDITIONS The Guarantee § 221.15 Fiscal Agent obligations. Failure of the Fiscal Agent to perform any of its...

22 CFR 221.15 - Fiscal Agent obligations.

Code of Federal Regulations, 2010 CFR

2010-04-01

... 22 Foreign Relations 1 2010-04-01 2010-04-01 false Fiscal Agent obligations. 221.15 Section 221.15 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEE STANDARD TERMS AND CONDITIONS The Guarantee § 221.15 Fiscal Agent obligations. Failure of the Fiscal Agent to perform any of its...

Learning-based adaptive prescribed performance control of postcapture space robot-target combination without inertia identifications

NASA Astrophysics Data System (ADS)

Wei, Caisheng; Luo, Jianjun; Dai, Honghua; Bian, Zilin; Yuan, Jianping

2018-05-01

In this paper, a novel learning-based adaptive attitude takeover control method is investigated for the postcapture space robot-target combination with guaranteed prescribed performance in the presence of unknown inertial properties and external disturbance. First, a new static prescribed performance controller is developed to guarantee that all the involved attitude tracking errors are uniformly ultimately bounded by quantitatively characterizing the transient and steady-state performance of the combination. Then, a learning-based supplementary adaptive strategy based on adaptive dynamic programming is introduced to improve the tracking performance of static controller in terms of robustness and adaptiveness only utilizing the input/output data of the combination. Compared with the existing works, the prominent advantage is that the unknown inertial properties are not required to identify in the development of learning-based adaptive control law, which dramatically decreases the complexity and difficulty of the relevant controller design. Moreover, the transient and steady-state performance is guaranteed a priori by designer-specialized performance functions without resorting to repeated regulations of the controller parameters. Finally, the three groups of illustrative examples are employed to verify the effectiveness of the proposed control method.

Robust inertia-free attitude takeover control of postcapture combined spacecraft with guaranteed prescribed performance.

PubMed

Luo, Jianjun; Wei, Caisheng; Dai, Honghua; Yin, Zeyang; Wei, Xing; Yuan, Jianping

2018-03-01

In this paper, a robust inertia-free attitude takeover control scheme with guaranteed prescribed performance is investigated for postcapture combined spacecraft with consideration of unmeasurable states, unknown inertial property and external disturbance torque. Firstly, to estimate the unavailable angular velocity of combination accurately, a novel finite-time-convergent tracking differentiator is developed with a quite computationally achievable structure free from the unknown nonlinear dynamics of combined spacecraft. Then, a robust inertia-free prescribed performance control scheme is proposed, wherein, the transient and steady-state performance of combined spacecraft is first quantitatively studied by stabilizing the filtered attitude tracking errors. Compared with the existing works, the prominent advantage is that no parameter identifications and no neural or fuzzy nonlinear approximations are needed, which decreases the complexity of robust controller design dramatically. Moreover, the prescribed performance of combined spacecraft is guaranteed a priori without resorting to repeated regulations of the controller parameters. Finally, four illustrative examples are employed to validate the effectiveness of the proposed control scheme and tracking differentiator. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

Sampling-free Bayesian inversion with adaptive hierarchical tensor representations

NASA Astrophysics Data System (ADS)

Eigel, Martin; Marschall, Manuel; Schneider, Reinhold

2018-03-01

A sampling-free approach to Bayesian inversion with an explicit polynomial representation of the parameter densities is developed, based on an affine-parametric representation of a linear forward model. This becomes feasible due to the complete treatment in function spaces, which requires an efficient model reduction technique for numerical computations. The advocated perspective yields the crucial benefit that error bounds can be derived for all occuring approximations, leading to provable convergence subject to the discretization parameters. Moreover, it enables a fully adaptive a posteriori control with automatic problem-dependent adjustments of the employed discretizations. The method is discussed in the context of modern hierarchical tensor representations, which are used for the evaluation of a random PDE (the forward model) and the subsequent high-dimensional quadrature of the log-likelihood, alleviating the ‘curse of dimensionality’. Numerical experiments demonstrate the performance and confirm the theoretical results.

Quantum Information Theory - an Invitation

NASA Astrophysics Data System (ADS)

Werner, Reinhard F.

Quantum information and quantum computers have received a lot of public attention recently. Quantum computers have been advertised as a kind of warp drive for computing, and indeed the promise of the algorithms of Shor and Grover is to perform computations which are extremely hard or even provably impossible on any merely ``classical'' computer.In this article I shall give an account of the basic concepts of quantum information theory is given, staying as much as possible in the area of general agreement.The article is divided into two parts. The first (up to the end of Sect. 2.5) is mostly in plain English, centered around the exploration of what can or cannot be done with quantum systems as information carriers. The second part, Sect. 2.6, then gives a description of the mathematical structures and of some of the tools needed to develop the theory.

A Formal Approach to the Provably Correct Synthesis of Mission Critical Embedded Software for Multi Core Embedded Platforms

DTIC Science & Technology

2014-04-01

synchronization primitives based on preset templates can result in over synchronization if unchecked, possibly creating deadlock situations. Further...inputs rather than enforcing synchronization with a global clock. MRICDF models software as a network of communicating actors. Four primitive actors...control wants to send interrupt or not. Since this is shared buffer, a semaphore mechanism is assumed to synchronize the read/write of this buffer. The

Noise-enhanced clustering and competitive learning algorithms.

PubMed

Osoba, Osonde; Kosko, Bart

2013-01-01

Noise can provably speed up convergence in many centroid-based clustering algorithms. This includes the popular k-means clustering algorithm. The clustering noise benefit follows from the general noise benefit for the expectation-maximization algorithm because many clustering algorithms are special cases of the expectation-maximization algorithm. Simulations show that noise also speeds up convergence in stochastic unsupervised competitive learning, supervised competitive learning, and differential competitive learning. Copyright © 2012 Elsevier Ltd. All rights reserved.

Multiplexing Low and High QoS Workloads in Virtual Environments

NASA Astrophysics Data System (ADS)

Verboven, Sam; Vanmechelen, Kurt; Broeckhove, Jan

Virtualization technology has introduced new ways for managing IT infrastructure. The flexible deployment of applications through self-contained virtual machine images has removed the barriers for multiplexing, suspending and migrating applications with their entire execution environment, allowing for a more efficient use of the infrastructure. These developments have given rise to an important challenge regarding the optimal scheduling of virtual machine workloads. In this paper, we specifically address the VM scheduling problem in which workloads that require guaranteed levels of CPU performance are mixed with workloads that do not require such guarantees. We introduce a framework to analyze this scheduling problem and evaluate to what extent such mixed service delivery is beneficial for a provider of virtualized IT infrastructure. Traditionally providers offer IT resources under a guaranteed and fixed performance profile, which can lead to underutilization. The findings of our simulation study show that through proper tuning of a limited set of parameters, the proposed scheduling algorithm allows for a significant increase in utilization without sacrificing on performance dependability.

MRAC Revisited: Guaranteed Performance with Reference Model Modification

NASA Technical Reports Server (NTRS)

Stepanyan, Vahram; Krishnakumar, Kalmaje

2010-01-01

This paper presents modification of the conventional model reference adaptive control (MRAC) architecture in order to achieve guaranteed transient performance both in the output and input signals of an uncertain system. The proposed modification is based on the tracking error feedback to the reference model. It is shown that approach guarantees tracking of a given command and the ideal control signal (one that would be designed if the system were known) not only asymptotically but also in transient by a proper selection of the error feedback gain. The method prevents generation of high frequency oscillations that are unavoidable in conventional MRAC systems for large adaptation rates. The provided design guideline makes it possible to track a reference command of any magnitude form any initial position without re-tuning. The benefits of the method are demonstrated in simulations.

Time-stable overset grid method for hyperbolic problems using summation-by-parts operators

NASA Astrophysics Data System (ADS)

Sharan, Nek; Pantano, Carlos; Bodony, Daniel J.

2018-05-01

A provably time-stable method for solving hyperbolic partial differential equations arising in fluid dynamics on overset grids is presented in this paper. The method uses interface treatments based on the simultaneous approximation term (SAT) penalty method and derivative approximations that satisfy the summation-by-parts (SBP) property. Time-stability is proven using energy arguments in a norm that naturally relaxes to the standard diagonal norm when the overlap reduces to a traditional multiblock arrangement. The proposed overset interface closures are time-stable for arbitrary overlap arrangements. The information between grids is transferred using Lagrangian interpolation applied to the incoming characteristics, although other interpolation schemes could also be used. The conservation properties of the method are analyzed. Several one-, two-, and three-dimensional, linear and non-linear numerical examples are presented to confirm the stability and accuracy of the method. A performance comparison between the proposed SAT-based interface treatment and the commonly-used approach of injecting the interpolated data onto each grid is performed to highlight the efficacy of the SAT method.

Large calculation of the flow over a hypersonic vehicle using a GPU

NASA Astrophysics Data System (ADS)

Elsen, Erich; LeGresley, Patrick; Darve, Eric

2008-12-01

Graphics processing units are capable of impressive computing performance up to 518 Gflops peak performance. Various groups have been using these processors for general purpose computing; most efforts have focussed on demonstrating relatively basic calculations, e.g. numerical linear algebra, or physical simulations for visualization purposes with limited accuracy. This paper describes the simulation of a hypersonic vehicle configuration with detailed geometry and accurate boundary conditions using the compressible Euler equations. To the authors' knowledge, this is the most sophisticated calculation of this kind in terms of complexity of the geometry, the physical model, the numerical methods employed, and the accuracy of the solution. The Navier-Stokes Stanford University Solver (NSSUS) was used for this purpose. NSSUS is a multi-block structured code with a provably stable and accurate numerical discretization which uses a vertex-based finite-difference method. A multi-grid scheme is used to accelerate the solution of the system. Based on a comparison of the Intel Core 2 Duo and NVIDIA 8800GTX, speed-ups of over 40× were demonstrated for simple test geometries and 20× for complex geometries.

A set-theoretic model reference adaptive control architecture for disturbance rejection and uncertainty suppression with strict performance guarantees

NASA Astrophysics Data System (ADS)

Arabi, Ehsan; Gruenwald, Benjamin C.; Yucelen, Tansel; Nguyen, Nhan T.

2018-05-01

Research in adaptive control algorithms for safety-critical applications is primarily motivated by the fact that these algorithms have the capability to suppress the effects of adverse conditions resulting from exogenous disturbances, imperfect dynamical system modelling, degraded modes of operation, and changes in system dynamics. Although government and industry agree on the potential of these algorithms in providing safety and reducing vehicle development costs, a major issue is the inability to achieve a-priori, user-defined performance guarantees with adaptive control algorithms. In this paper, a new model reference adaptive control architecture for uncertain dynamical systems is presented to address disturbance rejection and uncertainty suppression. The proposed framework is predicated on a set-theoretic adaptive controller construction using generalised restricted potential functions.The key feature of this framework allows the system error bound between the state of an uncertain dynamical system and the state of a reference model, which captures a desired closed-loop system performance, to be less than a-priori, user-defined worst-case performance bound, and hence, it has the capability to enforce strict performance guarantees. Examples are provided to demonstrate the efficacy of the proposed set-theoretic model reference adaptive control architecture.

Provable Transient Recovery for Frame-Based, Fault-Tolerant Computing Systems

NASA Technical Reports Server (NTRS)

DiVito, Ben L.; Butler, Ricky W.

1992-01-01

We present a formal verification of the transient fault recovery aspects of the Reliable Computing Platform (RCP), a fault-tolerant computing system architecture for digital flight control applications. The RCP uses NMR-style redundancy to mask faults and internal majority voting to purge the effects of transient faults. The system design has been formally specified and verified using the EHDM verification system. Our formalization accommodates a wide variety of voting schemes for purging the effects of transients.

Interpreter composition issues in the formal verification of a processor-memory module

NASA Technical Reports Server (NTRS)

Fura, David A.; Cohen, Gerald C.

1994-01-01

This report describes interpreter composition techniques suitable for the formal specification and verification of a processor-memory module using the HOL theorem proving system. The processor-memory module is a multichip subsystem within a fault-tolerant embedded system under development within the Boeing Defense and Space Group. Modeling and verification methods were developed that permit provably secure composition at the transaction-level of specification, significantly reducing the complexity of the hierarchical verification of the system.

Visual Information Theory and Visual Representation for Achieving Provable Bounds in Vision-Based Control and Decision

DTIC Science & Technology

2014-07-30

of the IEEE Intl. Conf. on Comp. Vis. and Patt . Recog. (CVPR). 07-JAN-14, . : , B. Taylor, A. Ayvaci, A. Ravichandran, and S. Soatto.. Semantic video...detection, localization and tracking, Intl. Conf. on Comp. Vis. Patt . Recog.. 06-JAN-11, . : , Michalis Raptis, Iasonas Kokkinos, Stefano Soatto...of the IEEE Intl. Conf. on Comp. Vis. and Patt . Recog., 2012. [12] M. Raptis and S. Soatto. Tracklet descriptors for action modeling and video

National Computer Security Conference Proceedings (11th): A Postscript: Computer Security--Into the Future, 17-20 October 1988

DTIC Science & Technology

1988-10-20

The LOCK project , from its very beginnings as an implementation study for the Provably Secure Operating System in 1979...to the security field, can study to gain insight into the evaluation process. The project has developed an innovative format for the DTLS and FTLS...management tern becomes available, the Al Secure DBMS will be system (DBMS) that is currently being developed un- ported to it . der the Advanced

Anonymous broadcasting of classical information with a continuous-variable topological quantum code

NASA Astrophysics Data System (ADS)

Menicucci, Nicolas C.; Baragiola, Ben Q.; Demarie, Tommaso F.; Brennen, Gavin K.

2018-03-01

Broadcasting information anonymously becomes more difficult as surveillance technology improves, but remarkably, quantum protocols exist that enable provably traceless broadcasting. The difficulty is making scalable entangled resource states that are robust to errors. We propose an anonymous broadcasting protocol that uses a continuous-variable surface-code state that can be produced using current technology. High squeezing enables large transmission bandwidth and strong anonymity, and the topological nature of the state enables local error mitigation.

Provably Secure Password-based Authentication in TLS

DOE Office of Scientific and Technical Information (OSTI.GOV)

Abdalla, Michel; Emmanuel, Bresson; Chevassut, Olivier

2005-12-20

In this paper, we show how to design an efficient, provably secure password-based authenticated key exchange mechanism specifically for the TLS (Transport Layer Security) protocol. The goal is to provide a technique that allows users to employ (short) passwords to securely identify themselves to servers. As our main contribution, we describe a new password-based technique for user authentication in TLS, called Simple Open Key Exchange (SOKE). Loosely speaking, the SOKE ciphersuites are unauthenticated Diffie-Hellman ciphersuites in which the client's Diffie-Hellman ephemeral public value is encrypted using a simple mask generation function. The mask is simply a constant value raised tomore » the power of (a hash of) the password.The SOKE ciphersuites, in advantage over previous pass-word-based authentication ciphersuites for TLS, combine the following features. First, SOKE has formal security arguments; the proof of security based on the computational Diffie-Hellman assumption is in the random oracle model, and holds for concurrent executions and for arbitrarily large password dictionaries. Second, SOKE is computationally efficient; in particular, it only needs operations in a sufficiently large prime-order subgroup for its Diffie-Hellman computations (no safe primes). Third, SOKE provides good protocol flexibility because the user identity and password are only required once a SOKE ciphersuite has actually been negotiated, and after the server has sent a server identity.« less

Audit Report "The Department of Energy's Loan Guarantee Program for Innovative Energy Technologies"

DOE Office of Scientific and Technical Information (OSTI.GOV)

None

2009-02-01

The Energy Policy Act of 2005 authorized the Department of Energy to guarantee loans for new or significantly improved energy production technologies that avoid, reduce, or sequester air pollutants and other greenhouse gases. As of December 2008, Congress authorized the Department to make $42.5 billion in loan guarantees to support innovative energy projects. These guarantees were authorized for up to 80% of the total project costs and were designed to promote the commercial use of innovative technologies. Under the terms of the Act, the loan guarantees are contingent upon reasonable prospect of repayment by the borrower. Consistent with the Energymore » Policy Act, the Department is responsible for soliciting and evaluating loan applications, approving loan guarantees, and monitoring project and loan guarantee performance. through December 2008, the Department had issued five solicitations for projects that support innovative clean coal technologies, energy efficiency, renewable energy, advanced electricity transmission and distribution, and nuclear and fossil energy projects. These solicitations were issued in three phases with the first in August 2006, and the final in September 2008. Eleven substantially complete applications requesting approximately $8.2 billion in loan guarantees had been received by the Department in response to the first solicitation. The Department had begun the review of applications and was in the process of completing due diligence procedures necessary to evaluate projects received in response to the first solicitation. Under current plans, the Department is to issue its first loan guarantees in the spring of 2009. Because of the importance of this program as part of an effort to address the Nation's most challenging and pressing energy needs; and, the potential risk of loss to the United States taxpayers should default occur, we initiated this review to evaluate the Department's progress in establishing internal and operational controls over its Loan Guarantee Program.« less

Proceedings of the Seminar on the DOD Computer Security Initiative (4th) Held at the National Bureau of Standards, Gaithersburg, Maryland on August 10-12, 1981.

DTIC Science & Technology

1981-01-01

comparison of formal and informal design methodologies will show how we think they are converging. Lastly, I will describe our involvement with the DoD...computer security must begin with the design methodology , with the objective being provability. The idea ofa formal evaluation and on-the-shelf... Methodologies ] Here we can compare the formal design methodologies with those used by informal practitioners like Control Data. Obviously, both processes

A System Architecture to Support a Verifiably Secure Multilevel Security System.

DTIC Science & Technology

1980-06-01

4] Newmann, P.G., R. Fabry, K. Levitt, L. Robin - provide a tradeoff between cost and system secur- son, J. Wensley , "On the Design of a Provably ity...ICS-80/05 NL 112. 11W1 --1.25 1111 6 Mli,’O~ll Rl OIIION W AII .q3 0 School of Information and Computer Science S =GEORGIA INSTITUTE OF TECHNOLOGY 808...Multilevel Security Systemt (Extended Abstract) George I. Davida Department of Electical Engineering and Computer Science University of Wisconsin

Provable Security of Communication for Protecting Information Flow in Distributed Systems

DTIC Science & Technology

2015-06-01

tensorization  of   extremal  mutual  information  quantities,  which  have  been  of  recent...Control,  and   Computing,  Oct.  2012.   25) T.  Wang,  J.  Sturm,  P.  Cuff,  S.  Kulkarni,  “Condorcet   Voting ...Methods  Avoid  the   Paradoxes  of   Voting  Theory,”  Proc.  of  the  Allerton  Conference  on  Communication,  

Secret sharing based on quantum Fourier transform

NASA Astrophysics Data System (ADS)

Yang, Wei; Huang, Liusheng; Shi, Runhua; He, Libao

2013-07-01

Secret sharing plays a fundamental role in both secure multi-party computation and modern cryptography. We present a new quantum secret sharing scheme based on quantum Fourier transform. This scheme enjoys the property that each share of a secret is disguised with true randomness, rather than classical pseudorandomness. Moreover, under the only assumption that a top priority for all participants (secret sharers and recovers) is to obtain the right result, our scheme is able to achieve provable security against a computationally unbounded attacker.

A Secure Authenticated Key Exchange Protocol for Credential Services

NASA Astrophysics Data System (ADS)

Shin, Seonghan; Kobara, Kazukuni; Imai, Hideki

In this paper, we propose a leakage-resilient and proactive authenticated key exchange (called LRP-AKE) protocol for credential services which provides not only a higher level of security against leakage of stored secrets but also secrecy of private key with respect to the involving server. And we show that the LRP-AKE protocol is provably secure in the random oracle model with the reduction to the computational Difie-Hellman problem. In addition, we discuss about some possible applications of the LRP-AKE protocol.

Entropy Stable Spectral Collocation Schemes for the Navier-Stokes Equations: Discontinuous Interfaces

NASA Technical Reports Server (NTRS)

Carpenter, Mark H.; Fisher, Travis C.; Nielsen, Eric J.; Frankel, Steven H.

2013-01-01

Nonlinear entropy stability and a summation-by-parts framework are used to derive provably stable, polynomial-based spectral collocation methods of arbitrary order. The new methods are closely related to discontinuous Galerkin spectral collocation methods commonly known as DGFEM, but exhibit a more general entropy stability property. Although the new schemes are applicable to a broad class of linear and nonlinear conservation laws, emphasis herein is placed on the entropy stability of the compressible Navier-Stokes equations.

Methodology for designing and implementing a class for service for the transmission of medical images over a common network

NASA Astrophysics Data System (ADS)

Dimond, David A.; Burgess, Robert; Barrios, Nolan; Johnson, Neil D.

2000-05-01

Traditionally, to guarantee the network performance of medical image data transmission, imaging traffic was isolated on a separate network. Organizations are depending on a new generation of multi-purpose networks to transport both normal information and image traffic as they expand access to images throughout the enterprise. These organi want to leverage their existing infrastructure for imaging traffic, but are not willing to accept degradations in overall network performance. To guarantee 'on demand' network performance for image transmissions anywhere at any time, networks need to be designed with the ability to 'carve out' bandwidth for specific applications and to minimize the chances of network failures. This paper will present the methodology Cincinnati Children's Hospital Medical Center (CHMC) used to enhance the physical and logical network design of the existing hospital network to guarantee a class of service for imaging traffic. PACS network designs should utilize the existing enterprise local area network i.e. (LAN) infrastructure where appropriate. Logical separation or segmentation provides the application independence from other clinical and administrative applications as required, ensuring bandwidth and service availability.

PI Passivity-Based Control for Maximum Power Extraction of a Wind Energy System with Guaranteed Stability Properties

NASA Astrophysics Data System (ADS)

Cisneros, Rafael; Gao, Rui; Ortega, Romeo; Husain, Iqbal

2016-10-01

The present paper proposes a maximum power extraction control for a wind system consisting of a turbine, a permanent magnet synchronous generator, a rectifier, a load and one constant voltage source, which is used to form the DC bus. We propose a linear PI controller, based on passivity, whose stability is guaranteed under practically reasonable assumptions. PI structures are widely accepted in practice as they are easier to tune and simpler than other existing model-based methods. Real switching based simulations have been performed to assess the performance of the proposed controller.

SLOPE—ADAPTIVE VARIABLE SELECTION VIA CONVEX OPTIMIZATION

PubMed Central

Bogdan, Małgorzata; van den Berg, Ewout; Sabatti, Chiara; Su, Weijie; Candès, Emmanuel J.

2015-01-01

We introduce a new estimator for the vector of coefficients β in the linear model y = Xβ + z, where X has dimensions n × p with p possibly larger than n. SLOPE, short for Sorted L-One Penalized Estimation, is the solution to minb∈ℝp12‖y−Xb‖ℓ22+λ1|b|(1)+λ2|b|(2)+⋯+λp|b|(p),where λ1 ≥ λ2 ≥ … ≥ λp ≥ 0 and |b|(1)≥|b|(2)≥⋯≥|b|(p) are the decreasing absolute values of the entries of b. This is a convex program and we demonstrate a solution algorithm whose computational complexity is roughly comparable to that of classical ℓ1 procedures such as the Lasso. Here, the regularizer is a sorted ℓ1 norm, which penalizes the regression coefficients according to their rank: the higher the rank—that is, stronger the signal—the larger the penalty. This is similar to the Benjamini and Hochberg [J. Roy. Statist. Soc. Ser. B 57 (1995) 289–300] procedure (BH) which compares more significant p-values with more stringent thresholds. One notable choice of the sequence {λi} is given by the BH critical values λBH(i)=z(1−i⋅q/2p), where q ∈ (0, 1) and z(α) is the quantile of a standard normal distribution. SLOPE aims to provide finite sample guarantees on the selected model; of special interest is the false discovery rate (FDR), defined as the expected proportion of irrelevant regressors among all selected predictors. Under orthogonal designs, SLOPE with λBH provably controls FDR at level q. Moreover, it also appears to have appreciable inferential properties under more general designs X while having substantial power, as demonstrated in a series of experiments running on both simulated and real data. PMID:26709357

Prediction-Correction Algorithms for Time-Varying Constrained Optimization

DOE PAGES

Simonetto, Andrea; Dall'Anese, Emiliano

2017-07-26

This article develops online algorithms to track solutions of time-varying constrained optimization problems. Particularly, resembling workhorse Kalman filtering-based approaches for dynamical systems, the proposed methods involve prediction-correction steps to provably track the trajectory of the optimal solutions of time-varying convex problems. The merits of existing prediction-correction methods have been shown for unconstrained problems and for setups where computing the inverse of the Hessian of the cost function is computationally affordable. This paper addresses the limitations of existing methods by tackling constrained problems and by designing first-order prediction steps that rely on the Hessian of the cost function (and do notmore » require the computation of its inverse). In addition, the proposed methods are shown to improve the convergence speed of existing prediction-correction methods when applied to unconstrained problems. Numerical simulations corroborate the analytical results and showcase performance and benefits of the proposed algorithms. A realistic application of the proposed method to real-time control of energy resources is presented.« less

Practical secure quantum communications

NASA Astrophysics Data System (ADS)

Diamanti, Eleni

2015-05-01

We review recent advances in the field of quantum cryptography, focusing in particular on practical implementations of two central protocols for quantum network applications, namely key distribution and coin flipping. The former allows two parties to share secret messages with information-theoretic security, even in the presence of a malicious eavesdropper in the communication channel, which is impossible with classical resources alone. The latter enables two distrustful parties to agree on a random bit, again with information-theoretic security, and with a cheating probability lower than the one that can be reached in a classical scenario. Our implementations rely on continuous-variable technology for quantum key distribution and on a plug and play discrete-variable system for coin flipping, and necessitate a rigorous security analysis adapted to the experimental schemes and their imperfections. In both cases, we demonstrate the protocols with provable security over record long distances in optical fibers and assess the performance of our systems as well as their limitations. The reported advances offer a powerful toolbox for practical applications of secure communications within future quantum networks.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Simonetto, Andrea; Dall'Anese, Emiliano

This article develops online algorithms to track solutions of time-varying constrained optimization problems. Particularly, resembling workhorse Kalman filtering-based approaches for dynamical systems, the proposed methods involve prediction-correction steps to provably track the trajectory of the optimal solutions of time-varying convex problems. The merits of existing prediction-correction methods have been shown for unconstrained problems and for setups where computing the inverse of the Hessian of the cost function is computationally affordable. This paper addresses the limitations of existing methods by tackling constrained problems and by designing first-order prediction steps that rely on the Hessian of the cost function (and do notmore » require the computation of its inverse). In addition, the proposed methods are shown to improve the convergence speed of existing prediction-correction methods when applied to unconstrained problems. Numerical simulations corroborate the analytical results and showcase performance and benefits of the proposed algorithms. A realistic application of the proposed method to real-time control of energy resources is presented.« less

Proactive Time-Rearrangement Scheme for Multi-Radio Collocated Platform

NASA Astrophysics Data System (ADS)

Kim, Chul; Shin, Sang-Heon; Park, Sang Kyu

We present a simple proactive time rearrangement scheme (PATRA) that reduces the interferences from multi-radio devices equipped in one platform and guarantees user-conceived QoS. Simulation results show that the interference among multiple radios in one platform causes severe performance degradation and cannot guarantee the user requested QoS. However, the PATRA can dramatically improve not only the userconceived QoS but also the overall network throughput.

Guaranteeing Isochronous Control of Networked Motion Control Systems Using Phase Offset Adjustment

PubMed Central

Kim, Ikhwan; Kim, Taehyoun

2015-01-01

Guaranteeing isochronous transfer of control commands is an essential function for networked motion control systems. The adoption of real-time Ethernet (RTE) technologies may be profitable in guaranteeing deterministic transfer of control messages. However, unpredictable behavior of software in the motion controller often results in unexpectedly large deviation in control message transmission intervals, and thus leads to imprecise motion. This paper presents a simple and efficient heuristic to guarantee the end-to-end isochronous control with very small jitter. The key idea of our approach is to adjust the phase offset of control message transmission time in the motion controller by investigating the behavior of motion control task. In realizing the idea, we performed a pre-runtime analysis to determine a safe and reliable phase offset and applied the phase offset to the runtime code of motion controller by customizing an open-source based integrated development environment (IDE). We also constructed an EtherCAT-based motion control system testbed and performed extensive experiments on the testbed to verify the effectiveness of our approach. The experimental results show that our heuristic is highly effective even for low-end embedded controller implemented in open-source software components under various configurations of control period and the number of motor drives. PMID:26076407

7 CFR 1494.401 - Performance security.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 7 Agriculture 10 2010-01-01 2010-01-01 false Performance security. 1494.401 Section 1494.401... Program Operations § 1494.401 Performance security. (a) Requirement to establish performance security... establish performance security, in a form which is acceptable to CCC, in order to guarantee the eligible...

7 CFR 1494.401 - Performance security.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 7 Agriculture 10 2011-01-01 2011-01-01 false Performance security. 1494.401 Section 1494.401... Program Operations § 1494.401 Performance security. (a) Requirement to establish performance security... establish performance security, in a form which is acceptable to CCC, in order to guarantee the eligible...

Robust ECC-based authenticated key agreement scheme with privacy protection for Telecare medicine information systems.

PubMed

Zhang, Liping; Zhu, Shaohui

2015-05-01

To protect the transmission of the sensitive medical data, a secure and efficient authenticated key agreement scheme should be deployed when the healthcare delivery session is established via Telecare Medicine Information Systems (TMIS) over the unsecure public network. Recently, Islam and Khan proposed an authenticated key agreement scheme using elliptic curve cryptography for TMIS. They claimed that their proposed scheme is provably secure against various attacks in random oracle model and enjoys some good properties such as user anonymity. In this paper, however, we point out that any legal but malicious patient can reveal other user's identity. Consequently, their scheme suffers from server spoofing attack and off-line password guessing attack. Moreover, if the malicious patient performs the same time of the registration as other users, she can further launch the impersonation attack, man-in-the-middle attack, modification attack, replay attack, and strong replay attack successfully. To eliminate these weaknesses, we propose an improved ECC-based authenticated key agreement scheme. Security analysis demonstrates that the proposed scheme can resist various attacks and enables the patient to enjoy the remote healthcare services with privacy protection. Through the performance evaluation, we show that the proposed scheme achieves a desired balance between security and performance in comparisons with other related schemes.

A Framework to Analyze the Performance of Load Balancing Schemes for Ensembles of Stochastic Simulations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ahn, Tae-Hyuk; Sandu, Adrian; Watson, Layne T.

2015-08-01

Ensembles of simulations are employed to estimate the statistics of possible future states of a system, and are widely used in important applications such as climate change and biological modeling. Ensembles of runs can naturally be executed in parallel. However, when the CPU times of individual simulations vary considerably, a simple strategy of assigning an equal number of tasks per processor can lead to serious work imbalances and low parallel efficiency. This paper presents a new probabilistic framework to analyze the performance of dynamic load balancing algorithms for ensembles of simulations where many tasks are mapped onto each processor, andmore » where the individual compute times vary considerably among tasks. Four load balancing strategies are discussed: most-dividing, all-redistribution, random-polling, and neighbor-redistribution. Simulation results with a stochastic budding yeast cell cycle model are consistent with the theoretical analysis. It is especially significant that there is a provable global decrease in load imbalance for the local rebalancing algorithms due to scalability concerns for the global rebalancing algorithms. The overall simulation time is reduced by up to 25 %, and the total processor idle time by 85 %.« less

An Efficient Power Saving Mechanism for Delay-Guaranteed Services in IEEE 802.16e

NASA Astrophysics Data System (ADS)

Park, Yunju; Hwang, Gang Uk

As the IEEE 802.16e Wireless Metropolitan Access Network (WMAN) supports the mobility of a mobile station (MS), increasing MS power efficiency has become an important issue. In this paper, we analyze the sleep-mode operation for an efficient power saving mechanism for delay-guaranteed services in the IEEE 802.16e WMAN and observe the effects of the operating parameters related to this operation. For the analysis we use the M/GI/1/K queueing system with multiple vacations, exhaustive services and setup times. In the analysis, we consider the power consumption during the wake-mode period as well as the sleep-mode period. As a performance measure for the power consumption, we propose the power consumption per unit time per effective arrival which considers the power consumption and the packet blocking probability simultaneously. In addition, since we consider delay-guaranteed services, the average packet response delay is also considered as a performance measure. Based on the performance measures, we obtain the optimal sleep-mode operation which minimizes the power consumption per unit time per effective arrival with a given delay requirement. Numerical studies are also provided to investigate the system performance and to show how to achieve our objective.

Vehicle active steering control research based on two-DOF robust internal model control

NASA Astrophysics Data System (ADS)

Wu, Jian; Liu, Yahui; Wang, Fengbo; Bao, Chunjiang; Sun, Qun; Zhao, Youqun

2016-07-01

Because of vehicle's external disturbances and model uncertainties, robust control algorithms have obtained popularity in vehicle stability control. The robust control usually gives up performance in order to guarantee the robustness of the control algorithm, therefore an improved robust internal model control(IMC) algorithm blending model tracking and internal model control is put forward for active steering system in order to reach high performance of yaw rate tracking with certain robustness. The proposed algorithm inherits the good model tracking ability of the IMC control and guarantees robustness to model uncertainties. In order to separate the design process of model tracking from the robustness design process, the improved 2 degree of freedom(DOF) robust internal model controller structure is given from the standard Youla parameterization. Simulations of double lane change maneuver and those of crosswind disturbances are conducted for evaluating the robust control algorithm, on the basis of a nonlinear vehicle simulation model with a magic tyre model. Results show that the established 2-DOF robust IMC method has better model tracking ability and a guaranteed level of robustness and robust performance, which can enhance the vehicle stability and handling, regardless of variations of the vehicle model parameters and the external crosswind interferences. Contradiction between performance and robustness of active steering control algorithm is solved and higher control performance with certain robustness to model uncertainties is obtained.

Fuzzy Logic-Based Guaranteed Lifetime Protocol for Real-Time Wireless Sensor Networks.

PubMed

Shah, Babar; Iqbal, Farkhund; Abbas, Ali; Kim, Ki-Il

2015-08-18

Few techniques for guaranteeing a network lifetime have been proposed despite its great impact on network management. Moreover, since the existing schemes are mostly dependent on the combination of disparate parameters, they do not provide additional services, such as real-time communications and balanced energy consumption among sensor nodes; thus, the adaptability problems remain unresolved among nodes in wireless sensor networks (WSNs). To solve these problems, we propose a novel fuzzy logic model to provide real-time communication in a guaranteed WSN lifetime. The proposed fuzzy logic controller accepts the input descriptors energy, time and velocity to determine each node's role for the next duration and the next hop relay node for real-time packets. Through the simulation results, we verified that both the guaranteed network's lifetime and real-time delivery are efficiently ensured by the new fuzzy logic model. In more detail, the above-mentioned two performance metrics are improved up to 8%, as compared to our previous work, and 14% compared to existing schemes, respectively.

Fuzzy Logic-Based Guaranteed Lifetime Protocol for Real-Time Wireless Sensor Networks

PubMed Central

Shah, Babar; Iqbal, Farkhund; Abbas, Ali; Kim, Ki-Il

2015-01-01

Few techniques for guaranteeing a network lifetime have been proposed despite its great impact on network management. Moreover, since the existing schemes are mostly dependent on the combination of disparate parameters, they do not provide additional services, such as real-time communications and balanced energy consumption among sensor nodes; thus, the adaptability problems remain unresolved among nodes in wireless sensor networks (WSNs). To solve these problems, we propose a novel fuzzy logic model to provide real-time communication in a guaranteed WSN lifetime. The proposed fuzzy logic controller accepts the input descriptors energy, time and velocity to determine each node’s role for the next duration and the next hop relay node for real-time packets. Through the simulation results, we verified that both the guaranteed network’s lifetime and real-time delivery are efficiently ensured by the new fuzzy logic model. In more detail, the above-mentioned two performance metrics are improved up to 8%, as compared to our previous work, and 14% compared to existing schemes, respectively. PMID:26295238

Mahanaxar: quality of service guarantees in high-bandwidth, real-time streaming data storage

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bigelow, David; Bent, John; Chen, Hsing-Bung

2010-04-05

Large radio telescopes, cyber-security systems monitoring real-time network traffic, and others have specialized data storage needs: guaranteed capture of an ultra-high-bandwidth data stream, retention of the data long enough to determine what is 'interesting,' retention of interesting data indefinitely, and concurrent read/write access to determine what data is interesting, without interrupting the ongoing capture of incoming data. Mahanaxar addresses this problem. Mahanaxar guarantees streaming real-time data capture at (nearly) the full rate of the raw device, allows concurrent read and write access to the device on a best-effort basis without interrupting the data capture, and retains data as long asmore » possible given the available storage. It has built in mechanisms for reliability and indexing, can scale to meet arbitrary bandwidth requirements, and handles both small and large data elements equally well. Results from our prototype implementation shows that Mahanaxar provides both better guarantees and better performance than traditional file systems.« less

Remote Entanglement by Coherent Multiplication of Concurrent Quantum Signals

NASA Astrophysics Data System (ADS)

Roy, Ananda; Jiang, Liang; Stone, A. Douglas; Devoret, Michel

2015-10-01

Concurrent remote entanglement of distant, noninteracting quantum entities is a crucial function for quantum information processing. In contrast with the existing protocols which employ the addition of signals to generate entanglement between two remote qubits, the continuous variable protocol we present is based on the multiplication of signals. This protocol can be straightforwardly implemented by a novel Josephson junction mixing circuit. Our scheme would be able to generate provable entanglement even in the presence of practical imperfections: finite quantum efficiency of detectors and undesired photon loss in current state-of-the-art devices.

High-Order Entropy Stable Finite Difference Schemes for Nonlinear Conservation Laws: Finite Domains

NASA Technical Reports Server (NTRS)

Fisher, Travis C.; Carpenter, Mark H.

2013-01-01

Developing stable and robust high-order finite difference schemes requires mathematical formalism and appropriate methods of analysis. In this work, nonlinear entropy stability is used to derive provably stable high-order finite difference methods with formal boundary closures for conservation laws. Particular emphasis is placed on the entropy stability of the compressible Navier-Stokes equations. A newly derived entropy stable weighted essentially non-oscillatory finite difference method is used to simulate problems with shocks and a conservative, entropy stable, narrow-stencil finite difference approach is used to approximate viscous terms.

TEAMBLOCKS: HYBRID ABSTRACTIONS FOR PROVABLE MULTI-AGENT AUTONOMY

DTIC Science & Technology

2017-07-28

Raspberry Pi 23 can easily satisfy control loop periods on the order of 10−3s. Thus, we assume that the time to execute a piece of control code, ∆t...Release; Distribution Unlimited. 23 State Space The state space of the aircraft is X = R3 × SO(3) × R3 × R3; states consist of • pI ∈ R3, the...the tbdemo_ghaexecution script uses this operation to make feedback system out of the product of the linear system and PI controller. tbread

Unconditionally Secure Blind Signatures

NASA Astrophysics Data System (ADS)

Hara, Yuki; Seito, Takenobu; Shikata, Junji; Matsumoto, Tsutomu

The blind signature scheme introduced by Chaum allows a user to obtain a valid signature for a message from a signer such that the message is kept secret for the signer. Blind signature schemes have mainly been studied from a viewpoint of computational security so far. In this paper, we study blind signatures in unconditional setting. Specifically, we newly introduce a model of unconditionally secure blind signature schemes (USBS, for short). Also, we propose security notions and their formalization in our model. Finally, we propose a construction method for USBS that is provably secure in our security notions.

Learning from label proportions in brain-computer interfaces: Online unsupervised learning with guarantees.

PubMed

Hübner, David; Verhoeven, Thibault; Schmid, Konstantin; Müller, Klaus-Robert; Tangermann, Michael; Kindermans, Pieter-Jan

2017-01-01

Using traditional approaches, a brain-computer interface (BCI) requires the collection of calibration data for new subjects prior to online use. Calibration time can be reduced or eliminated e.g., by subject-to-subject transfer of a pre-trained classifier or unsupervised adaptive classification methods which learn from scratch and adapt over time. While such heuristics work well in practice, none of them can provide theoretical guarantees. Our objective is to modify an event-related potential (ERP) paradigm to work in unison with the machine learning decoder, and thus to achieve a reliable unsupervised calibrationless decoding with a guarantee to recover the true class means. We introduce learning from label proportions (LLP) to the BCI community as a new unsupervised, and easy-to-implement classification approach for ERP-based BCIs. The LLP estimates the mean target and non-target responses based on known proportions of these two classes in different groups of the data. We present a visual ERP speller to meet the requirements of LLP. For evaluation, we ran simulations on artificially created data sets and conducted an online BCI study with 13 subjects performing a copy-spelling task. Theoretical considerations show that LLP is guaranteed to minimize the loss function similar to a corresponding supervised classifier. LLP performed well in simulations and in the online application, where 84.5% of characters were spelled correctly on average without prior calibration. The continuously adapting LLP classifier is the first unsupervised decoder for ERP BCIs guaranteed to find the optimal decoder. This makes it an ideal solution to avoid tedious calibration sessions. Additionally, LLP works on complementary principles compared to existing unsupervised methods, opening the door for their further enhancement when combined with LLP.

Learning from label proportions in brain-computer interfaces: Online unsupervised learning with guarantees

PubMed Central

Verhoeven, Thibault; Schmid, Konstantin; Müller, Klaus-Robert; Tangermann, Michael; Kindermans, Pieter-Jan

2017-01-01

Objective Using traditional approaches, a brain-computer interface (BCI) requires the collection of calibration data for new subjects prior to online use. Calibration time can be reduced or eliminated e.g., by subject-to-subject transfer of a pre-trained classifier or unsupervised adaptive classification methods which learn from scratch and adapt over time. While such heuristics work well in practice, none of them can provide theoretical guarantees. Our objective is to modify an event-related potential (ERP) paradigm to work in unison with the machine learning decoder, and thus to achieve a reliable unsupervised calibrationless decoding with a guarantee to recover the true class means. Method We introduce learning from label proportions (LLP) to the BCI community as a new unsupervised, and easy-to-implement classification approach for ERP-based BCIs. The LLP estimates the mean target and non-target responses based on known proportions of these two classes in different groups of the data. We present a visual ERP speller to meet the requirements of LLP. For evaluation, we ran simulations on artificially created data sets and conducted an online BCI study with 13 subjects performing a copy-spelling task. Results Theoretical considerations show that LLP is guaranteed to minimize the loss function similar to a corresponding supervised classifier. LLP performed well in simulations and in the online application, where 84.5% of characters were spelled correctly on average without prior calibration. Significance The continuously adapting LLP classifier is the first unsupervised decoder for ERP BCIs guaranteed to find the optimal decoder. This makes it an ideal solution to avoid tedious calibration sessions. Additionally, LLP works on complementary principles compared to existing unsupervised methods, opening the door for their further enhancement when combined with LLP. PMID:28407016

7 CFR 2201.25 - Performance Agreement.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 7 Agriculture 15 2014-01-01 2014-01-01 false Performance Agreement. 2201.25 Section 2201.25... Agreement. (a) The Borrower of a Loan guaranteed under the Program shall enter into a Performance Agreement... to meet its stipulated Performance Agreement entered into under paragraph (a) of this section. ...

7 CFR 2201.25 - Performance Agreement.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 7 Agriculture 15 2011-01-01 2011-01-01 false Performance Agreement. 2201.25 Section 2201.25... Agreement. (a) The Borrower of a Loan guaranteed under the Program shall enter into a Performance Agreement... to meet its stipulated Performance Agreement entered into under paragraph (a) of this section. ...

Diffusion Forecasting Model with Basis Functions from QR-Decomposition

NASA Astrophysics Data System (ADS)

Harlim, John; Yang, Haizhao

2018-06-01

The diffusion forecasting is a nonparametric approach that provably solves the Fokker-Planck PDE corresponding to Itô diffusion without knowing the underlying equation. The key idea of this method is to approximate the solution of the Fokker-Planck equation with a discrete representation of the shift (Koopman) operator on a set of basis functions generated via the diffusion maps algorithm. While the choice of these basis functions is provably optimal under appropriate conditions, computing these basis functions is quite expensive since it requires the eigendecomposition of an N× N diffusion matrix, where N denotes the data size and could be very large. For large-scale forecasting problems, only a few leading eigenvectors are computationally achievable. To overcome this computational bottleneck, a new set of basis functions constructed by orthonormalizing selected columns of the diffusion matrix and its leading eigenvectors is proposed. This computation can be carried out efficiently via the unpivoted Householder QR factorization. The efficiency and effectiveness of the proposed algorithm will be shown in both deterministically chaotic and stochastic dynamical systems; in the former case, the superiority of the proposed basis functions over purely eigenvectors is significant, while in the latter case forecasting accuracy is improved relative to using a purely small number of eigenvectors. Supporting arguments will be provided on three- and six-dimensional chaotic ODEs, a three-dimensional SDE that mimics turbulent systems, and also on the two spatial modes associated with the boreal winter Madden-Julian Oscillation obtained from applying the Nonlinear Laplacian Spectral Analysis on the measured Outgoing Longwave Radiation.

Diffusion Forecasting Model with Basis Functions from QR-Decomposition

NASA Astrophysics Data System (ADS)

Harlim, John; Yang, Haizhao

2017-12-01

The diffusion forecasting is a nonparametric approach that provably solves the Fokker-Planck PDE corresponding to Itô diffusion without knowing the underlying equation. The key idea of this method is to approximate the solution of the Fokker-Planck equation with a discrete representation of the shift (Koopman) operator on a set of basis functions generated via the diffusion maps algorithm. While the choice of these basis functions is provably optimal under appropriate conditions, computing these basis functions is quite expensive since it requires the eigendecomposition of an N× N diffusion matrix, where N denotes the data size and could be very large. For large-scale forecasting problems, only a few leading eigenvectors are computationally achievable. To overcome this computational bottleneck, a new set of basis functions constructed by orthonormalizing selected columns of the diffusion matrix and its leading eigenvectors is proposed. This computation can be carried out efficiently via the unpivoted Householder QR factorization. The efficiency and effectiveness of the proposed algorithm will be shown in both deterministically chaotic and stochastic dynamical systems; in the former case, the superiority of the proposed basis functions over purely eigenvectors is significant, while in the latter case forecasting accuracy is improved relative to using a purely small number of eigenvectors. Supporting arguments will be provided on three- and six-dimensional chaotic ODEs, a three-dimensional SDE that mimics turbulent systems, and also on the two spatial modes associated with the boreal winter Madden-Julian Oscillation obtained from applying the Nonlinear Laplacian Spectral Analysis on the measured Outgoing Longwave Radiation.

Action Centered Contextual Bandits.

PubMed

Greenewald, Kristjan; Tewari, Ambuj; Klasnja, Predrag; Murphy, Susan

2017-12-01

Contextual bandits have become popular as they offer a middle ground between very simple approaches based on multi-armed bandits and very complex approaches using the full power of reinforcement learning. They have demonstrated success in web applications and have a rich body of associated theoretical guarantees. Linear models are well understood theoretically and preferred by practitioners because they are not only easily interpretable but also simple to implement and debug. Furthermore, if the linear model is true, we get very strong performance guarantees. Unfortunately, in emerging applications in mobile health, the time-invariant linear model assumption is untenable. We provide an extension of the linear model for contextual bandits that has two parts: baseline reward and treatment effect. We allow the former to be complex but keep the latter simple. We argue that this model is plausible for mobile health applications. At the same time, it leads to algorithms with strong performance guarantees as in the linear model setting, while still allowing for complex nonlinear baseline modeling. Our theory is supported by experiments on data gathered in a recently concluded mobile health study.

Guaranteed cost control of polynomial fuzzy systems via a sum of squares approach.

PubMed

Tanaka, Kazuo; Ohtake, Hiroshi; Wang, Hua O

2009-04-01

This paper presents the guaranteed cost control of polynomial fuzzy systems via a sum of squares (SOS) approach. First, we present a polynomial fuzzy model and controller that are more general representations of the well-known Takagi-Sugeno (T-S) fuzzy model and controller, respectively. Second, we derive a guaranteed cost control design condition based on polynomial Lyapunov functions. Hence, the design approach discussed in this paper is more general than the existing LMI approaches (to T-S fuzzy control system designs) based on quadratic Lyapunov functions. The design condition realizes a guaranteed cost control by minimizing the upper bound of a given performance function. In addition, the design condition in the proposed approach can be represented in terms of SOS and is numerically (partially symbolically) solved via the recent developed SOSTOOLS. To illustrate the validity of the design approach, two design examples are provided. The first example deals with a complicated nonlinear system. The second example presents micro helicopter control. Both the examples show that our approach provides more extensive design results for the existing LMI approach.

Simple expression for the quantum Fisher information matrix

NASA Astrophysics Data System (ADS)

Šafránek, Dominik

2018-04-01

Quantum Fisher information matrix (QFIM) is a cornerstone of modern quantum metrology and quantum information geometry. Apart from optimal estimation, it finds applications in description of quantum speed limits, quantum criticality, quantum phase transitions, coherence, entanglement, and irreversibility. We derive a surprisingly simple formula for this quantity, which, unlike previously known general expression, does not require diagonalization of the density matrix, and is provably at least as efficient. With a minor modification, this formula can be used to compute QFIM for any finite-dimensional density matrix. Because of its simplicity, it could also shed more light on the quantum information geometry in general.

Completing and Adapting Models of Biological Processes

NASA Technical Reports Server (NTRS)

Margaria, Tiziana; Hinchey, Michael G.; Raffelt, Harald; Rash, James L.; Rouff, Christopher A.; Steffen, Bernhard

2006-01-01

We present a learning-based method for model completion and adaptation, which is based on the combination of two approaches: 1) R2D2C, a technique for mechanically transforming system requirements via provably equivalent models to running code, and 2) automata learning-based model extrapolation. The intended impact of this new combination is to make model completion and adaptation accessible to experts of the field, like biologists or engineers. The principle is briefly illustrated by generating models of biological procedures concerning gene activities in the production of proteins, although the main application is going to concern autonomic systems for space exploration.

Provably secure time distribution for the electric grid

DOE Office of Scientific and Technical Information (OSTI.GOV)

Smith IV, Amos M; Evans, Philip G; Williams, Brian P

We demonstrate a quantum time distribution (QTD) method that combines the precision of optical timing techniques with the integrity of quantum key distribution (QKD). Critical infrastructure is dependent on microprocessor- and programmable logic-based monitoring and control systems. The distribution of timing information across the electric grid is accomplished by GPS signals which are known to be vulnerable to spoofing. We demonstrate a method for synchronizing remote clocks based on the arrival time of photons in a modifed QKD system. This has the advantage that the signal can be veried by examining the quantum states of the photons similar to QKD.

A Secure and Efficient Handover Authentication Protocol for Wireless Networks

PubMed Central

Wang, Weijia; Hu, Lei

2014-01-01

Handover authentication protocol is a promising access control technology in the fields of WLANs and mobile wireless sensor networks. In this paper, we firstly review an efficient handover authentication protocol, named PairHand, and its existing security attacks and improvements. Then, we present an improved key recovery attack by using the linearly combining method and reanalyze its feasibility on the improved PairHand protocol. Finally, we present a new handover authentication protocol, which not only achieves the same desirable efficiency features of PairHand, but enjoys the provable security in the random oracle model. PMID:24971471

Cryptographic Securities Exchanges

NASA Astrophysics Data System (ADS)

Thorpe, Christopher; Parkes, David C.

While transparency in financial markets should enhance liquidity, its exploitation by unethical and parasitic traders discourages others from fully embracing disclosure of their own information. Traders exploit both the private information in upstairs markets used to trade large orders outside traditional exchanges and the public information present in exchanges' quoted limit order books. Using homomorphic cryptographic protocols, market designers can create "partially transparent" markets in which every matched trade is provably correct and only beneficial information is revealed. In a cryptographic securities exchange, market operators can hide information to prevent its exploitation, and still prove facts about the hidden information such as bid/ask spread or market depth.

The Science of Computing: Expert Systems

NASA Technical Reports Server (NTRS)

Denning, Peter J.

1986-01-01

The creative urge of human beings is coupled with tremendous reverence for logic. The idea that the ability to reason logically--to be rational--is closely tied to intelligence was clear in the writings of Plato. The search for greater understanding of human intelligence led to the development of mathematical logic, the study of methods of proving the truth of statements by manipulating the symbols in which they are written without regard to the meanings of those symbols. By the nineteenth century a search was under way for a universal system of logic, one capable of proving anything provable in any other system.

13 CFR 400.215 - Supplemental Guarantees.

Code of Federal Regulations, 2012 CFR

2012-01-01

... Section 400.215 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.215 Supplemental Guarantees. The Board will allow the structure of a guaranteed loan to include one or more Supplemental Guarantees that cover the Unguaranteed...

13 CFR 400.215 - Supplemental Guarantees.

Code of Federal Regulations, 2011 CFR

2011-01-01

... Section 400.215 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.215 Supplemental Guarantees. The Board will allow the structure of a guaranteed loan to include one or more Supplemental Guarantees that cover the Unguaranteed...

13 CFR 400.215 - Supplemental Guarantees.

Code of Federal Regulations, 2014 CFR

2014-01-01

... Section 400.215 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.215 Supplemental Guarantees. The Board will allow the structure of a guaranteed loan to include one or more Supplemental Guarantees that cover the Unguaranteed...

13 CFR 400.215 - Supplemental Guarantees.

Code of Federal Regulations, 2010 CFR

2010-01-01

... Section 400.215 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.215 Supplemental Guarantees. The Board will allow the structure of a guaranteed loan to include one or more Supplemental Guarantees that cover the Unguaranteed...

13 CFR 400.215 - Supplemental Guarantees.

Code of Federal Regulations, 2013 CFR

2013-01-01

... Section 400.215 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.215 Supplemental Guarantees. The Board will allow the structure of a guaranteed loan to include one or more Supplemental Guarantees that cover the Unguaranteed...

Sequence-based heuristics for faster annotation of non-coding RNA families.

PubMed

Weinberg, Zasha; Ruzzo, Walter L

2006-01-01

Non-coding RNAs (ncRNAs) are functional RNA molecules that do not code for proteins. Covariance Models (CMs) are a useful statistical tool to find new members of an ncRNA gene family in a large genome database, using both sequence and, importantly, RNA secondary structure information. Unfortunately, CM searches are extremely slow. Previously, we created rigorous filters, which provably sacrifice none of a CM's accuracy, while making searches significantly faster for virtually all ncRNA families. However, these rigorous filters make searches slower than heuristics could be. In this paper we introduce profile HMM-based heuristic filters. We show that their accuracy is usually superior to heuristics based on BLAST. Moreover, we compared our heuristics with those used in tRNAscan-SE, whose heuristics incorporate a significant amount of work specific to tRNAs, where our heuristics are generic to any ncRNA. Performance was roughly comparable, so we expect that our heuristics provide a high-quality solution that--unlike family-specific solutions--can scale to hundreds of ncRNA families. The source code is available under GNU Public License at the supplementary web site.

Completely device-independent quantum key distribution

NASA Astrophysics Data System (ADS)

Aguilar, Edgar A.; Ramanathan, Ravishankar; Kofler, Johannes; Pawłowski, Marcin

2016-08-01

Quantum key distribution (QKD) is a provably secure way for two distant parties to establish a common secret key, which then can be used in a classical cryptographic scheme. Using quantum entanglement, one can reduce the necessary assumptions that the parties have to make about their devices, giving rise to device-independent QKD (DIQKD). However, in all existing protocols to date the parties need to have an initial (at least partially) random seed as a resource. In this work, we show that this requirement can be dropped. Using recent advances in the fields of randomness amplification and randomness expansion, we demonstrate that it is sufficient for the message the parties want to communicate to be (partially) unknown to the adversaries—an assumption without which any type of cryptography would be pointless to begin with. One party can use her secret message to locally generate a secret sequence of bits, which can then be openly used by herself and the other party in a DIQKD protocol. Hence our work reduces the requirements needed to perform secure DIQKD and establish safe communication.

FRR: fair remote retrieval of outsourced private medical records in electronic health networks.

PubMed

Wang, Huaqun; Wu, Qianhong; Qin, Bo; Domingo-Ferrer, Josep

2014-08-01

Cloud computing is emerging as the next-generation IT architecture. However, cloud computing also raises security and privacy concerns since the users have no physical control over the outsourced data. This paper focuses on fairly retrieving encrypted private medical records outsourced to remote untrusted cloud servers in the case of medical accidents and disputes. Our goal is to enable an independent committee to fairly recover the original private medical records so that medical investigation can be carried out in a convincing way. We achieve this goal with a fair remote retrieval (FRR) model in which either t investigation committee members cooperatively retrieve the original medical data or none of them can get any information on the medical records. We realize the first FRR scheme by exploiting fair multi-member key exchange and homomorphic privately verifiable tags. Based on the standard computational Diffie-Hellman (CDH) assumption, our scheme is provably secure in the random oracle model (ROM). A detailed performance analysis and experimental results show that our scheme is efficient in terms of communication and computation. Copyright © 2014 Elsevier Inc. All rights reserved.

7 CFR 1720.14 - Nature of guarantee; acceleration of guaranteed bonds.

Code of Federal Regulations, 2012 CFR

2012-01-01

... 7 Agriculture 11 2012-01-01 2012-01-01 false Nature of guarantee; acceleration of guaranteed bonds. 1720.14 Section 1720.14 Agriculture Regulations of the Department of Agriculture (Continued) RURAL... TELEPHONE PURPOSES § 1720.14 Nature of guarantee; acceleration of guaranteed bonds. (a) Any guarantee...

7 CFR 1720.14 - Nature of guarantee; acceleration of guaranteed bonds.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 7 Agriculture 11 2010-01-01 2010-01-01 false Nature of guarantee; acceleration of guaranteed bonds. 1720.14 Section 1720.14 Agriculture Regulations of the Department of Agriculture (Continued) RURAL... TELEPHONE PURPOSES § 1720.14 Nature of guarantee; acceleration of guaranteed bonds. (a) Any guarantee...

7 CFR 1720.14 - Nature of guarantee; acceleration of guaranteed bonds.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 7 Agriculture 11 2011-01-01 2011-01-01 false Nature of guarantee; acceleration of guaranteed bonds. 1720.14 Section 1720.14 Agriculture Regulations of the Department of Agriculture (Continued) RURAL... TELEPHONE PURPOSES § 1720.14 Nature of guarantee; acceleration of guaranteed bonds. (a) Any guarantee...

7 CFR 1720.14 - Nature of guarantee; acceleration of guaranteed bonds.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 7 Agriculture 11 2014-01-01 2014-01-01 false Nature of guarantee; acceleration of guaranteed bonds. 1720.14 Section 1720.14 Agriculture Regulations of the Department of Agriculture (Continued) RURAL... TELEPHONE PURPOSES § 1720.14 Nature of guarantee; acceleration of guaranteed bonds. (a) Any guarantee...

7 CFR 1720.14 - Nature of guarantee; acceleration of guaranteed bonds.

Code of Federal Regulations, 2013 CFR

2013-01-01

... 7 Agriculture 11 2013-01-01 2013-01-01 false Nature of guarantee; acceleration of guaranteed bonds. 1720.14 Section 1720.14 Agriculture Regulations of the Department of Agriculture (Continued) RURAL... TELEPHONE PURPOSES § 1720.14 Nature of guarantee; acceleration of guaranteed bonds. (a) Any guarantee...

Choosing a design to fit the situation: how to improve specificity and positive predictive values using Bayesian lot quality assurance sampling.

PubMed

Olives, Casey; Pagano, Marcello

2013-02-01

Lot Quality Assurance Sampling (LQAS) is a provably useful tool for monitoring health programmes. Although LQAS ensures acceptable Producer and Consumer risks, the literature alleges that the method suffers from poor specificity and positive predictive values (PPVs). We suggest that poor LQAS performance is due, in part, to variation in the true underlying distribution. However, until now the role of the underlying distribution in expected performance has not been adequately examined. We present Bayesian-LQAS (B-LQAS), an approach to incorporating prior information into the choice of the LQAS sample size and decision rule, and explore its properties through a numerical study. Additionally, we analyse vaccination coverage data from UNICEF's State of the World's Children in 1968-1989 and 2008 to exemplify the performance of LQAS and B-LQAS. Results of our numerical study show that the choice of LQAS sample size and decision rule is sensitive to the distribution of prior information, as well as to individual beliefs about the importance of correct classification. Application of the B-LQAS approach to the UNICEF data improves specificity and PPV in both time periods (1968-1989 and 2008) with minimal reductions in sensitivity and negative predictive value. LQAS is shown to be a robust tool that is not necessarily prone to poor specificity and PPV as previously alleged. In situations where prior or historical data are available, B-LQAS can lead to improvements in expected performance.

1-RAAP: An Efficient 1-Round Anonymous Authentication Protocol for Wireless Body Area Networks

PubMed Central

Liu, Jingwei; Zhang, Lihuan; Sun, Rong

2016-01-01

Thanks to the rapid technological convergence of wireless communications, medical sensors and cloud computing, Wireless Body Area Networks (WBANs) have emerged as a novel networking paradigm enabling ubiquitous Internet services, allowing people to receive medical care, monitor health status in real-time, analyze sports data and even enjoy online entertainment remotely. However, because of the mobility and openness of wireless communications, WBANs are inevitably exposed to a large set of potential attacks, significantly undermining their utility and impeding their widespread deployment. To prevent attackers from threatening legitimate WBAN users or abusing WBAN services, an efficient and secure authentication protocol termed 1-Round Anonymous Authentication Protocol (1-RAAP) is proposed in this paper. In particular, 1-RAAP preserves anonymity, mutual authentication, non-repudiation and some other desirable security properties, while only requiring users to perform several low cost computational operations. More importantly, 1-RAAP is provably secure thanks to its design basis, which is resistant to the anonymous in the random oracle model. To validate the computational efficiency of 1-RAAP, a set of comprehensive comparative studies between 1-RAAP and other authentication protocols is conducted, and the results clearly show that 1-RAAP achieves the best performance in terms of computational overhead. PMID:27213384

1-RAAP: An Efficient 1-Round Anonymous Authentication Protocol for Wireless Body Area Networks.

PubMed

Liu, Jingwei; Zhang, Lihuan; Sun, Rong

2016-05-19

Thanks to the rapid technological convergence of wireless communications, medical sensors and cloud computing, Wireless Body Area Networks (WBANs) have emerged as a novel networking paradigm enabling ubiquitous Internet services, allowing people to receive medical care, monitor health status in real-time, analyze sports data and even enjoy online entertainment remotely. However, because of the mobility and openness of wireless communications, WBANs are inevitably exposed to a large set of potential attacks, significantly undermining their utility and impeding their widespread deployment. To prevent attackers from threatening legitimate WBAN users or abusing WBAN services, an efficient and secure authentication protocol termed 1-Round Anonymous Authentication Protocol (1-RAAP) is proposed in this paper. In particular, 1-RAAP preserves anonymity, mutual authentication, non-repudiation and some other desirable security properties, while only requiring users to perform several low cost computational operations. More importantly, 1-RAAP is provably secure thanks to its design basis, which is resistant to the anonymous in the random oracle model. To validate the computational efficiency of 1-RAAP, a set of comprehensive comparative studies between 1-RAAP and other authentication protocols is conducted, and the results clearly show that 1-RAAP achieves the best performance in terms of computational overhead.

Using Performance-Based Risk-Sharing Arrangements to Address Uncertainty in Indication-Based Pricing.

PubMed

Yeung, Kai; Li, Meng; Carlson, Josh J

2017-10-01

The rise in pharmaceutical expenditures in recent years has increased health care payer interest in ensuring good value for the money. Indication-based pricing (IBP) sets separate, indication-specific prices paid to the manufacturer according to the expected efficacy of a drug in each of its indications. IBP allows payers to consistently pay for value across indications. While promising, a limitation of IBP as originally conceived is that efficacy estimates are typically based on clinical trial data, which may differ from real-world effectiveness. An outcomes guarantee is a type of performance-based risk-sharing arrangement that adjusts payments according to prospectively tracked outcomes. We suggest that an outcomes guarantee contract, which has been used by some payers, may be adapted to achieve indication-based prices supported by real-world effectiveness. To illustrate the potential of an outcomes guarantee to achieve indication-based prices aligned with real-world value, using a case study of trastuzumab for the treatment of metastatic breast and advanced gastric cancers. We estimated costs and outcomes under traditional IBP (i.e., expected value IBP) and outcomes guarantee frameworks and calculated incremental cost-effectiveness ratios (ICERs) comparing treatment with and without trastuzumab. Efficacy data came from pivotal trials, whereas effectiveness data came from observational studies. We adjusted trastuzumab prices in order to achieve target ICERs of $150,000 per quality-adjusted life-year under each framework and for each indication. To achieve the ICER target under traditional IBP, the unit price of trastuzumab using efficacy evidence was adjusted for metastatic breast and advanced gastric cancers from an average sales price of $9.17 per mg to $3.50 per mg and $0.93 per mg, respectively. Under an outcomes guarantee, the unit price of trastuzumab using effectiveness evidence was adjusted for metastatic breast cancer and advanced gastric cancer to $8.66 per mg and $0.20 per mg, respectively. Like expected value IBP, outcomes guarantee contracts can also vary payment based on indication. In addition, an outcomes guarantee can also reduce uncertainty regarding effectiveness and better align payment with the actual value of a treatment. No funding supported this study. Carlson reports consulting fees from Genentech, Pfizer, and Seattle Genetics. The other authors have no conflicts of interest to disclose. Study concept and design were contributed by Carlson, Yeung, and Li. Yeung, Carlson, and Li collected and analyzed the data. The manuscript was written primarily by Yeung, along with Carlson and Li, and revised by all the authors.

Observer-based state tracking control of uncertain stochastic systems via repetitive controller

NASA Astrophysics Data System (ADS)

Sakthivel, R.; Susana Ramya, L.; Selvaraj, P.

2017-08-01

This paper develops the repetitive control scheme for state tracking control of uncertain stochastic time-varying delay systems via equivalent-input-disturbance approach. The main purpose of this work is to design a repetitive controller to guarantee the tracking performance under the effects of unknown disturbances with bounded frequency and parameter variations. Specifically, a new set of linear matrix inequality (LMI)-based conditions is derived based on the suitable Lyapunov-Krasovskii functional theory for designing a repetitive controller which guarantees stability and desired tracking performance. More precisely, an equivalent-input-disturbance estimator is incorporated into the control design to reduce the effect of the external disturbances. Simulation results are provided to demonstrate the desired control system stability and their tracking performance. A practical stream water quality preserving system is also provided to show the effectiveness and advantage of the proposed approach.

A critical analysis of computational protein design with sparse residue interaction graphs

PubMed Central

Georgiev, Ivelin S.

2017-01-01

Protein design algorithms enumerate a combinatorial number of candidate structures to compute the Global Minimum Energy Conformation (GMEC). To efficiently find the GMEC, protein design algorithms must methodically reduce the conformational search space. By applying distance and energy cutoffs, the protein system to be designed can thus be represented using a sparse residue interaction graph, where the number of interacting residue pairs is less than all pairs of mutable residues, and the corresponding GMEC is called the sparse GMEC. However, ignoring some pairwise residue interactions can lead to a change in the energy, conformation, or sequence of the sparse GMEC vs. the original or the full GMEC. Despite the widespread use of sparse residue interaction graphs in protein design, the above mentioned effects of their use have not been previously analyzed. To analyze the costs and benefits of designing with sparse residue interaction graphs, we computed the GMECs for 136 different protein design problems both with and without distance and energy cutoffs, and compared their energies, conformations, and sequences. Our analysis shows that the differences between the GMECs depend critically on whether or not the design includes core, boundary, or surface residues. Moreover, neglecting long-range interactions can alter local interactions and introduce large sequence differences, both of which can result in significant structural and functional changes. Designs on proteins with experimentally measured thermostability show it is beneficial to compute both the full and the sparse GMEC accurately and efficiently. To this end, we show that a provable, ensemble-based algorithm can efficiently compute both GMECs by enumerating a small number of conformations, usually fewer than 1000. This provides a novel way to combine sparse residue interaction graphs with provable, ensemble-based algorithms to reap the benefits of sparse residue interaction graphs while avoiding their potential inaccuracies. PMID:28358804

iGen: An automated generator of simplified models with provable error bounds.

NASA Astrophysics Data System (ADS)

Tang, D.; Dobbie, S.

2009-04-01

Climate models employ various simplifying assumptions and parameterisations in order to increase execution speed. However, in order to draw conclusions about the Earths climate from the results of a climate simulation it is necessary to have information about the error that these assumptions and parameterisations introduce. A novel computer program, called iGen, is being developed which automatically generates fast, simplified models by analysing the source code of a slower, high resolution model. The resulting simplified models have provable bounds on error compared to the high resolution model and execute at speeds that are typically orders of magnitude faster. iGen's input is a definition of the prognostic variables of the simplified model, a set of bounds on acceptable error and the source code of a model that captures the behaviour of interest. In the case of an atmospheric model, for example, this would be a global cloud resolving model with very high resolution. Although such a model would execute far too slowly to be used directly in a climate model, iGen never executes it. Instead, it converts the code of the resolving model into a mathematical expression which is then symbolically manipulated and approximated to form a simplified expression. This expression is then converted back into a computer program and output as a simplified model. iGen also derives and reports formal bounds on the error of the simplified model compared to the resolving model. These error bounds are always maintained below the user-specified acceptable error. Results will be presented illustrating the success of iGen's analysis of a number of example models. These extremely encouraging results have lead on to work which is currently underway to analyse a cloud resolving model and so produce an efficient parameterisation of moist convection with formally bounded error.

76 FR 9962 - Surety Bond Guarantee Program; Timber Sales

Federal Register 2010, 2011, 2012, 2013, 2014

2011-02-23

... and performance bonds for timber sale contracts awarded by the Federal Government or other public and... that the exception for timber sale contracts applies only to bid and performance bonds. Bid bonds are..., except for contracts in connection with bid and performance bonds for the sale of timber and/or other...

7 CFR 1493.60 - Payment guarantee.

Code of Federal Regulations, 2013 CFR

2013-01-01

... OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Export Credit Guarantee Program (GSM-102) and CCC Intermediate Export Credit Guarantee Program (GSM-103) Operations § 1493.60 Payment guarantee. (a) CCC's obligation. The payment guarantee will provide that CCC agrees to pay the...

7 CFR 1493.60 - Payment guarantee.

Code of Federal Regulations, 2010 CFR

2010-01-01

... OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Export Credit Guarantee Program (GSM-102) and CCC Intermediate Export Credit Guarantee Program (GSM-103) Operations § 1493.60 Payment guarantee. (a) CCC's obligation. The payment guarantee will provide that CCC...

7 CFR 1493.60 - Payment guarantee.

Code of Federal Regulations, 2014 CFR

2014-01-01

... OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Export Credit Guarantee Program (GSM-102) and CCC Intermediate Export Credit Guarantee Program (GSM-103) Operations § 1493.60 Payment guarantee. (a) CCC's obligation. The payment guarantee will provide that CCC agrees to pay the...

7 CFR 1493.60 - Payment guarantee.

Code of Federal Regulations, 2011 CFR

2011-01-01

... OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Export Credit Guarantee Program (GSM-102) and CCC Intermediate Export Credit Guarantee Program (GSM-103) Operations § 1493.60 Payment guarantee. (a) CCC's obligation. The payment guarantee will provide that CCC...

7 CFR 1493.60 - Payment guarantee.

Code of Federal Regulations, 2012 CFR

2012-01-01

... OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Export Credit Guarantee Program (GSM-102) and CCC Intermediate Export Credit Guarantee Program (GSM-103) Operations § 1493.60 Payment guarantee. (a) CCC's obligation. The payment guarantee will provide that CCC agrees to pay the...

22 CFR 221.12 - Guarantee eligibility.

Code of Federal Regulations, 2014 CFR

2014-04-01

... 22 Foreign Relations 1 2014-04-01 2014-04-01 false Guarantee eligibility. 221.12 Section 221.12 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEE STANDARD TERMS AND CONDITIONS The Guarantee § 221.12 Guarantee eligibility. (a) Eligible Notes only may be guaranteed hereunder...

22 CFR 221.12 - Guarantee eligibility.

Code of Federal Regulations, 2012 CFR

2012-04-01

... 22 Foreign Relations 1 2012-04-01 2012-04-01 false Guarantee eligibility. 221.12 Section 221.12 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEE STANDARD TERMS AND CONDITIONS The Guarantee § 221.12 Guarantee eligibility. (a) Eligible Notes only may be guaranteed hereunder...

22 CFR 221.12 - Guarantee eligibility.

Code of Federal Regulations, 2013 CFR

2013-04-01

... 22 Foreign Relations 1 2013-04-01 2013-04-01 false Guarantee eligibility. 221.12 Section 221.12 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEE STANDARD TERMS AND CONDITIONS The Guarantee § 221.12 Guarantee eligibility. (a) Eligible Notes only may be guaranteed hereunder...

22 CFR 221.12 - Guarantee eligibility.

Code of Federal Regulations, 2011 CFR

2011-04-01

... 22 Foreign Relations 1 2011-04-01 2011-04-01 false Guarantee eligibility. 221.12 Section 221.12 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEE STANDARD TERMS AND CONDITIONS The Guarantee § 221.12 Guarantee eligibility. (a) Eligible Notes only may be guaranteed hereunder...

22 CFR 221.12 - Guarantee eligibility.

Code of Federal Regulations, 2010 CFR

2010-04-01

... 22 Foreign Relations 1 2010-04-01 2010-04-01 false Guarantee eligibility. 221.12 Section 221.12 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEE STANDARD TERMS AND CONDITIONS The Guarantee § 221.12 Guarantee eligibility. (a) Eligible Notes only may be guaranteed hereunder...

7 CFR 1493.450 - Payment guarantee.

Code of Federal Regulations, 2013 CFR

2013-01-01

... OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Supplier Credit Guarantee Program Operations § 1493.450 Payment guarantee. (a) CCC's obligation. The payment guarantee will provide that CCC agrees to pay the exporter or the exporter's assignee an amount not to exceed the guaranteed...

7 CFR 1493.450 - Payment guarantee.

Code of Federal Regulations, 2012 CFR

2012-01-01

... OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Supplier Credit Guarantee Program Operations § 1493.450 Payment guarantee. (a) CCC's obligation. The payment guarantee will provide that CCC agrees to pay the exporter or the exporter's assignee an amount not to exceed the guaranteed...

7 CFR 1493.450 - Payment guarantee.

Code of Federal Regulations, 2014 CFR

2014-01-01

... OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Supplier Credit Guarantee Program Operations § 1493.450 Payment guarantee. (a) CCC's obligation. The payment guarantee will provide that CCC agrees to pay the exporter or the exporter's assignee an amount not to exceed the guaranteed...

7 CFR 1720.9 - Guarantee Agreement.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 7 Agriculture 11 2014-01-01 2014-01-01 false Guarantee Agreement. 1720.9 Section 1720.9... Agreement. (a) The guaranteed lender will be required to sign a guarantee agreement with the Secretary... bonds. (b) The guaranteed bonds shall refer to the guarantee agreement as controlling the terms of the...

7 CFR 1710.52 - Loan guarantees.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 7 Agriculture 11 2010-01-01 2010-01-01 false Loan guarantees. 1710.52 Section 1710.52 Agriculture... GENERAL AND PRE-LOAN POLICIES AND PROCEDURES COMMON TO ELECTRIC LOANS AND GUARANTEES Types of Loans and Loan Guarantees § 1710.52 Loan guarantees. RUS provides financing through 100 percent loan guarantees...

13 CFR 400.203 - Guarantee percentage.

Code of Federal Regulations, 2012 CFR

2012-01-01

... Section 400.203 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.203 Guarantee percentage. A guarantee issued by the Board may not exceed 85 percent of the amount of the principal of a loan to a Qualified Steel Company...

13 CFR 400.203 - Guarantee percentage.

Code of Federal Regulations, 2013 CFR

2013-01-01

... Section 400.203 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.203 Guarantee percentage. A guarantee issued by the Board may not exceed 85 percent of the amount of the principal of a loan to a Qualified Steel Company...

13 CFR 400.208 - Issuance of the Guarantee.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 13 Business Credit and Assistance 1 2014-01-01 2014-01-01 false Issuance of the Guarantee. 400.208 Section 400.208 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.208 Issuance of the Guarantee. (a) The Board's decisions...

13 CFR 400.208 - Issuance of the Guarantee.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 13 Business Credit and Assistance 1 2010-01-01 2010-01-01 false Issuance of the Guarantee. 400.208 Section 400.208 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.208 Issuance of the Guarantee. (a) The Board's decisions...

13 CFR 400.208 - Issuance of the Guarantee.

Code of Federal Regulations, 2013 CFR

2013-01-01

... 13 Business Credit and Assistance 1 2013-01-01 2013-01-01 false Issuance of the Guarantee. 400.208 Section 400.208 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.208 Issuance of the Guarantee. (a) The Board's decisions...

13 CFR 400.208 - Issuance of the Guarantee.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 13 Business Credit and Assistance 1 2011-01-01 2011-01-01 false Issuance of the Guarantee. 400.208 Section 400.208 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.208 Issuance of the Guarantee. (a) The Board's decisions...

13 CFR 400.203 - Guarantee percentage.

Code of Federal Regulations, 2010 CFR

2010-01-01

... Section 400.203 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.203 Guarantee percentage. A guarantee issued by the Board may not exceed 85 percent of the amount of the principal of a loan to a Qualified Steel Company...

13 CFR 400.203 - Guarantee percentage.

Code of Federal Regulations, 2014 CFR

2014-01-01

... Section 400.203 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.203 Guarantee percentage. A guarantee issued by the Board may not exceed 85 percent of the amount of the principal of a loan to a Qualified Steel Company...

13 CFR 400.208 - Issuance of the Guarantee.

Code of Federal Regulations, 2012 CFR

2012-01-01

... 13 Business Credit and Assistance 1 2012-01-01 2012-01-01 false Issuance of the Guarantee. 400.208 Section 400.208 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.208 Issuance of the Guarantee. (a) The Board's decisions...

13 CFR 400.203 - Guarantee percentage.

Code of Federal Regulations, 2011 CFR

2011-01-01

... Section 400.203 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.203 Guarantee percentage. A guarantee issued by the Board may not exceed 85 percent of the amount of the principal of a loan to a Qualified Steel Company...

Switching State-Feedback LPV Control with Uncertain Scheduling Parameters

NASA Technical Reports Server (NTRS)

He, Tianyi; Al-Jiboory, Ali Khudhair; Swei, Sean Shan-Min; Zhu, Guoming G.

2017-01-01

This paper presents a new method to design Robust Switching State-Feedback Gain-Scheduling (RSSFGS) controllers for Linear Parameter Varying (LPV) systems with uncertain scheduling parameters. The domain of scheduling parameters are divided into several overlapped subregions to undergo hysteresis switching among a family of simultaneously designed LPV controllers over the corresponding subregion with the guaranteed H-infinity performance. The synthesis conditions are given in terms of Parameterized Linear Matrix Inequalities that guarantee both stability and performance at each subregion and associated switching surfaces. The switching stability is ensured by descent parameter-dependent Lyapunov function on switching surfaces. By solving the optimization problem, RSSFGS controller can be obtained for each subregion. A numerical example is given to illustrate the effectiveness of the proposed approach over the non-switching controllers.

75 FR 63419 - Surety Bond Guarantee Program; Timber Sales

Federal Register 2010, 2011, 2012, 2013, 2014

2010-10-15

... timber sale contracts may require the purchaser to furnish a performance bond for satisfactory compliance.... With respect to a Performance Bond involving the sale of timber on land managed by USDA, the Federal... Sales AGENCY: Small Business Administration. ACTION: Proposed rule. SUMMARY: The Small Business...

7 CFR 3565.304 - Lender loan processing responsibilities.

Code of Federal Regulations, 2010 CFR

2010-01-01

..., management and disposition. Unless otherwise permitted by the Agency, the originating lender must perform all loan functions during the period of the guarantee. These functions include servicing, asset management...

Exact folded-band chaotic oscillator.

PubMed

Corron, Ned J; Blakely, Jonathan N

2012-06-01

An exactly solvable chaotic oscillator with folded-band dynamics is shown. The oscillator is a hybrid dynamical system containing a linear ordinary differential equation and a nonlinear switching condition. Bounded oscillations are provably chaotic, and successive waveform maxima yield a one-dimensional piecewise-linear return map with segments of both positive and negative slopes. Continuous-time dynamics exhibit a folded-band topology similar to Rössler's oscillator. An exact solution is written as a linear convolution of a fixed basis pulse and a discrete binary sequence, from which an equivalent symbolic dynamics is obtained. The folded-band topology is shown to be dependent on the symbol grammar.

Identity-Based Verifiably Encrypted Signatures without Random Oracles

NASA Astrophysics Data System (ADS)

Zhang, Lei; Wu, Qianhong; Qin, Bo

Fair exchange protocol plays an important role in electronic commerce in the case of exchanging digital contracts. Verifiably encrypted signatures provide an optimistic solution to these scenarios with an off-line trusted third party. In this paper, we propose an identity-based verifiably encrypted signature scheme. The scheme is non-interactive to generate verifiably encrypted signatures and the resulting encrypted signature consists of only four group elements. Based on the computational Diffie-Hellman assumption, our scheme is proven secure without using random oracles. To the best of our knowledge, this is the first identity-based verifiably encrypted signature scheme provably secure in the standard model.

Can the use of the Leggett-Garg inequality enhance security of the BB84 protocol?

NASA Astrophysics Data System (ADS)

Shenoy H., Akshata; Aravinda, S.; Srikanth, R.; Home, Dipankar

2017-08-01

Prima facie, there are good reasons to answer in the negative the question posed in the title: the Bennett-Brassard 1984 (BB84) protocol is provably secure subject to the assumption of trusted devices, while the Leggett-Garg-type inequality (LGI) does not seem to be readily adaptable to the device independent (DI) or semi-DI scenario. Nevertheless, interestingly, here we identify a specific device attack, which has been shown to render the standard BB84 protocol completely insecure, but against which our formulated LGI-assisted BB84 protocol (based on an appropriate form of LGI) is secure.

Application of a repetitive process setting to design of monotonically convergent iterative learning control

NASA Astrophysics Data System (ADS)

Boski, Marcin; Paszke, Wojciech

2015-11-01

This paper deals with the problem of designing an iterative learning control algorithm for discrete linear systems using repetitive process stability theory. The resulting design produces a stabilizing output feedback controller in the time domain and a feedforward controller that guarantees monotonic convergence in the trial-to-trial domain. The results are also extended to limited frequency range design specification. New design procedure is introduced in terms of linear matrix inequality (LMI) representations, which guarantee the prescribed performances of ILC scheme. A simulation example is given to illustrate the theoretical developments.

13 CFR 400.212 - Guarantee.

Code of Federal Regulations, 2010 CFR

2010-01-01

... Steel Guarantee Loans § 400.212 Guarantee. The Board shall adopt a form of Guarantee to be used by the... of the form of Guarantee must be approved and adopted by the Board. [65 FR 70294, Nov. 22, 2000] ...

Energy Services Company | Climate Neutral Research Campuses | NREL

Science.gov Websites

different corporate and ownership structures. While many are large engineering or equipment manufacturers Services Company Options Performance-based contracts can take different forms including guaranteed energy different financing options for energy performance contracting, please refer to page 13 of the April 2009

48 CFR 1328.101-1 - Policy on use.

Code of Federal Regulations, 2010 CFR

2010-10-01

... REQUIREMENTS BONDS AND INSURANCE Bonds and Other Financial Protections 1328.101-1 Policy on use. The designee authorized to make a class waiver for the requirement to obtain a bid guarantee when a performance bond or a performance and payment bond is required is set forth in CAM 1301.70. ...

7 CFR 2201.29 - Supplemental guarantees.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 7 Agriculture 15 2010-01-01 2010-01-01 false Supplemental guarantees. 2201.29 Section 2201.29 Agriculture Regulations of the Department of Agriculture (Continued) LOCAL TELEVISION LOAN GUARANTEE BOARD LOCAL TELEVISION LOAN GUARANTEE PROGRAM-PROGRAM REGULATIONS Loan Guarantees § 2201.29 Supplemental...

7 CFR 1493.200 - General statement.

Code of Federal Regulations, 2013 CFR

2013-01-01

... OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Facility Guarantee Program... (CCC) Facility Guarantee Program (FGP). CCC will issue facility payment guarantees for project... so, will be incorporated by reference on the face of the facility payment guarantee issued by CCC. ...

7 CFR 1493.200 - General statement.

Code of Federal Regulations, 2012 CFR

2012-01-01

... OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Facility Guarantee Program... (CCC) Facility Guarantee Program (FGP). CCC will issue facility payment guarantees for project... so, will be incorporated by reference on the face of the facility payment guarantee issued by CCC. ...

7 CFR 1493.200 - General statement.

Code of Federal Regulations, 2014 CFR

2014-01-01

... OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Facility Guarantee Program... (CCC) Facility Guarantee Program (FGP). CCC will issue facility payment guarantees for project... so, will be incorporated by reference on the face of the facility payment guarantee issued by CCC. ...

7 CFR 1493.450 - Payment guarantee.

Code of Federal Regulations, 2010 CFR

2010-01-01

... OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Supplier Credit Guarantee Program Operations § 1493.450 Payment guarantee. (a) CCC's obligation. The payment guarantee will provide that CCC agrees to pay the exporter or the exporter's assignee an amount...

7 CFR 1493.450 - Payment guarantee.

Code of Federal Regulations, 2011 CFR

2011-01-01

... OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Supplier Credit Guarantee Program Operations § 1493.450 Payment guarantee. (a) CCC's obligation. The payment guarantee will provide that CCC agrees to pay the exporter or the exporter's assignee an amount...

G2LC: Resources Autoscaling for Real Time Bioinformatics Applications in IaaS.

PubMed

Hu, Rongdong; Liu, Guangming; Jiang, Jingfei; Wang, Lixin

2015-01-01

Cloud computing has started to change the way how bioinformatics research is being carried out. Researchers who have taken advantage of this technology can process larger amounts of data and speed up scientific discovery. The variability in data volume results in variable computing requirements. Therefore, bioinformatics researchers are pursuing more reliable and efficient methods for conducting sequencing analyses. This paper proposes an automated resource provisioning method, G2LC, for bioinformatics applications in IaaS. It enables application to output the results in a real time manner. Its main purpose is to guarantee applications performance, while improving resource utilization. Real sequence searching data of BLAST is used to evaluate the effectiveness of G2LC. Experimental results show that G2LC guarantees the application performance, while resource is saved up to 20.14%.

Case studies of pre-engineered and manufactured sound isolation rooms for music practice and radio broadcast

NASA Astrophysics Data System (ADS)

Probst, Ron N.; Rypka, Dann

2005-09-01

Pre-engineered and manufactured sound isolation rooms were developed to ensure guaranteed sound isolation while offering the unique ability to be disassembled and relocated without loss of acoustic performance. Case studies of pre-engineered sound isolation rooms used for music practice and various radio broadcast purposes are highlighted. Three prominent universities wrestle with the challenges of growth and expansion while responding to the specialized acoustic requirements of these spaces. Reduced state funding for universities requires close examination of all options while ensuring sound isolation requirements are achieved. Changing curriculum, renovation, and new construction make pre-engineered and manufactured rooms with guaranteed acoustical performance good investments now and for the future. An added benefit is the optional integration of active acoustics to provide simulations of other spaces or venues along with the benefit of sound isolation.

G2LC: Resources Autoscaling for Real Time Bioinformatics Applications in IaaS

PubMed Central

Hu, Rongdong; Liu, Guangming; Jiang, Jingfei; Wang, Lixin

2015-01-01

Cloud computing has started to change the way how bioinformatics research is being carried out. Researchers who have taken advantage of this technology can process larger amounts of data and speed up scientific discovery. The variability in data volume results in variable computing requirements. Therefore, bioinformatics researchers are pursuing more reliable and efficient methods for conducting sequencing analyses. This paper proposes an automated resource provisioning method, G2LC, for bioinformatics applications in IaaS. It enables application to output the results in a real time manner. Its main purpose is to guarantee applications performance, while improving resource utilization. Real sequence searching data of BLAST is used to evaluate the effectiveness of G2LC. Experimental results show that G2LC guarantees the application performance, while resource is saved up to 20.14%. PMID:26504488

7 CFR 2201.22 - Issuance of Guarantees.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 7 Agriculture 15 2010-01-01 2010-01-01 false Issuance of Guarantees. 2201.22 Section 2201.22 Agriculture Regulations of the Department of Agriculture (Continued) LOCAL TELEVISION LOAN GUARANTEE BOARD LOCAL TELEVISION LOAN GUARANTEE PROGRAM-PROGRAM REGULATIONS Loan Guarantees § 2201.22 Issuance of...

7 CFR 2201.28 - Participation in guaranteed Loans.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 7 Agriculture 15 2010-01-01 2010-01-01 false Participation in guaranteed Loans. 2201.28 Section 2201.28 Agriculture Regulations of the Department of Agriculture (Continued) LOCAL TELEVISION LOAN GUARANTEE BOARD LOCAL TELEVISION LOAN GUARANTEE PROGRAM-PROGRAM REGULATIONS Loan Guarantees § 2201.28...

26 CFR 1.817A-0 - Table of contents.

Code of Federal Regulations, 2010 CFR

2010-04-01

.... (5) Examples. (c) Applicable interest rates for equity-indexed modified guaranteed contracts... appear in section § 1.817A-1: § 1.817A-1Certain modified guaranteed contracts. (a) Definitions. (1) Modified guaranteed contract. (2) Temporary guarantee period. (3) Equity-indexed modified guaranteed...

78 FR 63158 - Information Collection; Guaranteed Farm Loan Program

Federal Register 2010, 2011, 2012, 2013, 2014

2013-10-23

... DEPARTMENT OF AGRICULTURE Farm Service Agency Information Collection; Guaranteed Farm Loan Program... collection associated with the Guaranteed Farm Loan Program. The amended estimate adds the merger of the information collection for the Land Contract Guarantee Program (0560-0279) into the Guaranteed Farm Loan...

The beauty of simple adaptive control and new developments in nonlinear systems stability analysis

DOE Office of Scientific and Technical Information (OSTI.GOV)

Barkana, Itzhak, E-mail: ibarkana@gmail.com

Although various adaptive control techniques have been around for a long time and in spite of successful proofs of stability and even successful demonstrations of performance, the eventual use of adaptive control methodologies in practical real world systems has met a rather strong resistance from practitioners and has remained limited. Apparently, it is difficult to guarantee or even understand the conditions that can guarantee stable operations of adaptive control systems under realistic operational environments. Besides, it is difficult to measure the robustness of adaptive control system stability and allow it to be compared with the common and widely used measuremore » of phase margin and gain margin that is utilized by present, mainly LTI, controllers. Furthermore, customary stability analysis methods seem to imply that the mere stability of adaptive systems may be adversely affected by any tiny deviation from the pretty idealistic and assumably required stability conditions. This paper first revisits the fundamental qualities of customary direct adaptive control methodologies, in particular the classical Model Reference Adaptive Control, and shows that some of their basic drawbacks have been addressed and eliminated within the so-called Simple Adaptive Control methodology. Moreover, recent developments in the stability analysis methods of nonlinear systems show that prior conditions that were customarily assumed to be needed for stability are only apparent and can be eliminated. As a result, sufficient conditions that guarantee stability are clearly stated and lead to similarly clear proofs of stability. As many real-world applications show, once robust stability of the adaptive systems can be guaranteed, the added value of using Add-On Adaptive Control along with classical Control design techniques is pushing the desired performance beyond any previous limits.« less

Choosing a design to fit the situation: how to improve specificity and positive predictive values using Bayesian lot quality assurance sampling

PubMed Central

Olives, Casey; Pagano, Marcello

2013-01-01

Background Lot Quality Assurance Sampling (LQAS) is a provably useful tool for monitoring health programmes. Although LQAS ensures acceptable Producer and Consumer risks, the literature alleges that the method suffers from poor specificity and positive predictive values (PPVs). We suggest that poor LQAS performance is due, in part, to variation in the true underlying distribution. However, until now the role of the underlying distribution in expected performance has not been adequately examined. Methods We present Bayesian-LQAS (B-LQAS), an approach to incorporating prior information into the choice of the LQAS sample size and decision rule, and explore its properties through a numerical study. Additionally, we analyse vaccination coverage data from UNICEF’s State of the World’s Children in 1968–1989 and 2008 to exemplify the performance of LQAS and B-LQAS. Results Results of our numerical study show that the choice of LQAS sample size and decision rule is sensitive to the distribution of prior information, as well as to individual beliefs about the importance of correct classification. Application of the B-LQAS approach to the UNICEF data improves specificity and PPV in both time periods (1968–1989 and 2008) with minimal reductions in sensitivity and negative predictive value. Conclusions LQAS is shown to be a robust tool that is not necessarily prone to poor specificity and PPV as previously alleged. In situations where prior or historical data are available, B-LQAS can lead to improvements in expected performance. PMID:23378151

7 CFR 2201.10 - Loan amount and Guarantee percentage.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 7 Agriculture 15 2010-01-01 2010-01-01 false Loan amount and Guarantee percentage. 2201.10 Section 2201.10 Agriculture Regulations of the Department of Agriculture (Continued) LOCAL TELEVISION LOAN GUARANTEE BOARD LOCAL TELEVISION LOAN GUARANTEE PROGRAM-PROGRAM REGULATIONS Loan Guarantees § 2201.10 Loan...

13 CFR 400.2 - Definitions.

Code of Federal Regulations, 2010 CFR

2010-01-01

... Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM General § 400.2 Definitions. (a) Act means the Emergency Steel Loan Guarantee Act of 1999, Chapter 1 of... institution applying for a loan guarantee under this part. (e) Board means the Emergency Steel Guarantee Loan...

13 CFR 400.2 - Definitions.

Code of Federal Regulations, 2011 CFR

2011-01-01

... Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM General § 400.2 Definitions. (a) Act means the Emergency Steel Loan Guarantee Act of 1999, Chapter 1 of... institution applying for a loan guarantee under this part. (e) Board means the Emergency Steel Guarantee Loan...

22 CFR 221.11 - The Guarantee.

Code of Federal Regulations, 2012 CFR

2012-04-01

... 22 Foreign Relations 1 2012-04-01 2012-04-01 false The Guarantee. 221.11 Section 221.11 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEE STANDARD TERMS AND CONDITIONS The Guarantee § 221.11 The Guarantee. Subject to these terms and conditions, the United States of America...

22 CFR 221.11 - The Guarantee.

Code of Federal Regulations, 2014 CFR

2014-04-01

... 22 Foreign Relations 1 2014-04-01 2014-04-01 false The Guarantee. 221.11 Section 221.11 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEE STANDARD TERMS AND CONDITIONS The Guarantee § 221.11 The Guarantee. Subject to these terms and conditions, the United States of America...

22 CFR 221.14 - Transferability of Guarantee; Note Register.

Code of Federal Regulations, 2014 CFR

2014-04-01

... 22 Foreign Relations 1 2014-04-01 2014-04-01 false Transferability of Guarantee; Note Register. 221.14 Section 221.14 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEE STANDARD TERMS AND CONDITIONS The Guarantee § 221.14 Transferability of Guarantee; Note Register. A...

22 CFR 221.11 - The Guarantee.

Code of Federal Regulations, 2011 CFR

2011-04-01

... 22 Foreign Relations 1 2011-04-01 2011-04-01 false The Guarantee. 221.11 Section 221.11 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEE STANDARD TERMS AND CONDITIONS The Guarantee § 221.11 The Guarantee. Subject to these terms and conditions, the United States of America...

22 CFR 221.11 - The Guarantee.

Code of Federal Regulations, 2013 CFR

2013-04-01

... 22 Foreign Relations 1 2013-04-01 2013-04-01 false The Guarantee. 221.11 Section 221.11 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEE STANDARD TERMS AND CONDITIONS The Guarantee § 221.11 The Guarantee. Subject to these terms and conditions, the United States of America...

22 CFR 221.14 - Transferability of Guarantee; Note Register.

Code of Federal Regulations, 2011 CFR

2011-04-01

... 22 Foreign Relations 1 2011-04-01 2011-04-01 false Transferability of Guarantee; Note Register. 221.14 Section 221.14 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEE STANDARD TERMS AND CONDITIONS The Guarantee § 221.14 Transferability of Guarantee; Note Register. A...

22 CFR 221.14 - Transferability of Guarantee; Note Register.

Code of Federal Regulations, 2013 CFR

2013-04-01

... 22 Foreign Relations 1 2013-04-01 2013-04-01 false Transferability of Guarantee; Note Register. 221.14 Section 221.14 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEE STANDARD TERMS AND CONDITIONS The Guarantee § 221.14 Transferability of Guarantee; Note Register. A...

22 CFR 221.14 - Transferability of Guarantee; Note Register.

Code of Federal Regulations, 2012 CFR

2012-04-01

... 22 Foreign Relations 1 2012-04-01 2012-04-01 false Transferability of Guarantee; Note Register. 221.14 Section 221.14 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEE STANDARD TERMS AND CONDITIONS The Guarantee § 221.14 Transferability of Guarantee; Note Register. A...

22 CFR 221.14 - Transferability of Guarantee; Note Register.

Code of Federal Regulations, 2010 CFR

2010-04-01

... 22 Foreign Relations 1 2010-04-01 2010-04-01 false Transferability of Guarantee; Note Register. 221.14 Section 221.14 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEE STANDARD TERMS AND CONDITIONS The Guarantee § 221.14 Transferability of Guarantee; Note Register. A...

22 CFR 221.11 - The Guarantee.

Code of Federal Regulations, 2010 CFR

2010-04-01

... 22 Foreign Relations 1 2010-04-01 2010-04-01 false The Guarantee. 221.11 Section 221.11 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEE STANDARD TERMS AND CONDITIONS The Guarantee § 221.11 The Guarantee. Subject to these terms and conditions, the United States of America...

Paid health and family leave: the Canadian experience in the global context.

PubMed

Heymann, S Jody; Gerecke, Megan; Chaussard, Martine

2010-01-01

Two thirds of Canadian adults participate in the workforce. Their health and that of their families can be markedly affected by the availability of paid sick leave, paid leave to care for family members' health and paid parental leave. We gathered data from all Canadian provinces and territories on these essential leave policies and compared Canadian policies with data collected on 186 United Nations (UN) countries. While Canada pays sickness benefits for 15 weeks for serious illnesses, globally at least 90 countries provide benefits for at least 26 weeks or until recovery. Moreover, within Canada only Saskatchewan and Quebec guarantee job protection if sick leave lasts over 12 days. The federal government guarantees Canadian workers six weeks of paid leave to provide care or support to gravely ill family members. Only 39 countries guarantee such leave with pay. Most, but not all, provinces guarantee workers' job protection during compassionate care leave. Eligibility for job protection during parental leave varies across the country from having no restrictions to requiring at least one year of service. Compared with Canada, many countries offer a longer duration of paid sick leave for employees and replace a higher percentage of wages lost. Internationally, Canada performs well in having policies that guarantee paid leave to care for dependants with serious illnesses, but it lags behind in the provision of paid leave to address the health needs of children or family members' with non-life-threatening conditions. Finally, while paid parental leave is of adequate duration, the wage replacement rate lowers its accessibility to families with limited means.

Guaranteed Student Loan Program 1981. State Agency Survey.

ERIC Educational Resources Information Center

New York State Higher Education Services Corp., Albany.

Responses to a questionnaire circulated in March 1981 are summarized. Data were gathered from all states regarding the federal Guaranteed Student Loan Program (GSL) and the state guarantee agencies on: guarantee agency organizational types; dates of GSL agreements with the Department of Education; states that guaranteed loans before GSL;…

7 CFR 1493.460 - Guarantee rates and fees.

Code of Federal Regulations, 2013 CFR

2013-01-01

... OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Supplier Credit Guarantee... not be approved until the guarantee fee has been received by CCC. The exporter's check for the guarantee fee shall be made payable to CCC and mailed or delivered by courier to the office specified in the...

7 CFR 1493.460 - Guarantee rates and fees.

Code of Federal Regulations, 2010 CFR

2010-01-01

... OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC... the guarantee fee. Applications will not be approved until the guarantee fee has been received by CCC. The exporter's check for the guarantee fee shall be made payable to CCC and mailed or delivered by...

7 CFR 1493.460 - Guarantee rates and fees.

Code of Federal Regulations, 2011 CFR

2011-01-01

... OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC... the guarantee fee. Applications will not be approved until the guarantee fee has been received by CCC. The exporter's check for the guarantee fee shall be made payable to CCC and mailed or delivered by...

7 CFR 1493.460 - Guarantee rates and fees.

Code of Federal Regulations, 2014 CFR

2014-01-01

... OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Supplier Credit Guarantee... not be approved until the guarantee fee has been received by CCC. The exporter's check for the guarantee fee shall be made payable to CCC and mailed or delivered by courier to the office specified in the...

7 CFR 1493.460 - Guarantee rates and fees.

Code of Federal Regulations, 2012 CFR

2012-01-01

... OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Supplier Credit Guarantee... not be approved until the guarantee fee has been received by CCC. The exporter's check for the guarantee fee shall be made payable to CCC and mailed or delivered by courier to the office specified in the...

A green strategy for federated and heterogeneous clouds with communicating workloads.

PubMed

Mateo, Jordi; Vilaplana, Jordi; Plà, Lluis M; Lérida, Josep Ll; Solsona, Francesc

2014-01-01

Providers of cloud environments must tackle the challenge of configuring their system to provide maximal performance while minimizing the cost of resources used. However, at the same time, they must guarantee an SLA (service-level agreement) to the users. The SLA is usually associated with a certain level of QoS (quality of service). As response time is perhaps the most widely used QoS metric, it was also the one chosen in this work. This paper presents a green strategy (GS) model for heterogeneous cloud systems. We provide a solution for heterogeneous job-communicating tasks and heterogeneous VMs that make up the nodes of the cloud. In addition to guaranteeing the SLA, the main goal is to optimize energy savings. The solution results in an equation that must be solved by a solver with nonlinear capabilities. The results obtained from modelling the policies to be executed by a solver demonstrate the applicability of our proposal for saving energy and guaranteeing the SLA.

A Green Strategy for Federated and Heterogeneous Clouds with Communicating Workloads

PubMed Central

Plà, Lluis M.; Lérida, Josep Ll.

2014-01-01

Providers of cloud environments must tackle the challenge of configuring their system to provide maximal performance while minimizing the cost of resources used. However, at the same time, they must guarantee an SLA (service-level agreement) to the users. The SLA is usually associated with a certain level of QoS (quality of service). As response time is perhaps the most widely used QoS metric, it was also the one chosen in this work. This paper presents a green strategy (GS) model for heterogeneous cloud systems. We provide a solution for heterogeneous job-communicating tasks and heterogeneous VMs that make up the nodes of the cloud. In addition to guaranteeing the SLA, the main goal is to optimize energy savings. The solution results in an equation that must be solved by a solver with nonlinear capabilities. The results obtained from modelling the policies to be executed by a solver demonstrate the applicability of our proposal for saving energy and guaranteeing the SLA. PMID:25478589

MPI-FAUN: An MPI-Based Framework for Alternating-Updating Nonnegative Matrix Factorization

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kannan, Ramakrishnan; Ballard, Grey; Park, Haesun

Non-negative matrix factorization (NMF) is the problem of determining two non-negative low rank factors W and H, for the given input matrix A, such that A≈WH. NMF is a useful tool for many applications in different domains such as topic modeling in text mining, background separation in video analysis, and community detection in social networks. Despite its popularity in the data mining community, there is a lack of efficient parallel algorithms to solve the problem for big data sets. The main contribution of this work is a new, high-performance parallel computational framework for a broad class of NMF algorithms thatmore » iteratively solves alternating non-negative least squares (NLS) subproblems for W and H. It maintains the data and factor matrices in memory (distributed across processors), uses MPI for interprocessor communication, and, in the dense case, provably minimizes communication costs (under mild assumptions). The framework is flexible and able to leverage a variety of NMF and NLS algorithms, including Multiplicative Update, Hierarchical Alternating Least Squares, and Block Principal Pivoting. Our implementation allows us to benchmark and compare different algorithms on massive dense and sparse data matrices of size that spans from few hundreds of millions to billions. We demonstrate the scalability of our algorithm and compare it with baseline implementations, showing significant performance improvements. The code and the datasets used for conducting the experiments are available online.« less

MPI-FAUN: An MPI-Based Framework for Alternating-Updating Nonnegative Matrix Factorization

DOE PAGES

Kannan, Ramakrishnan; Ballard, Grey; Park, Haesun

2017-10-30

Non-negative matrix factorization (NMF) is the problem of determining two non-negative low rank factors W and H, for the given input matrix A, such that A≈WH. NMF is a useful tool for many applications in different domains such as topic modeling in text mining, background separation in video analysis, and community detection in social networks. Despite its popularity in the data mining community, there is a lack of efficient parallel algorithms to solve the problem for big data sets. The main contribution of this work is a new, high-performance parallel computational framework for a broad class of NMF algorithms thatmore » iteratively solves alternating non-negative least squares (NLS) subproblems for W and H. It maintains the data and factor matrices in memory (distributed across processors), uses MPI for interprocessor communication, and, in the dense case, provably minimizes communication costs (under mild assumptions). The framework is flexible and able to leverage a variety of NMF and NLS algorithms, including Multiplicative Update, Hierarchical Alternating Least Squares, and Block Principal Pivoting. Our implementation allows us to benchmark and compare different algorithms on massive dense and sparse data matrices of size that spans from few hundreds of millions to billions. We demonstrate the scalability of our algorithm and compare it with baseline implementations, showing significant performance improvements. The code and the datasets used for conducting the experiments are available online.« less

17 CFR 4.41 - Advertising by commodity pool operators, commodity trading advisors, and the principals thereof.

Code of Federal Regulations, 2011 CFR

2011-04-01

... client; or (3) Refers to any testimonial, unless the advertisement or sales literature providing the... other clients; (ii) That the testimonial is no guarantee of future performance or success; and (iii) If... the performance of any simulated or hypothetical commodity interest account, transaction in a...

7 CFR 1779.73 - Replacement of loss, theft, destruction, mutilation, or defacement of Loan Note Guarantee or...

Code of Federal Regulations, 2010 CFR

2010-01-01

... 7 Agriculture 12 2010-01-01 2010-01-01 false Replacement of loss, theft, destruction, mutilation..., theft, destruction, mutilation, or defacement of Loan Note Guarantee or Assignment Guarantee Agreement... circumstances of the loss, theft, or destruction of the Loan Note Guarantee or Assignment Guarantee Agreement...

78 FR 64175 - Hashemite Kingdom of Jordan Loan Guarantees Issued Under the Further Continuing Appropriations...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-10-28

... procedures and standard terms and conditions applicable to loan guarantees to be issued for the benefit of... Definitions. 233.03 The Guarantee. 233.04 Guarantee eligibility. 233.05 Non-impairment of the Guarantee. 233... Default; Application for Compensation; payment. 233.09 No acceleration of Eligible Notes. [[Page 64176...

26 CFR 1.817A-1 - Certain modified guaranteed contracts.

Code of Federal Regulations, 2011 CFR

2011-04-01

... 26 Internal Revenue 8 2011-04-01 2011-04-01 false Certain modified guaranteed contracts. 1.817A-1... guaranteed contracts. (a) Definitions—(1) Modified guaranteed contract. The term modified guaranteed contract (MGC) is defined in section 817A(d) as an annuity, life insurance, or pension plan contract (other than...

22 CFR 221.13 - Non-impairment of the Guarantee.

Code of Federal Regulations, 2014 CFR

2014-04-01

... 22 Foreign Relations 1 2014-04-01 2014-04-01 false Non-impairment of the Guarantee. 221.13 Section 221.13 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEE STANDARD TERMS AND CONDITIONS The Guarantee § 221.13 Non-impairment of the Guarantee. The full faith and credit of the United...

22 CFR 221.13 - Non-impairment of the Guarantee.

Code of Federal Regulations, 2013 CFR

2013-04-01

... 22 Foreign Relations 1 2013-04-01 2013-04-01 false Non-impairment of the Guarantee. 221.13 Section 221.13 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEE STANDARD TERMS AND CONDITIONS The Guarantee § 221.13 Non-impairment of the Guarantee. The full faith and credit of the United...

22 CFR 221.13 - Non-impairment of the Guarantee.

Code of Federal Regulations, 2012 CFR

2012-04-01

... 22 Foreign Relations 1 2012-04-01 2012-04-01 false Non-impairment of the Guarantee. 221.13 Section 221.13 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEE STANDARD TERMS AND CONDITIONS The Guarantee § 221.13 Non-impairment of the Guarantee. The full faith and credit of the United...

22 CFR 221.13 - Non-impairment of the Guarantee.

Code of Federal Regulations, 2011 CFR

2011-04-01

... 22 Foreign Relations 1 2011-04-01 2011-04-01 false Non-impairment of the Guarantee. 221.13 Section 221.13 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEE STANDARD TERMS AND CONDITIONS The Guarantee § 221.13 Non-impairment of the Guarantee. The full faith and credit of the United...

22 CFR 221.13 - Non-impairment of the Guarantee.

Code of Federal Regulations, 2010 CFR

2010-04-01

... 22 Foreign Relations 1 2010-04-01 2010-04-01 false Non-impairment of the Guarantee. 221.13 Section 221.13 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEE STANDARD TERMS AND CONDITIONS The Guarantee § 221.13 Non-impairment of the Guarantee. The full faith and credit of the United...

CORSET: Service-Oriented Resource Management System in Linux

NASA Astrophysics Data System (ADS)

Kang, Dong-Jae; Kim, Chei-Yol; Jung, Sung-In

Generally, system resources are not enough for many running services and applications in a system. And services are more important than single process in real world and they have different priority or importance. So each service should be treated with discrimination in aspect of system resources. But administrator can't guarantee the specific service has proper resources in unsettled workload situation because many processes are in race condition. So, we suppose the service-oriented resource management subsystem to resolve upper problems. It guarantees the performance or QoS of the specific service in changeable workload situation by satisfying the minimum resource requirement for the service.

17 CFR 240.15c2-7 - Identification of quotations.

Code of Federal Regulations, 2010 CFR

2010-04-01

..., guarantee of profit, guarantee against loss, commission, markup, markdown, indication of interest and... account, guarantee of profit, guarantee against loss, commission, markup, markdown, indication of interest...

Composite Bloom Filters for Secure Record Linkage.

PubMed

Durham, Elizabeth Ashley; Kantarcioglu, Murat; Xue, Yuan; Toth, Csaba; Kuzu, Mehmet; Malin, Bradley

2014-12-01

The process of record linkage seeks to integrate instances that correspond to the same entity. Record linkage has traditionally been performed through the comparison of identifying field values ( e.g., Surname ), however, when databases are maintained by disparate organizations, the disclosure of such information can breach the privacy of the corresponding individuals. Various private record linkage (PRL) methods have been developed to obscure such identifiers, but they vary widely in their ability to balance competing goals of accuracy, efficiency and security. The tokenization and hashing of field values into Bloom filters (BF) enables greater linkage accuracy and efficiency than other PRL methods, but the encodings may be compromised through frequency-based cryptanalysis. Our objective is to adapt a BF encoding technique to mitigate such attacks with minimal sacrifices in accuracy and efficiency. To accomplish these goals, we introduce a statistically-informed method to generate BF encodings that integrate bits from multiple fields, the frequencies of which are provably associated with a minimum number of fields. Our method enables a user-specified tradeoff between security and accuracy. We compare our encoding method with other techniques using a public dataset of voter registration records and demonstrate that the increases in security come with only minor losses to accuracy.

Decision theory with resource-bounded agents.

PubMed

Halpern, Joseph Y; Pass, Rafael; Seeman, Lior

2014-04-01

There have been two major lines of research aimed at capturing resource-bounded players in game theory. The first, initiated by Rubinstein (), charges an agent for doing costly computation; the second, initiated by Neyman (), does not charge for computation, but limits the computation that agents can do, typically by modeling agents as finite automata. We review recent work on applying both approaches in the context of decision theory. For the first approach, we take the objects of choice in a decision problem to be Turing machines, and charge players for the "complexity" of the Turing machine chosen (e.g., its running time). This approach can be used to explain well-known phenomena like first-impression-matters biases (i.e., people tend to put more weight on evidence they hear early on) and belief polarization (two people with different prior beliefs, hearing the same evidence, can end up with diametrically opposed conclusions) as the outcomes of quite rational decisions. For the second approach, we model people as finite automata, and provide a simple algorithm that, on a problem that captures a number of settings of interest, provably performs optimally as the number of states in the automaton increases. Copyright © 2014 Cognitive Science Society, Inc.

Fast Multivariate Search on Large Aviation Datasets

NASA Technical Reports Server (NTRS)

Bhaduri, Kanishka; Zhu, Qiang; Oza, Nikunj C.; Srivastava, Ashok N.

2010-01-01

Multivariate Time-Series (MTS) are ubiquitous, and are generated in areas as disparate as sensor recordings in aerospace systems, music and video streams, medical monitoring, and financial systems. Domain experts are often interested in searching for interesting multivariate patterns from these MTS databases which can contain up to several gigabytes of data. Surprisingly, research on MTS search is very limited. Most existing work only supports queries with the same length of data, or queries on a fixed set of variables. In this paper, we propose an efficient and flexible subsequence search framework for massive MTS databases, that, for the first time, enables querying on any subset of variables with arbitrary time delays between them. We propose two provably correct algorithms to solve this problem (1) an R-tree Based Search (RBS) which uses Minimum Bounding Rectangles (MBR) to organize the subsequences, and (2) a List Based Search (LBS) algorithm which uses sorted lists for indexing. We demonstrate the performance of these algorithms using two large MTS databases from the aviation domain, each containing several millions of observations Both these tests show that our algorithms have very high prune rates (>95%) thus needing actual

Composite Bloom Filters for Secure Record Linkage

PubMed Central

Durham, Elizabeth Ashley; Kantarcioglu, Murat; Xue, Yuan; Toth, Csaba; Kuzu, Mehmet; Malin, Bradley

2014-01-01

The process of record linkage seeks to integrate instances that correspond to the same entity. Record linkage has traditionally been performed through the comparison of identifying field values (e.g., Surname), however, when databases are maintained by disparate organizations, the disclosure of such information can breach the privacy of the corresponding individuals. Various private record linkage (PRL) methods have been developed to obscure such identifiers, but they vary widely in their ability to balance competing goals of accuracy, efficiency and security. The tokenization and hashing of field values into Bloom filters (BF) enables greater linkage accuracy and efficiency than other PRL methods, but the encodings may be compromised through frequency-based cryptanalysis. Our objective is to adapt a BF encoding technique to mitigate such attacks with minimal sacrifices in accuracy and efficiency. To accomplish these goals, we introduce a statistically-informed method to generate BF encodings that integrate bits from multiple fields, the frequencies of which are provably associated with a minimum number of fields. Our method enables a user-specified tradeoff between security and accuracy. We compare our encoding method with other techniques using a public dataset of voter registration records and demonstrate that the increases in security come with only minor losses to accuracy. PMID:25530689

Prediction and causal reasoning in planning

NASA Technical Reports Server (NTRS)

Dean, T.; Boddy, M.

1987-01-01

Nonlinear planners are often touted as having an efficiency advantage over linear planners. The reason usually given is that nonlinear planners, unlike their linear counterparts, are not forced to make arbitrary commitments to the order in which actions are to be performed. This ability to delay commitment enables nonlinear planners to solve certain problems with far less effort than would be required of linear planners. Here, it is argued that this advantage is bought with a significant reduction in the ability of a nonlinear planner to accurately predict the consequences of actions. Unfortunately, the general problem of predicting the consequences of a partially ordered set of actions is intractable. In gaining the predictive power of linear planners, nonlinear planners sacrifice their efficiency advantage. There are, however, other advantages to nonlinear planning (e.g., the ability to reason about partial orders and incomplete information) that make it well worth the effort needed to extend nonlinear methods. A framework is supplied for causal inference that supports reasoning about partially ordered events and actions whose effects depend upon the context in which they are executed. As an alternative to a complete but potentially exponential-time algorithm, researchers provide a provably sound polynomial-time algorithm for predicting the consequences of partially ordered events.

Lightweight and confidential data discovery and dissemination for wireless body area networks.

PubMed

He, Daojing; Chan, Sammy; Zhang, Yan; Yang, Haomiao

2014-03-01

As a special sensor network, a wireless body area network (WBAN) provides an economical solution to real-time monitoring and reporting of patients' physiological data. After a WBAN is deployed, it is sometimes necessary to disseminate data into the network through wireless links to adjust configuration parameters of body sensors or distribute management commands and queries to sensors. A number of such protocols have been proposed recently, but they all focus on how to ensure reliability and overlook security vulnerabilities. Taking into account the unique features and application requirements of a WBAN, this paper presents the design, implementation, and evaluation of a secure, lightweight, confidential, and denial-of-service-resistant data discovery and dissemination protocol for WBANs to ensure the data items disseminated are not altered or tampered. Based on multiple one-way key hash chains, our protocol provides instantaneous authentication and can tolerate node compromise. Besides the theoretical analysis that demonstrates the security and performance of the proposed protocol, this paper also reports the experimental evaluation of our protocol in a network of resource-limited sensor nodes, which shows its efficiency in practice. In particular, extensive security analysis shows that our protocol is provably secure.

7 CFR 1720.9 - Guarantee Agreement.

Code of Federal Regulations, 2011 CFR

2011-01-01

... of construction; (2) The form of guarantee; (3) Coverage of the guarantee; (4) Timely demand for... to absorb losses relative to risk in the guaranteed lender's portfolio and requirements on the...

76 FR 39068 - Guarantee Fee Rates for Guaranteed Loans for Fiscal Year 2011; Maximum Portion of Guarantee...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-07-05

... fundamental structural changes in its economic base. For guaranteed loans exceeding 80 percent, such projects...'s ability to focus guarantee assistance on projects which the Agency has found particularly... farmers benefiting financially, or such projects are high impact as defined in 7 CFR 4279.155(b)(5), and...

Brownian motion properties of optoelectronic random bit generators based on laser chaos.

PubMed

Li, Pu; Yi, Xiaogang; Liu, Xianglian; Wang, Yuncai; Wang, Yongge

2016-07-11

The nondeterministic property of the optoelectronic random bit generator (RBG) based on laser chaos are experimentally analyzed from two aspects of the central limit theorem and law of iterated logarithm. The random bits are extracted from an optical feedback chaotic laser diode using a multi-bit extraction technique in the electrical domain. Our experimental results demonstrate that the generated random bits have no statistical distance from the Brownian motion, besides that they can pass the state-of-the-art industry-benchmark statistical test suite (NIST SP800-22). All of them give a mathematically provable evidence that the ultrafast random bit generator based on laser chaos can be used as a nondeterministic random bit source.

Fully Dynamic Bin Packing

NASA Astrophysics Data System (ADS)

Ivković, Zoran; Lloyd, Errol L.

Classic bin packing seeks to pack a given set of items of possibly varying sizes into a minimum number of identical sized bins. A number of approximation algorithms have been proposed for this NP-hard problem for both the on-line and off-line cases. In this chapter we discuss fully dynamic bin packing, where items may arrive (Insert) and depart (Delete) dynamically. In accordance with standard practice for fully dynamic algorithms, it is assumed that the packing may be arbitrarily rearranged to accommodate arriving and departing items. The goal is to maintain an approximately optimal solution of provably high quality in a total amount of time comparable to that used by an off-line algorithm delivering a solution of the same quality.

Combinatorial algorithms for design of DNA arrays.

PubMed

Hannenhalli, Sridhar; Hubell, Earl; Lipshutz, Robert; Pevzner, Pavel A

2002-01-01

Optimal design of DNA arrays requires the development of algorithms with two-fold goals: reducing the effects caused by unintended illumination (border length minimization problem) and reducing the complexity of masks (mask decomposition problem). We describe algorithms that reduce the number of rectangles in mask decomposition by 20-30% as compared to a standard array design under the assumption that the arrangement of oligonucleotides on the array is fixed. This algorithm produces provably optimal solution for all studied real instances of array design. We also address the difficult problem of finding an arrangement which minimizes the border length and come up with a new idea of threading that significantly reduces the border length as compared to standard designs.

Provably-Secure (Chinese Government) SM2 and Simplified SM2 Key Exchange Protocols

PubMed Central

Nam, Junghyun; Kim, Moonseong

2014-01-01

We revisit the SM2 protocol, which is widely used in Chinese commercial applications and by Chinese government agencies. Although it is by now standard practice for protocol designers to provide security proofs in widely accepted security models in order to assure protocol implementers of their security properties, the SM2 protocol does not have a proof of security. In this paper, we prove the security of the SM2 protocol in the widely accepted indistinguishability-based Bellare-Rogaway model under the elliptic curve discrete logarithm problem (ECDLP) assumption. We also present a simplified and more efficient version of the SM2 protocol with an accompanying security proof. PMID:25276863

Analyzing the security of an existing computer system

NASA Technical Reports Server (NTRS)

Bishop, M.

1986-01-01

Most work concerning secure computer systems has dealt with the design, verification, and implementation of provably secure computer systems, or has explored ways of making existing computer systems more secure. The problem of locating security holes in existing systems has received considerably less attention; methods generally rely on thought experiments as a critical step in the procedure. The difficulty is that such experiments require that a large amount of information be available in a format that makes correlating the details of various programs straightforward. This paper describes a method of providing such a basis for the thought experiment by writing a special manual for parts of the operating system, system programs, and library subroutines.

Optimising the performance of an outpatient setting.

PubMed

Sendi, Pedram; Al, Maiwenn J; Battegay, Manuel; Al Maiwenn, J

2004-01-24

An outpatient setting typically includes experienced and novice resident physicians who are supervised by senior staff physicians. The performance of this kind of outpatient setting, for a given mix of experienced and novice resident physicians, is determined by the number of senior staff physicians available for supervision. The optimum mix of human resources may be determined using discrete-event simulation. An outpatient setting represents a system where concurrency and resource sharing are important. These concepts can be modelled by means of timed Coloured Petri Nets (CPN), which is a discrete-event simulation formalism. We determined the optimum mix of resources (i.e. the number of senior staff physicians needed for a given number of experienced and novice resident physicians) to guarantee efficient overall system performance. In an outpatient setting with 10 resident physicians, two staff physicians are required to guarantee a minimum level of system performance (42-52 patients are seen per 5-hour period). However, with 3 senior staff physicians system performance can be improved substantially (49-56 patients per 5-hour period). An additional fourth staff physician does not substantially enhance system performance (50-57 patients per 5-hour period). Coloured Petri Nets provide a flexible environment in which to simulate an outpatient setting and assess the impact of any staffing changes on overall system performance, to promote informed resource allocation decisions.

Non-fragile ?-? control for discrete-time stochastic nonlinear systems under event-triggered protocols

NASA Astrophysics Data System (ADS)

Sun, Ying; Ding, Derui; Zhang, Sunjie; Wei, Guoliang; Liu, Hongjian

2018-07-01

In this paper, the non-fragile ?-? control problem is investigated for a class of discrete-time stochastic nonlinear systems under event-triggered communication protocols, which determine whether the measurement output should be transmitted to the controller or not. The main purpose of the addressed problem is to design an event-based output feedback controller subject to gain variations guaranteeing the prescribed disturbance attenuation level described by the ?-? performance index. By utilizing the Lyapunov stability theory combined with S-procedure, a sufficient condition is established to guarantee both the exponential mean-square stability and the ?-? performance for the closed-loop system. In addition, with the help of the orthogonal decomposition, the desired controller parameter is obtained in terms of the solution to certain linear matrix inequalities. Finally, a simulation example is exploited to demonstrate the effectiveness of the proposed event-based controller design scheme.

Fault detection for singular switched linear systems with multiple time-varying delay in finite frequency domain

NASA Astrophysics Data System (ADS)

Zhai, Ding; Lu, Anyang; Li, Jinghao; Zhang, Qingling

2016-10-01

This paper deals with the problem of the fault detection (FD) for continuous-time singular switched linear systems with multiple time-varying delay. In this paper, the actuator fault is considered. Besides, the systems faults and unknown disturbances are assumed in known frequency domains. Some finite frequency performance indices are initially introduced to design the switched FD filters which ensure that the filtering augmented systems under switching signal with average dwell time are exponentially admissible and guarantee the fault input sensitivity and disturbance robustness. By developing generalised Kalman-Yakubovic-Popov lemma and using Parseval's theorem and Fourier transform, finite frequency delay-dependent sufficient conditions for the existence of such a filter which can guarantee the finite-frequency H- and H∞ performance are derived and formulated in terms of linear matrix inequalities. Four examples are provided to illustrate the effectiveness of the proposed finite frequency method.

7 CFR 1779.64 - Issuance of Lender's Agreement, Loan Note Guarantee, and Assignment Guarantee Agreement.

Code of Federal Regulations, 2010 CFR

2010-01-01

... of Agriculture (Continued) RURAL UTILITIES SERVICE, DEPARTMENT OF AGRICULTURE (CONTINUED) WATER AND WASTE DISPOSAL PROGRAMS GUARANTEED LOANS § 1779.64 Issuance of Lender's Agreement, Loan Note Guarantee...

Reported Energy and Cost Savings from the DOE ESPC Program: FY 2014

DOE Office of Scientific and Technical Information (OSTI.GOV)

Slattery, Bob S.

2015-03-01

The objective of this work was to determine the realization rate of energy and cost savings from the Department of Energy’s Energy Savings Performance Contract (ESPC) program based on information reported by the energy services companies (ESCOs) that are carrying out ESPC projects at federal sites. Information was extracted from 156 Measurement and Verification (M&V) reports to determine reported, estimated, and guaranteed cost savings and reported and estimated energy savings for the previous contract year. Because the quality of the reports varied, it was not possible to determine all of these parameters for each project. For all 156 projects, theremore » was sufficient information to compare estimated, reported, and guaranteed cost savings. For this group, the total estimated cost savings for the reporting periods addressed were $210.6 million, total reported cost savings were $215.1 million, and total guaranteed cost savings were $204.5 million. This means that on average: ESPC contractors guaranteed 97% of the estimated cost savings; projects reported achieving 102% of the estimated cost savings; and projects reported achieving 105% of the guaranteed cost savings. For 155 of the projects examined, there was sufficient information to compare estimated and reported energy savings. On the basis of site energy, estimated savings for those projects for the previous year totaled 11.938 million MMBtu, and reported savings were 12.138 million MMBtu, 101.7% of the estimated energy savings. On the basis of source energy, total estimated energy savings for the 155 projects were 19.052 million MMBtu, and reported saving were 19.516 million MMBtu, 102.4% of the estimated energy savings.« less

7 CFR 2201.13 - Lender.

Code of Federal Regulations, 2010 CFR

2010-01-01

... guaranteed loans; (4) The performance of the Lender's loan portfolio, including its current delinquency rate... nationally recognized statistical rating organization, as evidenced by written confirmation from the nationally recognized statistical rating organization, subject to updating upon request of the Board; and (ii...

National Rural Employment Guarantee Scheme, poverty and prices in rural India.

PubMed

Gaiha, Raghav; Kulkarni, Vani S; Pandey, Manoj K; Imai, Katsushi S

2010-01-01

The objective of this analysis is mainly to construct an intuitive measure of the performance of the National Rural Employment Guarantee Scheme (NREGS) in India. The focus is on divergence between demand and supply at the district level. Some related issues addressed are: (i) whether the gap between demand and supply responds to poverty; and (ii) whether recent hikes in NREGS wages are inflationary. Our analysis confirms responsiveness of the positive gap between demand and supply to poverty. Also, apprehensions expressed about the inflationary potential of recent hikes in NREGS wages have been confirmed. More importantly, higher NREGS wages are likely to undermine self-selection of the poor in it.

A methodology for designing robust multivariable nonlinear control systems. Ph.D. Thesis

NASA Technical Reports Server (NTRS)

Grunberg, D. B.

1986-01-01

A new methodology is described for the design of nonlinear dynamic controllers for nonlinear multivariable systems providing guarantees of closed-loop stability, performance, and robustness. The methodology is an extension of the Linear-Quadratic-Gaussian with Loop-Transfer-Recovery (LQG/LTR) methodology for linear systems, thus hinging upon the idea of constructing an approximate inverse operator for the plant. A major feature of the methodology is a unification of both the state-space and input-output formulations. In addition, new results on stability theory, nonlinear state estimation, and optimal nonlinear regulator theory are presented, including the guaranteed global properties of the extended Kalman filter and optimal nonlinear regulators.

Generalizing Backtrack-Free Search: A Framework for Search-Free Constraint Satisfaction

NASA Technical Reports Server (NTRS)

Jonsson, Ari K.; Frank, Jeremy

2000-01-01

Tractable classes of constraint satisfaction problems are of great importance in artificial intelligence. Identifying and taking advantage of such classes can significantly speed up constraint problem solving. In addition, tractable classes are utilized in applications where strict worst-case performance guarantees are required, such as constraint-based plan execution. In this work, we present a formal framework for search-free (backtrack-free) constraint satisfaction. The framework is based on general procedures, rather than specific propagation techniques, and thus generalizes existing techniques in this area. We also relate search-free problem solving to the notion of decision sets and use the result to provide a constructive criterion that is sufficient to guarantee search-free problem solving.

7 CFR 762.145 - Restructuring guaranteed loans.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 7 Agriculture 7 2014-01-01 2014-01-01 false Restructuring guaranteed loans. 762.145 Section 762.145 Agriculture Regulations of the Department of Agriculture (Continued) FARM SERVICE AGENCY, DEPARTMENT OF AGRICULTURE SPECIAL PROGRAMS GUARANTEED FARM LOANS § 762.145 Restructuring guaranteed loans. (a...

29 CFR 4022.3 - Guaranteed benefits.

Code of Federal Regulations, 2011 CFR

2011-07-01

... 29 Labor 9 2011-07-01 2011-07-01 false Guaranteed benefits. 4022.3 Section 4022.3 Labor Regulations Relating to Labor (Continued) PENSION BENEFIT GUARANTY CORPORATION COVERAGE AND BENEFITS BENEFITS PAYABLE IN TERMINATED SINGLE-EMPLOYER PLANS General Provisions; Guaranteed Benefits § 4022.3 Guaranteed...

29 CFR 4022.3 - Guaranteed benefits.

Code of Federal Regulations, 2012 CFR

2012-07-01

... 29 Labor 9 2012-07-01 2012-07-01 false Guaranteed benefits. 4022.3 Section 4022.3 Labor Regulations Relating to Labor (Continued) PENSION BENEFIT GUARANTY CORPORATION COVERAGE AND BENEFITS BENEFITS PAYABLE IN TERMINATED SINGLE-EMPLOYER PLANS General Provisions; Guaranteed Benefits § 4022.3 Guaranteed...

29 CFR 4022.3 - Guaranteed benefits.

Code of Federal Regulations, 2010 CFR

2010-07-01

... 29 Labor 9 2010-07-01 2010-07-01 false Guaranteed benefits. 4022.3 Section 4022.3 Labor Regulations Relating to Labor (Continued) PENSION BENEFIT GUARANTY CORPORATION COVERAGE AND BENEFITS BENEFITS PAYABLE IN TERMINATED SINGLE-EMPLOYER PLANS General Provisions; Guaranteed Benefits § 4022.3 Guaranteed...

29 CFR 4022.3 - Guaranteed benefits.

Code of Federal Regulations, 2014 CFR

2014-07-01

... 29 Labor 9 2014-07-01 2014-07-01 false Guaranteed benefits. 4022.3 Section 4022.3 Labor Regulations Relating to Labor (Continued) PENSION BENEFIT GUARANTY CORPORATION COVERAGE AND BENEFITS BENEFITS PAYABLE IN TERMINATED SINGLE-EMPLOYER PLANS General Provisions; Guaranteed Benefits § 4022.3 Guaranteed...

29 CFR 4022.3 - Guaranteed benefits.

Code of Federal Regulations, 2013 CFR

2013-07-01

... 29 Labor 9 2013-07-01 2013-07-01 false Guaranteed benefits. 4022.3 Section 4022.3 Labor Regulations Relating to Labor (Continued) PENSION BENEFIT GUARANTY CORPORATION COVERAGE AND BENEFITS BENEFITS PAYABLE IN TERMINATED SINGLE-EMPLOYER PLANS General Provisions; Guaranteed Benefits § 4022.3 Guaranteed...

7 CFR 1493.1 - General statement.

Code of Federal Regulations, 2012 CFR

2012-01-01

... AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS Restrictions and Criteria for Export Credit... use of credit guarantees under the Commodity Credit Corporation (CCC) Export Credit Guarantee Program (GSM-102) and the Intermediate Credit Guarantee Program (GSM-103) and the criteria considered by CCC in...

7 CFR 1493.1 - General statement.

Code of Federal Regulations, 2013 CFR

2013-01-01

... AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS Restrictions and Criteria for Export Credit... use of credit guarantees under the Commodity Credit Corporation (CCC) Export Credit Guarantee Program (GSM-102) and the Intermediate Credit Guarantee Program (GSM-103) and the criteria considered by CCC in...

7 CFR 1493.1 - General statement.

Code of Federal Regulations, 2014 CFR

2014-01-01

... AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS Restrictions and Criteria for Export Credit... use of credit guarantees under the Commodity Credit Corporation (CCC) Export Credit Guarantee Program (GSM-102) and the Intermediate Credit Guarantee Program (GSM-103) and the criteria considered by CCC in...

7 CFR 762.160 - Assignment of guarantee.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 7 Agriculture 7 2014-01-01 2014-01-01 false Assignment of guarantee. 762.160 Section 762.160 Agriculture Regulations of the Department of Agriculture (Continued) FARM SERVICE AGENCY, DEPARTMENT OF AGRICULTURE SPECIAL PROGRAMS GUARANTEED FARM LOANS § 762.160 Assignment of guarantee. (a) The following...

7 CFR 1779.30 - Loan guarantee limitations.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 7 Agriculture 12 2010-01-01 2010-01-01 false Loan guarantee limitations. 1779.30 Section 1779.30 Agriculture Regulations of the Department of Agriculture (Continued) RURAL UTILITIES SERVICE, DEPARTMENT OF AGRICULTURE (CONTINUED) WATER AND WASTE DISPOSAL PROGRAMS GUARANTEED LOANS § 1779.30 Loan guarantee...

7 CFR 4279.149 - Personal and corporate guarantee.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 7 Agriculture 15 2014-01-01 2014-01-01 false Personal and corporate guarantee. 4279.149 Section... Industry Loans § 4279.149 Personal and corporate guarantee. (a) Unconditional personal and corporate... adequately secured for loanmaking purposes. Agency approved personal and corporate guarantees for the full...

7 CFR 4279.149 - Personal and corporate guarantee.

Code of Federal Regulations, 2013 CFR

2013-01-01

... 7 Agriculture 15 2013-01-01 2013-01-01 false Personal and corporate guarantee. 4279.149 Section... Industry Loans § 4279.149 Personal and corporate guarantee. (a) Unconditional personal and corporate... adequately secured for loanmaking purposes. Agency approved personal and corporate guarantees for the full...

7 CFR 4279.149 - Personal and corporate guarantee.

Code of Federal Regulations, 2012 CFR

2012-01-01

... 7 Agriculture 15 2012-01-01 2012-01-01 false Personal and corporate guarantee. 4279.149 Section... Industry Loans § 4279.149 Personal and corporate guarantee. (a) Unconditional personal and corporate... adequately secured for loanmaking purposes. Agency approved personal and corporate guarantees for the full...

7 CFR 4279.149 - Personal and corporate guarantee.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 7 Agriculture 15 2011-01-01 2011-01-01 false Personal and corporate guarantee. 4279.149 Section... Industry Loans § 4279.149 Personal and corporate guarantee. (a) Unconditional personal and corporate... adequately secured for loanmaking purposes. Agency approved personal and corporate guarantees for the full...

7 CFR 4279.149 - Personal and corporate guarantee.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 7 Agriculture 15 2010-01-01 2010-01-01 false Personal and corporate guarantee. 4279.149 Section... Industry Loans § 4279.149 Personal and corporate guarantee. (a) Unconditional personal and corporate... adequately secured for loanmaking purposes. Agency approved personal and corporate guarantees for the full...

78 FR 48135 - Information Collection; Guaranteed Farm Loan Program

Federal Register 2010, 2011, 2012, 2013, 2014

2013-08-07

... Information Collection; Guaranteed Farm Loan Program AGENCY: Farm Service Agency, USDA. ACTION: Notice... revision of a currently approved information collection associated with the Guaranteed Farm Loan Program. This information collection is used to make and service loans guaranteed by FSA to eligible farmers and...

13 CFR 400.205 - Application process.

Code of Federal Regulations, 2013 CFR

2013-01-01

... Section 400.205 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.205 Application process. (a) Application process. An... “Application for Steel Guarantee Loan”; (2) The information required for the completion of Form “Environmental...

13 CFR 400.205 - Application process.

Code of Federal Regulations, 2012 CFR

2012-01-01

... Section 400.205 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.205 Application process. (a) Application process. An... “Application for Steel Guarantee Loan”; (2) The information required for the completion of Form “Environmental...

13 CFR 400.205 - Application process.

Code of Federal Regulations, 2014 CFR

2014-01-01

... Section 400.205 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.205 Application process. (a) Application process. An... “Application for Steel Guarantee Loan”; (2) The information required for the completion of Form “Environmental...

13 CFR 400.205 - Application process.

Code of Federal Regulations, 2011 CFR

2011-01-01

... Section 400.205 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.205 Application process. (a) Application process. An... “Application for Steel Guarantee Loan”; (2) The information required for the completion of Form “Environmental...

7 CFR 1493.260 - Facility payment guarantee.

Code of Federal Regulations, 2010 CFR

2010-01-01

... OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Facility Guarantee Program (FGP) Operations § 1493.260 Facility payment guarantee. (a) CCC's maximum obligation. CCC will agree to pay the exporter or the exporter's assignee an amount not to exceed the...

7 CFR 1493.40 - Application for payment guarantee.

Code of Federal Regulations, 2011 CFR

2011-01-01

... CORPORATION, DEPARTMENT OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Export Credit Guarantee Program (GSM-102) and CCC Intermediate Export Credit Guarantee Program..., contract loading tolerance and, if necessary, a request for CCC to reserve coverage up to the maximum...

7 CFR 1493.70 - Guarantee rates and fees.

Code of Federal Regulations, 2010 CFR

2010-01-01

... OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Export Credit Guarantee Program (GSM-102) and CCC Intermediate Export Credit Guarantee Program (GSM-103... risk that CCC assumes, as determined by CCC, and any other factors which CCC determines appropriate for...

7 CFR 1493.70 - Guarantee rates and fees.

Code of Federal Regulations, 2011 CFR

2011-01-01

... OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Export Credit Guarantee Program (GSM-102) and CCC Intermediate Export Credit Guarantee Program (GSM-103... risk that CCC assumes, as determined by CCC, and any other factors which CCC determines appropriate for...

7 CFR 1493.400 - General statement.

Code of Federal Regulations, 2012 CFR

2012-01-01

... OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Supplier Credit Guarantee... forth at subpart A for the Commodity Credit Corporation (CCC) Export Credit Guarantee Program (GSM-102... CCC's guarantee. The program is operated in a manner intended not to interfere with markets for cash...

7 CFR 1493.40 - Application for payment guarantee.

Code of Federal Regulations, 2010 CFR

2010-01-01

... CORPORATION, DEPARTMENT OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Export Credit Guarantee Program (GSM-102) and CCC Intermediate Export Credit Guarantee Program..., contract loading tolerance and, if necessary, a request for CCC to reserve coverage up to the maximum...

7 CFR 1493.400 - General statement.

Code of Federal Regulations, 2013 CFR

2013-01-01

... OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Supplier Credit Guarantee... forth at subpart A for the Commodity Credit Corporation (CCC) Export Credit Guarantee Program (GSM-102... CCC's guarantee. The program is operated in a manner intended not to interfere with markets for cash...

7 CFR 1493.260 - Facility payment guarantee.

Code of Federal Regulations, 2011 CFR

2011-01-01

... OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Facility Guarantee Program (FGP) Operations § 1493.260 Facility payment guarantee. (a) CCC's maximum obligation. CCC will agree to pay the exporter or the exporter's assignee an amount not to exceed the...

7 CFR 1493.400 - General statement.

Code of Federal Regulations, 2014 CFR

2014-01-01

... OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Supplier Credit Guarantee... forth at subpart A for the Commodity Credit Corporation (CCC) Export Credit Guarantee Program (GSM-102... CCC's guarantee. The program is operated in a manner intended not to interfere with markets for cash...

43 CFR 3809.201 - What should these agreements address?

Code of Federal Regulations, 2013 CFR

2013-10-01

.... Operations must not begin until BLM completes consultation or conferencing under the Endangered Species Act. ... whether Federally proposed or listed threatened or endangered species or their proposed or designated... Policy Act; performance standards; interim management of temporary closure; financial guarantees...

43 CFR 3809.201 - What should these agreements address?

Code of Federal Regulations, 2012 CFR

2012-10-01

.... Operations must not begin until BLM completes consultation or conferencing under the Endangered Species Act. ... whether Federally proposed or listed threatened or endangered species or their proposed or designated... Policy Act; performance standards; interim management of temporary closure; financial guarantees...

43 CFR 3809.201 - What should these agreements address?

Code of Federal Regulations, 2014 CFR

2014-10-01

.... Operations must not begin until BLM completes consultation or conferencing under the Endangered Species Act. ... whether Federally proposed or listed threatened or endangered species or their proposed or designated... Policy Act; performance standards; interim management of temporary closure; financial guarantees...

The impact of health-care service guarantees on consumer decision-making: an experimental investigation.

PubMed

Kennett-Hensel, Pamela A; Min, Kyeong Sam; Totten, Jeff W

2012-01-01

While examples of the successful use of service guarantees in health-care do exist, to-date, researchers have yet to examine this industry-specific application beyond a case study perspective. The results of this experiment begin to shed light on whether or not guarantees should be used, and if so, under what conditions are they appropriate. Respondents indicate that the thoughtful use of service guarantees can positively impact their perceptions of the health-care provider's reputation and, ultimately, their behavioral intentions towards the same provider. However, consideration must be given to the type of guarantee being offered and to whom the guarantee is targeted.

Performance of EAG and GAG Award Recipients Based on Length and Amount of Aid

ERIC Educational Resources Information Center

Battaglini, Janis K.

2004-01-01

The purpose of this analysis was to examine the persistence, graduation and transfer rates of full-time students who received an EAG (Educational Assistance Grant) or GAG (Guaranteed Access Grant) and matriculated during the 1996-1997 academic year. The performance of these students was examined on the basis of the number of years in which…

Feature Selection with Conjunctions of Decision Stumps and Learning from Microarray Data.

PubMed

Shah, M; Marchand, M; Corbeil, J

2012-01-01

One of the objectives of designing feature selection learning algorithms is to obtain classifiers that depend on a small number of attributes and have verifiable future performance guarantees. There are few, if any, approaches that successfully address the two goals simultaneously. To the best of our knowledge, such algorithms that give theoretical bounds on the future performance have not been proposed so far in the context of the classification of gene expression data. In this work, we investigate the premise of learning a conjunction (or disjunction) of decision stumps in Occam's Razor, Sample Compression, and PAC-Bayes learning settings for identifying a small subset of attributes that can be used to perform reliable classification tasks. We apply the proposed approaches for gene identification from DNA microarray data and compare our results to those of the well-known successful approaches proposed for the task. We show that our algorithm not only finds hypotheses with a much smaller number of genes while giving competitive classification accuracy but also having tight risk guarantees on future performance, unlike other approaches. The proposed approaches are general and extensible in terms of both designing novel algorithms and application to other domains.

Sequential Nonlinear Learning for Distributed Multiagent Systems via Extreme Learning Machines.

PubMed

Vanli, Nuri Denizcan; Sayin, Muhammed O; Delibalta, Ibrahim; Kozat, Suleyman Serdar

2017-03-01

We study online nonlinear learning over distributed multiagent systems, where each agent employs a single hidden layer feedforward neural network (SLFN) structure to sequentially minimize arbitrary loss functions. In particular, each agent trains its own SLFN using only the data that is revealed to itself. On the other hand, the aim of the multiagent system is to train the SLFN at each agent as well as the optimal centralized batch SLFN that has access to all the data, by exchanging information between neighboring agents. We address this problem by introducing a distributed subgradient-based extreme learning machine algorithm. The proposed algorithm provides guaranteed upper bounds on the performance of the SLFN at each agent and shows that each of these individual SLFNs asymptotically achieves the performance of the optimal centralized batch SLFN. Our performance guarantees explicitly distinguish the effects of data- and network-dependent parameters on the convergence rate of the proposed algorithm. The experimental results illustrate that the proposed algorithm achieves the oracle performance significantly faster than the state-of-the-art methods in the machine learning and signal processing literature. Hence, the proposed method is highly appealing for the applications involving big data.

76 FR 5374 - Agency Information Collection Activities: Comment Request

Federal Register 2010, 2011, 2012, 2013, 2014

2011-01-31

... Request. Form Title: Notice of Claim and Proof of Loss, Working Capital Guarantee. SUMMARY: The Export..., guarantees, insurance and working capital credits. By neutralizing the effect of export credit support.... Under the Working Capital Guarantee Program, Ex-Im Bank provides repayment guarantees to lenders on...

7 CFR 1779.4 - Conditions of guarantee.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 7 Agriculture 12 2010-01-01 2010-01-01 false Conditions of guarantee. 1779.4 Section 1779.4 Agriculture Regulations of the Department of Agriculture (Continued) RURAL UTILITIES SERVICE, DEPARTMENT OF AGRICULTURE (CONTINUED) WATER AND WASTE DISPOSAL PROGRAMS GUARANTEED LOANS § 1779.4 Conditions of guarantee. A...

20 CFR 404.230 - Guaranteed alternative.

Code of Federal Regulations, 2010 CFR

2010-04-01

... 20 Employees' Benefits 2 2010-04-01 2010-04-01 false Guaranteed alternative. 404.230 Section 404... INSURANCE (1950- ) Computing Primary Insurance Amounts Guaranteed Alternative for People Reaching Age 62 After 1978 But Before 1984 § 404.230 Guaranteed alternative. (a) General. If you reach age 62 after 1978...

7 CFR 762.145 - Restructuring guaranteed loans.

Code of Federal Regulations, 2011 CFR

2011-01-01

... calculations required in paragraph (e) of this section for debt writedown. (iii) For restructuring other than... 7 Agriculture 7 2011-01-01 2011-01-01 false Restructuring guaranteed loans. 762.145 Section 762..., DEPARTMENT OF AGRICULTURE SPECIAL PROGRAMS GUARANTEED FARM LOANS § 762.145 Restructuring guaranteed loans. (a...

7 CFR 762.145 - Restructuring guaranteed loans.

Code of Federal Regulations, 2012 CFR

2012-01-01

... calculations required in paragraph (e) of this section for debt writedown. (iii) For restructuring other than... 7 Agriculture 7 2012-01-01 2012-01-01 false Restructuring guaranteed loans. 762.145 Section 762..., DEPARTMENT OF AGRICULTURE SPECIAL PROGRAMS GUARANTEED FARM LOANS § 762.145 Restructuring guaranteed loans. (a...

26 CFR 1.817A-0 - Table of contents.

Code of Federal Regulations, 2011 CFR

2011-04-01

... period. (5) Examples. (c) Applicable interest rates for equity-indexed modified guaranteed contracts... captions that appear in section § 1.817A-1: § 1.817A-1Certain modified guaranteed contracts. (a) Definitions. (1) Modified guaranteed contract. (2) Temporary guarantee period. (3) Equity-indexed modified...

7 CFR 1735.32 - Guaranteed loans.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 7 Agriculture 11 2010-01-01 2010-01-01 false Guaranteed loans. 1735.32 Section 1735.32 Agriculture... GENERAL POLICIES, TYPES OF LOANS, LOAN REQUIREMENTS-TELECOMMUNICATIONS PROGRAM Types of Loans § 1735.32 Guaranteed loans. (a) General. Loan guarantees under this section will be considered for only those borrowers...

77 FR 3379 - Biorefinery Assistance Guaranteed Loans; Correction

Federal Register 2010, 2011, 2012, 2013, 2014

2012-01-24

... 4279 Biorefinery Assistance Guaranteed Loans; Correction AGENCY: Rural Business-Cooperative Service and... the Federal Register on February 14, 2011, establishing a guaranteed loan program for the development... would need to be provided before issuance of the Loan Note Guarantee. List of Subjects in 7 CFR Part...

12 CFR 370.4 - Transaction Account Guarantee Program.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 12 Banks and Banking 4 2010-01-01 2010-01-01 false Transaction Account Guarantee Program. 370.4 Section 370.4 Banks and Banking FEDERAL DEPOSIT INSURANCE CORPORATION REGULATIONS AND STATEMENTS OF GENERAL POLICY TEMPORARY LIQUIDITY GUARANTEE PROGRAM § 370.4 Transaction Account Guarantee Program. (a) In...

13 CFR 400.202 - Loan amount.

Code of Federal Regulations, 2013 CFR

2013-01-01

....202 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.202 Loan amount. (a) The aggregate amount of loan principal guaranteed under this Program to a single Qualified Steel Company may not exceed $ 250 million. (b) Of the...

13 CFR 400.202 - Loan amount.

Code of Federal Regulations, 2010 CFR

2010-01-01

....202 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.202 Loan amount. (a) The aggregate amount of loan principal guaranteed under this Program to a single Qualified Steel Company may not exceed $ 250 million. (b) Of the...

13 CFR 400.202 - Loan amount.

Code of Federal Regulations, 2011 CFR

2011-01-01

....202 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.202 Loan amount. (a) The aggregate amount of loan principal guaranteed under this Program to a single Qualified Steel Company may not exceed $ 250 million. (b) Of the...

13 CFR 400.202 - Loan amount.

Code of Federal Regulations, 2012 CFR

2012-01-01

....202 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.202 Loan amount. (a) The aggregate amount of loan principal guaranteed under this Program to a single Qualified Steel Company may not exceed $ 250 million. (b) Of the...

13 CFR 400.202 - Loan amount.

Code of Federal Regulations, 2014 CFR

2014-01-01

....202 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.202 Loan amount. (a) The aggregate amount of loan principal guaranteed under this Program to a single Qualified Steel Company may not exceed $ 250 million. (b) Of the...

7 CFR 1493.140 - Miscellaneous provisions.

Code of Federal Regulations, 2014 CFR

2014-01-01

... OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Export Credit Guarantee Program (GSM-102) and CCC Intermediate Export Credit Guarantee Program (GSM-103) Operations § 1493.140..., payable by CCC under a payment guarantee or the right to such proceeds only to a financial institution in...

7 CFR 1493.430 - Application for a payment guarantee.

Code of Federal Regulations, 2010 CFR

2010-01-01

... CORPORATION, DEPARTMENT OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Supplier Credit Guarantee Program Operations § 1493.430 Application for a payment guarantee... request for CCC to reserve coverage up to the maximum quantity permitted by the contract loading tolerance...

7 CFR 1493.40 - Application for payment guarantee.

Code of Federal Regulations, 2012 CFR

2012-01-01

... CORPORATION, DEPARTMENT OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Export Credit Guarantee Program (GSM-102) and CCC Intermediate Export Credit Guarantee Program (GSM-103) Operations § 1493..., if necessary, a request for CCC to reserve coverage up to the maximum quantity permitted by the...

7 CFR 1493.260 - Facility payment guarantee.

Code of Federal Regulations, 2013 CFR

2013-01-01

... OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Facility Guarantee Program (FGP) Operations § 1493.260 Facility payment guarantee. (a) CCC's maximum obligation. CCC will agree to... fails to pay under the foreign bank letter of credit or related obligation. The exact amount of CCC's...

7 CFR 1493.140 - Miscellaneous provisions.

Code of Federal Regulations, 2012 CFR

2012-01-01

... OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Export Credit Guarantee Program (GSM-102) and CCC Intermediate Export Credit Guarantee Program (GSM-103) Operations § 1493.140..., payable by CCC under a payment guarantee or the right to such proceeds only to a financial institution in...

7 CFR 1493.40 - Application for payment guarantee.

Code of Federal Regulations, 2014 CFR

2014-01-01

... CORPORATION, DEPARTMENT OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Export Credit Guarantee Program (GSM-102) and CCC Intermediate Export Credit Guarantee Program (GSM-103) Operations § 1493..., if necessary, a request for CCC to reserve coverage up to the maximum quantity permitted by the...

7 CFR 1493.140 - Miscellaneous provisions.

Code of Federal Regulations, 2010 CFR

2010-01-01

... OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Export Credit Guarantee Program (GSM-102) and CCC Intermediate Export Credit Guarantee Program (GSM-103... which are, or may become, payable by CCC under a payment guarantee or the right to such proceeds only to...

7 CFR 1493.140 - Miscellaneous provisions.

Code of Federal Regulations, 2011 CFR

2011-01-01

... OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Export Credit Guarantee Program (GSM-102) and CCC Intermediate Export Credit Guarantee Program (GSM-103... which are, or may become, payable by CCC under a payment guarantee or the right to such proceeds only to...

7 CFR 1493.260 - Facility payment guarantee.

Code of Federal Regulations, 2012 CFR

2012-01-01

... OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Facility Guarantee Program (FGP) Operations § 1493.260 Facility payment guarantee. (a) CCC's maximum obligation. CCC will agree to... fails to pay under the foreign bank letter of credit or related obligation. The exact amount of CCC's...

7 CFR 1493.260 - Facility payment guarantee.

Code of Federal Regulations, 2014 CFR

2014-01-01

... OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Facility Guarantee Program (FGP) Operations § 1493.260 Facility payment guarantee. (a) CCC's maximum obligation. CCC will agree to... fails to pay under the foreign bank letter of credit or related obligation. The exact amount of CCC's...

7 CFR 1493.430 - Application for a payment guarantee.

Code of Federal Regulations, 2011 CFR

2011-01-01

... CORPORATION, DEPARTMENT OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Supplier Credit Guarantee Program Operations § 1493.430 Application for a payment guarantee... request for CCC to reserve coverage up to the maximum quantity permitted by the contract loading tolerance...

7 CFR 1493.140 - Miscellaneous provisions.

Code of Federal Regulations, 2013 CFR

2013-01-01

... OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Export Credit Guarantee Program (GSM-102) and CCC Intermediate Export Credit Guarantee Program (GSM-103) Operations § 1493.140..., payable by CCC under a payment guarantee or the right to such proceeds only to a financial institution in...

7 CFR 1493.40 - Application for payment guarantee.

Code of Federal Regulations, 2013 CFR

2013-01-01

... CORPORATION, DEPARTMENT OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Export Credit Guarantee Program (GSM-102) and CCC Intermediate Export Credit Guarantee Program (GSM-103) Operations § 1493..., if necessary, a request for CCC to reserve coverage up to the maximum quantity permitted by the...

22 CFR 230.03 - The Guarantee.

Code of Federal Regulations, 2012 CFR

2012-04-01

... 22 Foreign Relations 1 2012-04-01 2012-04-01 false The Guarantee. 230.03 Section 230.03 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEES ISSUED UNDER THE EMERGENCY WARTIME SUPPLEMENTAL APPROPRIATIONS ACT OF 2003, PUB. L. 108-11-STANDARD TERMS AND CONDITIONS § 230.03 The Guarantee...

22 CFR 230.03 - The Guarantee.

Code of Federal Regulations, 2013 CFR

2013-04-01

... 22 Foreign Relations 1 2013-04-01 2013-04-01 false The Guarantee. 230.03 Section 230.03 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEES ISSUED UNDER THE EMERGENCY WARTIME SUPPLEMENTAL APPROPRIATIONS ACT OF 2003, PUB. L. 108-11-STANDARD TERMS AND CONDITIONS § 230.03 The Guarantee...

22 CFR 230.03 - The Guarantee.

Code of Federal Regulations, 2014 CFR

2014-04-01

... 22 Foreign Relations 1 2014-04-01 2014-04-01 false The Guarantee. 230.03 Section 230.03 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEES ISSUED UNDER THE EMERGENCY WARTIME SUPPLEMENTAL APPROPRIATIONS ACT OF 2003, PUB. L. 108-11-STANDARD TERMS AND CONDITIONS § 230.03 The Guarantee...

22 CFR 230.03 - The Guarantee.

Code of Federal Regulations, 2011 CFR

2011-04-01

... 22 Foreign Relations 1 2011-04-01 2011-04-01 false The Guarantee. 230.03 Section 230.03 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEES ISSUED UNDER THE EMERGENCY WARTIME SUPPLEMENTAL APPROPRIATIONS ACT OF 2003, PUB. L. 108-11-STANDARD TERMS AND CONDITIONS § 230.03 The Guarantee...

77 FR 5721 - Surety Bond Guarantee Program-Quick Bond Guarantee Application and Agreement

Federal Register 2010, 2011, 2012, 2013, 2014

2012-02-06

... SMALL BUSINESS ADMINISTRATION 13 CFR Part 115 RIN 3245-AG39 Surety Bond Guarantee Program--Quick Bond Guarantee Application and Agreement AGENCY: Small Business Administration. ACTION: Proposed rule....gov . If you wish to submit confidential business information (CBI) as defined in the User Notice at...

13 CFR 120.400 - Loan Guarantee Agreements.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 13 Business Credit and Assistance 1 2010-01-01 2010-01-01 false Loan Guarantee Agreements. 120.400 Section 120.400 Business Credit and Assistance SMALL BUSINESS ADMINISTRATION BUSINESS LOANS Lenders § 120.400 Loan Guarantee Agreements. SBA may enter into a Loan Guarantee Agreement with a Lender to make...

13 CFR 120.400 - Loan Guarantee Agreements.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 13 Business Credit and Assistance 1 2011-01-01 2011-01-01 false Loan Guarantee Agreements. 120.400 Section 120.400 Business Credit and Assistance SMALL BUSINESS ADMINISTRATION BUSINESS LOANS Lenders § 120.400 Loan Guarantee Agreements. SBA may enter into a Loan Guarantee Agreement with a Lender to make...

20 CFR 229.10 - What the social security overall minimum guarantee is.

Code of Federal Regulations, 2011 CFR

2011-04-01

... 20 Employees' Benefits 1 2011-04-01 2011-04-01 false What the social security overall minimum... RAILROAD RETIREMENT ACT SOCIAL SECURITY OVERALL MINIMUM GUARANTEE Social Security Overall Minimum Guarantee Defined § 229.10 What the social security overall minimum guarantee is. The social security overall...

7 CFR 762.159 - Pledging of guarantee.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 7 Agriculture 7 2014-01-01 2014-01-01 false Pledging of guarantee. 762.159 Section 762.159 Agriculture Regulations of the Department of Agriculture (Continued) FARM SERVICE AGENCY, DEPARTMENT OF AGRICULTURE SPECIAL PROGRAMS GUARANTEED FARM LOANS § 762.159 Pledging of guarantee. A lender may pledge all or...

7 CFR 762.129 - Percent of guarantee and maximum loss.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 7 Agriculture 7 2014-01-01 2014-01-01 false Percent of guarantee and maximum loss. 762.129 Section 762.129 Agriculture Regulations of the Department of Agriculture (Continued) FARM SERVICE AGENCY, DEPARTMENT OF AGRICULTURE SPECIAL PROGRAMS GUARANTEED FARM LOANS § 762.129 Percent of guarantee and maximum...

13 CFR 120.348 - Amount of guarantee.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 13 Business Credit and Assistance 1 2010-01-01 2010-01-01 false Amount of guarantee. 120.348 Section 120.348 Business Credit and Assistance SMALL BUSINESS ADMINISTRATION BUSINESS LOANS Special Purpose Loans International Trade Loans § 120.348 Amount of guarantee. SBA can guarantee up to $1,250,000...

7 CFR 1980.309 - Lender participation in guaranteed RH loans.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 7 Agriculture 14 2010-01-01 2009-01-01 true Lender participation in guaranteed RH loans. 1980.309... Lender participation in guaranteed RH loans. (a) Qualification. The following Lenders are eligible to participate in the RHS guaranteed RH loan program upon presentation of evidence of said approval and execution...

7 CFR 1720.4 - General standards.

Code of Federal Regulations, 2013 CFR

2013-01-01

... GUARANTEES FOR BONDS AND NOTES ISSUED FOR ELECTRIFICATION OR TELEPHONE PURPOSES § 1720.4 General standards...) The proceeds of the guaranteed bonds will be used by the guaranteed lender to make loans to borrowers... bonds or notes previously issued by the guaranteed lender for such purposes; (2) At the time the...

7 CFR 1720.4 - General standards.

Code of Federal Regulations, 2014 CFR

2014-01-01

... GUARANTEES FOR BONDS AND NOTES ISSUED FOR ELECTRIFICATION OR TELEPHONE PURPOSES § 1720.4 General standards...) The proceeds of the guaranteed bonds will be used by the guaranteed lender to make loans to borrowers... bonds or notes previously issued by the guaranteed lender for such purposes; (2) At the time the...

7 CFR 1720.4 - General standards.

Code of Federal Regulations, 2010 CFR

2010-01-01

... GUARANTEES FOR BONDS AND NOTES ISSUED FOR ELECTRIFICATION OR TELEPHONE PURPOSES § 1720.4 General standards...) The proceeds of the guaranteed bonds will be used by the guaranteed lender to make loans to borrowers... bonds or notes previously issued by the guaranteed lender for such purposes; (2) At the time the...

7 CFR 1720.4 - General standards.

Code of Federal Regulations, 2011 CFR

2011-01-01

... GUARANTEES FOR BONDS AND NOTES ISSUED FOR ELECTRIFICATION OR TELEPHONE PURPOSES § 1720.4 General standards...) The proceeds of the guaranteed bonds will be used by the guaranteed lender to make loans to borrowers... bonds or notes previously issued by the guaranteed lender for such purposes; (2) At the time the...

7 CFR 1720.4 - General standards.

Code of Federal Regulations, 2012 CFR

2012-01-01

... GUARANTEES FOR BONDS AND NOTES ISSUED FOR ELECTRIFICATION OR TELEPHONE PURPOSES § 1720.4 General standards...) The proceeds of the guaranteed bonds will be used by the guaranteed lender to make loans to borrowers... bonds or notes previously issued by the guaranteed lender for such purposes; (2) At the time the...

20 CFR 229.10 - What the social security overall minimum guarantee is.

Code of Federal Regulations, 2012 CFR

2012-04-01

... 20 Employees' Benefits 1 2012-04-01 2012-04-01 false What the social security overall minimum... RAILROAD RETIREMENT ACT SOCIAL SECURITY OVERALL MINIMUM GUARANTEE Social Security Overall Minimum Guarantee Defined § 229.10 What the social security overall minimum guarantee is. The social security overall...

20 CFR 229.10 - What the social security overall minimum guarantee is.

Code of Federal Regulations, 2014 CFR

2014-04-01

... 20 Employees' Benefits 1 2014-04-01 2012-04-01 true What the social security overall minimum... RAILROAD RETIREMENT ACT SOCIAL SECURITY OVERALL MINIMUM GUARANTEE Social Security Overall Minimum Guarantee Defined § 229.10 What the social security overall minimum guarantee is. The social security overall...

20 CFR 229.10 - What the social security overall minimum guarantee is.

Code of Federal Regulations, 2013 CFR

2013-04-01

... 20 Employees' Benefits 1 2013-04-01 2012-04-01 true What the social security overall minimum... RAILROAD RETIREMENT ACT SOCIAL SECURITY OVERALL MINIMUM GUARANTEE Social Security Overall Minimum Guarantee Defined § 229.10 What the social security overall minimum guarantee is. The social security overall...

49 CFR 22.61 - Loan guarantee extensions.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 49 Transportation 1 2010-10-01 2010-10-01 false Loan guarantee extensions. 22.61 Section 22.61 Transportation Office of the Secretary of Transportation SHORT-TERM LENDING PROGRAM (STLP) Loan Administration § 22.61 Loan guarantee extensions. An extension of the original loan guarantee may be requested, in...

20 CFR 229.10 - What the social security overall minimum guarantee is.

Code of Federal Regulations, 2010 CFR

2010-04-01

... 20 Employees' Benefits 1 2010-04-01 2010-04-01 false What the social security overall minimum... RAILROAD RETIREMENT ACT SOCIAL SECURITY OVERALL MINIMUM GUARANTEE Social Security Overall Minimum Guarantee Defined § 229.10 What the social security overall minimum guarantee is. The social security overall...

12 CFR 370.6 - Assessments under the Debt Guarantee Program.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 12 Banks and Banking 4 2010-01-01 2010-01-01 false Assessments under the Debt Guarantee Program. 370.6 Section 370.6 Banks and Banking FEDERAL DEPOSIT INSURANCE CORPORATION REGULATIONS AND STATEMENTS OF GENERAL POLICY TEMPORARY LIQUIDITY GUARANTEE PROGRAM § 370.6 Assessments under the Debt Guarantee...

12 CFR 370.12 - Payment on the guarantee.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 12 Banks and Banking 4 2010-01-01 2010-01-01 false Payment on the guarantee. 370.12 Section 370.12 Banks and Banking FEDERAL DEPOSIT INSURANCE CORPORATION REGULATIONS AND STATEMENTS OF GENERAL POLICY TEMPORARY LIQUIDITY GUARANTEE PROGRAM § 370.12 Payment on the guarantee. (a) Claims for Deposits in...

13 CFR 120.621 - SBA guarantee of an Individual Certificate.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 13 Business Credit and Assistance 1 2010-01-01 2010-01-01 false SBA guarantee of an Individual Certificate. 120.621 Section 120.621 Business Credit and Assistance SMALL BUSINESS ADMINISTRATION BUSINESS LOANS Secondary Market The Sba Guarantee of A Certificate § 120.621 SBA guarantee of an Individual...

13 CFR 400.204 - Loan terms.

Code of Federal Regulations, 2012 CFR

2012-01-01

... 13 Business Credit and Assistance 1 2012-01-01 2012-01-01 false Loan terms. 400.204 Section 400.204 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.204 Loan terms. (a) All loans guaranteed under the Program shall be...

13 CFR 400.204 - Loan terms.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 13 Business Credit and Assistance 1 2014-01-01 2014-01-01 false Loan terms. 400.204 Section 400.204 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.204 Loan terms. (a) All loans guaranteed under the Program shall be...

13 CFR 400.204 - Loan terms.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 13 Business Credit and Assistance 1 2011-01-01 2011-01-01 false Loan terms. 400.204 Section 400.204 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.204 Loan terms. (a) All loans guaranteed under the Program shall be...

13 CFR 400.204 - Loan terms.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 13 Business Credit and Assistance 1 2010-01-01 2010-01-01 false Loan terms. 400.204 Section 400.204 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.204 Loan terms. (a) All loans guaranteed under the Program shall be...

13 CFR 400.204 - Loan terms.

Code of Federal Regulations, 2013 CFR

2013-01-01

... 13 Business Credit and Assistance 1 2013-01-01 2013-01-01 false Loan terms. 400.204 Section 400.204 Business Credit and Assistance EMERGENCY STEEL GUARANTEE LOAN BOARD EMERGENCY STEEL GUARANTEE LOAN PROGRAM Steel Guarantee Loans § 400.204 Loan terms. (a) All loans guaranteed under the Program shall be...

22 CFR 230.03 - The Guarantee.

Code of Federal Regulations, 2010 CFR

2010-04-01

... 22 Foreign Relations 1 2010-04-01 2010-04-01 false The Guarantee. 230.03 Section 230.03 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ISRAEL LOAN GUARANTEES ISSUED UNDER THE EMERGENCY WARTIME SUPPLEMENTAL APPROPRIATIONS ACT OF 2003, PUB. L. 108-11-STANDARD TERMS AND CONDITIONS § 230.03 The Guarantee...

7 CFR 1493.70 - Guarantee rates and fees.

Code of Federal Regulations, 2014 CFR

2014-01-01

... OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Export Credit Guarantee Program (GSM-102) and CCC Intermediate Export Credit Guarantee Program (GSM-103) Operations § 1493.70... length of the payment terms provided for in the export sale contract, the degree of risk that CCC assumes...

7 CFR 1493.90 - Certification requirements for the evidence of export.

Code of Federal Regulations, 2014 CFR

2014-01-01

... CREDIT CORPORATION, DEPARTMENT OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Export Credit Guarantee Program (GSM-102) and CCC Intermediate Export Credit Guarantee Program (GSM-103... certifications with respect to a GSM-102 or GSM-103 payment guarantee, CCC will have the right, notwithstanding...

7 CFR 1493.250 - Final application and issuance of a facility payment guarantee.

Code of Federal Regulations, 2010 CFR

2010-01-01

...) COMMODITY CREDIT CORPORATION, DEPARTMENT OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Facility Guarantee Program (FGP) Operations § 1493.250 Final application... application to CCC for a facility payment guarantee which shall include the following information: (1) A cover...

7 CFR 1493.70 - Guarantee rates and fees.

Code of Federal Regulations, 2012 CFR

2012-01-01

... OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Export Credit Guarantee Program (GSM-102) and CCC Intermediate Export Credit Guarantee Program (GSM-103) Operations § 1493.70... length of the payment terms provided for in the export sale contract, the degree of risk that CCC assumes...

7 CFR 1493.90 - Certification requirements for the evidence of export.

Code of Federal Regulations, 2012 CFR

2012-01-01

... CREDIT CORPORATION, DEPARTMENT OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Export Credit Guarantee Program (GSM-102) and CCC Intermediate Export Credit Guarantee Program (GSM-103... certifications with respect to a GSM-102 or GSM-103 payment guarantee, CCC will have the right, notwithstanding...

7 CFR 1493.250 - Final application and issuance of a facility payment guarantee.

Code of Federal Regulations, 2011 CFR

2011-01-01

...) COMMODITY CREDIT CORPORATION, DEPARTMENT OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Facility Guarantee Program (FGP) Operations § 1493.250 Final application... application to CCC for a facility payment guarantee which shall include the following information: (1) A cover...

7 CFR 1493.50 - Certification requirements for obtaining payment guarantee.

Code of Federal Regulations, 2014 CFR

2014-01-01

...) COMMODITY CREDIT CORPORATION, DEPARTMENT OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Export Credit Guarantee Program (GSM-102) and CCC Intermediate Export Credit Guarantee Program... requirements of § 1493.30, and the exporter will immediately notify CCC if there is a change of circumstances...

7 CFR 1493.50 - Certification requirements for obtaining payment guarantee.

Code of Federal Regulations, 2012 CFR

2012-01-01

...) COMMODITY CREDIT CORPORATION, DEPARTMENT OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Export Credit Guarantee Program (GSM-102) and CCC Intermediate Export Credit Guarantee Program... requirements of § 1493.30, and the exporter will immediately notify CCC if there is a change of circumstances...

7 CFR 1493.70 - Guarantee rates and fees.

Code of Federal Regulations, 2013 CFR

2013-01-01

... OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Export Credit Guarantee Program (GSM-102) and CCC Intermediate Export Credit Guarantee Program (GSM-103) Operations § 1493.70... length of the payment terms provided for in the export sale contract, the degree of risk that CCC assumes...

7 CFR 1493.50 - Certification requirements for obtaining payment guarantee.

Code of Federal Regulations, 2013 CFR

2013-01-01

...) COMMODITY CREDIT CORPORATION, DEPARTMENT OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Export Credit Guarantee Program (GSM-102) and CCC Intermediate Export Credit Guarantee Program... requirements of § 1493.30, and the exporter will immediately notify CCC if there is a change of circumstances...

7 CFR 1493.90 - Certification requirements for the evidence of export.

Code of Federal Regulations, 2013 CFR

2013-01-01

... CREDIT CORPORATION, DEPARTMENT OF AGRICULTURE EXPORT PROGRAMS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC Export Credit Guarantee Program (GSM-102) and CCC Intermediate Export Credit Guarantee Program (GSM-103... certifications with respect to a GSM-102 or GSM-103 payment guarantee, CCC will have the right, notwithstanding...

Discontinuation of approval of modifications in notes, guaranteed under Title VI or VII of the Public Health Service Act, proposed to permit use of the notes as collateral for tax-exempt financings--PHS. Final rule.

PubMed

1983-09-21

The Department of Health and Human Services (HHS) adds a new section to regulations for making and guaranteeing loans for construction and modernization of hospitals and medical facilities and to regulations for guaranteeing loans for the construction of teaching facilities for health professions personnel. Under these regulations HHS will not approve the modification of the terms of an existing loan guaranteed under Title VI or Title VII of the Public Health Service (PHS) Act if the modification would permit use of the guarantee (or guaranteed loan) as collateral for tax-exempt financing.

Solidify, An LLVM pass to compile LLVM IR into Solidity

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kothapalli, Abhiram

The software currently compiles LLVM IR into Solidity (Ethereum’s dominant programming language) using LLVM’s pass library. Specifically, his compiler allows us to convert an arbitrary DSL into Solidity. We focus specifically on converting Domain Specific Languages into Solidity due to their ease of use, and provable properties. By creating a toolchain to compile lightweight domain-specific languages into Ethereum's dominant language, Solidity, we allow non-specialists to effectively develop safe and useful smart contracts. For example lawyers from a certain firm can have a proprietary DSL that codifies basic laws safely converted to Solidity to be securely executed on the blockchain. Inmore » another example, a simple provenance tracking language can be compiled and securely executed on the blockchain.« less

Security Proof for Password Authentication in TLS-Verifier-based Three-Party Group Diffie-Hellman

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chevassut, Olivier; Milner, Joseph; Pointcheval, David

2008-04-21

The internet has grown greatly in the past decade, by some numbers exceeding 47 million active web sites and a total aggregate exceeding100 million web sites. What is common practice today on the Internet is that servers have public keys, but clients are largely authenticated via short passwords. Protecting these passwords by not storing them in the clear on institutions's servers has become a priority. This paper develops password-based ciphersuites for the Transport Layer Security (TLS) protocol that are: (1) resistant to server compromise; (2) provably secure; (3) believed to be free from patent and licensing restrictions based on anmore » analysis of relevant patents in the area.« less

Enabling Requirements-Based Programming for Highly-Dependable Complex Parallel and Distributed Systems

NASA Technical Reports Server (NTRS)

Hinchey, Michael G.; Rash, James L.; Rouff, Christopher A.

2005-01-01

The manual application of formal methods in system specification has produced successes, but in the end, despite any claims and assertions by practitioners, there is no provable relationship between a manually derived system specification or formal model and the customer's original requirements. Complex parallel and distributed system present the worst case implications for today s dearth of viable approaches for achieving system dependability. No avenue other than formal methods constitutes a serious contender for resolving the problem, and so recognition of requirements-based programming has come at a critical juncture. We describe a new, NASA-developed automated requirement-based programming method that can be applied to certain classes of systems, including complex parallel and distributed systems, to achieve a high degree of dependability.

A Provably Secure RFID Authentication Protocol Based on Elliptic Curve for Healthcare Environments.

PubMed

Farash, Mohammad Sabzinejad; Nawaz, Omer; Mahmood, Khalid; Chaudhry, Shehzad Ashraf; Khan, Muhammad Khurram

2016-07-01

To enhance the quality of healthcare in the management of chronic disease, telecare medical information systems have increasingly been used. Very recently, Zhang and Qi (J. Med. Syst. 38(5):47, 32), and Zhao (J. Med. Syst. 38(5):46, 33) separately proposed two authentication schemes for telecare medical information systems using radio frequency identification (RFID) technology. They claimed that their protocols achieve all security requirements including forward secrecy. However, this paper demonstrates that both Zhang and Qi's scheme, and Zhao's scheme could not provide forward secrecy. To augment the security, we propose an efficient RFID authentication scheme using elliptic curves for healthcare environments. The proposed RFID scheme is secure under common random oracle model.

Quantum Privacy Amplification and the Security of Quantum Cryptography over Noisy Channels

DOE Office of Scientific and Technical Information (OSTI.GOV)

Deutsch, D.; Ekert, A.; Jozsa, R.

1996-09-01

Existing quantum cryptographic schemes are not, as they stand, operable in the presence of noise on the quantum communication channel. Although they become operable if they are supplemented by classical privacy-amplification techniques, the resulting schemes are difficult to analyze and have not been proved secure. We introduce the concept of quantum privacy amplification and a cryptographic scheme incorporating it which is provably secure over a noisy channel. The scheme uses an {open_quote}{open_quote}entanglement purification{close_quote}{close_quote} procedure which, because it requires only a few quantum controlled-not and single-qubit operations, could be implemented using technology that is currently being developed. {copyright} {ital 1996 Themore » American Physical Society.}« less

A Rejection Principle for Sequential Tests of Multiple Hypotheses Controlling Familywise Error Rates

PubMed Central

BARTROFF, JAY; SONG, JINLIN

2015-01-01

We present a unifying approach to multiple testing procedures for sequential (or streaming) data by giving sufficient conditions for a sequential multiple testing procedure to control the familywise error rate (FWER). Together we call these conditions a “rejection principle for sequential tests,” which we then apply to some existing sequential multiple testing procedures to give simplified understanding of their FWER control. Next the principle is applied to derive two new sequential multiple testing procedures with provable FWER control, one for testing hypotheses in order and another for closed testing. Examples of these new procedures are given by applying them to a chromosome aberration data set and to finding the maximum safe dose of a treatment. PMID:26985125

Efficient Polar Coding of Quantum Information

NASA Astrophysics Data System (ADS)

Renes, Joseph M.; Dupuis, Frédéric; Renner, Renato

2012-08-01

Polar coding, introduced 2008 by Arıkan, is the first (very) efficiently encodable and decodable coding scheme whose information transmission rate provably achieves the Shannon bound for classical discrete memoryless channels in the asymptotic limit of large block sizes. Here, we study the use of polar codes for the transmission of quantum information. Focusing on the case of qubit Pauli channels and qubit erasure channels, we use classical polar codes to construct a coding scheme that asymptotically achieves a net transmission rate equal to the coherent information using efficient encoding and decoding operations and code construction. Our codes generally require preshared entanglement between sender and receiver, but for channels with a sufficiently low noise level we demonstrate that the rate of preshared entanglement required is zero.

12 CFR 1808.600 - Full faith and credit and incontestability of Guarantee.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 12 Banks and Banking 10 2014-01-01 2014-01-01 false Full faith and credit and incontestability of Guarantee. 1808.600 Section 1808.600 Banks and Banking COMMUNITY DEVELOPMENT FINANCIAL INSTITUTIONS FUND... Conditions of Guarantee § 1808.600 Full faith and credit and incontestability of Guarantee. The full faith...

7 CFR 3575.73 - Replacement of loss, theft, destruction, mutilation, or defacement of Loan Note Guarantee or...

Code of Federal Regulations, 2010 CFR

2010-01-01

... 7 Agriculture 15 2010-01-01 2010-01-01 false Replacement of loss, theft, destruction, mutilation... AGRICULTURE GENERAL Community Programs Guaranteed Loans § 3575.73 Replacement of loss, theft, destruction... circumstances of the loss, theft, or destruction of the Loan Note Guarantee or Assignment Guarantee Agreement...

13 CFR 115.18 - Refusal to issue further guarantees; suspension and termination of PSB status.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 13 Business Credit and Assistance 1 2010-01-01 2010-01-01 false Refusal to issue further guarantees; suspension and termination of PSB status. 115.18 Section 115.18 Business Credit and Assistance SMALL BUSINESS ADMINISTRATION SURETY BOND GUARANTEE Provisions for All Surety Bond Guarantees § 115.18...

7 CFR 4279.186 - Issuance of the guarantee.

Code of Federal Regulations, 2011 CFR

2011-01-01

... lender uses the single note option and assigns the guaranteed portion of the loan to a holder, the lender.... If requested by the lender, the Agency will provide the lender with a certification on Form 4279-7... official who signs the Loan Note Guarantee, Lender's Agreement, and Assignment Guarantee Agreement. (c) The...

78 FR 1220 - Agency Information Collection Activities: Guarantee of Payment

Federal Register 2010, 2011, 2012, 2013, 2014

2013-01-08

... and approval in accordance with the Paperwork Reduction Act: Guarantee of Payment (CBP Form I-510... forms of information. Title: Guarantee of Payment. OMB Number: 1651-0127. Form Number: CBP Form I-510... master of the vessel or aircraft on CBP Form I-510, Guarantee of Payment. No vessel or aircraft can be...

13 CFR 120.546 - Loan asset sales.

Code of Federal Regulations, 2010 CFR

2010-01-01

..., Liquidation and Debt Collection Litigation of 7(a) and 504 Loans Sba's Purchase of A Guaranteed Portion § 120... overseen by SBA upon the occurrence any of the following: (i) SBA's purchase of the guaranteed portion of... option to purchase such guaranteed portion; or (ii) SBA's purchase of the guaranteed portion from the...

42 CFR 417.937 - Loan and loan guarantee provisions.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 42 Public Health 3 2010-10-01 2010-10-01 false Loan and loan guarantee provisions. 417.937 Section... HEALTH CARE PREPAYMENT PLANS Administration of Outstanding Loans and Loan Guarantees § 417.937 Loan and loan guarantee provisions. (a) Disbursement of loan proceeds. The principal amount of any loan made or...

13 CFR 500.204 - Loan terms.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 13 Business Credit and Assistance 1 2010-01-01 2010-01-01 false Loan terms. 500.204 Section 500.204 Business Credit and Assistance EMERGENCY OIL AND GAS GUARANTEED LOAN BOARD EMERGENCY OIL AND GAS GUARANTEED LOAN PROGRAM Oil and Gas Guaranteed Loans § 500.204 Loan terms. (a) All loans guaranteed under the...

27 CFR 6.61 - Guaranteeing loans.

Code of Federal Regulations, 2010 CFR

2010-04-01

... 27 Alcohol, Tobacco Products and Firearms 1 2010-04-01 2010-04-01 false Guaranteeing loans. 6.61 Section 6.61 Alcohol, Tobacco Products and Firearms ALCOHOL AND TOBACCO TAX AND TRADE BUREAU, DEPARTMENT OF THE TREASURY LIQUORS âTIED-HOUSEâ Unlawful Inducements Guaranteeing Loans § 6.61 Guaranteeing loans. The act by an industry member of...

27 CFR 6.61 - Guaranteeing loans.

Code of Federal Regulations, 2011 CFR

2011-04-01

... 27 Alcohol, Tobacco Products and Firearms 1 2011-04-01 2011-04-01 false Guaranteeing loans. 6.61 Section 6.61 Alcohol, Tobacco Products and Firearms ALCOHOL AND TOBACCO TAX AND TRADE BUREAU, DEPARTMENT OF THE TREASURY LIQUORS âTIED-HOUSEâ Unlawful Inducements Guaranteeing Loans § 6.61 Guaranteeing loans. The act by an industry member of...

29 CFR 4022.27 - Phase-in of guarantee of unpredictable contingent event benefits.

Code of Federal Regulations, 2014 CFR

2014-07-01

... 29 Labor 9 2014-07-01 2014-07-01 false Phase-in of guarantee of unpredictable contingent event... Guaranteed Benefits § 4022.27 Phase-in of guarantee of unpredictable contingent event benefits. (a) Scope... event benefit (UCEB) and that is payable with respect to an unpredictable contingent event (UCE) that...

13 CFR 120.620 - SBA guarantee of a Pool Certificate.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 13 Business Credit and Assistance 1 2010-01-01 2010-01-01 false SBA guarantee of a Pool Certificate. 120.620 Section 120.620 Business Credit and Assistance SMALL BUSINESS ADMINISTRATION BUSINESS LOANS Secondary Market The Sba Guarantee of A Certificate § 120.620 SBA guarantee of a Pool Certificate...

Extra-analytical quality indicators and laboratory performances.

PubMed

Sciacovelli, Laura; Aita, Ada; Plebani, Mario

2017-07-01

In the last few years much progress has been made in raising the awareness of laboratory medicine professionals about the effectiveness of quality indicators (QIs) in monitoring, and improving upon, performances in the extra-analytical phases of the Total Testing Process (TTP). An effective system for management of QIs includes the implementation of an internal assessment system and participation in inter-laboratory comparison. A well-designed internal assessment system allows the identification of critical activities and their systematic monitoring. Active participation in inter-laboratory comparison provides information on the performance level of one laboratory with respect to that of other participating laboratories. In order to guarantee the use of appropriate QIs and facilitate their implementation, many laboratories have adopted the Model of Quality Indicators (MQI) proposed by Working Group "Laboratory Errors and Patient Safety" (WG-LEPS) of IFCC, since 2008, which is the result of international consensus and continuous experimentation, and updating to meet new, constantly emerging needs. Data from participating laboratories are collected monthly and reports describing the statistical results and evaluating laboratory data, utilizing the Six Sigma metric, issued regularly. Although the results demonstrate that the processes need to be improved upon, overall the comparison with data collected in 2014 shows a general stability of quality levels and that an improvement has been achieved over time for some activities. The continuous monitoring of QI data allows identification all possible improvements, thus highlighting the value of participation in the inter-laboratory program proposed by WG-LEPS. The active participation of numerous laboratories will guarantee an ever more significant State-of-the-Art, promote the reduction of errors and improve quality of the TTP, thus guaranteeing patient safety. Copyright © 2017. Published by Elsevier Inc.

Efficient and anonymous two-factor user authentication in wireless sensor networks: achieving user anonymity with lightweight sensor computation.

PubMed

Nam, Junghyun; Choo, Kim-Kwang Raymond; Han, Sangchul; Kim, Moonseong; Paik, Juryon; Won, Dongho

2015-01-01

A smart-card-based user authentication scheme for wireless sensor networks (hereafter referred to as a SCA-WSN scheme) is designed to ensure that only users who possess both a smart card and the corresponding password are allowed to gain access to sensor data and their transmissions. Despite many research efforts in recent years, it remains a challenging task to design an efficient SCA-WSN scheme that achieves user anonymity. The majority of published SCA-WSN schemes use only lightweight cryptographic techniques (rather than public-key cryptographic techniques) for the sake of efficiency, and have been demonstrated to suffer from the inability to provide user anonymity. Some schemes employ elliptic curve cryptography for better security but require sensors with strict resource constraints to perform computationally expensive scalar-point multiplications; despite the increased computational requirements, these schemes do not provide user anonymity. In this paper, we present a new SCA-WSN scheme that not only achieves user anonymity but also is efficient in terms of the computation loads for sensors. Our scheme employs elliptic curve cryptography but restricts its use only to anonymous user-to-gateway authentication, thereby allowing sensors to perform only lightweight cryptographic operations. Our scheme also enjoys provable security in a formal model extended from the widely accepted Bellare-Pointcheval-Rogaway (2000) model to capture the user anonymity property and various SCA-WSN specific attacks (e.g., stolen smart card attacks, node capture attacks, privileged insider attacks, and stolen verifier attacks).

Efficient and Anonymous Two-Factor User Authentication in Wireless Sensor Networks: Achieving User Anonymity with Lightweight Sensor Computation

PubMed Central

Nam, Junghyun; Choo, Kim-Kwang Raymond; Han, Sangchul; Kim, Moonseong; Paik, Juryon; Won, Dongho

2015-01-01

A smart-card-based user authentication scheme for wireless sensor networks (hereafter referred to as a SCA-WSN scheme) is designed to ensure that only users who possess both a smart card and the corresponding password are allowed to gain access to sensor data and their transmissions. Despite many research efforts in recent years, it remains a challenging task to design an efficient SCA-WSN scheme that achieves user anonymity. The majority of published SCA-WSN schemes use only lightweight cryptographic techniques (rather than public-key cryptographic techniques) for the sake of efficiency, and have been demonstrated to suffer from the inability to provide user anonymity. Some schemes employ elliptic curve cryptography for better security but require sensors with strict resource constraints to perform computationally expensive scalar-point multiplications; despite the increased computational requirements, these schemes do not provide user anonymity. In this paper, we present a new SCA-WSN scheme that not only achieves user anonymity but also is efficient in terms of the computation loads for sensors. Our scheme employs elliptic curve cryptography but restricts its use only to anonymous user-to-gateway authentication, thereby allowing sensors to perform only lightweight cryptographic operations. Our scheme also enjoys provable security in a formal model extended from the widely accepted Bellare-Pointcheval-Rogaway (2000) model to capture the user anonymity property and various SCA-WSN specific attacks (e.g., stolen smart card attacks, node capture attacks, privileged insider attacks, and stolen verifier attacks). PMID:25849359

Experimentally feasible quantum-key-distribution scheme using qubit-like qudits and its comparison with existing qubit- and qudit-based protocols

NASA Astrophysics Data System (ADS)

Chau, H. F.; Wang, Qinan; Wong, Cardythy

2017-02-01

Recently, Chau [Phys. Rev. A 92, 062324 (2015), 10.1103/PhysRevA.92.062324] introduced an experimentally feasible qudit-based quantum-key-distribution (QKD) scheme. In that scheme, one bit of information is phase encoded in the prepared state in a 2n-dimensional Hilbert space in the form (|i > ±|j >) /√{2 } with n ≥2 . For each qudit prepared and measured in the same two-dimensional Hilbert subspace, one bit of raw secret key is obtained in the absence of transmission error. Here we show that by modifying the basis announcement procedure, the same experimental setup can generate n bits of raw key for each qudit prepared and measured in the same basis in the noiseless situation. The reason is that in addition to the phase information, each qudit also carries information on the Hilbert subspace used. The additional (n -1 ) bits of raw key comes from a clever utilization of this extra piece of information. We prove the unconditional security of this modified protocol and compare its performance with other existing provably secure qubit- and qudit-based protocols on market in the one-way classical communication setting. Interestingly, we find that for the case of n =2 , the secret key rate of this modified protocol using nondegenerate random quantum code to perform one-way entanglement distillation is equal to that of the six-state scheme.

Wisteria floribunda Agglutinin and Its Reactive-Glycan-Carrying Prostate-Specific Antigen as a Novel Diagnostic and Prognostic Marker of Prostate Cancer

PubMed Central

Hagiwara, Kazuhisa; Tobisawa, Yuki; Kaya, Takatoshi; Kaneko, Tomonori; Hatakeyama, Shingo; Mori, Kazuyuki; Hashimoto, Yasuhiro; Koie, Takuya; Suda, Yoshihiko; Ohyama, Chikara; Yoneyama, Tohru

2017-01-01

Wisteria floribunda agglutinin (WFA) preferably binds to LacdiNAc glycans, and its reactivity is associated with tumor progression. The aim of this study to examine whether the serum LacdiNAc carrying prostate-specific antigen–glycosylation isomer (PSA-Gi) and WFA-reactivity of tumor tissue can be applied as a diagnostic and prognostic marker of prostate cancer (PCa). Between 2007 and 2016, serum PSA-Gi levels before prostate biopsy (Pbx) were measured in 184 biopsy-proven benign prostatic hyperplasia patients and 244 PCa patients using an automated lectin-antibody immunoassay. WFA-reactivity on tumor was analyzed in 260 radical prostatectomy (RP) patients. Diagnostic and prognostic performance of serum PSA-Gi was evaluated using area under the receiver-operator characteristic curve (AUC). Prognostic performance of WFA-reactivity on tumor was evaluated via Cox proportional hazards regression analysis and nomogram. The AUC of serum PSA-Gi detecting PCa and predicting Pbx Grade Group (GG) 3 and GG ≥ 3 after RP was much higher than those of conventional PSA. Multivariate analysis showed that WFA-reactivity on prostate tumor was an independent risk factor of PSA recurrence. The nomogram was a strong model for predicting PSA-free survival provability with a c-index ≥0.7. Serum PSA-Gi levels and WFA-reactivity on prostate tumor may be a novel diagnostic and pre- and post-operative prognostic biomarkers of PCa, respectively. PMID:28134773

Wisteria floribunda Agglutinin and Its Reactive-Glycan-Carrying Prostate-Specific Antigen as a Novel Diagnostic and Prognostic Marker of Prostate Cancer.

PubMed

Hagiwara, Kazuhisa; Tobisawa, Yuki; Kaya, Takatoshi; Kaneko, Tomonori; Hatakeyama, Shingo; Mori, Kazuyuki; Hashimoto, Yasuhiro; Koie, Takuya; Suda, Yoshihiko; Ohyama, Chikara; Yoneyama, Tohru

2017-01-26

Wisteria floribunda agglutinin (WFA) preferably binds to LacdiNAc glycans, and its reactivity is associated with tumor progression. The aim of this study to examine whether the serum LacdiNAc carrying prostate-specific antigen-glycosylation isomer (PSA-Gi) and WFA-reactivity of tumor tissue can be applied as a diagnostic and prognostic marker of prostate cancer (PCa). Between 2007 and 2016, serum PSA-Gi levels before prostate biopsy (Pbx) were measured in 184 biopsy-proven benign prostatic hyperplasia patients and 244 PCa patients using an automated lectin-antibody immunoassay. WFA-reactivity on tumor was analyzed in 260 radical prostatectomy (RP) patients. Diagnostic and prognostic performance of serum PSA-Gi was evaluated using area under the receiver-operator characteristic curve (AUC). Prognostic performance of WFA-reactivity on tumor was evaluated via Cox proportional hazards regression analysis and nomogram. The AUC of serum PSA-Gi detecting PCa and predicting Pbx Grade Group (GG) 3 and GG ≥ 3 after RP was much higher than those of conventional PSA. Multivariate analysis showed that WFA-reactivity on prostate tumor was an independent risk factor of PSA recurrence. The nomogram was a strong model for predicting PSA-free survival provability with a c -index ≥0.7. Serum PSA-Gi levels and WFA-reactivity on prostate tumor may be a novel diagnostic and pre- and post-operative prognostic biomarkers of PCa, respectively.

PEM-INST-001: Instructions for Plastic Encapsulated Microcircuit (PEM) Selection, Screening, and Qualification

NASA Technical Reports Server (NTRS)

Teverovsky, Alexander; Sahu, Kusum

2003-01-01

Potential users of plastic encapsulated microcircuits (PEMs) need to be reminded that unlike the military system of producing robust high-reliability microcircuits that are designed to perform acceptably in a variety of harsh environments, PEMs are primarily designed for use in benign environments where equipment is easily accessed for repair or replacement. The methods of analysis applied to military products to demonstrate high reliability cannot always be applied to PEMs. This makes it difficult for users to characterize PEMs for two reasons: 1. Due to the major differences in design and construction, the standard test practices used to ensure that military devices are robust and have high reliability often cannot be applied to PEMs that have a smaller operating temperature range and are typically more frail and susceptible to moisture absorption. In contrast, high-reliability military microcircuits usually utilize large, robust, high-temperature packages that are hermetically sealed. 2. Unlike the military high-reliability system, users of PEMs have little visibility into commercial manufacturers proprietary design, materials, die traceability, and production processes and procedures. There is no central authority that monitors PEM commercial product for quality, and there are no controls in place that can be imposed across all commercial manufacturers to provide confidence to high-reliability users that a common acceptable level of quality exists for all PEMs manufacturers. Consequently, there is no guaranteed control over the type of reliability that is built into commercial product, and there is no guarantee that different lots from the same manufacturer are equally acceptable. And regarding application, there is no guarantee that commercial products intended for use in benign environments will provide acceptable performance and reliability in harsh space environments. The qualification and screening processes contained in this document are intended to detect poor-quality lots and screen out early random failures from use in space flight hardware. However, since it cannot be guaranteed that quality was designed and built into PEMs that are appropriate for space applications, users cannot screen in quality that may not exist. It must be understood that due to the variety of materials, processes, and technologies used to design and produce PEMs, this test process may not accelerate and detect all failure mechanisms. While the tests herein will increase user confidence that PEMs with otherwise unknown reliability can be used in space environments, such testing may not guarantee the same level of reliability offered by military microcircuits. PEMs should only be used where due to performance needs there are no alternatives in the military high-reliability market, and projects are willing to accept higher risk.

7 CFR 3565.505 - Liability.

Code of Federal Regulations, 2010 CFR

2010-01-01

... GUARANTEED RURAL RENTAL HOUSING PROGRAM Agency Guaranteed Loans That Back Ginnie Mae Guaranteed Securities... limited to, negligence, fraud, abuse, misrepresentation or misuse of funds, property condition, or...

13 CFR 120.521 - What interest rate applies after SBA purchases its guaranteed portion?

Code of Federal Regulations, 2010 CFR

2010-01-01

... 13 Business Credit and Assistance 1 2010-01-01 2010-01-01 false What interest rate applies after... 504 Loans Sba's Purchase of A Guaranteed Portion § 120.521 What interest rate applies after SBA purchases its guaranteed portion? When SBA purchases the guaranteed portion of a fixed interest rate loan...

13 CFR 107.1600 - SBA authority to issue and guarantee Trust Certificates.

Code of Federal Regulations, 2011 CFR

2011-01-01

... guarantee by SBA of such TC is limited to the principal and interest due on the Debentures or the Redemption Price of and Prioritized Payments on Participating Securities in any Trust or Pool backing such TC. The... guarantee of any TC. (b) Periodic exercise of authority. SBA will issue guarantees of Debentures and...

7 CFR Appendix I to Subpart E of... - Instructions for Loan Guarantees for Drought and Disaster Relief

Code of Federal Regulations, 2012 CFR

2012-01-01

... 7 Agriculture 14 2012-01-01 2012-01-01 false Instructions for Loan Guarantees for Drought and...—Instructions for Loan Guarantees for Drought and Disaster Relief A. In general. Drought and Disaster (D&D... amount of qualifying loans. Interest and protective advances are not covered by the guarantee. Drought...

7 CFR Appendix I to Subpart E of... - Instructions for Loan Guarantees for Drought and Disaster Relief

Code of Federal Regulations, 2013 CFR

2013-01-01

... 7 Agriculture 14 2013-01-01 2013-01-01 false Instructions for Loan Guarantees for Drought and...—Instructions for Loan Guarantees for Drought and Disaster Relief A. In general. Drought and Disaster (D&D... amount of qualifying loans. Interest and protective advances are not covered by the guarantee. Drought...

7 CFR Appendix I to Subpart E of... - Instructions for Loan Guarantees for Drought and Disaster Relief

Code of Federal Regulations, 2014 CFR

2014-01-01

... 7 Agriculture 14 2014-01-01 2014-01-01 false Instructions for Loan Guarantees for Drought and...—Instructions for Loan Guarantees for Drought and Disaster Relief A. In general. Drought and Disaster (D&D... amount of qualifying loans. Interest and protective advances are not covered by the guarantee. Drought...

Student Loan Guarantee Agencies and Their Financing. A Working Paper.

ERIC Educational Resources Information Center

Hansen, Janet S.; Wolfe, Mark L.

Guarantee agencies and their financing are discussed in order to increase awareness of their role and to provide information for policy decisions. Information is provided on: the history of the Guaranteed Student Loan (GSL) program, sources and uses of funds by state guarantee agencies for fiscal years (FY) 1982 and 1984, federal advances repaid…

13 CFR 107.1600 - SBA authority to issue and guarantee Trust Certificates.

Code of Federal Regulations, 2010 CFR

2010-01-01

... guarantee by SBA of such TC is limited to the principal and interest due on the Debentures or the Redemption Price of and Prioritized Payments on Participating Securities in any Trust or Pool backing such TC. The... guarantee of any TC. (b) Periodic exercise of authority. SBA will issue guarantees of Debentures and...

7 CFR 1738.30 - Rural broadband access loans and loan guarantees.

Code of Federal Regulations, 2010 CFR

2010-01-01

... interest at a rate set by the lender consistent with the current applicable market rate for a loan of... Derivative or any Guaranteed-Amount Debt Derivative; or (B) Any holder of the Guaranteed Loan Note or any Guaranteed Loan Portion Note or any Derivative, as the case may be, having a claim to payments on the...

The Educational Warranty: Redesigning the Profession.

ERIC Educational Resources Information Center

Antonelli, George A.

Teacher education programs which guarantee the effectiveness of their graduates may help to redesign the image and substance of the teaching profession. Doane College (Nebraska), one of the pioneers with educational warranties, bases its program on previous concepts of performance contracting and criterion referenced evaluation. Doane's beginning…

7 CFR 3565.451 - Preclaim requirements.

Code of Federal Regulations, 2010 CFR

2010-01-01

... take possession of the security collateral and dispose of the property. (b) Due diligence by lender... required, guaranteed lenders shall perform due diligence in conjunction with the appraisal and submit it to... Testing and Materials is considered an acceptable format for due diligence. (c) Environmental review. The...

Value Iteration Adaptive Dynamic Programming for Optimal Control of Discrete-Time Nonlinear Systems.

PubMed

Wei, Qinglai; Liu, Derong; Lin, Hanquan

2016-03-01

In this paper, a value iteration adaptive dynamic programming (ADP) algorithm is developed to solve infinite horizon undiscounted optimal control problems for discrete-time nonlinear systems. The present value iteration ADP algorithm permits an arbitrary positive semi-definite function to initialize the algorithm. A novel convergence analysis is developed to guarantee that the iterative value function converges to the optimal performance index function. Initialized by different initial functions, it is proven that the iterative value function will be monotonically nonincreasing, monotonically nondecreasing, or nonmonotonic and will converge to the optimum. In this paper, for the first time, the admissibility properties of the iterative control laws are developed for value iteration algorithms. It is emphasized that new termination criteria are established to guarantee the effectiveness of the iterative control laws. Neural networks are used to approximate the iterative value function and compute the iterative control law, respectively, for facilitating the implementation of the iterative ADP algorithm. Finally, two simulation examples are given to illustrate the performance of the present method.

Analysis and design of gain scheduled control systems. Ph.D. Thesis

NASA Technical Reports Server (NTRS)

Shamma, Jeff S.

1988-01-01

Gain scheduling, as an idea, is to construct a global feedback control system for a time varying and/or nonlinear plant from a collection of local time invariant designs. However in the absence of a sound analysis, these designs come with no guarantees on the robustness, performance, or even nominal stability of the overall gain schedule design. Such an analysis is presented for three types of gain scheduling situations: (1) a linear parameter varying plant scheduling on its exogenous parameters, (2) a nonlinear plant scheduling on a prescribed reference trajectory, and (3) a nonlinear plant scheduling on the current plant output. Conditions are given which guarantee that the stability, robustness, and performance properties of the fixed operating point designs carry over to the global gain scheduled designs, such as the scheduling variable should vary slowly and capture the plants nonlinearities. Finally, an alternate design framework is proposed which removes the slowing varying restriction or gain scheduled systems. This framework addresses some fundamental feedback issues previously ignored in standard gain.

Optimal control of coupled parabolic-hyperbolic non-autonomous PDEs: infinite-dimensional state-space approach

NASA Astrophysics Data System (ADS)

Aksikas, I.; Moghadam, A. Alizadeh; Forbes, J. F.

2018-04-01

This paper deals with the design of an optimal state-feedback linear-quadratic (LQ) controller for a system of coupled parabolic-hypebolic non-autonomous partial differential equations (PDEs). The infinite-dimensional state space representation and the corresponding operator Riccati differential equation are used to solve the control problem. Dynamical properties of the coupled system of interest are analysed to guarantee the existence and uniqueness of the solution of the LQ-optimal control problem and also to guarantee the exponential stability of the closed-loop system. Thanks to the eigenvalues and eigenfunctions of the parabolic operator and also the fact that the hyperbolic-associated operator Riccati differential equation can be converted to a scalar Riccati PDE, an algorithm to solve the LQ control problem has been presented. The results are applied to a non-isothermal packed-bed catalytic reactor. The LQ optimal controller designed in the early portion of the paper is implemented for the original non-linear model. Numerical simulations are performed to show the controller performances.

Rotary-wing aerodynamics. Volume 2: Performance prediction of helicopters

NASA Technical Reports Server (NTRS)

Keys, C. N.; Stephniewski, W. Z. (Editor)

1979-01-01

Application of theories, as well as, special methods of procedures applicable to performance prediction are illustrated first, on an example of the conventional helicopter and then, winged and tandem configurations. Performance prediction of conventional helicopters in hover and vertical ascent are investigated. Various approaches to performance prediction in forward translation are presented. Performance problems are discussed only this time, a wing is added to the baseline configuration, and both aircraft are compared with respect to their performance. This comparison is extended to a tandem. Appendices on methods for estimating performance guarantees and growth of aircraft concludes this volume.

Guaranteed Student Loans. Better Criteria Needed for Financing Guarantee Agencies. United States General Accounting Office Report to the Congress.

ERIC Educational Resources Information Center

Comptroller General of the U.S., Washington, DC.

The financing of guarantee agencies under the U.S. Department of Education's Guaranteed Student Loan Program was reviewed to determine whether, in the aggregate, the agencies are accumulating, retaining, and using reserve funds in accordance with legislative requirements and federal regulations. It was found that reserves exceed the risks…

29 CFR 4022.25 - Five-year phase-in of benefit guarantee for participants other than substantial owners.

Code of Federal Regulations, 2010 CFR

2010-07-01

... years a benefit increase has been in effect, each complete 12-month period ending on or before the... 29 Labor 9 2010-07-01 2010-07-01 false Five-year phase-in of benefit guarantee for participants... PLANS Limitations on Guaranteed Benefits § 4022.25 Five-year phase-in of benefit guarantee for...

Joint graph cut and relative fuzzy connectedness image segmentation algorithm.

PubMed

Ciesielski, Krzysztof Chris; Miranda, Paulo A V; Falcão, Alexandre X; Udupa, Jayaram K

2013-12-01

We introduce an image segmentation algorithm, called GC(sum)(max), which combines, in novel manner, the strengths of two popular algorithms: Relative Fuzzy Connectedness (RFC) and (standard) Graph Cut (GC). We show, both theoretically and experimentally, that GC(sum)(max) preserves robustness of RFC with respect to the seed choice (thus, avoiding "shrinking problem" of GC), while keeping GC's stronger control over the problem of "leaking though poorly defined boundary segments." The analysis of GC(sum)(max) is greatly facilitated by our recent theoretical results that RFC can be described within the framework of Generalized GC (GGC) segmentation algorithms. In our implementation of GC(sum)(max) we use, as a subroutine, a version of RFC algorithm (based on Image Forest Transform) that runs (provably) in linear time with respect to the image size. This results in GC(sum)(max) running in a time close to linear. Experimental comparison of GC(sum)(max) to GC, an iterative version of RFC (IRFC), and power watershed (PW), based on a variety medical and non-medical images, indicates superior accuracy performance of GC(sum)(max) over these other methods, resulting in a rank ordering of GC(sum)(max)>PW∼IRFC>GC. Copyright © 2013 Elsevier B.V. All rights reserved.

Statistical Symbolic Execution with Informed Sampling

NASA Technical Reports Server (NTRS)

Filieri, Antonio; Pasareanu, Corina S.; Visser, Willem; Geldenhuys, Jaco

2014-01-01

Symbolic execution techniques have been proposed recently for the probabilistic analysis of programs. These techniques seek to quantify the likelihood of reaching program events of interest, e.g., assert violations. They have many promising applications but have scalability issues due to high computational demand. To address this challenge, we propose a statistical symbolic execution technique that performs Monte Carlo sampling of the symbolic program paths and uses the obtained information for Bayesian estimation and hypothesis testing with respect to the probability of reaching the target events. To speed up the convergence of the statistical analysis, we propose Informed Sampling, an iterative symbolic execution that first explores the paths that have high statistical significance, prunes them from the state space and guides the execution towards less likely paths. The technique combines Bayesian estimation with a partial exact analysis for the pruned paths leading to provably improved convergence of the statistical analysis. We have implemented statistical symbolic execution with in- formed sampling in the Symbolic PathFinder tool. We show experimentally that the informed sampling obtains more precise results and converges faster than a purely statistical analysis and may also be more efficient than an exact symbolic analysis. When the latter does not terminate symbolic execution with informed sampling can give meaningful results under the same time and memory limits.

[The determination of the discrepancy between the mathematically ascertained and experimentally provable efficiency of UV facilities for water disinfection].

PubMed

Leuker, G; Hingst, V

1992-10-01

Using three UV-plants of different technical designs for water disinfection, we studied the conformity between experimental germ reduction using standard test organisms and calculated UV-doses under various water flow conditions. Taking into consideration the style of construction of the UV-plants, the irradiation area and the layer thickness were used as constant parameters for dose calculations. This was also employed for the irradiation intensity, since the experiments were performed for a relatively short period compared of the life span of the UV-irradiators. Both exposure time and water transmission were employed as variable parameters in the dose calculations and experimental procedures respectively. The calculated UV-dose and experimentally obtained germ reduction values were comparatively the same for two of the three UV-plants studied. However, no correlation was observed between the reduction of E. coli and the corresponding calculated UV-dose values. Therefore, the calculated UV-dose values for any given UV-plant should be considered to be relative and by no means absolute values. We are of the opinion that within a certain range of water flow rate and transmission, antimicrobial effectiveness of different UV-plants should be demonstrated independent of dose values, technical and other construction characteristics. The applicability of the UV-plants studied is discussed.

77 FR 21494 - Definition of “Predominantly Engaged in Financial Activities”

Federal Register 2010, 2011, 2012, 2013, 2014

2012-04-10

... financial activities that were authorized by the Board under various authorities at different points in time... activities that are closely related to banking.\\23\\ These activities include performing appraisals of real... industrial real estate financing, providing check guarantee services, providing collection agency services...

76 FR 77268 - Sunshine Act; Notice of Agency Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2011-12-12

... Regulations, Corporate Credit Unions. 2. NCUA Strategic Plan 2011-2014. 3. NCUA Annual Performance Budget 2012... Participations. 8. Advance Notice of Proposed Rulemaking, Part 741 of NCUA's Rules and Regulations, Maintaining Access to Emergency Liquidity. 9. 2012 Budget for NCUA Guaranteed Note Securities Management and...

30 CFR 773.17 - Permit conditions.

Code of Federal Regulations, 2010 CFR

2010-07-01

... to the performance bond or other equivalent guarantee in effect pursuant to subchapter J of this.... (e) The permittee shall take all possible steps to minimize any adverse impact to the environment or public health and safety resulting from noncompliance with any term or condition or the permit, including...

24 CFR 573.2 - Definitions.

Code of Federal Regulations, 2012 CFR

2012-04-01

... may also be a Pension Fund. Guarantee means an obligation of the United States Government guaranteeing.... Guaranteed Loan Funds means funds received by the borrower from the Financial Institution to finance eligible...

24 CFR 573.2 - Definitions.

Code of Federal Regulations, 2014 CFR

2014-04-01

... may also be a Pension Fund. Guarantee means an obligation of the United States Government guaranteeing.... Guaranteed Loan Funds means funds received by the borrower from the Financial Institution to finance eligible...

24 CFR 573.2 - Definitions.

Code of Federal Regulations, 2013 CFR

2013-04-01

... may also be a Pension Fund. Guarantee means an obligation of the United States Government guaranteeing.... Guaranteed Loan Funds means funds received by the borrower from the Financial Institution to finance eligible...

7 CFR 1493.200 - General statement.

Code of Federal Regulations, 2010 CFR

2010-01-01

... OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS CCC EXPORT CREDIT GUARANTEE PROGRAMS CCC... Commodity Credit Corporation's (CCC) Facility Guarantee Program (FGP). CCC will issue facility payment... payment guarantee issued by CCC. ...