ALPHABETS OF THE MODERN SLAVIC LANGUAGES.

Science.gov (United States)

BIDWELL, CHARLES E.

THE TABLES AND ACCOMPANYING EXPLANATIONS IN THIS OUTLINE ARE INTENDED FOR THE NON-SPECIALIST IN SLAVIC LANGUAGES WHO WISHES TO LEARN THE APPROXIMATE PRONUNCIATION AND TRANSLITERATION OF WORDS WRITTEN IN THE SLAVIC ALPHABET. EACH ALPHABET TREATED (CZECH, RUSSIAN, UKRAINIAN, BIELORUSSIAN, BULGARIAN, SLOVENIAN, SERBO-CROATIAN, POLISH, CHURCH SLAVIC,…

Switched periodic systems in discrete time: stability and input-output norms

Science.gov (United States)

Bolzern, Paolo; Colaneri, Patrizio

2013-07-01

This paper deals with the analysis of stability and the characterisation of input-output norms for discrete-time periodic switched linear systems. Such systems consist of a network of time-periodic linear subsystems sharing the same state vector and an exogenous switching signal that triggers the jumps between the subsystems. The overall system exhibits a complex dynamic behaviour due to the interplay between the time periodicity of the subsystem parameters and the switching signal. Both arbitrary switching signals and signals satisfying a dwell-time constraint are considered. Linear matrix inequality conditions for stability and guaranteed H2 and H∞ performances are provided. The results heavily rely on the merge of the theory of linear periodic systems and recent developments on switched linear time-invariant systems.

The Alphabet of the Universe

CERN Multimedia

Antonella Del Rosso

2015-01-01

One of the most culturally inspiring – yet unexpected – venues where you can find an exhibition about CERN and particle physics these days is the Bibliotheca Alexandrina in Egypt. Discover The Alphabet of the Universe: from CERN to North Africa and the Middle East in the cradle of knowledge par excellence.   The Alphabet of the Universe exhibition in Alexandria. (Image credit: Bibliotheca Alexandrina) With its 400 square metres surface area, about 40 exhibits and more than 50 people involved, The Alphabet of the Universe exhibition was inaugurated on 19 January in the Planetarium Science Centre (PSC), one of the main attractions of the New Library of Alexandria. “The exhibition has been designed to cover four main themes related to particle physics and CERN: what we know; open issues; accelerators and detectors; computing and applications,” explains Barbara Gallavotti, curator of the exhibition. “The exhibits were designed b...

An adaptive three-stage extended Kalman filter for nonlinear discrete-time system in presence of unknown inputs.

Science.gov (United States)

Xiao, Mengli; Zhang, Yongbo; Wang, Zhihua; Fu, Huimin

2018-04-01

Considering the performances of conventional Kalman filter may seriously degrade when it suffers stochastic faults and unknown input, which is very common in engineering problems, a new type of adaptive three-stage extended Kalman filter (AThSEKF) is proposed to solve state and fault estimation in nonlinear discrete-time system under these conditions. The three-stage UV transformation and adaptive forgetting factor are introduced for derivation, and by comparing with the adaptive augmented state extended Kalman filter, it is proven to be uniformly asymptotically stable. Furthermore, the adaptive three-stage extended Kalman filter is applied to a two-dimensional radar tracking scenario to illustrate the effect, and the performance is compared with that of conventional three stage extended Kalman filter (ThSEKF) and the adaptive two-stage extended Kalman filter (ATEKF). The results show that the adaptive three-stage extended Kalman filter is more effective than these two filters when facing the nonlinear discrete-time systems with information of unknown inputs not perfectly known. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

Structural alphabets derived from attractors in conformational space

Directory of Open Access Journals (Sweden)

Kleinjung Jens

2010-02-01

Full Text Available Abstract Background The hierarchical and partially redundant nature of protein structures justifies the definition of frequently occurring conformations of short fragments as 'states'. Collections of selected representatives for these states define Structural Alphabets, describing the most typical local conformations within protein structures. These alphabets form a bridge between the string-oriented methods of sequence analysis and the coordinate-oriented methods of protein structure analysis. Results A Structural Alphabet has been derived by clustering all four-residue fragments of a high-resolution subset of the protein data bank and extracting the high-density states as representative conformational states. Each fragment is uniquely defined by a set of three independent angles corresponding to its degrees of freedom, capturing in simple and intuitive terms the properties of the conformational space. The fragments of the Structural Alphabet are equivalent to the conformational attractors and therefore yield a most informative encoding of proteins. Proteins can be reconstructed within the experimental uncertainty in structure determination and ensembles of structures can be encoded with accuracy and robustness. Conclusions The density-based Structural Alphabet provides a novel tool to describe local conformations and it is specifically suitable for application in studies of protein dynamics.

A New Local Bipolar Autoassociative Memory Based on External Inputs of Discrete Recurrent Neural Networks With Time Delay.

Science.gov (United States)

Zhou, Caigen; Zeng, Xiaoqin; Luo, Chaomin; Zhang, Huaguang

In this paper, local bipolar auto-associative memories are presented based on discrete recurrent neural networks with a class of gain type activation function. The weight parameters of neural networks are acquired by a set of inequalities without the learning procedure. The global exponential stability criteria are established to ensure the accuracy of the restored patterns by considering time delays and external inputs. The proposed methodology is capable of effectively overcoming spurious memory patterns and achieving memory capacity. The effectiveness, robustness, and fault-tolerant capability are validated by simulated experiments.In this paper, local bipolar auto-associative memories are presented based on discrete recurrent neural networks with a class of gain type activation function. The weight parameters of neural networks are acquired by a set of inequalities without the learning procedure. The global exponential stability criteria are established to ensure the accuracy of the restored patterns by considering time delays and external inputs. The proposed methodology is capable of effectively overcoming spurious memory patterns and achieving memory capacity. The effectiveness, robustness, and fault-tolerant capability are validated by simulated experiments.

A Unified Approach to Adaptive Neural Control for Nonlinear Discrete-Time Systems With Nonlinear Dead-Zone Input.

Science.gov (United States)

Liu, Yan-Jun; Gao, Ying; Tong, Shaocheng; Chen, C L Philip

2016-01-01

In this paper, an effective adaptive control approach is constructed to stabilize a class of nonlinear discrete-time systems, which contain unknown functions, unknown dead-zone input, and unknown control direction. Different from linear dead zone, the dead zone, in this paper, is a kind of nonlinear dead zone. To overcome the noncausal problem, which leads to the control scheme infeasible, the systems can be transformed into a m -step-ahead predictor. Due to nonlinear dead-zone appearance, the transformed predictor still contains the nonaffine function. In addition, it is assumed that the gain function of dead-zone input and the control direction are unknown. These conditions bring about the difficulties and the complicacy in the controller design. Thus, the implicit function theorem is applied to deal with nonaffine dead-zone appearance, the problem caused by the unknown control direction can be resolved through applying the discrete Nussbaum gain, and the neural networks are used to approximate the unknown function. Based on the Lyapunov theory, all the signals of the resulting closed-loop system are proved to be semiglobal uniformly ultimately bounded. Moreover, the tracking error is proved to be regulated to a small neighborhood around zero. The feasibility of the proposed approach is demonstrated by a simulation example.

Developing Early Literacy Skills: A Meta-Analysis of Alphabet Learning and Instruction

OpenAIRE

Piasta, Shayne B.; Wagner, Richard K.

2010-01-01

Alphabet knowledge is a hallmark of early literacy and facilitating its development has become a primary objective of pre-school instruction and intervention. However, little agreement exists about how to promote the development of alphabet knowledge effectively. A meta-analysis of the effects of instruction on alphabet outcomes demonstrated that instructional impacts differed by type of alphabet outcome examined and content of instruction provided. School-based instruction yielded larger eff...

Universal Partial Words over Non-Binary Alphabets

OpenAIRE

Goeckner, Bennet; Groothuis, Corbin; Hettle, Cyrus; Kell, Brian; Kirkpatrick, Pamela; Kirsch, Rachel; Solava, Ryan

2016-01-01

Chen, Kitaev, M\\"{u}tze, and Sun recently introduced the notion of universal partial words, a generalization of universal words and de Bruijn sequences. Universal partial words allow for a wild-card character $\\diamond$, which is a placeholder for any letter in the alphabet. We settle and strengthen conjectures posed in the same paper where this notion was introduced. For non-binary alphabets, we show that universal partial words have periodic $\\diamond$ structure and are cyclic, and we give ...

Will the alphabet soup of design criteria affect discrete choice experiment results?

DEFF Research Database (Denmark)

Olsen, Søren Bøye; Meyerhoff, Jürgen

2017-01-01

Every discrete choice experiment needs one, but the impacts of a statistical design on the results are still not well understood. Comparative studies have found that efficient designs outperform especially orthogonal designs. What has been little studied is whether efficient designs come at a cos...

Reliability of the discrete choice experiment at the input and output level in patients with rheumatoid arthritis

DEFF Research Database (Denmark)

Skjoldborg, Ulla Slothuus; Lauridsen, Jørgen; Junker, Peter

2009-01-01

OBJECTIVES: To investigate the issue of conjoint reliability over time. METHODS: A discrete choice experiment was applied using scenarios that describe the effect of treating rheumatoid arthritis patients with TNF-alpha inhibitors, a novel class of highly effective, but expensive antirheumatic...... agents. Respondents participated in three face-to-face interviews over a period of 4 months. Reliability was measured both at the input level, where the consistency of matches made by respondents to the Discrete Choice Experiment (DCE) question between replications was determined, and at the output level...... and the final choice in survey 3. Output level: The confidence intervals for WTP figures in surveys 1 and 2 and 1 and 3 were overlapping, implying that the DCE was reliable at the output level over time. CONCLUSION: The proportion of consistent responses was higher than would be expected by chance. Conjoint...

Nurturing Phonemic Awareness and Alphabetic Knowledge in Pre-Kindergartners.

Science.gov (United States)

Steinhaus, Patricia L.

Reading research continues to identify phonemic awareness and knowledge of the alphabetic principle as key factors in the literacy acquisition process and to indicate that they greatly facilitate decoding efforts. While research indicates that phonemic awareness and alphabetic knowledge are necessary to literacy acquisition, many early childhood…

A multifractal formalism for countable alphabet subshifts

International Nuclear Information System (INIS)

Meson, Alejandro; Vericat, Fernando

2009-01-01

We study here the multifractal spectrum of local entropies for subshifts with an infinite alphabet. The description of this spectrum is obtained from the Legendre transform of a free energy map and Gibbs states associated with adequate potentials. The lack of compactness in the symbolic space necessitates modifications to the description for the compact case, i.e. for finite alphabet. In particular, the class of potentials must be restricted to a narrower one than that considered for the compact case

On the Capacity of the 2-User IM-DD Optical Broadcast Channel

KAUST Repository

Chaaban, Anas; Rezki, Zouheir; Alouini, Mohamed-Slim

2016-01-01

outer bound. This is interesting in practice since both OOK and TDMA have low complexity. At moderate SNR (typically [0; 8] dB), a discrete input distribution with a small alphabet size achieves a fairly good performance. © 2015 IEEE.

An Interactive Augmented Reality Implementation of Hijaiyah Alphabet for Children Education

Science.gov (United States)

Rahmat, R. F.; Akbar, F.; Syahputra, M. F.; Budiman, M. A.; Hizriadi, A.

2018-03-01

Hijaiyah alphabet is letters used in the Qur’an. An attractive and exciting learning process of Hijaiyah alphabet is necessary for the children. One of the alternatives to create attractive and interesting learning process of Hijaiyah alphabet is to develop it into a mobile application using augmented reality technology. Augmented reality is a technology that combines two-dimensional or three-dimensional virtual objects into actual three-dimensional circles and projects them in real time. The purpose of application aims to foster the children interest in learning Hijaiyah alphabet. This application is using Smartphone and marker as the medium. It was built using Unity and augmented reality library, namely Vuforia, then using Blender as the 3D object modeling software. The output generated from this research is the learning application of Hijaiyah letters using augmented reality. How to use it is as follows: first, place marker that has been registered and printed; second, the smartphone camera will track the marker. If the marker is invalid, the user should repeat the tracking process. If the marker is valid and identified, the marker will have projected the objects of Hijaiyah alphabet in three-dimensional form. Lastly, the user can learn and understand the shape and pronunciation of Hijaiyah alphabet by touching the virtual button on the marker

Discrete non-parametric kernel estimation for global sensitivity analysis

International Nuclear Information System (INIS)

Senga Kiessé, Tristan; Ventura, Anne

2016-01-01

This work investigates the discrete kernel approach for evaluating the contribution of the variance of discrete input variables to the variance of model output, via analysis of variance (ANOVA) decomposition. Until recently only the continuous kernel approach has been applied as a metamodeling approach within sensitivity analysis framework, for both discrete and continuous input variables. Now the discrete kernel estimation is known to be suitable for smoothing discrete functions. We present a discrete non-parametric kernel estimator of ANOVA decomposition of a given model. An estimator of sensitivity indices is also presented with its asymtotic convergence rate. Some simulations on a test function analysis and a real case study from agricultural have shown that the discrete kernel approach outperforms the continuous kernel one for evaluating the contribution of moderate or most influential discrete parameters to the model output. - Highlights: • We study a discrete kernel estimation for sensitivity analysis of a model. • A discrete kernel estimator of ANOVA decomposition of the model is presented. • Sensitivity indices are calculated for discrete input parameters. • An estimator of sensitivity indices is also presented with its convergence rate. • An application is realized for improving the reliability of environmental models.

On alphabetic presentations of Clifford algebras and their possible applications

NARCIS (Netherlands)

Toppan, F.; Verbeek, P.W.

2009-01-01

In this paper, we address the problem of constructing a class of representations of Clifford algebras that can be named “alphabetic (re)presentations.” The Clifford algebra generators are expressed as m-letter words written with a three-character or a four-character alphabet. We formulate the

Admission to selective schools, alphabetically

Czech Academy of Sciences Publication Activity Database

Jurajda, Štěpán; Münich, Daniel

2010-01-01

Roč. 29, č. 6 (2010), s. 1100-1109 ISSN 0272-7757 R&D Projects: GA MŠk LC542 Institutional research plan: CEZ:MSM0021620846 Keywords : admissions to school * alphabetical order * order effects Subject RIV: AH - Economics Impact factor: 1.066, year: 2010

Alphabetical order effects in school admissions

Czech Academy of Sciences Publication Activity Database

Jurajda, Štěpán; Münich, Daniel

2016-01-01

Roč. 31, č. 4 (2016), s. 483-498 ISSN 0267-1522 Institutional support: PRVOUK-P23 Keywords : admissions * alphabetical order * order effects Subject RIV: AH - Economics Impact factor: 1.033, year: 2016

Direct Closed-Form Design of Finite Alphabet Constant Envelope Waveforms for Planar Array Beampatterns

KAUST Repository

Bouchoucha, Taha

2015-05-01

Multiple Input Multiple Output (MIMO) radar systems has attracted lately a lot of attention thanks to its advantage over the classical phased array radar systems. We site among these advantages the improvement of parametric identifiability, achievement of higher spatial resolution and design of complex beampatterns. In colocated multiple-input multiple-output radar systems, it is usually desirable to steer transmitted power in the region-of-interest in order to increase the Signal to Noise Ratio (SNR) and reduce any undesired signal and thus improve the detection process. This problem is also known as transmit beampattern design. To achieve this goal, conventional methods optimize the waveform covariance matrix, R, for the desired beampattern, which is then used to generate the actual transmitted waveforms. Both steps require constrained optimization. Most of the existing methods use iterative algorithms to solve these problems, therefore their computational complexity is very high which makes them hard to use in practice especially for real time radar applications. In this paper, we provide a closed-form solution to design the covariance matrix for a given beampattern in the three dimensional space using planar arrays, which is then used to derive a novel closed-form algorithm to directly design the finite-alphabet constant-envelope waveforms. The proposed algorithm exploits the two-dimensional discrete Fourier transform which is implemented using fast Fourier transform algorithm. Consequently, the computational complexity of the proposed beampattern solution is very low allowing it to be used for large arrays to change the beampattern in real time. We also show that the number of required snapshots in each waveform depends on the beampattern and that it is less than the total number of transmit antennas. In addition, we show that the proposed waveform design method can be used with non symmetric beampatterns. The performance of our proposed algorithm compares

A non-linear discrete transform for pattern recognition of discrete chaotic systems

International Nuclear Information System (INIS)

Karanikas, C.; Proios, G.

2003-01-01

It is shown, by an invertible non-linear discrete transform that any finite sequence or any collection of strings of any length can be presented as a random walk on trees. These transforms create the mathematical background for coding any information, for exploring its local variability and diversity. With the underlying computational algorithms, with several examples and applications we propose that these transforms can be used for pattern recognition of immune type. In other words we propose a mathematical platform for detecting self and non-self strings of any alphabet, based on a negative selection algorithms, for scouting data's periodicity and self-similarity and for measuring the diversity of chaotic strings with fractal dimension methods. In particular we estimate successfully the entropy and the ratio of chaotic data with self similarity. Moreover we give some applications of a non-linear denoising filter

A non-linear discrete transform for pattern recognition of discrete chaotic systems

CERN Document Server

Karanikas, C

2003-01-01

It is shown, by an invertible non-linear discrete transform that any finite sequence or any collection of strings of any length can be presented as a random walk on trees. These transforms create the mathematical background for coding any information, for exploring its local variability and diversity. With the underlying computational algorithms, with several examples and applications we propose that these transforms can be used for pattern recognition of immune type. In other words we propose a mathematical platform for detecting self and non-self strings of any alphabet, based on a negative selection algorithms, for scouting data's periodicity and self-similarity and for measuring the diversity of chaotic strings with fractal dimension methods. In particular we estimate successfully the entropy and the ratio of chaotic data with self similarity. Moreover we give some applications of a non-linear denoising filter.

Reflections of Debates Upon Alphabet (Letter to Journal of Sebilürreşad

Directory of Open Access Journals (Sweden)

Mehmet Soğukömeroğulları

2014-12-01

Full Text Available In Otoman State which had used Arabic alphabet until a certain period the issue of writing in Latin alphabet was gained currency thanks to the students who had been to Europe and the embassadors who had come from Europe in 18th and 19th centuries. After Tanzimat (reforms in 1839 amendment of letters had been given point first and then it was abondoned and alphabet replacement attempts began. In later periods serious arguments among the ones in favour and against the transition to Latin alphabet occured. One of the media organs in which these arguments had been appeared was Sebilürreşad. In all these articles acceptance of Latin alphabet was refused and instead the amendment of current letters was required. Some of the articles were taken from the journals of that time and according to the broadcasting policy of the journal occupied a certain place even a little. When the journal had leaned to nationalism and Turanism in its first periods afteryears a critisism began in a distinct manner. The articles related to Latin alphabet belonged to the first periods of the journal. It was seen that especially Turks who had been forced to accept Latin alphabet by Russia in Turkish world were taken place in newspaper columns and it was emphasized that this situation would interrupt the unity within Turkish world. Relections of civilization, printery, economy, colonialism and nationalism in terms of alphabet were also taken place in the journal

Alphabetical co-authorship in the social sciences and humanities: evidence from a comprehensive local database

Energy Technology Data Exchange (ETDEWEB)

Guns, R

2016-07-01

We present an analysis of alphabetical co-authorship in the social sciences and humanities (SSH), based on data from the VABB-SHW, a comprehensive database of SSH research output in Flanders (2000-2013). Using an unbiased estimator of the share of intentional alphabetical co-authorship (IAC), we find that alphabetical co-authorship is more engrained in SSH than in science as a whole. Within the SSH, large differences exist between disciplines. The highest proportions of IAC are found for Literature, Economics & business, and History. Furthermore, alphabetical co-authorship varies with publication type: it occurs most often in books, is less common in articles in journals or in books, and is rare in proceedings papers. The use of alphabetical co-authorship appears to be slowly declining. (Author)

Alphabetical order effects in school admissions

Czech Academy of Sciences Publication Activity Database

Jurajda, Štěpán; Münich, Daniel

2016-01-01

Roč. 31, č. 4 (2016), s. 483-498 ISSN 0267-1522 R&D Projects: GA ČR(CZ) GBP402/12/G130 Institutional support: RVO:67985998 Keywords : admissions * alphabetical order * order effects Subject RIV: AH - Economics Impact factor: 1.033, year: 2016

Statistical learning from nonrecurrent experience with discrete input variables and recursive-error-minimization equations

Science.gov (United States)

Carter, Jeffrey R.; Simon, Wayne E.

1990-08-01

Neural networks are trained using Recursive Error Minimization (REM) equations to perform statistical classification. Using REM equations with continuous input variables reduces the required number of training experiences by factors of one to two orders of magnitude over standard back propagation. Replacing the continuous input variables with discrete binary representations reduces the number of connections by a factor proportional to the number of variables reducing the required number of experiences by another order of magnitude. Undesirable effects of using recurrent experience to train neural networks for statistical classification problems are demonstrated and nonrecurrent experience used to avoid these undesirable effects. 1. THE 1-41 PROBLEM The statistical classification problem which we address is is that of assigning points in ddimensional space to one of two classes. The first class has a covariance matrix of I (the identity matrix) the covariance matrix of the second class is 41. For this reason the problem is known as the 1-41 problem. Both classes have equal probability of occurrence and samples from both classes may appear anywhere throughout the ddimensional space. Most samples near the origin of the coordinate system will be from the first class while most samples away from the origin will be from the second class. Since the two classes completely overlap it is impossible to have a classifier with zero error. The minimum possible error is known as the Bayes error and

The Effect of Pinyin Input Experience on the Link Between Semantic and Phonology of Chinese Character in Digital Writing.

Science.gov (United States)

Chen, Jingjun; Luo, Rong; Liu, Huashan

2017-08-01

With the development of ICT, digital writing is becoming much more common in people's life. Differently from keyboarding alphabets directly to input English words, keyboarding Chinese character is always through typing phonetic alphabets and then identify the glyph provided by Pinyin input-method software while in this process which do not need users to produce orthography spelling, thus it is different from traditional written language production model based on handwriting process. Much of the research in this domain has found that using Pinyin input method is beneficial to Chinese characters recognition, but only a small part explored the effects of individual's Pinyin input experience on the Chinese characters production process. We ask whether using Pinyin input-method will strengthen the semantic-phonology linkage or semantic-orthography linkage in Chinese character mental lexicon. Through recording the RT and accuracy of participants completing semantic-syllable and semantic-glyph consistency judgments, the results found the accuracy of semantic-syllable consistency judgments in high Pinyin input experienced group was higher than that in low-experienced group, and RT was reversed. There were no significant differences on semantic-glyph consistency judgments between the two groups. We conclude that using Pinyin input method in Chinese digital writing can strengthen the semantic-phonology linkage while do not weakening the semantic-orthography linkage in mental lexicon at the same time, which means that Pinyin input method is beneficial to lexical processing involving Chinese cognition.

Characterization, scaling, and partial representation of diffuse and discrete input junctions to CA3 hippocampus.

Science.gov (United States)

Ascarrunz, F G; Kisley, M A; Flach, K A; Hamilton, R W; MacGregor, R J

1995-07-01

This paper applies a general mathematical system for characterizing and scaling functional connectivity and information flow across the diffuse (EC) and discrete (DG) input junctions to the CA3 hippocampus. Both gross connectivity and coordinated multiunit informational firing patterns are quantitatively characterized in terms of 32 defining parameters interrelated by 17 equations, and then scaled down according to rules for uniformly proportional scaling and for partial representation. The diffuse EC-CA3 junction is shown to be uniformly scalable with realistic representation of both essential spatiotemporal cooperativity and coordinated firing patterns down to populations of a few hundred neurons. Scaling of the discrete DG-CA3 junction can be effected with a two-step process, which necessarily deviates from uniform proportionality but nonetheless produces a valuable and readily interpretable reduced model, also utilizing a few hundred neurons in the receiving population. Partial representation produces a reduced model of only a portion of the full network where each model neuron corresponds directly to a biological neuron. The mathematical analysis illustrated here shows that although omissions and distortions are inescapable in such an application, satisfactorily complete and accurate models the size of pattern modules are possible. Finally, the mathematical characterization of these junctions generates a theory which sees the DG as a definer of the fine structure of embedded traces in the hippocampus and entire coordinated patterns of sequences of 14-cell links in CA3 as triggered by the firing of sequences of individual neurons in DG.

Quantifying input uncertainty in an assemble-to-order system simulation with correlated input variables of mixed types

NARCIS (Netherlands)

Akçay, A.E.; Biller, B.

2014-01-01

We consider an assemble-to-order production system where the product demands and the time since the last customer arrival are not independent. The simulation of this system requires a multivariate input model that generates random input vectors with correlated discrete and continuous components. In

Biography of louis braille and invention of the braille alphabet.

Science.gov (United States)

Jiménez, Javier; Olea, Jesús; Torres, Jesús; Alonso, Inmaculada; Harder, Dirk; Fischer, Konstanze

2009-01-01

Louis Braille (1809-1852) was born in France. At the age of three, he wounded his right eye with a cobbler's tool while playing in his father's workshop. No medical knowledge could save his eyesight at that time. Louis's left eye became inflamed, apparently due to subsequent sympathetic ophthalmia, and he eventually lost the sight in that eye. At the age of five, Louis Braille was completely blind. He is considered to be the inventor of a writing system by touch that bears his name, the Braille system. This revolutionary system has allowed blind people to access written culture, and it can therefore be considered a major advance in the quality of life for the blind. The immediate precursor of the invention of the Braille system was the alphabet created by Charles Barbier de la Serre (1767-1841) who created a language by touch designed for military and secret use. Louis Braille modified this alphabet into the Braille alphabet, which is practically the same one that is currently used. It required time to be recognized and to be implemented as a reading and writing method for blind people throughout the world. In 1950, UNESCO effectively universalized the Braille alphabet, and in 2005 it recognized Braille system as a "vital language of communication, as legitimate as all other languages in the world."

Amino acid alphabet reduction preserves fold information contained in contact interactions in proteins.

Science.gov (United States)

Solis, Armando D

2015-12-01

To reduce complexity, understand generalized rules of protein folding, and facilitate de novo protein design, the 20-letter amino acid alphabet is commonly reduced to a smaller alphabet by clustering amino acids based on some measure of similarity. In this work, we seek the optimal alphabet that preserves as much of the structural information found in long-range (contact) interactions among amino acids in natively-folded proteins. We employ the Information Maximization Device, based on information theory, to partition the amino acids into well-defined clusters. Numbering from 2 to 19 groups, these optimal clusters of amino acids, while generated automatically, embody well-known properties of amino acids such as hydrophobicity/polarity, charge, size, and aromaticity, and are demonstrated to maintain the discriminative power of long-range interactions with minimal loss of mutual information. Our measurements suggest that reduced alphabets (of less than 10) are able to capture virtually all of the information residing in native contacts and may be sufficient for fold recognition, as demonstrated by extensive threading tests. In an expansive survey of the literature, we observe that alphabets derived from various approaches-including those derived from physicochemical intuition, local structure considerations, and sequence alignments of remote homologs-fare consistently well in preserving contact interaction information, highlighting a convergence in the various factors thought to be relevant to the folding code. Moreover, we find that alphabets commonly used in experimental protein design are nearly optimal and are largely coherent with observations that have arisen in this work. © 2015 Wiley Periodicals, Inc.

African Journals Online: Browse Alphabetically -- letter T

African Journals Online (AJOL)

Items 1 - 19 of 19 ... African Journals Online: Browse Alphabetically -- letter T ... and economic aspects of management and conservation of tropical flora and fauna. ... Les principaux thèmes qui y sont abordés recouvrent les axes de recherche ...

Kichwa or Quichua? Competing Alphabets, Political Histories, and Complicated Reading in Indigenous Languages

Science.gov (United States)

Limerick, Nicholas

2018-01-01

Over the past century, missionary educators, nation-state and academic planners, and literacy development workers have used alphabets for political ends for traditionally marginalized languages, and Native peoples have contested such planning with other alphabet proposals. Yet literacy work now often overlooks that there are multiple alphabets…

Alphabetics: A History of Our Alphabet. A Source Guide for Self-Directed Units. Great Ideas Series. Revised Edition.

Science.gov (United States)

Patton, Sally J.

This teaching resource presents a historical perspective of the alphabet which encompasses a study of major contributions by: (1) "Prehistoric People"; (2) "The Sumerians"; (3) "The Egyptians"; (4) "The Chinese"; (5) "The Greeks"; and (6) "The Romans." Background information, vocabulary study, student activities, a letter history, and a…

Alphabetic Phonics: An organization and expansion of orton-gillingham.

Science.gov (United States)

Cox, A R

1985-01-01

Alphabetic Phonics is a sequential language curriculum designed to assure that all students can achieve literacy. This curriculum is a 1980's organization and extension of the Orton-Gillingham-Childs multisensory teaching of the structure of English. Alphabetic Phonics allows 95 percent of the auditory, visual, and kinesthetic learners in a regular classroom to master written English. The curriculum includes modern behavioral, psychological, and educational theories and practice. Developed initially as remediation for dyslexics, Alphabetic Phonics is succeeding both with small groups of severely blocked dyslexics and as prevention in regular classrooms in the primary grades. Administrators, classroom teachers, clinicians, remedial, and resource room specialists, as well as speech and language therapists representing small and large schools (public and private; remedial and accelerated) have traveled to Texas from forty states and six foreign countries during the past ten years to earn graduate credit in one or more of the four month-long Introductory Courses held each year. Teachers report that cultural minority students and those learning English as a second language benefit especially from reading instruction which emphasizes the foundations of English and time-on-task activities to effect mastery. Outreach programs and multimedia tools are being developed and implemented to broaden the programs availability to groups with varied needs.

The Effects of Orthographic Depth on Learning to Read Alphabetic, Syllabic, and Logographic Scripts

Science.gov (United States)

Ellis, Nick C.; Natsume, Miwa; Stavropoulou, Katerina; Hoxhallari, Lorenc; Van Daal, Victor H.P.; Polyzoe, Nicoletta; Tsipa, Maria-Louisa; Petalas, Michalis

2004-01-01

This study investigated the effects of orthographic depth on reading acquisition in alphabetic, syllabic, and logographic scripts. Children between 6 and 15 years old read aloud in transparent syllabic Japanese hiragana, alphabets of increasing orthographic depth (Albanian, Greek, English), and orthographically opaque Japanese kanji ideograms,…

Theoretical explanations for preschoolers' lowercase alphabet knowledge.

Science.gov (United States)

Pence Turnbull, Khara L; Bowles, Ryan P; Skibbe, Lori E; Justice, Laura M; Wiggins, Alice K

2010-12-01

Letter knowledge is a key aspect of children's language development, yet relatively little research has aimed to understand the nature of lowercase letter knowledge. We considered 4 hypotheses about children's lowercase letter knowledge simultaneously--uppercase familiarity, uppercase-lowercase similarity, own-name advantage, and frequency in printed English--as well as 3 interactions. Participants were 461 children ranging in age from 3 to 5 years, all of whom attended public preschool programs serving primarily children from low-income homes, who completed a letter naming task. Uppercase familiarity was the strongest predictor of children's lowercase alphabet knowledge; children were more than 16 times more likely to know a lowercase letter if they knew the corresponding uppercase letter. Uppercase-lowercase similarity and frequency in printed English also predicted children's lowercase letter knowledge, as did the interaction between uppercase familiarity and own-name advantage and the interaction between uppercase familiarity and uppercase-lowercase similarity. Findings suggest that transference from uppercase letter knowledge may be a primary mechanism for lowercase letter knowledge and that young children's knowledge of the lowercase alphabet letters is multiply determined.

Discrete symmetries: A broken look at QCD

International Nuclear Information System (INIS)

Goldman, T.

1996-01-01

The alphabet soup of discrete symmetries is briefly surveyed with a view towards those which can be tested at LISS and two particularly interesting cases are called out. A LISS experiment may be able to distinguish CP violation that is not due to the QCD θ term. The elements of a model of parity violation in proton-nucleon scattering, which is consistent with lower energy LAMPF and ANL results, are reviewed in the light of new information on diquarks and the proton spin fraction carried by quarks. The prediction that the parity violating total cross section asymmetry should be large at LISS energies is confirmed. The results of such an experiment can be used both to obtain new information about the diquark substructure of the nucleon and to provide bounds on new right-chiral weak interactions

Bi-alphabetic pulse compression radar signal design

Indian Academy of Sciences (India)

Bi-alphabetic radar; Hamming scan; back-tracking; merit factor; ... of 14.08, 12.10, 9.85, 8.85, 8.83, 8.86, 8.58 and 8.50 respectively. Beyond n ˆ 59 but below n ˆ 117, the highest merit factor available is 9.56. Known high merit ... subjected to dual ternary±binary interpretation to facilitate a coincidence detection scheme.

Mastering the International Phonetic Alphabet; Guide and Workbook.

Science.gov (United States)

Decker, Donald M.

The present volume, containing lessons with practice and review exercises, offers a systematic presentation of the symbols of the International Phonetic Alphabet (IPA) most widely used as a simplified means of representing the pronunciation of General American English. The transcription symbols presented are those primarily employed by Kenyon and…

Letter Frequency Analysis of Lithuanian and Other Languages Using the Latin Alphabet

Directory of Open Access Journals (Sweden)

Gintautas Grigas

2015-12-01

Full Text Available It is important to evaluate specificities of alphabets, particularly the letter frequencies while designing keyboards, analyzing texts, designing games based on alphabets, and doing some text mining. In order to adequately compare lettter frequences of Lithuanian language to other languages in the Internet space, Wikipedia source was selected which content is common to different languages. The method of letter frequency jumps is used. The main attention is paid to the analysis of letter frequencies at the boundary between native letters and foreign letters used in Lithuanian and other languages.

The Coral Reef Alphabet Book for American Samoa.

Science.gov (United States)

Madrigal, Larry G.

This book, produced for the American Samoa Department of Education Marine Enhancement Program, presents underwater color photography of coral reef life in an alphabetical resource. The specimens are described in English, and some are translated into the Samoan language. A picture-matching learning exercise and a glossary of scientific and oceanic…

The protection of the Cyrillic alphabet in telecommunications: Taxation aspects

Directory of Open Access Journals (Sweden)

Marilović Đorđe

2016-01-01

Full Text Available The use of Cyrillic and other specific alphabets is discouraged in some telecommunication services. In this paper; the author focuses on unequal treatment of the Cyrillic alphabet in telecommunications (in SMS messages, which is incompatible with the interests of a multilingual society to cherish its linguistic heritage and diversity. Referring to the Convention on the Protection and Promotion of the Diversity of Cultural Expression (2005, the author suggests introducing measures which would lead to removing the discriminatory pricing of Cyrillic SMS messages; and introducing tax measures which would support mobile network operators and prevent possible market inequalities stemming from introducing these measures. The suggested solution is applicable to any multicultural society facing the same problem; regardless of languages in question.

Real-time discrete suboptimal control for systems with input and state delays: Experimental tests on a dehydration process.

Science.gov (United States)

Rodríguez-Guerrero, Liliam; Santos-Sánchez, Omar-Jacobo; Cervantes-Escorcia, Nicolás; Romero, Hugo

2017-11-01

This article presents a suboptimal control strategy with finite horizon for affine nonlinear discrete systems with both state and input delays. The Dynamic Programming Approach is used to obtain the suboptimal control sequence, but in order to avoid the computation of the Bellman functional, a numerical approximation of this function is proposed in every step. The feasibility of our proposal is demonstrated via an experimental test on a dehydration process and the obtained results show a good performance and behavior of this process. Then in order to demonstrate the benefits of using this kind of control strategy, the results are compared with a non optimal control strategy, particularly with respect to results produced by an industrial Proportional Integral Derivative (PID) Honeywell controller, which is tuned using the Ziegler-Nichols method. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Dislocation motion in tungsten: Atomistic input to discrete dislocation simulations

Czech Academy of Sciences Publication Activity Database

Srivastava, K.; Gröger, Roman; Weygand, D.; Gumbsch, P.

2013-01-01

Roč. 47, AUG (2013), s. 126-142 ISSN 0749-6419 R&D Projects: GA ČR GAP204/10/0255; GA MŠk(CZ) ED1.1.00/02.0068 Institutional support: RVO:68081723 Keywords : body -centered cubic * non-Schmid effects * anomalous slip * discrete dislocation dynamics Subject RIV: BM - Solid Matter Physics ; Magnetism; BM - Solid Matter Physics ; Magnetism (UFM-A) Impact factor: 5.971, year: 2013

Automated input data management in manufacturing process simulation

OpenAIRE

Ettefaghian, Alireza

2015-01-01

Input Data Management (IDM) is a time consuming and costly process for Discrete Event Simulation (DES) projects. Input Data Management is considered as the basis of real-time process simulation (Bergmann, Stelzer and Strassburger, 2011). According to Bengtsson et al. (2009), data input phase constitutes on the average about 31% of the time of an entire simulation project. Moreover, the lack of interoperability between manufacturing applications and simulation software leads to a high cost to ...

Government Acronyms and Alphabetic Designations Used in DDC.

Science.gov (United States)

Defense Documentation Center, Alexandria, VA.

The compilation consists of a guide to acronyms and alphabetic designations used by the Department of Defense (DOD), federal government and foreign military organizations on documents to designate reports on research monitored by them and cataloged by the Defense Documentation Center (DDC). In all instances the acronyms are those actually used by…

On the Capacity of the 2-User IM-DD Optical Broadcast Channel

KAUST Repository

Chaaban, Anas

2016-02-26

The capacity of the intensity-modulation directdetection (IM-DD) optical broadcast channel (OBC) is investigated. The OBC is modeled as a Gaussian channel with input-independent noise and both average and peak input constraints. Outer and inner bounds on the capacity region are derived. The outer bounds are based on Bergmans\\' approach. The inner bounds are based on superposition coding with either truncated-Gaussian or discrete input distributions. By comparing the bounds, we observe that the truncated- Gaussian distribution is nearly optimal at high signal-to-noise ratio (SNR). At low SNR on the other hand, on-off keying (OOK) combined with time-division multiple-access (TDMA) is optimal; it achieves any point on the boundary of the developed outer bound. This is interesting in practice since both OOK and TDMA have low complexity. At moderate SNR (typically [0; 8] dB), a discrete input distribution with a small alphabet size achieves a fairly good performance. © 2015 IEEE.

Sur l’origine de l’écriture libyque. Quelques propositions On the origin of the Libyco-Berber alphabet: A few proposals

Directory of Open Access Journals (Sweden)

Dominique Casajus

2013-06-01

Full Text Available Le présent article propose quelques hypothèses sur l’origine des alphabets dits libyques. Attestés par plus d’un millier d’inscriptions recueillies dans toute l’Afrique du Nord, depuis la Libye jusqu’aux îles Canaries, ces alphabets sont selon toute vraisemblance les ancêtres des alphabets touaregs actuels. La seule inscription qui ait pu être datée avec un degré raisonnable de certitude est une bilingue libyco-punique, mise au jour sur le site de Dougga (Tunisie, qui daterait de 139 avant J.-C. Il semble que les alphabets libyques existaient déjà alors depuis plusieurs siècles. Leurs créateurs ont emprunté quelques lettres (au moins quatre aux alphabets phénico-puniques. Pour composer les autres lettres, ils semblent avoir eu recours à des procédés géométriques simples qu’on essaie ici de reconstituer.A few hypotheses about the origin of the so-called “Libyan” alphabets are presented. Attested in more than a thousand inscriptions from Libya to the Canary Islands in northern Africa, these alphabets are probably the forebears of the current ones used by the Tuareg. The only inscription that has been dated (139 BCE with a reasonable degree of certainty is bilingual, Libyco-Punic, from Dougga in Tunisia. The “Libyan” alphabets apparently already existed, several centuries earlier. Their creators borrowed a few — at least four — letters from the Phoenician/Punic alphabets; and apparently used simple geometric procedures, which are reconstituted herein, for the other letters.

COGEDIF - automatic TORT and DORT input generation from MORSE combinatorial geometry models

International Nuclear Information System (INIS)

Castelli, R.A.; Barnett, D.A.

1992-01-01

COGEDIF is an interactive utility which was developed to automate the preparation of two and three dimensional geometrical inputs for the ORNL-TORT and DORT discrete ordinates programs from complex three dimensional models described using the MORSE combinatorial geometry input description. The program creates either continuous or disjoint mesh input based upon the intersections of user defined meshing planes and the MORSE body definitions. The composition overlay of the combinatorial geometry is used to create the composition mapping of the discretized geometry based upon the composition found at the centroid of each of the mesh cells. This program simplifies the process of using discrete orthogonal mesh cells to represent non-orthogonal geometries in large models which require mesh sizes of the order of a million cells or more. The program was specifically written to take advantage of the new TORT disjoint mesh option which was developed at ORNL

Genesis, visual attributes and contemporary communication features of the alphabet

Directory of Open Access Journals (Sweden)

Filip Cvitić

2014-10-01

Full Text Available Throughout 5,000 years of human literacy, the alphabet system has developed from pictograms and ideograms to the contemporary system of Latin letters. The simplification of primary pictograms and their transformation to ideograms followed the major goal of written communication – to transmit thoughts and ideas. Besides, written communication has enabled preservation of knowledge, and that has generated the expansion of information and its availability today. The high speed of gathering written information, as well as its superabundance, calls for rethinking of semiotic features of Latin letters as the basic units of written communication in the Western world, especially in terms of marketing communication and its effectiveness. The written expression is the major tool of branding and getting closer to target market segments. Social development influences the development of communication, which is visible through numerous brands and signs, i.e. symbols that make products and companies recognizable in the market. The distinct sign forms of the alphabet are used to suggest the story of a brand, product or service. A constituent element of its comprehension is conscious or unconscious knowledge drawn from different sources in the environment. The history of human literacy, the development of each particular letter, the communication rules of the contemporary marketplace, the impact of brands and information superabundance make up the basis for further research into communication features of the alphabet, semantics of written forms and their redefinition in the context of effective marketing communication.

Modelling machine ensembles with discrete event dynamical system theory

Science.gov (United States)

Hunter, Dan

1990-01-01

Discrete Event Dynamical System (DEDS) theory can be utilized as a control strategy for future complex machine ensembles that will be required for in-space construction. The control strategy involves orchestrating a set of interactive submachines to perform a set of tasks for a given set of constraints such as minimum time, minimum energy, or maximum machine utilization. Machine ensembles can be hierarchically modeled as a global model that combines the operations of the individual submachines. These submachines are represented in the global model as local models. Local models, from the perspective of DEDS theory , are described by the following: a set of system and transition states, an event alphabet that portrays actions that takes a submachine from one state to another, an initial system state, a partial function that maps the current state and event alphabet to the next state, and the time required for the event to occur. Each submachine in the machine ensemble is presented by a unique local model. The global model combines the local models such that the local models can operate in parallel under the additional logistic and physical constraints due to submachine interactions. The global model is constructed from the states, events, event functions, and timing requirements of the local models. Supervisory control can be implemented in the global model by various methods such as task scheduling (open-loop control) or implementing a feedback DEDS controller (closed-loop control).

A hidden markov model derived structural alphabet for proteins.

Science.gov (United States)

Camproux, A C; Gautier, R; Tufféry, P

2004-06-04

Understanding and predicting protein structures depends on the complexity and the accuracy of the models used to represent them. We have set up a hidden Markov model that discretizes protein backbone conformation as series of overlapping fragments (states) of four residues length. This approach learns simultaneously the geometry of the states and their connections. We obtain, using a statistical criterion, an optimal systematic decomposition of the conformational variability of the protein peptidic chain in 27 states with strong connection logic. This result is stable over different protein sets. Our model fits well the previous knowledge related to protein architecture organisation and seems able to grab some subtle details of protein organisation, such as helix sub-level organisation schemes. Taking into account the dependence between the states results in a description of local protein structure of low complexity. On an average, the model makes use of only 8.3 states among 27 to describe each position of a protein structure. Although we use short fragments, the learning process on entire protein conformations captures the logic of the assembly on a larger scale. Using such a model, the structure of proteins can be reconstructed with an average accuracy close to 1.1A root-mean-square deviation and for a complexity of only 3. Finally, we also observe that sequence specificity increases with the number of states of the structural alphabet. Such models can constitute a very relevant approach to the analysis of protein architecture in particular for protein structure prediction.

Synchronization Control for a Class of Discrete-Time Dynamical Networks With Packet Dropouts: A Coding-Decoding-Based Approach.

Science.gov (United States)

Wang, Licheng; Wang, Zidong; Han, Qing-Long; Wei, Guoliang

2017-09-06

The synchronization control problem is investigated for a class of discrete-time dynamical networks with packet dropouts via a coding-decoding-based approach. The data is transmitted through digital communication channels and only the sequence of finite coded signals is sent to the controller. A series of mutually independent Bernoulli distributed random variables is utilized to model the packet dropout phenomenon occurring in the transmissions of coded signals. The purpose of the addressed synchronization control problem is to design a suitable coding-decoding procedure for each node, based on which an efficient decoder-based control protocol is developed to guarantee that the closed-loop network achieves the desired synchronization performance. By applying a modified uniform quantization approach and the Kronecker product technique, criteria for ensuring the detectability of the dynamical network are established by means of the size of the coding alphabet, the coding period and the probability information of packet dropouts. Subsequently, by resorting to the input-to-state stability theory, the desired controller parameter is obtained in terms of the solutions to a certain set of inequality constraints which can be solved effectively via available software packages. Finally, two simulation examples are provided to demonstrate the effectiveness of the obtained results.

Numerically Optimized Uniformly Most Powerful Alphabets for Hierarchical-Decode-and-Forward Two-Way Relaying

Directory of Open Access Journals (Sweden)

M. Hekrdla

2011-01-01

Full Text Available We address the issue of the parametric performance of the Hierarchical-Decode-and-Forward (HDF strategy in a wireless 2-way relay channel. Promising HDF, representing the concept of wireless network coding, performs well with a pre-coding strategy that requires Channel State Information (CSI on the transceiver side. Assuming a practical case when CSI is available only on the receiver side and the channel conditions do not allow adaptive strategies, the parametrization causes significant HDF performance degradation for some modulation alphabets. Alphabets that are robust to the parametrization (denoted Uniformly Most Powerful (UMP have already been proposed restricting on the class of non-linear multi-dimensional frequency modulations. In this work, we focus on the general design of unrestricted UMP alphabets. We formulate an optimization problem which is solved by standard non-linear convex constrained optimization algorithms, particularly by Nelder-Mead global optimization search, which is further refined by the local interior-pointsmethod.

A reduced amino acid alphabet for understanding and designing protein adaptation to mutation.

Science.gov (United States)

Etchebest, C; Benros, C; Bornot, A; Camproux, A-C; de Brevern, A G

2007-11-01

Protein sequence world is considerably larger than structure world. In consequence, numerous non-related sequences may adopt similar 3D folds and different kinds of amino acids may thus be found in similar 3D structures. By grouping together the 20 amino acids into a smaller number of representative residues with similar features, sequence world simplification may be achieved. This clustering hence defines a reduced amino acid alphabet (reduced AAA). Numerous works have shown that protein 3D structures are composed of a limited number of building blocks, defining a structural alphabet. We previously identified such an alphabet composed of 16 representative structural motifs (5-residues length) called Protein Blocks (PBs). This alphabet permits to translate the structure (3D) in sequence of PBs (1D). Based on these two concepts, reduced AAA and PBs, we analyzed the distributions of the different kinds of amino acids and their equivalences in the structural context. Different reduced sets were considered. Recurrent amino acid associations were found in all the local structures while other were specific of some local structures (PBs) (e.g Cysteine, Histidine, Threonine and Serine for the alpha-helix Ncap). Some similar associations are found in other reduced AAAs, e.g Ile with Val, or hydrophobic aromatic residues Trp with Phe and Tyr. We put into evidence interesting alternative associations. This highlights the dependence on the information considered (sequence or structure). This approach, equivalent to a substitution matrix, could be useful for designing protein sequence with different features (for instance adaptation to environment) while preserving mainly the 3D fold.

Decentralized control of discrete-time linear time invariant systems with input saturation

NARCIS (Netherlands)

Deliu, C.; Deliu, Ciprian; Malek, Babak; Roy, Sandip; Saberi, Ali; Stoorvogel, Antonie Arij

We study decentralized stabilization of discrete-time linear time invariant (LTI) systems subject to actuator saturation, using LTI controllers. The requirement of stabilization under both saturation constraints and decentralization impose obvious necessary conditions on the open-loop plant, namely

Decentralized control of discrete-time linear time invariant systems with input saturation

NARCIS (Netherlands)

Deliu, Ciprian; Deliu, C.; Malek, Babak; Roy, Sandip; Saberi, Ali; Stoorvogel, Antonie Arij

2009-01-01

We study decentralized stabilization of discrete time linear time invariant (LTI) systems subject to actuator saturation, using LTI controllers. The requirement of stabilization under both saturation constraints and decentralization impose obvious necessary conditions on the open-loop plant, namely

A Chemical Alphabet for Macromolecular Communications.

Science.gov (United States)

Giannoukos, Stamatios; McGuiness, Daniel Tunç; Marshall, Alan; Smith, Jeremy; Taylor, Stephen

2018-06-08

Molecular communications in macroscale environments is an emerging field of study driven by the intriguing prospect of sending coded information over olfactory networks. For the first time, this article reports two signal modulation techniques (on-off keying-OOK, and concentration shift keying-CSK) which have been used to encode and transmit digital information using odors over distances of 1-4 m. Molecular transmission of digital data was experimentally investigated for the letter "r" with a binary value of 01110010 (ASCII) for a gas stream network channel (up to 4 m) using mass spectrometry (MS) as the main detection-decoding system. The generation and modulation of the chemical signals was achieved using an automated odor emitter (OE) which is based on the controlled evaporation of a chemical analyte and its diffusion into a carrier gas stream. The chemical signals produced propagate within a confined channel to reach the demodulator-MS. Experiments were undertaken for a range of volatile organic compounds (VOCs) with different diffusion coefficient values in air at ambient conditions. Representative compounds investigated include acetone, cyclopentane, and n-hexane. For the first time, the binary code ASCII (American Standard Code for Information Interchange) is combined with chemical signaling to generate a molecular representation of the English alphabet. Transmission experiments of fixed-width molecular signals corresponding to letters of the alphabet over varying distances are shown. A binary message corresponding to the word "ion" was synthesized using chemical signals and transmitted within a physical channel over a distance of 2 m.

[The alphabet of nature and the alphabet of culture in the eighteenth century. botany, diplomatics, and ethno-linguistics according to Carl von Linné, Johann Christoph Gatterer, and Christian Wilhelm Büttner : Botany, Diplomatics, and ethno-linguistics according to Carl von Linné, Johann Christoph Gatterer, and Christian Wilhelm Büttner].

Science.gov (United States)

Gierl, Martin

2010-01-01

In the middle of the eighteenth century, Carl von Linné, Johann Christoph Gatterer, and Christian Wilhelm Büttner attempted to realize the old idea of deciphering the alphabet of the world, which Francis Bacon had raised as a general postulate of science. This article describes these attempts and their interrelations. Linné used the model of the alphabet to classify plants according to the characters of this fruiting body. Gatterer, one of the leading German historians during the Enlightenment, adopted the botanical method of classification by genus and species to classify the history of scripts. He used the forms of the alphabetic characters to measure the age of manuscripts and to map the process of history as a genealogy of culture. Gatterer collaborated closely with Büttner, the first Göttingen professor of natural history. Büttner constructed a general alphabet of languages which connected the phonetics of language with the historically known alphabets. Early on, diplomatics and ethnography combined the natural order of natural history and the cultural order of the alphabet with the attempt to register development and to document development by the evolution of forms. Based on the shared model of the alphabet and on the common necessity to classify their empirical material, natural history and the description of culture were related attempts in the middle of the eighteenth century to comprehend the alphabetically organized nature and a naturally ordered culture.

Discrete-Time Nonlinear Control of VSC-HVDC System

Directory of Open Access Journals (Sweden)

TianTian Qian

2015-01-01

Full Text Available Because VSC-HVDC is a kind of strong nonlinear, coupling, and multi-input multioutput (MIMO system, its control problem is always attracting much attention from scholars. And a lot of papers have done research on its control strategy in the continuous-time domain. But the control system is implemented through the computer discrete sampling in practical engineering. It is necessary to study the mathematical model and control algorithm in the discrete-time domain. The discrete mathematical model based on output feedback linearization and discrete sliding mode control algorithm is proposed in this paper. And to ensure the effectiveness of the control system in the quasi sliding mode state, the fast output sampling method is used in the output feedback. The results from simulation experiment in MATLAB/SIMULINK prove that the proposed discrete control algorithm can make the VSC-HVDC system have good static, dynamic, and robust characteristics in discrete-time domain.

Parents' Goals for and Perceptions of Alphabet Books

Science.gov (United States)

Nowak, Sarah N.; Evans, Mary Ann

2013-01-01

This study examined parents' goals for reading ABC books with their children and their perceptions of page features. Factor analysis of a questionnaire answered by 225 parents of junior and senior kindergarten students revealed four goals for reading alphabet books. In order of importance as rated by parents the goals were: Learning to Read,…

Federal Logistics Information System (FLIS) Procedures Manual. Volume 8. Document Identifier Code Input/Output Formats (Fixed Length)

Science.gov (United States)

1994-07-01

REQUIRED MIX OF SEGMENTS OR INDIVIDUAL DATA ELEMENTS TO BE EXTRACTED. IN SEGMENT R ON AN INTERROGATION TRANSACTION (LTI), DATA RECORD NUMBER (DRN 0950) ONLY...and zation and Marketing input DICs. insert the Continuation Indicator Code (DRN 8555) in position 80 of this record. Maximum of OF The assigned NSN...for Procurement KFR, File Data Minus Security Classified Characteristics Data KFC 8.5-2 DoD 4100.39-M Volume 8 CHAPTER 5 ALPHABETIC INDEX OF DIC

Is Chinese Special? Four Aspects of Chinese Literacy Acquisition That Might Distinguish Learning Chinese from Learning Alphabetic Orthographies

Science.gov (United States)

McBride, Catherine Alexandra

2016-01-01

Some aspects of Chinese literacy development do not conform to patterns of literacy development in alphabetic orthographies. Four are highlighted here. First, semantic radicals are one aspect of Chinese characters that have no analogy to alphabetic orthographies. Second, the unreliability of phonological cues in Chinese along with the fact that…

Decoding the Assessment Alphabet Soup

Science.gov (United States)

Engelhardt, Paula

2010-10-01

The number of assessment instruments that help physics instructors evaluate the conceptual learning of their students has grown over the last twenty years. Today, the number of tests that are available begin to look like an alphabet soup, FCI, MBT, TUG-K, CSE, CSM, CSEM, DIRECT, BEMA, LOCE, FMCE, SEMCO, etc. What can these assessment tests do for you that is different from what you regularly do? How do these tests differ from the tests and other assessments you already give in class? What is meant by formative and summative assessment and why should you care? What are some of the issues associated with giving one of these assessment tests? These are the questions that will be addressed in this talk.

Logic-Symbolic and Alphabetization

Directory of Open Access Journals (Sweden)

Dair Aily Franco de Camargo

2007-10-01

Full Text Available The present article tries to recoup the ideas and the proposal of H. Furth (1973, pointing it as another option to try to work with the children’s difficulties in the alphabetization process. The author considers the substitution of “schools of the language” for “schools of the thought”, that is, to substitute the option of the teacher in the reading-writing education, in its traditional form, of how to transform graphical signals into sonorous and vice-versa, for that one of the thought consolidation, feeding the intellect in development of the child by exercises of “symbolic logic”. For theoretical basing, we still present some aspects of the psychogenetic theory, as well as other works carried through more recently on the subject, that even so “transvestite” (disguised with new clothing, still find their beddings in the J. Piaget’s basis.

dNTPs :  the alphabet of life

OpenAIRE

Kumar, Dinesh

2010-01-01

From microscopic bacteria to the giant whale, every single living organism on Earth uses the same language of life: DNA. Deoxyribonucleoside triphosphates––dNTPs (dATP, dTTP, dGTP, and dCTP)––are the building blocks of DNA and are therefore the “alphabet of life”. A balanced supply of dNTPs is essential for integral DNA transactions such as faithful genome duplication and repair. The enzyme ribonucleotide reductase (RNR) not only synthesizes all four dNTPs but also primarily maintains the cru...

Discrete Hilbert transformation and its application to estimate the wind speed in Hong Kong

Energy Technology Data Exchange (ETDEWEB)

Zhu, Zuojin [Department of Thermal Science and Energy Engineering, Institute of Engineering Science, University of Science and Technology of China, Hefei, Anhui (China); Yang, Hongxing [Department of Building Services Engineering, The Hong Kong Polytechnic University, Hong Kong (Hong Kong)

2002-01-01

Discrete Hilbert Transform (DHT) has been applied to estimate the wind speed with the sample data sequence selected from the data record observed by the observatory in Hong Kong in June 1989, during which the data pertain to deep valleys and sharp crests due to manifold weather conditions in this region. To confirm the performance of the discrete Hilbert transformer, two harmonic input sequences were used to inspect the output signals, whether good agreement with the theoretical results is obtained. It was found that the energy spectrum and the outputs for the two different harmonic discrete waves are certainly correct. After the inspection of the DHT filter, the sample data for wind speed in Hong Kong were used for wind speed forecasting. For zero mean input sequence, the variance of the output is the same as that of the input signals, and so is the energy spectrum. The DHT of an individual input sample can really reflect the local variation performance, since it is the convolution with the reciprocal of time and the input data sequence, but there exists phase shift. For harmonic signals, the output signal holds a 90 phase delay.

Modes of Alphabet Letter Production during Middle Childhood and Adolescence: Interrelationships with Each Other and Other Writing Skills

Directory of Open Access Journals (Sweden)

Zachary Alstad

2015-02-01

Full Text Available Although handwriting is typically taught during early childhood and keyboarding may not be taught explicitly, both may be relevant to writing development in the later grades. Thus, Study 1 investigated automatic production of the ordered alphabet from memory for manuscript (unjoined, cursive (joined, keyboard letter modes (alphabet 15 sec, their relationships with each other, and spelling and composing in typically developing writers in grades 4 to 7 (n =113. Study 2 compared students with dysgraphia (impaired handwriting, n=27, dyslexia (impaired word spelling, n=40, or oral and written language learning disability (OWL LD (impaired syntax composing, n=11 or controls without specific writing disabilities (n=10 in grades 4 to 9 (n=88 on the same alphabet 15 modes, manner of copying, spelling, and sentence composing. In Study 1, sequential multilevel model regressions of predictor alphabet 15 letter production/selection modes on spelling and composition outcomes, measured annually from grade 4 to grade 7 (ages 9 to 13 years, showed that only the cursive mode uniquely, positively, and consistently predicted both spelling and composing in each grade. For composing, in grade 4 manuscript mode was positively predictive and in grades 5-7 keyboard selection was. In Study 2 all letter production modes correlated with each other and one’s best and fast sentence copying, spelling, and timed sentence composing. The groups with specific writing disabilities differed from control group on alphabet 15 manuscript mode, copy fast, and timed sentence composing. The dysgraphia and dyslexia groups differed on copying sentences in one’s best handwriting, with the dysgraphia group scoring lower. The educational and theoretical significance of the findings are discussed for multiple modes and manners of letter production/selection of the alphabet that support spelling and composing beyond the early grades in students with and without specific writing

Alphabetical: How Every Letter Tells a Story

OpenAIRE

Rosen, Michael

2013-01-01

From minding your Ps and Qs to wondering why X should mark the spot, Alphabetical is a book for everyone who loves words and language. Whether it's how letters are arranged on keyboards or Viking runes, textspeak or zip codes, this book will change the way you think about letters for ever. How on Earth did we fix upon our twenty-six letters, what do they really mean, and how did we come to write them down in the first place? Michael Rosen takes you on an unforgettable adventure through the hi...

Numeric Input Relations for Relational Learning with Applications to Community Structure Analysis

DEFF Research Database (Denmark)

Jiang, Jiuchuan; Jaeger, Manfred

2015-01-01

distribution is defined by the model from numerical input variables that are only used for conditioning the distribution of discrete response variables. We show how numerical input relations can very easily be used in the Relational Bayesian Network framework, and that existing inference and learning methods......Most work in the area of statistical relational learning (SRL) is focussed on discrete data, even though a few approaches for hybrid SRL models have been proposed that combine numerical and discrete variables. In this paper we distinguish numerical random variables for which a probability...... use the augmented RBN framework to define probabilistic models for multi-relational (social) networks in which the probability of a link between two nodes depends on numeric latent feature vectors associated with the nodes. A generic learning procedure can be used to obtain a maximum-likelihood fit...

An improved robust model predictive control for linear parameter-varying input-output models

NARCIS (Netherlands)

Abbas, H.S.; Hanema, J.; Tóth, R.; Mohammadpour, J.; Meskin, N.

2018-01-01

This paper describes a new robust model predictive control (MPC) scheme to control the discrete-time linear parameter-varying input-output models subject to input and output constraints. Closed-loop asymptotic stability is guaranteed by including a quadratic terminal cost and an ellipsoidal terminal

The Information Content of Discrete Functions and Their Application in Genetic Data Analysis.

Science.gov (United States)

Sakhanenko, Nikita A; Kunert-Graf, James; Galas, David J

2017-12-01

The complex of central problems in data analysis consists of three components: (1) detecting the dependence of variables using quantitative measures, (2) defining the significance of these dependence measures, and (3) inferring the functional relationships among dependent variables. We have argued previously that an information theory approach allows separation of the detection problem from the inference of functional form problem. We approach here the third component of inferring functional forms based on information encoded in the functions. We present here a direct method for classifying the functional forms of discrete functions of three variables represented in data sets. Discrete variables are frequently encountered in data analysis, both as the result of inherently categorical variables and from the binning of continuous numerical variables into discrete alphabets of values. The fundamental question of how much information is contained in a given function is answered for these discrete functions, and their surprisingly complex relationships are illustrated. The all-important effect of noise on the inference of function classes is found to be highly heterogeneous and reveals some unexpected patterns. We apply this classification approach to an important area of biological data analysis-that of inference of genetic interactions. Genetic analysis provides a rich source of real and complex biological data analysis problems, and our general methods provide an analytical basis and tools for characterizing genetic problems and for analyzing genetic data. We illustrate the functional description and the classes of a number of common genetic interaction modes and also show how different modes vary widely in their sensitivity to noise.

46 CFR Table I to Part 150 - Alphabetical List of Cargoes

Science.gov (United States)

2010-10-01

... cargo name), see Caustic potash solution 5 2 CPS Potassium oleate 34 POE Potassium salt of polyolefin... Sodium polyacrylate solution 43 2 Sodium salt of Ferric hydroxyethylethylenediaminetriacetic acid... 46 Shipping 5 2010-10-01 2010-10-01 false Alphabetical List of Cargoes I Table I to Part 150...

ALPHABET "Ante Portas": How English Text Invades Japanese Public Space

Science.gov (United States)

Backhaus, Peter

2007-01-01

This paper examines the prominence of written English on shop signs in Japan. Based on data from a larger empirical study into multilingual signs in Tokyo, the most common ways of using English and the roman alphabet on Japanese shops signs are identified. It is argued that the ambivalent nature of English loan words plays a key role in the ever…

Lyapunov equation for infinite-dimensional discrete bilinear systems

International Nuclear Information System (INIS)

Costa, O.L.V.; Kubrusly, C.S.

1991-03-01

Mean-square stability for discrete systems requires that uniform convergence is preserved between input and state correlation sequences. Such a convergence preserving property holds for an infinite-dimensional bilinear system if and only if the associate Lyapunov equation has a unique strictly positive solution. (author)

Random discrete Morse theory and a new library of triangulations

DEFF Research Database (Denmark)

Benedetti, Bruno; Lutz, Frank Hagen

2014-01-01

We introduce random discrete Morse theory as a computational scheme to measure the complexity of a triangulation. The idea is to try to quantify the frequency of discrete Morse matchings with few critical cells. Our measure will depend on the topology of the space, but also on how nicely the space...... is triangulated. The scheme we propose looks for optimal discrete Morse functions with an elementary random heuristic. Despite its naiveté, this approach turns out to be very successful even in the case of huge inputs. In our view, the existing libraries of examples in computational topology are “too easy......” for testing algorithms based on discrete Morse theory. We propose a new library containing more complicated (and thus more meaningful) test examples....

American Sign Language Alphabet Recognition Using a Neuromorphic Sensor and an Artificial Neural Network

Directory of Open Access Journals (Sweden)

Miguel Rivera-Acosta

2017-09-01

Full Text Available This paper reports the design and analysis of an American Sign Language (ASL alphabet translation system implemented in hardware using a Field-Programmable Gate Array. The system process consists of three stages, the first being the communication with the neuromorphic camera (also called Dynamic Vision Sensor, DVS sensor using the Universal Serial Bus protocol. The feature extraction of the events generated by the DVS is the second part of the process, consisting of a presentation of the digital image processing algorithms developed in software, which aim to reduce redundant information and prepare the data for the third stage. The last stage of the system process is the classification of the ASL alphabet, achieved with a single artificial neural network implemented in digital hardware for higher speed. The overall result is the development of a classification system using the ASL signs contour, fully implemented in a reconfigurable device. The experimental results consist of a comparative analysis of the recognition rate among the alphabet signs using the neuromorphic camera in order to prove the proper operation of the digital image processing algorithms. In the experiments performed with 720 samples of 24 signs, a recognition accuracy of 79.58% was obtained.

Beta oscillations define discrete perceptual cycles in the somatosensory domain.

Science.gov (United States)

Baumgarten, Thomas J; Schnitzler, Alfons; Lange, Joachim

2015-09-29

Whether seeing a movie, listening to a song, or feeling a breeze on the skin, we coherently experience these stimuli as continuous, seamless percepts. However, there are rare perceptual phenomena that argue against continuous perception but, instead, suggest discrete processing of sensory input. Empirical evidence supporting such a discrete mechanism, however, remains scarce and comes entirely from the visual domain. Here, we demonstrate compelling evidence for discrete perceptual sampling in the somatosensory domain. Using magnetoencephalography (MEG) and a tactile temporal discrimination task in humans, we find that oscillatory alpha- and low beta-band (8-20 Hz) cycles in primary somatosensory cortex represent neurophysiological correlates of discrete perceptual cycles. Our results agree with several theoretical concepts of discrete perceptual sampling and empirical evidence of perceptual cycles in the visual domain. Critically, these results show that discrete perceptual cycles are not domain-specific, and thus restricted to the visual domain, but extend to the somatosensory domain.

Teaching Beginning Braille Reading Using an Alphabet or Uncontracted Braille Approach

Science.gov (United States)

Day, Janice Neibaur; McDonnell, Andrea P.; O'Neill, Rob

2008-01-01

This study examined the effects of using a research based print reading program modified to accommodate beginning braille readers using an alphabet or uncontracted braille reading approach with five beginning braille readers. Four of the 5 participants displayed a clear increase in their ability to read high frequency words when they began using…

Discrete second order trajectory generator with nonlinear constraints

NARCIS (Netherlands)

Morselli, R.; Zanasi, R.; Stramigioli, Stefano

2005-01-01

A discrete second order trajectory generator for motion control systems is presented. The considered generator is a nonlinear system which receives as input a raw reference signal and provides as output a smooth reference signal satisfying nonlinear constraints on the output derivatives as UM-(x) ≤

Quantification of discreteness effects in cosmological N-body simulations: Initial conditions

International Nuclear Information System (INIS)

Joyce, M.; Marcos, B.

2007-01-01

The relation between the results of cosmological N-body simulations, and the continuum theoretical models they simulate, is currently not understood in a way which allows a quantification of N dependent effects. In this first of a series of papers on this issue, we consider the quantification of such effects in the initial conditions of such simulations. A general formalism developed in [A. Gabrielli, Phys. Rev. E 70, 066131 (2004).] allows us to write down an exact expression for the power spectrum of the point distributions generated by the standard algorithm for generating such initial conditions. Expanded perturbatively in the amplitude of the input (i.e. theoretical, continuum) power spectrum, we obtain at linear order the input power spectrum, plus two terms which arise from discreteness and contribute at large wave numbers. For cosmological type power spectra, one obtains as expected, the input spectrum for wave numbers k smaller than that characteristic of the discreteness. The comparison of real space correlation properties is more subtle because the discreteness corrections are not as strongly localized in real space. For cosmological type spectra the theoretical mass variance in spheres and two-point correlation function are well approximated above a finite distance. For typical initial amplitudes this distance is a few times the interparticle distance, but it diverges as this amplitude (or, equivalently, the initial redshift of the cosmological simulation) goes to zero, at fixed particle density. We discuss briefly the physical significance of these discreteness terms in the initial conditions, in particular, with respect to the definition of the continuum limit of N-body simulations

Cyrillic alphabet as the designation of national identity among students of University of Priština with temporary head office in Kosovska Mitrovica

Directory of Open Access Journals (Sweden)

Miketić Sanja D.

2016-01-01

Full Text Available The relationship between culture and nationality and in that sense - national identity of a particular community - is a known thing for a long time. Nationality is usually strongly connected to culture. We will only mention few of their joint characteristics: language, religion, art, customs, tradition etc. In this article special attention will be paid to one of the features of national identity - language - and we will focus on the usage of Cyrillic alphabet of our target group (students of University of Priština, with temporary head office in Kosovska Mitrovica. The study consists of two smaller researches. In the first part we explored reactions of students at University of Priština and we assumed that they will have different reactions towards Cyrillic alphabet and Latin alphabet used as stimuli-words comparing to pupils of Belgrade and Zrenjanin high schools and students of University of Belgrade, Novi Sad and Niš presented in The associative dictionary of Serbian language (Asocjativni rečnik srpskog jezika, 2005. In the second part we tried to find out if our informants prefer the usage of Cyrillic or Latin alphabet, and which one they find better in the esthetic sense. We compared attitudes of students who enroll University of Priština to attitudes of students who enroll University of Belgrade and differences between their attitudes. With both researches we wanted to see if there are formed verbal stereotypes with positive or negative connotation, and what are the attitudes on using Cyrillic alphabet among students in the age of expansion of Latin alphabet. We concluded that Cyrillic alphabet is more used and valued at University of Priština than in the rest of Republic of Serbia and the reason for that might be the stronger sense of national identity among these students.

Cluster consensus in discrete-time networks of multiagents with inter-cluster nonidentical inputs.

Science.gov (United States)

Han, Yujuan; Lu, Wenlian; Chen, Tianping

2013-04-01

In this paper, cluster consensus of multiagent systems is studied via inter-cluster nonidentical inputs. Here, we consider general graph topologies, which might be time-varying. The cluster consensus is defined by two aspects: intracluster synchronization, the state at which differences between each pair of agents in the same cluster converge to zero, and inter-cluster separation, the state at which agents in different clusters are separated. For intra-cluster synchronization, the concepts and theories of consensus, including the spanning trees, scramblingness, infinite stochastic matrix product, and Hajnal inequality, are extended. As a result, it is proved that if the graph has cluster spanning trees and all vertices self-linked, then the static linear system can realize intra-cluster synchronization. For the time-varying coupling cases, it is proved that if there exists T > 0 such that the union graph across any T-length time interval has cluster spanning trees and all graphs has all vertices self-linked, then the time-varying linear system can also realize intra-cluster synchronization. Under the assumption of common inter-cluster influence, a sort of inter-cluster nonidentical inputs are utilized to realize inter-cluster separation, such that each agent in the same cluster receives the same inputs and agents in different clusters have different inputs. In addition, the boundedness of the infinite sum of the inputs can guarantee the boundedness of the trajectory. As an application, we employ a modified non-Bayesian social learning model to illustrate the effectiveness of our results.

High-Rate Field Demonstration of Large-Alphabet Quantum Key Distribution

Science.gov (United States)

2016-10-12

count rate of Bob’s detectors. In this detector-limited regime , it is advantageous to increase M to encode as much information as possible in each...High- rate field demonstration of large-alphabet quantum key distribution Catherine Lee,1, 2 Darius Bunandar,1 Zheshen Zhang,1 Gregory R. Steinbrecher...October 12, 2016) 2 Quantum key distribution (QKD) enables secure symmetric key exchange for information-theoretically secure com- munication via one-time

Design and Implementation of Kana-Input Navigation System for Kids based on the Cyber Assistant

Directory of Open Access Journals (Sweden)

Hiroshi Matsuda

2004-02-01

Full Text Available In Japan, it has increased the opportunity for young children to experience the personal computer in elementary schools. However, in order to use computer, many domestic barriers have confronted young children (Kids because they cannot read difficult Kanji characters and had not learnt Roman alphabet yet. As a result, they cannot input text strings by JIS Kana keyboard. In this research, we developed Kana-Input NaVigation System for kids (KINVS based on the Cyber Assistant System (CAS. CAS is a Human-Style Software Robot based on the 3D-CG real-time animation and voice synthesis technology. KINVS enables to input Hiragana/Katakana characters by mouse operation only (without keyboard operation and CAS supports them by using speaking, facial expression, body action and sound effects. KINVS displays the 3D-Stage like a classroom. In this room, Blackboard, Interactive parts to input Kana-characters, and CAS are placed. As some results of preliminary experiments, it is definitely unfit for Kids to double-click objects quickly or to move the Scrollbar by mouse dragging. So, mouse input method of KINVS are designed to use only single click and wheeler rotation. To input characters, Kids clicks or rotates the Interactive Parts. KINVS reports all information by voice speaking and Kana subtitles instead of Kanji text. Furthermore, to verify the functional feature of KINVS, we measured how long Kids had taken to input long text by using KINVS.

On the busy period of discretized GI/GI/infinity queue

International Nuclear Information System (INIS)

Dvurecenskij, A.; Ososkov, G.A.

1982-01-01

The problem of determining the distribution of the busy period, i. e., of the time when at least one customer is served, of the discretized queueing system with infinitely many servers is investigated. Moreover, the idle period and the cycle of a queue are studied. The recurrent formulae are determined and in particular case of a queue with the geometric input the simpler recurrent formulae are given. Those problems arise in the discrete blob length determination in track chambers in high energy physics

Invariant set computation for constrained uncertain discrete-time systems

NARCIS (Netherlands)

Athanasopoulos, N.; Bitsoris, G.

2010-01-01

In this article a novel approach to the determination of polytopic invariant sets for constrained discrete-time linear uncertain systems is presented. First, the problem of stabilizing a prespecified initial condition set in the presence of input and state constraints is addressed. Second, the

Distributed Optimal Consensus Control for Multiagent Systems With Input Delay.

Science.gov (United States)

Zhang, Huaipin; Yue, Dong; Zhao, Wei; Hu, Songlin; Dou, Chunxia; Huaipin Zhang; Dong Yue; Wei Zhao; Songlin Hu; Chunxia Dou; Hu, Songlin; Zhang, Huaipin; Dou, Chunxia; Yue, Dong; Zhao, Wei

2018-06-01

This paper addresses the problem of distributed optimal consensus control for a continuous-time heterogeneous linear multiagent system subject to time varying input delays. First, by discretization and model transformation, the continuous-time input-delayed system is converted into a discrete-time delay-free system. Two delicate performance index functions are defined for these two systems. It is shown that the performance index functions are equivalent and the optimal consensus control problem of the input-delayed system can be cast into that of the delay-free system. Second, by virtue of the Hamilton-Jacobi-Bellman (HJB) equations, an optimal control policy for each agent is designed based on the delay-free system and a novel value iteration algorithm is proposed to learn the solutions to the HJB equations online. The proposed adaptive dynamic programming algorithm is implemented on the basis of a critic-action neural network (NN) structure. Third, it is proved that local consensus errors of the two systems and weight estimation errors of the critic-action NNs are uniformly ultimately bounded while the approximated control policies converge to their target values. Finally, two simulation examples are presented to illustrate the effectiveness of the developed method.

Perceptual Confusions of the Manual Alphabet by Naive, Trained, and Familiar Users.

Science.gov (United States)

Hawes, M. Dixie; Danhauer, Jeffrey L.

1980-01-01

An investigation of the confusion resulting from reliance on visual perceptual teachers in the identification of dactylemes (handshapes) in the American Manual Alphabet (MA) is reported. A hierarchy of errors varying with subjects' degree of expertness in the MA is established. This can help manual communication teachers develop techniques for…

The Effects of Shona Language Change on Monolingual Lexicography: The Need for a Revised Alphabet

Directory of Open Access Journals (Sweden)

William Zivenge

2011-10-01

Full Text Available

ABSTRACT: In this article, the phenomenon of Shona language change, its effects on lexicography and the need for a revised alphabet are discussed. Because of the defective Shona alphabet, lexicographers at the African Languages Research Institute (ALRI encountered problems in handling some words that were potential headwords in dictionaries they were compiling under the ALLEX project. The current Shona alphabet is unable to realize quite a number of sounds and morphemes in lexical items in everyday use by the native Shona speakers, because they are alien loanwords. The article was prompted by the challenges encountered during the compilation of Duramazwi reMimhanzi (Shona Musical Terms Dictionary. It shows how language change accounts for the problem of headword selection and how modifying the current alphabet can enhance monolingual Shona lexicographical work vis-à-vis the development of the Shona language. It therefore stresses the need for a revised alphabet so as to solve orthographical problems during dictionary compilation.

PFUPISO YECHINYORWA: Matambudziko Anosanganwa Nawo Mukugadzira Maduramazwi eMutauro Mumwe chete neKuda Kwekushanduka Kwemutauro weChiShona: Panofanirwa Kuva neManyorerwo eChiShona Matsva. Muchinyorwa chino vanyori vanoongorora kushanduka kuri kuita mutauro weChiShona nekufamba kuri kuita nguva nematambudziko anosanganikwa nawo nekuda kweshanduko iyi zvikurusei mukugadzira maduramazwi ari mururimi rweChiShona chete. Vanyori vanoonesawo pfungwa yekuti panodiwa manyorerwo matsva. Nyanzvi dzinogadzira maduramazwi paAfrican Languages Research Institute (ALRI dzinosangana namadambudziko esarudzo yamazwi padzinenge dzichisarudza mazwi adzinenge dzichida kuisa mumaduramazwi adzinogadzira pachirongwa chokugadzira maduramazwi chinonzi ALLEX. Dambudziko resarudzo yemazwi rinowanikwa nekuda kwechimiro chebumbiro remanyorerwo eChiShona risingatenderi mamwe mavara ari mune imwe mitauro asiri muChiShona. Bumbiro iri

Discrete-time control system design with applications

CERN Document Server

Rabbath, C A

2014-01-01

This book presents practical techniques of discrete-time control system design. In general, the design techniques lead to low-order dynamic compensators that ensure satisfactory closed-loop performance for a wide range of sampling rates. The theory is given in the form of theorems, lemmas, and propositions. The design of the control systems is presented as step-by-step procedures and algorithms. The proposed feedback control schemes are applied to well-known dynamic system models. This book also discusses: Closed-loop performance of generic models of mobile robot and airborne pursuer dynamic systems under discrete-time feedback control with limited computing capabilities Concepts of discrete-time models and sampled-data models of continuous-time systems, for both single- and dual-rate operation Local versus global digital redesign Optimal, closed-loop digital redesign methods Plant input mapping design Generalized holds and samplers for use in feedback control loops, Numerical simulation of fixed-point arithm...

Exploring the evolution of standard amino-acid alphabet: When genomics meets thermodynamics

International Nuclear Information System (INIS)

Zhang, Hong-Yu

2007-01-01

One of the most intriguing aspects of life is that despite the diversified apparent shapes, similar building blocks and infrastructures, such as standard amino acids and canonical genetic codes, are shared by most life on Earth. Thus, it is challenging to explore: why nature just selects these building blocks and strategies from numerous candidates to construct life? Was this deterministic or fortuitous? Thanks to the rapid progress in genomics, bioinformatics and synthetic biology, more and more basic principles underlying life design and construction were disclosed in the past decade. However, since the origin of early life is substantially a chemical process, to understand the enigma of life origin, chemists' efforts can not be neglected. In this paper, we focus on the evolution of standard amino-acid alphabet and indicate that chemistry, especially thermodynamics, is indeed critical to understanding the forming mechanisms of amino-acid alphabet. It is revealed that nature prefers low free energy and thus ubiquitous (cheap) small amino acids when beginning to build life, which is compatible with many recent findings from genomics and bioinformatics

Hybrid discrete-time neural networks.

Science.gov (United States)

Cao, Hongjun; Ibarz, Borja

2010-11-13

Hybrid dynamical systems combine evolution equations with state transitions. When the evolution equations are discrete-time (also called map-based), the result is a hybrid discrete-time system. A class of biological neural network models that has recently received some attention falls within this category: map-based neuron models connected by means of fast threshold modulation (FTM). FTM is a connection scheme that aims to mimic the switching dynamics of a neuron subject to synaptic inputs. The dynamic equations of the neuron adopt different forms according to the state (either firing or not firing) and type (excitatory or inhibitory) of their presynaptic neighbours. Therefore, the mathematical model of one such network is a combination of discrete-time evolution equations with transitions between states, constituting a hybrid discrete-time (map-based) neural network. In this paper, we review previous work within the context of these models, exemplifying useful techniques to analyse them. Typical map-based neuron models are low-dimensional and amenable to phase-plane analysis. In bursting models, fast-slow decomposition can be used to reduce dimensionality further, so that the dynamics of a pair of connected neurons can be easily understood. We also discuss a model that includes electrical synapses in addition to chemical synapses with FTM. Furthermore, we describe how master stability functions can predict the stability of synchronized states in these networks. The main results are extended to larger map-based neural networks.

Identification of continuous-time systems from samples of input ...

Indian Academy of Sciences (India)

Abstract. This paper presents an introductory survey of the methods that have been developed for identification of continuous-time systems from samples of input±output data. The two basic approaches may be described as (i) the indirect method, where first a discrete-time model is estimated from the sampled data and then ...

Discrete gradients in discrete classical mechanics

International Nuclear Information System (INIS)

Renna, L.

1987-01-01

A simple model of discrete classical mechanics is given where, starting from the continuous Hamilton equations, discrete equations of motion are established together with a proper discrete gradient definition. The conservation laws of the total discrete momentum, angular momentum, and energy are demonstrated

Self-Structured Organizing Single-Input CMAC Control for Robot Manipulator

Directory of Open Access Journals (Sweden)

ThanhQuyen Ngo

2011-09-01

Full Text Available This paper represents a self-structured organizing single-input control system based on differentiable cerebellar model articulation controller (CMAC for an n-link robot manipulator to achieve the high-precision position tracking. In the proposed scheme, the single-input CMAC controller is solely used to control the plant, so the input space dimension of CMAC can be simplified and no conventional controller is needed. The structure of single-input CMAC will also be self-organized; that is, the layers of single-input CMAC will grow or prune systematically and their receptive functions can be automatically adjusted. The online tuning laws of single-input CMAC parameters are derived in gradient-descent learning method and the discrete-type Lyapunov function is applied to determine the learning rates of proposed control system so that the stability of the system can be guaranteed. The simulation results of robot manipulator are provided to verify the effectiveness of the proposed control methodology.

Input-Admittance Passivity Compliance for Grid-Connected Converters with LCL Filter

DEFF Research Database (Denmark)

Diaz, Enrique Rodriguez; Freijedo, Francisco D.; Guerrero, Josep M.

2018-01-01

This work presents a design methodology and its experimental validation for the input-admittance passivity compliance of LCL grid-connected converters. The designs of the LCL filter parameters and discrete controller are addressed systematically, and suitable design guidelines are provided......-admittance passivity compliance....

A Glove for Tapping and Discrete 1D/2D Input

Science.gov (United States)

Miller, Sam A.; Smith, Andy; Bahram, Sina; SaintAmant, Robert

2012-01-01

This paper describes a glove with which users enter input by tapping fingertips with the thumb or by rubbing the thumb over the palmar surfaces of the middle and index fingers. The glove has been informally tested as the controller for two semi-autonomous robots in a a 3D simulation environment. A preliminary evaluation of the glove s performance is presented.

Effective Teaching Strategies: Case Studies from the Alphabetic Braille and Contracted Braille Study

Science.gov (United States)

Barclay, Lizbeth; Herlich, Stephanie A.; Sacks, Sharon Zell

2010-01-01

This article discusses some of the qualitative data that were documented during the Alphabetic Braille and Contracted Braille Study. Two case studies of students are described, highlighting many effective teaching strategies used by their teachers of students with visual impairments that resulted in the students' successful academic progress.…

Regional-scale input of dispersed and discrete volcanic ash to the Izu-Bonin and Mariana subduction zones

Science.gov (United States)

Scudder, Rachel P.; Murray, Richard W.; Schindlbeck, Julie C.; Kutterolf, Steffen; Hauff, Folkmar; McKinley, Claire C.

2014-11-01

We have geochemically and statistically characterized bulk marine sediment and ash layers at Ocean Drilling Program Site 1149 (Izu-Bonin Arc) and Deep Sea Drilling Project Site 52 (Mariana Arc), and have quantified that multiple dispersed ash sources collectively comprise ˜30-35% of the hemipelagic sediment mass entering the Izu-Bonin-Mariana subduction system. Multivariate statistical analyses indicate that the bulk sediment at Site 1149 is a mixture of Chinese Loess, a second compositionally distinct eolian source, a dispersed mafic ash, and a dispersed felsic ash. We interpret the source of these ashes as, respectively, being basalt from the Izu-Bonin Front Arc (IBFA) and rhyolite from the Honshu Arc. Sr-, Nd-, and Pb isotopic analyses of the bulk sediment are consistent with the chemical/statistical-based interpretations. Comparison of the mass accumulation rate of the dispersed ash component to discrete ash layer parameters (thickness, sedimentation rate, and number of layers) suggests that eruption frequency, rather than eruption size, drives the dispersed ash record. At Site 52, the geochemistry and statistical modeling indicates that Chinese Loess, IBFA, dispersed BNN (boninite from Izu-Bonin), and a dispersed felsic ash of unknown origin are the sources. At Site 1149, the ash layers and the dispersed ash are compositionally coupled, whereas at Site 52 they are decoupled in that there are no boninite layers, yet boninite is dispersed within the sediment. Changes in the volcanic and eolian inputs through time indicate strong arc-related and climate-related controls.

Uniform stability for time-varying infinite-dimensional discrete linear systems

International Nuclear Information System (INIS)

Kubrusly, C.S.

1988-09-01

Stability for time-varying discrete linear systems in a Banach space is investigated. On the one hand, it established a fairly complete collection of necessary and sufficient conditions for uniform asymptotic equistability for input-free systems. This includes uniform and strong power equistability, and uniform and strong l p -equistability, among other technical conditions which also play essential role in stability theory. On other hand, it is shown that uniform asymptotic equistability for input-free systems is equivalent to each of the following concepts of uniform stability for forced systems: l p -input l p -state, c o -input c o -state, bounded-input bounded-state, l p>1 -input bounded-state, c sub (o)-input bounded-state, and convergent-input bounded-state; which are also equivalent to their nonuniform counterparts. For time-varying convergent systems, the above is also equivalent to convergent-input convergent-state stability. The proofs presented here are all ''elementary'' in the sense that they are based essentially only on the Banach-Steinhaus theorem. (autor) [pt

Characterization of memory states of the Preisach operator with stochastic inputs

International Nuclear Information System (INIS)

Amann, A.; Brokate, M.; McCarthy, S.; Rachinskii, D.; Temnov, G.

2012-01-01

The Preisach operator with inputs defined by a Markov process x t is considered. The question we address is: what is the distribution of the random memory state of the Preisach operator at a given time moment t 0 in the limit r→∞ of infinitely long input history x t , t 0 -r≤t≤t 0 ? In order to answer this question, we introduce a Markov chain (called the memory state Markov chain) where the states are pairs (m k ,M k ) of elements from the monotone sequences of the local minimum input values m k and the local maximum input values M k recorded in the memory state and the index k of the elements plays the role of time. We express the transition probabilities of this Markov chain in terms of the transition probabilities of the input stochastic process and show that the memory state Markov chain and the input process generate the same distribution of the memory states. These results are illustrated by several examples of stochastic inputs such as the Wiener and Bernoulli processes and their mixture (we first discuss a discrete version of these processes and then the continuous time and state setting). The memory state Markov chain is then used to find the distribution of the random number of elements in the memory state sequence. We show that this number has the Poisson distribution for the Wiener and Bernoulli processes inputs. In particular, in the discrete setting, the mean value of the number of elements in the memory state scales as lnN, where N is the number of the input states, while the mean time it takes the input to generate this memory state scales as N 2 for the Wiener process and as N for the Bernoulli process. A similar relationship between the dimension of the memory state vector and the number of iterations in the numerical realization of the input is shown for the mixture of the Wiener and Bernoulli processes, thus confirming that the memory state Markov chain is an efficient tool for generating the distribution of the Preisach operator memory

Characterization of memory states of the Preisach operator with stochastic inputs

Energy Technology Data Exchange (ETDEWEB)

Amann, A. [Department of Applied Mathematics, University College Cork (Ireland); Brokate, M. [Zentrum Mathematik, Technische Universitaet Muenchen (Germany); McCarthy, S. [Department of Applied Mathematics, University College Cork (Ireland); Rachinskii, D., E-mail: d.rachinskii@ucc.ie [Department of Applied Mathematics, University College Cork (Ireland); Temnov, G. [Department of Mathematics, University College Cork (Ireland)

2012-05-01

The Preisach operator with inputs defined by a Markov process x{sup t} is considered. The question we address is: what is the distribution of the random memory state of the Preisach operator at a given time moment t{sub 0} in the limit r{yields}{infinity} of infinitely long input history x{sup t}, t{sub 0}-r{<=}t{<=}t{sub 0}? In order to answer this question, we introduce a Markov chain (called the memory state Markov chain) where the states are pairs (m{sub k},M{sub k}) of elements from the monotone sequences of the local minimum input values m{sub k} and the local maximum input values M{sub k} recorded in the memory state and the index k of the elements plays the role of time. We express the transition probabilities of this Markov chain in terms of the transition probabilities of the input stochastic process and show that the memory state Markov chain and the input process generate the same distribution of the memory states. These results are illustrated by several examples of stochastic inputs such as the Wiener and Bernoulli processes and their mixture (we first discuss a discrete version of these processes and then the continuous time and state setting). The memory state Markov chain is then used to find the distribution of the random number of elements in the memory state sequence. We show that this number has the Poisson distribution for the Wiener and Bernoulli processes inputs. In particular, in the discrete setting, the mean value of the number of elements in the memory state scales as lnN, where N is the number of the input states, while the mean time it takes the input to generate this memory state scales as N{sup 2} for the Wiener process and as N for the Bernoulli process. A similar relationship between the dimension of the memory state vector and the number of iterations in the numerical realization of the input is shown for the mixture of the Wiener and Bernoulli processes, thus confirming that the memory state Markov chain is an efficient tool for

Impact of multi-resolution analysis of artificial intelligence models inputs on multi-step ahead river flow forecasting

Science.gov (United States)

Badrzadeh, Honey; Sarukkalige, Ranjan; Jayawardena, A. W.

2013-12-01

Discrete wavelet transform was applied to decomposed ANN and ANFIS inputs.Novel approach of WNF with subtractive clustering applied for flow forecasting.Forecasting was performed in 1-5 step ahead, using multi-variate inputs.Forecasting accuracy of peak values and longer lead-time significantly improved.

User's guide to input for WRAP: a water reactor analysis package

International Nuclear Information System (INIS)

Gregory, M.V.

1977-06-01

The document describes the input records required to execute the Water Reactor Analysis Package (WRAP) for the analysis of thermal-hydraulic transients in primarily light water reactors. The card input required by RELAP4 has been significantly modified to broaden the code's input processing capabilities: (1) All input is in the form of templated, named records. (2) All components (volumes, junctions, etc.) are named rather than numbered, and system relationships are formed by defining associations between the names. (3) A hierarchical part structure is used which allows collections of components to be described as discrete parts (these parts may then be catalogued for use in a wide range of cases). A sample problem, the small break analysis of the Westinghouse Trojan Plant, is discussed and detailed, step-by-step instructions in setting up an input data base are presented. A master list of all input templates for WRAP is compiled

Discrete mKdV and discrete sine-Gordon flows on discrete space curves

International Nuclear Information System (INIS)

Inoguchi, Jun-ichi; Kajiwara, Kenji; Matsuura, Nozomu; Ohta, Yasuhiro

2014-01-01

In this paper, we consider the discrete deformation of the discrete space curves with constant torsion described by the discrete mKdV or the discrete sine-Gordon equations, and show that it is formulated as the torsion-preserving equidistant deformation on the osculating plane which satisfies the isoperimetric condition. The curve is reconstructed from the deformation data by using the Sym–Tafel formula. The isoperimetric equidistant deformation of the space curves does not preserve the torsion in general. However, it is possible to construct the torsion-preserving deformation by tuning the deformation parameters. Further, it is also possible to make an arbitrary choice of the deformation described by the discrete mKdV equation or by the discrete sine-Gordon equation at each step. We finally show that the discrete deformation of discrete space curves yields the discrete K-surfaces. (paper)

A representation theorem for linear discrete-space systems

Directory of Open Access Journals (Sweden)

Sandberg Irwin W.

1998-01-01

Full Text Available The cornerstone of the theory of discrete-time single-input single-output linear systems is the idea that every such system has an input–output map H that can be represented by a convolution or the familiar generalization of a convolution. This thinking involves an oversight which is corrected in this note by adding an additional term to the representation.

Discrete Curvatures and Discrete Minimal Surfaces

KAUST Repository

Sun, Xiang

2012-06-01

This thesis presents an overview of some approaches to compute Gaussian and mean curvature on discrete surfaces and discusses discrete minimal surfaces. The variety of applications of differential geometry in visualization and shape design leads to great interest in studying discrete surfaces. With the rich smooth surface theory in hand, one would hope that this elegant theory can still be applied to the discrete counter part. Such a generalization, however, is not always successful. While discrete surfaces have the advantage of being finite dimensional, thus easier to treat, their geometric properties such as curvatures are not well defined in the classical sense. Furthermore, the powerful calculus tool can hardly be applied. The methods in this thesis, including angular defect formula, cotangent formula, parallel meshes, relative geometry etc. are approaches based on offset meshes or generalized offset meshes. As an important application, we discuss discrete minimal surfaces and discrete Koenigs meshes.

Data summary of municipal solid waste management alternatives. Volume 11, Alphabetically indexed bibliography

Energy Technology Data Exchange (ETDEWEB)

None

1992-10-01

This appendix contains the alphabetically indexed bibliography for the complete group of reports on municipal waste management alternatives. The references are listed for each of the following topics: mass burn technologies, RDF technologies, fluidized-bed combustion, pyrolysis and gasification of MSW, materials recovery- recycling technologies, sanitary landfills, composting, and anaerobic digestion of MSW.

Viewing speech in action: speech articulation videos in the public domain that demonstrate the sounds of the International Phonetic Alphabet (IPA)

OpenAIRE

Nakai, S.; Beavan, D.; Lawson, E.; Leplâtre, G.; Scobbie, J. M.; Stuart-Smith, J.

2016-01-01

In this article, we introduce recently released, publicly available resources, which allow users to watch videos of hidden articulators (e.g. the tongue) during the production of various types of sounds found in the world’s languages. The articulation videos on these resources are linked to a clickable International Phonetic Alphabet chart ([International Phonetic Association. 1999. Handbook of the International Phonetic Association: A Guide to the Use of the International Phonetic Alphabet. ...

Discrete linear canonical transforms based on dilated Hermite functions.

Science.gov (United States)

Pei, Soo-Chang; Lai, Yun-Chiu

2011-08-01

Linear canonical transform (LCT) is very useful and powerful in signal processing and optics. In this paper, discrete LCT (DLCT) is proposed to approximate LCT by utilizing the discrete dilated Hermite functions. The Wigner distribution function is also used to investigate DLCT performances in the time-frequency domain. Compared with the existing digital computation of LCT, our proposed DLCT possess additivity and reversibility properties with no oversampling involved. In addition, the length of input/output signals will not be changed before and after the DLCT transformations, which is consistent with the time-frequency area-preserving nature of LCT; meanwhile, the proposed DLCT has very good approximation of continuous LCT.

Computing the discrete fréchet distance with imprecise input

KAUST Repository

Ahn, Heekap

2012-02-01

We consider the problem of computing the discrete Frechet distance between two polyg- onal curves when their vertices are imprecise. An imprecise point is given by a region and this point could lie anywhere within this region. By modelling imprecise points as balls in dimension d, we present an algorithm for this problem that returns in time 2 O (d 2)m 2n 2 log 2 (mn) the minimum Frechet distance between two imprecise polygonal curves with n and m vertices, respectively. We give an improved algorithm for the pla- nar case with running time O(mnlog 3 (mn)+(m 2 +n 2) log(mn)). In the d-dimensional orthogonal case, where points are modelled as axis-parallel boxes, and we use the L∞ distance, we give an O(dmnlog(dmn))-time algorithm. We also give effcient O(dmn)-time algorithms to approximate the maximum Frechet distance, as well as the minimum and maximum Frechet distance under translation. These algorithms achieve constant factor approximation ratios in \\ ealistic" settings (such as when the radii of the balls modelling the imprecise points are roughly of the same size). © 2012 World Scientific Publishing Company.

Illegal alphabets and adult biliteracy latino migrants crossing the linguistic border, expanded edition

CERN Document Server

Kalmar, Tomás Mario

2015-01-01

How do "illegal aliens" chart the speech sounds of colloquial English? This book is timeless in offering an unusually direct entry into how a group of Mexican fruit pickers analyze their first encounter with local American speech in a tiny rural Midwestern community in the United States. Readers see close up how intelligently migrant workers help each other use what they already know-the alphabetic principle of one letter, one sound-to teach each other, from scratch, at the very first contact, a language which none of them can speak. They see how and why the strategies adult immigrants actually use in order to cope with English in the real world seem to have little in common with those used in publicly funded bilingual and ESL classrooms. What's new in this expanded edition of Tomás Mario Kalmar's landmark Illegal Alphabets and Adult Biliteracy are in-depth commentaries from six distinguished scholars-Peter Elbow, Ofelia García, James Paul Gee, Hervé Varenne, Luis Vázquez León, Karen Velasquez-who bring ...

Promoting Alphabet Knowledge Using Peer-Mediated Intervention: A Dynamic Duo for Early Literacy Development

Science.gov (United States)

Harris, Kathleen I.; Kinley, Hannah L.; Cook, Angela

2017-01-01

One of early childhood teachers' first questions of parents with regard to school readiness is whether the child knows the ABCs (Hyson & Tomlinson, 2014). Crucial pre-reading and writing skills, such as oral language, phonological awareness, print awareness, and alphabet letter recognition, are important to children's cognitive development…

Robust DEA under discrete uncertain data: a case study of Iranian electricity distribution companies

Science.gov (United States)

Hafezalkotob, Ashkan; Haji-Sami, Elham; Omrani, Hashem

2015-06-01

Crisp input and output data are fundamentally indispensable in traditional data envelopment analysis (DEA). However, the real-world problems often deal with imprecise or ambiguous data. In this paper, we propose a novel robust data envelopment model (RDEA) to investigate the efficiencies of decision-making units (DMU) when there are discrete uncertain input and output data. The method is based upon the discrete robust optimization approaches proposed by Mulvey et al. (1995) that utilizes probable scenarios to capture the effect of ambiguous data in the case study. Our primary concern in this research is evaluating electricity distribution companies under uncertainty about input/output data. To illustrate the ability of proposed model, a numerical example of 38 Iranian electricity distribution companies is investigated. There are a large amount ambiguous data about these companies. Some electricity distribution companies may not report clear and real statistics to the government. Thus, it is needed to utilize a prominent approach to deal with this uncertainty. The results reveal that the RDEA model is suitable and reliable for target setting based on decision makers (DM's) preferences when there are uncertain input/output data.

Design of a Discrete Tracking Controller for a Magnetic Levitation System: A Nonlinear Rational Model Approach

Directory of Open Access Journals (Sweden)

Fernando Gómez-Salas

2015-01-01

Full Text Available This work proposes a discrete-time nonlinear rational approximate model for the unstable magnetic levitation system. Based on this model and as an application of the input-output linearization technique, a discrete-time tracking control design will be derived using the corresponding classical state space representation of the model. A simulation example illustrates the efficiency of the proposed methodology.

Equilibrium and response properties of the integrate-and-fire neuron in discrete time

Directory of Open Access Journals (Sweden)

Moritz Helias

2010-01-01

Full Text Available The integrate-and-fire neuron with exponential postsynaptic potentials is a frequently employed model to study neural networks. Simulations in discrete time still have highest performance at moderate numerical errors, which makes them first choice for long-term simulations of plastic networks. Here we extend the population density approach to investigate how the equilibrium and response properties of the leaky integrate-and-fire neuron are affected by time discretization. We present a novel analytical treatment of the boundary condition at threshold, taking both discretization of time and finite synaptic weights into account. We uncover an increased membrane potential density just below threshold as the decisive property that explains the deviations found between simulations and the classical diffusion approximation. Temporal discretization and finite synaptic weights both contribute to this effect. Our treatment improves the standard formula to calculate the neuron’s equilibrium firing rate. Direct solution of the Markov process describing the evolution of the membrane potential density confirms our analysis and yields a method to calculate the firing rate exactly. Knowing the shape of the membrane potential distribution near threshold enables us to devise the transient response properties of the neuron model to synaptic input. We find a pronounced non-linear fast response component that has not been described by the prevailing continuous time theory for Gaussian white noise input.

Property - preserving convergent sequences of invariant sets for linear discrete - time systems

NARCIS (Netherlands)

Athanasopoulos, N.; Lazar, M.; Bitsoris, G.

2014-01-01

Abstract: New sequences of monotonically increasing sets are introduced, for linear discrete-time systems subject to input and state constraints. The elements of the set sequences are controlled invariant and admissible regions of stabilizability. They are generated from the iterative application of

INIS: Authority list for journal titles

International Nuclear Information System (INIS)

2007-01-01

This is the 33rd revision of the INIS: Authority List for Journal Titles (IAEA-INIS-11). This list is published annually and includes the titles of all journals which have contained articles submitted to INIS at the time of publication. The current list contains 13 396 journal titles, 2 170 regularly scanned journals and 578 key journals. It was last updated in February 2007. A journal - or periodical - is a continuing publication issued in a succession of discrete parts, usually bearing numbering and/or chronological designations and intended to be continued indefinitely. It is generally published within a defined, fixed interval between issues and normally appears more than once per year. It includes a mixture of articles, letters, summaries, etc. Within this definition, annuals such as the Annual Review of Nuclear Science are included, but series titles such as the McGraw-Hill Series in Nuclear Engineering are not. The purpose of this document is to provide descriptive cataloguers with standard elements to include in bibliographic level 'S' of the INIS record. These elements include field (tag) 229 (Full Journal Title), 320 (ISSN) and 321 (CODEN). The full journal title is mandatory, and either the ISSN or the CODEN must be included (both may appear). Instructions on how to use this and other elements of the INIS record format are found in INIS: Guide to Bibliographic Description (IAEA-INIS-1). In order to help the user find titles easily, the list is arranged in six parts, followed by summary statistics: - In Part I, all key journals are grouped under the name of the country or international organization responsible for their input in INIS, then sorted alphabetically under their title. - In Part II, all key journals are sorted alphabetically under their title. The name of the country or international organization responsible for their input in INIS is entered in parentheses within the body of the entry. - In Part III, all journals that are regularly scanned by

How input fluctuations reshape the dynamics of a biological switching system

Science.gov (United States)

Hu, Bo; Kessler, David A.; Rappel, Wouter-Jan; Levine, Herbert

2012-12-01

An important task in quantitative biology is to understand the role of stochasticity in biochemical regulation. Here, as an extension of our recent work [Phys. Rev. Lett.PRLTAO0031-900710.1103/PhysRevLett.107.148101 107, 148101 (2011)], we study how input fluctuations affect the stochastic dynamics of a simple biological switch. In our model, the on transition rate of the switch is directly regulated by a noisy input signal, which is described as a non-negative mean-reverting diffusion process. This continuous process can be a good approximation of the discrete birth-death process and is much more analytically tractable. Within this setup, we apply the Feynman-Kac theorem to investigate the statistical features of the output switching dynamics. Consistent with our previous findings, the input noise is found to effectively suppress the input-dependent transitions. We show analytically that this effect becomes significant when the input signal fluctuates greatly in amplitude and reverts slowly to its mean.

Input Shaping to Reduce Solar Array Structural Vibrations

Science.gov (United States)

Doherty, Michael J.; Tolson, Robert J.

1998-01-01

Structural vibrations induced by actuators can be minimized using input shaping. Input shaping is a feedforward method in which actuator commands are convolved with shaping functions to yield a shaped set of commands. These commands are designed to perform the maneuver while minimizing the residual structural vibration. In this report, input shaping is extended to stepper motor actuators. As a demonstration, an input-shaping technique based on pole-zero cancellation was used to modify the Solar Array Drive Assembly (SADA) actuator commands for the Lewis satellite. A series of impulses were calculated as the ideal SADA output for vibration control. These impulses were then discretized for use by the SADA stepper motor actuator and simulated actuator outputs were used to calculate the structural response. The effectiveness of input shaping is limited by the accuracy of the knowledge of the modal frequencies. Assuming perfect knowledge resulted in significant vibration reduction. Errors of 10% in the modal frequencies caused notably higher levels of vibration. Controller robustness was improved by incorporating additional zeros in the shaping function. The additional zeros did not require increased performance from the actuator. Despite the identification errors, the resulting feedforward controller reduced residual vibrations to the level of the exactly modeled input shaper and well below the baseline cases. These results could be easily applied to many other vibration-sensitive applications involving stepper motor actuators.

Familial Colorectal Cancer: Understanding the Alphabet Soup.

Science.gov (United States)

Giglia, Matthew D; Chu, Daniel I

2016-09-01

While most colorectal cancers (CRCs) originate from nonhereditary spontaneous mutations, one-third of cases are familial or hereditary. Hereditary CRCs, which account for < 5% of all CRCs, have identifiable germline mutations and phenotypes, such as Lynch syndrome and familial adenomatous polyposis (FAP). Familial CRCs, which account for up to 30% of CRCs, have no identifiable germline mutation or specific pattern of inheritance, but higher-than-expected incidence within a family. Since the discovery that certain genotypes can lead to development of CRC, thousands of mutations have now been implicated in CRC. These new findings have enhanced our ability to identify at-risk patients, initiate better surveillance, and take preventative measures. Given the large number of genes now associated with hereditary and familial CRCs, clinicians should be familiar with the alphabet soup of genes to provide the highest quality of care for patients and families.

Collaborative Research: The Alphabetic Braille and Contracted Braille Study as an Example of Collaborative Research

Science.gov (United States)

Wormsley, Diane P.; Emerson, Robert Wall; Erin, Jane

2011-01-01

This article examines the Alphabetic Braille Contracted Braille Study in relation to the dimensions of collaborative research: extent, intensity, substance, heterogeneity, velocity, formality, and productivity. It also discusses the dimensions of financing research and researchers' attitudes. The overall consensus is that the study would not have…

The Ideological Aspects of Contemporary Cyrillic Alphabet Transliteration Practices in the Balkans

Directory of Open Access Journals (Sweden)

Giustina Selvelli

2016-02-01

Full Text Available This article illustrates the new rules on the transliteration of the Cyrillic alphabet adopted in Bulgaria, Serbia and the Republic of Macedonia over the last few years. It also considers the possible political and identity reasons underlying changes to such practices. To this aim, I contextualize the question within various ongoing debates in the respective countries, with reference to the ideologies that have emerged in the most recent post-socialist period.

The scaling of edge parameters in jet with plasma input power

International Nuclear Information System (INIS)

Erents, S.K.; McCracken, G.M.; Harbour, P.J.; Clement, S.; Summers, D.D.R.; Tagle, J.A.; Kock, L. de

1989-01-01

The scaling of edge parameters of density and temperature with central density and ohmic power in JET has been presented previously for the discrete limiter geometry and more recently for the new belt limiter configuration. However, the scaling with plasma current (I p ) is difficult to interpret because varying I p does not only change the input power but also the safety factor qs and consequently the SOL thickness. The use of additional heating at constant current allows more direct observation of the effects of changing heating power. In this paper we present data in which the plasma input power is increased by ICRH, (Pt<20MW), using a 3MA target plasma, and compare data for different plasma currents using discrete and belt limiter geometries. Edge data is presented from Langmuir probes in tiles at the top of the torus, when the tokamak is operated in single null magnetic separatrix (divertor) mode, as well as for probes in the main plasma boundary to contrast these data with limiter data. (author) 3 refs., 4 figs

A Note on Sequence Prediction over Large Alphabets

Directory of Open Access Journals (Sweden)

Travis Gagie

2012-02-01

Full Text Available Building on results from data compression, we prove nearly tight bounds on how well sequences of length n can be predicted in terms of the size σ of the alphabet and the length k of the context considered when making predictions. We compare the performance achievable by an adaptive predictor with no advance knowledge of the sequence, to the performance achievable by the optimal static predictor using a table listing the frequency of each (k + 1-tuple in the sequence. We show that, if the elements of the sequence are chosen uniformly at random, then an adaptive predictor can compete in the expected case if k ≤ logσ n – 3 – ε, for a constant ε > 0, but not if k ≥ logσ n.

Moving Beyond of The Alphabet Soup of HIV Prevention

Science.gov (United States)

Collins, Chris; Coates, Thomas J.; Curran, James

2010-01-01

It is time to scrap the “ABCs” and elevate the debate on HIV prevention beyond the incessant controversies over individual interventions. The ABCs are a woefully incomplete list of necessary prevention interventions, but the goal should not be to just add more letters to the prevention alphabet. Instead, advancing global HIV prevention means holding national gover nments, donors and global agencies accountable for prevention efforts that are tailored to national epidemics, bring quality interventions to a scale, and address environmental factors in vulnerability. The debate is not so much about one intervention or another, but whether countries have a comprehensive prevention effort in place that responds to their own unique situations. PMID:18641471

Input-profile-based software failure probability quantification for safety signal generation systems

International Nuclear Information System (INIS)

Kang, Hyun Gook; Lim, Ho Gon; Lee, Ho Jung; Kim, Man Cheol; Jang, Seung Cheol

2009-01-01

The approaches for software failure probability estimation are mainly based on the results of testing. Test cases represent the inputs, which are encountered in an actual use. The test inputs for the safety-critical application such as a reactor protection system (RPS) of a nuclear power plant are the inputs which cause the activation of protective action such as a reactor trip. A digital system treats inputs from instrumentation sensors as discrete digital values by using an analog-to-digital converter. Input profile must be determined in consideration of these characteristics for effective software failure probability quantification. Another important characteristic of software testing is that we do not have to repeat the test for the same input value since the software response is deterministic for each specific digital input. With these considerations, we propose an effective software testing method for quantifying the failure probability. As an example application, the input profile of the digital RPS is developed based on the typical plant data. The proposed method in this study is expected to provide a simple but realistic mean to quantify the software failure probability based on input profile and system dynamics.

Hand Movements and Braille Reading Efficiency: Data from the Alphabetic Braille and Contracted Braille Study

Science.gov (United States)

Wright, Tessa; Wormsley, Diane P.; Kamei-Hannan, Cheryl

2009-01-01

Using a subset of data from the Alphabetic Braille and Contracted Braille Study, researchers analyzed the patterns and characteristics of hand movements as predictors of reading performance. Statistically significant differences were found between one- and two-handed readers and between patterns of hand movements and reading rates. (Contains 6…

Discrete Mathematics

DEFF Research Database (Denmark)

Sørensen, John Aasted

2011-01-01

The objectives of Discrete Mathematics (IDISM2) are: The introduction of the mathematics needed for analysis, design and verification of discrete systems, including the application within programming languages for computer systems. Having passed the IDISM2 course, the student will be able...... to accomplish the following: -Understand and apply formal representations in discrete mathematics. -Understand and apply formal representations in problems within discrete mathematics. -Understand methods for solving problems in discrete mathematics. -Apply methods for solving problems in discrete mathematics......; construct a finite state machine for a given application. Apply these concepts to new problems. The teaching in Discrete Mathematics is a combination of sessions with lectures and students solving problems, either manually or by using Matlab. Furthermore a selection of projects must be solved and handed...

Spatial Treatment of the Slab-geometry Discrete Ordinates Equations Using Artificial Neural Networks

International Nuclear Information System (INIS)

Brantley, P S

2001-01-01

An artificial neural network (ANN) method is developed for treating the spatial variable of the one-group slab-geometry discrete ordinates (S N ) equations in a homogeneous medium with linearly anisotropic scattering. This ANN method takes advantage of the function approximation capability of multilayer ANNs. The discrete ordinates angular flux is approximated by a multilayer ANN with a single input representing the spatial variable x and N outputs representing the angular flux in each of the discrete ordinates angular directions. A global objective function is formulated which measures how accurately the output of the ANN approximates the solution of the discrete ordinates equations and boundary conditions at specified spatial points. Minimization of this objective function determines the appropriate values for the parameters of the ANN. Numerical results are presented demonstrating the accuracy of the method for both fixed source and incident angular flux problems

Baecklund transformations for discrete Painleve equations: Discrete PII-PV

International Nuclear Information System (INIS)

Sakka, A.; Mugan, U.

2006-01-01

Transformation properties of discrete Painleve equations are investigated by using an algorithmic method. This method yields explicit transformations which relates the solutions of discrete Painleve equations, discrete P II -P V , with different values of parameters. The particular solutions which are expressible in terms of the discrete analogue of the classical special functions of discrete Painleve equations can also be obtained from these transformations

Transformation of nonlinear discrete-time system into the extended observer form

Science.gov (United States)

Kaparin, V.; Kotta, Ü.

2018-04-01

The paper addresses the problem of transforming discrete-time single-input single-output nonlinear state equations into the extended observer form, which, besides the input and output, also depends on a finite number of their past values. Necessary and sufficient conditions for the existence of both the extended coordinate and output transformations, solving the problem, are formulated in terms of differential one-forms, associated with the input-output equation, corresponding to the state equations. An algorithm for transformation of state equations into the extended observer form is proposed and illustrated by an example. Moreover, the considered approach is compared with the method of dynamic observer error linearisation, which likewise is intended to enlarge the class of systems transformable into an observer form.

A family of names : rune-names and ogam-names and their relation to alphabet letter-names

NARCIS (Netherlands)

Griffiths, Alan

2013-01-01

The current consensus is that vernacular names assigned to the runes of the Germanic fuþark and to Irish ogam characters are indigenous creations independent of Mediterranean alphabet traditions. I propose, however, that ogam-names are based on interpretations of Hebrew, Greek or Latin letter-names

Linear diffusion-wave channel routing using a discrete Hayami convolution method

Science.gov (United States)

Li Wang; Joan Q. Wu; William J. Elliot; Fritz R. Feidler; Sergey. Lapin

2014-01-01

The convolution of an input with a response function has been widely used in hydrology as a means to solve various problems analytically. Due to the high computation demand in solving the functions using numerical integration, it is often advantageous to use the discrete convolution instead of the integration of the continuous functions. This approach greatly reduces...

From the Alphabet to the Web

Directory of Open Access Journals (Sweden)

Gevisa La Rocca

2012-04-01

Full Text Available The article discusses the issues of social and cultural construction of the concepts of time, space, and thought. This analysis is matched by a parallel between the physics and those of communication. To be used as a reference is the shift from the Newtonian conception of time and space to the one proposed by Einstein. In fact, the concepts of space and time outlined in Newtonian physics well befits to what is the cultural and experiential that outlines M. McLuhan in his description of the aural and visual culture—an examination that, starting from the introduction of the alphabet, takes us to Gutenberg and the electric media. The revolution introduced by Einstein seems similar to the one that goes to the concepts of time, space, and thought with the advent of the Net. This article includes a review of the literature on the subject, through the lesson of Meyrowitz, McLuhan, Innis, Castells, Appadurai, Manovich, Berners-Lee to get to Carr. Facing this path is referred to as the birth of the hypertext moment of transition from linear thinking to the reticular.

Computer code ANISN multiplying media and shielding calculation II. Code description (input/output)

International Nuclear Information System (INIS)

Maiorino, J.R.

1990-01-01

The user manual of the ANISN computer code describing input and output subroutines is presented. ANISN code was developed to solve one-dimensional transport equation for neutron or gamma rays in slab, sphere or cylinder geometry with general anisotropic scattering. The solution technique is the discrete ordinate method. (M.C.K.)

Fault detection for discrete-time switched systems with sensor stuck faults and servo inputs.

Science.gov (United States)

Zhong, Guang-Xin; Yang, Guang-Hong

2015-09-01

This paper addresses the fault detection problem of switched systems with servo inputs and sensor stuck faults. The attention is focused on designing a switching law and its associated fault detection filters (FDFs). The proposed switching law uses only the current states of FDFs, which guarantees the residuals are sensitive to the servo inputs with known frequency ranges in faulty cases and robust against them in fault-free case. Thus, the arbitrarily small sensor stuck faults, including outage faults can be detected in finite-frequency domain. The levels of sensitivity and robustness are measured in terms of the finite-frequency H- index and l2-gain. Finally, the switching law and FDFs are obtained by the solution of a convex optimization problem. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

Discrete Curvatures and Discrete Minimal Surfaces

KAUST Repository

Sun, Xiang

2012-01-01

This thesis presents an overview of some approaches to compute Gaussian and mean curvature on discrete surfaces and discusses discrete minimal surfaces. The variety of applications of differential geometry in visualization and shape design leads

Distribution of return point memory states for systems with stochastic inputs

International Nuclear Information System (INIS)

Amann, A; Brokate, M; Rachinskii, D; Temnov, G

2011-01-01

We consider the long term effect of stochastic inputs on the state of an open loop system which exhibits the so-called return point memory. An example of such a system is the Preisach model; more generally, systems with the Preisach type input-state relationship, such as in spin-interaction models, are considered. We focus on the characterisation of the expected memory configuration after the system has been effected by the input for sufficiently long period of time. In the case where the input is given by a discrete time random walk process, or the Wiener process, simple closed form expressions for the probability density of the vector of the main input extrema recorded by the memory state, and scaling laws for the dimension of this vector, are derived. If the input is given by a general continuous Markov process, we show that the distribution of previous memory elements can be obtained from a Markov chain scheme which is derived from the solution of an associated one-dimensional escape type problem. Formulas for transition probabilities defining this Markov chain scheme are presented. Moreover, explicit formulas for the conditional probability densities of previous main extrema are obtained for the Ornstein-Uhlenbeck input process. The analytical results are confirmed by numerical experiments.

INIS: Authority list for journal titles

International Nuclear Information System (INIS)

2008-01-01

This is the 34th revision of the INIS: Authority List for Journal Titles (IAEA-INIS-11). This list is published annually and includes the titles of all journals which have contained articles submitted to INIS at the time of publication. The current list contains 13 538 journal titles, 2 106 regularly scanned journals and 613 key journals. It was last updated in February 2008. A journal - or periodical - is a continuing publication issued in a succession of discrete parts, usually bearing numbering and/or chronological designations and intended to be continued indefinitely. It is generally published within a defined, fixed interval between issues and normally appears more than once per year. It includes a mixture of articles, letters, summaries, etc. Within this definition, annuals such as the Annual Review of Nuclear Science are included, but series titles such as the McGraw-Hill Series in Nuclear Engineering are not. The purpose of this document is to provide descriptive cataloguers with standard elements to include in bibliographic level 'S' of the INIS record. These elements include field (tag) 229 (Full Journal Title), 320 (ISSN) and 321 (CODEN). The full journal title is mandatory, and either the ISSN or the CODEN must be included (both may appear). Instructions on how to use this and other elements of the INIS record format are found in INIS: Guide to Bibliographic Description (IAEA-INIS-1). In order to help the user find titles easily, the list is arranged in six parts, followed by summary statistics: - In Part I, all key journals are grouped under the name of the country or international organization responsible for their input in INIS, then sorted alphabetically under their title. - In Part II, all key journals are sorted alphabetically under their title. The name of the country or international organization responsible for their input in INIS is entered in parentheses within the body of the entry. - In Part III, all journals that are regularly scanned by

Discrete Displacement Hydraulic Power Take-Off System for the Wavestar Wave Energy Converter

DEFF Research Database (Denmark)

Hansen, Rico Hjerm; Kramer, Morten; Vidal, Enrique

2013-01-01

. This is achieved by using special multi-chambered cylinders, where the different chambers may be connected to the available system pressures using fast on/off valves. Resultantly, a Discrete Displacement Cylinder (DDC) is created, allowing near loss free discrete force control. This paper presents a complete PTO...... system for a 20 float Wavestar based on the DDC. The WEC and PTO is rigorously modeled from incident waves to the electric output to the grid. The resulting model of +600 states is simulated in different irregular seas, showing that power conversion efficiencies above 70% from input power to electrical...

A multi-frame particle tracking algorithm robust against input noise

International Nuclear Information System (INIS)

Li, Dongning; Zhang, Yuanhui; Sun, Yigang; Yan, Wei

2008-01-01

The performance of a particle tracking algorithm which detects particle trajectories from discretely recorded particle positions could be substantially hindered by the input noise. In this paper, a particle tracking algorithm is developed which is robust against input noise. This algorithm employs the regression method instead of the extrapolation method usually employed by existing algorithms to predict future particle positions. If a trajectory cannot be linked to a particle at a frame, the algorithm can still proceed by trying to find a candidate at the next frame. The connectivity of tracked trajectories is inspected to remove the false ones. The algorithm is validated with synthetic data. The result shows that the algorithm is superior to traditional algorithms in the aspect of tracking long trajectories

Dynamical Properties of Discrete-Time Background Neural Networks with Uniform Firing Rate

Directory of Open Access Journals (Sweden)

Min Wan

2013-01-01

Full Text Available The dynamics of a discrete-time background network with uniform firing rate and background input is investigated. The conditions for stability are firstly derived. An invariant set is then obtained so that the nondivergence of the network can be guaranteed. In the invariant set, it is proved that all trajectories of the network starting from any nonnegative value will converge to a fixed point under some conditions. In addition, bifurcation and chaos are discussed. It is shown that the network can engender bifurcation and chaos with the increase of background input. The computations of Lyapunov exponents confirm the chaotic behaviors.

Mimetic discretization methods

CERN Document Server

Castillo, Jose E

2013-01-01

To help solve physical and engineering problems, mimetic or compatible algebraic discretization methods employ discrete constructs to mimic the continuous identities and theorems found in vector calculus. Mimetic Discretization Methods focuses on the recent mimetic discretization method co-developed by the first author. Based on the Castillo-Grone operators, this simple mimetic discretization method is invariably valid for spatial dimensions no greater than three. The book also presents a numerical method for obtaining corresponding discrete operators that mimic the continuum differential and

On the Capacity Region of the Intensity-Modulation Direct-Detection Optical Broadcast Channel

KAUST Repository

Chaaban, Anas

2015-08-11

The capacity of the intensity-modulation direct-detection free-space optical broadcast channel (OBC) is investigated. The Gaussian model with input-independent Gaussian noise is used, with both average and peak intensity constraints. An outer bound on the capacity region is derived by adapting Bergmans\\' approach to the OBC. Inner bounds are derived by using superposition coding with either truncated-Gaussian distributions or discrete distributions. While the discrete input distribution achieves higher rates than the truncated-Gaussian distribution, the latter allows expressing the achievable rate region in a closed form. At high signal-to-noise ratio (SNR), it is shown that the truncated-Gaussian distribution is nearly optimal. It achieves the symmetric-capacity within a constant gap (independent of SNR), which approaches half a bit as the number of users grows large. It also achieves the capacity region within a constant gap, which depends on the number of users. At low SNR, it is shown that on-off keying with time-division multiple-access (TDMA) is optimal, as it achieves any point on the boundary of the developed outer bound. This is interesting in practice since both OOK and TDMA have low complexity. At moderate SNR (typically [0,8] dB), a discrete distribution with a small alphabet size achieves a fairly good performance in terms of symmetric rate.

Alphabet Writing and Allograph Selection as Predictors of Spelling in Sentences Written by Spanish-Speaking Children Who Are Poor or Good Keyboarders.

Science.gov (United States)

Peake, Christian; Diaz, Alicia; Artiles, Ceferino

This study examined the relationship and degree of predictability that the fluency of writing the alphabet from memory and the selection of allographs have on measures of fluency and accuracy of spelling in a free-writing sentence task when keyboarding. The Test Estandarizado para la Evaluación de la Escritura con Teclado ("Spanish Keyboarding Writing Test"; Jiménez, 2012) was used as the assessment tool. A sample of 986 children from Grades 1 through 3 were classified according to transcription skills measured by keyboard ability (poor vs. good) across the grades. Results demonstrated that fluency in writing the alphabet and selecting allographs mediated the differences in spelling between good and poor keyboarders in the free-writing task. Execution in the allograph selection task and writing alphabet from memory had different degrees of predictability in each of the groups in explaining the level of fluency and spelling in the free-writing task sentences, depending on the grade. These results suggest that early assessment of writing by means of the computer keyboard can provide clues and guidelines for intervention and training to strengthen specific skills to improve writing performance in the early primary grades in transcription skills by keyboarding.

Exponential stability of continuous-time and discrete-time bidirectional associative memory networks with delays

International Nuclear Information System (INIS)

Liang Jinling; Cao Jinde

2004-01-01

First, convergence of continuous-time Bidirectional Associative Memory (BAM) neural networks are studied. By using Lyapunov functionals and some analysis technique, the delay-independent sufficient conditions are obtained for the networks to converge exponentially toward the equilibrium associated with the constant input sources. Second, discrete-time analogues of the continuous-time BAM networks are formulated and studied. It is shown that the convergence characteristics of the continuous-time systems are preserved by the discrete-time analogues without any restriction imposed on the uniform discretionary step size. An illustrative example is given to demonstrate the effectiveness of the obtained results

Continuous versus discrete structures II -- Discrete Hamiltonian systems and Helmholtz conditions

OpenAIRE

Cresson, Jacky; Pierret, Frédéric

2015-01-01

We define discrete Hamiltonian systems in the framework of discrete embeddings. An explicit comparison with previous attempts is given. We then solve the discrete Helmholtz's inverse problem for the discrete calculus of variation in the Hamiltonian setting. Several applications are discussed.

Discrete Mathematics

DEFF Research Database (Denmark)

Sørensen, John Aasted

2011-01-01

; construct a finite state machine for a given application. Apply these concepts to new problems. The teaching in Discrete Mathematics is a combination of sessions with lectures and students solving problems, either manually or by using Matlab. Furthermore a selection of projects must be solved and handed...... to accomplish the following: -Understand and apply formal representations in discrete mathematics. -Understand and apply formal representations in problems within discrete mathematics. -Understand methods for solving problems in discrete mathematics. -Apply methods for solving problems in discrete mathematics...... to new problems. Relations and functions: Define a product set; define and apply equivalence relations; construct and apply functions. Apply these concepts to new problems. Natural numbers and induction: Define the natural numbers; apply the principle of induction to verify a selection of properties...

Digital Discretion

DEFF Research Database (Denmark)

Busch, Peter Andre; Zinner Henriksen, Helle

2018-01-01

discretion is suggested to reduce this footprint by influencing or replacing their discretionary practices using ICT. What is less researched is whether digital discretion can cause changes in public policy outcomes, and under what conditions such changes can occur. Using the concept of public service values......This study reviews 44 peer-reviewed articles on digital discretion published in the period from 1998 to January 2017. Street-level bureaucrats have traditionally had a wide ability to exercise discretion stirring debate since they can add their personal footprint on public policies. Digital......, we suggest that digital discretion can strengthen ethical and democratic values but weaken professional and relational values. Furthermore, we conclude that contextual factors such as considerations made by policy makers on the macro-level and the degree of professionalization of street...

SA-Search: a web tool for protein structure mining based on a Structural Alphabet

OpenAIRE

Guyon, Frédéric; Camproux, Anne-Claude; Hochez, Joëlle; Tufféry, Pierre

2004-01-01

SA-Search is a web tool that can be used to mine for protein structures and extract structural similarities. It is based on a hidden Markov model derived Structural Alphabet (SA) that allows the compression of three-dimensional (3D) protein conformations into a one-dimensional (1D) representation using a limited number of prototype conformations. Using such a representation, classical methods developed for amino acid sequences can be employed. Currently, SA-Search permits the performance of f...

Calibration of discrete element model parameters: soybeans

Science.gov (United States)

Ghodki, Bhupendra M.; Patel, Manish; Namdeo, Rohit; Carpenter, Gopal

2018-05-01

Discrete element method (DEM) simulations are broadly used to get an insight of flow characteristics of granular materials in complex particulate systems. DEM input parameters for a model are the critical prerequisite for an efficient simulation. Thus, the present investigation aims to determine DEM input parameters for Hertz-Mindlin model using soybeans as a granular material. To achieve this aim, widely acceptable calibration approach was used having standard box-type apparatus. Further, qualitative and quantitative findings such as particle profile, height of kernels retaining the acrylic wall, and angle of repose of experiments and numerical simulations were compared to get the parameters. The calibrated set of DEM input parameters includes the following (a) material properties: particle geometric mean diameter (6.24 mm); spherical shape; particle density (1220 kg m^{-3} ), and (b) interaction parameters such as particle-particle: coefficient of restitution (0.17); coefficient of static friction (0.26); coefficient of rolling friction (0.08), and particle-wall: coefficient of restitution (0.35); coefficient of static friction (0.30); coefficient of rolling friction (0.08). The results may adequately be used to simulate particle scale mechanics (grain commingling, flow/motion, forces, etc) of soybeans in post-harvest machinery and devices.

Invariant object recognition based on the generalized discrete radon transform

Science.gov (United States)

Easley, Glenn R.; Colonna, Flavia

2004-04-01

We introduce a method for classifying objects based on special cases of the generalized discrete Radon transform. We adjust the transform and the corresponding ridgelet transform by means of circular shifting and a singular value decomposition (SVD) to obtain a translation, rotation and scaling invariant set of feature vectors. We then use a back-propagation neural network to classify the input feature vectors. We conclude with experimental results and compare these with other invariant recognition methods.

Discrete Exterior Calculus Discretization of Incompressible Navier-Stokes Equations

KAUST Repository

Mohamed, Mamdouh S.

2017-05-23

A conservative discretization of incompressible Navier-Stokes equations over surface simplicial meshes is developed using discrete exterior calculus (DEC). Numerical experiments for flows over surfaces reveal a second order accuracy for the developed scheme when using structured-triangular meshes, and first order accuracy otherwise. The mimetic character of many of the DEC operators provides exact conservation of both mass and vorticity, in addition to superior kinetic energy conservation. The employment of barycentric Hodge star allows the discretization to admit arbitrary simplicial meshes. The discretization scheme is presented along with various numerical test cases demonstrating its main characteristics.

Input Forces Estimation for Nonlinear Systems by Applying a Square-Root Cubature Kalman Filter.

Science.gov (United States)

Song, Xuegang; Zhang, Yuexin; Liang, Dakai

2017-10-10

This work presents a novel inverse algorithm to estimate time-varying input forces in nonlinear beam systems. With the system parameters determined, the input forces can be estimated in real-time from dynamic responses, which can be used for structural health monitoring. In the process of input forces estimation, the Runge-Kutta fourth-order algorithm was employed to discretize the state equations; a square-root cubature Kalman filter (SRCKF) was employed to suppress white noise; the residual innovation sequences, a priori state estimate, gain matrix, and innovation covariance generated by SRCKF were employed to estimate the magnitude and location of input forces by using a nonlinear estimator. The nonlinear estimator was based on the least squares method. Numerical simulations of a large deflection beam and an experiment of a linear beam constrained by a nonlinear spring were employed. The results demonstrated accuracy of the nonlinear algorithm.

Input Forces Estimation for Nonlinear Systems by Applying a Square-Root Cubature Kalman Filter

Directory of Open Access Journals (Sweden)

Xuegang Song

2017-10-01

Full Text Available This work presents a novel inverse algorithm to estimate time-varying input forces in nonlinear beam systems. With the system parameters determined, the input forces can be estimated in real-time from dynamic responses, which can be used for structural health monitoring. In the process of input forces estimation, the Runge-Kutta fourth-order algorithm was employed to discretize the state equations; a square-root cubature Kalman filter (SRCKF was employed to suppress white noise; the residual innovation sequences, a priori state estimate, gain matrix, and innovation covariance generated by SRCKF were employed to estimate the magnitude and location of input forces by using a nonlinear estimator. The nonlinear estimator was based on the least squares method. Numerical simulations of a large deflection beam and an experiment of a linear beam constrained by a nonlinear spring were employed. The results demonstrated accuracy of the nonlinear algorithm.

Observer-based hyperchaos synchronization in cascaded discrete-time systems

International Nuclear Information System (INIS)

Grassi, Giuseppe

2009-01-01

This paper deals with the observer-based synchronization in a cascade connection of hyperchaotic discrete-time systems. The paper demonstrates that exact synchronization in finite time is achievable between pairs of drive-response systems using only a scalar synchronizing signal. This 'propagated synchronization' starts from the innermost drive-response system pair and propagates toward the outermost drive-system pair. Choosing the drive-system input to be an information signal (encrypted via an arbitrary encryption function) yields a potential application of this architecture in chaos-based communications.

Robust self-triggered model predictive control for constrained discrete-time LTI systems based on homothetic tubes

NARCIS (Netherlands)

Aydiner, E.; Brunner, F.D.; Heemels, W.P.M.H.; Allgower, F.

2015-01-01

In this paper we present a robust self-triggered model predictive control (MPC) scheme for discrete-time linear time-invariant systems subject to input and state constraints and additive disturbances. In self-triggered model predictive control, at every sampling instant an optimization problem based

Approximation of Quantities of Interest in Stochastic PDEs by the Random Discrete L^2 Projection on Polynomial Spaces

KAUST Repository

Migliorati, G.; Nobile, F.; von Schwerin, E.; Tempone, Raul

2013-01-01

In this work we consider the random discrete L^2 projection on polynomial spaces (hereafter RDP) for the approximation of scalar quantities of interest (QOIs) related to the solution of a partial differential equation model with random input

ADAM: analysis of discrete models of biological systems using computer algebra.

Science.gov (United States)

Hinkelmann, Franziska; Brandon, Madison; Guang, Bonny; McNeill, Rustin; Blekherman, Grigoriy; Veliz-Cuba, Alan; Laubenbacher, Reinhard

2011-07-20

Many biological systems are modeled qualitatively with discrete models, such as probabilistic Boolean networks, logical models, Petri nets, and agent-based models, to gain a better understanding of them. The computational complexity to analyze the complete dynamics of these models grows exponentially in the number of variables, which impedes working with complex models. There exist software tools to analyze discrete models, but they either lack the algorithmic functionality to analyze complex models deterministically or they are inaccessible to many users as they require understanding the underlying algorithm and implementation, do not have a graphical user interface, or are hard to install. Efficient analysis methods that are accessible to modelers and easy to use are needed. We propose a method for efficiently identifying attractors and introduce the web-based tool Analysis of Dynamic Algebraic Models (ADAM), which provides this and other analysis methods for discrete models. ADAM converts several discrete model types automatically into polynomial dynamical systems and analyzes their dynamics using tools from computer algebra. Specifically, we propose a method to identify attractors of a discrete model that is equivalent to solving a system of polynomial equations, a long-studied problem in computer algebra. Based on extensive experimentation with both discrete models arising in systems biology and randomly generated networks, we found that the algebraic algorithms presented in this manuscript are fast for systems with the structure maintained by most biological systems, namely sparseness and robustness. For a large set of published complex discrete models, ADAM identified the attractors in less than one second. Discrete modeling techniques are a useful tool for analyzing complex biological systems and there is a need in the biological community for accessible efficient analysis tools. ADAM provides analysis methods based on mathematical algorithms as a web

Approximation of Quantities of Interest in Stochastic PDEs by the Random Discrete L^2 Projection on Polynomial Spaces

KAUST Repository

Migliorati, G.

2013-05-30

In this work we consider the random discrete L^2 projection on polynomial spaces (hereafter RDP) for the approximation of scalar quantities of interest (QOIs) related to the solution of a partial differential equation model with random input parameters. In the RDP technique the QOI is first computed for independent samples of the random input parameters, as in a standard Monte Carlo approach, and then the QOI is approximated by a multivariate polynomial function of the input parameters using a discrete least squares approach. We consider several examples including the Darcy equations with random permeability, the linear elasticity equations with random elastic coefficient, and the Navier--Stokes equations in random geometries and with random fluid viscosity. We show that the RDP technique is well suited to QOIs that depend smoothly on a moderate number of random parameters. Our numerical tests confirm the theoretical findings in [G. Migliorati, F. Nobile, E. von Schwerin, and R. Tempone, Analysis of the Discrete $L^2$ Projection on Polynomial Spaces with Random Evaluations, MOX report 46-2011, Politecnico di Milano, Milano, Italy, submitted], which have shown that, in the case of a single uniformly distributed random parameter, the RDP technique is stable and optimally convergent if the number of sampling points is proportional to the square of the dimension of the polynomial space. Here optimality means that the weighted $L^2$ norm of the RDP error is bounded from above by the best $L^\\\\infty$ error achievable in the given polynomial space, up to logarithmic factors. In the case of several random input parameters, the numerical evidence indicates that the condition on quadratic growth of the number of sampling points could be relaxed to a linear growth and still achieve stable and optimal convergence. This makes the RDP technique very promising for moderately high dimensional uncertainty quantification.

Discrete Exterior Calculus Discretization of Incompressible Navier-Stokes Equations

KAUST Repository

Mohamed, Mamdouh S.; Hirani, Anil N.; Samtaney, Ravi

2017-01-01

A conservative discretization of incompressible Navier-Stokes equations over surface simplicial meshes is developed using discrete exterior calculus (DEC). Numerical experiments for flows over surfaces reveal a second order accuracy

INIS: Authority list for journal titles

International Nuclear Information System (INIS)

2005-01-01

This is the 31st revision of the INIS: Authority List for Journal Titles (IAEA-INIS-11). This list is published annually and includes the titles of all journals which have contained articles submitted to INIS at the time of publication. The current list contains 13,104 journal titles, 2,078 regularly scanned journals and 561 key journals. It was last updated in February 2005. The purpose of this report is to provide descriptive cataloguers with a standard entry for the full title of a journal. In addition to the full journal title, the ISSN (International Standard Serial Number), administered by the ISSN International Centre, Paris, France, and/or CODEN, assigned by Chemical Abstracts Service, USA, are given in this manual. In order to help the user find titles easily, the list is arranged in six parts, followed by summary statistics: In Part I, all key journals are grouped under the name of the country or international organization responsible for their input in INIS, then sorted alphabetically under their title. In Part II, all key journals are sorted alphabetically under their title. The name of the country or international organization responsible for their input in INIS is entered in parentheses within the body of the entry. In Part III, all journals that are regularly scanned by INIS Centers are grouped under the name of the country or international organization responsible for their input in INIS, then sorted alphabetically under their title. In Part IV, all journals that are regularly scanned by INIS Centers are sorted alphabetically under their title. The name of the country or international organization responsible for their input in INIS is entered in parentheses within the body of the entry. In Part V, all journals are grouped under the name of the country or international organization responsible for their input in INIS, then sorted alphabetically under their title. In Part VI, all journals are sorted alphabetically under their title. The name of the

INIS: Authority list for journal titles

Energy Technology Data Exchange (ETDEWEB)

NONE

2005-03-01

This is the 31st revision of the INIS: Authority List for Journal Titles (IAEA-INIS-11). This list is published annually and includes the titles of all journals which have contained articles submitted to INIS at the time of publication. The current list contains 13,104 journal titles, 2,078 regularly scanned journals and 561 key journals. It was last updated in February 2005. The purpose of this report is to provide descriptive cataloguers with a standard entry for the full title of a journal. In addition to the full journal title, the ISSN (International Standard Serial Number), administered by the ISSN International Centre, Paris, France, and/or CODEN, assigned by Chemical Abstracts Service, USA, are given in this manual. In order to help the user find titles easily, the list is arranged in six parts, followed by summary statistics: In Part I, all key journals are grouped under the name of the country or international organization responsible for their input in INIS, then sorted alphabetically under their title. In Part II, all key journals are sorted alphabetically under their title. The name of the country or international organization responsible for their input in INIS is entered in parentheses within the body of the entry. In Part III, all journals that are regularly scanned by INIS Centers are grouped under the name of the country or international organization responsible for their input in INIS, then sorted alphabetically under their title. In Part IV, all journals that are regularly scanned by INIS Centers are sorted alphabetically under their title. The name of the country or international organization responsible for their input in INIS is entered in parentheses within the body of the entry. In Part V, all journals are grouped under the name of the country or international organization responsible for their input in INIS, then sorted alphabetically under their title. In Part VI, all journals are sorted alphabetically under their title. The name of the

INIS: Authority list for journal titles

International Nuclear Information System (INIS)

2006-01-01

This is the 32nd revision of the INIS: Authority List for Journal Titles (IAEA-INIS-11). This list is published annually and includes the titles of all journals which have contained articles submitted to INIS at the time of publication. The current list contains 13,231 journal titles, 2,125 regularly scanned journals and 555 key journals. It was last updated in February 2006. The purpose of this report is to provide descriptive cataloguers with a standard entry for the full title of a journal. In addition to the full journal title, the ISSN (International Standard Serial Number), administered by the ISSN International Centre, Paris, France, and/or CODEN, assigned by Chemical Abstracts Service, USA, are given in this manual. In order to help the user find titles easily, the list is arranged in six parts, followed by summary statistics: In Part I, all key journals are grouped under the name of the country or international organization responsible for their input in INIS, then sorted alphabetically under their title. In Part II, all key journals are sorted alphabetically under their title. The name of the country or international organization responsible for their input in INIS is entered in parentheses within the body of the entry. In Part III, all journals that are regularly scanned by INIS Centres are grouped under the name of the country or international organization responsible for their input in INIS, then sorted alphabetically under their title. In Part IV, all journals that are regularly scanned by INIS Centres are sorted alphabetically under their title. The name of the country or international organization responsible for their input in INIS is entered in parentheses within the body of the entry. In Part V, all journals are grouped under the name of the country or international organization responsible for their input in INIS, then sorted alphabetically under their title. In Part VI, all journals are sorted alphabetically under their title. The name of the

DISCRETE MATHEMATICS/NUMBER THEORY

OpenAIRE

Mrs. Manju Devi*

2017-01-01

Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous. In contrast to real numbers that have the property of varying "smoothly", the objects studied in discrete mathematics such as integers, graphs, and statements do not vary smoothly in this way, but have distinct, separated values. Discrete mathematics therefore excludes topics in "continuous mathematics" such as calculus and analysis. Discrete objects can often be enumerated by ...

Resonance and web structure in discrete soliton systems: the two-dimensional Toda lattice and its fully discrete and ultra-discrete analogues

International Nuclear Information System (INIS)

Maruno, Ken-ichi; Biondini, Gino

2004-01-01

We present a class of solutions of the two-dimensional Toda lattice equation, its fully discrete analogue and its ultra-discrete limit. These solutions demonstrate the existence of soliton resonance and web-like structure in discrete integrable systems such as differential-difference equations, difference equations and cellular automata (ultra-discrete equations)

Consensus of Discrete Multiagent System with Various Time Delays and Environmental Disturbances

Directory of Open Access Journals (Sweden)

Zheping Yan

2014-12-01

Full Text Available In this paper, the consensus problem of discrete multiagent systems with time varying sampling periods is studied. Firstly, with thorough analysis of various delays among agents, the control input of each agent is designed with consideration of sending delay and receiving delay. With construction of discrete dynamics of state error vector, it is proved by applying Halanay inequality that consensus of the system can be reached. Further, the definition of bounded consensus is proposed in the situation where environmental disturbances exist. In order to handle this problem, the Halanay inequality is extended into a more general one with boundedness property. Based on the new Halanay inequality obtained, the boundedness of consensus error is guaranteed. At last, simulation examples are presented to demonstrate the theoretical conclusions.

Sliding mode control-based linear functional observers for discrete-time stochastic systems

Science.gov (United States)

Singh, Satnesh; Janardhanan, Sivaramakrishnan

2017-11-01

Sliding mode control (SMC) is one of the most popular techniques to stabilise linear discrete-time stochastic systems. However, application of SMC becomes difficult when the system states are not available for feedback. This paper presents a new approach to design a SMC-based functional observer for discrete-time stochastic systems. The functional observer is based on the Kronecker product approach. Existence conditions and stability analysis of the proposed observer are given. The control input is estimated by a novel linear functional observer. This approach leads to a non-switching type of control, thereby eliminating the fundamental cause of chatter. Furthermore, the functional observer is designed in such a way that the effect of process and measurement noise is minimised. Simulation example is given to illustrate and validate the proposed design method.

Discrete Blood Glucose Control in Diabetic Göttingen Minipigs

Directory of Open Access Journals (Sweden)

Berno J.E. Misgeld

2016-07-01

Full Text Available Despite continuous research effort, patients with type 1 diabetes mellitus (T1D experience difficulties in daily adjustments of their blood glucose concentrations. New technological developments in the form of implanted intravenous infusion pumps and continuous blood glucose sensors might alleviate obstacles for the automatic adjustment of blood glucose concentration. These obstacles consist, for example, of large time-delays and insulin storage effects for the subcutaneous/interstitial route. Towards the goal of an artificial pancreas, we present a novel feedback controller approach that combines classical loop-shaping techniques with gain-scheduling and modern H ∞ -robust control approaches. A disturbance rejection design is proposed in discrete frequency domain based on the detailed model of the diabetic Göttingen minipig. The model is trimmed and linearised over a large operating range of blood glucose concentrations and insulin sensitivity values. Controller parameters are determined for each of these operating points. A discrete H ∞ loop-shaping compensator is designed to increase robustness of the artificial pancreas against general coprime factor uncertainty. The gain scheduled controller uses subcutaneous insulin injection as a control input and determines the controller input error from intravenous blood glucose concentration measurements, where parameter scheduling is achieved by an estimator of the insulin sensitivity parameter. Thus, only one controller stabilises a family of animal models. The controller is validated in silico with a total number of five Göttingen Minipig models, which were previously obtained by experimental identification procedures. Its performance is compared with an experimentally tested switching PI-controller.

Discrete control systems

CERN Document Server

Okuyama, Yoshifumi

2014-01-01

Discrete Control Systems establishes a basis for the analysis and design of discretized/quantized control systemsfor continuous physical systems. Beginning with the necessary mathematical foundations and system-model descriptions, the text moves on to derive a robust stability condition. To keep a practical perspective on the uncertain physical systems considered, most of the methods treated are carried out in the frequency domain. As part of the design procedure, modified Nyquist–Hall and Nichols diagrams are presented and discretized proportional–integral–derivative control schemes are reconsidered. Schemes for model-reference feedback and discrete-type observers are proposed. Although single-loop feedback systems form the core of the text, some consideration is given to multiple loops and nonlinearities. The robust control performance and stability of interval systems (with multiple uncertainties) are outlined. Finally, the monograph describes the relationship between feedback-control and discrete ev...

INIS: Authority list for journal titles

International Nuclear Information System (INIS)

2009-01-01

This is the 35th revision of the INIS: Authority List for Journal Titles (IAEA-INIS-11). This list is published annually and includes the titles of all journals which have contained articles submitted to INIS at the time of publication. The current list contains 13 750 journal titles, 1 965 regularly scanned journals and 593 key journals. It was last updated in March 2009. A journal - or periodical - is a continuing publication issued in a succession of discrete parts, usually bearing numbering and/or chronological designations and intended to be continued indefinitely. It is generally published within a defined, fixed interval between issues and normally appears more than once per year. It includes a mixture of articles, letters, summaries, etc. Within this definition, annuals such as the Annual Review of Nuclear Science are included, but series titles such as the McGraw-Hill Series in Nuclear Engineering are not. The purpose of this document is to provide descriptive cataloguers with standard elements to include in bibliographic level 'S' of the INIS record. These elements include field (tag) 229 (Full Journal Title), 320 (ISSN) and 321 (CODEN). The full journal title is mandatory, and either the ISSN or the CODEN must be included (both may appear). Instructions on how to use this and other elements of the INIS record format are found in INIS: Guide to Bibliographic Description (IAEA-INIS-1). In order to help the user find titles easily, the list is arranged in six parts, followed by summary statistics: - In Part I, all key journals are grouped under the name of the country or international organization responsible for their input in INIS, then sorted alphabetically under their title. - In Part II, all key journals are sorted alphabetically under their title. The name of the country or international organization responsible for their input in INIS is entered in parentheses within the body of the entry. - In Part III, all journals that are regularly scanned by the

Topological Structures on DMC Spaces †

Directory of Open Access Journals (Sweden)

Rajai Nasser

2018-05-01

Full Text Available Two channels are said to be equivalent if they are degraded from each other. The space of equivalent channels with input alphabet X and output alphabet Y can be naturally endowed with the quotient of the Euclidean topology by the equivalence relation. A topology on the space of equivalent channels with fixed input alphabet X and arbitrary but finite output alphabet is said to be natural if and only if it induces the quotient topology on the subspaces of equivalent channels sharing the same output alphabet. We show that every natural topology is σ -compact, separable and path-connected. The finest natural topology, which we call the strong topology, is shown to be compactly generated, sequential and T 4 . On the other hand, the strong topology is not first-countable anywhere, hence it is not metrizable. We introduce a metric distance on the space of equivalent channels which compares the noise levels between channels. The induced metric topology, which we call the noisiness topology, is shown to be natural. We also study topologies that are inherited from the space of meta-probability measures by identifying channels with their Blackwell measures.

Fractional-Order Discrete-Time Laguerre Filters: A New Tool for Modeling and Stability Analysis of Fractional-Order LTI SISO Systems

Directory of Open Access Journals (Sweden)

Rafał Stanisławski

2016-01-01

Full Text Available This paper presents new results on modeling and analysis of dynamics of fractional-order discrete-time linear time-invariant single-input single-output (LTI SISO systems by means of new, two-layer, “fractional-order discrete-time Laguerre filters.” It is interesting that the fractionality of the filters at the upper system dynamics layer is directly projected from the lower Laguerre-based approximation layer for the Grünwald-Letnikov difference. A new stability criterion for discrete-time fractional-order Laguerre-based LTI SISO systems is introduced and supplemented with a stability preservation analysis. Both the stability criterion and the stability preservation analysis bring up rather surprising results, which is illustrated with simulation examples.

Discrete Element Modeling

Energy Technology Data Exchange (ETDEWEB)

Morris, J; Johnson, S

2007-12-03

The Distinct Element Method (also frequently referred to as the Discrete Element Method) (DEM) is a Lagrangian numerical technique where the computational domain consists of discrete solid elements which interact via compliant contacts. This can be contrasted with Finite Element Methods where the computational domain is assumed to represent a continuum (although many modern implementations of the FEM can accommodate some Distinct Element capabilities). Often the terms Discrete Element Method and Distinct Element Method are used interchangeably in the literature, although Cundall and Hart (1992) suggested that Discrete Element Methods should be a more inclusive term covering Distinct Element Methods, Displacement Discontinuity Analysis and Modal Methods. In this work, DEM specifically refers to the Distinct Element Method, where the discrete elements interact via compliant contacts, in contrast with Displacement Discontinuity Analysis where the contacts are rigid and all compliance is taken up by the adjacent intact material.

Recognition of Arabic Sign Language Alphabet Using Polynomial Classifiers

Directory of Open Access Journals (Sweden)

M. Al-Rousan

2005-08-01

Full Text Available Building an accurate automatic sign language recognition system is of great importance in facilitating efficient communication with deaf people. In this paper, we propose the use of polynomial classifiers as a classification engine for the recognition of Arabic sign language (ArSL alphabet. Polynomial classifiers have several advantages over other classifiers in that they do not require iterative training, and that they are highly computationally scalable with the number of classes. Based on polynomial classifiers, we have built an ArSL system and measured its performance using real ArSL data collected from deaf people. We show that the proposed system provides superior recognition results when compared with previously published results using ANFIS-based classification on the same dataset and feature extraction methodology. The comparison is shown in terms of the number of misclassified test patterns. The reduction in the rate of misclassified patterns was very significant. In particular, we have achieved a 36% reduction of misclassifications on the training data and 57% on the test data.

Actor-critic-based optimal tracking for partially unknown nonlinear discrete-time systems.

Science.gov (United States)

Kiumarsi, Bahare; Lewis, Frank L

2015-01-01

This paper presents a partially model-free adaptive optimal control solution to the deterministic nonlinear discrete-time (DT) tracking control problem in the presence of input constraints. The tracking error dynamics and reference trajectory dynamics are first combined to form an augmented system. Then, a new discounted performance function based on the augmented system is presented for the optimal nonlinear tracking problem. In contrast to the standard solution, which finds the feedforward and feedback terms of the control input separately, the minimization of the proposed discounted performance function gives both feedback and feedforward parts of the control input simultaneously. This enables us to encode the input constraints into the optimization problem using a nonquadratic performance function. The DT tracking Bellman equation and tracking Hamilton-Jacobi-Bellman (HJB) are derived. An actor-critic-based reinforcement learning algorithm is used to learn the solution to the tracking HJB equation online without requiring knowledge of the system drift dynamics. That is, two neural networks (NNs), namely, actor NN and critic NN, are tuned online and simultaneously to generate the optimal bounded control policy. A simulation example is given to show the effectiveness of the proposed method.

A Discrete Spectral Problem and Related Hierarchy of Discrete Hamiltonian Lattice Equations

International Nuclear Information System (INIS)

Xu Xixiang; Cao Weili

2007-01-01

Staring from a discrete matrix spectral problem, a hierarchy of lattice soliton equations is presented though discrete zero curvature representation. The resulting lattice soliton equations possess non-local Lax pairs. The Hamiltonian structures are established for the resulting hierarchy by the discrete trace identity. Liouville integrability of resulting hierarchy is demonstrated.

Discrete exterior calculus discretization of incompressible Navier–Stokes equations over surface simplicial meshes

KAUST Repository

Mohamed, Mamdouh S.; Hirani, Anil N.; Samtaney, Ravi

2016-01-01

A conservative discretization of incompressible Navier–Stokes equations is developed based on discrete exterior calculus (DEC). A distinguishing feature of our method is the use of an algebraic discretization of the interior product operator and a

Asymptotic behavior of discrete holomorphic maps z^c, log(z) and discrete Painleve transcedents

OpenAIRE

Agafonov, S. I.

2005-01-01

It is shown that discrete analogs of z^c and log(z) have the same asymptotic behavior as their smooth counterparts. These discrete maps are described in terms of special solutions of discrete Painleve-II equations, asymptotics of these solutions providing the behaviour of discrete z^c and log(z) at infinity.

Fluency and Accuracy in Alphabet Writing by Keyboarding : A Cross-Sectional Study in Spanish-Speaking Children With and Without Learning Disabilities

NARCIS (Netherlands)

Bisschop, Elaine; Morales, Celia; Gil, Verónica; Jiménez-Suárez, Elizabeth

2017-01-01

The aim of this study was to analyze whether children with and without difficulties in handwriting, spelling, or both differed in alphabet writing when using a keyboard. The total sample consisted of 1,333 children from Grades 1 through 3. Scores on the spelling and handwriting factors from the

Decoding English Alphabet Letters Using EEG Phase Information

Directory of Open Access Journals (Sweden)

YiYan Wang

2018-02-01

Full Text Available Increasing evidence indicates that the phase pattern and power of the low frequency oscillations of brain electroencephalograms (EEG contain significant information during the human cognition of sensory signals such as auditory and visual stimuli. Here, we investigate whether and how the letters of the alphabet can be directly decoded from EEG phase and power data. In addition, we investigate how different band oscillations contribute to the classification and determine the critical time periods. An English letter recognition task was assigned, and statistical analyses were conducted to decode the EEG signal corresponding to each letter visualized on a computer screen. We applied support vector machine (SVM with gradient descent method to learn the potential features for classification. It was observed that the EEG phase signals have a higher decoding accuracy than the oscillation power information. Low-frequency theta and alpha oscillations have phase information with higher accuracy than do other bands. The decoding performance was best when the analysis period began from 180 to 380 ms after stimulus presentation, especially in the lateral occipital and posterior temporal scalp regions (PO7 and PO8. These results may provide a new approach for brain-computer interface techniques (BCI and may deepen our understanding of EEG oscillations in cognition.

Discrete port-Hamiltonian systems

NARCIS (Netherlands)

Talasila, V.; Clemente-Gallardo, J.; Schaft, A.J. van der

2006-01-01

Either from a control theoretic viewpoint or from an analysis viewpoint it is necessary to convert smooth systems to discrete systems, which can then be implemented on computers for numerical simulations. Discrete models can be obtained either by discretizing a smooth model, or by directly modeling

Applied discrete-time queues

CERN Document Server

Alfa, Attahiru S

2016-01-01

This book introduces the theoretical fundamentals for modeling queues in discrete-time, and the basic procedures for developing queuing models in discrete-time. There is a focus on applications in modern telecommunication systems. It presents how most queueing models in discrete-time can be set up as discrete-time Markov chains. Techniques such as matrix-analytic methods (MAM) that can used to analyze the resulting Markov chains are included. This book covers single node systems, tandem system and queueing networks. It shows how queues with time-varying parameters can be analyzed, and illustrates numerical issues associated with computations for the discrete-time queueing systems. Optimal control of queues is also covered. Applied Discrete-Time Queues targets researchers, advanced-level students and analysts in the field of telecommunication networks. It is suitable as a reference book and can also be used as a secondary text book in computer engineering and computer science. Examples and exercises are includ...

Time Discretization Techniques

KAUST Repository

Gottlieb, S.; Ketcheson, David I.

2016-01-01

The time discretization of hyperbolic partial differential equations is typically the evolution of a system of ordinary differential equations obtained by spatial discretization of the original problem. Methods for this time evolution include

Recognizing protein–protein interfaces with empirical potentials and reduced amino acid alphabets

Directory of Open Access Journals (Sweden)

Wodak Shoshana

2007-07-01

Full Text Available Abstract Background In structural genomics, an important goal is the detection and classification of protein–protein interactions, given the structures of the interacting partners. We have developed empirical energy functions to identify native structures of protein–protein complexes among sets of decoy structures. To understand the role of amino acid diversity, we parameterized a series of functions, using a hierarchy of amino acid alphabets of increasing complexity, with 2, 3, 4, 6, and 20 amino acid groups. Compared to previous work, we used the simplest possible functional form, with residue–residue interactions and a stepwise distance-dependence. We used increased computational ressources, however, constructing 290,000 decoys for 219 protein–protein complexes, with a realistic docking protocol where the protein partners are flexible and interact through a molecular mechanics energy function. The energy parameters were optimized to correctly assign as many native complexes as possible. To resolve the multiple minimum problem in parameter space, over 64000 starting parameter guesses were tried for each energy function. The optimized functions were tested by cross validation on subsets of our native and decoy structures, by blind tests on series of native and decoy structures available on the Web, and on models for 13 complexes submitted to the CAPRI structure prediction experiment. Results Performance is similar to several other statistical potentials of the same complexity. For example, the CAPRI target structure is correctly ranked ahead of 90% of its decoys in 6 cases out of 13. The hierarchy of amino acid alphabets leads to a coherent hierarchy of energy functions, with qualitatively similar parameters for similar amino acid types at all levels. Most remarkably, the performance with six amino acid classes is equivalent to that of the most detailed, 20-class energy function. Conclusion This suggests that six carefully chosen amino

Discrete repulsive oscillator wavefunctions

International Nuclear Information System (INIS)

Munoz, Carlos A; Rueda-Paz, Juvenal; Wolf, Kurt Bernardo

2009-01-01

For the study of infinite discrete systems on phase space, the three-dimensional Lorentz algebra and group, so(2,1) and SO(2,1), provide a discrete model of the repulsive oscillator. Its eigenfunctions are found in the principal irreducible representation series, where the compact generator-that we identify with the position operator-has the infinite discrete spectrum of the integers Z, while the spectrum of energies is a double continuum. The right- and left-moving wavefunctions are given by hypergeometric functions that form a Dirac basis for l 2 (Z). Under contraction, the discrete system limits to the well-known quantum repulsive oscillator. Numerical computations of finite approximations raise further questions on the use of Dirac bases for infinite discrete systems.

Discrete Hamiltonian evolution and quantum gravity

International Nuclear Information System (INIS)

Husain, Viqar; Winkler, Oliver

2004-01-01

We study constrained Hamiltonian systems by utilizing general forms of time discretization. We show that for explicit discretizations, the requirement of preserving the canonical Poisson bracket under discrete evolution imposes strong conditions on both allowable discretizations and Hamiltonians. These conditions permit time discretizations for a limited class of Hamiltonians, which does not include homogeneous cosmological models. We also present two general classes of implicit discretizations which preserve Poisson brackets for any Hamiltonian. Both types of discretizations generically do not preserve first class constraint algebras. Using this observation, we show that time discretization provides a complicated time gauge fixing for quantum gravity models, which may be compared with the alternative procedure of gauge fixing before discretization

Discrete exterior calculus discretization of incompressible Navier–Stokes equations over surface simplicial meshes

KAUST Repository

Mohamed, Mamdouh S.

2016-02-11

A conservative discretization of incompressible Navier–Stokes equations is developed based on discrete exterior calculus (DEC). A distinguishing feature of our method is the use of an algebraic discretization of the interior product operator and a combinatorial discretization of the wedge product. The governing equations are first rewritten using the exterior calculus notation, replacing vector calculus differential operators by the exterior derivative, Hodge star and wedge product operators. The discretization is then carried out by substituting with the corresponding discrete operators based on the DEC framework. Numerical experiments for flows over surfaces reveal a second order accuracy for the developed scheme when using structured-triangular meshes, and first order accuracy for otherwise unstructured meshes. By construction, the method is conservative in that both mass and vorticity are conserved up to machine precision. The relative error in kinetic energy for inviscid flow test cases converges in a second order fashion with both the mesh size and the time step.

Discrete exterior calculus discretization of incompressible Navier-Stokes equations over surface simplicial meshes

Science.gov (United States)

Mohamed, Mamdouh S.; Hirani, Anil N.; Samtaney, Ravi

2016-05-01

A conservative discretization of incompressible Navier-Stokes equations is developed based on discrete exterior calculus (DEC). A distinguishing feature of our method is the use of an algebraic discretization of the interior product operator and a combinatorial discretization of the wedge product. The governing equations are first rewritten using the exterior calculus notation, replacing vector calculus differential operators by the exterior derivative, Hodge star and wedge product operators. The discretization is then carried out by substituting with the corresponding discrete operators based on the DEC framework. Numerical experiments for flows over surfaces reveal a second order accuracy for the developed scheme when using structured-triangular meshes, and first order accuracy for otherwise unstructured meshes. By construction, the method is conservative in that both mass and vorticity are conserved up to machine precision. The relative error in kinetic energy for inviscid flow test cases converges in a second order fashion with both the mesh size and the time step.

Explicit solutions to the semi-discrete modified KdV equation and motion of discrete plane curves

International Nuclear Information System (INIS)

Inoguchi, Jun-ichi; Kajiwara, Kenji; Matsuura, Nozomu; Ohta, Yasuhiro

2012-01-01

We construct explicit solutions to continuous motion of discrete plane curves described by a semi-discrete potential modified KdV equation. Explicit formulas in terms of the τ function are presented. Bäcklund transformations of the discrete curves are also discussed. We finally consider the continuous limit of discrete motion of discrete plane curves described by the discrete potential modified KdV equation to motion of smooth plane curves characterized by the potential modified KdV equation. (paper)

Comparison of alphabetical versus categorical display format for medication order entry in a simulated touch screen anesthesia information management system: an experiment in clinician-computer interaction in anesthesia.

Science.gov (United States)

Marian, Anil A; Dexter, Franklin; Tucker, Peter; Todd, Michael M

2012-05-29

Anesthesia information management system (AIMS) records should be designed and configured to facilitate the accurate and prompt recording of multiple drugs administered coincidentally or in rapid succession. We proposed two touch-screen display formats for use with our department's new EPIC touch-screen AIMS. In one format, medication "buttons" were arranged in alphabetical order (i.e. A-C, D-H etc.). In the other, buttons were arranged in categories (Common, Fluids, Cardiovascular, Coagulation etc.). Both formats were modeled on an iPad screen to resemble the AIMS interface. Anesthesia residents, anesthesiologists, and Certified Registered Nurse Anesthetists (n = 60) were then asked to find and touch the correct buttons for a series of medications whose names were displayed to the side of the entry screen. The number of entries made within 2 minutes was recorded. This was done 3 times for each format, with the 1st format chosen randomly. Data were analyzed from the third trials with each format to minimize differences in learning. The categorical format had a mean of 5.6 more drugs entered using the categorical method in two minutes than the alphabetical format (95% confidence interval [CI] 4.5 to 6.8, P < 0.0001). The findings were the same regardless of the order of testing (i.e. alphabetical-categorical vs. categorical - alphabetical) and participants' years of clinical experience. Most anesthesia providers made no (0) errors for most trials (N = 96/120 trials, lower 95% limit 73%, P < 0.0001). There was no difference in error rates between the two formats (P = 0.53). The use of touch-screen user interfaces in healthcare is increasingly common. Arrangement of drugs names in a categorical display format in the medication order-entry touch screen of an AIMS can result in faster data entry compared to an alphabetical arrangement of drugs. Results of this quality improvement project were used in our department's design of our final intraoperative electronic

A discrete exterior approach to structure-preserving discretization of distributed-parameter port-Hamiltonian systems

NARCIS (Netherlands)

Seslija, Marko; Scherpen, Jacquelien M.A.; van der Schaft, Arjan

2011-01-01

This paper addresses the issue of structure-preserving discretization of open distributed-parameter systems with Hamiltonian dynamics. Employing the formalism of discrete exterior calculus, we introduce simplicial Dirac structures as discrete analogues of the Stokes-Dirac structure and demonstrate

Discrete integrable couplings associated with Toda-type lattice and two hierarchies of discrete soliton equations

International Nuclear Information System (INIS)

Zhang Yufeng; Fan Engui; Zhang Yongqing

2006-01-01

With the help of two semi-direct sum Lie algebras, an efficient way to construct discrete integrable couplings is proposed. As its applications, the discrete integrable couplings of the Toda-type lattice equations are obtained. The approach can be devoted to establishing other discrete integrable couplings of the discrete lattice integrable hierarchies of evolution equations

Discrete exterior geometry approach to structure-preserving discretization of distributed-parameter port-Hamiltonian systems

NARCIS (Netherlands)

Seslija, Marko; van der Schaft, Arjan; Scherpen, Jacquelien M.A.

This paper addresses the issue of structure-preserving discretization of open distributed-parameter systems with Hamiltonian dynamics. Employing the formalism of discrete exterior calculus, we introduce a simplicial Dirac structure as a discrete analogue of the Stokes-Dirac structure and demonstrate

Learning to Write in Braille: An Analysis of Writing Samples from Participants in the Alphabetic Braille and Contracted (ABC) Braille Study

Science.gov (United States)

Erin, Jane N.; Wright, Tessa S.

2011-01-01

This article reports the results of data from 114 writing samples of 39 children who read braille and who were included in the Alphabetic Braille and Contracted Braille (ABC) Study between 2002 and 2005. Writing characteristics, miscues, and composition characteristics are analyzed, and two case studies are included. (Contains 1 box and 2 tables.)

Discrete Mathematics

DEFF Research Database (Denmark)

Sørensen, John Aasted

2010-01-01

The introduction of the mathematics needed for analysis, design and verification of discrete systems, including applications within programming languages for computer systems. Course sessions and project work. Semester: Spring 2010 Ectent: 5 ects Class size: 18......The introduction of the mathematics needed for analysis, design and verification of discrete systems, including applications within programming languages for computer systems. Course sessions and project work. Semester: Spring 2010 Ectent: 5 ects Class size: 18...

Discrete Mathematics

DEFF Research Database (Denmark)

Sørensen, John Aasted

2010-01-01

The introduction of the mathematics needed for analysis, design and verification of discrete systems, including applications within programming languages for computer systems. Course sessions and project work. Semester: Autumn 2010 Ectent: 5 ects Class size: 15......The introduction of the mathematics needed for analysis, design and verification of discrete systems, including applications within programming languages for computer systems. Course sessions and project work. Semester: Autumn 2010 Ectent: 5 ects Class size: 15...

Two new discrete integrable systems

International Nuclear Information System (INIS)

Chen Xiao-Hong; Zhang Hong-Qing

2013-01-01

In this paper, we focus on the construction of new (1+1)-dimensional discrete integrable systems according to a subalgebra of loop algebra à 1 . By designing two new (1+1)-dimensional discrete spectral problems, two new discrete integrable systems are obtained, namely, a 2-field lattice hierarchy and a 3-field lattice hierarchy. When deriving the two new discrete integrable systems, we find the generalized relativistic Toda lattice hierarchy and the generalized modified Toda lattice hierarchy. Moreover, we also obtain the Hamiltonian structures of the two lattice hierarchies by means of the discrete trace identity

Space-Time Discrete KPZ Equation

Science.gov (United States)

Cannizzaro, G.; Matetski, K.

2018-03-01

We study a general family of space-time discretizations of the KPZ equation and show that they converge to its solution. The approach we follow makes use of basic elements of the theory of regularity structures (Hairer in Invent Math 198(2):269-504, 2014) as well as its discrete counterpart (Hairer and Matetski in Discretizations of rough stochastic PDEs, 2015. arXiv:1511.06937). Since the discretization is in both space and time and we allow non-standard discretization for the product, the methods mentioned above have to be suitably modified in order to accommodate the structure of the models under study.

Discrete density of states

International Nuclear Information System (INIS)

Aydin, Alhun; Sisman, Altug

2016-01-01

By considering the quantum-mechanically minimum allowable energy interval, we exactly count number of states (NOS) and introduce discrete density of states (DOS) concept for a particle in a box for various dimensions. Expressions for bounded and unbounded continua are analytically recovered from discrete ones. Even though substantial fluctuations prevail in discrete DOS, they're almost completely flattened out after summation or integration operation. It's seen that relative errors of analytical expressions of bounded/unbounded continua rapidly decrease for high NOS values (weak confinement or high energy conditions), while the proposed analytical expressions based on Weyl's conjecture always preserve their lower error characteristic. - Highlights: • Discrete density of states considering minimum energy difference is proposed. • Analytical DOS and NOS formulas based on Weyl conjecture are given. • Discrete DOS and NOS functions are examined for various dimensions. • Relative errors of analytical formulas are much better than the conventional ones.

Poisson hierarchy of discrete strings

International Nuclear Information System (INIS)

Ioannidou, Theodora; Niemi, Antti J.

2016-01-01

The Poisson geometry of a discrete string in three dimensional Euclidean space is investigated. For this the Frenet frames are converted into a spinorial representation, the discrete spinor Frenet equation is interpreted in terms of a transfer matrix formalism, and Poisson brackets are introduced in terms of the spinor components. The construction is then generalised, in a self-similar manner, into an infinite hierarchy of Poisson algebras. As an example, the classical Virasoro (Witt) algebra that determines reparametrisation diffeomorphism along a continuous string, is identified as a particular sub-algebra, in the hierarchy of the discrete string Poisson algebra. - Highlights: • Witt (classical Virasoro) algebra is derived in the case of discrete string. • Infinite dimensional hierarchy of Poisson bracket algebras is constructed for discrete strings. • Spinor representation of discrete Frenet equations is developed.

Poisson hierarchy of discrete strings

Energy Technology Data Exchange (ETDEWEB)

Ioannidou, Theodora, E-mail: ti3@auth.gr [Faculty of Civil Engineering, School of Engineering, Aristotle University of Thessaloniki, 54249, Thessaloniki (Greece); Niemi, Antti J., E-mail: Antti.Niemi@physics.uu.se [Department of Physics and Astronomy, Uppsala University, P.O. Box 803, S-75108, Uppsala (Sweden); Laboratoire de Mathematiques et Physique Theorique CNRS UMR 6083, Fédération Denis Poisson, Université de Tours, Parc de Grandmont, F37200, Tours (France); Department of Physics, Beijing Institute of Technology, Haidian District, Beijing 100081 (China)

2016-01-28

The Poisson geometry of a discrete string in three dimensional Euclidean space is investigated. For this the Frenet frames are converted into a spinorial representation, the discrete spinor Frenet equation is interpreted in terms of a transfer matrix formalism, and Poisson brackets are introduced in terms of the spinor components. The construction is then generalised, in a self-similar manner, into an infinite hierarchy of Poisson algebras. As an example, the classical Virasoro (Witt) algebra that determines reparametrisation diffeomorphism along a continuous string, is identified as a particular sub-algebra, in the hierarchy of the discrete string Poisson algebra. - Highlights: • Witt (classical Virasoro) algebra is derived in the case of discrete string. • Infinite dimensional hierarchy of Poisson bracket algebras is constructed for discrete strings. • Spinor representation of discrete Frenet equations is developed.

Discrete energy formulation of neutron transport theory applied to solving the discrete ordinates equations

International Nuclear Information System (INIS)

Ching, J.; Oblow, E.M.; Goldstein, H.

1976-01-01

An algebraic equivalence between the point-energy and multigroup forms of the Boltzmann transport equation is demonstrated that allows the development of a discrete energy, discrete ordinates method for the solution of radiation transport problems. In the discrete energy method, the group averaging required in the cross-section processing for multigroup calculations is replaced by a faster numerical quadrature scheme capable of generating transfer cross sections describing all the physical processes of interest on a fine point-energy grid. Test calculations in which the discrete energy method is compared with the multigroup method show that, for the same energy grid, the discrete energy method is much faster, although somewhat less accurate, than the multigroup method. However, the accuracy of the discrete energy method increases rapidly as the spacing between energy grid points is decreased, approaching that of multigroup calculations. For problems requiring great detail in the energy spectrum, the discrete energy method is therefore expected to be far more economical than the multigroup technique for equivalent accuracy solutions. This advantage of the point method is demonstrated by application to the study of neutron transport in a thick iron slab

3-D Discrete Analytical Ridgelet Transform

OpenAIRE

Helbert , David; Carré , Philippe; Andrès , Éric

2006-01-01

International audience; In this paper, we propose an implementation of the 3-D Ridgelet transform: the 3-D discrete analytical Ridgelet transform (3-D DART). This transform uses the Fourier strategy for the computation of the associated 3-D discrete Radon transform. The innovative step is the definition of a discrete 3-D transform with the discrete analytical geometry theory by the construction of 3-D discrete analytical lines in the Fourier domain. We propose two types of 3-D discrete lines:...

Discrete fractional calculus

CERN Document Server

Goodrich, Christopher

2015-01-01

This text provides the first comprehensive treatment of the discrete fractional calculus. Experienced researchers will find the text useful as a reference for discrete fractional calculus and topics of current interest. Students who are interested in learning about discrete fractional calculus will find this text to provide a useful starting point. Several exercises are offered at the end of each chapter and select answers have been provided at the end of the book. The presentation of the content is designed to give ample flexibility for potential use in a myriad of courses and for independent study. The novel approach taken by the authors includes a simultaneous treatment of the fractional- and integer-order difference calculus (on a variety of time scales, including both the usual forward and backwards difference operators). The reader will acquire a solid foundation in the classical topics of the discrete calculus while being introduced to exciting recent developments, bringing them to the frontiers of the...

Chaotic properties between the nonintegrable discrete nonlinear Schroedinger equation and a nonintegrable discrete Heisenberg model

International Nuclear Information System (INIS)

Ding Qing

2007-01-01

We prove that the integrable-nonintegrable discrete nonlinear Schroedinger equation (AL-DNLS) introduced by Cai, Bishop and Gronbech-Jensen (Phys. Rev. Lett. 72 591(1994)) is the discrete gauge equivalent to an integrable-nonintegrable discrete Heisenberg model from the geometric point of view. Then we study whether the transmission and bifurcation properties of the AL-DNLS equation are preserved under the action of discrete gauge transformations. Our results reveal that the transmission property of the AL-DNLS equation is completely preserved and the bifurcation property is conditionally preserved to those of the integrable-nonintegrable discrete Heisenberg model

Minimum Energy Control of 2D Positive Continuous-Discrete Linear Systems

Directory of Open Access Journals (Sweden)

Kaczorek Tadeusz

2014-09-01

Full Text Available The minimum energy control problem for the 2D positive continuous-discrete linear systems is formulated and solved. Necessary and sufficient conditions for the reachability at the point of the systems are given. Sufficient conditions for the existence of solution to the problem are established. It is shown that if the system is reachable then there exists an optimal input that steers the state from zero boundary conditions to given final state and minimizing the performance index for only one step (q = 1. A procedure for solving of the problem is proposed and illustrated by a numerical example.

Discrete density of states

Energy Technology Data Exchange (ETDEWEB)

Aydin, Alhun; Sisman, Altug, E-mail: sismanal@itu.edu.tr

2016-03-22

By considering the quantum-mechanically minimum allowable energy interval, we exactly count number of states (NOS) and introduce discrete density of states (DOS) concept for a particle in a box for various dimensions. Expressions for bounded and unbounded continua are analytically recovered from discrete ones. Even though substantial fluctuations prevail in discrete DOS, they're almost completely flattened out after summation or integration operation. It's seen that relative errors of analytical expressions of bounded/unbounded continua rapidly decrease for high NOS values (weak confinement or high energy conditions), while the proposed analytical expressions based on Weyl's conjecture always preserve their lower error characteristic. - Highlights: • Discrete density of states considering minimum energy difference is proposed. • Analytical DOS and NOS formulas based on Weyl conjecture are given. • Discrete DOS and NOS functions are examined for various dimensions. • Relative errors of analytical formulas are much better than the conventional ones.

Homogenization of discrete media

International Nuclear Information System (INIS)

Pradel, F.; Sab, K.

1998-01-01

Material such as granular media, beam assembly are easily seen as discrete media. They look like geometrical points linked together thanks to energetic expressions. Our purpose is to extend discrete kinematics to the one of an equivalent continuous material. First we explain how we build the localisation tool for periodic materials according to estimated continuum medium type (classical Cauchy, and Cosserat media). Once the bridge built between discrete and continuum media, we exhibit its application over two bidimensional beam assembly structures : the honey comb and a structural reinforced variation. The new behavior is then applied for the simple plan shear problem in a Cosserat continuum and compared with the real discrete solution. By the mean of this example, we establish the agreement of our new model with real structures. The exposed method has a longer range than mechanics and can be applied to every discrete problems like electromagnetism in which relationship between geometrical points can be summed up by an energetic function. (orig.)

Homogenization of discrete media

Energy Technology Data Exchange (ETDEWEB)

Pradel, F.; Sab, K. [CERAM-ENPC, Marne-la-Vallee (France)

1998-11-01

Material such as granular media, beam assembly are easily seen as discrete media. They look like geometrical points linked together thanks to energetic expressions. Our purpose is to extend discrete kinematics to the one of an equivalent continuous material. First we explain how we build the localisation tool for periodic materials according to estimated continuum medium type (classical Cauchy, and Cosserat media). Once the bridge built between discrete and continuum media, we exhibit its application over two bidimensional beam assembly structures : the honey comb and a structural reinforced variation. The new behavior is then applied for the simple plan shear problem in a Cosserat continuum and compared with the real discrete solution. By the mean of this example, we establish the agreement of our new model with real structures. The exposed method has a longer range than mechanics and can be applied to every discrete problems like electromagnetism in which relationship between geometrical points can be summed up by an energetic function. (orig.) 7 refs.

Fourier-Based Transmit Beampattern Design Using MIMO Radar

KAUST Repository

Lipor, John; Ahmed, Sajid; Alouini, Mohamed-Slim

2014-01-01

a constant-envelope or drawing from a finite alphabet. In this paper, a closed-form method to design for a uniform linear array is proposed that utilizes the discrete Fourier transform (DFT) coefficients and Toeplitz matrices. The resulting

Understanding of the Alphabetic Principle through Invented Spelling among Hearing-Impaired Children Learning to Read and Write: Experimentation with a Pedagogical Approach

Science.gov (United States)

Sirois, Pauline; Boisclair, Andree; Giasson, Jocelyne

2008-01-01

Given the problems experienced by hearing-impaired individuals in learning the written language, a pedagogical approach was tested. The study examined the links between the development of representations of alphabetic system and the results in reading and writing of first graders. In the study, there were 31 hearing-impaired children and 25…

Discrete differential geometry. Consistency as integrability

OpenAIRE

Bobenko, Alexander I.; Suris, Yuri B.

2005-01-01

A new field of discrete differential geometry is presently emerging on the border between differential and discrete geometry. Whereas classical differential geometry investigates smooth geometric shapes (such as surfaces), and discrete geometry studies geometric shapes with finite number of elements (such as polyhedra), the discrete differential geometry aims at the development of discrete equivalents of notions and methods of smooth surface theory. Current interest in this field derives not ...

Advances in discrete differential geometry

CERN Document Server

2016-01-01

This is one of the first books on a newly emerging field of discrete differential geometry and an excellent way to access this exciting area. It surveys the fascinating connections between discrete models in differential geometry and complex analysis, integrable systems and applications in computer graphics. The authors take a closer look at discrete models in differential geometry and dynamical systems. Their curves are polygonal, surfaces are made from triangles and quadrilaterals, and time is discrete. Nevertheless, the difference between the corresponding smooth curves, surfaces and classical dynamical systems with continuous time can hardly be seen. This is the paradigm of structure-preserving discretizations. Current advances in this field are stimulated to a large extent by its relevance for computer graphics and mathematical physics. This book is written by specialists working together on a common research project. It is about differential geometry and dynamical systems, smooth and discrete theories, ...

Discrete elements method of neutron transport

International Nuclear Information System (INIS)

Mathews, K.A.

1988-01-01

In this paper a new neutron transport method, called discrete elements (L N ) is derived and compared to discrete ordinates methods, theoretically and by numerical experimentation. The discrete elements method is based on discretizing the Boltzmann equation over a set of elements of angle. The discrete elements method is shown to be more cost-effective than discrete ordinates, in terms of accuracy versus execution time and storage, for the cases tested. In a two-dimensional test case, a vacuum duct in a shield, the L N method is more consistently convergent toward a Monte Carlo benchmark solution

Syllable frequency and word frequency effects in spoken and written word production in a non-alphabetic script

Directory of Open Access Journals (Sweden)

Qingfang eZhang

2014-02-01

Full Text Available The effects of word frequency and syllable frequency are well-established phenomena in domain such as spoken production in alphabetic languages. Chinese, as a non-alphabetic language, presents unique lexical and phonological properties in speech production. For example, the proximate unit of phonological encoding is syllable in Chinese but segments in Dutch, French or English. The present study investigated the effects of word frequency and syllable frequency, and their interaction in Chinese written and spoken production. Significant facilitatory word frequency and syllable frequency effects were observed in spoken as well as in written production. The syllable frequency effect in writing indicated that phonological properties (i.e., syllabic frequency constrain orthographic output via a lexical route, at least, in Chinese written production. However, the syllable frequency effect over repetitions was divergent in both modalities: it was significant in the former two repetitions in spoken whereas it was significant in the second repetition only in written. Due to the fragility of the syllable frequency effect in writing, we suggest that the phonological influence in handwritten production is not mandatory and universal, and it is modulated by experimental manipulations. This provides evidence for the orthographic autonomy hypothesis, rather than the phonological mediation hypothesis. The absence of an interaction between word frequency and syllable frequency showed that the syllable frequency effect is independent of the word frequency effect in spoken and written output modalities. The implications of these results on written production models are discussed.

Discrete Sparse Coding.

Science.gov (United States)

Exarchakis, Georgios; Lücke, Jörg

2017-11-01

Sparse coding algorithms with continuous latent variables have been the subject of a large number of studies. However, discrete latent spaces for sparse coding have been largely ignored. In this work, we study sparse coding with latents described by discrete instead of continuous prior distributions. We consider the general case in which the latents (while being sparse) can take on any value of a finite set of possible values and in which we learn the prior probability of any value from data. This approach can be applied to any data generated by discrete causes, and it can be applied as an approximation of continuous causes. As the prior probabilities are learned, the approach then allows for estimating the prior shape without assuming specific functional forms. To efficiently train the parameters of our probabilistic generative model, we apply a truncated expectation-maximization approach (expectation truncation) that we modify to work with a general discrete prior. We evaluate the performance of the algorithm by applying it to a variety of tasks: (1) we use artificial data to verify that the algorithm can recover the generating parameters from a random initialization, (2) use image patches of natural images and discuss the role of the prior for the extraction of image components, (3) use extracellular recordings of neurons to present a novel method of analysis for spiking neurons that includes an intuitive discretization strategy, and (4) apply the algorithm on the task of encoding audio waveforms of human speech. The diverse set of numerical experiments presented in this letter suggests that discrete sparse coding algorithms can scale efficiently to work with realistic data sets and provide novel statistical quantities to describe the structure of the data.

A paradigm for discrete physics

International Nuclear Information System (INIS)

Noyes, H.P.; McGoveran, D.; Etter, T.; Manthey, M.J.; Gefwert, C.

1987-01-01

An example is outlined for constructing a discrete physics using as a starting point the insight from quantum physics that events are discrete, indivisible and non-local. Initial postulates are finiteness, discreteness, finite computability, absolute nonuniqueness (i.e., homogeneity in the absence of specific cause) and additivity

Alphabet Writing and Allograph Selection as Predictors of Spelling in Sentences Written by Spanish-Speaking Children Who Are Poor or Good Keyboarders

Science.gov (United States)

Peake, Christian; Diaz, Alicia; Artiles, Ceferino

2017-01-01

This study examined the relationship and degree of predictability that the fluency of writing the alphabet from memory and the selection of allographs have on measures of fluency and accuracy of spelling in a free-writing sentence task when keyboarding. The "Test Estandarizado para la Evaluación de la Escritura con Teclado"…

Discrete-Event Simulation

Directory of Open Access Journals (Sweden)

Prateek Sharma

2015-04-01

Full Text Available Abstract Simulation can be regarded as the emulation of the behavior of a real-world system over an interval of time. The process of simulation relies upon the generation of the history of a system and then analyzing that history to predict the outcome and improve the working of real systems. Simulations can be of various kinds but the topic of interest here is one of the most important kind of simulation which is Discrete-Event Simulation which models the system as a discrete sequence of events in time. So this paper aims at introducing about Discrete-Event Simulation and analyzing how it is beneficial to the real world systems.

Discrete breathers for a discrete nonlinear Schrödinger ring coupled to a central site.

Science.gov (United States)

Jason, Peter; Johansson, Magnus

2016-01-01

We examine the existence and properties of certain discrete breathers for a discrete nonlinear Schrödinger model where all but one site are placed in a ring and coupled to the additional central site. The discrete breathers we focus on are stationary solutions mainly localized on one or a few of the ring sites and possibly also the central site. By numerical methods, we trace out and study the continuous families the discrete breathers belong to. Our main result is the discovery of a split bifurcation at a critical value of the coupling between neighboring ring sites. Below this critical value, families form closed loops in a certain parameter space, implying that discrete breathers with and without central-site occupation belong to the same family. Above the split bifurcation the families split up into several separate ones, which bifurcate with solutions with constant ring amplitudes. For symmetry reasons, the families have different properties below the split bifurcation for even and odd numbers of sites. It is also determined under which conditions the discrete breathers are linearly stable. The dynamics of some simpler initial conditions that approximate the discrete breathers are also studied and the parameter regimes where the dynamics remain localized close to the initially excited ring site are related to the linear stability of the exact discrete breathers.

Models for discrete-time self-similar vector processes with application to network traffic

Science.gov (United States)

Lee, Seungsin; Rao, Raghuveer M.; Narasimha, Rajesh

2003-07-01

The paper defines self-similarity for vector processes by employing the discrete-time continuous-dilation operation which has successfully been used previously by the authors to define 1-D discrete-time stochastic self-similar processes. To define self-similarity of vector processes, it is required to consider the cross-correlation functions between different 1-D processes as well as the autocorrelation function of each constituent 1-D process in it. System models to synthesize self-similar vector processes are constructed based on the definition. With these systems, it is possible to generate self-similar vector processes from white noise inputs. An important aspect of the proposed models is that they can be used to synthesize various types of self-similar vector processes by choosing proper parameters. Additionally, the paper presents evidence of vector self-similarity in two-channel wireless LAN data and applies the aforementioned systems to simulate the corresponding network traffic traces.

Discrete dynamics versus analytic dynamics

DEFF Research Database (Denmark)

Toxværd, Søren

2014-01-01

For discrete classical Molecular dynamics obtained by the “Verlet” algorithm (VA) with the time increment h there exists a shadow Hamiltonian H˜ with energy E˜(h) , for which the discrete particle positions lie on the analytic trajectories for H˜ . Here, we proof that there, independent...... of such an analytic analogy, exists an exact hidden energy invariance E * for VA dynamics. The fact that the discrete VA dynamics has the same invariances as Newtonian dynamics raises the question, which of the formulations that are correct, or alternatively, the most appropriate formulation of classical dynamics....... In this context the relation between the discrete VA dynamics and the (general) discrete dynamics investigated by Lee [Phys. Lett. B122, 217 (1983)] is presented and discussed....

L{sup 1} group consensus of multi-agent systems with switching topologies and stochastic inputs

Energy Technology Data Exchange (ETDEWEB)

Shang, Yilun, E-mail: shylmath@hotmail.com [Institute for Cyber Security, University of Texas at San Antonio, TX 78249 (United States); SUTD-MIT International Design Center, Singapore University of Technology and Design, Singapore 138682 (Singapore)

2013-10-01

Understanding how interacting subsystems of an overall system lead to cluster/group consensus is a key issue in the investigation of multi-agent systems. In this Letter, we study the L{sup 1} group consensus problem of discrete-time multi-agent systems with external stochastic inputs. Based on ergodicity theory and matrix analysis, L{sup 1} group consensus criteria are obtained for multi-agent systems with switching topologies. Some numerical examples are provided to illustrate the effectiveness and feasibility of the theoretical results.

The Effectiveness of Using Augmented Reality Apps in Teaching the English Alphabet to Kindergarten Children: A Case Study in the State of Kuwait

Science.gov (United States)

Safar, Ammar H.; Al-Jafar, Ali A.; Al-Yousefi, Zainab H.

2017-01-01

This experimental research study scrutinized the effectiveness of using augmented reality (AR) applications (apps) as a teaching and learning tool when instructing kindergarten children in the English alphabet in the State of Kuwait. The study compared two groups: (a) experimental, taught using AR apps, and (b) control, taught using traditional…

3-D discrete analytical ridgelet transform.

Science.gov (United States)

Helbert, David; Carré, Philippe; Andres, Eric

2006-12-01

In this paper, we propose an implementation of the 3-D Ridgelet transform: the 3-D discrete analytical Ridgelet transform (3-D DART). This transform uses the Fourier strategy for the computation of the associated 3-D discrete Radon transform. The innovative step is the definition of a discrete 3-D transform with the discrete analytical geometry theory by the construction of 3-D discrete analytical lines in the Fourier domain. We propose two types of 3-D discrete lines: 3-D discrete radial lines going through the origin defined from their orthogonal projections and 3-D planes covered with 2-D discrete line segments. These discrete analytical lines have a parameter called arithmetical thickness, allowing us to define a 3-D DART adapted to a specific application. Indeed, the 3-D DART representation is not orthogonal, It is associated with a flexible redundancy factor. The 3-D DART has a very simple forward/inverse algorithm that provides an exact reconstruction without any iterative method. In order to illustrate the potentiality of this new discrete transform, we apply the 3-D DART and its extension to the Local-DART (with smooth windowing) to the denoising of 3-D image and color video. These experimental results show that the simple thresholding of the 3-D DART coefficients is efficient.

Analysis of Discrete Mittag - Leffler Functions

Directory of Open Access Journals (Sweden)

N. Shobanadevi

2015-03-01

Full Text Available Discrete Mittag - Leffler functions play a major role in the development of the theory of discrete fractional calculus. In the present article, we analyze qualitative properties of discrete Mittag - Leffler functions and establish sufficient conditions for convergence, oscillation and summability of the infinite series associated with discrete Mittag - Leffler functions.

Difference Discrete Variational Principles, Euler-Lagrange Cohomology and Symplectic, Multisymplectic Structures I: Difference Discrete Variational Principle

Institute of Scientific and Technical Information of China (English)

GUO Han-Ying,; LI Yu-Qi; WU Ke1; WANG Shi-Kun

2002-01-01

In this first paper of a series, we study the difference discrete variational principle in the framework of multi-parameter differential approach by regarding the forward difference as an entire geometric object in view of noncommutative differential geometry. Regarding the difference as an entire geometric object, the difference discrete version of Legendre transformation can be introduced. By virtue of this variational principle, we can discretely deal with the variation problems in both the Lagrangian and Hamiltonian formalisms to get difference discrete Euler-Lagrange equations and canonical ones for the difference discrete versions of the classical mechanics and classical field theory.

Discrete mechanics

CERN Document Server

Caltagirone, Jean-Paul

2014-01-01

This book presents the fundamental principles of mechanics to re-establish the equations of Discrete Mechanics. It introduces physics and thermodynamics associated to the physical modeling.  The development and the complementarity of sciences lead to review today the old concepts that were the basis for the development of continuum mechanics. The differential geometry is used to review the conservation laws of mechanics. For instance, this formalism requires a different location of vector and scalar quantities in space. The equations of Discrete Mechanics form a system of equations where the H

Discrete mechanics

International Nuclear Information System (INIS)

Lee, T.D.

1985-01-01

This paper reviews the role of time throughout all phases of mechanics: classical mechanics, non-relativistic quantum mechanics, and relativistic quantum theory. As an example of the relativistic quantum field theory, the case of a massless scalar field interacting with an arbitrary external current is discussed. The comparison between the new discrete theory and the usual continuum formalism is presented. An example is given of a two-dimensional random lattice and its duel. The author notes that there is no evidence that the discrete mechanics is more appropriate than the usual continuum mechanics

SA-Search: a web tool for protein structure mining based on a Structural Alphabet.

Science.gov (United States)

Guyon, Frédéric; Camproux, Anne-Claude; Hochez, Joëlle; Tufféry, Pierre

2004-07-01

SA-Search is a web tool that can be used to mine for protein structures and extract structural similarities. It is based on a hidden Markov model derived Structural Alphabet (SA) that allows the compression of three-dimensional (3D) protein conformations into a one-dimensional (1D) representation using a limited number of prototype conformations. Using such a representation, classical methods developed for amino acid sequences can be employed. Currently, SA-Search permits the performance of fast 3D similarity searches such as the extraction of exact words using a suffix tree approach, and the search for fuzzy words viewed as a simple 1D sequence alignment problem. SA-Search is available at http://bioserv.rpbs.jussieu.fr/cgi-bin/SA-Search.

Reinforcement-learning-based output-feedback control of nonstrict nonlinear discrete-time systems with application to engine emission control.

Science.gov (United States)

Shih, Peter; Kaul, Brian C; Jagannathan, Sarangapani; Drallmeier, James A

2009-10-01

A novel reinforcement-learning-based output adaptive neural network (NN) controller, which is also referred to as the adaptive-critic NN controller, is developed to deliver the desired tracking performance for a class of nonlinear discrete-time systems expressed in nonstrict feedback form in the presence of bounded and unknown disturbances. The adaptive-critic NN controller consists of an observer, a critic, and two action NNs. The observer estimates the states and output, and the two action NNs provide virtual and actual control inputs to the nonlinear discrete-time system. The critic approximates a certain strategic utility function, and the action NNs minimize the strategic utility function and control inputs. All NN weights adapt online toward minimization of a performance index, utilizing the gradient-descent-based rule, in contrast with iteration-based adaptive-critic schemes. Lyapunov functions are used to show the stability of the closed-loop tracking error, weights, and observer estimates. Separation and certainty equivalence principles, persistency of excitation condition, and linearity in the unknown parameter assumption are not needed. Experimental results on a spark ignition (SI) engine operating lean at an equivalence ratio of 0.75 show a significant (25%) reduction in cyclic dispersion in heat release with control, while the average fuel input changes by less than 1% compared with the uncontrolled case. Consequently, oxides of nitrogen (NO(x)) drop by 30%, and unburned hydrocarbons drop by 16% with control. Overall, NO(x)'s are reduced by over 80% compared with stoichiometric levels.

Synchronization Techniques in Parallel Discrete Event Simulation

OpenAIRE

Lindén, Jonatan

2018-01-01

Discrete event simulation is an important tool for evaluating system models in many fields of science and engineering. To improve the performance of large-scale discrete event simulations, several techniques to parallelize discrete event simulation have been developed. In parallel discrete event simulation, the work of a single discrete event simulation is distributed over multiple processing elements. A key challenge in parallel discrete event simulation is to ensure that causally dependent ...

Time discretization of the point kinetic equations using matrix exponential method and First-Order Hold

International Nuclear Information System (INIS)

Park, Yujin; Kazantzis, Nikolaos; Parlos, Alexander G.; Chong, Kil To

2013-01-01

Highlights: • Numerical solution for stiff differential equations using matrix exponential method. • The approximation is based on First Order Hold assumption. • Various input examples applied to the point kinetics equations. • The method shows superior useful and effective activity. - Abstract: A system of nonlinear differential equations is derived to model the dynamics of neutron density and the delayed neutron precursors within a point kinetics equation modeling framework for a nuclear reactor. The point kinetic equations are mathematically characterized as stiff, occasionally nonlinear, ordinary differential equations, posing significant challenges when numerical solutions are sought and traditionally resulting in the need for smaller time step intervals within various computational schemes. In light of the above realization, the present paper proposes a new discretization method inspired by system-theoretic notions and technically based on a combination of the matrix exponential method (MEM) and the First-Order Hold (FOH) assumption. Under the proposed time discretization structure, the sampled-data representation of the nonlinear point kinetic system of equations is derived. The performance of the proposed time discretization procedure is evaluated using several case studies with sinusoidal reactivity profiles and multiple input examples (reactivity and neutron source function). It is shown, that by applying the proposed method under a First-Order Hold for the neutron density and the precursor concentrations at each time step interval, the stiffness problem associated with the point kinetic equations can be adequately addressed and resolved. Finally, as evidenced by the aforementioned detailed simulation studies, the proposed method retains its validity and accuracy for a wide range of reactor operating conditions, including large sampling periods dictated by physical and/or technical limitations associated with the current state of sensor and

Discrete gauge symmetries in discrete MSSM-like orientifolds

International Nuclear Information System (INIS)

Ibáñez, L.E.; Schellekens, A.N.; Uranga, A.M.

2012-01-01

Motivated by the necessity of discrete Z N symmetries in the MSSM to insure baryon stability, we study the origin of discrete gauge symmetries from open string sector U(1)'s in orientifolds based on rational conformal field theory. By means of an explicit construction, we find an integral basis for the couplings of axions and U(1) factors for all simple current MIPFs and orientifolds of all 168 Gepner models, a total of 32 990 distinct cases. We discuss how the presence of discrete symmetries surviving as a subgroup of broken U(1)'s can be derived using this basis. We apply this procedure to models with MSSM chiral spectrum, concretely to all known U(3)×U(2)×U(1)×U(1) and U(3)×Sp(2)×U(1)×U(1) configurations with chiral bi-fundamentals, but no chiral tensors, as well as some SU(5) GUT models. We find examples of models with Z 2 (R-parity) and Z 3 symmetries that forbid certain B and/or L violating MSSM couplings. Their presence is however relatively rare, at the level of a few percent of all cases.

Darboux and binary Darboux transformations for discrete integrable systems I. Discrete potential KdV equation

International Nuclear Information System (INIS)

Shi, Ying; Zhang, Da-jun; Nimmo, Jonathan J C

2014-01-01

The Hirota–Miwa equation can be written in ‘nonlinear’ form in two ways: the discrete KP equation and, by using a compatible continuous variable, the discrete potential KP equation. For both systems, we consider the Darboux and binary Darboux transformations, expressed in terms of the continuous variable, and obtain exact solutions in Wronskian and Grammian form. We discuss reductions of both systems to the discrete KdV and discrete potential KdV equation, respectively, and exploit this connection to find the Darboux and binary Darboux transformations and exact solutions of these equations. (paper)

Calibration and statistical techniques for building an interactive screen for learning of alphabets by children

Directory of Open Access Journals (Sweden)

Riby Abraham Boby

2017-05-01

Full Text Available This article focuses on the implementation details of a portable interactive device called Image-projective Desktop Varnamala Trainer. The device uses a projector to produce a virtual display on a flat surface. For enabling interaction, the information about a user’s hand movement is obtained from a single two-dimensional scanning laser range finder in contrast with a camera sensor used in many earlier applications. A generalized calibration process to obtain exact transformation from projected screen coordinate system to sensor coordinate system is proposed in this article and implemented for enabling interaction. This permits production of large interactive displays with minimal cost. Additionally, it makes the entire system portable, that is, display can be produced on any planar surface like floor, tabletop, and so on. The calibration and its performance have been evaluated by varying screen sizes and the number of points used for calibration. The device was successfully calibrated for different screens. A novel learning-based methodology for predicting a user’s behaviour was then realized to improve the system’s performance. This has been experimentally evaluated, and the overall accuracy of prediction was about 96%. An application was then designed for this set-up to improve the learning of alphabets by the children through an interactive audiovisual feedback system. It uses a game-based methodology to help students learn in a fun way. Currently, it has bilingual (Hindi and English user interface to enable learning of alphabets and elementary mathematics. A user survey was conducted after demonstrating it to school children. The survey results are very encouraging. Additionally, a study to ascertain the improvement in the learning outcome of the children was done. The results clearly indicate an improvement in the learning outcome of the children who used the device over those who did not.

Fault location in underground cables using ANFIS nets and discrete wavelet transform

Directory of Open Access Journals (Sweden)

Shimaa Barakat

2014-12-01

Full Text Available This paper presents an accurate algorithm for locating faults in a medium voltage underground power cable using a combination of Adaptive Network-Based Fuzzy Inference System (ANFIS and discrete wavelet transform (DWT. The proposed method uses five ANFIS networks and consists of 2 stages, including fault type classification and exact fault location. In the first part, an ANFIS is used to determine the fault type, applying four inputs, i.e., the maximum detailed energy of three phase and zero sequence currents. Other four ANFIS networks are utilized to pinpoint the faults (one for each fault type. Four inputs, i.e., the maximum detailed energy of three phase and zero sequence currents, are used to train the neuro-fuzzy inference systems in order to accurately locate the faults on the cable. The proposed method is evaluated under different fault conditions such as different fault locations, different fault inception angles and different fault resistances.

Finite Discrete Gabor Analysis

DEFF Research Database (Denmark)

Søndergaard, Peter Lempel

2007-01-01

frequency bands at certain times. Gabor theory can be formulated for both functions on the real line and for discrete signals of finite length. The two theories are largely the same because many aspects come from the same underlying theory of locally compact Abelian groups. The two types of Gabor systems...... can also be related by sampling and periodization. This thesis extends on this theory by showing new results for window construction. It also provides a discussion of the problems associated to discrete Gabor bases. The sampling and periodization connection is handy because it allows Gabor systems...... on the real line to be well approximated by finite and discrete Gabor frames. This method of approximation is especially attractive because efficient numerical methods exists for doing computations with finite, discrete Gabor systems. This thesis presents new algorithms for the efficient computation of finite...

Adaptive Discrete Hypergraph Matching.

Science.gov (United States)

Yan, Junchi; Li, Changsheng; Li, Yin; Cao, Guitao

2018-02-01

This paper addresses the problem of hypergraph matching using higher-order affinity information. We propose a solver that iteratively updates the solution in the discrete domain by linear assignment approximation. The proposed method is guaranteed to converge to a stationary discrete solution and avoids the annealing procedure and ad-hoc post binarization step that are required in several previous methods. Specifically, we start with a simple iterative discrete gradient assignment solver. This solver can be trapped in an -circle sequence under moderate conditions, where is the order of the graph matching problem. We then devise an adaptive relaxation mechanism to jump out this degenerating case and show that the resulting new path will converge to a fixed solution in the discrete domain. The proposed method is tested on both synthetic and real-world benchmarks. The experimental results corroborate the efficacy of our method.

Principles of discrete time mechanics

CERN Document Server

Jaroszkiewicz, George

2014-01-01

Could time be discrete on some unimaginably small scale? Exploring the idea in depth, this unique introduction to discrete time mechanics systematically builds the theory up from scratch, beginning with the historical, physical and mathematical background to the chronon hypothesis. Covering classical and quantum discrete time mechanics, this book presents all the tools needed to formulate and develop applications of discrete time mechanics in a number of areas, including spreadsheet mechanics, classical and quantum register mechanics, and classical and quantum mechanics and field theories. A consistent emphasis on contextuality and the observer-system relationship is maintained throughout.

Discrete Calculus by Analogy

CERN Document Server

Izadi, F A; Bagirov, G

2009-01-01

With its origins stretching back several centuries, discrete calculus is now an increasingly central methodology for many problems related to discrete systems and algorithms. The topics covered here usually arise in many branches of science and technology, especially in discrete mathematics, numerical analysis, statistics and probability theory as well as in electrical engineering, but our viewpoint here is that these topics belong to a much more general realm of mathematics; namely calculus and differential equations because of the remarkable analogy of the subject to this branch of mathemati

Discrete integrable systems and hodograph transformations arising from motions of discrete plane curves

International Nuclear Information System (INIS)

Feng Baofeng; Maruno, Ken-ichi; Inoguchi, Jun-ichi; Kajiwara, Kenji; Ohta, Yasuhiro

2011-01-01

We consider integrable discretizations of some soliton equations associated with the motions of plane curves: the Wadati-Konno-Ichikawa elastic beam equation, the complex Dym equation and the short pulse equation. They are related to the modified KdV or the sine-Gordon equations by the hodograph transformations. Based on the observation that the hodograph transformations are regarded as the Euler-Lagrange transformations of the curve motions, we construct the discrete analogues of the hodograph transformations, which yield integrable discretizations of those soliton equations. (paper)

Modern approaches to discrete curvature

CERN Document Server

Romon, Pascal

2017-01-01

 This book provides a valuable glimpse into discrete curvature, a rich new field of research which blends discrete mathematics, differential geometry, probability and computer graphics. It includes a vast collection of ideas and tools which will offer something new to all interested readers. Discrete geometry has arisen as much as a theoretical development as in response to unforeseen challenges coming from applications. Discrete and continuous geometries have turned out to be intimately connected. Discrete curvature is the key concept connecting them through many bridges in numerous fields: metric spaces, Riemannian and Euclidean geometries, geometric measure theory, topology, partial differential equations, calculus of variations, gradient flows, asymptotic analysis, probability, harmonic analysis, graph theory, etc. In spite of its crucial importance both in theoretical mathematics and in applications, up to now, almost no books have provided a coherent outlook on this emerging field.

Effects of Heat Input on the Mechanical and Metallurgical Characteristics of Tig Welded Incoloy 800Ht Joints

Directory of Open Access Journals (Sweden)

Kumar S. Arun

2017-09-01

Full Text Available This study focuses on the effect of heat input on the quality characteristics of tungsten inert arc gas welded incoloy 800HT joints using inconel-82 filler wire. Butt welding was done on specimens with four different heat inputs by varying the process parameters like welding current and speed. The result indicated that higher heat input levels has led to the formation of coarser grain structure, reduced mechanical properties and sensitization issues on the weldments. The formation of titanium nitrides provided resistance to fracture and increased the tensile strength of the joints at high temperatures. Further aging was done on the welded sample at a temperature of 750°C for 500 hours and the metallographic result showed formation of carbides along the grain boundaries in a chain of discrete and globular form which increased the hardness of the material. The formation of spinel NiCr2O4 provided oxidation resistance to the material during elevated temperature service.

Noether symmetries of discrete mechanico–electrical systems

International Nuclear Information System (INIS)

Fu Jingli; Xie Fengping; Chen Benyong

2008-01-01

This paper focuses on studying Noether symmetries and conservation laws of the discrete mechanico-electrical systems with the nonconservative and the dissipative forces. Based on the invariance of discrete Hamilton action of the systems under the infinitesimal transformation with respect to the generalized coordinates, the generalized electrical quantities and time, it presents the discrete analogue of variational principle, the discrete analogue of Lagrange–Maxwell equations, the discrete analogue of Noether theorems for Lagrange–Maxwell and Lagrange mechanico-electrical systems. Also, the discrete Noether operator identity and the discrete Noether-type conservation laws are obtained for these systems. An actual example is given to illustrate these results. (general)

The colors of the alphabet: naturally-biased associations between shape and color.

Science.gov (United States)

Spector, Ferrinne; Maurer, Daphne

2011-04-01

Many letters of the alphabet are consistently mapped to specific colors in English-speaking adults, both in the general population and in individuals with grapheme-color synaesthesia who perceive letters in color. Here, across six experiments, we tested the ubiquity of the color/letter associations with typically developing toddlers, literate children, and adults. We found that pre-literate children associate O with white and X with black and discovered that they also associate I and ameboid nonsense shapes with white; Z and jagged nonsense shapes with black; and C with yellow; but do not make a number of other associations (B blue; Y yellow; A red; G green) seen in literate children and adults. The toddlers' mappings were based on the shape and not the sound of the letter. The results suggest that sensory cortical organization initially binds specific colors to some specific shapes and that learning to read can induce additional associations, likely through the influence of higher order networks as letters take on meaning.

Balinese Alphabet Sebagai Aplikasi Media Pembelajaran Aksara Bali Berbasis Android Mobile Platform

Directory of Open Access Journals (Sweden)

Putu Ary Setiyawan

2016-01-01

Full Text Available Aksara Bali menjadi salah satu kekayaan budaya Bali yang hampir punah walaupun sebagaian besar insitusi pendidikan di Bali telah melakukan pembelajaran Aksara Bali tersebut. Metode pengajaran dapat menjadi salah satu faktor terhadap ketidaktertarikan siswa khususnya anak-anak akan Aksara Bali apabila penyampaian yang diberikan kurang. Media pembelajaran Aksara Balimenjadi solusi yang dikemas berbentuk sebuah aplikasi yang dapat dipasang/di-install pada gadget yang menggunakan sistem operasi Android. Aplikasi ini berfokuskan pada pembelajaran Aksara Bali (mengenal bentuk, bunyi, tulisan, dan merangkai kata serta permainan menggunakan Aksara Bali. Aplikasi Balinese Alphabet telah berjalan sukses pada sistem operasi Android dan termasuk dalam kategori baik sesuai pada hasil yang didapat dari hasil survey dengan rincian penilaian tertinggi dari aspek grafis visual dan audio terletak pada kategori baik dengan persentase sejumlah 47%, sedangkan penilaian tertinggi dari aspek entertainment dan pembelajaran terletak pada kategori baik dengan persentase sejumlah 57%.   Kata Kunci: Media Pembelajaran, Budaya Bali, Aksara Bali, Android.

Exact discretization of Schrödinger equation

Energy Technology Data Exchange (ETDEWEB)

Tarasov, Vasily E., E-mail: tarasov@theory.sinp.msu.ru

2016-01-08

There are different approaches to discretization of the Schrödinger equation with some approximations. In this paper we derive a discrete equation that can be considered as exact discretization of the continuous Schrödinger equation. The proposed discrete equation is an equation with difference of integer order that is represented by infinite series. We suggest differences, which are characterized by power-law Fourier transforms. These differences can be considered as exact discrete analogs of derivatives of integer orders. Physically the suggested discrete equation describes a chain (or lattice) model with long-range interaction of power-law form. Mathematically it is a uniquely highlighted difference equation that exactly corresponds to the continuous Schrödinger equation. Using the Young's inequality for convolution, we prove that suggested differences are operators on the Hilbert space of square-summable sequences. We prove that the wave functions, which are exact discrete analogs of the free particle and harmonic oscillator solutions of the continuous Schrödinger equations, are solutions of the suggested discrete Schrödinger equations. - Highlights: • Exact discretization of the continuous Schrödinger equation is suggested. • New long-range interactions of power-law form are suggested. • Solutions of discrete Schrödinger equation are exact discrete analogs of continuous solutions.

Exact discretization of Schrödinger equation

International Nuclear Information System (INIS)

Tarasov, Vasily E.

2016-01-01

There are different approaches to discretization of the Schrödinger equation with some approximations. In this paper we derive a discrete equation that can be considered as exact discretization of the continuous Schrödinger equation. The proposed discrete equation is an equation with difference of integer order that is represented by infinite series. We suggest differences, which are characterized by power-law Fourier transforms. These differences can be considered as exact discrete analogs of derivatives of integer orders. Physically the suggested discrete equation describes a chain (or lattice) model with long-range interaction of power-law form. Mathematically it is a uniquely highlighted difference equation that exactly corresponds to the continuous Schrödinger equation. Using the Young's inequality for convolution, we prove that suggested differences are operators on the Hilbert space of square-summable sequences. We prove that the wave functions, which are exact discrete analogs of the free particle and harmonic oscillator solutions of the continuous Schrödinger equations, are solutions of the suggested discrete Schrödinger equations. - Highlights: • Exact discretization of the continuous Schrödinger equation is suggested. • New long-range interactions of power-law form are suggested. • Solutions of discrete Schrödinger equation are exact discrete analogs of continuous solutions.

Discrete Localized States and Localization Dynamics in Discrete Nonlinear Schrödinger Equations

DEFF Research Database (Denmark)

Christiansen, Peter Leth; Gaididei, Yu.B.; Mezentsev, V.K.

1996-01-01

Dynamics of two-dimensional discrete structures is studied in the framework of the generalized two-dimensional discrete nonlinear Schrodinger equation. The nonlinear coupling in the form of the Ablowitz-Ladik nonlinearity is taken into account. Stability properties of the stationary solutions...

Discrete event simulation for exploring strategies: an urban water management case.

Science.gov (United States)

Huang, Dong-Bin; Scholz, Roland W; Gujer, Willi; Chitwood, Derek E; Loukopoulos, Peter; Schertenleib, Roland; Siegrist, Hansruedi

2007-02-01

This paper presents a model structure aimed at offering an overview of the various elements of a strategy and exploring their multidimensional effects through time in an efficient way. It treats a strategy as a set of discrete events planned to achieve a certain strategic goal and develops a new form of causal networks as an interfacing component between decision makers and environment models, e.g., life cycle inventory and material flow models. The causal network receives a strategic plan as input in a discrete manner and then outputs the updated parameter sets to the subsequent environmental models. Accordingly, the potential dynamic evolution of environmental systems caused by various strategies can be stepwise simulated. It enables a way to incorporate discontinuous change in models for environmental strategy analysis, and enhances the interpretability and extendibility of a complex model by its cellular constructs. It is exemplified using an urban water management case in Kunming, a major city in Southwest China. By utilizing the presented method, the case study modeled the cross-scale interdependencies of the urban drainage system and regional water balance systems, and evaluated the effectiveness of various strategies for improving the situation of Dianchi Lake.

Observability of discretized partial differential equations

Science.gov (United States)

Cohn, Stephen E.; Dee, Dick P.

1988-01-01

It is shown that complete observability of the discrete model used to assimilate data from a linear partial differential equation (PDE) system is necessary and sufficient for asymptotic stability of the data assimilation process. The observability theory for discrete systems is reviewed and applied to obtain simple observability tests for discretized constant-coefficient PDEs. Examples are used to show how numerical dispersion can result in discrete dynamics with multiple eigenvalues, thereby detracting from observability.

Discrete Mathematics Re "Tooled."

Science.gov (United States)

Grassl, Richard M.; Mingus, Tabitha T. Y.

1999-01-01

Indicates the importance of teaching discrete mathematics. Describes how the use of technology can enhance the teaching and learning of discrete mathematics. Explorations using Excel, Derive, and the TI-92 proved how preservice and inservice teachers experienced a new dimension in problem solving and discovery. (ASK)

Euler-Poincare reduction for discrete field theories

International Nuclear Information System (INIS)

Vankerschaver, Joris

2007-01-01

In this note, we develop a theory of Euler-Poincare reduction for discrete Lagrangian field theories. We introduce the concept of Euler-Poincare equations for discrete field theories, as well as a natural extension of the Moser-Veselov scheme, and show that both are equivalent. The resulting discrete field equations are interpreted in terms of discrete differential geometry. An application to the theory of discrete harmonic mappings is also briefly discussed

Positivity for Convective Semi-discretizations

KAUST Repository

Fekete, Imre

2017-04-19

We propose a technique for investigating stability properties like positivity and forward invariance of an interval for method-of-lines discretizations, and apply the technique to study positivity preservation for a class of TVD semi-discretizations of 1D scalar hyperbolic conservation laws. This technique is a generalization of the approach suggested in Khalsaraei (J Comput Appl Math 235(1): 137–143, 2010). We give more relaxed conditions on the time-step for positivity preservation for slope-limited semi-discretizations integrated in time with explicit Runge–Kutta methods. We show that the step-size restrictions derived are sharp in a certain sense, and that many higher-order explicit Runge–Kutta methods, including the classical 4th-order method and all non-confluent methods with a negative Butcher coefficient, cannot generally maintain positivity for these semi-discretizations under any positive step size. We also apply the proposed technique to centered finite difference discretizations of scalar hyperbolic and parabolic problems.

Integrable discretizations of the short pulse equation

International Nuclear Information System (INIS)

Feng Baofeng; Maruno, Ken-ichi; Ohta, Yasuhiro

2010-01-01

In this paper, we propose integrable semi-discrete and full-discrete analogues of the short pulse (SP) equation. The key construction is the bilinear form and determinant structure of solutions of the SP equation. We also give the determinant formulas of N-soliton solutions of the semi-discrete and full-discrete analogues of the SP equations, from which the multi-loop and multi-breather solutions can be generated. In the continuous limit, the full-discrete SP equation converges to the semi-discrete SP equation, and then to the continuous SP equation. Based on the semi-discrete SP equation, an integrable numerical scheme, i.e. a self-adaptive moving mesh scheme, is proposed and used for the numerical computation of the short pulse equation.

Discrete computational structures

CERN Document Server

Korfhage, Robert R

1974-01-01

Discrete Computational Structures describes discrete mathematical concepts that are important to computing, covering necessary mathematical fundamentals, computer representation of sets, graph theory, storage minimization, and bandwidth. The book also explains conceptual framework (Gorn trees, searching, subroutines) and directed graphs (flowcharts, critical paths, information network). The text discusses algebra particularly as it applies to concentrates on semigroups, groups, lattices, propositional calculus, including a new tabular method of Boolean function minimization. The text emphasize

Neuron recycling for learning the alphabetic principles.

Science.gov (United States)

Scliar-Cabral, Leonor

2014-01-01

The main purpose of this paper is to discuss an approach to the phonic method of learning-teaching early literacy development, namely that the visual neurons must be recycled to recognize the small differences among pertinent letter features. In addition to the challenge of segmenting the speech chain and the syllable for learning the alphabetic principles, neuroscience has demonstrated another major challenge: neurons in mammals are programmed to process visual signals symmetrically. In order to develop early literacy, visual neurons must be recycled to overcome this initial programming together with phonological awareness, expanding it with the ability to delimit words, including clitics, as well as assigning stress to words. To achieve this goal, Scliar's Early Literacy Development System was proposed and tested. Sixteen subjects (10 girls and 6 boys) comprised the experimental group (mean age 6.02 years), and 16 subjects (7 girls and 9 boys) formed the control group (mean age 6.10 years). The research instruments were a psychosociolinguistic questionnaire to reveal the subjects' profile and a post-test battery of tests. At the beginning of the experiment, the experimental group was submitted to an intervention program based on Scliar's Early Literacy Development System. One of the tests is discussed in this paper, the grapheme-phoneme test: subjects had to read aloud a pseudoword with 4 graphemes, signaled by the experimenter and designed to assess the subject's ability to convert a grapheme into its correspondent phoneme. The average value for the test group was 25.0 correct answers (SD = 11.4); the control group had an average of 14.3 correct answers (SD = 10.6): The difference was significant. The experimental results validate Scliar's Early Literacy Development System and indicate the need to redesign early literacy development methods. © 2014 S. Karger AG, Basel.

Discrete integrable systems and deformations of associative algebras

International Nuclear Information System (INIS)

Konopelchenko, B G

2009-01-01

Interrelations between discrete deformations of the structure constants for associative algebras and discrete integrable systems are reviewed. Theory of deformations for associative algebras is presented. Closed left ideal generated by the elements representing the multiplication table plays a central role in this theory. Deformations of the structure constants are generated by the deformation driving algebra and governed by the central system of equations. It is demonstrated that many discrete equations such as discrete Boussinesq equation, discrete WDVV equation, discrete Schwarzian KP and BKP equations, discrete Hirota-Miwa equations for KP and BKP hierarchies are particular realizations of the central system. An interaction between the theories of discrete integrable systems and discrete deformations of associative algebras is reciprocal and fruitful. An interpretation of the Menelaus relation (discrete Schwarzian KP equation), discrete Hirota-Miwa equation for KP hierarchy, consistency around the cube as the associativity conditions and the concept of gauge equivalence, for instance, between the Menelaus and KP configurations are particular examples.

Neuroscience applied to learning alphabetic principles: new proposals

Directory of Open Access Journals (Sweden)

Leonor Scliar-Cabral

2012-12-01

Full Text Available http://dx.doi.org/10.5007/2175-8026.2012n63p187   This study reviews recent data on functional illiteracy and advances on neuroscience about the reading process. alarming figures on functional illiteracy will be presented with examples of UK and brazil. Empirical evidences brought by neuroscience prove the neuropsychological basis constructs, namely invariance already claimed by modern linguistics. however, emphasis will be given to the psychological reality of letters’ feature invariance, demonstrated by various experiments which had been recently run by neuroscientists. two types of invariance are shown, the spatial and the font invariance, exemplified by a description of invariant features of the roman alphabet. We then cite the major difficulties faced at by beginning readers, namely, how to dismember the chain speech into words (separated in the written space by blanks and the syllable into its units, in order to link them to their correspondent graphemes (composed by one or more letters.  in addition, one of the major difficulties is how to teach neurons to dissymmetrize the letter features. neuroscience conclusions from experiments about the readingprocess demonstrate that neurons of the  occipito-temporalventral region of the left hemisphere must be recycled in orderto learn how to recognize the written word.  altogether withthe results obtained on a well succeeded experience run by theprogram Early intervention initiative (Eii and by an experimentrun in a Florianopolis school, in 2012, they give support to thestrategies to prevent functional illiteracy.

Geometry and Hamiltonian mechanics on discrete spaces

International Nuclear Information System (INIS)

Talasila, V; Clemente-Gallardo, J; Schaft, A J van der

2004-01-01

Numerical simulation is often crucial for analysing the behaviour of many complex systems which do not admit analytic solutions. To this end, one either converts a 'smooth' model into a discrete (in space and time) model, or models systems directly at a discrete level. The goal of this paper is to provide a discrete analogue of differential geometry, and to define on these discrete models a formal discrete Hamiltonian structure-in doing so we try to bring together various fundamental concepts from numerical analysis, differential geometry, algebraic geometry, simplicial homology and classical Hamiltonian mechanics. For example, the concept of a twisted derivation is borrowed from algebraic geometry for developing a discrete calculus. The theory is applied to a nonlinear pendulum and we compare the dynamics obtained through a discrete modelling approach with the dynamics obtained via the usual discretization procedures. Also an example of an energy-conserving algorithm on a simple harmonic oscillator is presented, and its effect on the Poisson structure is discussed

Advanced discrete-time control designs and applications

CERN Document Server

Abidi, Khalid

2015-01-01

This book covers a wide spectrum of systems such as linear and nonlinear multivariable systems as well as control problems such as disturbance, uncertainty and time-delays. The purpose of this book is to provide researchers and practitioners a manual for the design and application of advanced discrete-time controllers.  The book presents six different control approaches depending on the type of system and control problem. The first and second approaches are based on Sliding Mode control (SMC) theory and are intended for linear systems with exogenous disturbances. The third and fourth approaches are based on adaptive control theory and are aimed at linear/nonlinear systems with periodically varying parametric uncertainty or systems with input delay. The fifth approach is based on Iterative learning control (ILC) theory and is aimed at uncertain linear/nonlinear systems with repeatable tasks and the final approach is based on fuzzy logic control (FLC) and is intended for highly uncertain systems with heuristi...

A general design strategy for block copolymer directed self-assembly patterning of integrated circuits contact holes using an alphabet approach.

Science.gov (United States)

Yi, He; Bao, Xin-Yu; Tiberio, Richard; Wong, H-S Philip

2015-02-11

Directed self-assembly (DSA) is a promising lithography candidate for technology nodes beyond 14 nm. Researchers have shown contact hole patterning for random logic circuits using DSA with small physical templates. This paper introduces an alphabet approach that uses a minimal set of small physical templates to pattern all contacts configurations on integrated circuits. We illustrate, through experiments, a general and scalable template design strategy that links the DSA material properties to the technology node requirements.

Integrable structure in discrete shell membrane theory.

Science.gov (United States)

Schief, W K

2014-05-08

We present natural discrete analogues of two integrable classes of shell membranes. By construction, these discrete shell membranes are in equilibrium with respect to suitably chosen internal stresses and external forces. The integrability of the underlying equilibrium equations is proved by relating the geometry of the discrete shell membranes to discrete O surface theory. We establish connections with generalized barycentric coordinates and nine-point centres and identify a discrete version of the classical Gauss equation of surface theory.

Model predictive control-based scheduler for repetitive discrete event systems with capacity constraints

Directory of Open Access Journals (Sweden)

Hiroyuki Goto

2013-07-01

Full Text Available A model predictive control-based scheduler for a class of discrete event systems is designed and developed. We focus on repetitive, multiple-input, multiple-output, and directed acyclic graph structured systems on which capacity constraints can be imposed. The target system’s behaviour is described by linear equations in max-plus algebra, referred to as state-space representation. Assuming that the system’s performance can be improved by paying additional cost, we adjust the system parameters and determine control inputs for which the reference output signals can be observed. The main contribution of this research is twofold, 1: For systems with capacity constraints, we derived an output prediction equation as functions of adjustable variables in a recursive form, 2: Regarding the construct for the system’s representation, we improved the structure to accomplish general operations which are essential for adjusting the system parameters. The result of numerical simulation in a later section demonstrates the effectiveness of the developed controller.

Discrete port-Hamiltonian systems : mixed interconnections

NARCIS (Netherlands)

Talasila, Viswanath; Clemente-Gallardo, J.; Schaft, A.J. van der

2005-01-01

Either from a control theoretic viewpoint or from an analysis viewpoint it is necessary to convert smooth systems to discrete systems, which can then be implemented on computers for numerical simulations. Discrete models can be obtained either by discretizing a smooth model, or by directly modeling

Neural networks for tracking of unknown SISO discrete-time nonlinear dynamic systems.

Science.gov (United States)

Aftab, Muhammad Saleheen; Shafiq, Muhammad

2015-11-01

This article presents a Lyapunov function based neural network tracking (LNT) strategy for single-input, single-output (SISO) discrete-time nonlinear dynamic systems. The proposed LNT architecture is composed of two feedforward neural networks operating as controller and estimator. A Lyapunov function based back propagation learning algorithm is used for online adjustment of the controller and estimator parameters. The controller and estimator error convergence and closed-loop system stability analysis is performed by Lyapunov stability theory. Moreover, two simulation examples and one real-time experiment are investigated as case studies. The achieved results successfully validate the controller performance. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

Introductory discrete mathematics

CERN Document Server

Balakrishnan, V K

2010-01-01

This concise text offers an introduction to discrete mathematics for undergraduate students in computer science and mathematics. Mathematics educators consider it vital that their students be exposed to a course in discrete methods that introduces them to combinatorial mathematics and to algebraic and logical structures focusing on the interplay between computer science and mathematics. The present volume emphasizes combinatorics, graph theory with applications to some stand network optimization problems, and algorithms to solve these problems.Chapters 0-3 cover fundamental operations involv

Educational Games for Early Childhood: Using Tabletop Surface Computers for Teaching the Arabic Alphabet

DEFF Research Database (Denmark)

Papadopoulos, Pantelis M.; Ibrahim, Zeinab; Karatsolis, Andreas

2015-01-01

This paper presents initial evaluation regarding the use of simple educational games on tabletop surface computers to teach Kindergarten students in Qatar the Arabic alphabet. This effort is part of the “Arabiyyatii” research project, a 3-year endeavor aimed to teach 5-year-olds Modern Standard...... to the students, along with data collected from system log files and class observations. Result analysis suggests that these kinds of games could be useful in (a) enhancing students’ engagement in language learning, (b) increasing their exposure to MSA, and (c) developing their vocabulary....... Arabic (MSA). The paper describes a naturalistic study design, following the activities of 18 students for a period of 9 weeks in the project. All students were native speakers of the Qatari dialect and they were early users of similar surface technologies. The paper presents three of the games available...

Laplacians on discrete and quantum geometries

International Nuclear Information System (INIS)

Calcagni, Gianluca; Oriti, Daniele; Thürigen, Johannes

2013-01-01

We extend discrete calculus for arbitrary (p-form) fields on embedded lattices to abstract discrete geometries based on combinatorial complexes. We then provide a general definition of discrete Laplacian using both the primal cellular complex and its combinatorial dual. The precise implementation of geometric volume factors is not unique and, comparing the definition with a circumcentric and a barycentric dual, we argue that the latter is, in general, more appropriate because it induces a Laplacian with more desirable properties. We give the expression of the discrete Laplacian in several different sets of geometric variables, suitable for computations in different quantum gravity formalisms. Furthermore, we investigate the possibility of transforming from position to momentum space for scalar fields, thus setting the stage for the calculation of heat kernel and spectral dimension in discrete quantum geometries. (paper)

Cuspidal discrete series for projective hyperbolic spaces

DEFF Research Database (Denmark)

Andersen, Nils Byrial; Flensted-Jensen, Mogens

2013-01-01

Abstract. We have in [1] proposed a definition of cusp forms on semisimple symmetric spaces G/H, involving the notion of a Radon transform and a related Abel transform. For the real non-Riemannian hyperbolic spaces, we showed that there exists an infinite number of cuspidal discrete series......, and at most finitely many non-cuspidal discrete series, including in particular the spherical discrete series. For the projective spaces, the spherical discrete series are the only non-cuspidal discrete series. Below, we extend these results to the other hyperbolic spaces, and we also study the question...

Discrete-Event Simulation

OpenAIRE

Prateek Sharma

2015-01-01

Abstract Simulation can be regarded as the emulation of the behavior of a real-world system over an interval of time. The process of simulation relies upon the generation of the history of a system and then analyzing that history to predict the outcome and improve the working of real systems. Simulations can be of various kinds but the topic of interest here is one of the most important kind of simulation which is Discrete-Event Simulation which models the system as a discrete sequence of ev...

Positivity for Convective Semi-discretizations

KAUST Repository

Fekete, Imre; Ketcheson, David I.; Loczi, Lajos

2017-01-01

We propose a technique for investigating stability properties like positivity and forward invariance of an interval for method-of-lines discretizations, and apply the technique to study positivity preservation for a class of TVD semi-discretizations

Perfect discretization of reparametrization invariant path integrals

International Nuclear Information System (INIS)

Bahr, Benjamin; Dittrich, Bianca; Steinhaus, Sebastian

2011-01-01

To obtain a well-defined path integral one often employs discretizations. In the case of gravity and reparametrization-invariant systems, the latter of which we consider here as a toy example, discretizations generically break diffeomorphism and reparametrization symmetry, respectively. This has severe implications, as these symmetries determine the dynamics of the corresponding system. Indeed we will show that a discretized path integral with reparametrization-invariance is necessarily also discretization independent and therefore uniquely determined by the corresponding continuum quantum mechanical propagator. We use this insight to develop an iterative method for constructing such a discretized path integral, akin to a Wilsonian RG flow. This allows us to address the problem of discretization ambiguities and of an anomaly-free path integral measure for such systems. The latter is needed to obtain a path integral, that can act as a projector onto the physical states, satisfying the quantum constraints. We will comment on implications for discrete quantum gravity models, such as spin foams.

Perfect discretization of reparametrization invariant path integrals

Science.gov (United States)

Bahr, Benjamin; Dittrich, Bianca; Steinhaus, Sebastian

2011-05-01

To obtain a well-defined path integral one often employs discretizations. In the case of gravity and reparametrization-invariant systems, the latter of which we consider here as a toy example, discretizations generically break diffeomorphism and reparametrization symmetry, respectively. This has severe implications, as these symmetries determine the dynamics of the corresponding system. Indeed we will show that a discretized path integral with reparametrization-invariance is necessarily also discretization independent and therefore uniquely determined by the corresponding continuum quantum mechanical propagator. We use this insight to develop an iterative method for constructing such a discretized path integral, akin to a Wilsonian RG flow. This allows us to address the problem of discretization ambiguities and of an anomaly-free path integral measure for such systems. The latter is needed to obtain a path integral, that can act as a projector onto the physical states, satisfying the quantum constraints. We will comment on implications for discrete quantum gravity models, such as spin foams.

Mining protein loops using a structural alphabet and statistical exceptionality

Directory of Open Access Journals (Sweden)

Martin Juliette

2010-02-01

Full Text Available Abstract Background Protein loops encompass 50% of protein residues in available three-dimensional structures. These regions are often involved in protein functions, e.g. binding site, catalytic pocket... However, the description of protein loops with conventional tools is an uneasy task. Regular secondary structures, helices and strands, have been widely studied whereas loops, because they are highly variable in terms of sequence and structure, are difficult to analyze. Due to data sparsity, long loops have rarely been systematically studied. Results We developed a simple and accurate method that allows the description and analysis of the structures of short and long loops using structural motifs without restriction on loop length. This method is based on the structural alphabet HMM-SA. HMM-SA allows the simplification of a three-dimensional protein structure into a one-dimensional string of states, where each state is a four-residue prototype fragment, called structural letter. The difficult task of the structural grouping of huge data sets is thus easily accomplished by handling structural letter strings as in conventional protein sequence analysis. We systematically extracted all seven-residue fragments in a bank of 93000 protein loops and grouped them according to the structural-letter sequence, named structural word. This approach permits a systematic analysis of loops of all sizes since we consider the structural motifs of seven residues rather than complete loops. We focused the analysis on highly recurrent words of loops (observed more than 30 times. Our study reveals that 73% of loop-lengths are covered by only 3310 highly recurrent structural words out of 28274 observed words. These structural words have low structural variability (mean RMSd of 0.85 Å. As expected, half of these motifs display a flanking-region preference but interestingly, two thirds are shared by short (less than 12 residues and long loops. Moreover, half of

Mining protein loops using a structural alphabet and statistical exceptionality.

Science.gov (United States)

Regad, Leslie; Martin, Juliette; Nuel, Gregory; Camproux, Anne-Claude

2010-02-04

Protein loops encompass 50% of protein residues in available three-dimensional structures. These regions are often involved in protein functions, e.g. binding site, catalytic pocket... However, the description of protein loops with conventional tools is an uneasy task. Regular secondary structures, helices and strands, have been widely studied whereas loops, because they are highly variable in terms of sequence and structure, are difficult to analyze. Due to data sparsity, long loops have rarely been systematically studied. We developed a simple and accurate method that allows the description and analysis of the structures of short and long loops using structural motifs without restriction on loop length. This method is based on the structural alphabet HMM-SA. HMM-SA allows the simplification of a three-dimensional protein structure into a one-dimensional string of states, where each state is a four-residue prototype fragment, called structural letter. The difficult task of the structural grouping of huge data sets is thus easily accomplished by handling structural letter strings as in conventional protein sequence analysis. We systematically extracted all seven-residue fragments in a bank of 93000 protein loops and grouped them according to the structural-letter sequence, named structural word. This approach permits a systematic analysis of loops of all sizes since we consider the structural motifs of seven residues rather than complete loops. We focused the analysis on highly recurrent words of loops (observed more than 30 times). Our study reveals that 73% of loop-lengths are covered by only 3310 highly recurrent structural words out of 28274 observed words). These structural words have low structural variability (mean RMSd of 0.85 A). As expected, half of these motifs display a flanking-region preference but interestingly, two thirds are shared by short (less than 12 residues) and long loops. Moreover, half of recurrent motifs exhibit a significant level of

A study of discrete nonlinear systems

International Nuclear Information System (INIS)

Dhillon, H.S.

2001-04-01

An investigation of various spatially discrete time-independent nonlinear models was undertaken. These models are generically applicable to many different physical systems including electron-phonon interactions in solids, magnetic multilayers, layered superconductors and classical lattice systems. To characterise the possible magnetic structures created on magnetic multilayers a model has been formulated and studied. The Euler-Lagrange equation for this model is a discrete version of the Sine-Gordon equation. Solutions of this equation are generated by applying the methods of Chaotic Dynamics - treating the space variable associated with the layer number as a discrete time variable. The states found indicate periodic, quasiperiodic and chaotic structures. Analytic solutions to the discrete nonlinear Schroedinger Equation (DNSE) with cubic nonlinearity are presented in the strong coupling limit. Using these as a starting point, a procedure is developed to determine the wave function and the energy eigenvalue for moderate coupling. The energy eigenvalues of the different structures of the wave function are found to be in excellent agreement with the exact strong coupling result. The solutions to the DNSE indicate commensurate and incommensurate spatial structures associated with different localisation patterns of the wave function. The states which arise may be fractal, periodic, quasiperiodic or chaotic. This work is then extended to solve a first order discrete nonlinear equation. The exact solutions for both the first and second order discrete nonlinear equations with cubic nonlinearity suggests that this method of studying discrete nonlinear equations may be applied to solve discrete equations with any order difference and cubic nonlinearity. (author)

Discrete Curvature Theories and Applications

KAUST Repository

Sun, Xiang

2016-08-25

Discrete Di erential Geometry (DDG) concerns discrete counterparts of notions and methods in di erential geometry. This thesis deals with a core subject in DDG, discrete curvature theories on various types of polyhedral surfaces that are practically important for free-form architecture, sunlight-redirecting shading systems, and face recognition. Modeled as polyhedral surfaces, the shapes of free-form structures may have to satisfy di erent geometric or physical constraints. We study a combination of geometry and physics { the discrete surfaces that can stand on their own, as well as having proper shapes for the manufacture. These proper shapes, known as circular and conical meshes, are closely related to discrete principal curvatures. We study curvature theories that make such surfaces possible. Shading systems of freeform building skins are new types of energy-saving structures that can re-direct the sunlight. From these systems, discrete line congruences across polyhedral surfaces can be abstracted. We develop a new curvature theory for polyhedral surfaces equipped with normal congruences { a particular type of congruences de ned by linear interpolation of vertex normals. The main results are a discussion of various de nitions of normality, a detailed study of the geometry of such congruences, and a concept of curvatures and shape operators associated with the faces of a triangle mesh. These curvatures are compatible with both normal congruences and the Steiner formula. In addition to architecture, we consider the role of discrete curvatures in face recognition. We use geometric measure theory to introduce the notion of asymptotic cones associated with a singular subspace of a Riemannian manifold, which is an extension of the classical notion of asymptotic directions. We get a simple expression of these cones for polyhedral surfaces, as well as convergence and approximation theorems. We use the asymptotic cones as facial descriptors and demonstrate the

Application of a discrete-energy, discrete-ordinates technique to the study of neutron transport in iron

International Nuclear Information System (INIS)

Ching, J.T.

1975-01-01

An algebraic equivalence between the point-energy and multigroup forms of the Boltzmann transport equation is demonstrated which allows the development of a discrete-energy, discrete-ordinates method for the solution of radiation transport problems. The method utilizes a modified version of a cross section processing scheme devised for the moments method code BMT and the transport equation solution algorithm from the one-dimensional discrete-ordinates transport code ANISN. The combined system, identified as MOMANS, computes fluxes directly from point cross sections in a single operation. In the cross-section processing, the group averaging required for multigroup calculations is replaced by a fast numerical scheme capable of generating a set of transfer cross sections containing all the physical features of interest, thereby increasing the detail in the calculated results. Test calculations in which the discrete-energy method was compared with the multigroup method have shown that for the same energy grid (number of points = number of groups), the discrete-energy method is faster but somewhat less accurate than the multigroup method. However, the accuracy of the discrete-energy method increases rapidly as the spacing between energy points is decreased, approaching that of multigroup calculations. For problems requiring great detail in the energy spectrum the discrete-energy method has therefore proven to be as accurate as, and more economical than, the multigroup technique. This was demonstrated by the application of the method to the study of the transport of neutrons in an iron sphere. Using the capability of the discrete-energy method for rapidly treating changes in cross-section sets, the propagation of neutrons from a 14 MeV source in a 22 cm radius sphere of iron was analyzed for sensitivity to changes in the microscopic scattering mechanisms

Compatible Spatial Discretizations for Partial Differential Equations

Energy Technology Data Exchange (ETDEWEB)

Arnold, Douglas, N, ed.

2004-11-25

From May 11--15, 2004, the Institute for Mathematics and its Applications held a hot topics workshop on Compatible Spatial Discretizations for Partial Differential Equations. The numerical solution of partial differential equations (PDE) is a fundamental task in science and engineering. The goal of the workshop was to bring together a spectrum of scientists at the forefront of the research in the numerical solution of PDEs to discuss compatible spatial discretizations. We define compatible spatial discretizations as those that inherit or mimic fundamental properties of the PDE such as topology, conservation, symmetries, and positivity structures and maximum principles. A wide variety of discretization methods applied across a wide range of scientific and engineering applications have been designed to or found to inherit or mimic intrinsic spatial structure and reproduce fundamental properties of the solution of the continuous PDE model at the finite dimensional level. A profusion of such methods and concepts relevant to understanding them have been developed and explored: mixed finite element methods, mimetic finite differences, support operator methods, control volume methods, discrete differential forms, Whitney forms, conservative differencing, discrete Hodge operators, discrete Helmholtz decomposition, finite integration techniques, staggered grid and dual grid methods, etc. This workshop seeks to foster communication among the diverse groups of researchers designing, applying, and studying such methods as well as researchers involved in practical solution of large scale problems that may benefit from advancements in such discretizations; to help elucidate the relations between the different methods and concepts; and to generally advance our understanding in the area of compatible spatial discretization methods for PDE. Particular points of emphasis included: + Identification of intrinsic properties of PDE models that are critical for the fidelity of numerical

Multivariate sensitivity analysis to measure global contribution of input factors in dynamic models

International Nuclear Information System (INIS)

Lamboni, Matieyendou; Monod, Herve; Makowski, David

2011-01-01

Many dynamic models are used for risk assessment and decision support in ecology and crop science. Such models generate time-dependent model predictions, with time either discretised or continuous. Their global sensitivity analysis is usually applied separately on each time output, but Campbell et al. (2006 ) advocated global sensitivity analyses on the expansion of the dynamics in a well-chosen functional basis. This paper focuses on the particular case when principal components analysis is combined with analysis of variance. In addition to the indices associated with the principal components, generalised sensitivity indices are proposed to synthesize the influence of each parameter on the whole time series output. Index definitions are given when the uncertainty on the input factors is either discrete or continuous and when the dynamic model is either discrete or functional. A general estimation algorithm is proposed, based on classical methods of global sensitivity analysis. The method is applied to a dynamic wheat crop model with 13 uncertain parameters. Three methods of global sensitivity analysis are compared: the Sobol'-Saltelli method, the extended FAST method, and the fractional factorial design of resolution 6.

Multivariate sensitivity analysis to measure global contribution of input factors in dynamic models

Energy Technology Data Exchange (ETDEWEB)

Lamboni, Matieyendou [INRA, Unite MIA (UR341), F78352 Jouy en Josas Cedex (France); Monod, Herve, E-mail: herve.monod@jouy.inra.f [INRA, Unite MIA (UR341), F78352 Jouy en Josas Cedex (France); Makowski, David [INRA, UMR Agronomie INRA/AgroParisTech (UMR 211), BP 01, F78850 Thiverval-Grignon (France)

2011-04-15

Many dynamic models are used for risk assessment and decision support in ecology and crop science. Such models generate time-dependent model predictions, with time either discretised or continuous. Their global sensitivity analysis is usually applied separately on each time output, but Campbell et al. (2006) advocated global sensitivity analyses on the expansion of the dynamics in a well-chosen functional basis. This paper focuses on the particular case when principal components analysis is combined with analysis of variance. In addition to the indices associated with the principal components, generalised sensitivity indices are proposed to synthesize the influence of each parameter on the whole time series output. Index definitions are given when the uncertainty on the input factors is either discrete or continuous and when the dynamic model is either discrete or functional. A general estimation algorithm is proposed, based on classical methods of global sensitivity analysis. The method is applied to a dynamic wheat crop model with 13 uncertain parameters. Three methods of global sensitivity analysis are compared: the Sobol'-Saltelli method, the extended FAST method, and the fractional factorial design of resolution 6.

Cutaneous and periodontal inputs to the cerebellum of the naked mole-rat (Heterocephalus glaber).

Science.gov (United States)

Sarko, Diana K; Leitch, Duncan B; Catania, Kenneth C

2013-01-01

The naked mole-rat (Heterocephalus glaber) is a small fossorial rodent with specialized dentition that is reflected by the large cortical area dedicated to representation of the prominent incisors. Due to naked mole-rats' behavioral reliance on the incisors for digging and for manipulating objects, as well as their ability to move the lower incisors independently, we hypothesized that expanded somatosensory representations of the incisors would be present within the cerebellum in order to accommodate a greater degree of proprioceptive, cutaneous, and periodontal input. Multiunit electrophysiological recordings targeting the ansiform lobule were used to investigate tactile inputs from receptive fields on the entire body with a focus on the incisors. Similar to other rodents, a fractured somatotopy appeared to be present with discrete representations of the same receptive fields repeated within each folium of the cerebellum. These findings confirm the presence of somatosensory inputs to a large area of the naked mole-rat cerebellum with particularly extensive representations of the lower incisors and mystacial vibrissae. We speculate that these extensive inputs facilitate processing of tactile cues as part of a sensorimotor integration network that optimizes how sensory stimuli are acquired through active exploration and in turn adjusts motor outputs (such as independent movement of the lower incisors). These results highlight the diverse sensory specializations and corresponding brain organizational schemes that have evolved in different mammals to facilitate exploration of and interaction with their environment.

Cutaneous and periodontal inputs to the cerebellum of the naked mole-rat (Heterocephalus glaber

Directory of Open Access Journals (Sweden)

Diana K Sarko

2013-11-01

Full Text Available The naked mole-rat (Heterocephalus glaber is a small fossorial rodent with specialized dentition that is reflected by the large cortical area dedicated to representation of the prominent incisors. Due to naked mole-rats’ behavioral reliance on the incisors for digging and for manipulating objects, as well as their ability to move the lower incisors independently, we hypothesized that expanded somatosensory representations of the incisors would be present within the cerebellum in order to accommodate a greater degree of proprioceptive, cutaneous, and periodontal input. Multiunit electrophysiological recordings targeting the ansiform lobule were used to investigate tactile inputs from receptive fields on the entire body with a focus on the incisors. Similar to other rodents, a fractured somatotopy appeared to be present with discrete representations of the same receptive fields repeated within each folium of the cerebellum. These findings confirm the presence of somatosensory inputs to a large area of the naked mole-rat cerebellum with particularly extensive representations of the lower incisors and mystacial vibrissae. We speculate that these extensive inputs facilitate processing of tactile cues as part of a sensorimotor integration network that optimizes how sensory stimuli are acquired through active exploration and in turn adjusts motor outputs (such as independent movement of the lower incisors. These results highlight the diverse sensory specializations and corresponding brain organizational schemes that have evolved in different mammals to facilitate exploration of and interaction with their environment.

Perfect discretization of path integrals

International Nuclear Information System (INIS)

Steinhaus, Sebastian

2012-01-01

In order to obtain a well-defined path integral one often employs discretizations. In the case of General Relativity these generically break diffeomorphism symmetry, which has severe consequences since these symmetries determine the dynamics of the corresponding system. In this article we consider the path integral of reparametrization invariant systems as a toy example and present an improvement procedure for the discretized propagator. Fixed points and convergence of the procedure are discussed. Furthermore we show that a reparametrization invariant path integral implies discretization independence and acts as a projector onto physical states.

Perfect discretization of path integrals

Science.gov (United States)

Steinhaus, Sebastian

2012-05-01

In order to obtain a well-defined path integral one often employs discretizations. In the case of General Relativity these generically break diffeomorphism symmetry, which has severe consequences since these symmetries determine the dynamics of the corresponding system. In this article we consider the path integral of reparametrization invariant systems as a toy example and present an improvement procedure for the discretized propagator. Fixed points and convergence of the procedure are discussed. Furthermore we show that a reparametrization invariant path integral implies discretization independence and acts as a projector onto physical states.

Effects of task-switching on neural representations of ambiguous sound input.

Science.gov (United States)

Sussman, Elyse S; Bregman, Albert S; Lee, Wei-Wei

2014-11-01

The ability to perceive discrete sound streams in the presence of competing sound sources relies on multiple mechanisms that organize the mixture of the auditory input entering the ears. Many studies have focused on mechanisms that contribute to integrating sounds that belong together into one perceptual stream (integration) and segregating those that come from different sound sources (segregation). However, little is known about mechanisms that allow us to perceive individual sound sources within a dynamically changing auditory scene, when the input may be ambiguous, and heard as either integrated or segregated. This study tested the question of whether focusing on one of two possible sound organizations suppressed representation of the alternative organization. We presented listeners with ambiguous input and cued them to switch between tasks that used either the integrated or the segregated percept. Electrophysiological measures indicated which organization was currently maintained in memory. If mutual exclusivity at the neural level was the rule, attention to one of two possible organizations would preclude neural representation of the other. However, significant MMNs were elicited to both the target organization and the unattended, alternative organization, along with the target-related P3b component elicited only to the designated target organization. Results thus indicate that both organizations (integrated and segregated) were simultaneously maintained in memory regardless of which task was performed. Focusing attention to one aspect of the sounds did not abolish the alternative, unattended organization when the stimulus input was ambiguous. In noisy environments, such as walking on a city street, rapid and flexible adaptive processes are needed to help facilitate rapid switching to different sound sources in the environment. Having multiple representations available to the attentive system would allow for such flexibility, needed in everyday situations to

Unnatural base pair systems toward the expansion of the genetic alphabet in the central dogma.

Science.gov (United States)

Hirao, Ichiro; Kimoto, Michiko

2012-01-01

Toward the expansion of the genetic alphabet of DNA, several artificial third base pairs (unnatural base pairs) have been created. Synthetic DNAs containing the unnatural base pairs can be amplified faithfully by PCR, along with the natural A-T and G-C pairs, and transcribed into RNA. The unnatural base pair systems now have high potential to open the door to next generation biotechnology. The creation of unnatural base pairs is a consequence of repeating "proof of concept" experiments. In the process, initially designed base pairs were modified to address their weak points. Some of them were artificially evolved to ones with higher efficiency and selectivity in polymerase reactions, while others were eliminated from the analysis. Here, we describe the process of unnatural base pair development, as well as the tests of their applications.

Control of Discrete Event Systems

NARCIS (Netherlands)

Smedinga, Rein

1989-01-01

Systemen met discrete gebeurtenissen spelen in vele gebieden een rol. In dit proefschrift staat de volgorde van gebeurtenissen centraal en worden tijdsaspecten buiten beschouwing gelaten. In dat geval kunnen systemen met discrete gebeurtenissen goed worden gemodelleerd door gebruik te maken van

Connections on discrete fibre bundles

International Nuclear Information System (INIS)

Manton, N.S.; Cambridge Univ.

1987-01-01

A new approach to gauge fields on a discrete space-time is proposed, in which the fundamental object is a discrete version of a principal fibre bundle. If the bundle is twisted, the gauge fields are topologically non-trivial automatically. (orig.)

Rational solutions of the discrete time Toda lattice and the alternate discrete Painleve II equation

International Nuclear Information System (INIS)

Common, Alan K; Hone, Andrew N W

2008-01-01

The Yablonskii-Vorob'ev polynomials y n (t), which are defined by a second-order bilinear differential-difference equation, provide rational solutions of the Toda lattice. They are also polynomial tau-functions for the rational solutions of the second Painleve equation (P II ). Here we define two-variable polynomials Y n (t, h) on a lattice with spacing h, by considering rational solutions of the discrete time Toda lattice as introduced by Suris. These polynomials are shown to have many properties that are analogous to those of the Yablonskii-Vorob'ev polynomials, to which they reduce when h = 0. They also provide rational solutions for a particular discretization of P II , namely the so-called alternate discrete P II , and this connection leads to an expression in terms of the Umemura polynomials for the third Painleve equation (P III ). It is shown that the Baecklund transformation for the alternate discrete Painleve equation is a symplectic map, and the shift in time is also symplectic. Finally we present a Lax pair for the alternate discrete P II , which recovers Jimbo and Miwa's Lax pair for P II in the continuum limit h → 0

Handbook on modelling for discrete optimization

CERN Document Server

Pitsoulis, Leonidas; Williams, H

2006-01-01

The primary objective underlying the Handbook on Modelling for Discrete Optimization is to demonstrate and detail the pervasive nature of Discrete Optimization. While its applications cut across an incredibly wide range of activities, many of the applications are only known to specialists. It is the aim of this handbook to correct this. It has long been recognized that "modelling" is a critically important mathematical activity in designing algorithms for solving these discrete optimization problems. Nevertheless solving the resultant models is also often far from straightforward. In recent years it has become possible to solve many large-scale discrete optimization problems. However, some problems remain a challenge, even though advances in mathematical methods, hardware, and software technology have pushed the frontiers forward. This handbook couples the difficult, critical-thinking aspects of mathematical modeling with the hot area of discrete optimization. It will be done in an academic handbook treatment...

Discrete Gabor transform and discrete Zak transform

NARCIS (Netherlands)

Bastiaans, M.J.; Namazi, N.M.; Matthews, K.

1996-01-01

Gabor's expansion of a discrete-time signal into a set of shifted and modulated versions of an elementary signal or synthesis window is introduced, along with the inverse operation, i.e. the Gabor transform, which uses an analysis window that is related to the synthesis window and with the help of

Frequency response testing at Experimental Breeder Reactor II using discrete-level periodic signals

International Nuclear Information System (INIS)

Rhodes, W.D.; Larson, H.A.

1990-01-01

The Experimental Breeder Reactor 2 (EBR-2) reactivity-to-power frequency-response function was measured with pseudo-random, discrete-level, periodic signals. The reactor power deviation was small with insignificant perturbation of normal operation and in-place irradiation experiments. Comparison of results with measured rod oscillator data and with theoretical predictions show good agreement. Moreover, measures of input signal quality (autocorrelation function and energy spectra) confirm the ability to enable this type of frequency response determination at EBR-2. Measurements were made with the pseudo-random binary sequence, quadratic residue binary sequence, pseudo-random ternary sequence, and the multifrequency binary sequence. 10 refs., 7 figs., 3 tabs

Identification "boîte-noire" des systèmes automatisés à événements discrets

OpenAIRE

Estrada Vargas , Ana Paula

2013-01-01

This thesis deals with the identification of automated discrete event systems (DES) operating in an industrial context. In particular the work focuses on the systems composed by a plant and a programmable logic controller (PLC) operating in a closed loop- the identification consists in obtaining an approximate model expressed in interpreted Petri nets (IPN) from the observed behaviour given under the form of a single sequence of input-output vectors of the PLC. First, an overview of previous ...

Discrete Feature Model (DFM) User Documentation

Energy Technology Data Exchange (ETDEWEB)

Geier, Joel (Clearwater Hardrock Consulting, Corvallis, OR (United States))

2008-06-15

This manual describes the Discrete-Feature Model (DFM) software package for modelling groundwater flow and solute transport in networks of discrete features. A discrete-feature conceptual model represents fractures and other water-conducting features around a repository as discrete conductors surrounded by a rock matrix which is usually treated as impermeable. This approximation may be valid for crystalline rocks such as granite or basalt, which have very low permeability if macroscopic fractures are excluded. A discrete feature is any entity that can conduct water and permit solute transport through bedrock, and can be reasonably represented as a piecewise-planar conductor. Examples of such entities may include individual natural fractures (joints or faults), fracture zones, and disturbed-zone features around tunnels (e.g. blasting-induced fractures or stress-concentration induced 'onion skin' fractures around underground openings). In a more abstract sense, the effectively discontinuous nature of pathways through fractured crystalline bedrock may be idealized as discrete, equivalent transmissive features that reproduce large-scale observations, even if the details of connective paths (and unconnected domains) are not precisely known. A discrete-feature model explicitly represents the fundamentally discontinuous and irregularly connected nature of systems of such systems, by constraining flow and transport to occur only within such features and their intersections. Pathways for flow and solute transport in this conceptualization are a consequence not just of the boundary conditions and hydrologic properties (as with continuum models), but also the irregularity of connections between conductive/transmissive features. The DFM software package described here is an extensible code for investigating problems of flow and transport in geological (natural or human-altered) systems that can be characterized effectively in terms of discrete features. With this

Discrete Feature Model (DFM) User Documentation

International Nuclear Information System (INIS)

Geier, Joel

2008-06-01

This manual describes the Discrete-Feature Model (DFM) software package for modelling groundwater flow and solute transport in networks of discrete features. A discrete-feature conceptual model represents fractures and other water-conducting features around a repository as discrete conductors surrounded by a rock matrix which is usually treated as impermeable. This approximation may be valid for crystalline rocks such as granite or basalt, which have very low permeability if macroscopic fractures are excluded. A discrete feature is any entity that can conduct water and permit solute transport through bedrock, and can be reasonably represented as a piecewise-planar conductor. Examples of such entities may include individual natural fractures (joints or faults), fracture zones, and disturbed-zone features around tunnels (e.g. blasting-induced fractures or stress-concentration induced 'onion skin' fractures around underground openings). In a more abstract sense, the effectively discontinuous nature of pathways through fractured crystalline bedrock may be idealized as discrete, equivalent transmissive features that reproduce large-scale observations, even if the details of connective paths (and unconnected domains) are not precisely known. A discrete-feature model explicitly represents the fundamentally discontinuous and irregularly connected nature of systems of such systems, by constraining flow and transport to occur only within such features and their intersections. Pathways for flow and solute transport in this conceptualization are a consequence not just of the boundary conditions and hydrologic properties (as with continuum models), but also the irregularity of connections between conductive/transmissive features. The DFM software package described here is an extensible code for investigating problems of flow and transport in geological (natural or human-altered) systems that can be characterized effectively in terms of discrete features. With this software, the

Visualization and verification of the input data in transport calculations with TORT

International Nuclear Information System (INIS)

Portulyan, A.; Belousov, S.

2011-01-01

A software package, called VTSTO and applied for visualization of three-dimensional objects, is developed. The purpose of the package is to verify the input data describing the model of an object in TORT code calculation. TORT calculates the neutron and gamma flux in three-dimensional system through the method of discrete ordinates and is used as an essential tool when calculating the radiation load of the reactor construction. The software requires data of the reactor component,, which is then processed and used for the generation of the graphic image. The object is presented in two planes. The user has the opportunity to choose and change the pair sections determined by those planes, which is crucial when obtaining the view of the composition and structure of the reactor elements. Consequently the generated visualization allows the preparation of an evaluation of the model and if necessary the input data for TORT can be corrected. In this way tie software reduces significantly the possibility of committing an error while modeling complex objects of the reactor system In addition the process of modeling becomes easier and faster. (full text)

Discrete-Time Biomedical Signal Encryption

Directory of Open Access Journals (Sweden)

Victor Grigoraş

2017-12-01

Full Text Available Chaotic modulation is a strong method of improving communication security. Analog and discrete chaotic systems are presented in actual literature. Due to the expansion of digital communication, discrete-time systems become more efficient and closer to actual technology. The present contribution offers an in-depth analysis of the effects chaos encryption produce on 1D and 2D biomedical signals. The performed simulations show that modulating signals are precisely recovered by the synchronizing receiver if discrete systems are digitally implemented and the coefficients precisely correspond. Channel noise is also applied and its effects on biomedical signal demodulation are highlighted.

The origin of discrete particles

CERN Document Server

Bastin, T

2009-01-01

This book is a unique summary of the results of a long research project undertaken by the authors on discreteness in modern physics. In contrast with the usual expectation that discreteness is the result of mathematical tools for insertion into a continuous theory, this more basic treatment builds up the world from the discrimination of discrete entities. This gives an algebraic structure in which certain fixed numbers arise. As such, one agrees with the measured value of the fine-structure constant to one part in 10,000,000 (10 7 ). Sample Chapter(s). Foreword (56 KB). Chapter 1: Introduction

Time-Discrete Higher-Order ALE Formulations: Stability

KAUST Repository

Bonito, Andrea; Kyza, Irene; Nochetto, Ricardo H.

2013-01-01

on the stability of the PDE but may influence that of a discrete scheme. We examine this critical issue for higher-order time stepping without space discretization. We propose time-discrete discontinuous Galerkin (dG) numerical schemes of any order for a time

Structural deformation upon protein-protein interaction: a structural alphabet approach.

Science.gov (United States)

Martin, Juliette; Regad, Leslie; Lecornet, Hélène; Camproux, Anne-Claude

2008-02-28

In a number of protein-protein complexes, the 3D structures of bound and unbound partners significantly differ, supporting the induced fit hypothesis for protein-protein binding. In this study, we explore the induced fit modifications on a set of 124 proteins available in both bound and unbound forms, in terms of local structure. The local structure is described thanks to a structural alphabet of 27 structural letters that allows a detailed description of the backbone. Using a control set to distinguish induced fit from experimental error and natural protein flexibility, we show that the fraction of structural letters modified upon binding is significantly greater than in the control set (36% versus 28%). This proportion is even greater in the interface regions (41%). Interface regions preferentially involve coils. Our analysis further reveals that some structural letters in coil are not favored in the interface. We show that certain structural letters in coil are particularly subject to modifications at the interface, and that the severity of structural change also varies. These information are used to derive a structural letter substitution matrix that summarizes the local structural changes observed in our data set. We also illustrate the usefulness of our approach to identify common binding motifs in unrelated proteins. Our study provides qualitative information about induced fit. These results could be of help for flexible docking.

Structural deformation upon protein-protein interaction: A structural alphabet approach

Directory of Open Access Journals (Sweden)

Lecornet Hélène

2008-02-01

Full Text Available Abstract Background In a number of protein-protein complexes, the 3D structures of bound and unbound partners significantly differ, supporting the induced fit hypothesis for protein-protein binding. Results In this study, we explore the induced fit modifications on a set of 124 proteins available in both bound and unbound forms, in terms of local structure. The local structure is described thanks to a structural alphabet of 27 structural letters that allows a detailed description of the backbone. Using a control set to distinguish induced fit from experimental error and natural protein flexibility, we show that the fraction of structural letters modified upon binding is significantly greater than in the control set (36% versus 28%. This proportion is even greater in the interface regions (41%. Interface regions preferentially involve coils. Our analysis further reveals that some structural letters in coil are not favored in the interface. We show that certain structural letters in coil are particularly subject to modifications at the interface, and that the severity of structural change also varies. These information are used to derive a structural letter substitution matrix that summarizes the local structural changes observed in our data set. We also illustrate the usefulness of our approach to identify common binding motifs in unrelated proteins. Conclusion Our study provides qualitative information about induced fit. These results could be of help for flexible docking.

TART input manual

International Nuclear Information System (INIS)

Kimlinger, J.R.; Plechaty, E.F.

1982-01-01

The TART code is a Monte Carlo neutron/photon transport code that is only on the CRAY computer. All the input cards for the TART code are listed, and definitions for all input parameters are given. The execution and limitations of the code are described, and input for two sample problems are given

Fermion systems in discrete space-time

International Nuclear Information System (INIS)

Finster, Felix

2007-01-01

Fermion systems in discrete space-time are introduced as a model for physics on the Planck scale. We set up a variational principle which describes a non-local interaction of all fermions. This variational principle is symmetric under permutations of the discrete space-time points. We explain how for minimizers of the variational principle, the fermions spontaneously break this permutation symmetry and induce on space-time a discrete causal structure

Fermion systems in discrete space-time

Energy Technology Data Exchange (ETDEWEB)

Finster, Felix [NWF I - Mathematik, Universitaet Regensburg, 93040 Regensburg (Germany)

2007-05-15

Fermion systems in discrete space-time are introduced as a model for physics on the Planck scale. We set up a variational principle which describes a non-local interaction of all fermions. This variational principle is symmetric under permutations of the discrete space-time points. We explain how for minimizers of the variational principle, the fermions spontaneously break this permutation symmetry and induce on space-time a discrete causal structure.

Fermion Systems in Discrete Space-Time

OpenAIRE

Finster, Felix

2006-01-01

Fermion systems in discrete space-time are introduced as a model for physics on the Planck scale. We set up a variational principle which describes a non-local interaction of all fermions. This variational principle is symmetric under permutations of the discrete space-time points. We explain how for minimizers of the variational principle, the fermions spontaneously break this permutation symmetry and induce on space-time a discrete causal structure.

Fermion systems in discrete space-time

Science.gov (United States)

Finster, Felix

2007-05-01

Fermion systems in discrete space-time are introduced as a model for physics on the Planck scale. We set up a variational principle which describes a non-local interaction of all fermions. This variational principle is symmetric under permutations of the discrete space-time points. We explain how for minimizers of the variational principle, the fermions spontaneously break this permutation symmetry and induce on space-time a discrete causal structure.

Discrete ellipsoidal statistical BGK model and Burnett equations

Science.gov (United States)

Zhang, Yu-Dong; Xu, Ai-Guo; Zhang, Guang-Cai; Chen, Zhi-Hua; Wang, Pei

2018-06-01

A new discrete Boltzmann model, the discrete ellipsoidal statistical Bhatnagar-Gross-Krook (ESBGK) model, is proposed to simulate nonequilibrium compressible flows. Compared with the original discrete BGK model, the discrete ES-BGK has a flexible Prandtl number. For the discrete ES-BGK model in the Burnett level, two kinds of discrete velocity model are introduced and the relations between nonequilibrium quantities and the viscous stress and heat flux in the Burnett level are established. The model is verified via four benchmark tests. In addition, a new idea is introduced to recover the actual distribution function through the macroscopic quantities and their space derivatives. The recovery scheme works not only for discrete Boltzmann simulation but also for hydrodynamic ones, for example, those based on the Navier-Stokes or the Burnett equations.

Memorized discrete systems and time-delay

CERN Document Server

Luo, Albert C J

2017-01-01

This book examines discrete dynamical systems with memory—nonlinear systems that exist extensively in biological organisms and financial and economic organizations, and time-delay systems that can be discretized into the memorized, discrete dynamical systems. It book further discusses stability and bifurcations of time-delay dynamical systems that can be investigated through memorized dynamical systems as well as bifurcations of memorized nonlinear dynamical systems, discretization methods of time-delay systems, and periodic motions to chaos in nonlinear time-delay systems. The book helps readers find analytical solutions of MDS, change traditional perturbation analysis in time-delay systems, detect motion complexity and singularity in MDS; and determine stability, bifurcation, and chaos in any time-delay system.

Discrete Mathematics and Curriculum Reform.

Science.gov (United States)

Kenney, Margaret J.

1996-01-01

Defines discrete mathematics as the mathematics necessary to effect reasoned decision making in finite situations and explains how its use supports the current view of mathematics education. Discrete mathematics can be used by curriculum developers to improve the curriculum for students of all ages and abilities. (SLD)

Exact analysis of discrete data

CERN Document Server

Hirji, Karim F

2005-01-01

Researchers in fields ranging from biology and medicine to the social sciences, law, and economics regularly encounter variables that are discrete or categorical in nature. While there is no dearth of books on the analysis and interpretation of such data, these generally focus on large sample methods. When sample sizes are not large or the data are otherwise sparse, exact methods--methods not based on asymptotic theory--are more accurate and therefore preferable.This book introduces the statistical theory, analysis methods, and computation techniques for exact analysis of discrete data. After reviewing the relevant discrete distributions, the author develops the exact methods from the ground up in a conceptually integrated manner. The topics covered range from univariate discrete data analysis, a single and several 2 x 2 tables, a single and several 2 x K tables, incidence density and inverse sampling designs, unmatched and matched case -control studies, paired binary and trinomial response models, and Markov...

Modeling and sliding mode predictive control of the ultra-supercritical boiler-turbine system with uncertainties and input constraints.

Science.gov (United States)

Tian, Zhen; Yuan, Jingqi; Zhang, Xiang; Kong, Lei; Wang, Jingcheng

2018-05-01

The coordinated control system (CCS) serves as an important role in load regulation, efficiency optimization and pollutant reduction for coal-fired power plants. The CCS faces with tough challenges, such as the wide-range load variation, various uncertainties and constraints. This paper aims to improve the load tacking ability and robustness for boiler-turbine units under wide-range operation. To capture the key dynamics of the ultra-supercritical boiler-turbine system, a nonlinear control-oriented model is developed based on mechanism analysis and model reduction techniques, which is validated with the history operation data of a real 1000 MW unit. To simultaneously address the issues of uncertainties and input constraints, a discrete-time sliding mode predictive controller (SMPC) is designed with the dual-mode control law. Moreover, the input-to-state stability and robustness of the closed-loop system are proved. Simulation results are presented to illustrate the effectiveness of the proposed control scheme, which achieves good tracking performance, disturbance rejection ability and compatibility to input constraints. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

Discrete systems and integrability

CERN Document Server

Hietarinta, J; Nijhoff, F W

2016-01-01

This first introductory text to discrete integrable systems introduces key notions of integrability from the vantage point of discrete systems, also making connections with the continuous theory where relevant. While treating the material at an elementary level, the book also highlights many recent developments. Topics include: Darboux and Bäcklund transformations; difference equations and special functions; multidimensional consistency of integrable lattice equations; associated linear problems (Lax pairs); connections with Padé approximants and convergence algorithms; singularities and geometry; Hirota's bilinear formalism for lattices; intriguing properties of discrete Painlevé equations; and the novel theory of Lagrangian multiforms. The book builds the material in an organic way, emphasizing interconnections between the various approaches, while the exposition is mostly done through explicit computations on key examples. Written by respected experts in the field, the numerous exercises and the thoroug...

A new time-adaptive discrete bionic wavelet transform for enhancing speech from adverse noise environment

Science.gov (United States)

Palaniswamy, Sumithra; Duraisamy, Prakash; Alam, Mohammad Showkat; Yuan, Xiaohui

2012-04-01

Automatic speech processing systems are widely used in everyday life such as mobile communication, speech and speaker recognition, and for assisting the hearing impaired. In speech communication systems, the quality and intelligibility of speech is of utmost importance for ease and accuracy of information exchange. To obtain an intelligible speech signal and one that is more pleasant to listen, noise reduction is essential. In this paper a new Time Adaptive Discrete Bionic Wavelet Thresholding (TADBWT) scheme is proposed. The proposed technique uses Daubechies mother wavelet to achieve better enhancement of speech from additive non- stationary noises which occur in real life such as street noise and factory noise. Due to the integration of human auditory system model into the wavelet transform, bionic wavelet transform (BWT) has great potential for speech enhancement which may lead to a new path in speech processing. In the proposed technique, at first, discrete BWT is applied to noisy speech to derive TADBWT coefficients. Then the adaptive nature of the BWT is captured by introducing a time varying linear factor which updates the coefficients at each scale over time. This approach has shown better performance than the existing algorithms at lower input SNR due to modified soft level dependent thresholding on time adaptive coefficients. The objective and subjective test results confirmed the competency of the TADBWT technique. The effectiveness of the proposed technique is also evaluated for speaker recognition task under noisy environment. The recognition results show that the TADWT technique yields better performance when compared to alternate methods specifically at lower input SNR.

TRIDENT: a two-dimensional, multigroup, triangular mesh discrete ordinates, explicit neutron transport code

International Nuclear Information System (INIS)

Seed, T.J.; Miller, W.F. Jr.; Brinkley, F.W. Jr.

1977-03-01

TRIDENT solves the two-dimensional-multigroup-transport equations in rectangular (x-y) and cylindrical (r-z) geometries using a regular triangular mesh. Regular and adjoint, inhomogeneous and homogeneous (k/sub eff/ and eigenvalue searches) problems subject to vacuum, reflective, white, or source boundary conditions are solved. General anisotropic scattering is allowed and anisotropic-distributed sources are permitted. The discrete-ordinates approximation is used for the neutron directional variables. An option is included to append a fictitious source to the discrete-ordinates equations that is defined such that spherical-harmonics solutions (in x-y geometry) or spherical-harmonics-like solutions (in r-z geometry) are obtained. A spatial-finite-element method is used in which the angular flux is expressed as a linear polynomial in each triangle that is discontinous at triangle boundaries. Unusual Features of the program: Provision is made for creation of standard interface output files for S/sub N/ constants, angle-integrated (scalar) fluxes, and angular fluxes. Standard interface input files for S/sub N/ constants, inhomogeneous sources, cross sections, and the scalar flux may be read. Flexible edit options as well as a dump and restart capability are provided

Discrete Painlevé equations: an integrability paradigm

International Nuclear Information System (INIS)

Grammaticos, B; Ramani, A

2014-01-01

In this paper we present a review of results on discrete Painlevé equations. We begin with an introduction which serves as a refresher on the continuous Painlevé equations. Next, in the first, main part of the paper, we introduce the discrete Painlevé equations, the various methods for their derivation, and their properties as well as their classification scheme. Along the way we present a brief summary of the two major discrete integrability detectors and of Quispel–Roberts–Thompson mapping, which plays a primordial role in the derivation of discrete Painlevé equations. The second part of the paper is more technical and focuses on the presentation of new results on what are called asymmetric discrete Painlevé equations. (comment)

Boltzmann-Fokker-Planck calculations using standard discrete-ordinates codes

International Nuclear Information System (INIS)

Morel, J.E.

1987-01-01

The Boltzmann-Fokker-Planck (BFP) equation can be used to describe both neutral and charged-particle transport. Over the past several years, the author and several collaborators have developed methods for representing Fokker-Planck operators with standard multigroup-Legendre cross-section data. When these data are input to a standard S/sub n/ code such as ONETRAN, the code actually solves the Boltzmann-Fokker-Planck equation rather than the Boltzmann equation. This is achieved wihout any modification to the S/sub n/ codes. Because BFP calculations can be more demanding from a numerical viewpoint than standard neutronics calculations, we have found it useful to implement new quadrature methods ad convergence acceleration methods in the standard discrete-ordinates code, ONETRAN. We discuss our BFP cross-section representation techniques, our improved quadrature and acceleration techniques, and present results from BFP coupled electron-photon transport calculations performed with ONETRAN. 19 refs., 7 figs

Direct closed-form covariance matrix and finite alphabet constant-envelope waveforms for planar array beampatterns

KAUST Repository

Ahmed, Sajid

2016-11-24

Various examples of methods and systems are provided for direct closed-form finite alphabet constant-envelope waveforms for planar array beampatterns. In one example, a method includes defining a waveform covariance matrix based at least in part upon a two-dimensional fast Fourier transform (2D-FFT) analysis of a frequency domain matrix Hf associated with a planar array of antennas. Symbols can be encoded based upon the waveform covariance matrix and the encoded symbols can be transmitted via the planar array of antennas. In another embodiment, a system comprises an N x M planar array of antennas and transmission circuitry configured to transmit symbols via a two-dimensional waveform beampattern defined based at least in part upon a 2D-FFT analysis of a frequency domain matrix Hf associated with the planar array of antennas.

From the continuous PV to discrete Painleve equations

International Nuclear Information System (INIS)

Tokihiro, T.; Grammaticos, B.; Ramani, A.

2002-01-01

We study the discrete transformations that are associated with the auto-Baecklund of the (continuous) P V equation. We show that several two-parameter discrete Painleve equations can be obtained as contiguity relations of P V . Among them we find the asymmetric d-P II equation which is a well-known form of discrete P III . The relation between the ternary P I (previously obtained through the discrete dressing approach) and P V is also established. A new discrete Painleve equation is also derived. (author)

Iterative normalization technique for reference sequence generation for zero-tail discrete fourier transform spread orthogonal frequency division multiplexing

DEFF Research Database (Denmark)

2017-01-01

Systems, methods, apparatuses, and computer program products for generating sequences for zero-tail discrete fourier transform (DFT)-spread-orthogonal frequency division multiplexing (OFDM) (ZT DFT-s-OFDM) reference signals. One method includes adding a zero vector to an input sequence...... of each of the elements, converting the sequence to time domain, generating a zero-padded sequence by forcing a zero head and tail of the sequence, and repeating the steps until a final sequence with zero-tail and flat frequency response is obtained....

Discrete Routh reduction

International Nuclear Information System (INIS)

Jalnapurkar, Sameer M; Leok, Melvin; Marsden, Jerrold E; West, Matthew

2006-01-01

This paper develops the theory of Abelian Routh reduction for discrete mechanical systems and applies it to the variational integration of mechanical systems with Abelian symmetry. The reduction of variational Runge-Kutta discretizations is considered, as well as the extent to which symmetry reduction and discretization commute. These reduced methods allow the direct simulation of dynamical features such as relative equilibria and relative periodic orbits that can be obscured or difficult to identify in the unreduced dynamics. The methods are demonstrated for the dynamics of an Earth orbiting satellite with a non-spherical J 2 correction, as well as the double spherical pendulum. The J 2 problem is interesting because in the unreduced picture, geometric phases inherent in the model and those due to numerical discretization can be hard to distinguish, but this issue does not appear in the reduced algorithm, where one can directly observe interesting dynamical structures in the reduced phase space (the cotangent bundle of shape space), in which the geometric phases have been removed. The main feature of the double spherical pendulum example is that it has a non-trivial magnetic term in its reduced symplectic form. Our method is still efficient as it can directly handle the essential non-canonical nature of the symplectic structure. In contrast, a traditional symplectic method for canonical systems could require repeated coordinate changes if one is evoking Darboux' theorem to transform the symplectic structure into canonical form, thereby incurring additional computational cost. Our method allows one to design reduced symplectic integrators in a natural way, despite the non-canonical nature of the symplectic structure

A Delta Operator Approach for the Discrete-Time Active Disturbance Rejection Control on Induction Motors

Directory of Open Access Journals (Sweden)

John Cortés-Romero

2013-01-01

Full Text Available The problem of active disturbance rejection control of induction motors is tackled by means of a generalized PI observer based discrete-time control, using the delta operator approach as the methodology of analyzing the sampled time process. In this scheme, model uncertainties and external disturbances are included in a general additive disturbance input which is to be online estimated and subsequently rejected via the controller actions. The observer carries out the disturbance estimation, thus reducing the complexity of the controller design. The controller efficiency is tested via some experimental results, performing a trajectory tracking task under load variations.

Foundations of a discrete physics

International Nuclear Information System (INIS)

McGoveran, D.; Noyes, P.

1988-01-01

Starting from the principles of finiteness, discreteness, finite computability and absolute nonuniqueness, we develop the ordering operator calculus, a strictly constructive mathematical system having the empirical properties required by quantum mechanical and special relativistic phenomena. We show how to construct discrete distance functions, and both rectangular and spherical coordinate systems(with a discrete version of ''π''). The richest discrete space constructible without a preferred axis and preserving translational and rotational invariance is shown to be a discrete 3-space with the usual symmetries. We introduce a local ordering parameter with local (proper) time-like properties and universal ordering parameters with global (cosmological) time-like properties. Constructed ''attribute velocities'' connect ensembles with attributes that are invariant as the appropriate time-like parameter increases. For each such attribute, we show how to construct attribute velocities which must satisfy the '' relativistic Doppler shift'' and the ''relativistic velocity composition law,'' as well as the Lorentz transformations. By construction, these velocities have finite maximum and minimum values. In the space of all attributes, the minimum of these maximum velocities will predominate in all multiple attribute computations, and hence can be identified as a fundamental limiting velocity, General commutation relations are constructed which under the physical interpretation are shown to reduce to the usual quantum mechanical commutation relations. 50 refs., 18 figs

An asymptotic-preserving stochastic Galerkin method for the radiative heat transfer equations with random inputs and diffusive scalings

Energy Technology Data Exchange (ETDEWEB)

Jin, Shi, E-mail: sjin@wisc.edu [Department of Mathematics, University of Wisconsin-Madison, Madison, WI 53706 (United States); Institute of Natural Sciences, Department of Mathematics, MOE-LSEC and SHL-MAC, Shanghai Jiao Tong University, Shanghai 200240 (China); Lu, Hanqing, E-mail: hanqing@math.wisc.edu [Department of Mathematics, University of Wisconsin-Madison, Madison, WI 53706 (United States)

2017-04-01

In this paper, we develop an Asymptotic-Preserving (AP) stochastic Galerkin scheme for the radiative heat transfer equations with random inputs and diffusive scalings. In this problem the random inputs arise due to uncertainties in cross section, initial data or boundary data. We use the generalized polynomial chaos based stochastic Galerkin (gPC-SG) method, which is combined with the micro–macro decomposition based deterministic AP framework in order to handle efficiently the diffusive regime. For linearized problem we prove the regularity of the solution in the random space and consequently the spectral accuracy of the gPC-SG method. We also prove the uniform (in the mean free path) linear stability for the space-time discretizations. Several numerical tests are presented to show the efficiency and accuracy of proposed scheme, especially in the diffusive regime.

Classification of frequency response areas in the inferior colliculus reveals continua not discrete classes.

Science.gov (United States)

Palmer, Alan R; Shackleton, Trevor M; Sumner, Christian J; Zobay, Oliver; Rees, Adrian

2013-08-15

A differential response to sound frequency is a fundamental property of auditory neurons. Frequency analysis in the cochlea gives rise to V-shaped tuning functions in auditory nerve fibres, but by the level of the inferior colliculus (IC), the midbrain nucleus of the auditory pathway, neuronal receptive fields display diverse shapes that reflect the interplay of excitation and inhibition. The origin and nature of these frequency receptive field types is still open to question. One proposed hypothesis is that the frequency response class of any given neuron in the IC is predominantly inherited from one of three major afferent pathways projecting to the IC, giving rise to three distinct receptive field classes. Here, we applied subjective classification, principal component analysis, cluster analysis, and other objective statistical measures, to a large population (2826) of frequency response areas from single neurons recorded in the IC of the anaesthetised guinea pig. Subjectively, we recognised seven frequency response classes (V-shaped, non-monotonic Vs, narrow, closed, tilt down, tilt up and double-peaked), that were represented at all frequencies. We could identify similar classes using our objective classification tools. Importantly, however, many neurons exhibited properties intermediate between these classes, and none of the objective methods used here showed evidence of discrete response classes. Thus receptive field shapes in the IC form continua rather than discrete classes, a finding consistent with the integration of afferent inputs in the generation of frequency response areas. The frequency disposition of inhibition in the response areas of some neurons suggests that across-frequency inputs originating at or below the level of the IC are involved in their generation.

Theoretical Basics of Teaching Discrete Mathematics

Directory of Open Access Journals (Sweden)

Y. A. Perminov

2012-01-01

Full Text Available  The paper deals with the research findings concerning the process of mastering the theoretical basics of discrete mathematics by the students of vocational pedagogic profile. The methodological analysis is based on the subject and functions of the modern discrete mathematics and its role in mathematical modeling and computing. The modern discrete mathematics (i.e. mathematics of the finite type structures plays the important role in modernization of vocational training. It is especially rele- vant to training students for vocational pedagogic qualifications, as in the future they will be responsible for training the middle and the senior level specialists in engineer- ing and technical spheres. Nowadays in different industries, there arise the problems which require for their solving both continual – based on the classical mathematical methods – and discrete modeling. The teaching course of discrete mathematics for the future vocational teachers should be relevant to the target qualification and aimed at mastering the mathematical modeling, systems of computer mathematics and computer technologies. The author emphasizes the fundamental role of mastering the language of algebraic and serial structures, as well as the logical, algorithmic, combinatory schemes dominating in dis- crete mathematics. The guidelines for selecting the content of the course in discrete mathematics are specified. The theoretical findings of the research can be put into practice whilst developing curricula and working programs for bachelors and masters’ training. 

Discrete symmetries and their stringy origin

International Nuclear Information System (INIS)

Mayorga Pena, Damian Kaloni

2014-05-01

Discrete symmetries have proven to be very useful in controlling the phenomenology of theories beyond the standard model. In this work we explore how these symmetries emerge from string compactifications. Our approach is twofold: On the one hand, we consider the heterotic string on orbifold backgrounds. In this case the discrete symmetries can be derived from the orbifold conformal field theory, and it can be shown that they are in close relation with the orbifold geometry. We devote special attention to R-symmetries, which arise from discrete remnants of the Lorentz group in compact space. Further we discuss the physical implications of these symmetries both in the heterotic mini-landscape and in newly constructed models based on the Z 2 x Z 4 orbifold. In both cases we observe that the discrete symmetries favor particular locations in the orbifold where the particles of standard model should live. On the other hand we consider a class of F-theory models exhibiting an SU(5) gauge group, times additional U(1) symmetries. In this case, the smooth compactification background does not permit us to track the discrete symmetries as transparently as in orbifold models. Hence, we follow a different approach and search for discrete subgroups emerging after the U(1)s are broken. We observe that in this approach it is possible to obtain the standard Z 2 matter parity of the MSSM.

Exterior difference systems and invariance properties of discrete mechanics

International Nuclear Information System (INIS)

Xie Zheng; Xie Duanqiang; Li Hongbo

2008-01-01

Invariance properties describe the fundamental physical laws in discrete mechanics. Can those properties be described in a geometric way? We investigate an exterior difference system called the discrete Euler-Lagrange system, whose solution has one-to-one correspondence with solutions of discrete Euler-Lagrange equations, and use it to define the first integrals. The preservation of the discrete symplectic form along the discrete Hamilton phase flows and the discrete Noether's theorem is also described in the language of difference forms

Fourier-Based Transmit Beampattern Design Using MIMO Radar

KAUST Repository

Lipor, John

2014-05-01

In multiple-input multiple-output (MIMO) radar settings, it is often desirable to transmit power only to a given location or set of locations defined by a beampattern. Transmit waveform design is a topic that has received much attention recently, involving synthesis of both the signal covariance matrix,, as well as the actual waveforms. Current methods involve a two-step process of designing via iterative solutions and then using to generate waveforms that fulfill practical constraints such as having a constant-envelope or drawing from a finite alphabet. In this paper, a closed-form method to design for a uniform linear array is proposed that utilizes the discrete Fourier transform (DFT) coefficients and Toeplitz matrices. The resulting covariance matrix fulfills the practical constraints such as positive semidefiniteness and the uniformelemental power constraint and provides performance similar to that of iterative methods, which require a much greater computation time. Next, a transmit architecture is presented that exploits the orthogonality of frequencies at discrete DFT values to transmit a sum of orthogonal signals from each antenna. The resulting waveforms provide a lower mean-square error than current methods at a much lower computational cost, and a simulated detection scenario demonstrates the performance advantages achieved.

Discrete breathers in graphane: Effect of temperature

Energy Technology Data Exchange (ETDEWEB)

Baimova, J. A., E-mail: julia.a.baimova@gmail.com [Russian Academy of Sciences, Institute of Metal Physics, Ural Branch (Russian Federation); Murzaev, R. T.; Lobzenko, I. P.; Dmitriev, S. V. [Russian Academy of Sciences, Institute for Metals Superplasticity Problems (Russian Federation); Zhou, Kun [Nanyang Technological University, School of Mechanical and Aerospace Engineering (Singapore)

2016-05-15

The discrete breathers in graphane in thermodynamic equilibrium in the temperature range 50–600 K are studied by molecular dynamics simulation. A discrete breather is a hydrogen atom vibrating along the normal to a sheet of graphane at a high amplitude. As was found earlier, the lifetime of a discrete breather at zero temperature corresponds to several tens of thousands of vibrations. The effect of temperature on the decay time of discrete breathers and the probability of their detachment from a sheet of graphane are studied in this work. It is shown that closely spaced breathers can exchange energy with each other at zero temperature. The data obtained suggest that thermally activated discrete breathers can be involved in the dehydrogenation of graphane, which is important for hydrogen energetics.

Discrete Displacement Hydraulic Power Take-Off System for the Wavestar Wave Energy Converter

Directory of Open Access Journals (Sweden)

Enrique Vidal

2013-08-01

Full Text Available The Wavestar Wave Energy Converter (WEC is a multiple absorber concept, consisting of 20 hemisphere shaped floats attached to a single platform. The heart of the Wavestar WEC is the Power Take-Off (PTO system, converting the wave induced motion of the floats into a steady power output to the grid. In the present work, a PTO based on a novel discrete displacement fluid power technology is explored for the Wavestar WEC. Absorption of power from the floats is performed by hydraulic cylinders, supplying power to a common fixed pressure system with accumulators for energy smoothing. The stored pressure energy is converted into electricity at a steady pace by hydraulic motors and generators. The storage, thereby, decouples the complicated process of wave power absorption from power generation. The core for enabling this PTO technology is implementing a near loss-free force control of the energy absorbing cylinders. This is achieved by using special multi-chambered cylinders, where the different chambers may be connected to the available system pressures using fast on/off valves. Resultantly, a Discrete Displacement Cylinder (DDC is created, allowing near loss free discrete force control. This paper presents a complete PTO system for a 20 float Wavestar based on the DDC. The WEC and PTO is rigorously modeled from incident waves to the electric output to the grid. The resulting model of +600 states is simulated in different irregular seas, showing that power conversion efficiencies above 70% from input power to electrical power is achievable for all relevant sea conditions.

An integrable semi-discretization of the Boussinesq equation

International Nuclear Information System (INIS)

Zhang, Yingnan; Tian, Lixin

2016-01-01

Highlights: • A new integrable semi-discretization of the Boussinesq equation is present. • A Bäcklund transformation and a Lax pair for the differential-difference system is derived by using Hirota's bilinear method. • The soliton solutions of 'good' Boussinesq equation and numerical algorithms are investigated. - Abstract: In this paper, we present an integrable semi-discretization of the Boussinesq equation. Different from other discrete analogues, we discretize the ‘time’ variable and get an integrable differential-difference system. Under a standard limitation, the differential-difference system converges to the continuous Boussinesq equation such that the discrete system can be used to design numerical algorithms. Using Hirota's bilinear method, we find a Bäcklund transformation and a Lax pair of the differential-difference system. For the case of ‘good’ Boussinesq equation, we investigate the soliton solutions of its discrete analogue and design numerical algorithms. We find an effective way to reduce the phase shift caused by the discretization. The numerical results coincide with our analysis.

Discretization of 3d gravity in different polarizations

Science.gov (United States)

Dupuis, Maïté; Freidel, Laurent; Girelli, Florian

2017-10-01

We study the discretization of three-dimensional gravity with Λ =0 following the loop quantum gravity framework. In the process, we realize that different choices of polarization are possible. This allows us to introduce a new discretization based on the triad as opposed to the connection as in the standard loop quantum gravity framework. We also identify the classical nontrivial symmetries of discrete gravity, namely the Drinfeld double, given in terms of momentum maps. Another choice of polarization is given by the Chern-Simons formulation of gravity. Our framework also provides a new discretization scheme of Chern-Simons, which keeps track of the link between the continuum variables and the discrete ones. We show how the Poisson bracket we recover between the Chern-Simons holonomies allows us to recover the Goldman bracket. There is also a transparent link between the discrete Chern-Simons formulation and the discretization of gravity based on the connection (loop gravity) or triad variables (dual loop gravity).

Discrete fractional solutions of a Legendre equation

Science.gov (United States)

Yılmazer, Resat

2018-01-01

One of the most popular research interests of science and engineering is the fractional calculus theory in recent times. Discrete fractional calculus has also an important position in fractional calculus. In this work, we acquire new discrete fractional solutions of the homogeneous and non homogeneous Legendre differential equation by using discrete fractional nabla operator.

Parameter-Invariant Hierarchical Exclusive Alphabet Design for 2-WRC with HDF Strategy

Directory of Open Access Journals (Sweden)

T. Uřičář

2010-01-01

Full Text Available Hierarchical eXclusive Code (HXC for the Hierarchical Decode and Forward (HDF strategy in the Wireless 2-Way Relay Channel (2-WRC has the achievable rate region extended beyond the classical MAC region. Although direct HXC design is in general highly complex, a layered approach to HXC design is a feasible solution. While the outer layer code of the layered HXC can be any state-of-the-art capacity approaching code, the inner layer must be designed in such a way that the exclusive property of hierarchical symbols (received at the relay will be provided. The simplest case of the inner HXC layer is a simple signal space channel symbol memoryless mapper called Hierarchical eXclusive Alphabet (HXA. The proper design of HXA is important, especially in the case of parametric channels, where channel parametrization (e.g. phase rotation can violate the exclusive property of hierarchical symbols (as seen by the relay, resulting in significant capacity degradation. In this paper we introduce an example of a geometrical approach to Parameter-Invariant HXA design, and we show that the corresponding hierarchical MAC capacity region extends beyond the classical MAC region, irrespective of the channel pametrization.

First-principles modeling of electromagnetic scattering by discrete and discretely heterogeneous random media

Science.gov (United States)

Mishchenko, Michael I.; Dlugach, Janna M.; Yurkin, Maxim A.; Bi, Lei; Cairns, Brian; Liu, Li; Panetta, R. Lee; Travis, Larry D.; Yang, Ping; Zakharova, Nadezhda T.

2018-01-01

A discrete random medium is an object in the form of a finite volume of a vacuum or a homogeneous material medium filled with quasi-randomly and quasi-uniformly distributed discrete macroscopic impurities called small particles. Such objects are ubiquitous in natural and artificial environments. They are often characterized by analyzing theoretically the results of laboratory, in situ, or remote-sensing measurements of the scattering of light and other electromagnetic radiation. Electromagnetic scattering and absorption by particles can also affect the energy budget of a discrete random medium and hence various ambient physical and chemical processes. In either case electromagnetic scattering must be modeled in terms of appropriate optical observables, i.e., quadratic or bilinear forms in the field that quantify the reading of a relevant optical instrument or the electromagnetic energy budget. It is generally believed that time-harmonic Maxwell’s equations can accurately describe elastic electromagnetic scattering by macroscopic particulate media that change in time much more slowly than the incident electromagnetic field. However, direct solutions of these equations for discrete random media had been impracticable until quite recently. This has led to a widespread use of various phenomenological approaches in situations when their very applicability can be questioned. Recently, however, a new branch of physical optics has emerged wherein electromagnetic scattering by discrete and discretely heterogeneous random media is modeled directly by using analytical or numerically exact computer solutions of the Maxwell equations. Therefore, the main objective of this Report is to formulate the general theoretical framework of electromagnetic scattering by discrete random media rooted in the Maxwell–Lorentz electromagnetics and discuss its immediate analytical and numerical consequences. Starting from the microscopic Maxwell–Lorentz equations, we trace the development

First-principles modeling of electromagnetic scattering by discrete and discretely heterogeneous random media

International Nuclear Information System (INIS)

Mishchenko, Michael I.; Dlugach, Janna M.; Yurkin, Maxim A.; Bi, Lei; Cairns, Brian; Liu, Li; Panetta, R. Lee; Travis, Larry D.; Yang, Ping; Zakharova, Nadezhda T.

2016-01-01

A discrete random medium is an object in the form of a finite volume of a vacuum or a homogeneous material medium filled with quasi-randomly and quasi-uniformly distributed discrete macroscopic impurities called small particles. Such objects are ubiquitous in natural and artificial environments. They are often characterized by analyzing theoretically the results of laboratory, in situ, or remote-sensing measurements of the scattering of light and other electromagnetic radiation. Electromagnetic scattering and absorption by particles can also affect the energy budget of a discrete random medium and hence various ambient physical and chemical processes. In either case electromagnetic scattering must be modeled in terms of appropriate optical observables, i.e., quadratic or bilinear forms in the field that quantify the reading of a relevant optical instrument or the electromagnetic energy budget. It is generally believed that time-harmonic Maxwell’s equations can accurately describe elastic electromagnetic scattering by macroscopic particulate media that change in time much more slowly than the incident electromagnetic field. However, direct solutions of these equations for discrete random media had been impracticable until quite recently. This has led to a widespread use of various phenomenological approaches in situations when their very applicability can be questioned. Recently, however, a new branch of physical optics has emerged wherein electromagnetic scattering by discrete and discretely heterogeneous random media is modeled directly by using analytical or numerically exact computer solutions of the Maxwell equations. Therefore, the main objective of this Report is to formulate the general theoretical framework of electromagnetic scattering by discrete random media rooted in the Maxwell–Lorentz electromagnetics and discuss its immediate analytical and numerical consequences. Starting from the microscopic Maxwell–Lorentz equations, we trace the development

First-principles modeling of electromagnetic scattering by discrete and discretely heterogeneous random media

Energy Technology Data Exchange (ETDEWEB)

Mishchenko, Michael I., E-mail: michael.i.mishchenko@nasa.gov [NASA Goddard Institute for Space Studies, 2880 Broadway, New York, NY 10025 (United States); Dlugach, Janna M. [Main Astronomical Observatory of the National Academy of Sciences of Ukraine, 27 Zabolotny Str., 03680, Kyiv (Ukraine); Yurkin, Maxim A. [Voevodsky Institute of Chemical Kinetics and Combustion, SB RAS, Institutskaya str. 3, 630090 Novosibirsk (Russian Federation); Novosibirsk State University, Pirogova 2, 630090 Novosibirsk (Russian Federation); Bi, Lei [Department of Atmospheric Sciences, Texas A& M University, College Station, TX 77843 (United States); Cairns, Brian [NASA Goddard Institute for Space Studies, 2880 Broadway, New York, NY 10025 (United States); Liu, Li [NASA Goddard Institute for Space Studies, 2880 Broadway, New York, NY 10025 (United States); Columbia University, 2880 Broadway, New York, NY 10025 (United States); Panetta, R. Lee [Department of Atmospheric Sciences, Texas A& M University, College Station, TX 77843 (United States); Travis, Larry D. [NASA Goddard Institute for Space Studies, 2880 Broadway, New York, NY 10025 (United States); Yang, Ping [Department of Atmospheric Sciences, Texas A& M University, College Station, TX 77843 (United States); Zakharova, Nadezhda T. [Trinnovim LLC, 2880 Broadway, New York, NY 10025 (United States)

2016-05-16

A discrete random medium is an object in the form of a finite volume of a vacuum or a homogeneous material medium filled with quasi-randomly and quasi-uniformly distributed discrete macroscopic impurities called small particles. Such objects are ubiquitous in natural and artificial environments. They are often characterized by analyzing theoretically the results of laboratory, in situ, or remote-sensing measurements of the scattering of light and other electromagnetic radiation. Electromagnetic scattering and absorption by particles can also affect the energy budget of a discrete random medium and hence various ambient physical and chemical processes. In either case electromagnetic scattering must be modeled in terms of appropriate optical observables, i.e., quadratic or bilinear forms in the field that quantify the reading of a relevant optical instrument or the electromagnetic energy budget. It is generally believed that time-harmonic Maxwell’s equations can accurately describe elastic electromagnetic scattering by macroscopic particulate media that change in time much more slowly than the incident electromagnetic field. However, direct solutions of these equations for discrete random media had been impracticable until quite recently. This has led to a widespread use of various phenomenological approaches in situations when their very applicability can be questioned. Recently, however, a new branch of physical optics has emerged wherein electromagnetic scattering by discrete and discretely heterogeneous random media is modeled directly by using analytical or numerically exact computer solutions of the Maxwell equations. Therefore, the main objective of this Report is to formulate the general theoretical framework of electromagnetic scattering by discrete random media rooted in the Maxwell–Lorentz electromagnetics and discuss its immediate analytical and numerical consequences. Starting from the microscopic Maxwell–Lorentz equations, we trace the development

First-Principles Modeling Of Electromagnetic Scattering By Discrete and Discretely Heterogeneous Random Media

Science.gov (United States)

Mishchenko, Michael I.; Dlugach, Janna M.; Yurkin, Maxim A.; Bi, Lei; Cairns, Brian; Liu, Li; Panetta, R. Lee; Travis, Larry D.; Yang, Ping; Zakharova, Nadezhda T.

2016-01-01

A discrete random medium is an object in the form of a finite volume of a vacuum or a homogeneous material medium filled with quasi-randomly and quasi-uniformly distributed discrete macroscopic impurities called small particles. Such objects are ubiquitous in natural and artificial environments. They are often characterized by analyzing theoretically the results of laboratory, in situ, or remote-sensing measurements of the scattering of light and other electromagnetic radiation. Electromagnetic scattering and absorption by particles can also affect the energy budget of a discrete random medium and hence various ambient physical and chemical processes. In either case electromagnetic scattering must be modeled in terms of appropriate optical observables, i.e., quadratic or bilinear forms in the field that quantify the reading of a relevant optical instrument or the electromagnetic energy budget. It is generally believed that time-harmonic Maxwell's equations can accurately describe elastic electromagnetic scattering by macroscopic particulate media that change in time much more slowly than the incident electromagnetic field. However, direct solutions of these equations for discrete random media had been impracticable until quite recently. This has led to a widespread use of various phenomenological approaches in situations when their very applicability can be questioned. Recently, however, a new branch of physical optics has emerged wherein electromagnetic scattering by discrete and discretely heterogeneous random media is modeled directly by using analytical or numerically exact computer solutions of the Maxwell equations. Therefore, the main objective of this Report is to formulate the general theoretical framework of electromagnetic scattering by discrete random media rooted in the Maxwell- Lorentz electromagnetics and discuss its immediate analytical and numerical consequences. Starting from the microscopic Maxwell-Lorentz equations, we trace the development of

Statistical and Probabilistic Extensions to Ground Operations' Discrete Event Simulation Modeling

Science.gov (United States)

Trocine, Linda; Cummings, Nicholas H.; Bazzana, Ashley M.; Rychlik, Nathan; LeCroy, Kenneth L.; Cates, Grant R.

2010-01-01

NASA's human exploration initiatives will invest in technologies, public/private partnerships, and infrastructure, paving the way for the expansion of human civilization into the solar system and beyond. As it is has been for the past half century, the Kennedy Space Center will be the embarkation point for humankind's journey into the cosmos. Functioning as a next generation space launch complex, Kennedy's launch pads, integration facilities, processing areas, launch and recovery ranges will bustle with the activities of the world's space transportation providers. In developing this complex, KSC teams work through the potential operational scenarios: conducting trade studies, planning and budgeting for expensive and limited resources, and simulating alternative operational schemes. Numerous tools, among them discrete event simulation (DES), were matured during the Constellation Program to conduct such analyses with the purpose of optimizing the launch complex for maximum efficiency, safety, and flexibility while minimizing life cycle costs. Discrete event simulation is a computer-based modeling technique for complex and dynamic systems where the state of the system changes at discrete points in time and whose inputs may include random variables. DES is used to assess timelines and throughput, and to support operability studies and contingency analyses. It is applicable to any space launch campaign and informs decision-makers of the effects of varying numbers of expensive resources and the impact of off nominal scenarios on measures of performance. In order to develop representative DES models, methods were adopted, exploited, or created to extend traditional uses of DES. The Delphi method was adopted and utilized for task duration estimation. DES software was exploited for probabilistic event variation. A roll-up process was used, which was developed to reuse models and model elements in other less - detailed models. The DES team continues to innovate and expand

Discrete Mathematics and Its Applications

Science.gov (United States)

Oxley, Alan

2010-01-01

The article gives ideas that lecturers of undergraduate Discrete Mathematics courses can use in order to make the subject more interesting for students and encourage them to undertake further studies in the subject. It is possible to teach Discrete Mathematics with little or no reference to computing. However, students are more likely to be…

Current density and continuity in discretized models

International Nuclear Information System (INIS)

Boykin, Timothy B; Luisier, Mathieu; Klimeck, Gerhard

2010-01-01

Discrete approaches have long been used in numerical modelling of physical systems in both research and teaching. Discrete versions of the Schroedinger equation employing either one or several basis functions per mesh point are often used by senior undergraduates and beginning graduate students in computational physics projects. In studying discrete models, students can encounter conceptual difficulties with the representation of the current and its divergence because different finite-difference expressions, all of which reduce to the current density in the continuous limit, measure different physical quantities. Understanding these different discrete currents is essential and requires a careful analysis of the current operator, the divergence of the current and the continuity equation. Here we develop point forms of the current and its divergence valid for an arbitrary mesh and basis. We show that in discrete models currents exist only along lines joining atomic sites (or mesh points). Using these results, we derive a discrete analogue of the divergence theorem and demonstrate probability conservation in a purely localized-basis approach.

Discrete Calculus as a Bridge between Scales

Science.gov (United States)

Degiuli, Eric; McElwaine, Jim

2012-02-01

Understanding how continuum descriptions of disordered media emerge from the microscopic scale is a fundamental challenge in condensed matter physics. In many systems, it is necessary to coarse-grain balance equations at the microscopic scale to obtain macroscopic equations. We report development of an exact, discrete calculus, which allows identification of discrete microscopic equations with their continuum equivalent [1]. This allows the application of powerful techniques of calculus, such as the Helmholtz decomposition, the Divergence Theorem, and Stokes' Theorem. We illustrate our results with granular materials. In particular, we show how Newton's laws for a single grain reproduce their continuum equivalent in the calculus. This allows introduction of a discrete Airy stress function, exactly as in the continuum. As an application of the formalism, we show how these results give the natural mean-field variation of discrete quantities, in agreement with numerical simulations. The discrete calculus thus acts as a bridge between discrete microscale quantities and continuous macroscale quantities. [4pt] [1] E. DeGiuli & J. McElwaine, PRE 2011. doi: 10.1103/PhysRevE.84.041310

Real-time frequency-to-time mapping based on spectrally-discrete chromatic dispersion.

Science.gov (United States)

Dai, Yitang; Li, Jilong; Zhang, Ziping; Yin, Feifei; Li, Wangzhe; Xu, Kun

2017-07-10

Traditional photonics-assisted real-time Fourier transform (RTFT) usually suffers from limited chromatic dispersion, huge volume, or large time delay and attendant loss. In this paper we propose frequency-to-time mapping (FTM) by spectrally-discrete dispersion to increase frequency sensitivity greatly. The novel media has periodic ON/OFF intensity frequency response while quadratic phase distribution along disconnected channels, which de-chirps matched optical input to repeated Fourier-transform-limited output. Real-time FTM is then obtained within each period. Since only discrete phase retardation rather than continuously-changed true time delay is required, huge equivalent dispersion is then available by compact device. Such FTM is theoretically analyzed, and implementation by cascaded optical ring resonators is proposed. After a numerical example, our theory is demonstrated by a proof-of-concept experiment, where a single loop containing 0.5-meters-long fiber is used. FTM under 400-MHz unambiguous bandwidth and 25-MHz resolution is reported. Highly-sensitive and linear mapping is achieved with 6.25 ps/MHz, equivalent to ~4.6 × 10 4 -km standard single mode fiber. Extended instantaneous bandwidth is expected by ring cascading. Our proposal may provide a promising method for real-time, low-latency Fourier transform.

Integrals of Motion for Discrete-Time Optimal Control Problems

OpenAIRE

Torres, Delfim F. M.

2003-01-01

We obtain a discrete time analog of E. Noether's theorem in Optimal Control, asserting that integrals of motion associated to the discrete time Pontryagin Maximum Principle can be computed from the quasi-invariance properties of the discrete time Lagrangian and discrete time control system. As corollaries, results for first-order and higher-order discrete problems of the calculus of variations are obtained.

Effective Hamiltonian for travelling discrete breathers

Science.gov (United States)

MacKay, Robert S.; Sepulchre, Jacques-Alexandre

2002-05-01

Hamiltonian chains of oscillators in general probably do not sustain exact travelling discrete breathers. However solutions which look like moving discrete breathers for some time are not difficult to observe in numerics. In this paper we propose an abstract framework for the description of approximate travelling discrete breathers in Hamiltonian chains of oscillators. The method is based on the construction of an effective Hamiltonian enabling one to describe the dynamics of the translation degree of freedom of moving breathers. Error estimate on the approximate dynamics is also studied. The concept of the Peierls-Nabarro barrier can be made clear in this framework. We illustrate the method with two simple examples, namely the Salerno model which interpolates between the Ablowitz-Ladik lattice and the discrete nonlinear Schrödinger system, and the Fermi-Pasta-Ulam chain.

Input-output supervisor

International Nuclear Information System (INIS)

Dupuy, R.

1970-01-01

The input-output supervisor is the program which monitors the flow of informations between core storage and peripheral equipments of a computer. This work is composed of three parts: 1 - Study of a generalized input-output supervisor. With sample modifications it looks like most of input-output supervisors which are running now on computers. 2 - Application of this theory on a magnetic drum. 3 - Hardware requirement for time-sharing. (author) [fr

Mittag-Leffler function for discrete fractional modelling

Directory of Open Access Journals (Sweden)

Guo-Cheng Wu

2016-01-01

Full Text Available From the difference equations on discrete time scales, this paper numerically investigates one discrete fractional difference equation in the Caputo delta’s sense which has an explicit solution in form of the discrete Mittag-Leffler function. The exact numerical values of the solutions are given in comparison with the truncated Mittag-Leffler function.

Fault-tolerant Control of Discrete-time LPV systems using Virtual Actuators and Sensors

DEFF Research Database (Denmark)

Tabatabaeipour, Mojtaba; Stoustrup, Jakob; Bak, Thomas

2015-01-01

This paper proposes a new fault-tolerant control (FTC) method for discrete-time linear parameter varying (LPV) systems using a reconfiguration block. The basic idea of the method is to achieve the FTC goal without re-designing the nominal controller by inserting a reconfiguration block between......, it transforms the output of the controller for the faulty system such that the stability and performance goals are preserved. Input-to-state stabilizing LPV gains of the virtual actuator and sensor are obtained by solving linear matrix inequalities (LMIs). We show that separate design of these gains guarantees....... Finally, the effectiveness of the method is demonstrated via a numerical example and stator current control of an induction motor....

Discrete/PWM Ballast-Resistor Controller

Science.gov (United States)

King, Roger J.

1994-01-01

Circuit offers low switching loss and automatic compensation for failure of ballast resistor. Discrete/PWM ballast-resistor controller improved shunt voltage-regulator circuit designed to supply power from high-resistance source to low-impedance bus. Provides both coarse discrete voltage levels (by switching of ballast resistors) and continuous fine control of voltage via pulse-width modulation.

Discretization of four types of Weyl group orbit functions

International Nuclear Information System (INIS)

Hrivnák, Jiří

2013-01-01

The discrete Fourier calculus of the four families of special functions, called C–, S–, S s – and S l -functions, is summarized. Functions from each of the four families of special functions are discretely orthogonal over a certain finite set of points. The generalizations of discrete cosine and sine transforms of one variable — the discrete S s – and S l -transforms of the group F 4 — are considered in detail required for their exploitation in discrete Fourier spectral methods. The continuous interpolations, induced by the discrete expansions, are presented

Discrete elements method of neutral particle transport

International Nuclear Information System (INIS)

Mathews, K.A.

1983-01-01

A new discrete elements (L/sub N/) transport method is derived and compared to the discrete ordinates S/sub N/ method, theoretically and by numerical experimentation. The discrete elements method is more accurate than discrete ordinates and strongly ameliorates ray effects for the practical problems studied. The discrete elements method is shown to be more cost effective, in terms of execution time with comparable storage to attain the same accuracy, for a one-dimensional test case using linear characteristic spatial quadrature. In a two-dimensional test case, a vacuum duct in a shield, L/sub N/ is more consistently convergent toward a Monte Carlo benchmark solution than S/sub N/, using step characteristic spatial quadrature. An analysis of the interaction of angular and spatial quadrature in xy-geometry indicates the desirability of using linear characteristic spatial quadrature with the L/sub N/ method

Spatially localized, temporally quasiperiodic, discrete nonlinear excitations

International Nuclear Information System (INIS)

Cai, D.; Bishop, A.R.; Gronbech-Jensen, N.

1995-01-01

In contrast to the commonly discussed discrete breather, which is a spatially localized, time-periodic solution, we present an exact solution of a discrete nonlinear Schroedinger breather which is a spatially localized, temporally quasiperiodic nonlinear coherent excitation. This breather is a multiple-soliton solution in the sense of the inverse scattering transform. A discrete breather of multiple frequencies is conceptually important in studies of nonlinear lattice systems. We point out that, for this breather, the incommensurability of its frequencies is a discrete lattice effect and these frequencies become commensurate in the continuum limit. To understand the dynamical properties of the breather, we also discuss its stability and its behavior in the presence of an external potential. Finally, we indicate how to obtain an exact N-soliton breather as a discrete generalization of the continuum multiple-soliton solution

On organizing principles of discrete differential geometry. Geometry of spheres

International Nuclear Information System (INIS)

Bobenko, Alexander I; Suris, Yury B

2007-01-01

Discrete differential geometry aims to develop discrete equivalents of the geometric notions and methods of classical differential geometry. This survey contains a discussion of the following two fundamental discretization principles: the transformation group principle (smooth geometric objects and their discretizations are invariant with respect to the same transformation group) and the consistency principle (discretizations of smooth parametrized geometries can be extended to multidimensional consistent nets). The main concrete geometric problem treated here is discretization of curvature-line parametrized surfaces in Lie geometry. Systematic use of the discretization principles leads to a discretization of curvature-line parametrization which unifies circular and conical nets.

Discrete vs. Continuous Mapping of Facial Electromyography for Human-Machine-Interface Control: Performance and Training Effects

Science.gov (United States)

Cler, Meredith J.; Stepp, Cara E.

2015-01-01

Individuals with high spinal cord injuries are unable to operate a keyboard and mouse with their hands. In this experiment, we compared two systems using surface electromyography (sEMG) recorded from facial muscles to control an onscreen keyboard to type five-letter words. Both systems used five sEMG sensors to capture muscle activity during five distinct facial gestures that were mapped to five cursor commands: move left, move right, move up, move down, and “click”. One system used a discrete movement and feedback algorithm in which the user produced one quick facial gesture, causing a corresponding discrete movement to an adjacent letter. The other system was continuously updated and allowed the user to control the cursor’s velocity by relative activation between different sEMG channels. Participants were trained on one system for four sessions on consecutive days, followed by one crossover session on the untrained system. Information transfer rates (ITRs) were high for both systems compared to other potential input modalities, both initially and with training (Session 1: 62.1 bits/min, Session 4: 105.1 bits/min). Users of the continuous system showed significantly higher ITRs than the discrete users. Future development will focus on improvements to both systems, which may offer differential advantages for users with various motor impairments. PMID:25616053

Effective lagrangian description on discrete gauge symmetries

International Nuclear Information System (INIS)

Banks, T.

1989-01-01

We exhibit a simple low-energy lagrangian which describes a system with a discrete remnant of a spontaneously broken continuous gauge symmetry. The lagrangian gives a simple description of the effects ascribed to such systems by Krauss and Wilczek: black holes carry discrete hair and interact with cosmic strings, and wormholes cannot lead to violation of discrete gauge symmetries. (orig.)

Linear discrete-time state space realization of a modified quadruple tank system with state estimation using Kalman filter

DEFF Research Database (Denmark)

Mohd. Azam, Sazuan Nazrah

2017-01-01

In this paper, we used the modified quadruple tank system that represents a multi-input-multi-output (MIMO) system as an example to present the realization of a linear discrete-time state space model and to obtain the state estimation using Kalman filter in a methodical mannered. First, an existing...... part of the Kalman filter is used to estimates the current state, based on the model and the measurements. The static and dynamic Kalman filter is compared and all results is demonstrated through simulations....

Discrete-ordinates electron transport calculations using standard neutron transport codes

International Nuclear Information System (INIS)

Morel, J.E.

1979-01-01

The primary purpose of this work was to develop a method for using standard neutron transport codes to perform electron transport calculations. The method is to develop approximate electron cross sections which are sufficiently well-behaved to be treated with standard S/sub n/ methods, but which nonetheless yield flux solutions which are very similar to the exact solutions. The main advantage of this approach is that, once the approximate cross sections are constructed, their multigroup Legendre expansion coefficients can be calculated and input to any standard S/sub n/ code. Discrete-ordinates calculations were performed to determine the accuracy of the flux solutions for problems corresponding to 1.0-MeV electrons incident upon slabs of aluminum and gold. All S/sub n/ calculations were compared with similar calculations performed with an electron Monte Carlo code, considered to be exact. In all cases, the discrete-ordinates solutions for integral flux quantities (i.e., scalar flux, energy deposition profiles, etc.) are generally in agreement with the Monte Carlo solutions to within approximately 5% or less. The central conclusion is that integral electron flux quantities can be efficiently and accurately calculated using standard S/sub n/ codes in conjunction with approximate cross sections. Furthermore, if group structures and approximate cross section construction are optimized, accurate differential flux energy spectra may also be obtainable without having to use an inordinately large number of energy groups. 1 figure

An integrable semi-discretization of the Boussinesq equation

Energy Technology Data Exchange (ETDEWEB)

Zhang, Yingnan, E-mail: ynzhang@njnu.edu.cn [Jiangsu Key Laboratory for NSLSCS, School of Mathematical Sciences, Nanjing Normal University, Nanjing, Jiangsu (China); Tian, Lixin, E-mail: tianlixin@njnu.edu.cn [Jiangsu Key Laboratory for NSLSCS, School of Mathematical Sciences, Nanjing Normal University, Nanjing, Jiangsu (China); Nonlinear Scientific Research Center, Jiangsu University, Zhenjiang, Jiangsu (China)

2016-10-23

Highlights: • A new integrable semi-discretization of the Boussinesq equation is present. • A Bäcklund transformation and a Lax pair for the differential-difference system is derived by using Hirota's bilinear method. • The soliton solutions of 'good' Boussinesq equation and numerical algorithms are investigated. - Abstract: In this paper, we present an integrable semi-discretization of the Boussinesq equation. Different from other discrete analogues, we discretize the ‘time’ variable and get an integrable differential-difference system. Under a standard limitation, the differential-difference system converges to the continuous Boussinesq equation such that the discrete system can be used to design numerical algorithms. Using Hirota's bilinear method, we find a Bäcklund transformation and a Lax pair of the differential-difference system. For the case of ‘good’ Boussinesq equation, we investigate the soliton solutions of its discrete analogue and design numerical algorithms. We find an effective way to reduce the phase shift caused by the discretization. The numerical results coincide with our analysis.

A 2+1 non-isospectral discrete integrable system and its discrete integrable coupling system

International Nuclear Information System (INIS)

Yu Fajun; Zhang Hongqing

2006-01-01

In this Letter by considering a (2+1)-dimensional discrete non-isospectral linear problem, a new (2+1)-dimensional integrable lattice hierarchy is constructed. It shows that generalization of the Blaszak-Marciniak lattice hierarchy can be obtained as a reduction. Then an extended algebraic system X-bar of X is presented, from which the integrable coupling system of the (2+1)-dimensional discrete non-isospectral Blaszak-Marciniak lattice equations are obtained

A latent low-dimensional common input drives a pool of motor neurons: a probabilistic latent state-space model.

Science.gov (United States)

Feeney, Daniel F; Meyer, François G; Noone, Nicholas; Enoka, Roger M

2017-10-01

Motor neurons appear to be activated with a common input signal that modulates the discharge activity of all neurons in the motor nucleus. It has proven difficult for neurophysiologists to quantify the variability in a common input signal, but characterization of such a signal may improve our understanding of how the activation signal varies across motor tasks. Contemporary methods of quantifying the common input to motor neurons rely on compiling discrete action potentials into continuous time series, assuming the motor pool acts as a linear filter, and requiring signals to be of sufficient duration for frequency analysis. We introduce a space-state model in which the discharge activity of motor neurons is modeled as inhomogeneous Poisson processes and propose a method to quantify an abstract latent trajectory that represents the common input received by motor neurons. The approach also approximates the variation in synaptic noise in the common input signal. The model is validated with four data sets: a simulation of 120 motor units, a pair of integrate-and-fire neurons with a Renshaw cell providing inhibitory feedback, the discharge activity of 10 integrate-and-fire neurons, and the discharge times of concurrently active motor units during an isometric voluntary contraction. The simulations revealed that a latent state-space model is able to quantify the trajectory and variability of the common input signal across all four conditions. When compared with the cumulative spike train method of characterizing common input, the state-space approach was more sensitive to the details of the common input current and was less influenced by the duration of the signal. The state-space approach appears to be capable of detecting rather modest changes in common input signals across conditions. NEW & NOTEWORTHY We propose a state-space model that explicitly delineates a common input signal sent to motor neurons and the physiological noise inherent in synaptic signal

Hairs of discrete symmetries and gravity

Energy Technology Data Exchange (ETDEWEB)

Choi, Kang Sin [Scranton Honors Program, Ewha Womans University, Seodaemun-Gu, Seoul 03760 (Korea, Republic of); Center for Fields, Gravity and Strings, CTPU, Institute for Basic Sciences, Yuseong-Gu, Daejeon 34047 (Korea, Republic of); Kim, Jihn E., E-mail: jihnekim@gmail.com [Department of Physics, Kyung Hee University, 26 Gyungheedaero, Dongdaemun-Gu, Seoul 02447 (Korea, Republic of); Center for Axion and Precision Physics Research (IBS), 291 Daehakro, Yuseong-Gu, Daejeon 34141 (Korea, Republic of); Kyae, Bumseok [Department of Physics, Pusan National University, 2 Busandaehakro-63-Gil, Geumjeong-Gu, Busan 46241 (Korea, Republic of); Nam, Soonkeon [Department of Physics, Kyung Hee University, 26 Gyungheedaero, Dongdaemun-Gu, Seoul 02447 (Korea, Republic of)

2017-06-10

Gauge symmetries are known to be respected by gravity because gauge charges carry flux lines, but global charges do not carry flux lines and are not conserved by gravitational interaction. For discrete symmetries, they are spontaneously broken in the Universe, forming domain walls. Since the realization of discrete symmetries in the Universe must involve the vacuum expectation values of Higgs fields, a string-like configuration (hair) at the intersection of domain walls in the Higgs vacua can be realized. Therefore, we argue that discrete charges are also respected by gravity.

Hairs of discrete symmetries and gravity

Directory of Open Access Journals (Sweden)

Kang Sin Choi

2017-06-01

Full Text Available Gauge symmetries are known to be respected by gravity because gauge charges carry flux lines, but global charges do not carry flux lines and are not conserved by gravitational interaction. For discrete symmetries, they are spontaneously broken in the Universe, forming domain walls. Since the realization of discrete symmetries in the Universe must involve the vacuum expectation values of Higgs fields, a string-like configuration (hair at the intersection of domain walls in the Higgs vacua can be realized. Therefore, we argue that discrete charges are also respected by gravity.

Faster Algorithms for Computing Longest Common Increasing Subsequences

DEFF Research Database (Denmark)

Kutz, Martin; Brodal, Gerth Stølting; Kaligosi, Kanela

2011-01-01

of the alphabet, and Sort is the time to sort each input sequence. For k⩾3 length-n sequences we present an algorithm which improves the previous best bound by more than a factor k for many inputs. In both cases, our algorithms are conceptually quite simple but rely on existing sophisticated data structures......We present algorithms for finding a longest common increasing subsequence of two or more input sequences. For two sequences of lengths n and m, where m⩾n, we present an algorithm with an output-dependent expected running time of and O(m) space, where ℓ is the length of an LCIS, σ is the size....... Finally, we introduce the problem of longest common weakly-increasing (or non-decreasing) subsequences (LCWIS), for which we present an -time algorithm for the 3-letter alphabet case. For the extensively studied longest common subsequence problem, comparable speedups have not been achieved for small...

Integrable lattices and their sublattices: From the discrete Moutard (discrete Cauchy-Riemann) 4-point equation to the self-adjoint 5-point scheme

International Nuclear Information System (INIS)

Doliwa, A.; Grinevich, P.; Nieszporski, M.; Santini, P. M.

2007-01-01

We present the sublattice approach, a procedure to generate, from a given integrable lattice, a sublattice which inherits its integrability features. We consider, as illustrative example of this approach, the discrete Moutard 4-point equation and its sublattice, the self-adjoint 5-point scheme on the star of the square lattice, which are relevant in the theory of the integrable discrete geometries and in the theory of discrete holomorphic and harmonic functions (in this last context, the discrete Moutard equation is called discrete Cauchy-Riemann equation). Therefore an integrable, at one energy, discretization of elliptic two-dimensional operators is considered. We use the sublattice point of view to derive, from the Darboux transformations and superposition formulas of the discrete Moutard equation, the Darboux transformations and superposition formulas of the self-adjoint 5-point scheme. We also construct, from algebro-geometric solutions of the discrete Moutard equation, algebro-geometric solutions of the self-adjoint 5-point scheme. In particular, we show that the corresponding restrictions on the finite-gap data are of the same type as those for the fixed energy problem for the two-dimensional Schroedinger operator. We finally use these solutions to construct explicit examples of discrete holomorphic and harmonic functions, as well as examples of quadrilateral surfaces in R 3

Implementation of 2D Discrete Wavelet Transform by Number Theoretic Transform and 2D Overlap-Save Method

Directory of Open Access Journals (Sweden)

Lina Yang

2014-01-01

Full Text Available To reduce the computation complexity of wavelet transform, this paper presents a novel approach to be implemented. It consists of two key techniques: (1 fast number theoretic transform(FNTT In the FNTT, linear convolution is replaced by the circular one. It can speed up the computation of 2D discrete wavelet transform. (2 In two-dimensional overlap-save method directly calculating the FNTT to the whole input sequence may meet two difficulties; namely, a big modulo obstructs the effective implementation of the FNTT and a long input sequence slows the computation of the FNTT down. To fight with such deficiencies, a new technique which is referred to as 2D overlap-save method is developed. Experiments have been conducted. The fast number theoretic transform and 2D overlap-method have been used to implement the dyadic wavelet transform and applied to contour extraction in pattern recognition.

Discrete tomography in neutron radiography

International Nuclear Information System (INIS)

Kuba, Attila; Rodek, Lajos; Kiss, Zoltan; Rusko, Laszlo; Nagy, Antal; Balasko, Marton

2005-01-01

Discrete tomography (DT) is an imaging technique for reconstructing discrete images from their projections using the knowledge that the object to be reconstructed contains only a few homogeneous materials characterized by known discrete absorption values. One of the main reasons for applying DT is that we will hopefully require relatively few projections. Using discreteness and some a priori information (such as an approximate shape of the object) we can apply two DT methods in neutron imaging by reducing the problem to an optimization task. The first method is a special one because it is only suitable if the object is composed of cylinders and sphere shapes. The second method is a general one in the sense that it can be used for reconstructing objects of any shape. Software was developed and physical experiments performed in order to investigate the effects of several reconstruction parameters: the number of projections, noise levels, and complexity of the object to be reconstructed. We give a summary of the experimental results and make a comparison of the results obtained using a classical reconstruction technique (FBP). The programs we developed are available in our DT reconstruction program package DIRECT

How Triage Nurses Use Discretion: a Literature Review

Directory of Open Access Journals (Sweden)

Lars Emil Fagernes Johannessen

2016-02-01

Full Text Available Discretion is quintessential for professional work. This review aims to understand how nurses use discretion when they perform urgency assessments in emergency departments with formalised triage systems—systems that are intended to reduce nurses’ use of discretion. Because little research has dealt explicitly with this topic, this review addresses the discretionary aspects of triage by reinterpreting qualitative studies of how triage nurses perform urgency assessments. The review shows (a how inexhaustive guidelines and a hectic work environment are factors that necessitate nurses’ use of discretion and (b how nurses reason within this discretionary space by relying on their experience and intuition, judging patients according to criteria such as appropriateness and believability, and creating urgency ratings together with their patients. The review also offers a synthesis of the findings’ discretionary aspects and suggests a new interactionist dimension of discretion.Keywords: Triage, discretion, emergency department, meta-ethnography, review, decision-making

Application of an efficient Bayesian discretization method to biomedical data

Directory of Open Access Journals (Sweden)

Gopalakrishnan Vanathi

2011-07-01

Full Text Available Abstract Background Several data mining methods require data that are discrete, and other methods often perform better with discrete data. We introduce an efficient Bayesian discretization (EBD method for optimal discretization of variables that runs efficiently on high-dimensional biomedical datasets. The EBD method consists of two components, namely, a Bayesian score to evaluate discretizations and a dynamic programming search procedure to efficiently search the space of possible discretizations. We compared the performance of EBD to Fayyad and Irani's (FI discretization method, which is commonly used for discretization. Results On 24 biomedical datasets obtained from high-throughput transcriptomic and proteomic studies, the classification performances of the C4.5 classifier and the naïve Bayes classifier were statistically significantly better when the predictor variables were discretized using EBD over FI. EBD was statistically significantly more stable to the variability of the datasets than FI. However, EBD was less robust, though not statistically significantly so, than FI and produced slightly more complex discretizations than FI. Conclusions On a range of biomedical datasets, a Bayesian discretization method (EBD yielded better classification performance and stability but was less robust than the widely used FI discretization method. The EBD discretization method is easy to implement, permits the incorporation of prior knowledge and belief, and is sufficiently fast for application to high-dimensional data.

Random vs. Combinatorial Methods for Discrete Event Simulation of a Grid Computer Network

Science.gov (United States)

Kuhn, D. Richard; Kacker, Raghu; Lei, Yu

2010-01-01

This study compared random and t-way combinatorial inputs of a network simulator, to determine if these two approaches produce significantly different deadlock detection for varying network configurations. Modeling deadlock detection is important for analyzing configuration changes that could inadvertently degrade network operations, or to determine modifications that could be made by attackers to deliberately induce deadlock. Discrete event simulation of a network may be conducted using random generation, of inputs. In this study, we compare random with combinatorial generation of inputs. Combinatorial (or t-way) testing requires every combination of any t parameter values to be covered by at least one test. Combinatorial methods can be highly effective because empirical data suggest that nearly all failures involve the interaction of a small number of parameters (1 to 6). Thus, for example, if all deadlocks involve at most 5-way interactions between n parameters, then exhaustive testing of all n-way interactions adds no additional information that would not be obtained by testing all 5-way interactions. While the maximum degree of interaction between parameters involved in the deadlocks clearly cannot be known in advance, covering all t-way interactions may be more efficient than using random generation of inputs. In this study we tested this hypothesis for t = 2, 3, and 4 for deadlock detection in a network simulation. Achieving the same degree of coverage provided by 4-way tests would have required approximately 3.2 times as many random tests; thus combinatorial methods were more efficient for detecting deadlocks involving a higher degree of interactions. The paper reviews explanations for these results and implications for modeling and simulation.

Comparison of alphabetical versus categorical display format for medication order entry in a simulated touch screen anesthesia information management system: an experiment in clinician-computer interaction in anesthesia

Directory of Open Access Journals (Sweden)

Marian Anil A

2012-05-01

Full Text Available Abstract Background Anesthesia information management system (AIMS records should be designed and configured to facilitate the accurate and prompt recording of multiple drugs administered coincidentally or in rapid succession. Methods We proposed two touch-screen display formats for use with our department’s new EPIC touch-screen AIMS. In one format, medication “buttons” were arranged in alphabetical order (i.e. A-C, D-H etc.. In the other, buttons were arranged in categories (Common, Fluids, Cardiovascular, Coagulation etc.. Both formats were modeled on an iPad screen to resemble the AIMS interface. Anesthesia residents, anesthesiologists, and Certified Registered Nurse Anesthetists (n = 60 were then asked to find and touch the correct buttons for a series of medications whose names were displayed to the side of the entry screen. The number of entries made within 2 minutes was recorded. This was done 3 times for each format, with the 1st format chosen randomly. Data were analyzed from the third trials with each format to minimize differences in learning. Results The categorical format had a mean of 5.6 more drugs entered using the categorical method in two minutes than the alphabetical format (95% confidence interval [CI] 4.5 to 6.8, P  Conclusions The use of touch-screen user interfaces in healthcare is increasingly common. Arrangement of drugs names in a categorical display format in the medication order-entry touch screen of an AIMS can result in faster data entry compared to an alphabetical arrangement of drugs. Results of this quality improvement project were used in our department’s design of our final intraoperative electronic anesthesia record. This testing approach using cognitive and usability engineering methods can be used to objectively design and evaluate many aspects of the clinician-computer interaction in electronic health records.

Discrete Riccati equation solutions: Distributed algorithms

Directory of Open Access Journals (Sweden)

D. G. Lainiotis

1996-01-01

Full Text Available In this paper new distributed algorithms for the solution of the discrete Riccati equation are introduced. The algorithms are used to provide robust and computational efficient solutions to the discrete Riccati equation. The proposed distributed algorithms are theoretically interesting and computationally attractive.

Discrete Fourier analysis of multigrid algorithms

NARCIS (Netherlands)

van der Vegt, Jacobus J.W.; Rhebergen, Sander

2011-01-01

The main topic of this report is a detailed discussion of the discrete Fourier multilevel analysis of multigrid algorithms. First, a brief overview of multigrid methods is given for discretizations of both linear and nonlinear partial differential equations. Special attention is given to the

Time Discretization Techniques

KAUST Repository

Gottlieb, S.

2016-10-12

The time discretization of hyperbolic partial differential equations is typically the evolution of a system of ordinary differential equations obtained by spatial discretization of the original problem. Methods for this time evolution include multistep, multistage, or multiderivative methods, as well as a combination of these approaches. The time step constraint is mainly a result of the absolute stability requirement, as well as additional conditions that mimic physical properties of the solution, such as positivity or total variation stability. These conditions may be required for stability when the solution develops shocks or sharp gradients. This chapter contains a review of some of the methods historically used for the evolution of hyperbolic PDEs, as well as cutting edge methods that are now commonly used.

Reactive tendencies of bibliometric indicators: Trends in the alphabetization of authorship in economics and information science

DEFF Research Database (Denmark)

Faber Frandsen, Tove; Nicolaisen, Jeppe

The paper adds a category to the list of possible negative steering effects of bibliometric indicators with a category for changes in credit assignment. The results of a longitudinal study of credit assignment practices in the fields of economics and information science are presented. The practice...... of alphabetization of authorship is demonstrated to vary significantly between the two fields. A slight increase is demonstrated to have taken place in economics during the last 30 years (1978-2007). A substantial decrease is demonstrated to have taken place in information science during the same period. A possible...... explanation for the demonstrated difference could be that information scientists have been much more aware of the bibliometric consequences of being first author compared to their colleagues in comparable fields (e.g., economics). This and other possible reactive tendencies of bibliometric indicators...

Ensemble simulations with discrete classical dynamics

DEFF Research Database (Denmark)

Toxværd, Søren

2013-01-01

For discrete classical Molecular dynamics (MD) obtained by the "Verlet" algorithm (VA) with the time increment $h$ there exist a shadow Hamiltonian $\\tilde{H}$ with energy $\\tilde{E}(h)$, for which the discrete particle positions lie on the analytic trajectories for $\\tilde{H}$. $\\tilde......{E}(h)$ is employed to determine the relation with the corresponding energy, $E$ for the analytic dynamics with $h=0$ and the zero-order estimate $E_0(h)$ of the energy for discrete dynamics, appearing in the literature for MD with VA. We derive a corresponding time reversible VA algorithm for canonical dynamics...

Discrete symmetries and de Sitter spacetime

Energy Technology Data Exchange (ETDEWEB)

Cotăescu, Ion I., E-mail: gpascu@physics.uvt.ro; Pascu, Gabriel, E-mail: gpascu@physics.uvt.ro [West University of Timişoara, V. Pârvan Ave. 4, RO-300223 Timişoara (Romania)

2014-11-24

Aspects of the ambiguity in defining quantum modes on de Sitter spacetime using a commuting system composed only of differential operators are discussed. Discrete symmetries and their actions on the wavefunction in commonly used coordinate charts are reviewed. It is argued that the system of commuting operators can be supplemented by requiring the invariance of the wavefunction to combined discrete symmetries- a criterion which selects a single state out of the α-vacuum family. Two such members of this family are singled out by particular combined discrete symmetries- states between which exists a well-known thermality relation.

Microlens array processor with programmable weight mask and direct optical input

Science.gov (United States)

Schmid, Volker R.; Lueder, Ernst H.; Bader, Gerhard; Maier, Gert; Siegordner, Jochen

1999-03-01

We present an optical feature extraction system with a microlens array processor. The system is suitable for online implementation of a variety of transforms such as the Walsh transform and DCT. Operating with incoherent light, our processor accepts direct optical input. Employing a sandwich- like architecture, we obtain a very compact design of the optical system. The key elements of the microlens array processor are a square array of 15 X 15 spherical microlenses on acrylic substrate and a spatial light modulator as transmissive mask. The light distribution behind the mask is imaged onto the pixels of a customized a-Si image sensor with adjustable gain. We obtain one output sample for each microlens image and its corresponding weight mask area as summation of the transmitted intensity within one sensor pixel. The resulting architecture is very compact and robust like a conventional camera lens while incorporating a high degree of parallelism. We successfully demonstrate a Walsh transform into the spatial frequency domain as well as the implementation of a discrete cosine transform with digitized gray values. We provide results showing the transformation performance for both synthetic image patterns and images of natural texture samples. The extracted frequency features are suitable for neural classification of the input image. Other transforms and correlations can be implemented in real-time allowing adaptive optical signal processing.

Discrete convolution-operators and radioactive disintegration. [Numerical solution

Energy Technology Data Exchange (ETDEWEB)

Kalla, S L; VALENTINUZZI, M E [UNIVERSIDAD NACIONAL DE TUCUMAN (ARGENTINA). FACULTAD DE CIENCIAS EXACTAS Y TECNOLOGIA

1975-08-01

The basic concepts of discrete convolution and discrete convolution-operators are briefly described. Then, using the discrete convolution - operators, the differential equations associated with the process of radioactive disintegration are numerically solved. The importance of the method is emphasized to solve numerically, differential and integral equations.

Periodic, quasiperiodic and chaotic discrete breathers in a parametrical driven two-dimensional discrete diatomic Klein–Gordon lattice

International Nuclear Information System (INIS)

Quan, Xu; Qiang, Tian

2009-01-01

We study a two-dimensional (2D) diatomic lattice of anharmonic oscillators with only quartic nearest-neighbor interactions, in which discrete breathers (DBs) can be explicitly constructed by an exact separation of their time and space dependence. DBs can stably exist in the 2D discrete diatomic Klein–Gordon lattice with hard and soft on-site potentials. When a parametric driving term is introduced in the factor multiplying the harmonic part of the on-site potential of the system, we can obtain the stable quasiperiodic discrete breathers (QDBs) and chaotic discrete breathers (CDBs) by changing the amplitude of the driver. But the DBs and QDBs with symmetric and anti-symmetric profiles that are centered at a heavy atom are more stable than at a light atom, because the frequencies of the DBs and QDBs centered at a heavy atom are lower than those centered at a light atom

The Comprehensive Emergent Literacy Model

OpenAIRE

Leigh Rohde

2015-01-01

The early skills of Emergent Literacy include the knowledge and abilities related to the alphabet, phonological awareness, symbolic representation, and communication. However, existing models of emergent literacy focus on discrete skills and miss the perspective of the surrounding environment. Early literacy skills, including their relationship to one another, and the substantial impact of the setting and context, are ...

Discrete modeling considerations in multiphase fluid dynamics

International Nuclear Information System (INIS)

Ransom, V.H.; Ramshaw, J.D.

1988-01-01

The modeling of multiphase flows play a fundamental role in light water reactor safety. The main ingredients in our discrete modeling Weltanschauung are the following considerations: (1) Any physical model must be cast into discrete form for a digital computer. (2) The usual approach of formulating models in differential form and then discretizing them is potentially hazardous. It may be preferable to formulate the model in discrete terms from the outset. (3) Computer time and storage constraints limit the resolution that can be employed in practical calculations. These limits effectively define the physical phenomena, length scales, and time scales which cannot be directly represented in the calculation and therefore must be modeled. This information should be injected into the model formulation process at an early stage. (4) Practical resolution limits are generally so coarse that traditional convergence and truncation-error analyses become irrelevant. (5) A discrete model constitutes a reduced description of a physical system, from which fine-scale details are eliminated. This elimination creates a statistical closure problem. Methods from statistical physics may therefore be useful in the formulation of discrete models. In the present paper we elaborate on these themes and illustrate them with simple examples. 48 refs

ColloInputGenerator

DEFF Research Database (Denmark)

2013-01-01

This is a very simple program to help you put together input files for use in Gries' (2007) R-based collostruction analysis program. It basically puts together a text file with a frequency list of lexemes in the construction and inserts a column where you can add the corpus frequencies. It requires...... it as input for basic collexeme collostructional analysis (Stefanowitsch & Gries 2003) in Gries' (2007) program. ColloInputGenerator is, in its current state, based on programming commands introduced in Gries (2009). Projected updates: Generation of complete work-ready frequency lists....

A discrete control model of PLANT

Science.gov (United States)

Mitchell, C. M.

1985-01-01

A model of the PLANT system using the discrete control modeling techniques developed by Miller is described. Discrete control models attempt to represent in a mathematical form how a human operator might decompose a complex system into simpler parts and how the control actions and system configuration are coordinated so that acceptable overall system performance is achieved. Basic questions include knowledge representation, information flow, and decision making in complex systems. The structure of the model is a general hierarchical/heterarchical scheme which structurally accounts for coordination and dynamic focus of attention. Mathematically, the discrete control model is defined in terms of a network of finite state systems. Specifically, the discrete control model accounts for how specific control actions are selected from information about the controlled system, the environment, and the context of the situation. The objective is to provide a plausible and empirically testable accounting and, if possible, explanation of control behavior.

Identification of parameters of discrete-continuous models

International Nuclear Information System (INIS)

Cekus, Dawid; Warys, Pawel

2015-01-01

In the paper, the parameters of a discrete-continuous model have been identified on the basis of experimental investigations and formulation of optimization problem. The discrete-continuous model represents a cantilever stepped Timoshenko beam. The mathematical model has been formulated and solved according to the Lagrange multiplier formalism. Optimization has been based on the genetic algorithm. The presented proceeding’s stages make the identification of any parameters of discrete-continuous systems possible

Identification of parameters of discrete-continuous models

Energy Technology Data Exchange (ETDEWEB)

Cekus, Dawid, E-mail: cekus@imipkm.pcz.pl; Warys, Pawel, E-mail: warys@imipkm.pcz.pl [Institute of Mechanics and Machine Design Foundations, Czestochowa University of Technology, Dabrowskiego 73, 42-201 Czestochowa (Poland)

2015-03-10

In the paper, the parameters of a discrete-continuous model have been identified on the basis of experimental investigations and formulation of optimization problem. The discrete-continuous model represents a cantilever stepped Timoshenko beam. The mathematical model has been formulated and solved according to the Lagrange multiplier formalism. Optimization has been based on the genetic algorithm. The presented proceeding’s stages make the identification of any parameters of discrete-continuous systems possible.

Discrete Mathematics in the Schools. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 36.

Science.gov (United States)

Rosenstein, Joseph G., Ed.; Franzblau, Deborah S., Ed.; Roberts, Fred S., Ed.

This book is a collection of articles by experienced educators and explains why and how discrete mathematics should be taught in K-12 classrooms. It includes evidence for "why" and practical guidance for "how" and also discusses how discrete mathematics can be used as a vehicle for achieving the broader goals of the major…

Summary of discrete fracture network modelling as applied to hydrogeology of the Forsmark and Laxemar sites

International Nuclear Information System (INIS)

Hartley, Lee; Roberts, David

2013-04-01

The Swedish Nuclear Fuel and Waste Management Company (SKB) is responsible for the development of a deep geological repository for spent nuclear fuel. The permitting of such a repository is informed by assessment studies to estimate the risks of the disposal method. One of the potential risks involves the transport of radionuclides in groundwater from defective canisters in the repository to the accessible environment. The Swedish programme for geological disposal of spent nuclear fuel has involved undertaking detailed surface-based site characterisation studies at two different sites, Forsmark and Laxemar-Simpevarp. A key component of the hydrogeological modelling of these two sites has been the development of Discrete Fracture Network (DFN) concepts of groundwater flow through the fractures in the crystalline rocks present. A discrete fracture network model represents some of the characteristics of fractures explicitly, such as their, orientation, intensity, size, spatial distribution, shape and transmissivity. This report summarises how the discrete fracture network methodology has been applied to model groundwater flow and transport at Forsmark and Laxemar. The account has involved summarising reports previously published by SKB between 2001 and 2011. The report describes the conceptual framework and assumptions used in interpreting site data, and in particular how data has been used to calibrate the various parameters that define the discrete fracture network representation of bedrock hydrogeology against borehole geologic and hydraulic data. Steps taken to confirm whether the developed discrete fracture network models provide a description of regional-scale groundwater flow and solute transport consistent with wider hydraulic tests hydrochemical data from Forsmark and Laxemar are discussed. It illustrates the use of derived hydrogeological DFN models in the simulations of the temperate period hydrogeology that provided input to radionuclide transport

Summary of discrete fracture network modelling as applied to hydrogeology of the Forsmark and Laxemar sites

Energy Technology Data Exchange (ETDEWEB)

Hartley, Lee; Roberts, David

2013-04-15

The Swedish Nuclear Fuel and Waste Management Company (SKB) is responsible for the development of a deep geological repository for spent nuclear fuel. The permitting of such a repository is informed by assessment studies to estimate the risks of the disposal method. One of the potential risks involves the transport of radionuclides in groundwater from defective canisters in the repository to the accessible environment. The Swedish programme for geological disposal of spent nuclear fuel has involved undertaking detailed surface-based site characterisation studies at two different sites, Forsmark and Laxemar-Simpevarp. A key component of the hydrogeological modelling of these two sites has been the development of Discrete Fracture Network (DFN) concepts of groundwater flow through the fractures in the crystalline rocks present. A discrete fracture network model represents some of the characteristics of fractures explicitly, such as their, orientation, intensity, size, spatial distribution, shape and transmissivity. This report summarises how the discrete fracture network methodology has been applied to model groundwater flow and transport at Forsmark and Laxemar. The account has involved summarising reports previously published by SKB between 2001 and 2011. The report describes the conceptual framework and assumptions used in interpreting site data, and in particular how data has been used to calibrate the various parameters that define the discrete fracture network representation of bedrock hydrogeology against borehole geologic and hydraulic data. Steps taken to confirm whether the developed discrete fracture network models provide a description of regional-scale groundwater flow and solute transport consistent with wider hydraulic tests hydrochemical data from Forsmark and Laxemar are discussed. It illustrates the use of derived hydrogeological DFN models in the simulations of the temperate period hydrogeology that provided input to radionuclide transport

Symmetries in discrete-time mechanics

International Nuclear Information System (INIS)

Khorrami, M.

1996-01-01

Based on a general formulation for discrete-time quantum mechanics, introduced by M. Khorrami (Annals Phys. 224 (1995), 101), symmetries in discrete-time quantum mechanics are investigated. It is shown that any classical continuous symmetry leads to a conserved quantity in classical mechanics, as well as quantum mechanics. The transformed wave function, however, has the correct evolution if and only if the symmetry is nonanomalous. Copyright copyright 1996 Academic Press, Inc

Variable speed wind turbine control by discrete-time sliding mode approach.

Science.gov (United States)

Torchani, Borhen; Sellami, Anis; Garcia, Germain

2016-05-01

The aim of this paper is to propose a new design variable speed wind turbine control by discrete-time sliding mode approach. This methodology is designed for linear saturated system. The saturation constraint is reported on inputs vector. To this end, the back stepping design procedure is followed to construct a suitable sliding manifold that guarantees the attainment of a stabilization control objective. It is well known that the mechanisms are investigated in term of the most proposed assumptions to deal with the damping, shaft stiffness and inertia effect of the gear. The objectives are to synthesize robust controllers that maximize the energy extracted from wind, while reducing mechanical loads and rotor speed tracking combined with an electromagnetic torque. Simulation results of the proposed scheme are presented. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

Program to solve the multigroup discrete ordinates transport equation in (x,y,z) geometry

International Nuclear Information System (INIS)

Lathrop, K.D.

1976-04-01

Numerical formulations and programming algorithms are given for the THREETRAN computer program which solves the discrete ordinates, multigroup transport equation in (x,y,z) geometry. An efficient, flexible, and general data-handling strategy is derived to make use of three hierarchies of storage: small core memory, large core memory, and disk file. Data management, input instructions, and sample problem output are described. A six-group, S 4 , 18 502 mesh point, 2 800 zone, k/sub eff/ calculation of the ZPPR-4 critical assembly required 144 min of CDC-7600 time to execute to a convergence tolerance of 5 x 10 -4 and gave results in good qualitative agreement with experiment and other calculations. 6 references

Finite-dimensional reductions of the discrete Toda chain

International Nuclear Information System (INIS)

Kazakova, T G

2004-01-01

The problem of construction of integrable boundary conditions for the discrete Toda chain is considered. The restricted chains for properly chosen closure conditions are reduced to the well-known discrete Painleve equations dP III , dP V , dP VI . Lax representations for these discrete Painleve equations are found

A Comparative Analysis of Contracted versus Alphabetical English Braille and Attitudes of English as a Foreign Language Learners: A Case Study of a Farsi-Speaking Visually Impaired Student

Science.gov (United States)

Mobaraki, Mohsen; Nazarloo, Saber Atash; Toosheh, Elaheh

2017-01-01

In the educational system of Iran, in which English is a foreign language, the duration of primary school is six years. After that, these English as a foreign language students enter high school and start to learn English during an additional six-year period. In years seven and eight, English textbooks are embossed in alphabetic English braille;…

Analysis of queueing system with discrete autoregressive arrivals having DML as marginal distribution

Directory of Open Access Journals (Sweden)

Bindu Abraham

2014-05-01

Full Text Available In this paper we analyze DAR(1/D/s Queue with Discrete Mittag-Leffler [DML(α] as marginal distribution. Simulation study of the sample path of the arrival process is conducted. For this queueing system, the stationary distribution of the system size and the waiting time distribution of an arbitrary packet is obtained with the help of matrix analytic methods and Markov regenerative theory. The quantitative effect of the stationary distribution on system size, waiting time and  the autocorrelation function as well as the parameters of the input traffic is illustrated empirically. The model is applied to a real data on the passenger arrivals at a subway bus terminal in Santiago de Chile and is established that the model well suits this data.

Convergence of posteriors for discretized log Gaussian Cox processes

DEFF Research Database (Denmark)

Waagepetersen, Rasmus Plenge

2004-01-01

In Markov chain Monte Carlo posterior computation for log Gaussian Cox processes (LGCPs) a discretization of the continuously indexed Gaussian field is required. It is demonstrated that approximate posterior expectations computed from discretized LGCPs converge to the exact posterior expectations...... when the cell sizes of the discretization tends to zero. The effect of discretization is studied in a data example....

Numerical Simulation of Antennae by Discrete Exterior Calculus

International Nuclear Information System (INIS)

Xie Zheng; Ye Zheng; Ma Yujie

2009-01-01

Numerical simulation of antennae is a topic in computational electromagnetism, which is concerned with the numerical study of Maxwell equations. By discrete exterior calculus and the lattice gauge theory with coefficient R, we obtain the Bianchi identity on prism lattice. By defining an inner product of discrete differential forms, we derive the source equation and continuity equation. Those equations compose the discrete Maxwell equations in vacuum case on discrete manifold, which are implemented on Java development platform to simulate the Gaussian pulse radiation on antennaes. (electromagnetism, optics, acoustics, heat transfer, classical mechanics, and fluid dynamics)

A Variational Approach to Perturbed Discrete Anisotropic Equations

Directory of Open Access Journals (Sweden)

Amjad Salari

2016-01-01

Full Text Available We continue the study of discrete anisotropic equations and we will provide new multiplicity results of the solutions for a discrete anisotropic equation. We investigate the existence of infinitely many solutions for a perturbed discrete anisotropic boundary value problem. The approach is based on variational methods and critical point theory.

Variance Swap Replication: Discrete or Continuous?

Directory of Open Access Journals (Sweden)

Fabien Le Floc’h

2018-02-01

Full Text Available The popular replication formula to price variance swaps assumes continuity of traded option strikes. In practice, however, there is only a discrete set of option strikes traded on the market. We present here different discrete replication strategies and explain why the continuous replication price is more relevant.

Perfect discretization of path integrals

OpenAIRE

Steinhaus, Sebastian

2011-01-01

In order to obtain a well-defined path integral one often employs discretizations. In the case of General Relativity these generically break diffeomorphism symmetry, which has severe consequences since these symmetries determine the dynamics of the corresponding system. In this article we consider the path integral of reparametrization invariant systems as a toy example and present an improvement procedure for the discretized propagator. Fixed points and convergence of the procedure are discu...

Electromyography (EMG) signal recognition using combined discrete wavelet transform based adaptive neuro-fuzzy inference systems (ANFIS)

Science.gov (United States)

Arozi, Moh; Putri, Farika T.; Ariyanto, Mochammad; Khusnul Ari, M.; Munadi, Setiawan, Joga D.

2017-01-01

People with disabilities are increasing from year to year either due to congenital factors, sickness, accident factors and war. One form of disability is the case of interruptions of hand function. The condition requires and encourages the search for solutions in the form of creating an artificial hand with the ability as a human hand. The development of science in the field of neuroscience currently allows the use of electromyography (EMG) to control the motion of artificial prosthetic hand into the necessary use of EMG as an input signal to control artificial prosthetic hand. This study is the beginning of a significant research planned in the development of artificial prosthetic hand with EMG signal input. This initial research focused on the study of EMG signal recognition. Preliminary results show that the EMG signal recognition using combined discrete wavelet transform and Adaptive Neuro-Fuzzy Inference System (ANFIS) produces accuracy 98.3 % for training and 98.51% for testing. Thus the results can be used as an input signal for Simulink block diagram of a prosthetic hand that will be developed on next study. The research will proceed with the construction of artificial prosthetic hand along with Simulink program controlling and integrating everything into one system.

Lax Pairs for Discrete Integrable Equations via Darboux Transformations

International Nuclear Information System (INIS)

Cao Ce-Wen; Zhang Guang-Yao

2012-01-01

A method is developed to construct discrete Lax pairs using Darboux transformations. More kinds of Lax pairs are found for some newly appeared discrete integrable equations, including the H1, the special H3 and the Q1 models in the Adler—Bobenko—Suris list and the closely related discrete and semi-discrete pKdV, pMKdV, SG and Liouville equations. (general)

Graph-cut based discrete-valued image reconstruction.

Science.gov (United States)

Tuysuzoglu, Ahmet; Karl, W Clem; Stojanovic, Ivana; Castañòn, David; Ünlü, M Selim

2015-05-01

Efficient graph-cut methods have been used with great success for labeling and denoising problems occurring in computer vision. Unfortunately, the presence of linear image mappings has prevented the use of these techniques in most discrete-amplitude image reconstruction problems. In this paper, we develop a graph-cut based framework for the direct solution of discrete amplitude linear image reconstruction problems cast as regularized energy function minimizations. We first analyze the structure of discrete linear inverse problem cost functions to show that the obstacle to the application of graph-cut methods to their solution is the variable mixing caused by the presence of the linear sensing operator. We then propose to use a surrogate energy functional that overcomes the challenges imposed by the sensing operator yet can be utilized efficiently in existing graph-cut frameworks. We use this surrogate energy functional to devise a monotonic iterative algorithm for the solution of discrete valued inverse problems. We first provide experiments using local convolutional operators and show the robustness of the proposed technique to noise and stability to changes in regularization parameter. Then we focus on nonlocal, tomographic examples where we consider limited-angle data problems. We compare our technique with state-of-the-art discrete and continuous image reconstruction techniques. Experiments show that the proposed method outperforms state-of-the-art techniques in challenging scenarios involving discrete valued unknowns.

Discrete Chebyshev nets and a universal permutability theorem

International Nuclear Information System (INIS)

Schief, W K

2007-01-01

The Pohlmeyer-Lund-Regge system which was set down independently in the contexts of Lagrangian field theories and the relativistic motion of a string and which played a key role in the development of a geometric interpretation of soliton theory is known to appear in a variety of important guises such as the vectorial Lund-Regge equation, the O(4) nonlinear σ-model and the SU(2) chiral model. Here, it is demonstrated that these avatars may be discretized in such a manner that both integrability and equivalence are preserved. The corresponding discretization procedure is geometric and algebraic in nature and based on discrete Chebyshev nets and generalized discrete Lelieuvre formulae. In connection with the derivation of associated Baecklund transformations, it is shown that a generalized discrete Lund-Regge equation may be interpreted as a universal permutability theorem for integrable equations which admit commuting matrix Darboux transformations acting on su(2) linear representations. Three-dimensional coordinate systems and lattices of 'Lund-Regge' type related to particular continuous and discrete Zakharov-Manakov systems are obtained as a by-product of this analysis

An Improved Global Harmony Search Algorithm for the Identification of Nonlinear Discrete-Time Systems Based on Volterra Filter Modeling

Directory of Open Access Journals (Sweden)

Zongyan Li

2016-01-01

Full Text Available This paper describes an improved global harmony search (IGHS algorithm for identifying the nonlinear discrete-time systems based on second-order Volterra model. The IGHS is an improved version of the novel global harmony search (NGHS algorithm, and it makes two significant improvements on the NGHS. First, the genetic mutation operation is modified by combining normal distribution and Cauchy distribution, which enables the IGHS to fully explore and exploit the solution space. Second, an opposition-based learning (OBL is introduced and modified to improve the quality of harmony vectors. The IGHS algorithm is implemented on two numerical examples, and they are nonlinear discrete-time rational system and the real heat exchanger, respectively. The results of the IGHS are compared with those of the other three methods, and it has been verified to be more effective than the other three methods on solving the above two problems with different input signals and system memory sizes.

Discrete Morse functions for graph configuration spaces

International Nuclear Information System (INIS)

Sawicki, A

2012-01-01

We present an alternative application of discrete Morse theory for two-particle graph configuration spaces. In contrast to previous constructions, which are based on discrete Morse vector fields, our approach is through Morse functions, which have a nice physical interpretation as two-body potentials constructed from one-body potentials. We also give a brief introduction to discrete Morse theory. Our motivation comes from the problem of quantum statistics for particles on networks, for which generalized versions of anyon statistics can appear. (paper)

The effects of metronomic pendular adjustment versus tap-tempo input on the stability and accuracy of tempo perception.

Science.gov (United States)

Brodsky, Warren

2005-06-01

This study explores tempo stability and accuracy while comparing two subject-response modes: the traditional metronomic pendular adjustment task versus tap-tempo input. Experiment 1 questioned if a single correct tempo measurement consistently emerges from repeated listenings, and if subject-response mode affects tempo stability and accuracy. Experiment 2 assessed incremental improvement between two repeated sessions, and questioned the incidence of self-pacing or congruent effects of potential delays on tempo responses. While single-session studies have shown that listeners find some tempos more enjoyable, can notice discrete differences in pace, and can remember rhythmic speed over prolonged periods of time, the current study employs a multiple-session format focusing on two diametrically opposed subject-response modes. The findings show that tempo responses by listeners without formal music training were consistent across listening sessions, and that responses from tap-tempo input were significantly more stable and accurate than responses from metronomic pendular adjustment tasks.

Manifestly gauge invariant discretizations of the Schrödinger equation

International Nuclear Information System (INIS)

Halvorsen, Tore Gunnar; Kvaal, Simen

2012-01-01

Grid-based discretizations of the time dependent Schrödinger equation coupled to an external magnetic field are converted to manifest gauge invariant discretizations. This is done using generalizations of ideas used in classical lattice gauge theory, and the process defined is applicable to a large class of discretized differential operators. In particular, popular discretizations such as pseudospectral discretizations using the fast Fourier transform can be transformed to gauge invariant schemes. Also generic gauge invariant versions of generic time integration methods are considered, enabling completely gauge invariant calculations of the time dependent Schrödinger equation. Numerical examples illuminating the differences between a gauge invariant discretization and conventional discretization procedures are also presented. -- Highlights: ► We investigate the Schrödinger equation coupled to an external magnetic field. ► Any grid-based discretization is made trivially gauge invariant. ► An extension of classical lattice gauge theory.

Mathematical aspects of the discrete space-time hypothesis

International Nuclear Information System (INIS)

Sardanashvili, G.A.

1979-01-01

A hypothesis of a microcosm space discreteness is considered from the theoretical-mathematical point of view. The type of topological spaces, which formalizes representations on the discrete space-time, is determined. It is explained, how these spaces arise in physical models. The physical task, in which the discrete space could arise as a version of its solution, is considered. It is shown that the discrete structure of space can arise with a certain interaction type in the system, for example, with its considerable self-shielding, which can take place, in particular, in the particles or in the cosmological and astrophysical singularities

Discrete-Time Systems

Indian Academy of Sciences (India)

We also describe discrete-time systems in terms of difference ... A more modern alternative, especially for larger systems, is to convert ... In other words, ..... picture?) State-variable equations are also called state-space equations because the ...

Total dose induced increase in input offset voltage in JFET input operational amplifiers

International Nuclear Information System (INIS)

Pease, R.L.; Krieg, J.; Gehlhausen, M.; Black, J.

1999-01-01

Four different types of commercial JFET input operational amplifiers were irradiated with ionizing radiation under a variety of test conditions. All experienced significant increases in input offset voltage (Vos). Microprobe measurement of the electrical characteristics of the de-coupled input JFETs demonstrates that the increase in Vos is a result of the mismatch of the degraded JFETs. (authors)

The weak-scale hierarchy and discrete symmetries

International Nuclear Information System (INIS)

Haba, Naoyuki; Matsuoka, Takeo; Hattori, Chuichiro; Matsuda, Masahisa; Mochinaga, Daizo.

1996-01-01

In the underlying Planck scale theory, we introduce a certain type of discrete symmetry, which potentially brings the stability of the weak-scale hierarchy under control. Under the discrete symmetry the μ-problem and the tadpole problem can be solved simultaneously without relying on some fine-tuning of parameters. Instead, it is required that doublet Higgs and color-triplet Higgs fields reside in different irreducible representations of the gauge symmetry group at the Planck scale and that they have distinct charges of the discrete symmetry group. (author)

Limit sets for the discrete spectrum of complex Jacobi matrices

International Nuclear Information System (INIS)

Golinskii, L B; Egorova, I E

2005-01-01

The discrete spectrum of complex Jacobi matrices that are compact perturbations of the discrete Laplacian is studied. The precise stabilization rate (in the sense of order) of the matrix elements ensuring the finiteness of the discrete spectrum is found. An example of a Jacobi matrix with discrete spectrum having a unique limit point is constructed. These results are discrete analogues of Pavlov's well-known results on Schroedinger operators with complex potential on a half-axis.

Network Science Research Laboratory (NSRL) Discrete Event Toolkit

Science.gov (United States)

2016-01-01

ARL-TR-7579 ● JAN 2016 US Army Research Laboratory Network Science Research Laboratory (NSRL) Discrete Event Toolkit by...Laboratory (NSRL) Discrete Event Toolkit by Theron Trout and Andrew J Toth Computational and Information Sciences Directorate, ARL...Research Laboratory (NSRL) Discrete Event Toolkit 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) Theron Trout

Lax pairs for ultra-discrete Painleve cellular automata

International Nuclear Information System (INIS)

Joshi, N; Nijhoff, F W; Ormerod, C

2004-01-01

Ultra-discrete versions of the discrete Painleve equations are well known. However, evidence for their integrability has so far been restricted. In this letter, we show that their Lax pairs can be constructed and, furthermore, that compatibility conditions of the result yield the ultra-discrete Painleve equation. For conciseness, we restrict our attention to a new d-P III . (letter to the editor)

Constitutive equations for discrete electromagnetic problems over polyhedral grids

International Nuclear Information System (INIS)

Codecasa, Lorenzo; Trevisan, Francesco

2007-01-01

In this paper a novel approach is proposed for constructing discrete counterparts of constitutive equations over polyhedral grids which ensure both consistency and stability of the algebraic equations discretizing an electromagnetic field problem. The idea is to construct discrete constitutive equations preserving the thermodynamic relations for constitutive equations. In this way, consistency and stability of the discrete equations are ensured. At the base, a purely geometric condition between the primal and the dual grids has to be satisfied for a given primal polyhedral grid, by properly choosing the dual grid. Numerical experiments demonstrate that the proposed discrete constitutive equations lead to accurate approximations of the electromagnetic field

Identification of a parametric, discrete-time model of ankle stiffness.

Science.gov (United States)

Guarin, Diego L; Jalaleddini, Kian; Kearney, Robert E

2013-01-01

Dynamic ankle joint stiffness defines the relationship between the position of the ankle and the torque acting about it and can be separated into intrinsic and reflex components. Under stationary conditions, intrinsic stiffness can described by a linear second order system while reflex stiffness is described by Hammerstein system whose input is delayed velocity. Given that reflex and intrinsic torque cannot be measured separately, there has been much interest in the development of system identification techniques to separate them analytically. To date, most methods have been nonparametric and as a result there is no direct link between the estimated parameters and those of the stiffness model. This paper presents a novel algorithm for identification of a discrete-time model of ankle stiffness. Through simulations we show that the algorithm gives unbiased results even in the presence of large, non-white noise. Application of the method to experimental data demonstrates that it produces results consistent with previous findings.

Painleve test and discrete Boltzmann equations

International Nuclear Information System (INIS)

Euler, N.; Steeb, W.H.

1989-01-01

The Painleve test for various discrete Boltzmann equations is performed. The connection with integrability is discussed. Furthermore the Lie symmetry vector fields are derived and group-theoretical reduction of the discrete Boltzmann equations to ordinary differentiable equations is performed. Lie Backlund transformations are gained by performing the Painleve analysis for the ordinary differential equations. 16 refs

Adaptive Core Simulation Employing Discrete Inverse Theory - Part II: Numerical Experiments

International Nuclear Information System (INIS)

Abdel-Khalik, Hany S.; Turinsky, Paul J.

2005-01-01

Use of adaptive simulation is intended to improve the fidelity and robustness of important core attribute predictions such as core power distribution, thermal margins, and core reactivity. Adaptive simulation utilizes a selected set of past and current reactor measurements of reactor observables, i.e., in-core instrumentation readings, to adapt the simulation in a meaningful way. The companion paper, ''Adaptive Core Simulation Employing Discrete Inverse Theory - Part I: Theory,'' describes in detail the theoretical background of the proposed adaptive techniques. This paper, Part II, demonstrates several computational experiments conducted to assess the fidelity and robustness of the proposed techniques. The intent is to check the ability of the adapted core simulator model to predict future core observables that are not included in the adaption or core observables that are recorded at core conditions that differ from those at which adaption is completed. Also, this paper demonstrates successful utilization of an efficient sensitivity analysis approach to calculate the sensitivity information required to perform the adaption for millions of input core parameters. Finally, this paper illustrates a useful application for adaptive simulation - reducing the inconsistencies between two different core simulator code systems, where the multitudes of input data to one code are adjusted to enhance the agreement between both codes for important core attributes, i.e., core reactivity and power distribution. Also demonstrated is the robustness of such an application

Recent developments in discrete ordinates electron transport

International Nuclear Information System (INIS)

Morel, J.E.; Lorence, L.J. Jr.

1986-01-01

The discrete ordinates method is a deterministic method for numerically solving the Boltzmann equation. It was originally developed for neutron transport calculations, but is routinely used for photon and coupled neutron-photon transport calculations as well. The computational state of the art for coupled electron-photon transport (CEPT) calculations is not as developed as that for neutron transport calculations. The only production codes currently available for CEPT calculations are condensed-history Monte Carlo codes such as the ETRAN and ITS codes. A deterministic capability for production calculations is clearly needed. In response to this need, we have begun the development of a production discrete ordinates code for CEPT calculations. The purpose of this paper is to describe the basic approach we are taking, discuss the current status of the project, and present some new computational results. Although further characterization of the coupled electron-photon discrete ordinates method remains to be done, the results to date indicate that the discrete ordinates method can be just as accurate and from 10 to 100 times faster than the Monte Carlo method for a wide variety of problems. We stress that these results are obtained with standard discrete ordinates codes such as ONETRAN. It is clear that even greater efficiency can be obtained by developing a new generation of production discrete ordinates codes specifically designed to solve the Boltzmann-Fokker-Planck equation. However, the prospects for such development in the near future appear to be remote

Discrete quantum gravity

International Nuclear Information System (INIS)

Williams, Ruth M

2006-01-01

A review is given of a number of approaches to discrete quantum gravity, with a restriction to those likely to be relevant in four dimensions. This paper is dedicated to Rafael Sorkin on the occasion of his sixtieth birthday

Integrable discretizations of the (2+1)-dimensional sinh-Gordon equation

International Nuclear Information System (INIS)

Hu, Xing-Biao; Yu, Guo-Fu

2007-01-01

In this paper, we propose two semi-discrete equations and one fully discrete equation and study them by Hirota's bilinear method. These equations have continuum limits into a system which admits the (2+1)-dimensional generalization of the sinh-Gordon equation. As a result, two integrable semi-discrete versions and one fully discrete version for the sinh-Gordon equation are found. Baecklund transformations, nonlinear superposition formulae, determinant solution and Lax pairs for these discrete versions are presented

Integrable discretization s of derivative nonlinear Schroedinger equations

International Nuclear Information System (INIS)

Tsuchida, Takayuki

2002-01-01

We propose integrable discretizations of derivative nonlinear Schroedinger (DNLS) equations such as the Kaup-Newell equation, the Chen-Lee-Liu equation and the Gerdjikov-Ivanov equation by constructing Lax pairs. The discrete DNLS systems admit the reduction of complex conjugation between two dependent variables and possess bi-Hamiltonian structure. Through transformations of variables and reductions, we obtain novel integrable discretizations of the nonlinear Schroedinger (NLS), modified KdV (mKdV), mixed NLS, matrix NLS, matrix KdV, matrix mKdV, coupled NLS, coupled Hirota, coupled Sasa-Satsuma and Burgers equations. We also discuss integrable discretizations of the sine-Gordon equation, the massive Thirring model and their generalizations. (author)

Multivariable biorthogonal continuous--discrete Wilson and Racah polynomials

International Nuclear Information System (INIS)

Tratnik, M.V.

1990-01-01

Several families of multivariable, biorthogonal, partly continuous and partly discrete, Wilson polynomials are presented. These yield limit cases that are purely continuous in some of the variables and purely discrete in the others, or purely discrete in all the variables. The latter are referred to as the multivariable biorthogonal Racah polynomials. Interesting further limit cases include the multivariable biorthogonal Hahn and dual Hahn polynomials

Degree distribution in discrete case

International Nuclear Information System (INIS)

Wang, Li-Na; Chen, Bin; Yan, Zai-Zai

2011-01-01

Vertex degree of many network models and real-life networks is limited to non-negative integer. By means of measure and integral, the relation of the degree distribution and the cumulative degree distribution in discrete case is analyzed. The degree distribution, obtained by the differential of its cumulative, is only suitable for continuous case or discrete case with constant degree change. When degree change is not a constant but proportional to degree itself, power-law degree distribution and its cumulative have the same exponent and the mean value is finite for power-law exponent greater than 1. -- Highlights: → Degree change is the crux for using the cumulative degree distribution method. → It suits for discrete case with constant degree change. → If degree change is proportional to degree, power-law degree distribution and its cumulative have the same exponent. → In addition, the mean value is finite for power-law exponent greater than 1.

Quality of diabetes care worldwide and feasibility of implementation of the Alphabet Strategy: GAIA project (Global Alphabet Strategy Implementation Audit).

Science.gov (United States)

Lee, James D; Saravanan, Ponnusamy; Varadhan, Lakshminarayanan; Morrissey, John R; Patel, Vinod

2014-10-11

The Alphabet Strategy (AS) is a diabetes care checklist ensuring "important, simple things are done right all the time." Current audits of diabetes care in developed countries reveal wide variations in quality with performance of care processes frequently sub-optimal. This study had three components:• an audit to assess diabetes care quality worldwide,• a questionnaire study seeking opinions on the merits of the AS,• a pilot study to assess the practicality of implementation of the AS in a low socioeconomic setting. Audit data was collected from 52 centres across 32 countries. Data from 4537 patients were converted to Quality and Outcome Framework (QOF) scores to enable inter-centre comparison. These were compared to each country's Gross Domestic Product (GDP), and Total Health Expenditure percentage per capita (THE%). The opinions of diabetes patients and healthcare professionals from the diabetes care team at each of these centres were sought through a structured questionnaire. A retrospective audit on 100 randomly selected case notes was conducted prior to AS implementation in a diabetes outpatient clinic in India, followed by a prospective audit after four months to assess its impact on care quality. QOF scores showed wide variation across the centres (mean 49.0, range 10.2-90.1). Although there was a positive relationship between GDP and THE% to QOF scores, there were exceptions. 91% of healthcare professionals felt the AS approach was practical. Patients found the checklist to be a useful education tool. Significant improvements in several aspects of care as well as 36% improvement in QOF score were seen following implementation. International centres observed large variations in care quality, with standards frequently sub-optimal. 71% of health care professionals would consider adopting the AS in their daily practice. Implementation in a low resource country resulted in significant improvements in some aspects of diabetes care. The AS checklist for

Direct Discrete Method for Neutronic Calculations

International Nuclear Information System (INIS)

Vosoughi, Naser; Akbar Salehi, Ali; Shahriari, Majid

2002-01-01

The objective of this paper is to introduce a new direct method for neutronic calculations. This method which is named Direct Discrete Method, is simpler than the neutron Transport equation and also more compatible with physical meaning of problems. This method is based on physic of problem and with meshing of the desired geometry, writing the balance equation for each mesh intervals and with notice to the conjunction between these mesh intervals, produce the final discrete equations series without production of neutron transport differential equation and mandatory passing from differential equation bridge. We have produced neutron discrete equations for a cylindrical shape with two boundary conditions in one group energy. The correction of the results from this method are tested with MCNP-4B code execution. (authors)

On the discrete Gabor transform and the discrete Zak transform

NARCIS (Netherlands)

Bastiaans, M.J.; Geilen, M.C.W.

1996-01-01

Gabor's expansion of a discrete-time signal into a set of shifted and modulated versions of an elementary signal (or synthesis window) and the inverse operation -- the Gabor transform -- with which Gabor's expansion coefficients can be determined, are introduced. It is shown how, in the case of a

Simulating first order optical systems—algorithms for and composition of discrete linear canonical transforms

Science.gov (United States)

Healy, John J.

2018-01-01

The linear canonical transforms (LCTs) are a parameterised group of linear integral transforms. The LCTs encompass a number of well-known transformations as special cases, including the Fourier transform, fractional Fourier transform, and the Fresnel integral. They relate the scalar wave fields at the input and output of systems composed of thin lenses and free space, along with other quadratic phase systems. In this paper, we perform a systematic search of all algorithms based on up to five stages of magnification, chirp multiplication and Fourier transforms. Based on that search, we propose a novel algorithm, for which we present numerical results. We compare the sampling requirements of three algorithms. Finally, we discuss some issues surrounding the composition of discrete LCTs.

'Quantization' of stochastic variables: description and effects on the input noise sources in a BWR

International Nuclear Information System (INIS)

Matthey, M.

1979-01-01

A set of macrostochastic and discrete variables, with Markovian properties, is used to characterize the state of a BWR, whose input noise sources are of interest. The ratio between the auto-power spectral density (APSD) of the neutron noise fluctuations and the square modulus of the transfer function (SMTF) defines 'the total input noise source' (TINS), the components of which are the different noise source corresponding to the relevant variables. A white contribution to TINS arises from the birth and death processes of neutrons in the reactor and corresponds to a 'shot noise' (SN). Non-white contributions arise from fluctuations of the neutron cross-sections caused by fuel temperature and steam content variations. These terms called 'Flicker noises' (FN) are characterized by cut-off frequencies related to time constants of reactivity feedback effects. The respective magnitudes of the shot and flicker noises depend not only on the frequency, the feedback reactivity coefficients or the power of the reactor, but also on the 'quantization' of the continuous variables introduced such as fuel temperature and steam content. The effects of this last 'quantization' on the shapes of the noise sources and their sum are presented in this paper. (author)

Canonic FFT flow graphs for real-valued even/odd symmetric inputs

Science.gov (United States)

Lao, Yingjie; Parhi, Keshab K.

2017-12-01

Canonic real-valued fast Fourier transform (RFFT) has been proposed to reduce the arithmetic complexity by eliminating redundancies. In a canonic N-point RFFT, the number of signal values at each stage is canonic with respect to the number of signal values, i.e., N. The major advantage of the canonic RFFTs is that these require the least number of butterfly operations and only real datapaths when mapped to architectures. In this paper, we consider the FFT computation whose inputs are not only real but also even/odd symmetric, which indeed lead to the well-known discrete cosine and sine transforms (DCTs and DSTs). Novel algorithms for generating the flow graphs of canonic RFFTs with even/odd symmetric inputs are proposed. It is shown that the proposed algorithms lead to canonic structures with N/2 +1 signal values at each stage for an N-point real even symmetric FFT (REFFT) or N/2 -1 signal values at each stage for an N-point RFFT real odd symmetric FFT (ROFFT). In order to remove butterfly operations, several twiddle factor transformations are proposed in this paper. We also discuss the design of canonic REFFT for any composite length. Performances of the canonic REFFT/ROFFT are also discussed. It is shown that the flow graph of canonic REFFT/ROFFT has less number of interconnections, less butterfly operations, and less twiddle factor operations, compared to prior works.

Discrete Choice and Rational Inattention

DEFF Research Database (Denmark)

Fosgerau, Mogens; Melo, Emerson; de Palma, André

2017-01-01

This paper establishes a general equivalence between discrete choice and rational inattention models. Matejka and McKay (2015, AER) showed that when information costs are modelled using the Shannon entropy, the result- ing choice probabilities in the rational inattention model take the multinomial...... logit form. We show that when information costs are modelled using a class of generalized entropies, then the choice probabilities in any rational inattention model are observationally equivalent to some additive random utility discrete choice model and vice versa. This equivalence arises from convex...

Process algebra with timing : real time and discrete time

NARCIS (Netherlands)

Baeten, J.C.M.; Middelburg, C.A.; Bergstra, J.A.; Ponse, A.J.; Smolka, S.A.

2001-01-01

We present real time and discrete time versions of ACP with absolute timing and relative timing. The starting-point is a new real time version with absolute timing, called ACPsat, featuring urgent actions and a delay operator. The discrete time versions are conservative extensions of the discrete

Process algebra with timing: Real time and discrete time

NARCIS (Netherlands)

Baeten, J.C.M.; Middelburg, C.A.

1999-01-01

We present real time and discrete time versions of ACP with absolute timing and relative timing. The startingpoint is a new real time version with absolute timing, called ACPsat , featuring urgent actions and a delay operator. The discrete time versions are conservative extensions of the discrete

A PC-based discrete tomography imaging software system for assaying radioactive waste containers

International Nuclear Information System (INIS)

Palacios, J.C.; Longoria, L.C.; Santos, J.; Perry, R.T.

2003-01-01

A PC-based discrete tomography imaging software system for assaying radioactive waste containers for use in facilities in Mexico has been developed. The software system consists of three modules: (i) for reconstruction transmission tomography, (ii) for reconstruction emission tomography, and (iii) for simulation tomography. The Simulation Module is an interactive computer program that is used to create simulated databases for input to the Reconstruction Modules. These databases may be used in the absence of physical measurements to insure that the tomographic theoretical models are valid and that the coding accurately describes these models. Simulation may also be used to determine the detection limits of the reconstruction methodology. A description of the system, the theory, and a demonstration of the systems capabilities is provided in the paper. The hardware for this system is currently under development

A hierarchy of Liouville integrable discrete Hamiltonian equations

Energy Technology Data Exchange (ETDEWEB)

Xu Xixiang [College of Science, Shandong University of Science and Technology, Qingdao 266510 (China)], E-mail: xixiang_xu@yahoo.com.cn

2008-05-12

Based on a discrete four-by-four matrix spectral problem, a hierarchy of Lax integrable lattice equations with two potentials is derived. Two Hamiltonian forms are constructed for each lattice equation in the resulting hierarchy by means of the discrete variational identity. A strong symmetry operator of the resulting hierarchy is given. Finally, it is shown that the resulting lattice equations are all Liouville integrable discrete Hamiltonian systems.

Variational discretization of the nonequilibrium thermodynamics of simple systems

Science.gov (United States)

Gay-Balmaz, François; Yoshimura, Hiroaki

2018-04-01

In this paper, we develop variational integrators for the nonequilibrium thermodynamics of simple closed systems. These integrators are obtained by a discretization of the Lagrangian variational formulation of nonequilibrium thermodynamics developed in (Gay-Balmaz and Yoshimura 2017a J. Geom. Phys. part I 111 169–93 Gay-Balmaz and Yoshimura 2017b J. Geom. Phys. part II 111 194–212) and thus extend the variational integrators of Lagrangian mechanics, to include irreversible processes. In the continuous setting, we derive the structure preserving property of the flow of such systems. This property is an extension of the symplectic property of the flow of the Euler–Lagrange equations. In the discrete setting, we show that the discrete flow solution of our numerical scheme verifies a discrete version of this property. We also present the regularity conditions which ensure the existence of the discrete flow. We finally illustrate our discrete variational schemes with the implementation of an example of a simple and closed system.

Identification of some cross flow heat exchanger dynamic responses by measurement with low level binary pseudo-random input signals

International Nuclear Information System (INIS)

Corran, E.R.; Cummins, J.D.; Hopkinson, A.

1964-02-01

An experiment was performed to assess the usefulness of the binary cross-correlation method in the context of the identification problem. An auxiliary burner was excited with a discrete interval binary code and the response to the perturbation of the input heat was observed by recording the variations of the primary inlet, primary outlet and secondary outlet temperatures. The observations were analysed to yield cross-correlation functions and frequency responses were subsequently determined between primary inlet and primary outlet temperatures and also between primary inlet and secondary outlet temperatures. The analysis verified (1) that these dynamic responses of this cross flow heat exchanger may be predicted theoretically, (2) in so far as this heat exchanger is representative of the generality of plant, that the binary cross-correlation method provides adequate identification of plant dynamics for control purposes in environments where small input variations and low signal to noise ratio are obligatory. (author)

Theoretical Characterization of Sulfur-to-Selenium Substitution in an Emissive RNA Alphabet: Impact on H-bonding Potential and Photophysical Properties

KAUST Repository

Chawla, Mohit

2018-02-23

We employ density functional theory (DFT) and time-dependent DFT (TDDFT) calculations to investigate the structural, energetic and optical properties of a new computationally designed RNA alphabet, where the nucleobases,tsA, tsG, tsC, and tsU (ts-bases), have been derived by replacing sulfur with selenium in the previously reported tz-bases, based on the isothiazolo[4.3-d]pyrimidine heterocycle core. We find out that the modeled non-natural bases have minimal impact on the geometry and energetics of the classical Watson-Crick base pairs, thus potentially mimicking the natural bases in a RNA duplex in terms of H-bonding. In contrast, our calculations indicate that H-bonded base pairs involving the Hoogsteen edge of purines are destabilized as compared to their natural counterparts. We also focus on the photophysical properties of the non-natural bases and correlate their absorption/emission peaks to the strong impact of the modification on the energy of the lowest unoccupied molecular orbital. It is indeed stabilized by roughly 1.1-1.6 eV as compared to the natural analogues, resulting in a reduction of the gap between the highest occupied and the lowest unoccupied molecular orbital from 5.3-5.5 eV in the natural bases to 3.9-4.2 eV in the modified ones, with a consequent bathochromic shift in the absorption and emission spectra. Overall, our analysis clearly indicates that the newly modelled ts-bases are expected to exhibit better fluorescent properties as compared to the previously reported tz-bases, while retaining similar H-bonding properties. In addition, we show that a new RNA alphabet based on size-extended benzo-homologated ts-bases can also form stable Watson-Crick base pairs with the natural complementary nucleobases.

Discrete breathers in Bose–Einstein condensates

International Nuclear Information System (INIS)

Franzosi, Roberto; Politi, Antonio; Livi, Roberto; Oppo, Gian-Luca

2011-01-01

Discrete breathers, originally introduced in the context of biopolymers and coupled nonlinear oscillators, are also localized modes of excitation of Bose–Einstein condensates (BEC) in periodic potentials such as those generated by counter-propagating laser beams in an optical lattice. Static and dynamical properties of breather states are analysed in the discrete nonlinear Schrödinger equation that is derived in the limit of deep potential wells, tight-binding and the superfluid regime of the condensate. Static and mobile breathers can be formed by progressive re-shaping of initial Gaussian wave-packets or by transporting atomic density towards dissipative boundaries of the lattice. Static breathers generated via boundary dissipations are determined via a transfer-matrix approach and discussed in the two analytic limits of highly localized and very broad profiles. Mobile breathers that move across the lattice are well approximated by modified analytical expressions derived from integrable models with two independent parameters: the core-phase gradient and the peak amplitude. Finally, possible experimental realizations of discrete breathers in BEC in optical lattices are discussed in the presence of residual harmonic trapping and in interferometry configurations suitable to investigate discrete breathers' interactions. (invited article)

Hopf Bifurcation Analysis for a Stochastic Discrete-Time Hyperchaotic System

Directory of Open Access Journals (Sweden)

Jie Ran

2015-01-01

Full Text Available The dynamics of a discrete-time hyperchaotic system and the amplitude control of Hopf bifurcation for a stochastic discrete-time hyperchaotic system are investigated in this paper. Numerical simulations are presented to exhibit the complex dynamical behaviors in the discrete-time hyperchaotic system. Furthermore, the stochastic discrete-time hyperchaotic system with random parameters is transformed into its equivalent deterministic system with the orthogonal polynomial theory of discrete random function. In addition, the dynamical features of the discrete-time hyperchaotic system with random disturbances are obtained through its equivalent deterministic system. By using the Hopf bifurcation conditions of the deterministic discrete-time system, the specific conditions for the existence of Hopf bifurcation in the equivalent deterministic system are derived. And the amplitude control with random intensity is discussed in detail. Finally, the feasibility of the control method is demonstrated by numerical simulations.

Discretization-induced delays and their role in the dynamics

International Nuclear Information System (INIS)

Ramani, A; Grammaticos, B; Satsuma, J; Willox, R

2008-01-01

We show that a discretization of a continuous system may entail 'hidden' delays and thus introduce instabilities. In this case, while the continuous system has an attractive fixed point, the instabilities present in the equivalent discrete one may lead to the appearance of a limit cycle. We explain that it is possible, thanks to the proper staggering of the discrete variables, to eliminate the hidden delay. However, in general, other instabilities may appear in the discrete system which can even lead to chaotic behaviour

Discrete mathematics in the high school curriculum

NARCIS (Netherlands)

Anderson, I.; Asch, van A.G.; van Lint, J.H.

2004-01-01

In this paper we present some topics from the field of discrete mathematics which might be suitable for the high school curriculum. These topics yield both easy to understand challenging problems and important applications of discrete mathematics. We choose elements from number theory and various

Memory State Feedback RMPC for Multiple Time-Delayed Uncertain Linear Systems with Input Constraints

Directory of Open Access Journals (Sweden)

Wei-Wei Qin

2014-01-01

Full Text Available This paper focuses on the problem of asymptotic stabilization for a class of discrete-time multiple time-delayed uncertain linear systems with input constraints. Then, based on the predictive control principle of receding horizon optimization, a delayed state dependent quadratic function is considered for incorporating MPC problem formulation. By developing a memory state feedback controller, the information of the delayed plant states can be taken into full consideration. The MPC problem is formulated to minimize the upper bound of infinite horizon cost that satisfies the sufficient conditions. Then, based on the Lyapunov-Krasovskii function, a delay-dependent sufficient condition in terms of linear matrix inequality (LMI can be derived to design a robust MPC algorithm. Finally, the digital simulation results prove availability of the proposed method.

Input and execution

International Nuclear Information System (INIS)

Carr, S.; Lane, G.; Rowling, G.

1986-11-01

This document describes the input procedures, input data files and operating instructions for the SYVAC A/C 1.03 computer program. SYVAC A/C 1.03 simulates the groundwater mediated movement of radionuclides from underground facilities for the disposal of low and intermediate level wastes to the accessible environment, and provides an estimate of the subsequent radiological risk to man. (author)

Stochastic Kuramoto oscillators with discrete phase states

Science.gov (United States)

Jörg, David J.

2017-09-01

We present a generalization of the Kuramoto phase oscillator model in which phases advance in discrete phase increments through Poisson processes, rendering both intrinsic oscillations and coupling inherently stochastic. We study the effects of phase discretization on the synchronization and precision properties of the coupled system both analytically and numerically. Remarkably, many key observables such as the steady-state synchrony and the quality of oscillations show distinct extrema while converging to the classical Kuramoto model in the limit of a continuous phase. The phase-discretized model provides a general framework for coupled oscillations in a Markov chain setting.

Stochastic Kuramoto oscillators with discrete phase states.

Science.gov (United States)

Jörg, David J

2017-09-01

We present a generalization of the Kuramoto phase oscillator model in which phases advance in discrete phase increments through Poisson processes, rendering both intrinsic oscillations and coupling inherently stochastic. We study the effects of phase discretization on the synchronization and precision properties of the coupled system both analytically and numerically. Remarkably, many key observables such as the steady-state synchrony and the quality of oscillations show distinct extrema while converging to the classical Kuramoto model in the limit of a continuous phase. The phase-discretized model provides a general framework for coupled oscillations in a Markov chain setting.

Cone-beam tomography with discrete data sets

International Nuclear Information System (INIS)

Barrett, H.H.

1994-01-01

Sufficiently conditions for cone-beam data are well known for the case of continuous data collection along a cone-vortex curve with continuous detectors. These continuous conditions are inadequate for real-world data where discrete vertex geometries and discrete detector arrays are used. In this paper we present a theoretical formulation of cone-beam tomography with arbitrary discrete arrays of detectors and vertices. The theory models the imaging system as a linear continuous-to-discrete mapping and represents the continuous object exactly as a Fourier series. The reconstruction problem is posed as the estimation of some subset of the Fourier coefficients. The main goal of the theory is to determine which Fourier coefficients can be reliably determined from the data delivered by a specific discrete design. A fourier component will be well determined by the data if it satisfies two conditions: it makes a strong contribution to the data, and this contribution is relatively independent of the contribution of other Fourier components. To make these considerations precise, we introduce a concept called the cross-talk matrix. A diagonal element of this matrix measures the strength of a Fourier component in the data, while an off-diagonal element quantifies the dependence or aliasing of two different components. (Author)

On discrete models of space-time

International Nuclear Information System (INIS)

Horzela, A.; Kempczynski, J.; Kapuscik, E.; Georgia Univ., Athens, GA; Uzes, Ch.

1992-02-01

Analyzing the Einstein radiolocation method we come to the conclusion that results of any measurement of space-time coordinates should be expressed in terms of rational numbers. We show that this property is Lorentz invariant and may be used in the construction of discrete models of space-time different from the models of the lattice type constructed in the process of discretization of continuous models. (author)

From algorithmic computing to direct retrieval: evidence from number and alphabetic arithmetic in children and adults.

Science.gov (United States)

Barrouillet, P; Fayol, M

1998-03-01

A number of theories of mental arithmetic suggest that the ability to solve simple addition and subtraction problems develops from an algorithmic strategy toward a strategy based on the direct retrieval of the result from memory. In the experiment presented here, 2nd and 12th graders were asked to solve two tasks of number and alphabet arithmetic. The subjects transformed series of 1 to 4 numbers or letters (item span) by adding or subtracting an operand varying from 1 to 4 (operation span). Although both the item and operation span were associated with major and identical effects in the case of both numbers and letters at 2nd grade, such effects were clearly observable only in the case of letters for the adult subjects. This suggests the use of an algorithmic strategy for both types of material in the case of the children and for the letters only in the case of the adults, who retrieved numerical results directly from memory.

Reflectionless discrete Schr\\"odinger operators are spectrally atypical

OpenAIRE

VandenBoom, Tom

2017-01-01

We prove that, if an isospectral torus contains a discrete Schr\\"odinger operator with nonconstant potential, the shift dynamics on that torus cannot be minimal. Consequently, we specify a generic sense in which finite unions of nondegenerate closed intervals having capacity one are not the spectrum of any reflectionless discrete Schr\\"odinger operator. We also show that the only reflectionless discrete Schr\\"odinger operators having zero, one, or two spectral gaps are periodic.

A Baecklund transformation between two integrable discrete hungry systems

International Nuclear Information System (INIS)

Fukuda, Akiko; Yamamoto, Yusaku; Iwasaki, Masashi; Ishiwata, Emiko; Nakamura, Yoshimasa

2011-01-01

The discrete hungry Toda (dhToda) equation and the discrete hungry Lotka-Volterra (dhLV) system are known as integrable discrete hungry systems. In this Letter, through finding the LR transformations associated with the dhToda equation and the dhLV system, we present a Baecklund transformation between these integrable systems.

A Baecklund transformation between two integrable discrete hungry systems

Energy Technology Data Exchange (ETDEWEB)

Fukuda, Akiko, E-mail: j1409704@ed.kagu.tus.ac.j [Department of Mathematical Information Science, Graduate School of Science, Tokyo University of Science, 1-3 Kagurazaka, Shinjuku-ku, Tokyo 162-8601 (Japan); Yamamoto, Yusaku [Graduate School of System Informatics, Kobe University, 1-1 Rokkodai-cho, Nada-ku, Kobe 657-8501 (Japan); Iwasaki, Masashi [Department of Informatics and Environmental Science, Kyoto Prefectural University, 1-5, Nakaragi-cho, Shimogamo, Sakyo-ku, Kyoto 606-8522 (Japan); Ishiwata, Emiko [Department of Mathematical Information Science, Tokyo University of Science, 1-3 Kagurazaka, Shinjuku-ku, Tokyo 162-8601 (Japan); Nakamura, Yoshimasa [Graduate School of Informatics, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501 (Japan)

2011-01-17

The discrete hungry Toda (dhToda) equation and the discrete hungry Lotka-Volterra (dhLV) system are known as integrable discrete hungry systems. In this Letter, through finding the LR transformations associated with the dhToda equation and the dhLV system, we present a Baecklund transformation between these integrable systems.

An introduction to non-Abelian discrete symmetries for particle physicists

CERN Document Server

Ishimori, Hajime; Ohki, Hiroshi; Okada, Hiroshi; Shimizu, Yusuke; Tanimoto, Morimitsu

2012-01-01

These lecture notes provide a tutorial review of non-Abelian discrete groups and show some applications to issues in physics where discrete symmetries constitute an important principle for model building in particle physics. While Abelian discrete symmetries are often imposed in order to control couplings for particle physics - in particular model building beyond the standard model - non-Abelian discrete symmetries have been applied to understand the three-generation flavor structure in particular. Indeed, non-Abelian discrete symmetries are considered to be the most attractive choice for the flavor sector: model builders have tried to derive experimental values of quark and lepton masses, and mixing angles by assuming non-Abelian discrete flavor symmetries of quarks and leptons, yet, lepton mixing has already been intensively discussed in this context, as well. The possible origins of the non-Abelian discrete symmetry for flavors is another topic of interest, as they can arise from an underlying theory -...

Partition-based discrete-time quantum walks

Science.gov (United States)

Konno, Norio; Portugal, Renato; Sato, Iwao; Segawa, Etsuo

2018-04-01

We introduce a family of discrete-time quantum walks, called two-partition model, based on two equivalence-class partitions of the computational basis, which establish the notion of local dynamics. This family encompasses most versions of unitary discrete-time quantum walks driven by two local operators studied in literature, such as the coined model, Szegedy's model, and the 2-tessellable staggered model. We also analyze the connection of those models with the two-step coined model, which is driven by the square of the evolution operator of the standard discrete-time coined walk. We prove formally that the two-step coined model, an extension of Szegedy model for multigraphs, and the two-tessellable staggered model are unitarily equivalent. Then, selecting one specific model among those families is a matter of taste not generality.

Stabilizing the discrete vortex of topological charge S=2

International Nuclear Information System (INIS)

Kevrekidis, P.G.; Frantzeskakis, D.J.

2005-01-01

We study the instability of the discrete vortex with topological charge S=2 in a prototypical lattice model and observe its mediation through the central lattice site. Motivated by this finding, we analyze the model with the central site being inert. We identify analytically and observe numerically the existence of a range of linearly stable discrete vortices with S=2 in the latter model. The range of stability is comparable to that of the recently observed experimentally S=1 discrete vortex, suggesting the potential for observation of such higher charge discrete vortices

Group-theoretical aspects of the discrete sine-Gordon equation

International Nuclear Information System (INIS)

Orfanidis, S.J.

1980-01-01

The group-theoretical interpretation of the sine-Gordon equation in terms of connection forms on fiber bundles is extended to the discrete case. Solutions of the discrete sine-Gordon equation induce surfaces on a lattice in the SU(2) group space. The inverse scattering representation, expressing the parallel transport of fibers, is implemented by means of finite rotations. Discrete Baecklund transformations are realized as gauge transformations. The three-dimensional inverse scattering representation is used to derive a discrete nonlinear sigma model, and the corresponding Baecklund transformation and Pohlmeyer's R transformation are constructed

The use of discrete-event simulation modelling to improve radiation therapy planning processes.

Science.gov (United States)

Werker, Greg; Sauré, Antoine; French, John; Shechter, Steven

2009-07-01

The planning portion of the radiation therapy treatment process at the British Columbia Cancer Agency is efficient but nevertheless contains room for improvement. The purpose of this study is to show how a discrete-event simulation (DES) model can be used to represent this complex process and to suggest improvements that may reduce the planning time and ultimately reduce overall waiting times. A simulation model of the radiation therapy (RT) planning process was constructed using the Arena simulation software, representing the complexities of the system. Several types of inputs feed into the model; these inputs come from historical data, a staff survey, and interviews with planners. The simulation model was validated against historical data and then used to test various scenarios to identify and quantify potential improvements to the RT planning process. Simulation modelling is an attractive tool for describing complex systems, and can be used to identify improvements to the processes involved. It is possible to use this technique in the area of radiation therapy planning with the intent of reducing process times and subsequent delays for patient treatment. In this particular system, reducing the variability and length of oncologist-related delays contributes most to improving the planning time.

Solitonlike solutions of the generalized discrete nonlinear Schrödinger equation

DEFF Research Database (Denmark)

Rasmussen, Kim; Henning, D.; Gabriel, H.

1996-01-01

We investigate the solution properties oi. a generalized discrete nonlinear Schrodinger equation describing a nonlinear lattice chain. The generalized equation interpolates between the integrable discrete Ablowitz-Ladik equation and the nonintegrable discrete Schrodinger equation. Special interes...... nonlinear Schrodinger equation. In this way eve are able to construct coherent solitonlike structures of profile determined by the map parameters.......We investigate the solution properties oi. a generalized discrete nonlinear Schrodinger equation describing a nonlinear lattice chain. The generalized equation interpolates between the integrable discrete Ablowitz-Ladik equation and the nonintegrable discrete Schrodinger equation. Special interest...

Local discrete symmetries from superstring derived models

International Nuclear Information System (INIS)

Faraggi, A.E.

1996-10-01

Discrete and global symmetries play an essential role in many extensions of the Standard Model, for example, to preserve the proton lifetime, to prevent flavor changing neutral currents, etc. An important question is how can such symmetries survive in a theory of quantum gravity, like superstring theory. In a specific string model the author illustrates how local discrete symmetries may arise in string models and play an important role in preventing fast proton decay and flavor changing neutral currents. The local discrete symmetry arises due to the breaking of the non-Abelian gauge symmetries by Wilson lines in the superstring models and forbids, for example dimension five operators which mediate rapid proton decay, to all orders of nonrenormalizable terms. In the context of models of unification of the gauge and gravitational interactions, it is precisely this type of local discrete symmetries that must be found in order to insure that a given model is not in conflict with experimental observations

Discrete dispersion models and their Tweedie asymptotics

DEFF Research Database (Denmark)

Jørgensen, Bent; Kokonendji, Célestin C.

2016-01-01

The paper introduce a class of two-parameter discrete dispersion models, obtained by combining convolution with a factorial tilting operation, similar to exponential dispersion models which combine convolution and exponential tilting. The equidispersed Poisson model has a special place in this ap......The paper introduce a class of two-parameter discrete dispersion models, obtained by combining convolution with a factorial tilting operation, similar to exponential dispersion models which combine convolution and exponential tilting. The equidispersed Poisson model has a special place...... in this approach, whereas several overdispersed discrete distributions, such as the Neyman Type A, Pólya-Aeppli, negative binomial and Poisson-inverse Gaussian, turn out to be Poisson-Tweedie factorial dispersion models with power dispersion functions, analogous to ordinary Tweedie exponential dispersion models...... with power variance functions. Using the factorial cumulant generating function as tool, we introduce a dilation operation as a discrete analogue of scaling, generalizing binomial thinning. The Poisson-Tweedie factorial dispersion models are closed under dilation, which in turn leads to a Poisson...

Use cases of discrete event simulation. Appliance and research

Energy Technology Data Exchange (ETDEWEB)

Bangsow, Steffen (ed.)

2012-11-01

Use Cases of Discrete Event Simulation. Includes case studies from various important industries such as automotive, aerospace, robotics, production industry. Written by leading experts in the field. Over the last decades Discrete Event Simulation has conquered many different application areas. This trend is, on the one hand, driven by an ever wider use of this technology in different fields of science and on the other hand by an incredibly creative use of available software programs through dedicated experts. This book contains articles from scientists and experts from 10 countries. They illuminate the width of application of this technology and the quality of problems solved using Discrete Event Simulation. Practical applications of simulation dominate in the present book. The book is aimed to researchers and students who deal in their work with Discrete Event Simulation and which want to inform them about current applications. By focusing on discrete event simulation, this book can also serve as an inspiration source for practitioners for solving specific problems during their work. Decision makers who deal with the question of the introduction of discrete event simulation for planning support and optimization this book provides a contribution to the orientation, what specific problems could be solved with the help of Discrete Event Simulation within the organization.

Discrete bacteria foraging optimization algorithm for graph based problems - a transition from continuous to discrete

Science.gov (United States)

Sur, Chiranjib; Shukla, Anupam

2018-03-01

Bacteria Foraging Optimisation Algorithm is a collective behaviour-based meta-heuristics searching depending on the social influence of the bacteria co-agents in the search space of the problem. The algorithm faces tremendous hindrance in terms of its application for discrete problems and graph-based problems due to biased mathematical modelling and dynamic structure of the algorithm. This had been the key factor to revive and introduce the discrete form called Discrete Bacteria Foraging Optimisation (DBFO) Algorithm for discrete problems which exceeds the number of continuous domain problems represented by mathematical and numerical equations in real life. In this work, we have mainly simulated a graph-based road multi-objective optimisation problem and have discussed the prospect of its utilisation in other similar optimisation problems and graph-based problems. The various solution representations that can be handled by this DBFO has also been discussed. The implications and dynamics of the various parameters used in the DBFO are illustrated from the point view of the problems and has been a combination of both exploration and exploitation. The result of DBFO has been compared with Ant Colony Optimisation and Intelligent Water Drops Algorithms. Important features of DBFO are that the bacteria agents do not depend on the local heuristic information but estimates new exploration schemes depending upon the previous experience and covered path analysis. This makes the algorithm better in combination generation for graph-based problems and combination generation for NP hard problems.

PLEXOS Input Data Generator

Energy Technology Data Exchange (ETDEWEB)

2017-02-01

The PLEXOS Input Data Generator (PIDG) is a tool that enables PLEXOS users to better version their data, automate data processing, collaborate in developing inputs, and transfer data between different production cost modeling and other power systems analysis software. PIDG can process data that is in a generalized format from multiple input sources, including CSV files, PostgreSQL databases, and PSS/E .raw files and write it to an Excel file that can be imported into PLEXOS with only limited manual intervention.

Discrete Pathophysiology is Uncommon in Patients with Nonspecific Arm Pain.

Science.gov (United States)

Kortlever, Joost T P; Janssen, Stein J; Molleman, Jeroen; Hageman, Michiel G J S; Ring, David

2016-06-01

Nonspecific symptoms are common in all areas of medicine. Patients and caregivers can be frustrated when an illness cannot be reduced to a discrete pathophysiological process that corresponds with the symptoms. We therefore asked the following questions: 1) Which demographic factors and psychological comorbidities are associated with change from an initial diagnosis of nonspecific arm pain to eventual identification of discrete pathophysiology that corresponds with symptoms? 2) What is the percentage of patients eventually diagnosed with discrete pathophysiology, what are those pathologies, and do they account for the symptoms? We evaluated 634 patients with an isolated diagnosis of nonspecific upper extremity pain to see if discrete pathophysiology was diagnosed on subsequent visits to the same hand surgeon, a different hand surgeon, or any physician within our health system for the same pain. There were too few patients with discrete pathophysiology at follow-up to address the primary study question. Definite discrete pathophysiology that corresponded with the symptoms was identified in subsequent evaluations by the index surgeon in one patient (0.16% of all patients) and cured with surgery (nodular fasciitis). Subsequent doctors identified possible discrete pathophysiology in one patient and speculative pathophysiology in four patients and the index surgeon identified possible discrete pathophysiology in four patients, but the five discrete diagnoses accounted for only a fraction of the symptoms. Nonspecific diagnoses are not harmful. Prospective randomized research is merited to determine if nonspecific, descriptive diagnoses are better for patients than specific diagnoses that imply pathophysiology in the absence of discrete verifiable pathophysiology.

Implementing the Standards. Teaching Discrete Mathematics in Grades 7-12.

Science.gov (United States)

Hart, Eric W.; And Others

1990-01-01

Discrete mathematics are defined briefly. A course in discrete mathematics for high school students and teaching discrete mathematics in grades 7 and 8 including finite differences, recursion, and graph theory are discussed. (CW)

Designing an Algorithm for Cancerous Tissue Segmentation Using Adaptive K-means Cluttering and Discrete Wavelet Transform.

Science.gov (United States)

Rezaee, Kh; Haddadnia, J

2013-09-01

Breast cancer is currently one of the leading causes of death among women worldwide. The diagnosis and separation of cancerous tumors in mammographic images require accuracy, experience and time, and it has always posed itself as a major challenge to the radiologists and physicians. This paper proposes a new algorithm which draws on discrete wavelet transform and adaptive K-means techniques to transmute the medical images implement the tumor estimation and detect breast cancer tumors in mammograms in early stages. It also allows the rapid processing of the input data. In the first step, after designing a filter, the discrete wavelet transform is applied to the input images and the approximate coefficients of scaling components are constructed. Then, the different parts of image are classified in continuous spectrum. In the next step, by using adaptive K-means algorithm for initializing and smart choice of clusters' number, the appropriate threshold is selected. Finally, the suspicious cancerous mass is separated by implementing the image processing techniques. We Received 120 mammographic images in LJPEG format, which had been scanned in Gray-Scale with 50 microns size, 3% noise and 20% INU from clinical data taken from two medical databases (mini-MIAS and DDSM). The proposed algorithm detected tumors at an acceptable level with an average accuracy of 92.32% and sensitivity of 90.24%. Also, the Kappa coefficient was approximately 0.85, which proved the suitable reliability of the system performance. The exact positioning of the cancerous tumors allows the radiologist to determine the stage of disease progression and suggest an appropriate treatment in accordance with the tumor growth. The low PPV and high NPV of the system is a warranty of the system and both clinical specialists and patients can trust its output.

Discretized representations of harmonic variables by bilateral Jacobi operators

Directory of Open Access Journals (Sweden)

Andreas Ruffing

2000-01-01

Full Text Available Starting from a discrete Heisenberg algebra we solve several representation problems for a discretized quantum oscillator in a weighted sequence space. The Schrödinger operator for a discrete harmonic oscillator is derived. The representation problem for a q-oscillator algebra is studied in detail. The main result of the article is the fact that the energy representation for the discretized momentum operator can be interpreted as follows: It allows to calculate quantum properties of a large number of non-interacting harmonic oscillators at the same time. The results can be directly related to current research on squeezed laser states in quantum optics. They reveal and confirm the observation that discrete versions of continuum Schrodinger operators allow more structural freedom than their continuum analogs do.

Current Density and Continuity in Discretized Models

Science.gov (United States)

Boykin, Timothy B.; Luisier, Mathieu; Klimeck, Gerhard

2010-01-01

Discrete approaches have long been used in numerical modelling of physical systems in both research and teaching. Discrete versions of the Schrodinger equation employing either one or several basis functions per mesh point are often used by senior undergraduates and beginning graduate students in computational physics projects. In studying…

Discretization vs. Rounding Error in Euler's Method

Science.gov (United States)

Borges, Carlos F.

2011-01-01

Euler's method for solving initial value problems is an excellent vehicle for observing the relationship between discretization error and rounding error in numerical computation. Reductions in stepsize, in order to decrease discretization error, necessarily increase the number of steps and so introduce additional rounding error. The problem is…

On the Importance of Both Dimensional and Discrete Models of Emotion.

Science.gov (United States)

Harmon-Jones, Eddie; Harmon-Jones, Cindy; Summerell, Elizabeth

2017-09-29

We review research on the structure and functions of emotions that has benefitted from a serious consideration of both discrete and dimensional perspectives on emotion. To illustrate this point, we review research that demonstrates: (1) how affective valence within discrete emotions differs as a function of individuals and situations, and how these differences relate to various functions; (2) that anger (and other emotional states) should be considered as a discrete emotion but there are dimensions around and within anger; (3) that similarities exist between approach-related positive and negative discrete emotions and they have unique motivational functions; (4) that discrete emotions and broad dimensions of emotions both have unique functions; and (5) evidence that a "new" discrete emotion with discrete functions exists within a broader emotion family. We hope that this consideration of both discrete and dimensional perspectives on emotion will assist in understanding the functions of emotions.

On the Importance of Both Dimensional and Discrete Models of Emotion

Science.gov (United States)

Harmon-Jones, Eddie

2017-01-01

We review research on the structure and functions of emotions that has benefitted from a serious consideration of both discrete and dimensional perspectives on emotion. To illustrate this point, we review research that demonstrates: (1) how affective valence within discrete emotions differs as a function of individuals and situations, and how these differences relate to various functions; (2) that anger (and other emotional states) should be considered as a discrete emotion but there are dimensions around and within anger; (3) that similarities exist between approach-related positive and negative discrete emotions and they have unique motivational functions; (4) that discrete emotions and broad dimensions of emotions both have unique functions; and (5) evidence that a “new” discrete emotion with discrete functions exists within a broader emotion family. We hope that this consideration of both discrete and dimensional perspectives on emotion will assist in understanding the functions of emotions. PMID:28961185

Discretization-dependent model for weakly connected excitable media

Science.gov (United States)

Arroyo, Pedro André; Alonso, Sergio; Weber dos Santos, Rodrigo

2018-03-01

Pattern formation has been widely observed in extended chemical and biological processes. Although the biochemical systems are highly heterogeneous, homogenized continuum approaches formed by partial differential equations have been employed frequently. Such approaches are usually justified by the difference of scales between the heterogeneities and the characteristic spatial size of the patterns. Under different conditions, for example, under weak coupling, discrete models are more adequate. However, discrete models may be less manageable, for instance, in terms of numerical implementation and mesh generation, than the associated continuum models. Here we study a model to approach discreteness which permits the computer implementation on general unstructured meshes. The model is cast as a partial differential equation but with a parameter that depends not only on heterogeneities sizes, as in the case of quasicontinuum models, but also on the discretization mesh. Therefore, we refer to it as a discretization-dependent model. We validate the approach in a generic excitable media that simulates three different phenomena: the propagation of action membrane potential in cardiac tissue, in myelinated axons of neurons, and concentration waves in chemical microemulsions.

Discrete Variational Approach for Modeling Laser-Plasma Interactions

Science.gov (United States)

Reyes, J. Paxon; Shadwick, B. A.

2014-10-01

The traditional approach for fluid models of laser-plasma interactions begins by approximating fields and derivatives on a grid in space and time, leading to difference equations that are manipulated to create a time-advance algorithm. In contrast, by introducing the spatial discretization at the level of the action, the resulting Euler-Lagrange equations have particular differencing approximations that will exactly satisfy discrete versions of the relevant conservation laws. For example, applying a spatial discretization in the Lagrangian density leads to continuous-time, discrete-space equations and exact energy conservation regardless of the spatial grid resolution. We compare the results of two discrete variational methods using the variational principles from Chen and Sudan and Brizard. Since the fluid system conserves energy and momentum, the relative errors in these conserved quantities are well-motivated physically as figures of merit for a particular method. This work was supported by the U. S. Department of Energy under Contract No. DE-SC0008382 and by the National Science Foundation under Contract No. PHY-1104683.