Intelligent control systems: an introduction with examples
National Research Council Canada - National Science Library
Hangos, K. M; Lakner, Rozália; Gerzson, Miklós
2001-01-01
... The structure of the knowledge base 1.2 The reasoning algorithm 1.3 Conflict resolution 31 31 32 33 36 viiviii INTELLIGENT CONTROL SYSTEMS 2. 3. 4. 5. 1.4 Explanation of the reasoning Forward r...
Goodstein, R L
2010-01-01
Recursive analysis develops natural number computations into a framework appropriate for real numbers. This text is based upon primary recursive arithmetic and presents a unique combination of classical analysis and intuitional analysis. Written by a master in the field, it is suitable for graduate students of mathematics and computer science and can be read without a detailed knowledge of recursive arithmetic.Introductory chapters on recursive convergence and recursive and relative continuity are succeeded by explorations of recursive and relative differentiability, the relative integral, and
Using protistan examples to dispel the myths of intelligent design.
Farmer, Mark A; Habura, Andrea
2010-01-01
In recent years the teaching of the religiously based philosophy of intelligent design (ID) has been proposed as an alternative to modern evolutionary theory. Advocates of ID are largely motivated by their opposition to naturalistic explanations of biological diversity, in accordance with their goal of challenging the philosophy of scientific materialism. Intelligent design has been embraced by a wide variety of creationists who promote highly questionable claims that purport to show the inadequacy of evolutionary theory, which they consider to be a threat to a theistic worldview. We find that examples from protistan biology are well suited for providing evidence of many key evolutionary concepts, and have often been misrepresented or roundly ignored by ID advocates. These include examples of adaptations and radiations that are said to be statistically impossible, as well as examples of speciation both in the laboratory and as documented in the fossil record. Because many biologists may not be familiar with the richness of the protist evolution dataset or with ID-based criticisms of evolution, we provide examples of current ID arguments and specific protistan counter-examples.
Roberts, Eric S
1986-01-01
Concentrating on the practical value of recursion, this text, the first of its kind, is essential to computer science students' education. In this text, students will learn the concept and programming applications of recursive thinking. This will ultimately prepare students for advanced topics in computer science such as compiler construction, formal language theory, and the mathematical foundations of computer science.
Artificial intelligence in sports on the example of weight training.
Novatchkov, Hristo; Baca, Arnold
2013-01-01
The overall goal of the present study was to illustrate the potential of artificial intelligence (AI) techniques in sports on the example of weight training. The research focused in particular on the implementation of pattern recognition methods for the evaluation of performed exercises on training machines. The data acquisition was carried out using way and cable force sensors attached to various weight machines, thereby enabling the measurement of essential displacement and force determinants during training. On the basis of the gathered data, it was consequently possible to deduce other significant characteristics like time periods or movement velocities. These parameters were applied for the development of intelligent methods adapted from conventional machine learning concepts, allowing an automatic assessment of the exercise technique and providing individuals with appropriate feedback. In practice, the implementation of such techniques could be crucial for the investigation of the quality of the execution, the assistance of athletes but also coaches, the training optimization and for prevention purposes. For the current study, the data was based on measurements from 15 rather inexperienced participants, performing 3-5 sets of 10-12 repetitions on a leg press machine. The initially preprocessed data was used for the extraction of significant features, on which supervised modeling methods were applied. Professional trainers were involved in the assessment and classification processes by analyzing the video recorded executions. The so far obtained modeling results showed good performance and prediction outcomes, indicating the feasibility and potency of AI techniques in assessing performances on weight training equipment automatically and providing sportsmen with prompt advice. Key pointsArtificial intelligence is a promising field for sport-related analysis.Implementations integrating pattern recognition techniques enable the automatic evaluation of data
Social media for intelligence: practical examples of analysis for understanding
Juhlin, Jonas A.; Richardson, John
2016-05-01
Social media has become a dominating feature in modern life. Platforms like Facebook, Twitter, and Google have users all over the world. People from all walks of life use social media. For the intelligence services, social media is an element that cannot be ignored. It holds immense amount of information, and the potential to extract useful intelligence cannot be ignored. Social media has been around for sufficient time that most intelligence services recognize the fact that social media needs some form of attention. However, for the intelligence collector and analyst several aspects must be uncovered in order to fully exploit social media for intelligence purposes. This paper will present Project Avatar, an experiment in obtaining effective intelligence from social media sources, and several emerging analytic techniques to expand the intelligence gathered from these sources.
Social Media for Intelligence: Practical Examples of Analysis for Understanding
DEFF Research Database (Denmark)
Juhlin, Jonas Alastair
2016-01-01
be uncovered in order to fully exploit social media for intelligence purposes. This paper will present Project Avatar, an experiment in obtaining effective intelligence from social media sources, and several emerging analytic techniques to expand the intelligence gathered from these sources.......Social media has become a dominating feature in modern life. Platforms like Facebook, Twitter, and Google have users all over the world. People from all walks of life use social media. For the intelligence services, social media is an element that cannot be ignored. It holds immense amount...... of information, and the potential to extract useful intelligence cannot be ignored. Social media has been around for sufficient time that most intelligence services recognize the fact that social media needs some form of attention. However, for the intelligence collector and analyst several aspects must...
Directory of Open Access Journals (Sweden)
Jeffrey eWatumull
2014-01-01
Full Text Available It is a truism that conceptual understanding of a hypothesis is required for its empirical investigation. However the concept of recursion as articulated in the context of linguistic analysis has been perennially confused. Nowhere has this been more evident than in attempts to critique and extend Hauser, Chomsky, and Fitch’s (2002 articulation. These authors put forward the hypothesis that what is uniquely human and unique to the faculty of language—the faculty of language in the narrow sense (FLN—is a recursive system that generates and maps syntactic objects to conceptual-intentional and sensory-motor systems. This thesis was based on the standard mathematical definition of recursion as understood by Gödel and Turing, and yet has commonly been interpreted in other ways, most notably and incorrectly as a thesis about the capacity for syntactic embedding. As we explain, the recursiveness of a function is defined independent of such output, whether infinite or finite, embedded or unembedded—existent or nonexistent. And to the extent that embedding is a sufficient, though not necessary, diagnostic of recursion, it has not been established that the apparent restriction on embedding in some languages is of any theoretical import. Misunderstanding of these facts has generated research that is often irrelevant to the FLN thesis as well as to other theories of language competence that focus on its generative power of expression. This essay is an attempt to bring conceptual clarity to such discussions as well as to future empirical investigations by explaining three criterial properties of recursion: computability (i.e., rules in intension rather than lists in extension; definition by induction (i.e., rules strongly generative of structure; and mathematical induction (i.e., rules for the principled—and potentially unbounded—expansion of strongly generated structure. By these necessary and sufficient criteria, the grammars of all natural
DEFF Research Database (Denmark)
Andersen, Jørgen Ellegaard; Borot, Gaëtan; Orantin, Nicolas
We propose a general theory whose main component are functorial assignments ∑→Ω∑ ∈ E (∑), for a large class of functors E from a certain category of bordered surfaces (∑'s) to a suitable a target category of topological vector spaces. The construction is done by summing appropriate compositions...... as Poisson structures on the moduli space of flat connections. The theory has a wider scope than that and one expects that many functorial objects in low-dimensional geometry and topology should have a GR construction. The geometric recursion has various projections to topological recursion (TR) and we...... in particular show it retrieves all previous variants and applications of TR. We also show that, for any initial data for topological recursion, one can construct initial data for GR with values in Frobenius algebra-valued continuous functions on Teichmueller space, such that the ωg,n of TR are obtained...
Example-Tracing Tutors: Intelligent Tutor Development for Non-Programmers
Aleven, Vincent; McLaren, Bruce M.; Sewall, Jonathan; van Velsen, Martin; Popescu, Octav; Demi, Sandra; Ringenberg, Michael; Koedinger, Kenneth R.
2016-01-01
In 2009, we reported on a new Intelligent Tutoring Systems (ITS) technology, example-tracing tutors, that can be built without programming using the Cognitive Tutor Authoring Tools (CTAT). Creating example-tracing tutors was shown to be 4-8 times as cost-effective as estimates for ITS development from the literature. Since 2009, CTAT and its…
Müller, Gert; Sacks, Gerald
1990-01-01
These proceedings contain research and survey papers from many subfields of recursion theory, with emphasis on degree theory, in particular the development of frameworks for current techniques in this field. Other topics covered include computational complexity theory, generalized recursion theory, proof theoretic questions in recursion theory, and recursive mathematics.
Example of a distributed-intelligence data-acquisition system using the CAMAC approach
International Nuclear Information System (INIS)
Francis, J.E. Jr.; Stewart, C.R.; Overbey, D.R.
1982-03-01
The Fusion Energy Division has many diagnostics connected to the same experiment, and correlating the data acquired is very important. The system described in this paper is modular in concept, provides intelligence to the various modules, and yields high throughput by the use of parallel processing and high-speed interfaces. Two examples of how this system was implemented are given
Reiterer, Alexander; Egly, Uwe; Vicovac, Tanja; Mai, Enrico; Moafipoor, Shahram; Grejner-Brzezinska, Dorota A.; Toth, Charles K.
2010-12-01
Artificial Intelligence (AI) is one of the key technologies in many of today's novel applications. It is used to add knowledge and reasoning to systems. This paper illustrates a review of AI methods including examples of their practical application in Geodesy like data analysis, deformation analysis, navigation, network adjustment, and optimization of complex measurement procedures. We focus on three examples, namely, a geo-risk assessment system supported by a knowledge-base, an intelligent dead reckoning personal navigator, and evolutionary strategies for the determination of Earth gravity field parameters. Some of the authors are members of IAG Sub-Commission 4.2 - Working Group 4.2.3, which has the main goal to study and report on the application of AI in Engineering Geodesy.
DEFF Research Database (Denmark)
Oliva, Paulo Borges
2002-01-01
Modified bar recursion is a variant of Spector's bar recursion which can be used to give a realizability interpretation of the classical axiom of dependent choice. This realizability allows for the extraction of witnesses from proofs of forall-exists-formulas in classical analysis. In this talk I...... shall report on results regarding the relationship between modified and Spector's bar recursion. I shall also show that a seemingly weak form of modified bar recursion is as strong as "full" modified bar recursion in higher types....
Selected examples of intelligent (micro) sensor systems: state-of-the-art and tendencies
Hauptmann, Peter R.
2006-03-01
The capability of intelligent sensors to have more intelligence built into them continues to drive their application in areas including automotive, aerospace and defense, industrial, intelligent house and wear, medical and homeland security. In principle it is difficult to overestimate the importance of intelligent (micro) sensors or sensor systems within advanced societies but one characteristic feature is the global market for sensors, which is now about 20 billion annually. Therefore sensors or sensor systems play a dominant role in many fields from the macro sensor in manufacturing industry down to the miniaturized sensor for medical applications. The diversity of sensors precludes a complete description of the state-of-the-art; selected examples will illustrate the current situation. MEMS (microelectromechanical systems) devices are of special interest in the context of micro sensor systems. In past the main requirements of a sensor were in terms of metrological performance. The electrical (or optical) signal produced by the sensor needed to match the measure relatively accurately. Such basic functionality is no longer sufficient. Data processing near the sensor, the extraction of more information than just the direct sensor information by signal analysis, system aspects and multi-sensor information are the new demands. A shifting can be observed away from aiming to design perfect single-function transducers and towards the utilization of system-based sensors as system components. In the ideal case such systems contain sensors, actuators and electronics. They can be realized in monolithic, hybrid or discrete form—which kind is used depends on the application. In this article the state-of-the-art of intelligent sensors or sensor systems is reviewed using selected examples. Future trends are deduced.
Goh, David S.
1979-01-01
The advantages of using psychometric thoery to design short forms of intelligence tests are demonstrated by comparing such usage to a systematic random procedure that has previously been used. The Wechsler Intelligence Scale for Children Revised (WISC-R) Short Form is presented as an example. (JKS)
Recursion complexity in cognition
Roeper, Thomas
2014-01-01
This volume focuses on recursion, highlighting its central role in modern science. It reveals a host of new theoretical arguments, philosophical perspectives, formal representations and empirical evidence from parsing, acquisition and computer models.
Neuhauser, Linda; Kreps, Gary L; Morrison, Kathleen; Athanasoulis, Marcos; Kirienko, Nikolai; Van Brunt, Deryk
2013-08-01
This paper describes how design science theory and methods and use of artificial intelligence (AI) components can improve the effectiveness of health communication. We identified key weaknesses of traditional health communication and features of more successful eHealth/AI communication. We examined characteristics of the design science paradigm and the value of its user-centered methods to develop eHealth/AI communication. We analyzed a case example of the participatory design of AI components in the ChronologyMD project intended to improve management of Crohn's disease. eHealth/AI communication created with user-centered design shows improved relevance to users' needs for personalized, timely and interactive communication and is associated with better health outcomes than traditional approaches. Participatory design was essential to develop ChronologyMD system architecture and software applications that benefitted patients. AI components can greatly improve eHealth/AI communication, if designed with the intended audiences. Design science theory and its iterative, participatory methods linked with traditional health communication theory and methods can create effective AI health communication. eHealth/AI communication researchers, developers and practitioners can benefit from a holistic approach that draws from theory and methods in both design sciences and also human and social sciences to create successful AI health communication. Copyright © 2013 Elsevier Ireland Ltd. All rights reserved.
Lowenthal, Francis
2010-11-01
This paper examines whether the recursive structure imbedded in some exercises used in the Non Verbal Communication Device (NVCD) approach is actually the factor that enables this approach to favor language acquisition and reacquisition in the case of children with cerebral lesions. For that a definition of the principle of recursion as it is used by logicians is presented. The two opposing approaches to the problem of language development are explained. For many authors such as Chomsky [1] the faculty of language is innate. This is known as the Standard Theory; the other researchers in this field, e.g. Bates and Elman [2], claim that language is entirely constructed by the young child: they thus speak of Language Acquisition. It is also shown that in both cases, a version of the principle of recursion is relevant for human language. The NVCD approach is defined and the results obtained in the domain of language while using this approach are presented: young subjects using this approach acquire a richer language structure or re-acquire such a structure in the case of cerebral lesions. Finally it is shown that exercises used in this framework imply the manipulation of recursive structures leading to regular grammars. It is thus hypothesized that language development could be favored using recursive structures with the young child. It could also be the case that the NVCD like exercises used with children lead to the elaboration of a regular language, as defined by Chomsky [3], which could be sufficient for language development but would not require full recursion. This double claim could reconcile Chomsky's approach with psychological observations made by adherents of the Language Acquisition approach, if it is confirmed by researches combining the use of NVCDs, psychometric methods and the use of Neural Networks. This paper thus suggests that a research group oriented towards this problematic should be organized.
Kostov, Ivan
2010-01-01
We study the quasiclassical expansion associated with a complex curve. In a more specific context this is the 1/N expansion in U(N)-invariant matrix integrals. We compare two approaches, the CFT approach and the topological recursion, and show their equivalence. The CFT approach reformulates the problem in terms of a conformal field theory on a Riemann surface, while the topological recursion is based on a recurrence equation for the observables representing symplectic invariants on the complex curve. The two approaches lead to two different graph expansions, one of which can be obtained as a partial resummation of the other.
Simple recursion relations for general field theories
International Nuclear Information System (INIS)
Cheung, Clifford; Shen, Chia-Hsien; Trnka, Jaroslav
2015-01-01
On-shell methods offer an alternative definition of quantum field theory at tree-level, replacing Feynman diagrams with recursion relations and interaction vertices with a handful of seed scattering amplitudes. In this paper we determine the simplest recursion relations needed to construct a general four-dimensional quantum field theory of massless particles. For this purpose we define a covering space of recursion relations which naturally generalizes all existing constructions, including those of BCFW and Risager. The validity of each recursion relation hinges on the large momentum behavior of an n-point scattering amplitude under an m-line momentum shift, which we determine solely from dimensional analysis, Lorentz invariance, and locality. We show that all amplitudes in a renormalizable theory are 5-line constructible. Amplitudes are 3-line constructible if an external particle carries spin or if the scalars in the theory carry equal charge under a global or gauge symmetry. Remarkably, this implies the 3-line constructibility of all gauge theories with fermions and complex scalars in arbitrary representations, all supersymmetric theories, and the standard model. Moreover, all amplitudes in non-renormalizable theories without derivative interactions are constructible; with derivative interactions, a subset of amplitudes is constructible. We illustrate our results with examples from both renormalizable and non-renormalizable theories. Our study demonstrates both the power and limitations of recursion relations as a self-contained formulation of quantum field theory.
Cobham recursive set functions
Czech Academy of Sciences Publication Activity Database
Beckmann, A.; Buss, S.; Friedman, S.-D.; Müller, M.; Thapen, Neil
2016-01-01
Roč. 167, č. 3 (2016), s. 335-369 ISSN 0168-0072 R&D Projects: GA ČR GBP202/12/G061 Institutional support: RVO:67985840 Keywords : set function * polynomial time * Cobham recursion Subject RIV: BA - General Mathematics Impact factor: 0.647, year: 2016 http://www.sciencedirect.com/science/article/pii/S0168007215001293
Indian Academy of Sciences (India)
Home; Journals; Resonance – Journal of Science Education; Volume 1; Issue 6. Algorithms Procedures and Recursion. R K Shyamasundar. Series Article Volume 1 ... Author Affiliations. R K Shyamasundar1. Computer Science Group, Tata Institute of Fundamental Research, Homi Bhabha Road Mumbai 400 005, India.
Recursive automatic classification algorithms
Energy Technology Data Exchange (ETDEWEB)
Bauman, E V; Dorofeyuk, A A
1982-03-01
A variational statement of the automatic classification problem is given. The dependence of the form of the optimal partition surface on the form of the classification objective functional is investigated. A recursive algorithm is proposed for maximising a functional of reasonably general form. The convergence problem is analysed in connection with the proposed algorithm. 8 references.
Approximate Bayesian recursive estimation
Czech Academy of Sciences Publication Activity Database
Kárný, Miroslav
2014-01-01
Roč. 285, č. 1 (2014), s. 100-111 ISSN 0020-0255 R&D Projects: GA ČR GA13-13502S Institutional support: RVO:67985556 Keywords : Approximate parameter estimation * Bayesian recursive estimation * Kullback–Leibler divergence * Forgetting Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 4.038, year: 2014 http://library.utia.cas.cz/separaty/2014/AS/karny-0425539.pdf
Recursion theory for metamathematics
Smullyan, Raymond M
1993-01-01
This work is a sequel to the author''s Godel''s Incompleteness Theorems, though it can be read independently by anyone familiar with Godel''s incompleteness theorem for Peano arithmetic. The book deals mainly with those aspects of recursion theory that have applications to the metamathematics of incompleteness, undecidability, and related topics. It is both an introduction to the theory and a presentation of new results in the field.
Pedestrian Path Prediction with Recursive Bayesian Filters: A Comparative Study
Schneider, N.; Gavrila, D.M.
2013-01-01
In the context of intelligent vehicles, we perform a comparative study on recursive Bayesian filters for pedestrian path prediction at short time horizons (< 2s). We consider Extended Kalman Filters (EKF) based on single dynamical models and Interacting Multiple Models (IMM) combining several such
Directory of Open Access Journals (Sweden)
Veronika Jasikova
2012-01-01
Full Text Available Contemporary business requires relevant data for appropriate, effective and reliable decisions. The concept of Business Intelligence which has been successfully established in a lot of organisations necessitates gathering relevant internal as well as external data which are often hardly acquirable. The aim of this paper is to analyse both the quality and availability of the sample of the external data resources on the basis of selected criteria and to enable the evaluation of their potential. The research reveals that the resources are currently not as suitable and utilisable for the purposes of Business Intelligence as they are expected to be. Although there are exceptions such as data provided by particular governmental or national institutions, the majority of external data resources does not correspond to the requirements posed to their availability, credibility, update regularity, stability and technical accessibility.
A camac-based intelligent subsystem for ATLAS example application: cryogenic monitoring and control
International Nuclear Information System (INIS)
Pardo, R.; Kawarasaki, Y.; Wasniewski, K.
1985-01-01
A subunit of the CAMAC accelerator control system of ATLAS for monitoring and, eventually, controlling the cryogenic refrigeration and distribution facility is under development. This development is the first application of a philosophy of distributed intelligence which will be applied throughout the ATLAS control system. The control concept is that of an intelligent subunit of the existing ATLAS CAMAC control highway. A single board computer resides in an auxiliary crate controller which allows access to all devices within the crate. The local SBC can communicate to the host over the CAMAC highway via a protocol involving the use of memory in the SBC which can be accessed from the host in a DMA mode. This provides a mechanism for global communications, such as for alarm conditions, as well as allowing the cryogenic system to respond to the demands of the accelerator system
CAMAC-based intelligent subsystem for ATLAS example application: cryogenic monitoring and control
International Nuclear Information System (INIS)
Pardo, R.; Kawarasaki, Y.; Wasniewski, K.
1985-01-01
A subunit of the CAMAC accelerator control system of ATLAS for monitoring and, eventually, controlling the cryogenic refrigeration and distribution facility is under development. This development is the first application of a philosophy of distributed intelligence which will be applied throughout the ATLAS control system. The control concept is that of an intelligent subunit of the existing ATLAS CAMAC control highway. A single board computer resides in an auxiliary crate controller which allows access to all devices within the crate. The local SBC can communicate to the host over the CAMAC highway via a protocol involving the use of memory in the SBC which can be accessed from the host in a DMA mode. This provides a mechanism for global communications, such as for alarm conditions, as well as allowing the cryogenic system to respond to the demands of the accelerator system
Energy Technology Data Exchange (ETDEWEB)
NONE
1995-12-11
Various problems on intelligent planning (IP) and the tendency of basic technology were investigated. For each technique of IP, a Petri net and mark graph have been widely used as the modeling and analysis methods of a discrete event system. Moreover, various planning problems were modeled by a traveling salesman problem, and the efficient solution of the traveling salesman problem has been studied simultaneously. The tendency of the basic technology and application system viewed from an example of intelligent plant planning was investigated as an applied field of planning technology, with importance attached to the production system and robot planning. In the scheduling technology of the production system, the activation of an AI study and a new theory (i.e., architecture study) based on natural science information was investigated with the transition in the world as a trigger. A robot system has been planned in a wide range such as the environmental information acquisition planning of a robot. 202 refs., 69 figs., 4 tabs.
On semantics and applications of guarded recursion
DEFF Research Database (Denmark)
Bizjak, Aleš
2016-01-01
denotational model and a logic for reasoning about program equivalence. In the last three chapters we study syntax and semantics of a dependent type theory with a family of later modalities indexed by the set of clocks, and clock quantifiers. In the fourth and fifth chapters we provide two model constructions......In this dissertation we study applications and semantics of guarded recursion, which is a method for ensuring that self-referential descriptions of objects define a unique object. The first two chapters are devoted to applications. We use guarded recursion, first in the form of explicit step......-indexing and then in the form of the internal language of particular sheaf topos, to construct logical relations for reasoning about contextual approximation of probabilistic and nondeterministic programs. These logical relations are sound and complete and useful for showing a range of example equivalences. In the third...
a Recursive Approach to Compute Normal Forms
HSU, L.; MIN, L. J.; FAVRETTO, L.
2001-06-01
Normal forms are instrumental in the analysis of dynamical systems described by ordinary differential equations, particularly when singularities close to a bifurcation are to be characterized. However, the computation of a normal form up to an arbitrary order is numerically hard. This paper focuses on the computer programming of some recursive formulas developed earlier to compute higher order normal forms. A computer program to reduce the system to its normal form on a center manifold is developed using the Maple symbolic language. However, it should be stressed that the program relies essentially on recursive numerical computations, while symbolic calculations are used only for minor tasks. Some strategies are proposed to save computation time. Examples are presented to illustrate the application of the program to obtain high order normalization or to handle systems with large dimension.
Inner and Outer Recursive Neural Networks for Chemoinformatics Applications.
Urban, Gregor; Subrahmanya, Niranjan; Baldi, Pierre
2018-02-26
Deep learning methods applied to problems in chemoinformatics often require the use of recursive neural networks to handle data with graphical structure and variable size. We present a useful classification of recursive neural network approaches into two classes, the inner and outer approach. The inner approach uses recursion inside the underlying graph, to essentially "crawl" the edges of the graph, while the outer approach uses recursion outside the underlying graph, to aggregate information over progressively longer distances in an orthogonal direction. We illustrate the inner and outer approaches on several examples. More importantly, we provide open-source implementations [available at www.github.com/Chemoinformatics/InnerOuterRNN and cdb.ics.uci.edu ] for both approaches in Tensorflow which can be used in combination with training data to produce efficient models for predicting the physical, chemical, and biological properties of small molecules.
Sternberg, Robert J.
2012-01-01
Intelligence is the ability to learn from experience and to adapt to, shape, and select environments. Intelligence as measured by (raw scores on) conventional standardized tests varies across the lifespan, and also across generations. Intelligence can be understood in part in terms of the biology of the brain—especially with regard to the functioning in the prefrontal cortex—and also correlates with brain size, at least within humans. Studies of the effects of genes and environment suggest that the heritability coefficient (ratio of genetic to phenotypic variation) is between .4 and .8, although heritability varies as a function of socioeconomic status and other factors. Racial differences in measured intelligence have been observed, but race is a socially constructed rather than biological variable, so such differences are difficult to interpret. PMID:22577301
Sternberg, Robert J
2012-03-01
Intelligence is the ability to learn from experience and to adapt to, shape, and select environments. Intelligence as measured by (raw scores on) conventional standardized tests varies across the lifespan, and also across generations. Intelligence can be understood in part in terms of the biology of the brain-especially with regard to the functioning in the prefrontal cortex-and also correlates with brain size, at least within humans. Studies of the effects of genes and environment suggest that the heritability coefficient (ratio of genetic to phenotypic variation) is between .4 and .8, although heritability varies as a function of socioeconomic status and other factors. Racial differences in measured intelligence have been observed, but race is a socially constructed rather than biological variable, so such differences are difficult to interpret.
Collective Intelligence and Three Aspects of Planning in Organizations: A NASA Example
Billman, Dorrit; Feary, Michael
2010-01-01
For many complex sociotechnical systems, planning seems to require explicit coordination; certainly, in executing a plan the activities of different actors must be tightly coupled. However, distributing the needed planning information can be very burdensome and error prone, because different groups need different collections of information, updated or kept current on different time cycles. Further, the information needed to form successful plans is often highly distributed, and while feedback about the success of prior plans may exist, it may not be available to those in a position of using this to improve plans or to detect and resolve other problems in the system (Weick, 1995). Tools to support various aspects of planning have been developed, and can provide a huge benefit to the individuals working on that aspect. To be tractable, most solutions address a quite bounded slice of work, isolating it from the larger context. Prospective planning takes place over multiple, nested cycles of decision making. This builds a plan that specifies activities of different granularity. "Subplans" may specify multiple parallel activities by different groups and individuals, as well as sequential, nested actions by a single actor. Planning produces valuable, sharable, external, representations: in addition to prospective use, plans support retrospective assessment and also action in the present. Viewing planning in a larger context - both temporal and organizational -- enables noticing what one does not know and generating more systemic and effective solutions. Viewing a problem as one of collective intelligence invites thinking about the larger organizational context. Many approaches to supporting collective intelligence do not support execution of highly contingent actions, distributed across many players, and hence provide incomplete support for planning. However, CI technology maybe helpful in managing the processes of gathering information for decision making in planning
On the asymptotic form of the recursion method basis vectors for periodic Hamiltonians
International Nuclear Information System (INIS)
O'Reilly, E.P.; Weaire, D.
1984-01-01
The authors present the first detailed study of the recursion method basis vectors for the case of a periodic Hamiltonian. In the examples chosen, the probability density scales linearly with n as n → infinity, whenever the local density of states is bounded. Whenever it is unbounded and the recursion coefficients diverge, different scaling behaviour is found. These findings are explained and a scaling relationship between the asymptotic forms of the recursion coefficients and basis vectors is proposed. (author)
The ABCD of topological recursion
DEFF Research Database (Denmark)
Andersen, Jorgen Ellegaard; Borot, Gaëtan; Chekhov, Leonid O.
Kontsevich and Soibelman reformulated and slightly generalised the topological recursion of math-ph/0702045, seeing it as a quantization of certain quadratic Lagrangians in T*V for some vector space V. KS topological recursion is a procedure which takes as initial data a quantum Airy structure...... the 2d TQFT partition function as a special case), non-commutative Frobenius algebras, loop spaces of Frobenius algebras and a Z2-invariant version of the latter. This Z2-invariant version in the case of a semi-simple Frobenius algebra corresponds to the topological recursion of math-ph/0702045....
Recursive Algorithm For Linear Regression
Varanasi, S. V.
1988-01-01
Order of model determined easily. Linear-regression algorithhm includes recursive equations for coefficients of model of increased order. Algorithm eliminates duplicative calculations, facilitates search for minimum order of linear-regression model fitting set of data satisfactory.
Features and Recursive Structure
Directory of Open Access Journals (Sweden)
Kuniya Nasukawa
2015-01-01
Full Text Available Based on the cross-linguistic tendency that weak vowels are realized with a central quality such as ə, ɨ, or ɯ, this paper attempts to account for this choice by proposing that the nucleus itself is one of the three monovalent vowel elements |A|, |I| and |U| which function as the building blocks of melodic structure. I claim that individual languages make a parametric choice to determine which of the three elements functions as the head of a nuclear expression. In addition, I show that elements can be freely concatenated to create melodic compounds. The resulting phonetic value of an element compound is determined by the specific elements it contains and by the head-dependency relations between those elements. This concatenation-based recursive mechanism of melodic structure can also be extended to levels above the segment, thus ultimately eliminating the need for syllabic constituents. This approach reinterprets the notion of minimalism in phonology by opposing the string-based flat structure.
DEFF Research Database (Denmark)
Nikolov, Svetoslav; Gammelmark, Kim; Jensen, Jørgen Arendt
1999-01-01
This paper presents a new imaging method, applicable for both 2D and 3D imaging. It is based on Synthetic Transmit Aperture Focusing, but unlike previous approaches a new frame is created after every pulse emission. The elements from a linear transducer array emit pulses one after another. The same...... transducer element is used after N-xmt emissions. For each emission the signals from the individual elements are beam-formed in parallel for all directions in the image. A new frame is created by adding the new RF lines to the RF lines from the previous frame. The RF data recorded at the previous emission...... with the same element are subtracted. This yields a new image after each pulse emission and can give a frame rate of e.g. 5000 images/sec. The paper gives a derivation of the recursive imaging technique and compares simulations for fast B-mode imaging with measurements. A low value of N-xmt is necessary...
DEFF Research Database (Denmark)
2000-01-01
A method and an apparatus for recursive ultrasound imaging is presented. The method uses a Synthetic Transmit Aperture, but unlike previous approaches a new frame is created at every pulse emission. In receive, parallel beam forming is implemented. The beam formed RF data is added to the previously...... created RF lines. To keep the level of the signal, the RF data obtained previously, when emitting with the same element is subtracted from the RF lines. Up to 5000 frames/sec can be achieved for a tissue depth of 15 cm with a speed of sound of c = 1540 m/s. The high frame rate makes continuous imaging...... data possible, which can significantly enhance flow imaging. A point spread function 2° wide at -6 dB and grating lobes of $m(F) -50 dB is obtained with a 64 elements phased array with a central frequency ƒ¿0? = 3 MHz using a sparse transmit aperture using only 10 elements (N¿xmt? = 10) during pulse...
Hopf algebras and topological recursion
International Nuclear Information System (INIS)
Esteves, João N
2015-01-01
We consider a model for topological recursion based on the Hopf algebra of planar binary trees defined by Loday and Ronco (1998 Adv. Math. 139 293–309 We show that extending this Hopf algebra by identifying pairs of nearest neighbor leaves, and thus producing graphs with loops, we obtain the full recursion formula discovered by Eynard and Orantin (2007 Commun. Number Theory Phys. 1 347–452). (paper)
Directory of Open Access Journals (Sweden)
Jingtao Shi
2013-01-01
Full Text Available This paper is concerned with the relationship between maximum principle and dynamic programming for stochastic recursive optimal control problems. Under certain differentiability conditions, relations among the adjoint processes, the generalized Hamiltonian function, and the value function are given. A linear quadratic recursive utility portfolio optimization problem in the financial engineering is discussed as an explicitly illustrated example of the main result.
Recursion Relations for Conformal Blocks
Penedones, João; Yamazaki, Masahito
2016-09-12
In the context of conformal field theories in general space-time dimension, we find all the possible singularities of the conformal blocks as functions of the scaling dimension $\\Delta$ of the exchanged operator. In particular, we argue, using representation theory of parabolic Verma modules, that in odd spacetime dimension the singularities are only simple poles. We discuss how to use this information to write recursion relations that determine the conformal blocks. We first recover the recursion relation introduced in 1307.6856 for conformal blocks of external scalar operators. We then generalize this recursion relation for the conformal blocks associated to the four point function of three scalar and one vector operator. Finally we specialize to the case in which the vector operator is a conserved current.
Recursive Definitions of Monadic Functions
Directory of Open Access Journals (Sweden)
Alexander Krauss
2010-12-01
Full Text Available Using standard domain-theoretic fixed-points, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple option monad and the state-exception monad of Isabelle/HOL's imperative programming extension, which results in a convenient definition principle for imperative programs, which were previously hard to define. For such monadic functions, the recursion equation can always be derived without preconditions, even if the function is partial. The construction is easy to automate, and convenient induction principles can be derived automatically.
Borodachev, S. M.
2016-06-01
The simple derivation of recursive least squares (RLS) method equations is given as special case of Kalman filter estimation of a constant system state under changing observation conditions. A numerical example illustrates application of RLS to multicollinearity problem.
Proof Rules for Recursive Procedures
Hesselink, Wim H.
1993-01-01
Four proof rules for recursive procedures in a Pascal-like language are presented. The main rule deals with total correctness and is based on results of Gries and Martin. The rule is easier to apply than Martin's. It is introduced as an extension of a specification format for Pascal-procedures, with
DEFF Research Database (Denmark)
Nyvad, Anne Mette; Christensen, Ken Ramshøj; Vikner, Sten
2017-01-01
Based on data from extraction, embedded V2, and complementizer stacking, this paper proposes a cP/CP-analysis of CP-recursion in Danish. Because extraction can be shown to be possible from relative clauses, wh-islands, and adverbial clauses, and given that long extraction is successive......-cyclic, an extra specifier position has to be available as an escape hatch. Consequently, such extractions require a CP-recursion analysis, as has been argued for embedded V2 and for complementizer stacking. Given that CP-recursion in embedded V2 clauses does not allow extraction, whereas other types of CP......-recursion do, we suggest that embedded V2 is fundamentally different, in that main clause V2 and embedded V2 involve a CP (“big CP”), whereas all other clausal projections above IP are instances of cP (“little cP”). The topmost “little” c° has an occurrence feature that enables extraction but bars spell...
Lessons in Contingent, Recursive Humility
Vagle, Mark D.
2011-01-01
In this article, the author argues that critical work in teacher education should begin with teacher educators turning a critical eye on their own practices. The author uses Lesko's conception of contingent, recursive growth and change to analyze a lesson he observed as part of a phenomenological study aimed at understanding more about what it is…
Adding Recursive Constructs to Bialgebraic Semantics
DEFF Research Database (Denmark)
Klin, Bartek
2004-01-01
This paper aims at fitting a general class of recursive equations into the framework of ‘well-behaved' structural operational semantics, formalized as bialgebraic semantics by Turi and Plotkin. Rather than interpreting recursive constructs by means of operational rules, separate recursive equatio...
How Learning Logic Programming Affects Recursion Comprehension
Haberman, Bruria
2004-01-01
Recursion is a central concept in computer science, yet it is difficult for beginners to comprehend. Israeli high-school students learn recursion in the framework of a special modular program in computer science (Gal-Ezer & Harel, 1999). Some of them are introduced to the concept of recursion in two different paradigms: the procedural…
Recursive forgetting algorithms
DEFF Research Database (Denmark)
Parkum, Jens; Poulsen, Niels Kjølstad; Holst, Jan
1992-01-01
In the first part of the paper, a general forgetting algorithm is formulated and analysed. It contains most existing forgetting schemes as special cases. Conditions are given ensuring that the basic convergence properties will hold. In the second part of the paper, the results are applied...... to a specific algorithm with selective forgetting. Here, the forgetting is non-uniform in time and space. The theoretical analysis is supported by a simulation example demonstrating the practical performance of this algorithm...
A strange recursion operator demystified
International Nuclear Information System (INIS)
Sergyeyev, A
2005-01-01
We show that a new integrable two-component system of KdV type studied by Karasu (Kalkanli) et al (2004 Acta Appl. Math. 83 85-94) is bi-Hamiltonian, and its recursion operator, which has a highly unusual structure of nonlocal terms, can be written as a ratio of two compatible Hamiltonian operators found by us. Using this we prove that the system in question possesses an infinite hierarchy of local commuting generalized symmetries and conserved quantities in involution, and the evolution systems corresponding to these symmetries are bi-Hamiltonian as well. We also show that upon introduction of suitable nonlocal variables the nonlocal terms of the recursion operator under study can be written in the usual form, with the integration operator D -1 x appearing in each term at most once. (letter to the editor)
Some recursive formulas for Selberg-type integrals
Energy Technology Data Exchange (ETDEWEB)
Iguri, Sergio [Instituto de AstronomIa y Fisica del Espacio (CONICET-UBA). C. C. 67, Suc. 28, 1428 Buenos Aires (Argentina); Mansour, Toufik, E-mail: siguri@iafe.uba.a, E-mail: toufik@math.haifa.ac.i [Department of Mathematics, University of Haifa, Haifa 31905 (Israel)
2010-02-12
A set of recursive relations satisfied by Selberg-type integrals involving monomial symmetric polynomials are derived, generalizing previous results in Aomoto (1987) SIAM J. Math. Anal. 18 545-49 and Iguri (2009) Lett. Math. Phys. 89 141-58. These formulas provide a well-defined algorithm for computing Selberg-Schur integrals whenever the Kostka numbers relating Schur functions and the corresponding monomial polynomials are explicitly known. We illustrate the usefulness of our results discussing some interesting examples.
On the Relation between Spector's Bar Recursion and Modified Bar Recursion
DEFF Research Database (Denmark)
Oliva, Paulo Borges
2002-01-01
We introduce a variant of Spector's Bar Recursion in finite types to give a realizability interpretation of the classical axiom of dependent choice allowing for the extraction of witnesses from proofs of Sigma_1 formulas in classical analysis. We also give a bar recursive definition of the fan...... functional and study the relationship of our variant of Bar Recursion with others....
Recursive Trees for Practical ORAM
Directory of Open Access Journals (Sweden)
Moataz Tarik
2015-06-01
Full Text Available We present a new, general data structure that reduces the communication cost of recent tree-based ORAMs. Contrary to ORAM trees with constant height and path lengths, our new construction r-ORAM allows for trees with varying shorter path length. Accessing an element in the ORAM tree results in different communication costs depending on the location of the element. The main idea behind r-ORAM is a recursive ORAM tree structure, where nodes in the tree are roots of other trees. While this approach results in a worst-case access cost (tree height at most as any recent tree-based ORAM, we show that the average cost saving is around 35% for recent binary tree ORAMs. Besides reducing communication cost, r-ORAM also reduces storage overhead on the server by 4% to 20% depending on the ORAM’s client memory type. To prove r-ORAM’s soundness, we conduct a detailed overflow analysis. r-ORAM’s recursive approach is general in that it can be applied to all recent tree ORAMs, both constant and poly-log client memory ORAMs. Finally, we implement and benchmark r-ORAM in a practical setting to back up our theoretical claims.
Primitive recursive realizability and basic propositional logic
Plisko, Valery
2007-01-01
Two notions of primitive recursive realizability for arithmetic sentences are considered. The first one is strictly primitive recursive realizability introduced by Z. Damnjanovic in 1994. We prove that intuitionistic predicate logic is not sound with this kind of realizability. Namely there
Conjugate gradient algorithms using multiple recursions
Energy Technology Data Exchange (ETDEWEB)
Barth, T.; Manteuffel, T.
1996-12-31
Much is already known about when a conjugate gradient method can be implemented with short recursions for the direction vectors. The work done in 1984 by Faber and Manteuffel gave necessary and sufficient conditions on the iteration matrix A, in order for a conjugate gradient method to be implemented with a single recursion of a certain form. However, this form does not take into account all possible recursions. This became evident when Jagels and Reichel used an algorithm of Gragg for unitary matrices to demonstrate that the class of matrices for which a practical conjugate gradient algorithm exists can be extended to include unitary and shifted unitary matrices. The implementation uses short double recursions for the direction vectors. This motivates the study of multiple recursion algorithms.
Algebraic computability and enumeration models recursion theory and descriptive complexity
Nourani, Cyrus F
2016-01-01
This book, Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity, presents new techniques with functorial models to address important areas on pure mathematics and computability theory from the algebraic viewpoint. The reader is first introduced to categories and functorial models, with Kleene algebra examples for languages. Functorial models for Peano arithmetic are described toward important computational complexity areas on a Hilbert program, leading to computability with initial models. Infinite language categories are also introduced to explain descriptive complexity with recursive computability with admissible sets and urelements. Algebraic and categorical realizability is staged on several levels, addressing new computability questions with omitting types realizably. Further applications to computing with ultrafilters on sets and Turing degree computability are examined. Functorial models computability is presented with algebraic trees realizing intuitionistic type...
One loop integration with hypergeometric series by using recursion relations
International Nuclear Information System (INIS)
Watanabe, Norihisa; Kaneko, Toshiaki
2014-01-01
General one-loop integrals with arbitrary mass and kinematical parameters in d-dimensional space-time are studied. By using Bernstein theorem, a recursion relation is obtained which connects (n + 1)-point to n-point functions. In solving this recursion relation, we have shown that one-loop integrals are expressed by a newly defined hypergeometric function, which is a special case of Aomoto-Gelfand hypergeometric functions. We have also obtained coefficients of power series expansion around 4-dimensional space-time for two-, three- and four-point functions. The numerical results are compared with ''LoopTools'' for the case of two- and three-point functions as examples
Bounded queries in recursion theory
Gasarch, William I
1999-01-01
One of the major concerns of theoretical computer science is the classifi cation of problems in terms of how hard they are. The natural measure of difficulty of a function is the amount of time needed to compute it (as a function of the length of the input). Other resources, such as space, have also been considered. In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it. We wish to classify functions that are hard, i.e., not computable, in a quantitative way. We cannot use time or space, since the functions are not even computable. We cannot use Turing degree, since this notion is not quantitative. Hence we need a new notion of complexity-much like time or spac~that is quantitative and yet in some way captures the level of difficulty (such as the Turing degree) of a function.
Recursive sequences in first-year calculus
Krainer, Thomas
2016-02-01
This article provides ready-to-use supplementary material on recursive sequences for a second-semester calculus class. It equips first-year calculus students with a basic methodical procedure based on which they can conduct a rigorous convergence or divergence analysis of many simple recursive sequences on their own without the need to invoke inductive arguments as is typically required in calculus textbooks. The sequences that are accessible to this kind of analysis are predominantly (eventually) monotonic, but also certain recursive sequences that alternate around their limit point as they converge can be considered.
Recursion Of Binary Space As A Foundation Of Repeatable Programs
Directory of Open Access Journals (Sweden)
Jeremy Horne
2006-10-01
Full Text Available Every computation, including recursion, is based on natural philosophy. Our world may be expressed in terms of a binary logical space that contains functions that act simultaneously as objects and processes (operands and operators. This paper presents an outline of the results of research about that space and suggests routes for further inquiry. Binary logical space is generated sequentially from an origin in a standard coordinate system. At least one method exists to show that each of the resulting 16 functions repeats itself by repeatedly forward-feeding outputs of a function operating over two others as new operands of the original function until the original function appears as an output, thus behaving as an apparent homeostatic automaton. As any space of any dimension is composed of one or more of these functions, so the space is recursive, as well. Semantics gives meaning to recursive structures, computer programs and fundamental constituents of our universe being two examples. Such thoughts open inquiry into larger philosophical issues as free will and determinism.
Recursive-operator method in vibration problems for rod systems
Rozhkova, E. V.
2009-12-01
Using linear differential equations with constant coefficients describing one-dimensional dynamical processes as an example, we show that the solutions of these equations and systems are related to the solution of the corresponding numerical recursion relations and one does not have to compute the roots of the corresponding characteristic equations. The arbitrary functions occurring in the general solution of the homogeneous equations are determined by the initial and boundary conditions or are chosen from various classes of analytic functions. The solutions of the inhomogeneous equations are constructed in the form of integro-differential series acting on the right-hand side of the equation, and the coefficients of the series are determined from the same recursion relations. The convergence of formal solutions as series of a more general recursive-operator construction was proved in [1]. In the special case where the solutions of the equation can be represented in separated variables, the power series can be effectively summed, i.e., expressed in terms of elementary functions, and coincide with the known solutions. In this case, to determine the natural vibration frequencies, one obtains algebraic rather than transcendental equations, which permits exactly determining the imaginary and complex roots of these equations without using the graphic method [2, pp. 448-449]. The correctness of the obtained formulas (differentiation formulas, explicit expressions for the series coefficients, etc.) can be verified directly by appropriate substitutions; therefore, we do not prove them here.
Recursion relations for AdS/CFT correlators
International Nuclear Information System (INIS)
Raju, Suvrat
2011-01-01
We expand on the results of our recent letter [Phys. Rev. Lett. 106, 091601 (2011)], where we presented new recursion relations for correlation functions of the stress-tensor and conserved currents in conformal field theories with an AdS d+1 dual for d≥4. These recursion relations are derived by generalizing the Britto-Cachazo-Feng-Witten (BCFW) relations to amplitudes in anti-de Sitter space (AdS) that are dual to boundary correlators, and are usually computed perturbatively by Witten diagrams. Our results relate vacuum-correlation functions to integrated products of lower-point transition amplitudes, which correspond to correlators calculated between states dual to certain normalizable modes. We show that the set of ''polarization vectors'' for which amplitudes behave well under the BCFW extension is smaller than in flat-space. We describe how transition amplitudes for more general external polarizations can be constructed by combining answers obtained by different pairs of BCFW shifts. We then generalize these recursion relations to supersymmetric theories. In AdS, unlike flat-space, even maximal supersymmetry is insufficient to permit the computation of all correlators of operators in the same multiplet as a stress-tensor or conserved current. Finally, we work out some simple examples to verify our results.
Parallelizable approximate solvers for recursions arising in preconditioning
Energy Technology Data Exchange (ETDEWEB)
Shapira, Y. [Israel Inst. of Technology, Haifa (Israel)
1996-12-31
For the recursions used in the Modified Incomplete LU (MILU) preconditioner, namely, the incomplete decomposition, forward elimination and back substitution processes, a parallelizable approximate solver is presented. The present analysis shows that the solutions of the recursions depend only weakly on their initial conditions and may be interpreted to indicate that the inexact solution is close, in some sense, to the exact one. The method is based on a domain decomposition approach, suitable for parallel implementations with message passing architectures. It requires a fixed number of communication steps per preconditioned iteration, independently of the number of subdomains or the size of the problem. The overlapping subdomains are either cubes (suitable for mesh-connected arrays of processors) or constructed by the data-flow rule of the recursions (suitable for line-connected arrays with possibly SIMD or vector processors). Numerical examples show that, in both cases, the overhead in the number of iterations required for convergence of the preconditioned iteration is small relatively to the speed-up gained.
Intelligent mechatronics; Intelligent mechatronics
Energy Technology Data Exchange (ETDEWEB)
Hashimoto, H. [The University of Tokyo, Tokyo (Japan). Institute of Industrial Science
1995-10-01
Intelligent mechatronics (IM) was explained as follows: a study of IM essentially targets realization of a robot namely, but in the present stage the target is a creation of new values by intellectualization of machine, that is, a combination of the information infrastructure and the intelligent machine system. IM is also thought to be constituted of computers positively used and micromechatronics. The paper next introduces examples of IM study, mainly those the author is concerned with as shown below: sensor gloves, robot hands, robot eyes, tele operation, three-dimensional object recognition, mobile robot, magnetic bearing, construction of remote controlled unmanned dam, robot network, sensitivity communication using neuro baby, etc. 27 figs.
Recursive relations for a quiver gauge theory
International Nuclear Information System (INIS)
Park, Jaemo; Sim, Woojoo
2006-01-01
We study the recursive relations for a quiver gauge theory with the gauge group SU(N 1 ) x SU(N 2 ) with bifundamental fermions transforming as (N 1 , N-bar 2 ). We work out the recursive relation for the amplitudes involving a pair of quark and antiquark and gluons of each gauge group. We realize directly in the recursive relations the invariance under the order preserving permutations of the gluons of the first and the second gauge group. We check the proposed relations for MHV, 6-point and 7-point amplitudes and find the agreements with the known results and the known relations with the single gauge group amplitudes. The proposed recursive relation is much more efficient in calculating the amplitudes than using the known relations with the amplitudes of the single gauge group
Vicari, Giuseppe; Adenzato, Mauro
2014-05-01
In their 2002 seminal paper Hauser, Chomsky and Fitch hypothesize that recursion is the only human-specific and language-specific mechanism of the faculty of language. While debate focused primarily on the meaning of recursion in the hypothesis and on the human-specific and syntax-specific character of recursion, the present work focuses on the claim that recursion is language-specific. We argue that there are recursive structures in the domain of motor intentionality by way of extending John R. Searle's analysis of intentional action. We then discuss evidence from cognitive science and neuroscience supporting the claim that motor-intentional recursion is language-independent and suggest some explanatory hypotheses: (1) linguistic recursion is embodied in sensory-motor processing; (2) linguistic and motor-intentional recursions are distinct and mutually independent mechanisms. Finally, we propose some reflections about the epistemic status of HCF as presenting an empirically falsifiable hypothesis, and on the possibility of testing recursion in different cognitive domains. Copyright © 2014 Elsevier Inc. All rights reserved.
Recursive tridiagonalization of infinite dimensional Hamiltonians
International Nuclear Information System (INIS)
Haydock, R.; Oregon Univ., Eugene, OR
1989-01-01
Infinite dimensional, computable, sparse Hamiltonians can be numerically tridiagonalized to finite precision using a three term recursion. Only the finite number of components whose relative magnitude is greater than the desired precision are stored at any stage in the computation. Thus the particular components stored change as the calculation progresses. This technique avoids errors due to truncation of the orbital set, and makes terminators unnecessary in the recursion method. (orig.)
Recursion Operators for Dispersionless KP Hierarchy
International Nuclear Information System (INIS)
Cheng Qiusheng; He Jingsong
2012-01-01
Based on the corresponding theorem between dispersionless KP (dKP) hierarchy and ħ-dependent KP (ħKP) hierarchy, a general formal representation of the recursion operators for dKP hierarchy under n-reduction is given in a systematical way from the corresponding ħKP hierarchy. To illustrate this method, the recursion operators for dKP hierarchy under 2-reduction and 3-reduction are calculated in detail.
Recursion theory computational aspects of definability
Chong, Chi Tat
2015-01-01
This monograph presents recursion theory from a generalized and largely global point of view. A major theme is the study of the structures of degrees arising from two key notions of reducibility, the Turing degrees and the hyperdegrees, using ideas and techniques beyond those of classical recursion theory. These include structure theory, hyperarithmetic determinacy and rigidity, basis theorems, independence results on Turing degrees, as well as applications to higher randomness.
A new Bayesian recursive technique for parameter estimation
Kaheil, Yasir H.; Gill, M. Kashif; McKee, Mac; Bastidas, Luis
2006-08-01
The performance of any model depends on how well its associated parameters are estimated. In the current application, a localized Bayesian recursive estimation (LOBARE) approach is devised for parameter estimation. The LOBARE methodology is an extension of the Bayesian recursive estimation (BARE) method. It is applied in this paper on two different types of models: an artificial intelligence (AI) model in the form of a support vector machine (SVM) application for forecasting soil moisture and a conceptual rainfall-runoff (CRR) model represented by the Sacramento soil moisture accounting (SAC-SMA) model. Support vector machines, based on statistical learning theory (SLT), represent the modeling task as a quadratic optimization problem and have already been used in various applications in hydrology. They require estimation of three parameters. SAC-SMA is a very well known model that estimates runoff. It has a 13-dimensional parameter space. In the LOBARE approach presented here, Bayesian inference is used in an iterative fashion to estimate the parameter space that will most likely enclose a best parameter set. This is done by narrowing the sampling space through updating the "parent" bounds based on their fitness. These bounds are actually the parameter sets that were selected by BARE runs on subspaces of the initial parameter space. The new approach results in faster convergence toward the optimal parameter set using minimum training/calibration data and fewer sets of parameter values. The efficacy of the localized methodology is also compared with the previously used BARE algorithm.
A Rather Intelligent Language Teacher.
Cerri, Stefano; Breuker, Joost
1981-01-01
Characteristics of DART (Didactic Augmented Recursive Transition), an ATN-based system for writing intelligent computer assisted instruction (ICAI) programs that is available on the PLATO system are described. DART allows writing programs in an ATN dialect, compiling them in machine code for the PLATO system, and executing them as if the original…
van den Bos, E.; de Rooij, M.; Sumter, S.R.; Westenberg, P.M.
2016-01-01
The present study adds to the emerging literature on the development of social cognition in adolescence by investigating the development of recursive thinking (i.e., thinking about thinking). Previous studies have indicated that the development of recursive thinking is not completed during
Cho, Pyeong Whan; Szkudlarek, Emily; Tabor, Whitney
2016-01-01
Learning is typically understood as a process in which the behavior of an organism is progressively shaped until it closely approximates a target form. It is easy to comprehend how a motor skill or a vocabulary can be progressively learned-in each case, one can conceptualize a series of intermediate steps which lead to the formation of a proficient behavior. With grammar, it is more difficult to think in these terms. For example, center embedding recursive structures seem to involve a complex interplay between multiple symbolic rules which have to be in place simultaneously for the system to work at all, so it is not obvious how the mechanism could gradually come into being. Here, we offer empirical evidence from a new artificial language (or "artificial grammar") learning paradigm, Locus Prediction, that, despite the conceptual conundrum, recursion acquisition occurs gradually, at least for a simple formal language. In particular, we focus on a variant of the simplest recursive language, a (n) b (n) , and find evidence that (i) participants trained on two levels of structure (essentially ab and aabb) generalize to the next higher level (aaabbb) more readily than participants trained on one level of structure (ab) combined with a filler sentence; nevertheless, they do not generalize immediately; (ii) participants trained up to three levels (ab, aabb, aaabbb) generalize more readily to four levels than participants trained on two levels generalize to three; (iii) when we present the levels in succession, starting with the lower levels and including more and more of the higher levels, participants show evidence of transitioning between the levels gradually, exhibiting intermediate patterns of behavior on which they were not trained; (iv) the intermediate patterns of behavior are associated with perturbations of an attractor in the sense of dynamical systems theory. We argue that all of these behaviors indicate a theory of mental representation in which recursive
Recursions of Symmetry Orbits and Reduction without Reduction
Directory of Open Access Journals (Sweden)
Andrei A. Malykh
2011-04-01
Full Text Available We consider a four-dimensional PDE possessing partner symmetries mainly on the example of complex Monge-Ampère equation (CMA. We use simultaneously two pairs of symmetries related by a recursion relation, which are mutually complex conjugate for CMA. For both pairs of partner symmetries, using Lie equations, we introduce explicitly group parameters as additional variables, replacing symmetry characteristics and their complex conjugates by derivatives of the unknown with respect to group parameters. We study the resulting system of six equations in the eight-dimensional space, that includes CMA, four equations of the recursion between partner symmetries and one integrability condition of this system. We use point symmetries of this extended system for performing its symmetry reduction with respect to group parameters that facilitates solving the extended system. This procedure does not imply a reduction in the number of physical variables and hence we end up with orbits of non-invariant solutions of CMA, generated by one partner symmetry, not used in the reduction. These solutions are determined by six linear equations with constant coefficients in the five-dimensional space which are obtained by a three-dimensional Legendre transformation of the reduced extended system. We present algebraic and exponential examples of such solutions that govern Legendre-transformed Ricci-flat Kähler metrics with no Killing vectors. A similar procedure is briefly outlined for Husain equation.
Updating Recursive XML Views of Relations
DEFF Research Database (Denmark)
Choi, Byron; Cong, Gao; Fan, Wenfei
2009-01-01
This paper investigates the view update problem for XML views published from relational data. We consider XML views defined in terms of mappings directed by possibly recursive DTDs compressed into DAGs and stored in relations. We provide new techniques to efficiently support XML view updates...... specified in terms of XPath expressions with recursion and complex filters. The interaction between XPath recursion and DAG compression of XML views makes the analysis of the XML view update problem rather intriguing. Furthermore, many issues are still open even for relational view updates, and need...... to be explored. In response to these, on the XML side, we revise the notion of side effects and update semantics based on the semantics of XML views, and present effecient algorithms to translate XML updates to relational view updates. On the relational side, we propose a mild condition on SPJ views, and show...
Recursive evaluation of interaction forces of unbounded soil in time domain
International Nuclear Information System (INIS)
Motosaka, M.
1987-01-01
Recursive formulations have hardly been used in the analysis of soil-structure interaction. A notable exception is described in Verbic 1973, which corresponds to the impulse-invariant way discussed in Section 2. Section 3 describes another possibility to derive a recursive relation based on a segment approach using z-transforms. An illustrative example is examined in Section 4, and in Section 5 the number of operations is addressed. This compact paper is based on Wolf and Motosaka 1988. (orig./HP)
Adaptable Iterative and Recursive Kalman Filter Schemes
Zanetti, Renato
2014-01-01
Nonlinear filters are often very computationally expensive and usually not suitable for real-time applications. Real-time navigation algorithms are typically based on linear estimators, such as the extended Kalman filter (EKF) and, to a much lesser extent, the unscented Kalman filter. The Iterated Kalman filter (IKF) and the Recursive Update Filter (RUF) are two algorithms that reduce the consequences of the linearization assumption of the EKF by performing N updates for each new measurement, where N is the number of recursions, a tuning parameter. This paper introduces an adaptable RUF algorithm to calculate N on the go, a similar technique can be used for the IKF as well.
The recursive solution of the Schroedinger equation
International Nuclear Information System (INIS)
Haydock, R.
The transformation of an arbitrary quantum model and its subsequent analysis is proposed. The chain expresses mathematically the physical concept of local environment. The recursive transformation yields analytic chains for some systems, but it is also convenient and efficient for constructing numerical chain models enabling the solution of problems which are too big for numerical matrix methods. The chain model sugests new approach to quantum mechanical models. Because of the simple solution of chain models, the qualitative behaviour of different physical properties can be determined. Unlike many methods for solving quantum models, one has rigorous results about the convergence of approximation. Because they are defined recursively, the approsimations are suited to computation. (Ha)
The Method of Recursive Counting: Can one go further?
International Nuclear Information System (INIS)
Creutz, M.; Horvath, I.
1993-12-01
After a short review of the Method of Recursive Counting we introduce a general algebraic description of recursive lattice building. This provides a rigorous framework for discussion of method's limitations
A foundation for real recursive function theory
J.F. Costa; B. S. Loff Barreto (Bruno Serra); J. Mycka
2009-01-01
htmlabstractThe class of recursive functions over the reals, denoted by REC(R), was introduced by Cristopher Moore in his seminal paper written in 1995. Since then many subsequent investigations brought new results: the class REC(R) was put in relation with the class of functions generated by the
Decidability and Expressiveness of Recursive Weighted Logic
DEFF Research Database (Denmark)
Xue, Bingtian; Larsen, Kim Guldstrand; Mardare, Radu Iulian
2014-01-01
Labelled weighted transition systems (LWSs) are transition systems labelled with actions and real numbers. The numbers represent the costs of the corresponding actions in terms of resources. RecursiveWeighted Logic (RWL) is a multimodal logic that expresses qualitative and quantitative properties...
Adaptable recursive binary entropy coding technique
Kiely, Aaron B.; Klimesh, Matthew A.
2002-07-01
We present a novel data compression technique, called recursive interleaved entropy coding, that is based on recursive interleaving of variable-to variable length binary source codes. A compression module implementing this technique has the same functionality as arithmetic coding and can be used as the engine in various data compression algorithms. The encoder compresses a bit sequence by recursively encoding groups of bits that have similar estimated statistics, ordering the output in a way that is suited to the decoder. As a result, the decoder has low complexity. The encoding process for our technique is adaptable in that each bit to be encoded has an associated probability-of-zero estimate that may depend on previously encoded bits; this adaptability allows more effective compression. Recursive interleaved entropy coding may have advantages over arithmetic coding, including most notably the admission of a simple and fast decoder. Much variation is possible in the choice of component codes and in the interleaving structure, yielding coder designs of varying complexity and compression efficiency; coder designs that achieve arbitrarily small redundancy can be produced. We discuss coder design and performance estimation methods. We present practical encoding and decoding algorithms, as well as measured performance results.
Certified higher-order recursive path ordering
Koprowski, A.; Pfenning, F.
2006-01-01
The paper reports on a formalization of a proof of wellfoundedness of the higher-order recursive path ordering (HORPO) in the proof checker Coq. The development is axiom-free and fully constructive. Three substantive parts that could be used also in other developments are the formalizations of the
A Survey on Teaching and Learning Recursive Programming
Rinderknecht, Christian
2014-01-01
We survey the literature about the teaching and learning of recursive programming. After a short history of the advent of recursion in programming languages and its adoption by programmers, we present curricular approaches to recursion, including a review of textbooks and some programming methodology, as well as the functional and imperative…
Interacting via the Heap in the Presence of Recursion
Directory of Open Access Journals (Sweden)
Jurriaan Rot
2012-12-01
Full Text Available Almost all modern imperative programming languages include operations for dynamically manipulating the heap, for example by allocating and deallocating objects, and by updating reference fields. In the presence of recursive procedures and local variables the interactions of a program with the heap can become rather complex, as an unbounded number of objects can be allocated either on the call stack using local variables, or, anonymously, on the heap using reference fields. As such a static analysis is, in general, undecidable. In this paper we study the verification of recursive programs with unbounded allocation of objects, in a simple imperative language for heap manipulation. We present an improved semantics for this language, using an abstraction that is precise. For any program with a bounded visible heap, meaning that the number of objects reachable from variables at any point of execution is bounded, this abstraction is a finitary representation of its behaviour, even though an unbounded number of objects can appear in the state. As a consequence, for such programs model checking is decidable. Finally we introduce a specification language for temporal properties of the heap, and discuss model checking these properties against heap-manipulating programs.
Algorithms in ambient intelligence
Aarts, E.H.L.; Korst, J.H.M.; Verhaegh, W.F.J.; Weber, W.; Rabaey, J.M.; Aarts, E.
2005-01-01
We briefly review the concept of ambient intelligence and discuss its relation with the domain of intelligent algorithms. By means of four examples of ambient intelligent systems, we argue that new computing methods and quantification measures are needed to bridge the gap between the class of
Designing with computational intelligence
Lopes, Heitor; Mourelle, Luiza
2017-01-01
This book discusses a number of real-world applications of computational intelligence approaches. Using various examples, it demonstrates that computational intelligence has become a consolidated methodology for automatically creating new competitive solutions to complex real-world problems. It also presents a concise and efficient synthesis of different systems using computationally intelligent techniques.
A recursive reduction of tensor Feynman integrals
International Nuclear Information System (INIS)
Diakonidis, T.; Riemann, T.; Tausk, J.B.; Fleischer, J.
2009-07-01
We perform a recursive reduction of one-loop n-point rank R tensor Feynman integrals [in short: (n,R)-integrals] for n≤6 with R≤n by representing (n,R)-integrals in terms of (n,R-1)- and (n-1,R-1)-integrals. We use the known representation of tensor integrals in terms of scalar integrals in higher dimension, which are then reduced by recurrence relations to integrals in generic dimension. With a systematic application of metric tensor representations in terms of chords, and by decomposing and recombining these representations, we find the recursive reduction for the tensors. The procedure represents a compact, sequential algorithm for numerical evaluations of tensor Feynman integrals appearing in next-to-leading order contributions to massless and massive three- and four-particle production at LHC and ILC, as well as at meson factories. (orig.)
A recursive algorithm for trees and forests
Guo, Song; Guo, Victor J. W.
2017-01-01
Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on $\\{1,2,\\ldots,n\\}$. Classical formulas for counting various trees such as rooted trees, bipartite trees, tripartite trees, plane trees, $k$-ary plane trees, $k$-edge colored trees follow immediately from our recursive relations.
Geometrical interpretation of the topological recursion, and integrable string theories
Eynard, Bertrand
2009-01-01
Symplectic invariants introduced in math-ph/0702045 can be computed for an arbitrary spectral curve. For some examples of spectral curves, those invariants can solve loop equations of matrix integrals, and many problems of enumerative geometry like maps, partitions, Hurwitz numbers, intersection numbers, Gromov-Witten invariants... The problem is thus to understand what they count, or in other words, given a spectral curve, construct an enumerative geometry problem. This is what we do in a semi-heuristic approach in this article. Starting from a spectral curve, i.e. an integrable system, we use its flat connection and flat coordinates, to define a family of worldsheets, whose enumeration is indeed solved by the topological recursion and symplectic invariants. In other words, for any spectral curve, we construct a corresponding string theory, whose target space is a submanifold of the Jacobian.
Tracking of nuclear reactor parameters via recursive non linear estimation
International Nuclear Information System (INIS)
Pages Fita, J.; Alengrin, G.; Aguilar Martin, J.; Zwingelstein, M.
1975-01-01
The usefulness of nonlinear estimation in the supervision of nuclear reactors, as well for reactivity determination as for on-line modelisation in order to detect eventual and unwanted changes in working operation is illustrated. It is dealt with the reactivity estimation using an a priori dynamical model under the hypothesis of one group of delayed neutrons (measurements were done with an ionisation chamber). The determination of the reactivity using such measurements appears as a nonlinear estimation procedure derived from a particular form of nonlinear filter. Observed inputs being demand of power and inside temperature, and output being the reactivity balance, a recursive algorithm is derived for the estimation of the parameters that define the actual behavior of the reactor. Example of treatment of real data is given [fr
A recursive economic dispatch algorithm for assessing the cost of thermal generator schedules
International Nuclear Information System (INIS)
Wong, K.P.; Doan, K.
1992-01-01
This paper develops an efficient, recursive algorithm for determining the economic power dispatch of thermal generators within the unit commitment environment. A method for incorporating the operation limits of all on-line generators and limits due to ramping generators is developed in the paper. The developed algorithm is amenable for computer implementation using the artificial intelligence programming language, Prolog. The performance of the developed algorithm is demonstrated through its application to evaluate the costs of dispatching 13 thermal generators within a generator schedule in a 24-hour schedule horizon
International Nuclear Information System (INIS)
Perret-Galix, D.
1992-01-01
A vivid example of the growing need for frontier physics experiments to make use of frontier technology is in the field of artificial intelligence and related themes. This was reflected in the second international workshop on 'Software Engineering, Artificial Intelligence and Expert Systems in High Energy and Nuclear Physics' which took place from 13-18 January at France Telecom's Agelonde site at La Londe des Maures, Provence. It was the second in a series, the first having been held at Lyon in 1990
Improved Undecidability Results for Reachability Games on Recursive Timed Automata
Directory of Open Access Journals (Sweden)
Shankara Narayanan Krishna
2014-08-01
Full Text Available We study reachability games on recursive timed automata (RTA that generalize Alur-Dill timed automata with recursive procedure invocation mechanism similar to recursive state machines. It is known that deciding the winner in reachability games on RTA is undecidable for automata with two or more clocks, while the problem is decidable for automata with only one clock. Ouaknine and Worrell recently proposed a time-bounded theory of real-time verification by claiming that restriction to bounded-time recovers decidability for several key decision problem related to real-time verification. We revisited games on recursive timed automata with time-bounded restriction in the hope of recovering decidability. However, we found that the problem still remains undecidable for recursive timed automata with three or more clocks. Using similar proof techniques we characterize a decidability frontier for a generalization of RTA to recursive stopwatch automata.
Baechler, Simon; Morelato, Marie; Ribaux, Olivier; Beavis, Alison; Tahtouh, Mark; Kirkbride, K Paul; Esseiva, Pierre; Margot, Pierre; Roux, Claude
2015-05-01
The development of forensic intelligence relies on the expression of suitable models that better represent the contribution of forensic intelligence in relation to the criminal justice system, policing and security. Such models assist in comparing and evaluating methods and new technologies, provide transparency and foster the development of new applications. Interestingly, strong similarities between two separate projects focusing on specific forensic science areas were recently observed. These observations have led to the induction of a general model (Part I) that could guide the use of any forensic science case data in an intelligence perspective. The present article builds upon this general approach by focusing on decisional and organisational issues. The article investigates the comparison process and evaluation system that lay at the heart of the forensic intelligence framework, advocating scientific decision criteria and a structured but flexible and dynamic architecture. These building blocks are crucial and clearly lay within the expertise of forensic scientists. However, it is only part of the problem. Forensic intelligence includes other blocks with their respective interactions, decision points and tensions (e.g. regarding how to guide detection and how to integrate forensic information with other information). Formalising these blocks identifies many questions and potential answers. Addressing these questions is essential for the progress of the discipline. Such a process requires clarifying the role and place of the forensic scientist within the whole process and their relationship to other stakeholders. Copyright © 2015 Elsevier Ireland Ltd. All rights reserved.
Nonparametric bootstrap procedures for predictive inference based on recursive estimation schemes
Corradi, Valentina; Swanson, Norman R.
2005-01-01
Our objectives in this paper are twofold. First, we introduce block bootstrap techniques that are (first order) valid in recursive estimation frameworks. Thereafter, we present two examples where predictive accuracy tests are made operational using our new bootstrap procedures. In one application, we outline a consistent test for out-of-sample nonlinear Granger causality, and in the other we outline a test for selecting amongst multiple alternative forecasting models, all of which are possibl...
Naturalist Intelligence Among the Other Multiple Intelligences [In Bulgarian
Directory of Open Access Journals (Sweden)
R. Genkov
2007-09-01
Full Text Available The theory of multiple intelligences was presented by Gardner in 1983. The theory was revised later (1999 and among the other intelligences a naturalist intelligence was added. The criteria for distinguishing of the different types of intelligences are considered. While Gardner restricted the analysis of the naturalist intelligence with examples from the living nature only, the present paper considered this problem on wider background including objects and persons of the natural sciences.
Recursive definition of global cellular-automata mappings
DEFF Research Database (Denmark)
Feldberg, Rasmus; Knudsen, Carsten; Rasmussen, Steen
1994-01-01
A method for a recursive definition of global cellular-automata mappings is presented. The method is based on a graphical representation of global cellular-automata mappings. For a given cellular-automaton rule the recursive algorithm defines the change of the global cellular-automaton mapping...... as the number of lattice sites is incremented. A proof of lattice size invariance of global cellular-automata mappings is derived from an approximation to the exact recursive definition. The recursive definitions are applied to calculate the fractal dimension of the set of reachable states and of the set...
Recursive definition of global cellular-automata mappings
International Nuclear Information System (INIS)
Feldberg, R.; Knudsen, C.; Rasmussen, S.
1994-01-01
A method for a recursive definition of global cellular-automata mappings is presented. The method is based on a graphical representation of global cellular-automata mappings. For a given cellular-automaton rule the recursive algorithm defines the change of the global cellular-automaton mapping as the number of lattice sites is incremented. A proof of lattice size invariance of global cellular-automata mappings is derived from an approximation to the exact recursive definition. The recursive definitions are applied to calculate the fractal dimension of the set of reachable states and of the set of fixed points of cellular automata on an infinite lattice
Intelligence in Artificial Intelligence
Datta, Shoumen Palit Austin
2016-01-01
The elusive quest for intelligence in artificial intelligence prompts us to consider that instituting human-level intelligence in systems may be (still) in the realm of utopia. In about a quarter century, we have witnessed the winter of AI (1990) being transformed and transported to the zenith of tabloid fodder about AI (2015). The discussion at hand is about the elements that constitute the canonical idea of intelligence. The delivery of intelligence as a pay-per-use-service, popping out of ...
Recursive deconvolution of combinatorial chemical libraries.
Erb, E; Janda, K D; Brenner, S
1994-01-01
A recursive strategy that solves for the active members of a chemical library is presented. A pentapeptide library with an alphabet of Gly, Leu, Phe, and Tyr (1024 members) was constructed on a solid support by the method of split synthesis. One member of this library (NH2-Tyr-Gly-Gly-Phe-Leu) is a native binder to a beta-endorphin antibody. A variation of the split synthesis approach is used to build the combinatorial library. In four vials, a member of the library's alphabet is coupled to a...
The Lehmer Matrix and Its Recursive Analogue
2010-01-01
LU factorization of matrix A by considering det A = det U = ∏n i=1 2i−1 i2 . The nth Catalan number is given in terms of binomial coefficients by Cn...for failing to comply with a collection of information if it does not display a currently valid OMB control number . 1. REPORT DATE 2010 2. REPORT...TYPE 3. DATES COVERED 00-00-2010 to 00-00-2010 4. TITLE AND SUBTITLE The Lehmer matrix and its recursive analogue 5a. CONTRACT NUMBER 5b
Syntactic Recursion Facilitates and Working Memory Predicts Recursive Theory of Mind
Arslan, Burcu; Hohenberger, Annette; Verbrugge, Rineke
2017-01-01
In this study, we focus on the possible roles of second-order syntactic recursion and working memory in terms of simple and complex span tasks in the development of second-order false belief reasoning. We tested 89 Turkish children in two age groups, one younger (4;6-6;5 years) and one older
Energy Technology Data Exchange (ETDEWEB)
NONE
2001-07-01
Contents: Daylighting and energy management, light offices by daylight guidance, fresh air after demand by frequency converters, saving heating cost by intelligent control, optimized lighting systems in schools, fresh air from an external provider and compressed air monitoring in a mine. (GL)
CSIR Research Space (South Africa)
Macagnano, EV
2008-09-01
Full Text Available ) into ‘Intelligent Enabling Environments’, where disabled and aged people would be provided with user-friendly wearable computing devices, connected to a wireless, distributed and invisible two/multi-way data transmission system, able to allow access ‘on...
Active control versus recursive backstepping control of a chaotic ...
African Journals Online (AJOL)
... than for the recursive backstepping controllers. However, the flexibility in the choice of the control laws for recursive backstepping design gives room for further improvement in its performance and enables it to achieve the goals of stabilization and tracking. Journal of the Nigerian Association of Mathematical Physics Vol.
Recursive representation of Wronskians in confluent supersymmetric quantum mechanics
International Nuclear Information System (INIS)
Contreras-Astorga, Alonso; Schulze-Halberg, Axel
2017-01-01
A recursive form of arbitrary-order Wronskian associated with transformation functions in the confluent algorithm of supersymmetric quantum mechanics (SUSY) is constructed. With this recursive form regularity conditions for the generated potentials can be analyzed. Moreover, as byproducts we obtain new representations of solutions to Schrödinger equations that underwent a confluent SUSY-transformation. (paper)
Language, Mind, Practice: Families of Recursive Thinking in Human Reasoning
Josephson, Marika
2011-01-01
In 2002, Chomsky, Hauser, and Fitch asserted that recursion may be the one aspect of the human language faculty that makes human language unique in the narrow sense--unique to language and unique to human beings. They also argue somewhat more quietly (as do Pinker and Jackendoff 2005) that recursion may be possible outside of language: navigation,…
Recursive smoothers for hidden discrete-time Markov chains
Directory of Open Access Journals (Sweden)
Lakhdar Aggoun
2005-01-01
Full Text Available We consider a discrete-time Markov chain observed through another Markov chain. The proposed model extends models discussed by Elliott et al. (1995. We propose improved recursive formulae to update smoothed estimates of processes related to the model. These recursive estimates are used to update the parameter of the model via the expectation maximization (EM algorithm.
Cosymmetries and Nijenhuis recursion operators for difference equations
International Nuclear Information System (INIS)
Mikhailov, Alexander V; Xenitidis, Pavlos; Wang, Jing Ping
2011-01-01
In this paper we discuss the concept of cosymmetries and co-recursion operators for difference equations and present a co-recursion operator for the Viallet equation. We also discover a new type of factorization for the recursion operators of difference equations. This factorization enables us to give an elegant proof that the pseudo-difference operator R presented in Mikhailov et al 2011 Theor. Math. Phys. 167 421–43 is a recursion operator for the Viallet equation. Moreover, we show that the operator R is Nijenhuis and thus generates infinitely many commuting local symmetries. The recursion operator R and its factorization into Hamiltonian and symplectic operators have natural applications to Yamilov's discretization of the Krichever–Novikov equation
All-Pole Recursive Digital Filters Design Based on Ultraspherical Polynomials
Directory of Open Access Journals (Sweden)
N. Stojanovic
2014-09-01
Full Text Available A simple method for approximation of all-pole recursive digital filters, directly in digital domain, is described. Transfer function of these filters, referred to as Ultraspherical filters, is controlled by order of the Ultraspherical polynomial, nu. Parameter nu, restricted to be a nonnegative real number (nu ≥ 0, controls ripple peaks in the passband of the magnitude response and enables a trade-off between the passband loss and the group delay response of the resulting filter. Chebyshev filters of the first and of the second kind, and also Legendre and Butterworth filters are shown to be special cases of these allpole recursive digital filters. Closed form equations for the computation of the filter coefficients are provided. The design technique is illustrated with examples.
DEFF Research Database (Denmark)
Schwinghammer, Jan; Birkedal, Lars; Støvring, Kristian
2011-01-01
´eraud and Pottier’s type and capability system including both frame and anti-frame rules. The model is a possible worlds model based on the operational semantics and step-indexed heap relations, and the worlds are constructed as a recursively defined predicate on a recursively defined metric space. We also extend...
DEFF Research Database (Denmark)
Birkedal, Lars; Schwinghammer, Jan; Støvring, Kristian
2010-01-01
for Chargu´eraud and Pottier’s type and capability system including frame and anti-frame rules, based on the operational semantics and step-indexed heap relations. The worlds are constructed as a recursively defined predicate on a recursively defined metric space, which provides a considerably simpler...
Algebraic Optimization of Recursive Database Queries
DEFF Research Database (Denmark)
Hansen, Michael Reichhardt
1988-01-01
Queries are expressed by relational algebra expressions including a fixpoint operation. A condition is presented under which a natural join commutes with a fixpoint operation. This condition is a simple check of attribute sets of sub-expressions of the query. The work may be considered a generali......Queries are expressed by relational algebra expressions including a fixpoint operation. A condition is presented under which a natural join commutes with a fixpoint operation. This condition is a simple check of attribute sets of sub-expressions of the query. The work may be considered...... a generalization of Aho and Ullman, (1979). The result is interpreted in function free logic database terms as a transformation of the recursively defined predicate involving: (a) elimination of an argument, and (b) propagation of selections (instantiations) to the extensionally defined predicates. A collection...
Locating one pairwise interaction: Three recursive constructions
Directory of Open Access Journals (Sweden)
Charles J. Colbourn
2016-09-01
Full Text Available In a complex component-based system, choices (levels for components (factors may interact tocause faults in the system behaviour. When faults may be caused by interactions among few factorsat specific levels, covering arrays provide a combinatorial test suite for discovering the presence offaults. While well studied, covering arrays do not enable one to determine the specific levels of factorscausing the faults; locating arrays ensure that the results from test suite execution suffice to determinethe precise levels and factors causing faults, when the number of such causes is small. Constructionsfor locating arrays are at present limited to heuristic computational methods and quite specific directconstructions. In this paper three recursive constructions are developed for locating arrays to locateone pairwise interaction causing a fault.
Syntactic Recursion Facilitates and Working Memory Predicts Recursive Theory of Mind.
Directory of Open Access Journals (Sweden)
Burcu Arslan
Full Text Available In this study, we focus on the possible roles of second-order syntactic recursion and working memory in terms of simple and complex span tasks in the development of second-order false belief reasoning. We tested 89 Turkish children in two age groups, one younger (4;6-6;5 years and one older (6;7-8;10 years. Although second-order syntactic recursion is significantly correlated with the second-order false belief task, results of ordinal logistic regressions revealed that the main predictor of second-order false belief reasoning is complex working memory span. Unlike simple working memory and second-order syntactic recursion tasks, the complex working memory task required processing information serially with additional reasoning demands that require complex working memory strategies. Based on our results, we propose that children's second-order theory of mind develops when they have efficient reasoning rules to process embedded beliefs serially, thus overcoming a possible serial processing bottleneck.
Syntactic Recursion Facilitates and Working Memory Predicts Recursive Theory of Mind
Arslan, Burcu; Hohenberger, Annette; Verbrugge, Rineke
2017-01-01
In this study, we focus on the possible roles of second-order syntactic recursion and working memory in terms of simple and complex span tasks in the development of second-order false belief reasoning. We tested 89 Turkish children in two age groups, one younger (4;6–6;5 years) and one older (6;7–8;10 years). Although second-order syntactic recursion is significantly correlated with the second-order false belief task, results of ordinal logistic regressions revealed that the main predictor of second-order false belief reasoning is complex working memory span. Unlike simple working memory and second-order syntactic recursion tasks, the complex working memory task required processing information serially with additional reasoning demands that require complex working memory strategies. Based on our results, we propose that children’s second-order theory of mind develops when they have efficient reasoning rules to process embedded beliefs serially, thus overcoming a possible serial processing bottleneck. PMID:28072823
Lipavská, Helena; Žárský, Viktor
2009-01-01
The concept of plant intelligence, as proposed by Anthony Trewavas, has raised considerable discussion. However, plant intelligence remains loosely defined; often it is either perceived as practically synonymous to Darwinian fitness, or reduced to a mere decorative metaphor. A more strict view can be taken, emphasizing necessary prerequisites such as memory and learning, which requires clarifying the definition of memory itself. To qualify as memories, traces of past events have to be not only stored, but also actively accessed. We propose a criterion for eliminating false candidates of possible plant intelligence phenomena in this stricter sense: an “intelligent” behavior must involve a component that can be approximated by a plausible algorithmic model involving recourse to stored information about past states of the individual or its environment. Re-evaluation of previously presented examples of plant intelligence shows that only some of them pass our test. “You were hurt?” Kumiko said, looking at the scar. Sally looked down. “Yeah.” “Why didn't you have it removed?” “Sometimes it's good to remember.” “Being hurt?” “Being stupid.”—(W. Gibson: Mona Lisa Overdrive) PMID:19816094
On Recursive Modification in Child L1 French
Directory of Open Access Journals (Sweden)
Yves Roberge
2018-03-01
Full Text Available This paper investigates nominal recursive modification (RM in the L1 acquisition of French. Although recursion is considered the fundamental property of human languages, recursive self-embedding is found to be difficult for children in a variety of languages and constructions. Despite these challenges, the acquisition of RM proves to be resilient; acquirable even under severely degraded input conditions. From a minimalist perspective on the operations of narrow syntax, recursive embedding is essentially the application of a sequence of Merge operations (Chomsky 1995; Trotzke and Zwart 2014; therefore, given the universality of Merge, we do not expect to find cross-linguistic differences in how difficult recursion is. But if the challenging nature of recursion stems from factors which might differ from language to language, we expect different outcomes cross-linguistically. We compare new data from French to existing English data (Pérez-Leroux et al. 2012 in order to examine to what extent language-specific properties of RM structures determine the acquisition path. While children’s production differs significantly from their adult’s counterparts, we find no differences between French-speaking and English-speaking children. Our findings suggest that the challenging nature of recursion does not stem from the grammar itself and that what shapes the acquisition path is the interaction between universal properties of language and considerations not specific to language, namely computational efficiency.
Guided wave tomography in anisotropic media using recursive extrapolation operators
Volker, Arno
2018-04-01
Guided wave tomography is an advanced technology for quantitative wall thickness mapping to image wall loss due to corrosion or erosion. An inversion approach is used to match the measured phase (time) at a specific frequency to a model. The accuracy of the model determines the sizing accuracy. Particularly for seam welded pipes there is a measurable amount of anisotropy. Moreover, for small defects a ray-tracing based modelling approach is no longer accurate. Both issues are solved by applying a recursive wave field extrapolation operator assuming vertical transverse anisotropy. The inversion scheme is extended by not only estimating the wall loss profile but also the anisotropy, local material changes and transducer ring alignment errors. This makes the approach more robust. The approach will be demonstrated experimentally on different defect sizes, and a comparison will be made between this new approach and an isotropic ray-tracing approach. An example is given in Fig. 1 for a 75 mm wide, 5 mm deep defect. The wave field extrapolation based tomography clearly provides superior results.
Tracking of Multiple Moving Sources Using Recursive EM Algorithm
Directory of Open Access Journals (Sweden)
Böhme Johann F
2005-01-01
Full Text Available We deal with recursive direction-of-arrival (DOA estimation of multiple moving sources. Based on the recursive EM algorithm, we develop two recursive procedures to estimate the time-varying DOA parameter for narrowband signals. The first procedure requires no prior knowledge about the source movement. The second procedure assumes that the motion of moving sources is described by a linear polynomial model. The proposed recursion updates the polynomial coefficients when a new data arrives. The suggested approaches have two major advantages: simple implementation and easy extension to wideband signals. Numerical experiments show that both procedures provide excellent results in a slowly changing environment. When the DOA parameter changes fast or two source directions cross with each other, the procedure designed for a linear polynomial model has a better performance than the general procedure. Compared to the beamforming technique based on the same parameterization, our approach is computationally favorable and has a wider range of applications.
Convolution of second order linear recursive sequences II.
Directory of Open Access Journals (Sweden)
Szakács Tamás
2017-12-01
Full Text Available We continue the investigation of convolutions of second order linear recursive sequences (see the first part in [1]. In this paper, we focus on the case when the characteristic polynomials of the sequences have common root.
Recursive stochastic effects in valley hybrid inflation
Levasseur, Laurence Perreault; Vennin, Vincent; Brandenberger, Robert
2013-10-01
Hybrid inflation is a two-field model where inflation ends because of a tachyonic instability, the duration of which is determined by stochastic effects and has important observational implications. Making use of the recursive approach to the stochastic formalism presented in [L. P. Levasseur, preceding article, Phys. Rev. D 88, 083537 (2013)], these effects are consistently computed. Through an analysis of backreaction, this method is shown to converge in the valley but points toward an (expected) instability in the waterfall. It is further shown that the quasistationarity of the auxiliary field distribution breaks down in the case of a short-lived waterfall. We find that the typical dispersion of the waterfall field at the critical point is then diminished, thus increasing the duration of the waterfall phase and jeopardizing the possibility of a short transition. Finally, we find that stochastic effects worsen the blue tilt of the curvature perturbations by an O(1) factor when compared with the usual slow-roll contribution.
Recursive relations for processes with n photons of noncommutative QED
International Nuclear Information System (INIS)
Jafari, Abolfazl
2007-01-01
Recursion relations are derived in the sense of Berends-Giele for the multi-photon processes of noncommutative QED. The relations concern purely photonic processes as well as the processes with two fermions involved, both for arbitrary number of photons at tree level. It is shown that despite of the dependence of noncommutative vertices on momentum, in contrast to momentum-independent color factors of QCD, the recursion relation method can be employed for multi-photon processes of noncommutative QED
COMPARISON OF RECURSIVE ESTIMATION TECHNIQUES FOR POSITION TRACKING RADIOACTIVE SOURCES
International Nuclear Information System (INIS)
Muske, K.; Howse, J.
2000-01-01
This paper compares the performance of recursive state estimation techniques for tracking the physical location of a radioactive source within a room based on radiation measurements obtained from a series of detectors at fixed locations. Specifically, the extended Kalman filter, algebraic observer, and nonlinear least squares techniques are investigated. The results of this study indicate that recursive least squares estimation significantly outperforms the other techniques due to the severe model nonlinearity
Quantum rings and recursion relations in 2D quantum gravity
International Nuclear Information System (INIS)
Kachru, S.
1992-01-01
This paper discusses tachyon condensate perturbations to the action of the two-dimensional string theory corresponding to the c + 1 matrix model. These are shown to deform the action of the ground ring on the tachyon modules, confirming a conjecture of Witten. The ground ring structure is used to derive recursion relations which relate (N + 1) and N tachyon bulk scattering amplitudes. These recursion relations allow one to compute all bulk amplitudes
Artificial Intelligence and Science Education.
Good, Ron
1987-01-01
Defines artificial intelligence (AI) in relation to intelligent computer-assisted instruction (ICAI) and science education. Provides a brief background of AI work, examples of expert systems, examples of ICAI work, and addresses problems facing AI workers that have implications for science education. Proposes a revised model of the Karplus/Renner…
Presti, Giovambattista; Premarini, Claudio; Leuzzi, Martina; Di Blasi, Melina; Squatrito, Valeria
2017-11-01
The operant was conceptualized by Skinner as a class of behaviors which have common effect on the environment and that, as a class can be shown to vary lawfully in their relations to the other environmental variables, namely antecedents and consequences. And Skinner himself underlined the fact that "operant field is the very field purpose of behavior". The operant offers interesting basic and applied characteristic to conceptualize complex behavior as a recursive process of learning. In this paper we will discuss how the operant concept can be applied in the implementation of software oriented to increase cognitive skills in autistic children and provide an example.
Event-triggered sensor data transmission policy for receding horizon recursive state estimation
Directory of Open Access Journals (Sweden)
Yunji Li
2017-06-01
Full Text Available We consider a sensor data transmission policy for receding horizon recursive state estimation in a networked linear system. A good tradeoff between estimation error and communication rate could be achieved according to a transmission strategy, which decides the transfer time of the data packet. Here we give this transmission policy through proving the upper bound of system performance. Moreover, the lower bound of system performance is further analyzed in detail. A numerical example is given to verify the potential and effectiveness of the theoretical results.
Recursion to food plants by free-ranging Bornean elephant
Directory of Open Access Journals (Sweden)
Megan English
2015-08-01
Full Text Available Plant recovery rates after herbivory are thought to be a key factor driving recursion by herbivores to sites and plants to optimise resource-use but have not been investigated as an explanation for recursion in large herbivores. We investigated the relationship between plant recovery and recursion by elephants (Elephas maximus borneensis in the Lower Kinabatangan Wildlife Sanctuary, Sabah. We identified 182 recently eaten food plants, from 30 species, along 14 × 50 m transects and measured their recovery growth each month over nine months or until they were re-browsed by elephants. The monthly growth in leaf and branch or shoot length for each plant was used to calculate the time required (months for each species to recover to its pre-eaten length. Elephant returned to all but two transects with 10 eaten plants, a further 26 plants died leaving 146 plants that could be re-eaten. Recursion occurred to 58% of all plants and 12 of the 30 species. Seventy-seven percent of the re-eaten plants were grasses. Recovery times to all plants varied from two to twenty months depending on the species. Recursion to all grasses coincided with plant recovery whereas recursion to most browsed plants occurred four to twelve months before they had recovered to their previous length. The small sample size of many browsed plants that received recursion and uneven plant species distribution across transects limits our ability to generalise for most browsed species but a prominent pattern in plant-scale recursion did emerge. Plant recovery time was a good predictor of time to recursion but varied as a function of growth form (grass, ginger, palm, liana and woody and differences between sites. Time to plant recursion coincided with plant recovery time for the elephant’s preferred food, grasses, and perhaps also gingers, but not the other browsed species. Elephants are bulk feeders so it is likely that they time their returns to bulk feed on these grass species when
Recursion to food plants by free-ranging Bornean elephant.
English, Megan; Gillespie, Graeme; Goossens, Benoit; Ismail, Sulaiman; Ancrenaz, Marc; Linklater, Wayne
2015-01-01
Plant recovery rates after herbivory are thought to be a key factor driving recursion by herbivores to sites and plants to optimise resource-use but have not been investigated as an explanation for recursion in large herbivores. We investigated the relationship between plant recovery and recursion by elephants (Elephas maximus borneensis) in the Lower Kinabatangan Wildlife Sanctuary, Sabah. We identified 182 recently eaten food plants, from 30 species, along 14 × 50 m transects and measured their recovery growth each month over nine months or until they were re-browsed by elephants. The monthly growth in leaf and branch or shoot length for each plant was used to calculate the time required (months) for each species to recover to its pre-eaten length. Elephant returned to all but two transects with 10 eaten plants, a further 26 plants died leaving 146 plants that could be re-eaten. Recursion occurred to 58% of all plants and 12 of the 30 species. Seventy-seven percent of the re-eaten plants were grasses. Recovery times to all plants varied from two to twenty months depending on the species. Recursion to all grasses coincided with plant recovery whereas recursion to most browsed plants occurred four to twelve months before they had recovered to their previous length. The small sample size of many browsed plants that received recursion and uneven plant species distribution across transects limits our ability to generalise for most browsed species but a prominent pattern in plant-scale recursion did emerge. Plant recovery time was a good predictor of time to recursion but varied as a function of growth form (grass, ginger, palm, liana and woody) and differences between sites. Time to plant recursion coincided with plant recovery time for the elephant's preferred food, grasses, and perhaps also gingers, but not the other browsed species. Elephants are bulk feeders so it is likely that they time their returns to bulk feed on these grass species when quantities have
Jensen, Jensenism, and the Sociology of Intelligence.
Gottfredson, Linda S.
1998-01-01
Describes public controversy over Jensen's work on genetic differences in intelligence as an example of sociopolitical consequences that can accompany the dispersion in "g" (general factor of intelligence) in a society. (Author/SLD)
Video game for learning and metaphorization of recursive algorithms
Directory of Open Access Journals (Sweden)
Ricardo Inacio Alvares Silva
2013-09-01
Full Text Available The learning of recursive algorithms in computer programming is problematic, because its execution and resolution is not natural to the thinking way people are trained and used to since young. As with other topics in algorithms, we use metaphors to make parallels between the abstract and the concrete to help in understanding the operation of recursive algorithms. However, the classic metaphors employed in this area, such as calculating factorial recursively and Towers of Hanoi game, may just confuse more or be insufficient. In this work, we produced a computer game to assist students in computer courses in learning recursive algorithms. It was designed to have regular video game characteristics, with narrative and classical gameplay elements, commonly found in this kind of product. Aiding to education occurs through metaphorization, or in other words, through experiences provided by game situations that refer to recursive algorithms. To this end, we designed and imbued in the game four valid metaphors related to the theory, and other minor references to the subject.
Recursion method in the k-space representation
International Nuclear Information System (INIS)
Anlage, S.M.; Smith, D.L.
1986-01-01
We show that by using a unitary transformation to k space and the special-k-point method for evaluating Brillouin-zone sums, the recursion method can be very effectively applied to translationally invariant systems. We use this approach to perform recursion calculations for realistic tight-binding Hamiltonians which describe diamond- and zinc-blende-structure semiconductors. Projected densities of states for these Hamiltonians have band gaps and internal van Hove singularities. We calculate coefficients for 63 recursion levels exactly and for about 200 recursion levels to a good approximation. Comparisons are made for materials with different magnitude band gaps (diamond, Si, α-Sn). Comparison is also made between materials with one (e.g., diamond) and two (e.g., GaAs) band gaps. The asymptotic behavior of the recursion coefficients is studied by Fourier analysis. Band gaps in the projected density of states dominate the asymptotic behavior. Perturbation analysis describes the asymptotic behavior rather well. Projected densities of states are calculated using a very simple termination scheme. These densities of states compare favorably with the results of Gilat-Raubenheimer integration
Intelligible Artificial Intelligence
Weld, Daniel S.; Bansal, Gagan
2018-01-01
Since Artificial Intelligence (AI) software uses techniques like deep lookahead search and stochastic optimization of huge neural networks to fit mammoth datasets, it often results in complex behavior that is difficult for people to understand. Yet organizations are deploying AI algorithms in many mission-critical settings. In order to trust their behavior, we must make it intelligible --- either by using inherently interpretable models or by developing methods for explaining otherwise overwh...
Analytic study of the Migdal-Kadanoff recursion formula
International Nuclear Information System (INIS)
Ito, K.R.
1984-01-01
After proposing lattice gauge field models in which the Migdal renormalization group recursion formulas are exact, we study the recursion formulas analytically. If D is less than 4, it is shown that the effective actions of D-dimensional U(1) lattice gauge models are uniformly driven to the high temperature region no matter how low the initial temperature is. If the initial temperature is large enough, this holds for any D and gauge group G. These are also the cases for the recursion formulas of Kadanoff type. It turns out, however, that the string tension for D=3 obtained by these methods is rather big compared with the one already obtained by Mack, Goepfert and by the present author. The reason is clarified. (orig.)
On Recursion Operator of the q -KP Hierarchy
International Nuclear Information System (INIS)
Tian Ke-Lei; Zhu Xiao-Ming; He Jing-Song
2016-01-01
It is the aim of the present article to give a general expression of flow equations of the q-KP hierarchy. The distinct difference between the q-KP hierarchy and the KP hierarchy is due to q-binomial and the action of q-shift operator θ, which originates from the Leibnitz rule of the quantum calculus. We further show that the n-reduction leads to a recursive scheme for these flow equations. The recursion operator for the flow equations of the q-KP hierarchy under the n-reduction is also derived. (paper)
Recursive B-spline approximation using the Kalman filter
Directory of Open Access Journals (Sweden)
Jens Jauch
2017-02-01
Full Text Available This paper proposes a novel recursive B-spline approximation (RBA algorithm which approximates an unbounded number of data points with a B-spline function and achieves lower computational effort compared with previous algorithms. Conventional recursive algorithms based on the Kalman filter (KF restrict the approximation to a bounded and predefined interval. Conversely RBA includes a novel shift operation that enables to shift estimated B-spline coefficients in the state vector of a KF. This allows to adapt the interval in which the B-spline function can approximate data points during run-time.
Chang, Chein-I
2017-01-01
This book explores recursive architectures in designing progressive hyperspectral imaging algorithms. In particular, it makes progressive imaging algorithms recursive by introducing the concept of Kalman filtering in algorithm design so that hyperspectral imagery can be processed not only progressively sample by sample or band by band but also recursively via recursive equations. This book can be considered a companion book of author’s books, Real-Time Progressive Hyperspectral Image Processing, published by Springer in 2016. Explores recursive structures in algorithm architecture Implements algorithmic recursive architecture in conjunction with progressive sample and band processing Derives Recursive Hyperspectral Sample Processing (RHSP) techniques according to Band-Interleaved Sample/Pixel (BIS/BIP) acquisition format Develops Recursive Hyperspectral Band Processing (RHBP) techniques according to Band SeQuential (BSQ) acquisition format for hyperspectral data.
A recursion relation for coefficients of fractional parentage in the seniority scheme
International Nuclear Information System (INIS)
Evans, T.
1985-01-01
A recursion relations for coefficients as fractional parentage in the seniority scheme are discussed. Determinated dependence of recursion relations from the particle number permit to evaluate matrix elements of creation and annihilation operators for fermions or bosons. 10 refs. (author)
Hunt, Earl B
1975-01-01
Artificial Intelligence provides information pertinent to the fundamental aspects of artificial intelligence. This book presents the basic mathematical and computational approaches to problems in the artificial intelligence field.Organized into four parts encompassing 16 chapters, this book begins with an overview of the various fields of artificial intelligence. This text then attempts to connect artificial intelligence problems to some of the notions of computability and abstract computing devices. Other chapters consider the general notion of computability, with focus on the interaction bet
Multiphonon theory: generalized Wick's theorem and recursion formulas
International Nuclear Information System (INIS)
Silvestre-Brac, B.; Piepenbring, R.
1982-04-01
Overlaps and matrix elements of one and two-body operators are calculated in a space spanned by multiphonons of different types taking properly the Pauli principle into account. Two methods are developped: a generalized Wick's theorem dealing with new contractions and recursion formulas well suited for numerical applications
Active control versus recursive backstepping control of a chaotic ...
African Journals Online (AJOL)
In this paper active controllers and recursive backstepping controllers are designed for a third order chaotic system. The performances of these controllers in the control of the dynamics of the chaotic system are investigated numerically and are found to be effective. Comparison of their transient performances show that the ...
Recursive form of general limited memory variable metric methods
Czech Academy of Sciences Publication Activity Database
Lukšan, Ladislav; Vlček, Jan
2013-01-01
Roč. 49, č. 2 (2013), s. 224-235 ISSN 0023-5954 Institutional support: RVO:67985807 Keywords : unconstrained optimization * large scale optimization * limited memory methods * variable metric updates * recursive matrix formulation * algorithms Subject RIV: BA - General Mathematics Impact factor: 0.563, year: 2013 http://dml.cz/handle/10338.dmlcz/143365
Recursive representation of the torus 1-point conformal block
Hadasz, Leszek; Jaskólski, Zbigniew; Suchanek, Paulina
2010-01-01
The recursive relation for the 1-point conformal block on a torus is derived and used to prove the identities between conformal blocks recently conjectured by Poghossian in [1]. As an illustration of the efficiency of the recurrence method the modular invariance of the 1-point Liouville correlation function is numerically analyzed.
The Free Energy in the Derrida-Retaux Recursive Model
Hu, Yueyun; Shi, Zhan
2018-05-01
We are interested in a simple max-type recursive model studied by Derrida and Retaux (J Stat Phys 156:268-290, 2014) in the context of a physics problem, and find a wide range for the exponent in the free energy in the nearly supercritical regime.
Recursive subspace identification for in flight modal analysis of airplanes
De Cock , Katrien; Mercère , Guillaume; De Moor , Bart
2006-01-01
International audience; In this paper recursive subspace identification algorithms are applied to track the modal parameters of airplanes on-line during test flights. The ability to track changes in the damping ratios and the influence of the forgetting factor are studied through simulations.
Differential constraints for bounded recursive identification with multivariate splines
De Visser, C.C.; Chu, Q.P.; Mulder, J.A.
2011-01-01
The ability to perform online model identification for nonlinear systems with unknown dynamics is essential to any adaptive model-based control system. In this paper, a new differential equality constrained recursive least squares estimator for multivariate simplex splines is presented that is able
Predicate Transformers for Recursive Procedures with Local Variables
Hesselink, Wim H.
1999-01-01
The weakest precondition semantics of recursive procedures with local variables are developed for an imperative language with demonic and angelic operators for unbounded nondeterminate choice. This does not require stacking of local variables. The formalism serves as a foundation for a proof rule
Denotational semantics of recursive types in synthetic guarded domain theory
DEFF Research Database (Denmark)
Møgelberg, Rasmus Ejlers; Paviotti, Marco
2016-01-01
typed lambda calculus with fixed points). This model was intensional in that it could distinguish between computations computing the same result using a different number of fixed point unfoldings. In this work we show how also programming languages with recursive types can be given denotational...
A bijection between phylogenetic trees and plane oriented recursive trees
Prodinger, Helmut
2017-01-01
Phylogenetic trees are binary nonplanar trees with labelled leaves, and plane oriented recursive trees are planar trees with an increasing labelling. Both families are enumerated by double factorials. A bijection is constructed, using the respective representations a 2-partitions and trapezoidal words.
Step-indexed Kripke models over recursive worlds
DEFF Research Database (Denmark)
Birkedal, Lars; Reus, Bernhard; Schwinghammer, Jan
2011-01-01
worlds that are recursively defined in a category of metric spaces. In this paper, we broaden the scope of this technique from the original domain-theoretic setting to an elementary, operational one based on step indexing. The resulting method is widely applicable and leads to simple, succinct models...
Efficient Integrity Checking for Databases with Recursive Views
DEFF Research Database (Denmark)
Martinenghi, Davide; Christiansen, Henning
2005-01-01
Efficient and incremental maintenance of integrity constraints involving recursive views is a difficult issue that has received some attention in the past years, but for which no widely accepted solution exists yet. In this paper a technique is proposed for compiling such integrity constraints in...... approaches have not achieved comparable optimization with the same level of generality....
Theory of Mind, linguistic recursion and autism spectrum disorder
DEFF Research Database (Denmark)
Polyanskaya, Irina; Blackburn, Patrick Rowan; Braüner, Torben
2017-01-01
In this paper we give the motivation for and discuss the design of an experiment investigating whether the acquisition of linguistic recur-sion helps children with Autism Spectrum Disorder (ASD) develop second-order false belief skills. We first present the relevant psycho-logical concepts (in...
A metric model of lambda calculus with guarded recursion
DEFF Research Database (Denmark)
Birkedal, Lars; Schwinghammer, Jan; Støvring, Kristian
2010-01-01
We give a model for Nakano’s typed lambda calculus with guarded recursive definitions in a category of metric spaces. By proving a computational adequacy result that relates the interpretation with the operational semantics, we show that the model can be used to reason about contextual equivalence....
Symbolic Reachability for Process Algebras with Recursive Data Types
Blom, Stefan; van de Pol, Jan Cornelis; Fitzgerald, J.S.; Haxthausen, A.E.; Yenigun, H.
2008-01-01
In this paper, we present a symbolic reachability algorithm for process algebras with recursive data types. Like the various saturation based algorithms of Ciardo et al, the algorithm is based on partitioning of the transition relation into events whose influence is local. As new features, our
Recursivity: A Working Paper on Rhetoric and "Mnesis"
Stormer, Nathan
2013-01-01
This essay proposes the genealogical study of remembering and forgetting as recursive rhetorical capacities that enable discourse to place itself in an ever-changing present. "Mnesis" is a meta-concept for the arrangements of remembering and forgetting that enable rhetoric to function. Most of the essay defines the materiality of "mnesis", first…
Consumption-Portfolio Optimization with Recursive Utility in Incomplete Markets
DEFF Research Database (Denmark)
Kraft, Holger; Seifried, Frank Thomas; Steffensen, Mogens
2013-01-01
In an incomplete market, we study the optimal consumption-portfolio decision of an investor with recursive preferences of Epstein–Zin type. Applying a classical dynamic programming approach, we formulate the associated Hamilton–Jacobi–Bellman equation and provide a suitable verification theorem...
Exploiting fine-grain parallelism in recursive LU factorization
Dongarra, Jack; Faverge, Mathieu; Ltaief, Hatem; Luszczek, Piotr R.
2012-01-01
is the panel factorization due to its memory-bound characteristic and the atomicity of selecting the appropriate pivots. We remedy this in our new approach to LU factorization of (narrow and tall) panel submatrices. We use a parallel fine-grained recursive
Anastassiou, George A
“Intelligent Routines II: Solving Linear Algebra and Differential Geometry with Sage” contains numerous of examples and problems as well as many unsolved problems. This book extensively applies the successful software Sage, which can be found free online http://www.sagemath.org/. Sage is a recent and popular software for mathematical computation, available freely and simple to use. This book is useful to all applied scientists in mathematics, statistics and engineering, as well for late undergraduate and graduate students of above subjects. It is the first such book in solving symbolically with Sage problems in Linear Algebra and Differential Geometry. Plenty of SAGE applications are given at each step of the exposition.
Artificial Intelligence and Moral intelligence
Laura Pana
2008-01-01
We discuss the thesis that the implementation of a moral code in the behaviour of artificial intelligent systems needs a specific form of human and artificial intelligence, not just an abstract intelligence. We present intelligence as a system with an internal structure and the structural levels of the moral system, as well as certain characteristics of artificial intelligent agents which can/must be treated as 1- individual entities (with a complex, specialized, autonomous or selfdetermined,...
Directory of Open Access Journals (Sweden)
Man Zhu
2017-03-01
Full Text Available Determination of ship maneuvering models is a tough task of ship maneuverability prediction. Among several prime approaches of estimating ship maneuvering models, system identification combined with the full-scale or free- running model test is preferred. In this contribution, real-time system identification programs using recursive identification method, such as the recursive least square method (RLS, are exerted for on-line identification of ship maneuvering models. However, this method seriously depends on the objects of study and initial values of identified parameters. To overcome this, an intelligent technology, i.e., support vector machines (SVM, is firstly used to estimate initial values of the identified parameters with finite samples. As real measured motion data of the Mariner class ship always involve noise from sensors and external disturbances, the zigzag simulation test data include a substantial quantity of Gaussian white noise. Wavelet method and empirical mode decomposition (EMD are used to filter the data corrupted by noise, respectively. The choice of the sample number for SVM to decide initial values of identified parameters is extensively discussed and analyzed. With de-noised motion data as input-output training samples, parameters of ship maneuvering models are estimated using RLS and SVM-RLS, respectively. The comparison between identification results and true values of parameters demonstrates that both the identified ship maneuvering models from RLS and SVM-RLS have reasonable agreements with simulated motions of the ship, and the increment of the sample for SVM positively affects the identification results. Furthermore, SVM-RLS using data de-noised by EMD shows the highest accuracy and best convergence.
Are Humans the Most Intelligent Species?
Directory of Open Access Journals (Sweden)
Robert P. Erickson
2014-09-01
Full Text Available Hunt and Jaeggi [1] nicely summarize the point that within the academic field of intelligence, we do not have a commonly understandable definition of what intelligence is. Still the term is used extensively and with consensus to the effect that humans are the most intelligent species. An example is given of this problem, and a definition and solution are suggested.
A new recursion operator for Adler's equation in the Viallet form
International Nuclear Information System (INIS)
Mikhailov, A.V.; Wang, J.P.
2011-01-01
For Adler's equation in the Viallet form and Yamilov's discretisation of the Krichever-Novikov equation we present new recursion and Hamiltonian operators. This new recursion operator and the recursion operator found in [A.V. Mikhailov, et al., Theor. Math. Phys. 167 (2011) 421, (arXiv:1004.5346)] satisfy the spectral curve associated with the equation. -- Highlights: → We present new recursion and Hamiltonian operators for the equation. → We establish the relation between this recursion operator and the known one. → The relation is given by the spectral curve associated with the equation.
Intelligent Systems For Aerospace Engineering: An Overview
KrishnaKumar, K.
2003-01-01
Intelligent systems are nature-inspired, mathematically sound, computationally intensive problem solving tools and methodologies that have become extremely important for advancing the current trends in information technology. Artificially intelligent systems currently utilize computers to emulate various faculties of human intelligence and biological metaphors. They use a combination of symbolic and sub-symbolic systems capable of evolving human cognitive skills and intelligence, not just systems capable of doing things humans do not do well. Intelligent systems are ideally suited for tasks such as search and optimization, pattern recognition and matching, planning, uncertainty management, control, and adaptation. In this paper, the intelligent system technologies and their application potential are highlighted via several examples.
Information Technology Quarterly, 1985
1985-01-01
This issue of "Information Technology Quarterly" is devoted to the theme of "Artificial Intelligence." It contains two major articles: (1) Artificial Intelligence and Law" (D. Peter O'Neill and George D. Wood); (2) "Artificial Intelligence: A Long and Winding Road" (John J. Simon, Jr.). In addition, it contains two sidebars: (1) "Calculating and…
Bergeron, Pierrette; Hiller, Christine A.
2002-01-01
Reviews the evolution of competitive intelligence since 1994, including terminology and definitions and analytical techniques. Addresses the issue of ethics; explores how information technology supports the competitive intelligence process; and discusses education and training opportunities for competitive intelligence, including core competencies…
Data transfer based on intelligent ethernet card
International Nuclear Information System (INIS)
Zhu Haitao; Chinese Academy of Sciences, Beijing; Chu Yuanping; Zhao Jingwei
2007-01-01
Intelligent Ethernet Cards are widely used in systems where the network throughout is very large, such as the DAQ systems for modern high energy physics experiments, web service. With the example of a commercial intelligent Ethernet card, this paper introduces the architecture, the principle and the process of intelligent Ethernet cards. In addition, the results of several experiments showing the differences between intelligent Ethernet cards and general ones are also presented. (authors)
EEG and MEG source localization using recursively applied (RAP) MUSIC
Energy Technology Data Exchange (ETDEWEB)
Mosher, J.C. [Los Alamos National Lab., NM (United States); Leahy, R.M. [University of Southern California, Los Angeles, CA (United States). Signal and Image Processing Inst.
1996-12-31
The multiple signal characterization (MUSIC) algorithm locates multiple asynchronous dipolar sources from electroencephalography (EEG) and magnetoencephalography (MEG) data. A signal subspace is estimated from the data, then the algorithm scans a single dipole model through a three-dimensional head volume and computes projections onto this subspace. To locate the sources, the user must search the head volume for local peaks in the projection metric. Here we describe a novel extension of this approach which we refer to as RAP (Recursively APplied) MUSIC. This new procedure automatically extracts the locations of the sources through a recursive use of subspace projections, which uses the metric of principal correlations as a multidimensional form of correlation analysis between the model subspace and the data subspace. The dipolar orientations, a form of `diverse polarization,` are easily extracted using the associated principal vectors.
Recursive utility in a Markov environment with stochastic growth.
Hansen, Lars Peter; Scheinkman, José A
2012-07-24
Recursive utility models that feature investor concerns about the intertemporal composition of risk are used extensively in applied research in macroeconomics and asset pricing. These models represent preferences as the solution to a nonlinear forward-looking difference equation with a terminal condition. In this paper we study infinite-horizon specifications of this difference equation in the context of a Markov environment. We establish a connection between the solution to this equation and to an arguably simpler Perron-Frobenius eigenvalue equation of the type that occurs in the study of large deviations for Markov processes. By exploiting this connection, we establish existence and uniqueness results. Moreover, we explore a substantive link between large deviation bounds for tail events for stochastic consumption growth and preferences induced by recursive utility.
BPSK Receiver Based on Recursive Adaptive Filter with Remodulation
Directory of Open Access Journals (Sweden)
N. Milosevic
2011-12-01
Full Text Available This paper proposes a new binary phase shift keying (BPSK signal receiver intended for reception under conditions of significant carrier frequency offsets. The recursive adaptive filter with least mean squares (LMS adaptation is used. The proposed receiver has a constant, defining the balance between the recursive and the nonrecursive part of the filter, whose proper choice allows a simple construction of the receiver. The correct choice of this parameter could result in unitary length of the filter. The proposed receiver has performance very close to the performance of the BPSK receiver with perfect frequency synchronization, in a wide range of frequency offsets (plus/minus quarter of the signal bandwidth. The results obtained by the software simulation are confirmed by the experimental results measured on the receiver realized with the universal software radio peripheral (USRP, with the baseband signal processing at personal computer (PC.
Recursive Neural Networks in Quark/Gluon Tagging
CERN. Geneva
2018-01-01
Vidyo contribution Based on the natural tree-like structure of jet sequential clustering, the recursive neural networks (RecNNs) embed jet clustering history recursively as in natural language processing. We explore the performance of RecNN in quark/gluon discrimination. The results show that RecNNs work better than the baseline BDT by a few percent in gluon rejection at the working point of 50\\% quark acceptance. We also experimented on some relevant aspects which might influence the performance of networks. It shows that even only particle flow identification as input feature without any extra information on momentum or angular position is already giving a fairly good result, which indicates that most of the information for q/g discrimination is already included in the tree-structure itself.
Topological recursion for Gaussian means and cohomological field theories
Andersen, J. E.; Chekhov, L. O.; Norbury, P.; Penner, R. C.
2015-12-01
We introduce explicit relations between genus-filtrated s-loop means of the Gaussian matrix model and terms of the genus expansion of the Kontsevich-Penner matrix model (KPMM), which is the generating function for volumes of discretized (open) moduli spaces M g,s disc (discrete volumes). Using these relations, we express Gaussian means in all orders of the genus expansion as polynomials in special times weighted by ancestor invariants of an underlying cohomological field theory. We translate the topological recursion of the Gaussian model into recurrence relations for the coefficients of this expansion, which allows proving that they are integers and positive. We find the coefficients in the first subleading order for M g,1 for all g in three ways: using the refined Harer-Zagier recursion, using the Givental-type decomposition of the KPMM, and counting diagrams explicitly.
Study of recursive model for pole-zero cancellation circuit
International Nuclear Information System (INIS)
Zhou Jianbin; Zhou Wei; Hong Xu; Hu Yunchuan; Wan Xinfeng; Du Xin; Wang Renbo
2014-01-01
The output of charge sensitive amplifier (CSA) is a negative exponential signal with long decay time which will result in undershoot after C-R differentiator. Pole-zero cancellation (PZC) circuit is often applied to eliminate undershoot in many radiation detectors. However, it is difficult to use a zero created by PZC circuit to cancel a pole in CSA output signal accurately because of the influences of electronic components inherent error and environmental factors. A novel recursive model for PZC circuit is presented based on Kirchhoff's Current Law (KCL) in this paper. The model is established by numerical differentiation algorithm between the input and the output signal. Some simulation experiments for a negative exponential signal are carried out using Visual Basic for Application (VBA) program and a real x-ray signal is also tested. Simulated results show that the recursive model can reduce the time constant of input signal and eliminate undershoot. (authors)
ETHICS AND KNOWLEDGE OF RECURSIVITY IN PSYCHOLOGISTS TRAINING
Directory of Open Access Journals (Sweden)
Ramón Sanz Ferramola
2008-07-01
Full Text Available This work deals with the characterization of psychology as a science and profession. Thisfeature is part of the Argentine academic tradition which goes from the origins of psychology as an undergraduate program by the end of the 1950s to the present day. In relation to this topic, four issues are analysed: a the knowledges of psychology showing the necessity of two epistemic dimensions closely related, namely the discursivity and recursivity, or knowledge and metaknowledge, b the role of psychology as a profession within the praxis, rather than in the poiesis, according to the Greek distinction between the implications of these two modalities of the “doing”, c the concurrence and difference of ethics and deontology, their roles, bounds and potentialities within the psychological field in general, and that of scientific-professional morality in particular, and d the definition and characterization of ethics and epistemology as knowledge of recursivity in psychologists’ training.
Recursive Bayesian recurrent neural networks for time-series modeling.
Mirikitani, Derrick T; Nikolaev, Nikolay
2010-02-01
This paper develops a probabilistic approach to recursive second-order training of recurrent neural networks (RNNs) for improved time-series modeling. A general recursive Bayesian Levenberg-Marquardt algorithm is derived to sequentially update the weights and the covariance (Hessian) matrix. The main strengths of the approach are a principled handling of the regularization hyperparameters that leads to better generalization, and stable numerical performance. The framework involves the adaptation of a noise hyperparameter and local weight prior hyperparameters, which represent the noise in the data and the uncertainties in the model parameters. Experimental investigations using artificial and real-world data sets show that RNNs equipped with the proposed approach outperform standard real-time recurrent learning and extended Kalman training algorithms for recurrent networks, as well as other contemporary nonlinear neural models, on time-series modeling.
Functional Dual Adaptive Control with Recursive Gaussian Process Model
International Nuclear Information System (INIS)
Prüher, Jakub; Král, Ladislav
2015-01-01
The paper deals with dual adaptive control problem, where the functional uncertainties in the system description are modelled by a non-parametric Gaussian process regression model. Current approaches to adaptive control based on Gaussian process models are severely limited in their practical applicability, because the model is re-adjusted using all the currently available data, which keeps growing with every time step. We propose the use of recursive Gaussian process regression algorithm for significant reduction in computational requirements, thus bringing the Gaussian process-based adaptive controllers closer to their practical applicability. In this work, we design a bi-criterial dual controller based on recursive Gaussian process model for discrete-time stochastic dynamic systems given in an affine-in-control form. Using Monte Carlo simulations, we show that the proposed controller achieves comparable performance with the full Gaussian process-based controller in terms of control quality while keeping the computational demands bounded. (paper)
Model-based dispersive wave processing: A recursive Bayesian solution
International Nuclear Information System (INIS)
Candy, J.V.; Chambers, D.H.
1999-01-01
Wave propagation through dispersive media represents a significant problem in many acoustic applications, especially in ocean acoustics, seismology, and nondestructive evaluation. In this paper we propose a propagation model that can easily represent many classes of dispersive waves and proceed to develop the model-based solution to the wave processing problem. It is shown that the underlying wave system is nonlinear and time-variable requiring a recursive processor. Thus the general solution to the model-based dispersive wave enhancement problem is developed using a Bayesian maximum a posteriori (MAP) approach and shown to lead to the recursive, nonlinear extended Kalman filter (EKF) processor. The problem of internal wave estimation is cast within this framework. The specific processor is developed and applied to data synthesized by a sophisticated simulator demonstrating the feasibility of this approach. copyright 1999 Acoustical Society of America.
Classification and Recursion Operators of Dark Burgers' Equation
Chen, Mei-Dan; Li, Biao
2018-01-01
With the help of symbolic computation, two types of complete scalar classification for dark Burgers' equations are derived by requiring the existence of higher order differential polynomial symmetries. There are some free parameters for every class of dark Burgers' systems; so some special equations including symmetry equation and dual symmetry equation are obtained by selecting the free parameter. Furthermore, two kinds of recursion operators for these dark Burgers' equations are constructed by two direct assumption methods.
A RECURSIVE ALGORITHM SUITABLE FOR REAL-TIME MEASUREMENT
Directory of Open Access Journals (Sweden)
Giovanni Bucci
1995-12-01
Full Text Available This paper deals with a recursive algorithm suitable for realtime measurement applications, based on an indirect technique, useful in those applications where the required quantities cannot be measured in a straightforward way. To cope with time constraints a parallel formulation of it, suitable to be implemented on multiprocessor systems, is presented. The adopted concurrent implementation is based on factorization techniques. Some experimental results related to the application of the system for carrying out measurements on synchronous motors are included.
Model-based Recursive Partitioning for Subgroup Analyses
Seibold, Heidi; Zeileis, Achim; Hothorn, Torsten
2016-01-01
The identification of patient subgroups with differential treatment effects is the first step towards individualised treatments. A current draft guideline by the EMA discusses potentials and problems in subgroup analyses and formulated challenges to the development of appropriate statistical procedures for the data-driven identification of patient subgroups. We introduce model-based recursive partitioning as a procedure for the automated detection of patient subgroups that are identifiable by...
A Decidable Recursive Logic for Weighted Transition Systems
DEFF Research Database (Denmark)
Xue, Bingtian; Larsen, Kim Guldstrand; Mardare, Radu Iulian
2014-01-01
In this paper we develop and study the Recursive Weighted Logic (RWL), a multi-modal logic that expresses qualitative and quantitative properties of labelled weighted transition systems (LWSs). LWSs are transition systems labelled with actions and real-valued quantities representing the costs of ...... extends previous results that we have demonstrated for a similar but much more restrictive logic that can only use one variable for each type of resource to encode logical properties....
Schilder, J.; Ellenbroek, M.; de Boer, A.
2017-12-01
In this work, the floating frame of reference formulation is used to create a flexible multibody model of slender offshore structures such as pipelines and risers. It is shown that due to the chain-like topology of the considered structures, the equation of motion can be expressed in terms of absolute interface coordinates. In the presented form, kinematic constraint equations are satisfied explicitly and the Lagrange multipliers are eliminated from the equations. Hence, the structures can be conveniently coupled to finite element or multibody models of for example seabed and vessel. The chain-like topology enables the efficient use of recursive solution procedures for both transient dynamic analysis and equilibrium analysis. For this, the transfer matrix method is used. In order to improve the convergence of the equilibrium analysis, the analytical solution of an ideal catenary is used as an initial configuration, reducing the number of required iterations.
Design of 2-D Recursive Filters Using Self-adaptive Mutation Differential Evolution Algorithm
Directory of Open Access Journals (Sweden)
Lianghong Wu
2011-08-01
Full Text Available This paper investigates a novel approach to the design of two-dimensional recursive digital filters using differential evolution (DE algorithm. The design task is reformulated as a constrained minimization problem and is solved by an Self-adaptive Mutation DE algorithm (SAMDE, which adopts an adaptive mutation operator that combines with the advantages of the DE/rand/1/bin strategy and the DE/best/2/bin strategy. As a result, its convergence performance is improved greatly. Numerical experiment results confirm the conclusion. The proposedSAMDE approach is effectively applied to test a numerical example and is compared with previous design methods. The computational experiments show that the SAMDE approach can obtain better results than previous design methods.
System Simulation by Recursive Feedback: Coupling a Set of Stand-Alone Subsystem Simulations
Nixon, D. D.
2001-01-01
Conventional construction of digital dynamic system simulations often involves collecting differential equations that model each subsystem, arran g them to a standard form, and obtaining their numerical gin solution as a single coupled, total-system simultaneous set. Simulation by numerical coupling of independent stand-alone subsimulations is a fundamentally different approach that is attractive because, among other things, the architecture naturally facilitates high fidelity, broad scope, and discipline independence. Recursive feedback is defined and discussed as a candidate approach to multidiscipline dynamic system simulation by numerical coupling of self-contained, single-discipline subsystem simulations. A satellite motion example containing three subsystems (orbit dynamics, attitude dynamics, and aerodynamics) has been defined and constructed using this approach. Conventional solution methods are used in the subsystem simulations. Distributed and centralized implementations of coupling have been considered. Numerical results are evaluated by direct comparison with a standard total-system, simultaneous-solution approach.
Fermionic Approach to Weighted Hurwitz Numbers and Topological Recursion
Alexandrov, A.; Chapuy, G.; Eynard, B.; Harnad, J.
2018-06-01
A fermionic representation is given for all the quantities entering in the generating function approach to weighted Hurwitz numbers and topological recursion. This includes: KP and 2 D Toda {τ} -functions of hypergeometric type, which serve as generating functions for weighted single and double Hurwitz numbers; the Baker function, which is expanded in an adapted basis obtained by applying the same dressing transformation to all vacuum basis elements; the multipair correlators and the multicurrent correlators. Multiplicative recursion relations and a linear differential system are deduced for the adapted bases and their duals, and a Christoffel-Darboux type formula is derived for the pair correlator. The quantum and classical spectral curves linking this theory with the topological recursion program are derived, as well as the generalized cut-and-join equations. The results are detailed for four special cases: the simple single and double Hurwitz numbers, the weakly monotone case, corresponding to signed enumeration of coverings, the strongly monotone case, corresponding to Belyi curves and the simplest version of quantum weighted Hurwitz numbers.
Recursive regularization step for high-order lattice Boltzmann methods
Coreixas, Christophe; Wissocq, Gauthier; Puigt, Guillaume; Boussuge, Jean-François; Sagaut, Pierre
2017-09-01
A lattice Boltzmann method (LBM) with enhanced stability and accuracy is presented for various Hermite tensor-based lattice structures. The collision operator relies on a regularization step, which is here improved through a recursive computation of nonequilibrium Hermite polynomial coefficients. In addition to the reduced computational cost of this procedure with respect to the standard one, the recursive step allows to considerably enhance the stability and accuracy of the numerical scheme by properly filtering out second- (and higher-) order nonhydrodynamic contributions in under-resolved conditions. This is first shown in the isothermal case where the simulation of the doubly periodic shear layer is performed with a Reynolds number ranging from 104 to 106, and where a thorough analysis of the case at Re=3 ×104 is conducted. In the latter, results obtained using both regularization steps are compared against the Bhatnagar-Gross-Krook LBM for standard (D2Q9) and high-order (D2V17 and D2V37) lattice structures, confirming the tremendous increase of stability range of the proposed approach. Further comparisons on thermal and fully compressible flows, using the general extension of this procedure, are then conducted through the numerical simulation of Sod shock tubes with the D2V37 lattice. They confirm the stability increase induced by the recursive approach as compared with the standard one.
Fermionic Approach to Weighted Hurwitz Numbers and Topological Recursion
Alexandrov, A.; Chapuy, G.; Eynard, B.; Harnad, J.
2017-12-01
A fermionic representation is given for all the quantities entering in the generating function approach to weighted Hurwitz numbers and topological recursion. This includes: KP and 2D Toda {τ} -functions of hypergeometric type, which serve as generating functions for weighted single and double Hurwitz numbers; the Baker function, which is expanded in an adapted basis obtained by applying the same dressing transformation to all vacuum basis elements; the multipair correlators and the multicurrent correlators. Multiplicative recursion relations and a linear differential system are deduced for the adapted bases and their duals, and a Christoffel-Darboux type formula is derived for the pair correlator. The quantum and classical spectral curves linking this theory with the topological recursion program are derived, as well as the generalized cut-and-join equations. The results are detailed for four special cases: the simple single and double Hurwitz numbers, the weakly monotone case, corresponding to signed enumeration of coverings, the strongly monotone case, corresponding to Belyi curves and the simplest version of quantum weighted Hurwitz numbers.
Isotope decay equations solved by means of a recursive method
International Nuclear Information System (INIS)
Grant, Carlos
2009-01-01
The isotope decay equations have been solved using forward finite differences taking small time steps, among other methods. This is the case of the cell code WIMS, where it is assumed that concentrations of all fissionable isotopes remain constant during the integration interval among other simplifications. Even when the problem could be solved running through a logical tree, all algorithms used for resolution of these equations used an iterative programming formulation. That happened because nearly all computer languages used up to a recent past by the scientific programmers did not support recursion, such as the case of the old versions of FORTRAN or BASIC. Nowadays also an integral form of the depletion equations is used in Monte Carlo simulation. In this paper we propose another programming solution using a recursive algorithm, running through all descendants of each isotope and adding their contributions to all isotopes in each generation. The only assumption made for this solution is that fluxes remain constant during the whole time step. Recursive process is interrupted when a stable isotope was attained or the calculated contributions are smaller than a given precision. These algorithms can be solved by means an exact analytic method that can have some problems when circular loops appear for isotopes with alpha decay, and a more general polynomial method. Both methods are shown. (author)
DEFF Research Database (Denmark)
Rønn, Kira Vrist
2016-01-01
Questions concerning what constitutes a morally justified conduct of intelligence activities have received increased attention in recent decades. However, intelligence ethics is not yet homogeneous or embedded as a solid research field. The aim of this article is to sketch the state of the art...... of intelligence ethics and point out subjects for further scrutiny in future research. The review clusters the literature on intelligence ethics into two groups: respectively, contributions on external topics (i.e., the accountability of and the public trust in intelligence agencies) and internal topics (i.......e., the search for an ideal ethical framework for intelligence actions). The article concludes that there are many holes to fill for future studies on intelligence ethics both in external and internal discussions. Thus, the article is an invitation – especially, to moral philosophers and political theorists...
International Nuclear Information System (INIS)
Donnat, Ph.; Treimany, C.; Gouedard, C.; Morice, O.
1998-06-01
This document presents some examples which were used for debugging the code. It seemed useful to write these examples onto a book to be sure the code would not regret; to give warranties for the code's functionality; to propose some examples to illustrate the possibilities and the limits of Miro. (author)
Intelligence Naturelle et Intelligence Artificielle
Dubois, Daniel
2011-01-01
Cet article présente une approche systémique du concept d’intelligence naturelle en ayant pour objectif de créer une intelligence artificielle. Ainsi, l’intelligence naturelle, humaine et animale non-humaine, est une fonction composée de facultés permettant de connaître et de comprendre. De plus, l'intelligence naturelle reste indissociable de la structure, à savoir les organes du cerveau et du corps. La tentation est grande de doter les systèmes informatiques d’une intelligence artificielle ...
International Nuclear Information System (INIS)
Hernandez-Walls, R; Martín-Atienza, B; Salinas-Matus, M; Castillo, J
2017-01-01
When solving the linear inviscid shallow water equations with variable depth in one dimension using finite differences, a tridiagonal system of equations must be solved. Here we present an approach, which is more efficient than the commonly used numerical method, to solve this tridiagonal system of equations using a recursion formula. We illustrate this approach with an example in which we solve for a rectangular channel to find the resonance modes. Our numerical solution agrees very well with the analytical solution. This new method is easy to use and understand by undergraduate students, so it can be implemented in undergraduate courses such as Numerical Methods, Lineal Algebra or Differential Equations. (paper)
Hernandez-Walls, R.; Martín-Atienza, B.; Salinas-Matus, M.; Castillo, J.
2017-11-01
When solving the linear inviscid shallow water equations with variable depth in one dimension using finite differences, a tridiagonal system of equations must be solved. Here we present an approach, which is more efficient than the commonly used numerical method, to solve this tridiagonal system of equations using a recursion formula. We illustrate this approach with an example in which we solve for a rectangular channel to find the resonance modes. Our numerical solution agrees very well with the analytical solution. This new method is easy to use and understand by undergraduate students, so it can be implemented in undergraduate courses such as Numerical Methods, Lineal Algebra or Differential Equations.
Anti-Authoritarian Metrics: Recursivity as a strategy for post-capitalism
Directory of Open Access Journals (Sweden)
David Adam Banks
2016-12-01
Full Text Available This essay proposes that those seeking to build counter-power institutions and communities learn to think in terms of what I call “recursivity.” Recursivity is an anti-authoritarian metric that helps bring about a sensitivity to feedback loops at multiple levels of organization. I begin by describing how technological systems and the socio-economic order co-constitute one-another around efficiency metrics. I then go on to define recursivity as social conditions that contain within them all of the parts and practices for their maturation and expansion, and show how organizations that demonstrate recursivity, like the historical English commons, have been marginalized or destroyed all together. Finally, I show how the ownership of property is inherently antithetical to the closed loops of recursivity. All of this is bookended by a study of urban planning’s recursive beginnings.
International Nuclear Information System (INIS)
Hansen, Tobias
2015-07-01
This thesis covers two main topics: the tensorial structure of quantum field theory correlators in general spacetime dimensions and a method for computing string theory scattering amplitudes directly in target space. In the first part tensor structures in generic bosonic CFT correlators and scattering amplitudes are studied. To this end arbitrary irreducible tensor representations of SO(d) (traceless mixed-symmetry tensors) are encoded in group invariant polynomials, by contracting with sets of commuting and anticommuting polarization vectors which implement the index symmetries of the tensors. The tensor structures appearing in CFT d correlators can then be inferred by studying these polynomials in a d + 2 dimensional embedding space. It is shown with an example how these correlators can be used to compute general conformal blocks describing the exchange of mixed-symmetry tensors in four-point functions, which are crucial for advancing the conformal bootstrap program to correlators of operators with spin. Bosonic string theory lends itself as an ideal example for applying the same methods to scattering amplitudes, due to its particle spectrum of arbitrary mixed-symmetry tensors. This allows in principle the definition of on-shell recursion relations for string theory amplitudes. A further chapter introduces a different target space definition of string scattering amplitudes. As in the case of on-shell recursion relations, the amplitudes are expressed in terms of their residues via BCFW shifts. The new idea here is that the residues are determined by use of the monodromy relations for open string theory, avoiding the infinite sums over the spectrum arising in on-shell recursion relations. Several checks of the method are presented, including a derivation of the Koba-Nielsen amplitude in the bosonic string. It is argued that this method provides a target space definition of the complete S-matrix of string theory at tree-level in a at background in terms of a small
An Artificial Neural Network Controller for Intelligent Transportation Systems Applications
1996-01-01
An Autonomous Intelligent Cruise Control (AICC) has been designed using a feedforward artificial neural network, as an example for utilizing artificial neural networks for nonlinear control problems arising in intelligent transportation systems appli...
Artificial Intelligence in Cardiology.
Johnson, Kipp W; Torres Soto, Jessica; Glicksberg, Benjamin S; Shameer, Khader; Miotto, Riccardo; Ali, Mohsin; Ashley, Euan; Dudley, Joel T
2018-06-12
Artificial intelligence and machine learning are poised to influence nearly every aspect of the human condition, and cardiology is not an exception to this trend. This paper provides a guide for clinicians on relevant aspects of artificial intelligence and machine learning, reviews selected applications of these methods in cardiology to date, and identifies how cardiovascular medicine could incorporate artificial intelligence in the future. In particular, the paper first reviews predictive modeling concepts relevant to cardiology such as feature selection and frequent pitfalls such as improper dichotomization. Second, it discusses common algorithms used in supervised learning and reviews selected applications in cardiology and related disciplines. Third, it describes the advent of deep learning and related methods collectively called unsupervised learning, provides contextual examples both in general medicine and in cardiovascular medicine, and then explains how these methods could be applied to enable precision cardiology and improve patient outcomes. Copyright © 2018 The Authors. Published by Elsevier Inc. All rights reserved.
Benefits of collective intelligence: Swarm intelligent foraging, an ethnographic research
Directory of Open Access Journals (Sweden)
Sivave Mashingaidze
2014-12-01
Full Text Available Wisdom of crowds; bees, colonies of ants, schools of fish, flocks of birds, and fireflies flashing synchronously are all examples of highly coordinated behaviors that emerge from collective, decentralized intelligence. This article is an ethnographic study of swarm intelligence foraging of swarms and the benefits derived from collective decision making. The author used using secondary data analysis to look at the benefits of swarm intelligence in decision making to achieve intended goals. Concepts like combined decision making and consensus were discussed and four principles of swarm intelligence were also discussed viz; coordination, cooperation, deliberation and collaboration. The research found out that collective decision making in swarms is the touchstone of achieving their goals. The research further recommended corporate to adopt collective intelligence for business sustainability.
A model of guarded recursion with clock synchronisation
DEFF Research Database (Denmark)
Bizjak, Aleš; Møgelberg, Rasmus Ejlers
2015-01-01
productivity to be captured in types. The calculus uses clocks representing time streams and clock quantifiers which allow limited and controlled elimination of modalities. The calculus has since been extended to dependent types by Møgelberg. Both works give denotational semantics but no rewrite semantics....... In previous versions of this calculus, different clocks represented separate time streams and clock synchronisation was prohibited. In this paper we show that allowing clock synchronisation is safe by constructing a new model of guarded recursion and clocks. This result will greatly simplify the type theory...... by removing freshness restrictions from typing rules, and is a necessary step towards defining rewrite semantics, and ultimately implementing the calculus....
Chain of matrices, loop equations and topological recursion
Orantin, Nicolas
2009-01-01
Random matrices are used in fields as different as the study of multi-orthogonal polynomials or the enumeration of discrete surfaces. Both of them are based on the study of a matrix integral. However, this term can be confusing since the definition of a matrix integral in these two applications is not the same. These two definitions, perturbative and non-perturbative, are discussed in this chapter as well as their relation. The so-called loop equations satisfied by integrals over random matrices coupled in chain is discussed as well as their recursive solution in the perturbative case when the matrices are Hermitean.
Recursive inter-generational utility in global climate risk modeling
Energy Technology Data Exchange (ETDEWEB)
Minh, Ha-Duong [Centre International de Recherche sur l' Environnement et le Developpement (CIRED-CNRS), 75 - Paris (France); Treich, N. [Institut National de Recherches Agronomiques (INRA-LEERNA), 31 - Toulouse (France)
2003-07-01
This paper distinguishes relative risk aversion and resistance to inter-temporal substitution in climate risk modeling. Stochastic recursive preferences are introduced in a stylized numeric climate-economy model using preliminary IPCC 1998 scenarios. It shows that higher risk aversion increases the optimal carbon tax. Higher resistance to inter-temporal substitution alone has the same effect as increasing the discount rate, provided that the risk is not too large. We discuss implications of these findings for the debate upon discounting and sustainability under uncertainty. (author)
Recursive Neural Networks Based on PSO for Image Parsing
Directory of Open Access Journals (Sweden)
Guo-Rong Cai
2013-01-01
Full Text Available This paper presents an image parsing algorithm which is based on Particle Swarm Optimization (PSO and Recursive Neural Networks (RNNs. State-of-the-art method such as traditional RNN-based parsing strategy uses L-BFGS over the complete data for learning the parameters. However, this could cause problems due to the nondifferentiable objective function. In order to solve this problem, the PSO algorithm has been employed to tune the weights of RNN for minimizing the objective. Experimental results obtained on the Stanford background dataset show that our PSO-based training algorithm outperforms traditional RNN, Pixel CRF, region-based energy, simultaneous MRF, and superpixel MRF.
Optimally eating a stochastic cake. A recursive utility approach
International Nuclear Information System (INIS)
Epaulard, Anne; Pommeret, Aude
2003-01-01
In this short paper, uncertainties on resource stock and on technical progress are introduced into an intertemporal equilibrium model of optimal extraction of a non-renewable resource. The representative consumer maximizes a recursive utility function which disentangles between intertemporal elasticity of substitution and risk aversion. A closed-form solution is derived for both the optimal extraction and price paths. The value of the intertemporal elasticity of substitution relative to unity is then crucial in understanding extraction. Moreover, this model leads to a non-renewable resource price following a geometric Brownian motion
Structural properties of recursively partitionable graphs with connectivity 2
DEFF Research Database (Denmark)
Baudon, Olivier; Bensmail, Julien; Foucaud, Florent
2017-01-01
, namely the ones of being online arbitrarily partitionable and recursively arbitrarily partitionable (OL-AP and R-AP for short, respectively), in which the subgraphs induced by a partition of G must not only be con-nected but also ful_l additional conditions. In this paper, we point out some structural...... properties of OL-AP and R-AP graphs with connectivity 2. In particular, we show that deleting a cut pair of these graphs results in a graph with a bounded number of components, some of whom have a small number of vertices. We obtain these results by studying a simple class of 2-connected graphs called...
Wash, Darrel Patrick
1989-01-01
Making a machine seem intelligent is not easy. As a consequence, demand has been rising for computer professionals skilled in artificial intelligence and is likely to continue to go up. These workers develop expert systems and solve the mysteries of machine vision, natural language processing, and neural networks. (Editor)
DEFF Research Database (Denmark)
Hjorth, Poul G.
2005-01-01
Forestillingen om at naturen er designet af en guddommelig 'intelligens' er et smukt filosofisk princip. Teorier om Intelligent Design som en naturvidenskabeligt baseret teori er derimod helt forfærdelig.......Forestillingen om at naturen er designet af en guddommelig 'intelligens' er et smukt filosofisk princip. Teorier om Intelligent Design som en naturvidenskabeligt baseret teori er derimod helt forfærdelig....
National Aeronautics and Space Administration — This is a textbook, created example for illustration purposes. The System takes inputs of Pt, Ps, and Alt, and calculates the Mach number using the Rayleigh Pitot...
Recursive estimation of the parts production process quality indicator
Directory of Open Access Journals (Sweden)
Filipovich Oleg
2017-01-01
Full Text Available Consideration is given to a mathematical representation for manufacturing of batch parts on a metal-cutting machine tool. Linear dimensions of machined parts are assumed to be the major quality indicator, deviation from these dimensions is determined by size setting of machine tool and ensemble of random factors. It is allowed to have absolutely precise pre-setting of machine tool, effects from setup level offsetting due to deformation in process equipment on the specified indicator are disregarded. Consideration is given to factors which affect the tool wear, with two definitions of tool wear being provided. Reasons for development of random error in processing, dependence of measurement results on error as well as distribution laws and some parameters of random values are provided. To evaluate deviation of size setting value in each cycle, it is proposed to apply a recursive algorithm in description of investigated dynamic discrete process in the space state. Kalman filter equations are used in description of process model by means of first-order difference equations. The algorithm of recursive estimation is implemented in the mathematical software Maple. Simulation results which prove effectiveness of algorithm application to investigate the given dynamic system are provided. Variants of algorithm application and opportunities of further research are proposed.
Exploiting fine-grain parallelism in recursive LU factorization
Dongarra, Jack
2012-01-01
The LU factorization is an important numerical algorithm for solving system of linear equations. This paper proposes a novel approach for computing the LU factorization in parallel on multicore architectures. It improves the overall performance and also achieves the numerical quality of the standard LU factorization with partial pivoting. While the update of the trailing submatrix is computationally intensive and highly parallel, the inherently problematic portion of the LU factorization is the panel factorization due to its memory-bound characteristic and the atomicity of selecting the appropriate pivots. We remedy this in our new approach to LU factorization of (narrow and tall) panel submatrices. We use a parallel fine-grained recursive formulation of the factorization. It is based on conflict-free partitioning of the data and lock-less synchronization mechanisms. Our implementation lets the overall computation naturally flow with limited contention. Our recursive panel factorization provides the necessary performance increase for the inherently problematic portion of the LU factorization of square matrices. A large panel width results in larger Amdahl\\'s fraction as our experiments have revealed which is consistent with related efforts. The performance results of our implementation reveal superlinear speedup and far exceed what can be achieved with equivalent MKL and/or LAPACK routines. © 2012 The authors and IOS Press. All rights reserved.
DEFF Research Database (Denmark)
Andersen, Bjarne Stig; Gunnels, John A.; Gustavson, Fred
2002-01-01
A new Recursive Packed Inverse Calculation Algorithm for symmetric positive definite matrices has been developed. The new Recursive Inverse Calculation algorithm uses minimal storage, \\$n(n+1)/2\\$, and has nearly the same performance as the LAPACK full storage algorithm using \\$n\\^2\\$ memory words...
The Paradigm Recursion: Is It More Accessible When Introduced in Middle School?
Gunion, Katherine; Milford, Todd; Stege, Ulrike
2009-01-01
Recursion is a programming paradigm as well as a problem solving strategy thought to be very challenging to grasp for university students. This article outlines a pilot study, which expands the age range of students exposed to the concept of recursion in computer science through instruction in a series of interesting and engaging activities. In…
Time-area efficient multiplier-free recursive filter architectures for FPGA implementation
DEFF Research Database (Denmark)
Shajaan, Mohammad; Sørensen, John Aasted
1996-01-01
Simultaneous design of multiplier-free recursive filters (IIR filters) and their hardware implementation in Xilinx field programmable gate array (XC4000) is presented. The hardware design methodology leads to high performance recursive filters with sampling frequencies in the interval 15-21 MHz (...
A Proof-Theoretic Account of Primitive Recursion and Primitive Iteration
DEFF Research Database (Denmark)
Cherabini, Luca; Danvy, Olivier
2011-01-01
We revisit both the usual ``going-up'' induction principle and Manna and Waldinger's ``going-down'' induction principle for primitive recursion,`a la Goedel, and primitive iteration, `a la Church. We use 'Kleene's trick' to show that primitive recursion and primitive iiteration are as expressive...
Recursion rules for scattering amplitudes in non-Abelian gauge theories
International Nuclear Information System (INIS)
Kim, C.; Nair, V.P.
1997-01-01
We present a functional derivation of recursion rules for scattering amplitudes in a non-Abelian gauge theory in a form valid to arbitrary loop order. The tree-level and one-loop recursion rules are explicitly displayed. copyright 1997 The American Physical Society
Tsai, Tien-Lung; Shau, Wen-Yi; Hu, Fu-Chang
2006-01-01
This article generalizes linear path analysis (PA) and simultaneous equations models (SiEM) to deal with mixed responses of different types in a recursive or triangular system. An efficient instrumental variable (IV) method for estimating the structural coefficients of a 2-equation partially recursive generalized path analysis (GPA) model and…
DEFF Research Database (Denmark)
Larsen, Lasse Juel
2009-01-01
This paper examines play, gaming and learning in regard to intelligent playware developed for outdoor use. The key questions are how does these novel artefacts influence the concept of play, gaming and learning. Up until now play and game have been understood as different activities. This paper...... examines if the sharp differentiation between the two can be uphold in regard to intelligent playware for outdoor use. Play and game activities will be analysed and viewed in conjunction with learning contexts. This paper will stipulate that intelligent playware facilitates rapid shifts in contexts...
Ennals, J R
1987-01-01
Artificial Intelligence: State of the Art Report is a two-part report consisting of the invited papers and the analysis. The editor first gives an introduction to the invited papers before presenting each paper and the analysis, and then concludes with the list of references related to the study. The invited papers explore the various aspects of artificial intelligence. The analysis part assesses the major advances in artificial intelligence and provides a balanced analysis of the state of the art in this field. The Bibliography compiles the most important published material on the subject of
Warwick, Kevin
2011-01-01
if AI is outside your field, or you know something of the subject and would like to know more then Artificial Intelligence: The Basics is a brilliant primer.' - Nick Smith, Engineering and Technology Magazine November 2011 Artificial Intelligence: The Basics is a concise and cutting-edge introduction to the fast moving world of AI. The author Kevin Warwick, a pioneer in the field, examines issues of what it means to be man or machine and looks at advances in robotics which have blurred the boundaries. Topics covered include: how intelligence can be defined whether machines can 'think' sensory
Díaz Pinedo, Edilfredo Eliot
2012-01-01
Intelligent Advertisement diseña e implementa un sistema de publicidad para dispositivos móviles en un centro comercial, donde los clientes reciben publicidad de forma pasiva en sus dispositivos mientras están dentro.
Bogdan Mohor Dumitrita
2011-01-01
The purpose of this work is to present business intelligence systems. These systems can be extremely complex and important in modern market competition. Its effectiveness also reflects in price, so we have to exlore their financial potential before investment. The systems have 20 years long history and during that time many of such tools have been developed, but they are rarely still in use. Business intelligence system consists of three main areas: Data Warehouse, ETL tools and tools f...
International Nuclear Information System (INIS)
Farkas, J.
1992-01-01
In this paper we discuss the relevance of artificial intelligence to the automatic indexing of natural language text. We describe the use of domain-specific semantically-based thesauruses and address the problem of creating adequate knowledge bases for intelligent indexing systems. We also discuss the relevance of the Hilbert space ι 2 to the compact representation of documents and to the definition of the similarity of natural language texts. (author). 17 refs., 2 figs
Energy Technology Data Exchange (ETDEWEB)
Farkas, J
1993-12-31
In this paper we discuss the relevance of artificial intelligence to the automatic indexing of natural language text. We describe the use of domain-specific semantically-based thesauruses and address the problem of creating adequate knowledge bases for intelligent indexing systems. We also discuss the relevance of the Hilbert space {iota}{sup 2} to the compact representation of documents and to the definition of the similarity of natural language texts. (author). 17 refs., 2 figs.
Source localization using recursively applied and projected (RAP) MUSIC
Energy Technology Data Exchange (ETDEWEB)
Mosher, J.C. [Los Alamos National Lab., NM (United States); Leahy, R.M. [Univ. of Southern California, Los Angeles, CA (United States). Signal and Image Processing Inst.
1998-03-01
A new method for source localization is described that is based on a modification of the well known multiple signal classification (MUSIC) algorithm. In classical MUSIC, the array manifold vector is projected onto an estimate of the signal subspace, but errors in the estimate can make location of multiple sources difficult. Recursively applied and projected (RAP) MUSIC uses each successively located source to form an intermediate array gain matrix, and projects both the array manifold and the signal subspace estimate into its orthogonal complement. The MUSIC projection is then performed in this reduced subspace. Using the metric of principal angles, the authors describe a general form of the RAP-MUSIC algorithm for the case of diversely polarized sources. Through a uniform linear array simulation, the authors demonstrate the improved Monte Carlo performance of RAP-MUSIC relative to MUSIC and two other sequential subspace methods, S and IES-MUSIC.
Toward An Ontology of Mutual Recursion: Models, Mind and Media
Directory of Open Access Journals (Sweden)
Mat Wall-Smith
2008-01-01
Full Text Available In Parables for the Virtual Massumi describes 'The Autonomy of Affect' in our ecology of thought (Massumi 2002 : 35. The object of Stiegler's Technics and Time is 'technics apprehended as the horizon of all possibility to come and all possibility of a future' (Stiegler 1998 : ix. The ecological dynamic described by the recursion between this 'affective autonomy' and a 'technical horizon of possibility' describes a metamodel of the relation between body and world, between perception and expression. I argue that this metamodel allows for the technical architectures that enshrine media processes and models as both the manifestation and modulation of the 'industry' or vitality of mind. I argue that these technical architectures are crucial to the creation and maintenance of dynamic ecologies of living.
Applying recursive numerical integration techniques for solving high dimensional integrals
International Nuclear Information System (INIS)
Ammon, Andreas; Genz, Alan; Hartung, Tobias; Jansen, Karl; Volmer, Julia; Leoevey, Hernan
2016-11-01
The error scaling for Markov-Chain Monte Carlo techniques (MCMC) with N samples behaves like 1/√(N). This scaling makes it often very time intensive to reduce the error of computed observables, in particular for applications in lattice QCD. It is therefore highly desirable to have alternative methods at hand which show an improved error scaling. One candidate for such an alternative integration technique is the method of recursive numerical integration (RNI). The basic idea of this method is to use an efficient low-dimensional quadrature rule (usually of Gaussian type) and apply it iteratively to integrate over high-dimensional observables and Boltzmann weights. We present the application of such an algorithm to the topological rotor and the anharmonic oscillator and compare the error scaling to MCMC results. In particular, we demonstrate that the RNI technique shows an error scaling in the number of integration points m that is at least exponential.
A Recursive Fuzzy System for Efficient Digital Image Stabilization
Directory of Open Access Journals (Sweden)
Nikolaos Kyriakoulis
2008-01-01
Full Text Available A novel digital image stabilization technique is proposed in this paper. It is based on a fuzzy Kalman compensation of the global motion vector (GMV, which is estimated in the log-polar plane. The GMV is extracted using four local motion vectors (LMVs computed on respective subimages in the logpolar plane. The fuzzy Kalman system consists of a fuzzy system with the Kalman filter's discrete time-invariant definition. Due to this inherited recursiveness, the output results into smoothed image sequences. The proposed stabilization system aims to compensate any oscillations of the frame absolute positions, based on the motion estimation in the log-polar domain, filtered by the fuzzy Kalman system, and thus the advantages of both the fuzzy Kalman system and the log-polar transformation are exploited. The described technique produces optimal results in terms of the output quality and the level of compensation.
Stochastic Recursive Algorithms for Optimization Simultaneous Perturbation Methods
Bhatnagar, S; Prashanth, L A
2013-01-01
Stochastic Recursive Algorithms for Optimization presents algorithms for constrained and unconstrained optimization and for reinforcement learning. Efficient perturbation approaches form a thread unifying all the algorithms considered. Simultaneous perturbation stochastic approximation and smooth fractional estimators for gradient- and Hessian-based methods are presented. These algorithms: • are easily implemented; • do not require an explicit system model; and • work with real or simulated data. Chapters on their application in service systems, vehicular traffic control and communications networks illustrate this point. The book is self-contained with necessary mathematical results placed in an appendix. The text provides easy-to-use, off-the-shelf algorithms that are given detailed mathematical treatment so the material presented will be of significant interest to practitioners, academic researchers and graduate students alike. The breadth of applications makes the book appropriate for reader from sim...
Recursive model for the fragmentation of polarized quarks
Kerbizi, A.; Artru, X.; Belghobsi, Z.; Bradamante, F.; Martin, A.
2018-04-01
We present a model for Monte Carlo simulation of the fragmentation of a polarized quark. The model is based on string dynamics and the 3P0 mechanism of quark pair creation at string breaking. The fragmentation is treated as a recursive process, where the splitting function of the subprocess q →h +q' depends on the spin density matrix of the quark q . The 3P0 mechanism is parametrized by a complex mass parameter μ , the imaginary part of which is responsible for single spin asymmetries. The model has been implemented in a Monte Carlo program to simulate jets made of pseudoscalar mesons. Results for single hadron and hadron pair transverse-spin asymmetries are found to be in agreement with experimental data from SIDIS and e+e- annihilation. The model predictions on the jet-handedness are also discussed.
Applying recursive numerical integration techniques for solving high dimensional integrals
Energy Technology Data Exchange (ETDEWEB)
Ammon, Andreas [IVU Traffic Technologies AG, Berlin (Germany); Genz, Alan [Washington State Univ., Pullman, WA (United States). Dept. of Mathematics; Hartung, Tobias [King' s College, London (United Kingdom). Dept. of Mathematics; Jansen, Karl; Volmer, Julia [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany). John von Neumann-Inst. fuer Computing NIC; Leoevey, Hernan [Humboldt Univ. Berlin (Germany). Inst. fuer Mathematik
2016-11-15
The error scaling for Markov-Chain Monte Carlo techniques (MCMC) with N samples behaves like 1/√(N). This scaling makes it often very time intensive to reduce the error of computed observables, in particular for applications in lattice QCD. It is therefore highly desirable to have alternative methods at hand which show an improved error scaling. One candidate for such an alternative integration technique is the method of recursive numerical integration (RNI). The basic idea of this method is to use an efficient low-dimensional quadrature rule (usually of Gaussian type) and apply it iteratively to integrate over high-dimensional observables and Boltzmann weights. We present the application of such an algorithm to the topological rotor and the anharmonic oscillator and compare the error scaling to MCMC results. In particular, we demonstrate that the RNI technique shows an error scaling in the number of integration points m that is at least exponential.
Normalized Minimum Error Entropy Algorithm with Recursive Power Estimation
Directory of Open Access Journals (Sweden)
Namyong Kim
2016-06-01
Full Text Available The minimum error entropy (MEE algorithm is known to be superior in signal processing applications under impulsive noise. In this paper, based on the analysis of behavior of the optimum weight and the properties of robustness against impulsive noise, a normalized version of the MEE algorithm is proposed. The step size of the MEE algorithm is normalized with the power of input entropy that is estimated recursively for reducing its computational complexity. The proposed algorithm yields lower minimum MSE (mean squared error and faster convergence speed simultaneously than the original MEE algorithm does in the equalization simulation. On the condition of the same convergence speed, its performance enhancement in steady state MSE is above 3 dB.
Binary recursive partitioning: background, methods, and application to psychology.
Merkle, Edgar C; Shaffer, Victoria A
2011-02-01
Binary recursive partitioning (BRP) is a computationally intensive statistical method that can be used in situations where linear models are often used. Instead of imposing many assumptions to arrive at a tractable statistical model, BRP simply seeks to accurately predict a response variable based on values of predictor variables. The method outputs a decision tree depicting the predictor variables that were related to the response variable, along with the nature of the variables' relationships. No significance tests are involved, and the tree's 'goodness' is judged based on its predictive accuracy. In this paper, we describe BRP methods in a detailed manner and illustrate their use in psychological research. We also provide R code for carrying out the methods.
A nested recursive logit model for route choice analysis
DEFF Research Database (Denmark)
Mai, Tien; Frejinger, Emma; Fosgerau, Mogens
2015-01-01
choices and the model does not require any sampling of choice sets. Furthermore, the model can be consistently estimated and efficiently used for prediction.A key challenge lies in the computation of the value functions, i.e. the expected maximum utility from any position in the network to a destination....... The value functions are the solution to a system of non-linear equations. We propose an iterative method with dynamic accuracy that allows to efficiently solve these systems.We report estimation results and a cross-validation study for a real network. The results show that the NRL model yields sensible......We propose a route choice model that relaxes the independence from irrelevant alternatives property of the logit model by allowing scale parameters to be link specific. Similar to the recursive logit (RL) model proposed by Fosgerau et al. (2013), the choice of path is modeled as a sequence of link...
Valle, Annalisa; Massaro, Davide; Castelli, Ilaria; Marchetti, Antonella
2015-01-01
This study explores the development of theory of mind, operationalized as recursive thinking ability, from adolescence to early adulthood (N = 110; young adolescents = 47; adolescents = 43; young adults = 20). The construct of theory of mind has been operationalized in two different ways: as the ability to recognize the correct mental state of a character, and as the ability to attribute the correct mental state in order to predict the character’s behaviour. The Imposing Memory Task, with five recursive thinking levels, and a third-order false-belief task with three recursive thinking levels (devised for this study) have been used. The relationship among working memory, executive functions, and linguistic skills are also analysed. Results show that subjects exhibit less understanding of elevated recursive thinking levels (third, fourth, and fifth) compared to the first and second levels. Working memory is correlated with total recursive thinking, whereas performance on the linguistic comprehension task is related to third level recursive thinking in both theory of mind tasks. An effect of age on third-order false-belief task performance was also found. A key finding of the present study is that the third-order false-belief task shows significant age differences in the application of recursive thinking that involves the prediction of others’ behaviour. In contrast, such an age effect is not observed in the Imposing Memory Task. These results may support the extension of the investigation of the third order false belief after childhood. PMID:27247645
Artificial Intelligence Applications to High-Technology Training.
Dede, Christopher
1987-01-01
Discusses the use of artificial intelligence to improve occupational instruction in complex subjects with high performance goals, such as those required for high-technology jobs. Highlights include intelligent computer assisted instruction, examples in space technology training, intelligent simulation environments, and the need for adult training…
Intelligent instrumentation principles and applications
Bhuyan, Manabendra
2011-01-01
With the advent of microprocessors and digital-processing technologies as catalyst, classical sensors capable of simple signal conditioning operations have evolved rapidly to take on higher and more specialized functions including validation, compensation, and classification. This new category of sensor expands the scope of incorporating intelligence into instrumentation systems, yet with such rapid changes, there has developed no universal standard for design, definition, or requirement with which to unify intelligent instrumentation. Explaining the underlying design methodologies of intelligent instrumentation, Intelligent Instrumentation: Principles and Applications provides a comprehensive and authoritative resource on the scientific foundations from which to coordinate and advance the field. Employing a textbook-like language, this book translates methodologies to more than 80 numerical examples, and provides applications in 14 case studies for a complete and working understanding of the material. Beginn...
Computational Intelligence. Mortality Models for the Actuary
Willemse, W.J.
2001-01-01
This thesis applies computational intelligence to the field of actuarial (insurance) science. In particular, this thesis deals with life insurance where mortality modelling is important. Actuaries use ancient models (mortality laws) from the nineteenth century, for example Gompertz' and Makeham's
Efficient design of two-dimensional recursive digital filters. Final report
International Nuclear Information System (INIS)
Twogood, R.E.; Mitra, S.K.
1980-01-01
This report outlines the research progress during the period August 1978 to July 1979. This work can be divided into seven basic project areas. Project 1 deals with a comparative study of 2-D recursive and nonrecursive digital filters. The second project addresses a new design technique for 2-D half-plane recursive filters, and Projects 3 thru 5 deal with implementation issues. The sixth project presents our recent study of the applicability of array processors to 2-D digital signal processing. The final project involves our investigation into techniques for incorporating symmetry constraints on 2-D recursive filters in order to yield more efficient implementations
The additive congruential random number generator--A special case of a multiple recursive generator
Wikramaratna, Roy S.
2008-07-01
This paper considers an approach to generating uniformly distributed pseudo-random numbers which works well in serial applications but which also appears particularly well-suited for application on parallel processing systems. Additive Congruential Random Number (ACORN) generators are straightforward to implement for arbitrarily large order and modulus; if implemented using integer arithmetic, it becomes possible to generate identical sequences on any machine. Previously published theoretical analysis has demonstrated that a kth order ACORN sequence approximates to being uniformly distributed in up to k dimensions, for any given k. ACORN generators can be constructed to give period lengths exceeding any given number (for example, with period length in excess of 230p, for any given p). Results of empirical tests have demonstrated that, if p is greater than or equal to 2, then the ACORN generator can be used successfully for generating double precision uniform random variates. This paper demonstrates that an ACORN generator is a particular case of a multiple recursive generator (and, therefore, also a special case of a matrix generator). Both these latter approaches have been widely studied, and it is to be hoped that the results given in the present paper will lead to greater confidence in using the ACORN generators.
The Impacts of Environmental Tax in China: A Dynamic Recursive Multi-Sector CGE Model
Directory of Open Access Journals (Sweden)
Bowen Xiao
2015-07-01
Full Text Available In recent years, the accumulated environmental problems resulting from excessive usage of fossil fuels have gradually loomed. Thus, an environmental tax, as an important policy tool, has been put on the agenda in China. In this paper, a dynamic recursive multi-sector Computable General Equilibrium (CGE model is applied to explore the impacts of the environmental tax on China’s economy. To comprehensively analyze the impacts, we introduce four kinds of typical contaminants and set two kinds of scenarios: different tax rates and different tax refunds. The results show that the environmental tax is conducive to environmental improvement, but the economic variables are adversely affected, for example, the loss of GDP at the low level tax rate is 0.46%. In order to offset the negative impacts, we presume the government refunds the tax. The results show that this can indeed relieve the negative effects. When the government refunds the production tax and corporate income tax, 0.49% and 0.34% of GDP is relieved by respectively. This paper provides a comprehensive analysis of the implementation of the environmental tax in China and lays a solid foundation for the introduction of the environmental tax.
Tan, Zhi-Zhong
2015-05-01
We develop a general recursion-transform (R-T) method for a two-dimensional resistor network with a zero resistor boundary. As applications of the R-T method, we consider a significant example to illuminate the usefulness for calculating resistance of a rectangular m×n resistor network with a null resistor and three arbitrary boundaries, a problem never solved before, since Green's function techniques and Laplacian matrix approaches are invalid in this case. Looking for the exact calculation of the resistance of a binary resistor network is important but difficult in the case of an arbitrary boundary since the boundary is like a wall or trap which affects the behavior of finite network. In this paper we obtain several general formulas of resistance between any two nodes in a nonregular m×n resistor network in both finite and infinite cases. In particular, 12 special cases are given by reducing one of the general formulas to understand its applications and meanings, and an integral identity is found when we compare the equivalent resistance of two different structures of the same problem in a resistor network.
Institute of Scientific and Technical Information of China (English)
Jonathan Michael Spector; Du Jing
2017-01-01
The history of educational technology in the last 50 years contains few instances of dramatic improvements in learning based on the adoption of a particular technology.An example involving artificial intelligence occurred in the 1990s with the development of intelligent tutoring systems (ITSs).What happened with ITSs was that their success was limited to well-defined and relatively simple declarative and procedural leaming tasks (e.g.,learning how to write a recursive function in LISP;doing multi-column addition),and improvements that were observed tended to be more limited than promised (e.g.,one standard deviation improvement at best rather than the promised standard deviation improvement).Still,there was some progress in terms of how to conceptualize learning.A seldom documented limitation was the notion of only viewing learning from only content and cognitive perspectives (i.e.,in terms of memory limitations,prior knowledge,bug libraries,learning hierarchies and sequences etc.).Little attention was paid to education conceived more broadly than developing specific cognitive skills with highly constrained problems.New technologies offer the potential to create dynamic and multi-dimensional models of a particular leamer,and to track large data sets of learning activities,resources,interventions,and outcomes over a great many leamers.Using those data to personalize learning for a particular leamer developing knowledge,competence and understanding in a specific domain of inquiry is finally a real possibility.While the potential to make significant progress is clearly possible,the reality is less not so promising.There are many as yet unmet challenging some of which will be mentioned in this paper.A persistent worry is that educational technologists and computer scientists will again promise too much,too soon at too little cost and with too little effort and attention to the realities in schools and universities.
Reliability analysis in intelligent machines
Mcinroy, John E.; Saridis, George N.
1990-01-01
Given an explicit task to be executed, an intelligent machine must be able to find the probability of success, or reliability, of alternative control and sensing strategies. By using concepts for information theory and reliability theory, new techniques for finding the reliability corresponding to alternative subsets of control and sensing strategies are proposed such that a desired set of specifications can be satisfied. The analysis is straightforward, provided that a set of Gaussian random state variables is available. An example problem illustrates the technique, and general reliability results are presented for visual servoing with a computed torque-control algorithm. Moreover, the example illustrates the principle of increasing precision with decreasing intelligence at the execution level of an intelligent machine.
Irwin, J David
2011-01-01
Technology has now progressed to the point that intelligent systems are replacing humans in the decision making processes as well as aiding in the solution of very complex problems. In many cases intelligent systems are already outperforming human activities. Artificial neural networks are not only capable of learning how to classify patterns, such images or sequence of events, but they can also effectively model complex nonlinear systems. Their ability to classify sequences of events is probably more popular in industrial applications where there is an inherent need to model nonlinear system
Energy Technology Data Exchange (ETDEWEB)
Hoyle, F
1983-01-01
The subject is covered in chapters, entitled: chance and the universe (synthesis of proteins; the primordial soup); the gospel according to Darwin (discussion of Darwin theory of evolution); life did not originate on earth (fossils from space; life in space); the interstellar connection (living dust between the stars; bacteria in space falling to the earth; interplanetary dust); evolution by cosmic control (microorganisms; genetics); why aren't the others here (a cosmic origin of life); after the big bang (big bang and steady state); the information rich universe; what is intelligence up to; the intelligent universe.
Artificial Intelligence and Moral intelligence
Directory of Open Access Journals (Sweden)
Laura Pana
2008-07-01
Full Text Available We discuss the thesis that the implementation of a moral code in the behaviour of artificial intelligent systems needs a specific form of human and artificial intelligence, not just an abstract intelligence. We present intelligence as a system with an internal structure and the structural levels of the moral system, as well as certain characteristics of artificial intelligent agents which can/must be treated as 1- individual entities (with a complex, specialized, autonomous or selfdetermined, even unpredictable conduct, 2- entities endowed with diverse or even multiple intelligence forms, like moral intelligence, 3- open and, even, free-conduct performing systems (with specific, flexible and heuristic mechanisms and procedures of decision, 4 – systems which are open to education, not just to instruction, 5- entities with “lifegraphy”, not just “stategraphy”, 6- equipped not just with automatisms but with beliefs (cognitive and affective complexes, 7- capable even of reflection (“moral life” is a form of spiritual, not just of conscious activity, 8 – elements/members of some real (corporal or virtual community, 9 – cultural beings: free conduct gives cultural value to the action of a ”natural” or artificial being. Implementation of such characteristics does not necessarily suppose efforts to design, construct and educate machines like human beings. The human moral code is irremediably imperfect: it is a morality of preference, of accountability (not of responsibility and a morality of non-liberty, which cannot be remedied by the invention of ethical systems, by the circulation of ideal values and by ethical (even computing education. But such an imperfect morality needs perfect instruments for its implementation: applications of special logic fields; efficient psychological (theoretical and technical attainments to endow the machine not just with intelligence, but with conscience and even spirit; comprehensive technical
Artificial intelligence and the future.
Clocksin, William F
2003-08-15
We consider some of the ideas influencing current artificial-intelligence research and outline an alternative conceptual framework that gives priority to social relationships as a key component and constructor of intelligent behaviour. The framework starts from Weizenbaum's observation that intelligence manifests itself only relative to specific social and cultural contexts. This is in contrast to a prevailing view, which sees intelligence as an abstract capability of the individual mind based on a mechanism for rational thought. The new approach is not based on the conventional idea that the mind is a rational processor of symbolic information, nor does it require the idea that thought is a kind of abstract problem solving with a semantics that is independent of its embodiment. Instead, priority is given to affective and social responses that serve to engage the whole agent in the life of the communities in which it participates. Intelligence is seen not as the deployment of capabilities for problem solving, but as constructed by the continual, ever-changing and unfinished engagement with the social group within the environment. The construction of the identity of the intelligent agent involves the appropriation or 'taking up' of positions within the conversations and narratives in which it participates. Thus, the new approach argues that the intelligent agent is shaped by the meaning ascribed to experience, by its situation in the social matrix, and by practices of self and of relationship into which intelligent life is recruited. This has implications for the technology of the future, as, for example, classic artificial intelligence models such as goal-directed problem solving are seen as special cases of narrative practices instead of as ontological foundations.
Geography literation to improve spatial intelligence of high school student
Utami, WS; Zain, IM
2018-01-01
Spatial intelligence is deeply related to success in the STEM disciplines (science,technology, engineering, and math). spatial intelligence as a transversal capacity which is useful for everyday life but which cannot be characterized in any specific and distinctive way, as are, for example, linguistic or mathematical ability. The ability of geographical literacy relates to spatial intelligence. test results prove that the ability of high-liter geography of high school students found in students who have a good spatial intelligence score
Directory of Open Access Journals (Sweden)
Monika GARG
2012-08-01
Full Text Available In this paper, an integrated approach is proposed for non-recursive formulation of connection coefficients of different orthogonal functions in terms of a generic orthogonal function. The application of these coefficients arises when the product of two orthogonal basis functions are to be expressed in terms of single basis functions. Two significant advantages are achieved; one, the non-recursive formulations avoid memory and stack overflows in computer implementations; two, the integrated approach provides for digital hardware once-designed can be used for different functions. Computational savings achieved with the proposed non-recursive formulation vis-à-vis recursive formulation, reported in the literature so far, have been demonstrated using MATLAB PROFILER.
Nonlinear dynamics for charges particle beams with a curved axis in the matrix - recursive model
Energy Technology Data Exchange (ETDEWEB)
Dymnikov, A D [University of St Petersburg, (Russian Federation). Institute of Computational Mathematics and Control Process
1994-12-31
In this paper a new matrix and recursive approach has been outlined for treating nonlinear optics of charged particle beams. This approach is a new analytical and computational tool for designers of optimal beam control systems. 9 refs.
Nonlinear dynamics for charges particle beams with a curved axis in the matrix - recursive model
Energy Technology Data Exchange (ETDEWEB)
Dymnikov, A.D. [University of St Petersburg, (Russian Federation). Institute of Computational Mathematics and Control Process
1993-12-31
In this paper a new matrix and recursive approach has been outlined for treating nonlinear optics of charged particle beams. This approach is a new analytical and computational tool for designers of optimal beam control systems. 9 refs.
Nonasymptotic form of the recursion relations of the three-dimensional Ising model
International Nuclear Information System (INIS)
Kozlovskii, M.P.
1989-01-01
Approximate recursion relations for the three-dimensional Ising model are obtained in the form of rapidly converging series. The representation of the recursion relations in the form of nonasymptotic series entails the abandonment of traditional perturbation theory based on a Gaussian measure density. The recursion relations proposed in the paper are used to calculate the critical exponent ν of the correlation length. It is shown that the difference form of the recursion relations leads, when higher non-Gaussian basis measures are used, to disappearance of a dependence of the critical exponent ν on s when s > 2 (s is the parameter of the division of the phase space into layers). The obtained results make it possible to calculate explicit expressions for the thermodynamic functions near the phase transition point
Nonlinear dynamics for charges particle beams with a curved axis in the matrix - recursive model
International Nuclear Information System (INIS)
Dymnikov, A.D.
1993-01-01
In this paper a new matrix and recursive approach has been outlined for treating nonlinear optics of charged particle beams. This approach is a new analytical and computational tool for designers of optimal beam control systems. 9 refs
Brand, Thomas
Speech intelligibility (SI) is important for different fields of research, engineering and diagnostics in order to quantify very different phenomena like the quality of recordings, communication and playback devices, the reverberation of auditoria, characteristics of hearing impairment, benefit using hearing aids or combinations of these things.
Implicit learning of recursive context-free grammars.
Rohrmeier, Martin; Fu, Qiufang; Dienes, Zoltan
2012-01-01
Context-free grammars are fundamental for the description of linguistic syntax. However, most artificial grammar learning experiments have explored learning of simpler finite-state grammars, while studies exploring context-free grammars have not assessed awareness and implicitness. This paper explores the implicit learning of context-free grammars employing features of hierarchical organization, recursive embedding and long-distance dependencies. The grammars also featured the distinction between left- and right-branching structures, as well as between centre- and tail-embedding, both distinctions found in natural languages. People acquired unconscious knowledge of relations between grammatical classes even for dependencies over long distances, in ways that went beyond learning simpler relations (e.g. n-grams) between individual words. The structural distinctions drawn from linguistics also proved important as performance was greater for tail-embedding than centre-embedding structures. The results suggest the plausibility of implicit learning of complex context-free structures, which model some features of natural languages. They support the relevance of artificial grammar learning for probing mechanisms of language learning and challenge existing theories and computational models of implicit learning.
Recursive recovery of Markov transition probabilities from boundary value data
Energy Technology Data Exchange (ETDEWEB)
Patch, Sarah Kathyrn [Univ. of California, Berkeley, CA (United States)
1994-04-01
In an effort to mathematically describe the anisotropic diffusion of infrared radiation in biological tissue Gruenbaum posed an anisotropic diffusion boundary value problem in 1989. In order to accommodate anisotropy, he discretized the temporal as well as the spatial domain. The probabilistic interpretation of the diffusion equation is retained; radiation is assumed to travel according to a random walk (of sorts). In this random walk the probabilities with which photons change direction depend upon their previous as well as present location. The forward problem gives boundary value data as a function of the Markov transition probabilities. The inverse problem requires finding the transition probabilities from boundary value data. Problems in the plane are studied carefully in this thesis. Consistency conditions amongst the data are derived. These conditions have two effects: they prohibit inversion of the forward map but permit smoothing of noisy data. Next, a recursive algorithm which yields a family of solutions to the inverse problem is detailed. This algorithm takes advantage of all independent data and generates a system of highly nonlinear algebraic equations. Pluecker-Grassmann relations are instrumental in simplifying the equations. The algorithm is used to solve the 4 x 4 problem. Finally, the smallest nontrivial problem in three dimensions, the 2 x 2 x 2 problem, is solved.
Decision-Directed Recursive Least Squares MIMO Channels Tracking
Directory of Open Access Journals (Sweden)
Karami Ebrahim
2006-01-01
Full Text Available A new approach for joint data estimation and channel tracking for multiple-input multiple-output (MIMO channels is proposed based on the decision-directed recursive least squares (DD-RLS algorithm. RLS algorithm is commonly used for equalization and its application in channel estimation is a novel idea. In this paper, after defining the weighted least squares cost function it is minimized and eventually the RLS MIMO channel estimation algorithm is derived. The proposed algorithm combined with the decision-directed algorithm (DDA is then extended for the blind mode operation. From the computational complexity point of view being versus the number of transmitter and receiver antennas, the proposed algorithm is very efficient. Through various simulations, the mean square error (MSE of the tracking of the proposed algorithm for different joint detection algorithms is compared with Kalman filtering approach which is one of the most well-known channel tracking algorithms. It is shown that the performance of the proposed algorithm is very close to Kalman estimator and that in the blind mode operation it presents a better performance with much lower complexity irrespective of the need to know the channel model.
Implicit Learning of Recursive Context-Free Grammars
Rohrmeier, Martin; Fu, Qiufang; Dienes, Zoltan
2012-01-01
Context-free grammars are fundamental for the description of linguistic syntax. However, most artificial grammar learning experiments have explored learning of simpler finite-state grammars, while studies exploring context-free grammars have not assessed awareness and implicitness. This paper explores the implicit learning of context-free grammars employing features of hierarchical organization, recursive embedding and long-distance dependencies. The grammars also featured the distinction between left- and right-branching structures, as well as between centre- and tail-embedding, both distinctions found in natural languages. People acquired unconscious knowledge of relations between grammatical classes even for dependencies over long distances, in ways that went beyond learning simpler relations (e.g. n-grams) between individual words. The structural distinctions drawn from linguistics also proved important as performance was greater for tail-embedding than centre-embedding structures. The results suggest the plausibility of implicit learning of complex context-free structures, which model some features of natural languages. They support the relevance of artificial grammar learning for probing mechanisms of language learning and challenge existing theories and computational models of implicit learning. PMID:23094021
Implicit learning of recursive context-free grammars.
Directory of Open Access Journals (Sweden)
Martin Rohrmeier
Full Text Available Context-free grammars are fundamental for the description of linguistic syntax. However, most artificial grammar learning experiments have explored learning of simpler finite-state grammars, while studies exploring context-free grammars have not assessed awareness and implicitness. This paper explores the implicit learning of context-free grammars employing features of hierarchical organization, recursive embedding and long-distance dependencies. The grammars also featured the distinction between left- and right-branching structures, as well as between centre- and tail-embedding, both distinctions found in natural languages. People acquired unconscious knowledge of relations between grammatical classes even for dependencies over long distances, in ways that went beyond learning simpler relations (e.g. n-grams between individual words. The structural distinctions drawn from linguistics also proved important as performance was greater for tail-embedding than centre-embedding structures. The results suggest the plausibility of implicit learning of complex context-free structures, which model some features of natural languages. They support the relevance of artificial grammar learning for probing mechanisms of language learning and challenge existing theories and computational models of implicit learning.
Model-Based Recursive Partitioning for Subgroup Analyses.
Seibold, Heidi; Zeileis, Achim; Hothorn, Torsten
2016-05-01
The identification of patient subgroups with differential treatment effects is the first step towards individualised treatments. A current draft guideline by the EMA discusses potentials and problems in subgroup analyses and formulated challenges to the development of appropriate statistical procedures for the data-driven identification of patient subgroups. We introduce model-based recursive partitioning as a procedure for the automated detection of patient subgroups that are identifiable by predictive factors. The method starts with a model for the overall treatment effect as defined for the primary analysis in the study protocol and uses measures for detecting parameter instabilities in this treatment effect. The procedure produces a segmented model with differential treatment parameters corresponding to each patient subgroup. The subgroups are linked to predictive factors by means of a decision tree. The method is applied to the search for subgroups of patients suffering from amyotrophic lateral sclerosis that differ with respect to their Riluzole treatment effect, the only currently approved drug for this disease.
Recursive Monte Carlo method for deep-penetration problems
International Nuclear Information System (INIS)
Goldstein, M.; Greenspan, E.
1980-01-01
The Recursive Monte Carlo (RMC) method developed for estimating importance function distributions in deep-penetration problems is described. Unique features of the method, including the ability to infer the importance function distribution pertaining to many detectors from, essentially, a single M.C. run and the ability to use the history tape created for a representative region to calculate the importance function in identical regions, are illustrated. The RMC method is applied to the solution of two realistic deep-penetration problems - a concrete shield problem and a Tokamak major penetration problem. It is found that the RMC method can provide the importance function distributions, required for importance sampling, with accuracy that is suitable for an efficient solution of the deep-penetration problems considered. The use of the RMC method improved, by one to three orders of magnitude, the solution efficiency of the two deep-penetration problems considered: a concrete shield problem and a Tokamak major penetration problem. 8 figures, 4 tables
Compact QED tree-level amplitudes from dressed BCFW recursion relations
International Nuclear Information System (INIS)
Badger, Simon D.; Henn, Johannes M.
2010-05-01
We construct a modified on-shell BCFW recursion relation to derive compact analytic representations of tree-level amplitudes in QED. As an application, we study the amplitudes of a fermion pair coupling to an arbitrary number of photons and give compact formulae for the NMHV and N 2 MHV case. We demonstrate that the new recursion relation reduces the growth in complexity with additional photons to be exponential rather than factorial. (orig.)
Compact QED tree-level amplitudes from dressed BCFW recursion relations
Energy Technology Data Exchange (ETDEWEB)
Badger, Simon D. [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany); Henn, Johannes M. [Humboldt Univ., Berlin (Germany). Inst. fuer Physik
2010-05-15
We construct a modified on-shell BCFW recursion relation to derive compact analytic representations of tree-level amplitudes in QED. As an application, we study the amplitudes of a fermion pair coupling to an arbitrary number of photons and give compact formulae for the NMHV and N{sup 2}MHV case. We demonstrate that the new recursion relation reduces the growth in complexity with additional photons to be exponential rather than factorial. (orig.)
Chiodo formulas for the r-th roots and topological recursion
Lewanski, Danilo; Popolitov, Alexandr; Shadrin, Sergey; Zvonkine, Dimitri
2015-01-01
We analyze Chiodo's formulas for the Chern classes related to the r-th roots of the suitably twisted integer powers of the canonical class on the moduli space of curves. The intersection numbers of these classes with psi-classes are reproduced via the Chekhov-Eynard-Orantin topological recursion. As an application, we prove that the Johnson-Pandharipande-Tseng formula for the orbifold Hurwitz numbers is equivalent to the topological recursion for the orbifold Hurwitz numbers. In particular, t...
Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
DEFF Research Database (Denmark)
Conradie, Willem; Goranko, Valentin; Vakarelov, Dimiter
2010-01-01
The previously introduced algorithm SQEMA computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend SQEMA with an additional rule based on a recursive version of Ackermann's lemma, which enables the algorithm to compute local frame equivalents...... on the class of ‘recursive formulae’. We also show that a certain version of this algorithm guarantees the canonicity of the formulae on which it succeeds....
Estimation of Mechanical Signals in Induction Motors using the Recursive Prediction Error Method
DEFF Research Database (Denmark)
Børsting, H.; Knudsen, Morten; Rasmussen, Henrik
1993-01-01
Sensor feedback of mechanical quantities for control applications in induction motors is troublesome and relative expensive. In this paper a recursive prediction error (RPE) method has successfully been used to estimate the angular rotor speed ........Sensor feedback of mechanical quantities for control applications in induction motors is troublesome and relative expensive. In this paper a recursive prediction error (RPE) method has successfully been used to estimate the angular rotor speed .....
Dongarra, Jack
2013-09-18
The LU factorization is an important numerical algorithm for solving systems of linear equations in science and engineering and is a characteristic of many dense linear algebra computations. For example, it has become the de facto numerical algorithm implemented within the LINPACK benchmark to rank the most powerful supercomputers in the world, collected by the TOP500 website. Multicore processors continue to present challenges to the development of fast and robust numerical software due to the increasing levels of hardware parallelism and widening gap between core and memory speeds. In this context, the difficulty in developing new algorithms for the scientific community resides in the combination of two goals: achieving high performance while maintaining the accuracy of the numerical algorithm. This paper proposes a new approach for computing the LU factorization in parallel on multicore architectures, which not only improves the overall performance but also sustains the numerical quality of the standard LU factorization algorithm with partial pivoting. While the update of the trailing submatrix is computationally intensive and highly parallel, the inherently problematic portion of the LU factorization is the panel factorization due to its memory-bound characteristic as well as the atomicity of selecting the appropriate pivots. Our approach uses a parallel fine-grained recursive formulation of the panel factorization step and implements the update of the trailing submatrix with the tile algorithm. Based on conflict-free partitioning of the data and lockless synchronization mechanisms, our implementation lets the overall computation flow naturally without contention. The dynamic runtime system called QUARK is then able to schedule tasks with heterogeneous granularities and to transparently introduce algorithmic lookahead. The performance results of our implementation are competitive compared to the currently available software packages and libraries. For example
Dongarra, Jack; Faverge, Mathieu; Ltaief, Hatem; Luszczek, Piotr R.
2013-01-01
The LU factorization is an important numerical algorithm for solving systems of linear equations in science and engineering and is a characteristic of many dense linear algebra computations. For example, it has become the de facto numerical algorithm implemented within the LINPACK benchmark to rank the most powerful supercomputers in the world, collected by the TOP500 website. Multicore processors continue to present challenges to the development of fast and robust numerical software due to the increasing levels of hardware parallelism and widening gap between core and memory speeds. In this context, the difficulty in developing new algorithms for the scientific community resides in the combination of two goals: achieving high performance while maintaining the accuracy of the numerical algorithm. This paper proposes a new approach for computing the LU factorization in parallel on multicore architectures, which not only improves the overall performance but also sustains the numerical quality of the standard LU factorization algorithm with partial pivoting. While the update of the trailing submatrix is computationally intensive and highly parallel, the inherently problematic portion of the LU factorization is the panel factorization due to its memory-bound characteristic as well as the atomicity of selecting the appropriate pivots. Our approach uses a parallel fine-grained recursive formulation of the panel factorization step and implements the update of the trailing submatrix with the tile algorithm. Based on conflict-free partitioning of the data and lockless synchronization mechanisms, our implementation lets the overall computation flow naturally without contention. The dynamic runtime system called QUARK is then able to schedule tasks with heterogeneous granularities and to transparently introduce algorithmic lookahead. The performance results of our implementation are competitive compared to the currently available software packages and libraries. For example
Recursive Subsystems in Aphasia and Alzheimer's Disease: Case Studies in Syntax and Theory of Mind
Bánréti, Zoltán; Hoffmann, Ildikó; Vincze, Veronika
2016-01-01
The relationship between recursive sentence embedding and theory-of-mind (ToM) inference is investigated in three persons with Broca's aphasia, two persons with Wernicke's aphasia, and six persons with mild and moderate Alzheimer's disease (AD). We asked questions of four types about photographs of various real-life situations. Type 4 questions asked participants about intentions, thoughts, or utterances of the characters in the pictures (“What may X be thinking/asking Y to do?”). The expected answers typically involved subordinate clauses introduced by conjunctions or direct quotations of the characters' utterances. Broca's aphasics did not produce answers with recursive sentence embedding. Rather, they projected themselves into the characters' mental states and gave direct answers in the first person singular, with relevant ToM content. We call such replies “situative statements.” Where the question concerned the mental state of the character but did not require an answer with sentence embedding (“What does X hate?”), aphasics gave descriptive answers rather than situative statements. Most replies given by persons with AD to Type 4 questions were grammatical instances of recursive sentence embedding. They also gave a few situative statements but the ToM content of these was irrelevant. In more than one third of their well-formed sentence embeddings, too, they conveyed irrelevant ToM contents. Persons with moderate AD were unable to pass secondary false belief tests. The results reveal double dissociation: Broca's aphasics are unable to access recursive sentence embedding but they can make appropriate ToM inferences; moderate AD persons make the wrong ToM inferences but they are able to access recursive sentence embedding. The double dissociation may be relevant for the nature of the relationship between the two recursive capacities. Broca's aphasics compensated for the lack of recursive sentence embedding by recursive ToM reasoning represented in very
Lawrence, David R; Palacios-González, César; Harris, John
2016-04-01
It seems natural to think that the same prudential and ethical reasons for mutual respect and tolerance that one has vis-à-vis other human persons would hold toward newly encountered paradigmatic but nonhuman biological persons. One also tends to think that they would have similar reasons for treating we humans as creatures that count morally in our own right. This line of thought transcends biological boundaries-namely, with regard to artificially (super)intelligent persons-but is this a safe assumption? The issue concerns ultimate moral significance: the significance possessed by human persons, persons from other planets, and hypothetical nonorganic persons in the form of artificial intelligence (AI). This article investigates why our possible relations to AI persons could be more complicated than they first might appear, given that they might possess a radically different nature to us, to the point that civilized or peaceful coexistence in a determinate geographical space could be impossible to achieve.
1990-01-01
NASA also seeks to advance American education by employing the technology utilization process to develop a computerized, artificial intelligence-based Intelligent Tutoring System (ITS) to help high school and college physics students. The tutoring system is designed for use with the lecture and laboratory portions of a typical physics instructional program. Its importance lies in its ability to observe continually as a student develops problem solutions and to intervene when appropriate with assistance specifically directed at the student's difficulty and tailored to his skill level and learning style. ITS originated as a project of the Johnson Space Center (JSC). It is being developed by JSC's Software Technology Branch in cooperation with Dr. R. Bowen Loftin at the University of Houston-Downtown. Program is jointly sponsored by NASA and ACOT (Apple Classrooms of Tomorrow). Other organizations providing support include Texas Higher Education Coordinating Board, the National Research Council, Pennzoil Products Company and the George R. Brown Foundation. The Physics I class of Clear Creek High School, League City, Texas are providing the classroom environment for test and evaluation of the system. The ITS is a spinoff product developed earlier to integrate artificial intelligence into training/tutoring systems for NASA astronauts flight controllers and engineers.
Intelligent Design and Intelligent Failure
Jerman, Gregory
2015-01-01
Good Evening, my name is Greg Jerman and for nearly a quarter century I have been performing failure analysis on NASA's aerospace hardware. During that time I had the distinct privilege of keeping the Space Shuttle flying for two thirds of its history. I have analyzed a wide variety of failed hardware from simple electrical cables to cryogenic fuel tanks to high temperature turbine blades. During this time I have found that for all the time we spend intelligently designing things, we need to be equally intelligent about understanding why things fail. The NASA Flight Director for Apollo 13, Gene Kranz, is best known for the expression "Failure is not an option." However, NASA history is filled with failures both large and small, so it might be more accurate to say failure is inevitable. It is how we react and learn from our failures that makes the difference.
Computational intelligence in biomedical imaging
2014-01-01
This book provides a comprehensive overview of the state-of-the-art computational intelligence research and technologies in biomedical images with emphasis on biomedical decision making. Biomedical imaging offers useful information on patients’ medical conditions and clues to causes of their symptoms and diseases. Biomedical images, however, provide a large number of images which physicians must interpret. Therefore, computer aids are demanded and become indispensable in physicians’ decision making. This book discusses major technical advancements and research findings in the field of computational intelligence in biomedical imaging, for example, computational intelligence in computer-aided diagnosis for breast cancer, prostate cancer, and brain disease, in lung function analysis, and in radiation therapy. The book examines technologies and studies that have reached the practical level, and those technologies that are becoming available in clinical practices in hospitals rapidly such as computational inte...
Stream Kriging: Incremental and recursive ordinary Kriging over spatiotemporal data streams
Zhong, Xu; Kealy, Allison; Duckham, Matt
2016-05-01
Ordinary Kriging is widely used for geospatial interpolation and estimation. Due to the O (n3) time complexity of solving the system of linear equations, ordinary Kriging for a large set of source points is computationally intensive. Conducting real-time Kriging interpolation over continuously varying spatiotemporal data streams can therefore be especially challenging. This paper develops and tests two new strategies for improving the performance of an ordinary Kriging interpolator adapted to a stream-processing environment. These strategies rely on the expectation that, over time, source data points will frequently refer to the same spatial locations (for example, where static sensor nodes are generating repeated observations of a dynamic field). First, an incremental strategy improves efficiency in cases where a relatively small proportion of previously processed spatial locations are absent from the source points at any given iteration. Second, a recursive strategy improves efficiency in cases where there is substantial set overlap between the sets of spatial locations of source points at the current and previous iterations. These two strategies are evaluated in terms of their computational efficiency in comparison to ordinary Kriging algorithm. The results show that these two strategies can reduce the time taken to perform the interpolation by up to 90%, and approach average-case time complexity of O (n2) when most but not all source points refer to the same locations over time. By combining the approaches developed in this paper with existing heuristic ordinary Kriging algorithms, the conclusions indicate how further efficiency gains could potentially be accrued. The work ultimately contributes to the development of online ordinary Kriging interpolation algorithms, capable of real-time spatial interpolation with large streaming data sets.
Directory of Open Access Journals (Sweden)
Patrick Habecker
Full Text Available Researchers interested in studying populations that are difficult to reach through traditional survey methods can now draw on a range of methods to access these populations. Yet many of these methods are more expensive and difficult to implement than studies using conventional sampling frames and trusted sampling methods. The network scale-up method (NSUM provides a middle ground for researchers who wish to estimate the size of a hidden population, but lack the resources to conduct a more specialized hidden population study. Through this method it is possible to generate population estimates for a wide variety of groups that are perhaps unwilling to self-identify as such (for example, users of illegal drugs or other stigmatized populations via traditional survey tools such as telephone or mail surveys--by asking a representative sample to estimate the number of people they know who are members of such a "hidden" subpopulation. The original estimator is formulated to minimize the weight a single scaling variable can exert upon the estimates. We argue that this introduces hidden and difficult to predict biases, and instead propose a series of methodological advances on the traditional scale-up estimation procedure, including a new estimator. Additionally, we formalize the incorporation of sample weights into the network scale-up estimation process, and propose a recursive process of back estimation "trimming" to identify and remove poorly performing predictors from the estimation process. To demonstrate these suggestions we use data from a network scale-up mail survey conducted in Nebraska during 2014. We find that using the new estimator and recursive trimming process provides more accurate estimates, especially when used in conjunction with sampling weights.
Mining IP to Domain Name Interactions to Detect DNS Flood Attacks on Recursive DNS Servers.
Alonso, Roberto; Monroy, Raúl; Trejo, Luis A
2016-08-17
The Domain Name System (DNS) is a critical infrastructure of any network, and, not surprisingly a common target of cybercrime. There are numerous works that analyse higher level DNS traffic to detect anomalies in the DNS or any other network service. By contrast, few efforts have been made to study and protect the recursive DNS level. In this paper, we introduce a novel abstraction of the recursive DNS traffic to detect a flooding attack, a kind of Distributed Denial of Service (DDoS). The crux of our abstraction lies on a simple observation: Recursive DNS queries, from IP addresses to domain names, form social groups; hence, a DDoS attack should result in drastic changes on DNS social structure. We have built an anomaly-based detection mechanism, which, given a time window of DNS usage, makes use of features that attempt to capture the DNS social structure, including a heuristic that estimates group composition. Our detection mechanism has been successfully validated (in a simulated and controlled setting) and with it the suitability of our abstraction to detect flooding attacks. To the best of our knowledge, this is the first time that work is successful in using this abstraction to detect these kinds of attacks at the recursive level. Before concluding the paper, we motivate further research directions considering this new abstraction, so we have designed and tested two additional experiments which exhibit promising results to detect other types of anomalies in recursive DNS servers.
A recursive Monte Carlo method for estimating importance functions in deep penetration problems
International Nuclear Information System (INIS)
Goldstein, M.
1980-04-01
A pratical recursive Monte Carlo method for estimating the importance function distribution, aimed at importance sampling for the solution of deep penetration problems in three-dimensional systems, was developed. The efficiency of the recursive method was investigated for sample problems including one- and two-dimensional, monoenergetic and and multigroup problems, as well as for a practical deep-penetration problem with streaming. The results of the recursive Monte Carlo calculations agree fairly well with Ssub(n) results. It is concluded that the recursive Monte Carlo method promises to become a universal method for estimating the importance function distribution for the solution of deep-penetration problems, in all kinds of systems: for many systems the recursive method is likely to be more efficient than previously existing methods; for three-dimensional systems it is the first method that can estimate the importance function with the accuracy required for an efficient solution based on importance sampling of neutron deep-penetration problems in those systems
Mining IP to Domain Name Interactions to Detect DNS Flood Attacks on Recursive DNS Servers
Directory of Open Access Journals (Sweden)
Roberto Alonso
2016-08-01
Full Text Available The Domain Name System (DNS is a critical infrastructure of any network, and, not surprisingly a common target of cybercrime. There are numerous works that analyse higher level DNS traffic to detect anomalies in the DNS or any other network service. By contrast, few efforts have been made to study and protect the recursive DNS level. In this paper, we introduce a novel abstraction of the recursive DNS traffic to detect a flooding attack, a kind of Distributed Denial of Service (DDoS. The crux of our abstraction lies on a simple observation: Recursive DNS queries, from IP addresses to domain names, form social groups; hence, a DDoS attack should result in drastic changes on DNS social structure. We have built an anomaly-based detection mechanism, which, given a time window of DNS usage, makes use of features that attempt to capture the DNS social structure, including a heuristic that estimates group composition. Our detection mechanism has been successfully validated (in a simulated and controlled setting and with it the suitability of our abstraction to detect flooding attacks. To the best of our knowledge, this is the first time that work is successful in using this abstraction to detect these kinds of attacks at the recursive level. Before concluding the paper, we motivate further research directions considering this new abstraction, so we have designed and tested two additional experiments which exhibit promising results to detect other types of anomalies in recursive DNS servers.
Down two steps: Are bilinguals delayed in the acquisition of recursively embedded PPs?
Directory of Open Access Journals (Sweden)
Ana Pérez-Leroux
2017-08-01
Full Text Available The present study examines whether bilingual children are delayed in the ability to produce complex DPs. We elicited production of DPs containing two PP modifiers, in two conditions designed to tease apart the acquisition of an embedding rule from the acquisition of the recursivity of an embedding rule. In the recursive condition, one modifier PP was itself modified by an additional PP. In the non-recursive condition, both PPs sequentially modified the main noun. Participants were 71 English monolingual children and 35 bilinguals between the ages of four and six. The evidence suggested an overall difference between groups, however further analysis revealed that bilinguals differed from monolinguals only insofar as the onset of PP embedding. No specific additional bilingual delay arose from the recursive condition. This suggests that recursive embedding is a resilient domain in language acquisition and supports proposals that link morphosyntactic delays in bilingual children to domains of grammar that are heavily reliant on lexical learning, which would include learning the first instance of PP embedding. --- Original in English. --- DOI: http://dx.doi.org/10.12957/matraga.2017.28781
Making It Better: Research, Assessment, and Recursive Learning Cycles
Brookover, Robert; Timmerman, Danielle
2013-01-01
This article provides case study examples of how assessment efforts led to and have been enhanced by the creation of integrated curriculum delivery models in parks, recreation, and tourism programs at Clemson University and the University of Utah.
Petersen, Anders
2001-01-01
Cílem této bakalářské práce je seznámení s Business Intelligence a zpracování vývojového trendu, který ovlivňuje podobu řešení Business Intelligence v podniku ? Business Activity Monitoring. Pro zpracování tohoto tématu byla použita metoda studia odborných pramenů, a to jak v českém, tak v anglickém jazyce. Hlavním přínosem práce je ucelený, v českém jazyce zpracovaný materiál pojednávající o Business Activity Monitoring. Práce je rozdělena do šesti hlavních kapitol. Prvních pět je věnováno p...
Analysis of litter size and average litter weight in pigs using a recursive model
DEFF Research Database (Denmark)
Varona, Luis; Sorensen, Daniel; Thompson, Robin
2007-01-01
An analysis of litter size and average piglet weight at birth in Landrace and Yorkshire using a standard two-trait mixed model (SMM) and a recursive mixed model (RMM) is presented. The RMM establishes a one-way link from litter size to average piglet weight. It is shown that there is a one......-to-one correspondence between the parameters of SMM and RMM and that they generate equivalent likelihoods. As parameterized in this work, the RMM tests for the presence of a recursive relationship between additive genetic values, permanent environmental effects, and specific environmental effects of litter size......, on average piglet weight. The equivalent standard mixed model tests whether or not the covariance matrices of the random effects have a diagonal structure. In Landrace, posterior predictive model checking supports a model without any form of recursion or, alternatively, a SMM with diagonal covariance...
Directory of Open Access Journals (Sweden)
Xuan Wu
2015-01-01
Full Text Available In order to control the permanent-magnet synchronous motor system (PMSM with different disturbances and nonlinearity, an improved current control algorithm for the PMSM systems using recursive model predictive control (RMPC is developed in this paper. As the conventional MPC has to be computed online, its iterative computational procedure needs long computing time. To enhance computational speed, a recursive method based on recursive Levenberg-Marquardt algorithm (RLMA and iterative learning control (ILC is introduced to solve the learning issue in MPC. RMPC is able to significantly decrease the computation cost of traditional MPC in the PMSM system. The effectiveness of the proposed algorithm has been verified by simulation and experimental results.
Recursive Subspace Identification of AUV Dynamic Model under General Noise Assumption
Directory of Open Access Journals (Sweden)
Zheping Yan
2014-01-01
Full Text Available A recursive subspace identification algorithm for autonomous underwater vehicles (AUVs is proposed in this paper. Due to the advantages at handling nonlinearities and couplings, the AUV model investigated here is for the first time constructed as a Hammerstein model with nonlinear feedback in the linear part. To better take the environment and sensor noises into consideration, the identification problem is concerned as an errors-in-variables (EIV one which means that the identification procedure is under general noise assumption. In order to make the algorithm recursively, propagator method (PM based subspace approach is extended into EIV framework to form the recursive identification method called PM-EIV algorithm. With several identification experiments carried out by the AUV simulation platform, the proposed algorithm demonstrates its effectiveness and feasibility.
A Revised Piecewise Linear Recursive Convolution FDTD Method for Magnetized Plasmas
International Nuclear Information System (INIS)
Liu Song; Zhong Shuangying; Liu Shaobin
2005-01-01
The piecewise linear recursive convolution (PLRC) finite-different time-domain (FDTD) method improves accuracy over the original recursive convolution (RC) FDTD approach and current density convolution (JEC) but retains their advantages in speed and efficiency. This paper describes a revised piecewise linear recursive convolution PLRC-FDTD formulation for magnetized plasma which incorporates both anisotropy and frequency dispersion at the same time, enabling the transient analysis of magnetized plasma media. The technique is illustrated by numerical simulations of the reflection and transmission coefficients through a magnetized plasma layer. The results show that the revised PLRC-FDTD method has improved the accuracy over the original RC FDTD method and JEC FDTD method
International Nuclear Information System (INIS)
Talpalariu, C. M.; Talpalariu, J.; Popescu, O.; Mocanasu, M.; Lita, I.; Visan, D. A.
2016-01-01
In this work we have studied a software filtering method implemented in a pulse counting computerized measuring channel using PIN diode radiation detector. In case our interest was focalized for low rate decay radiation measurement accuracies improvement and response time optimization. During works for digital mathematical algorithm development, we used a hardware radiation measurement channel configuration based on PIN diode BPW34 detector, preamplifier, filter and programmable counter, computer connected. We report measurement results using two digital recursive methods in statically and dynamically field evolution. Software for graphical input/output real time diagram representation was designed and implemented, facilitating performances evaluation between the response of fixed configuration software recursive filter and dynamically adaptive configuration recursive filter. (authors)
Parameter Estimation of a Closed Loop Coupled Tank Time Varying System using Recursive Methods
International Nuclear Information System (INIS)
Basir, Siti Nora; Yussof, Hanafiah; Shamsuddin, Syamimi; Selamat, Hazlina; Zahari, Nur Ismarrubie
2013-01-01
This project investigates the direct identification of closed loop plant using discrete-time approach. The uses of Recursive Least Squares (RLS), Recursive Instrumental Variable (RIV) and Recursive Instrumental Variable with Centre-Of-Triangle (RIV + COT) in the parameter estimation of closed loop time varying system have been considered. The algorithms were applied in a coupled tank system that employs covariance resetting technique where the time of parameter changes occur is unknown. The performances of all the parameter estimation methods, RLS, RIV and RIV + COT were compared. The estimation of the system whose output was corrupted with white and coloured noises were investigated. Covariance resetting technique successfully executed when the parameters change. RIV + COT gives better estimates than RLS and RIV in terms of convergence and maximum overshoot
Directory of Open Access Journals (Sweden)
Jianxin Feng
2014-01-01
Full Text Available The recursive estimation problem is studied for a class of uncertain dynamical systems with different delay rates sensor network and autocorrelated process noises. The process noises are assumed to be autocorrelated across time and the autocorrelation property is described by the covariances between different time instants. The system model under consideration is subject to multiplicative noises or stochastic uncertainties. The sensor delay phenomenon occurs in a random way and each sensor in the sensor network has an individual delay rate which is characterized by a binary switching sequence obeying a conditional probability distribution. By using the orthogonal projection theorem and an innovation analysis approach, the desired recursive robust estimators including recursive robust filter, predictor, and smoother are obtained. Simulation results are provided to demonstrate the effectiveness of the proposed approaches.
Web Intelligence and Artificial Intelligence in Education
Devedzic, Vladan
2004-01-01
This paper surveys important aspects of Web Intelligence (WI) in the context of Artificial Intelligence in Education (AIED) research. WI explores the fundamental roles as well as practical impacts of Artificial Intelligence (AI) and advanced Information Technology (IT) on the next generation of Web-related products, systems, services, and…
Intelligent tutoring systems for space applications
Luckhardt-Redfield, Carol A.
1990-01-01
Artificial Intelligence has been used in many space applications. Intelligent tutoring systems (ITSs) have only recently been developed for assisting training of space operations and skills. An ITS at Southwest Research Institute is described as an example of an ITS application for space operations, specifically, training console operations at mission control. A distinction is made between critical skills and knowledge versus routine skills. Other ITSs for space are also discussed and future training requirements and potential ITS solutions are described.
Directory of Open Access Journals (Sweden)
Iman Yousefi
2015-01-01
Full Text Available This paper presents parameter estimation of Permanent Magnet Synchronous Motor (PMSM using a combinatorial algorithm. Nonlinear fourth-order space state model of PMSM is selected. This model is rewritten to the linear regression form without linearization. Noise is imposed to the system in order to provide a real condition, and then combinatorial Orthogonal Projection Algorithm and Recursive Least Squares (OPA&RLS method is applied in the linear regression form to the system. Results of this method are compared to the Orthogonal Projection Algorithm (OPA and Recursive Least Squares (RLS methods to validate the feasibility of the proposed method. Simulation results validate the efficacy of the proposed algorithm.
A new algorithm for recursive estimation of ARMA parameters in reactor noise analysis
International Nuclear Information System (INIS)
Tran Dinh Tri
1992-01-01
In this paper a new recursive algorithm for estimating the parameters of the Autoregressive Moving Average (ARMA) model from measured data is presented. The Yule-Walker equations for the case of the ARMA model are derived from the ARMA equation with innovations. The recursive algorithm is based on choosing an appropriate form of the operator functions and suitable representation of the (n + 1)-th order operator functions according to those with lower order. Two cases, when the order of the AR part is equal to that of the MA part, and the general case, were considered. (Author)
Recursive prediction error methods for online estimation in nonlinear state-space models
Directory of Open Access Journals (Sweden)
Dag Ljungquist
1994-04-01
Full Text Available Several recursive algorithms for online, combined state and parameter estimation in nonlinear state-space models are discussed in this paper. Well-known algorithms such as the extended Kalman filter and alternative formulations of the recursive prediction error method are included, as well as a new method based on a line-search strategy. A comparison of the algorithms illustrates that they are very similar although the differences can be important for the online tracking capabilities and robustness. Simulation experiments on a simple nonlinear process show that the performance under certain conditions can be improved by including a line-search strategy.
Directory of Open Access Journals (Sweden)
Olga Lucia Quintero
2008-05-01
Full Text Available This work presents a state estimator for a continuous bioprocess. To this aim, the Non Linear Filtering theory based on the recursive application of Bayes rule and Monte Carlo techniques is used. Recursive Bayesian Filters Sampling Importance Resampling (SIR is employed, including different kinds of resampling. Generally, bio-processes have strong non-linear and non-Gaussian characteristics, and this tool becomes attractive. The estimator behavior and performance are illustrated with the continuous process of alcoholic fermentation of Zymomonas mobilis. Not too many applications with this tool have been reported in the biotechnological area.
Mueller, A. C.
1977-01-01
An analytical first order solution has been developed which describes the motion of an artificial satellite perturbed by an arbitrary number of zonal harmonics of the geopotential. A set of recursive relations for the solution, which was deduced from recursive relations of the geopotential, was derived. The method of solution is based on Von-Zeipel's technique applied to a canonical set of two-body elements in the extended phase space which incorporates the true anomaly as a canonical element. The elements are of Poincare type, that is, they are regular for vanishing eccentricities and inclinations. Numerical results show that this solution is accurate to within a few meters after 500 revolutions.
Evaluation of the Kubo formula for the conductivity using the recursion method
International Nuclear Information System (INIS)
Yeyati, A.L.; Weissmann, M.; Anda, E.
1988-09-01
We propose a numerical algorithm based on the recursion method to calculate the conductivity of a disordered system described by a tight-binding Hamiltonian. It has the advantage that the density of states and the conductivity can be obtained in a single recursion calculation. The method is applied to simple one and two-dimensional incommensurate systems in order to check the validity of the assumptions made and the numerical efficiency. The calculated conductivity shows a clear drop when the Fermi energy crosses a mobility edge. Potential applications of this work to other systems are discussed. (author). 13 refs, 9 figs
Recursion relations for the overlap of a Morse continuum state with a Lanczos basis state
International Nuclear Information System (INIS)
Lutrus, C.K.; Suck Salk, S.H.
1988-01-01
In the resonant reactive scattering theory of Mundel, Berman, and Domcke [Phys. Rev. A 32, 181 (1985)], the overlap of a Morse continuum state and a Lanczos basis state appears in the expression of transition amplitude. In their study, recursion relations for Green's functions in the Lanczos basis were used for computational efficiency. In this paper we derive new recursion relations specifically for the evaluation of overlap between the Morse continuum wave and Lanczos basis state that appears in the transition amplitude of resonant scattering. They are found to be simple to use with great accuracy
Recursive estimation techniques for detection of small objects in infrared image data
Zeidler, J. R.; Soni, T.; Ku, W. H.
1992-04-01
This paper describes a recursive detection scheme for point targets in infrared (IR) images. Estimation of the background noise is done using a weighted autocorrelation matrix update method and the detection statistic is calculated using a recursive technique. A weighting factor allows the algorithm to have finite memory and deal with nonstationary noise characteristics. The detection statistic is created by using a matched filter for colored noise, using the estimated noise autocorrelation matrix. The relationship between the weighting factor, the nonstationarity of the noise and the probability of detection is described. Some results on one- and two-dimensional infrared images are presented.
A new design for SLAM front-end based on recursive SOM
Yang, Xuesi; Xia, Shengping
2015-12-01
Aiming at the graph optimization-based monocular SLAM, a novel design for the front-end in single camera SLAM is proposed, based on the recursive SOM. Pixel intensities are directly used to achieve image registration and motion estimation, which can save time compared with the current appearance-based frameworks, usually including feature extraction and matching. Once a key-frame is identified, a recursive SOM is used to actualize loop-closure detecting, resulting a more precise location. The experiment on a public dataset validates our method on a computer with a quicker and effective result.
International Nuclear Information System (INIS)
George, D.G.
1990-01-01
This paper discusses the role of US intelligence during arms control negotiations between 1982 and 1987. It also covers : the orchestration of intelligence projects; an evaluation of the performance of intelligence activities; the effect intelligence work had on actual arms negotiations; and suggestions for improvements in the future
Intelligent products : A survey
Meyer, G.G.; Främling, K.; Holmström, J.
This paper presents an overview of the field of Intelligent Products. As Intelligent Products have many facets, this paper is mainly focused on the concept behind Intelligent Products, the technical foundations, and the achievable practical goals of Intelligent Products. A novel classification of
Intelligence Issues for Congress
2013-04-23
open source information— osint (newspapers...by user agencies. Section 1052 of the Intelligence Reform Act expressed the sense of Congress that there should be an open source intelligence ...center to coordinate the collection, analysis, production, and dissemination of open source intelligence to other intelligence agencies. An Open Source
Directory of Open Access Journals (Sweden)
Willem de Lint
2008-10-01
Full Text Available Recently, within liberal democracies, the post-Westphalian consolidation of security and intelligence has ushered in the normalization not only of security in ‘securitization’ but also of intelligence in what is proposed here as ‘intelligencification.’ In outlining the features of intelligencified governance, my aim is to interrogate the view that effects or traces, and productivity rather than negation is as persuasive as commonly thought by the constructivists. After all, counter-intelligence is both about purging and reconstructing the archive for undisclosed values. In practice, what is being normalized is the authorized and legalized use of release and retention protocols of politically actionable information. The intelligencification of governmentality affords a sovereignty shell-game or the instrumentalization of sovereign power by interests that are dependent on, yet often inimical to, the power of state, national, and popular sovereignty. On voit le politique et le social comme dépendant de contingences exclusives. Récemment, au sein des démocraties libérales, la consolidation de la sécurité et des services de renseignements de sécurité qui a suivi les traités de la Westphalie a donné lieu à la normalisation non seulement de la sécurité en «sécurisation» mais aussi des services de renseignements de sécurité en ce qui est proposé ici comme «intelligencification» [terme anglais créé par l’auteur, dérivé du mot anglais «intelligence» dans le sens de renseignements des écurité]. En particulier, ce que l’on normalise dans le but de contourner des contingences exclusives est l’utilisation autorisée et légalisée de protocoles de communication et de rétention d’information qui, politiquement, pourrait mener à des poursuites. En esquissant les traits de la gouvernance «intelligencifiée», mon but est d’interroger le point de vue que les effets ou les traces, et la productivité plutôt que la
Directory of Open Access Journals (Sweden)
Michael eSteinert
2014-01-01
Full Text Available Different species inhabit different sensory worlds and thus have evolved diverse means of processing information, learning and memory. In the escalated arms race with host defense, each pathogenic bacterium not only has evolved its individual cellular sensing and behaviour, but also collective sensing, interbacterial communication, distributed information processing, joint decision making, dissociative behaviour, and the phenotypic and genotypic heterogeneity necessary for epidemiologic success. Moreover, pathogenic populations take advantage of dormancy strategies and rapid evolutionary speed, which allow them to save co-generated intelligent traits in a collective genomic memory. This review discusses how these mechanisms add further levels of complexity to bacterial pathogenicity and transmission, and how mining for these mechanisms could help to develop new anti-infective strategies.
Counting Melodies: Recursion through Music for a Liberal Arts Audience
Ludwick, Kurt
2016-01-01
In the study of music from a mathematical perspective, several types of counting problems naturally arise. For example, how many different rhythms of a specified length (in beats) can be written if we restrict ourselves to only quarter notes (one beat) and half notes (two beats)? What if we allow whole notes, dotted half notes, etc.? Or, what if…
Average weighted receiving time in recursive weighted Koch networks
Indian Academy of Sciences (India)
Zhenjiang, 212013, People's Republic of China. ∗ ... The properties of a graph can be expressed via its adjacency matrix aij , whose elements take the ... For example, take the worldwide airport networks, where the number of sched- ..... This research is supported by the Humanistic and Social Science Foundation from the.
Binding Forces and Teachers' School Life: A Recursive Model.
Pang, Nicolas Sun-Keung
2003-01-01
Formulates theoretical model of four binding forces in school organizations--bureaucratic linkage, cultural linkage, tight coupling, and loose coupling--and examines their effects on teachers' feelings about school life. Finds, for example, that loose coupling had a positive effect on teachers' sense of community, job satisfaction, and commitment.…
Intelligence: Real or artificial?
Schlinger, Henry D.
1992-01-01
Throughout the history of the artificial intelligence movement, researchers have strived to create computers that could simulate general human intelligence. This paper argues that workers in artificial intelligence have failed to achieve this goal because they adopted the wrong model of human behavior and intelligence, namely a cognitive essentialist model with origins in the traditional philosophies of natural intelligence. An analysis of the word “intelligence” suggests that it originally r...
International Nuclear Information System (INIS)
Beni, G.
1994-01-01
We review the characteristics of Swarm Intelligence and discuss systems exhibiting it. The recently developed mathematical description of Swarm behavior is also reviewed and discussed. The self-organization of Swarms is described as the reconfiguring asynchronously and conservatively of a distribution. Swarm reconfigurations are based on producing distributions that are solutions to systems of linear equations. Conservation and asynchronicity are related, respectively, to the global and local nature of the Swarm problem. The conditions for the convergence of the Swarm algorithm are presented. The important point is that, under very general conditions, the Swarm reconfigures in a time which is independent of the size of the Swarm. This fact implies that a centralized controller can never reconfigure as fast as a Swarm provided the size of the Swarm is large enough. This result is related to the unpredictability of the Swarm, a basic property of Swarm Intelligence. Finally, the conditions under which Swarm algorithms become of practical importance are discussed and examples given. (author)
The Concept of Free Will as an Infinite Metatheoretic Recursion
Directory of Open Access Journals (Sweden)
Hashim Hanaan
2015-07-01
Full Text Available It is argued that the concept of free will, like the concept of truth in formal languages, requires a separation between an object level and a meta-level for being consistently defined. The Jamesian two stage model, which deconstructs free will into the causally open “free” stage with its closure in the “will” stage, is implicitly a move in this direction. However, to avoid the dilemma of determinism, free will additionally requires an infinite regress of causal meta-stages, making free choice a hypertask. We use this model to define free will of the rationalist-compatibilist type. This is shown to provide a natural three-way distinction between quantum indeterminism, freedom and free will, applicable respectively to artificial intelligence (AI, animal agents and human agents. We propose that the causal hierarchy in our model corresponds to a hierarchy of Turing uncomputability. Possible neurobiological and behavioral tests to demonstrate free will experimentally are suggested. Ramifications of the model for physics, evolutionary biology, neuroscience, neuropathological medicine and moral philosophy are briefly outlined.
Willcocks, Leslie
2013-01-01
Intelligent IT Outsourcing enables practitioners to focus in on the essential issues that need to be addressed so that the fundamental structure of their sourcing strategy and its implementation is sound. The authors provide insight into the challenges likely to be faced and give detailed advice on how to pre-empt and manage these.IT and outsourcing continue to be problematic, not least because fundamental learning about this subject fails to be applied systematically, and because IT is inherently difficult to manage. The economics are not obvious and emerging technologies have to be addressed, therefore IT goes to the heart of many enterprises and interfaces with multiple business units and processes, and there are continuous skills shortages.Unfortunately complexities are not removed in outsourced situations where additional problems come into play, for example the supplier''s capabilities, whether the IT is right for an outsourcing solution, and whether the contract is robust but flexible enough to allow f...
DEFF Research Database (Denmark)
Andersen, Jørgen Ellegaard; Fuji, Hiroyuki; Penner, Robert C.
relation, which combined with an initial condition determines these numbers uniquely. This recursion relation is equivalent to a second order, non-linear, algebraic partial differential equation for the generating function of the numbers of partial chord diagrams filtered by the boundary length and point...
Recursive inverse kinematics for robot arms via Kalman filtering and Bryson-Frazier smoothing
Rodriguez, G.; Scheid, R. E., Jr.
1987-01-01
This paper applies linear filtering and smoothing theory to solve recursively the inverse kinematics problem for serial multilink manipulators. This problem is to find a set of joint angles that achieve a prescribed tip position and/or orientation. A widely applicable numerical search solution is presented. The approach finds the minimum of a generalized distance between the desired and the actual manipulator tip position and/or orientation. Both a first-order steepest-descent gradient search and a second-order Newton-Raphson search are developed. The optimal relaxation factor required for the steepest descent method is computed recursively using an outward/inward procedure similar to those used typically for recursive inverse dynamics calculations. The second-order search requires evaluation of a gradient and an approximate Hessian. A Gauss-Markov approach is used to approximate the Hessian matrix in terms of products of first-order derivatives. This matrix is inverted recursively using a two-stage process of inward Kalman filtering followed by outward smoothing. This two-stage process is analogous to that recently developed by the author to solve by means of spatial filtering and smoothing the forward dynamics problem for serial manipulators.
Joint Analysis of Binomial and Continuous Traits with a Recursive Model
DEFF Research Database (Denmark)
Varona, Louis; Sorensen, Daniel
2014-01-01
This work presents a model for the joint analysis of a binomial and a Gaussian trait using a recursive parametrization that leads to a computationally efficient implementation. The model is illustrated in an analysis of mortality and litter size in two breeds of Danish pigs, Landrace and Yorkshir...
Cao, M.; Shen, T.L.; Song, Y.H.; Mei, S.W.
2002-01-01
The paper proposes a nonlinear robust controller for steam governor control in power systems. Based on dissipation theory, an innovative recursive design method is presented to construct the storage function of single machine infinite bus (SMIB) and multi-machine power systems. Furthermore, the
Real-time recursive motion segmentation of video data on a programmable device
Wittebrood, R.B; Haan, de G.
2001-01-01
We previously reported on a recursive algorithm enabling real-time object-based motion estimation (OME) of standard definition video on a digital signal processor (DSP). The algorithm approximates the motion of the objects in the image with parametric motion models and creates a segmentation mask by
The calculation of deep levels in semiconductors by using a recursion method for super-cells
International Nuclear Information System (INIS)
Wong Yongliang.
1987-01-01
The paper presents the theory of deep levels in semiconductors, the super-cell approach to the theory of deep level impurities, the calculation of band structure by using the tight-binding method and the recursion method used to study the defects in the presence of lattice relaxation and extended defect complexes. 47 refs
Hurwitz numbers, moduli of curves, topological recursion, Givental's theory and their relations
Spitz, L.
2014-01-01
The study of curves is an important area of research in algebraic geometry and mathematical physics. In my thesis I study so-called moduli spaces of curves; these are spaces that parametrize all curves with some specified properties. In particular, I study maps from curves to other spaces, recursive
Chiodo formulas for the r-th roots and topological recursion
Lewanski, D.; Popolitov, A.; Shadrin, S.; Zvonkine, D.
We analyze Chiodo’s formulas for the Chern classes related to the r-th roots of the suitably twisted integer powers of the canonical class on the moduli space of curves. The intersection numbers of these classes with ψ-classes are reproduced via the Chekhov–Eynard–Orantin topological recursion. As
Using metrics for proof rules for recursively defined delay-insensitive specifications
Mallon, WC; Udding, JT
1997-01-01
An advantage of algebraic specifications of delay insensitive asynchronous processes over most other formalisms is that it allows the recursive definition of processes, and correctness proofs of an implementation through fixpoint induction. On the other hand, proofs by fixpoint induction are
The Monge-Ampère equation: Hamiltonian and symplectic structures, recursions, and hierarchies
Kersten, P.H.M.; Krasil'shchik, I.; Verbovetsky, A.V.
2004-01-01
Using methods of geometry and cohomology developed recently, we study the Monge-Ampère equation, arising as the first nontrivial equation in the associativity equations, or WDVV equations. We describe Hamiltonian and symplectic structures as well as recursion operators for this equation in its
Recursive nearest neighbor search in a sparse and multiscale domain for comparing audio signals
DEFF Research Database (Denmark)
Sturm, Bob L.; Daudet, Laurent
2011-01-01
We investigate recursive nearest neighbor search in a sparse domain at the scale of audio signals. Essentially, to approximate the cosine distance between the signals we make pairwise comparisons between the elements of localized sparse models built from large and redundant multiscale dictionaries...
Deformation of the three-term recursion relation and generation of new orthogonal polynomials
International Nuclear Information System (INIS)
Alhaidari, A D
2002-01-01
We find solutions for a linear deformation of the three-term recursion relation. The orthogonal polynomials of the first and second kind associated with the deformed relation are obtained. The new density (weight) function is written in terms of the original one and the deformation parameters
Cross-Validation of Survival Bump Hunting by Recursive Peeling Methods.
Dazard, Jean-Eudes; Choe, Michael; LeBlanc, Michael; Rao, J Sunil
2014-08-01
We introduce a survival/risk bump hunting framework to build a bump hunting model with a possibly censored time-to-event type of response and to validate model estimates. First, we describe the use of adequate survival peeling criteria to build a survival/risk bump hunting model based on recursive peeling methods. Our method called "Patient Recursive Survival Peeling" is a rule-induction method that makes use of specific peeling criteria such as hazard ratio or log-rank statistics. Second, to validate our model estimates and improve survival prediction accuracy, we describe a resampling-based validation technique specifically designed for the joint task of decision rule making by recursive peeling (i.e. decision-box) and survival estimation. This alternative technique, called "combined" cross-validation is done by combining test samples over the cross-validation loops, a design allowing for bump hunting by recursive peeling in a survival setting. We provide empirical results showing the importance of cross-validation and replication.
Active and intelligent packaging for food: Is it the future?
Jong, A.R. de; Boumans, H.; Slaghek, T.; Veen, J. van; Rijk, R.; Zandvoort, M.M.J. van
2005-01-01
This paper gives an overview of the legal consequences of a new EU framework regulation on food contact materials which includes controls on active and intelligent packaging. Recent developments in active and intelligent packaging systems are described, two examples of which aim at achieving
Applications of Artificial Intelligence in Education--A Personal View.
Richer, Mark H.
1985-01-01
Discusses: how artificial intelligence (AI) can advance education; if the future of software lies in AI; the roots of intelligent computer-assisted instruction; protocol analysis; reactive environments; LOGO programming language; student modeling and coaching; and knowledge-based instructional programs. Numerous examples of AI programs are cited.…
Business Intelligence Approach In A Business Performance Context
Muntean, Mihaela; Cabau, Liviu Gabriel
2011-01-01
Subordinated to performance management, Business Intelligence approaches help firms to optimize business performance. Key performance indicators will be added to the multidimensional model grounding the performance perspectives. With respect to the Business Intelligence value chain, a theoretical approach was introduced and a practice example, based on Microsoft SQL Server specific services, for the customer perspective was implemented.
Directory of Open Access Journals (Sweden)
Wiemels Joseph
2008-09-01
Full Text Available Abstract Background Epigenetics is the study of heritable changes in gene function that cannot be explained by changes in DNA sequence. One of the most commonly studied epigenetic alterations is cytosine methylation, which is a well recognized mechanism of epigenetic gene silencing and often occurs at tumor suppressor gene loci in human cancer. Arrays are now being used to study DNA methylation at a large number of loci; for example, the Illumina GoldenGate platform assesses DNA methylation at 1505 loci associated with over 800 cancer-related genes. Model-based cluster analysis is often used to identify DNA methylation subgroups in data, but it is unclear how to cluster DNA methylation data from arrays in a scalable and reliable manner. Results We propose a novel model-based recursive-partitioning algorithm to navigate clusters in a beta mixture model. We present simulations that show that the method is more reliable than competing nonparametric clustering approaches, and is at least as reliable as conventional mixture model methods. We also show that our proposed method is more computationally efficient than conventional mixture model approaches. We demonstrate our method on the normal tissue samples and show that the clusters are associated with tissue type as well as age. Conclusion Our proposed recursively-partitioned mixture model is an effective and computationally efficient method for clustering DNA methylation data.
Recursive belief manipulation and second-order false-beliefs
DEFF Research Database (Denmark)
Braüner, Torben; Blackburn, Patrick Rowan; Polyanskaya, Irina
2016-01-01
it indicate that a more fundamental *conceptual change* has taken place? In this paper we extend Braüner's hybrid-logical analysis of first-order false-belief tasks to the second-order case, and argue that our analysis supports a version of the conceptual change position.......The literature on first-order false-belief is extensive, but less is known about the second-order case. The ability to handle second-order false-beliefs correctly seems to mark a cognitively significant step, but what is its status? Is it an example of *complexity only* development, or does...
How to Improve Artificial Intelligence through Web
Directory of Open Access Journals (Sweden)
Adrian LUPASC
2005-10-01
Full Text Available Intelligent agents, intelligent software applications and artificial intelligent applications from artificial intelligence service providers maymake their way onto the Web in greater number as adaptive software, dynamic programming languages and Learning Algorithms are introduced intoWeb Services. The evolution of Web architecture may allow intelligent applications to run directly on the Web by introducing XML, RDF and logiclayer. The Intelligent Wireless Web’s significant potential for rapidly completing information transactions may take an important contribution toglobal worker productivity. Artificial intelligence can be defined as the study of the ways in which computers can be made to perform cognitivetasks. Examples of such tasks include understanding natural language statements, recognizing visual patterns or scenes, diagnosing diseases orillnesses, solving mathematical problems, performing financial analyses, learning new procedures for solving problems. The term expert system canbe considered to be a particular type of knowledge-based system. An expert system is a system in which the knowledge is deliberately represented“as it is”. Expert systems are applications that make decisions in real-life situations that would otherwise be performed by a human expert. They areprograms designed to mimic human performance at specialized, constrained problem-solving tasks. They are constructed as a collection of IF-THENproduction rules combined with a reasoning engine that applies those rules, either in a forward or backward direction, to specific problems.
Educational Programs for Intelligence Professionals.
Miller, Jerry P.
1994-01-01
Discusses the need for education programs for competitive intelligence professionals. Highlights include definitions of intelligence functions, focusing on business intelligence; information utilization by decision makers; information sources; competencies for intelligence professionals; and the development of formal education programs. (38…
A New Dimension of Business Intelligence: Location-based Intelligence
Zeljko Panian
2012-01-01
Through the course of this paper we define Locationbased Intelligence (LBI) which is outgrowing from process of amalgamation of geolocation and Business Intelligence. Amalgamating geolocation with traditional Business Intelligence (BI) results in a new dimension of BI named Location-based Intelligence. LBI is defined as leveraging unified location information for business intelligence. Collectively, enterprises can transform location data into business intelligence applic...
Business Intelligence Issues for Sustainability Projects
Directory of Open Access Journals (Sweden)
Mihaela Muntean
2018-01-01
Full Text Available Business intelligence (BI is an umbrella term for strategies, technologies, and information systems used by the companies to extract from large and various data, according to the value chain, relevant knowledge to support a wide range of operational, tactical, and strategic business decisions. Sustainability, as an integrated part of the corporate business, implies the integration of the new approach at all levels: business model, performance management system, business intelligence project, and data model. Both business intelligence issues presented in this paper represent the contribution of the author in modeling data for supporting further BI approaches in corporate sustainability initiatives. Multi-dimensional modeling has been used to ground the proposals and to introduce the key performance indicators. The démarche is strengthened with implementation aspects and reporting examples. More than ever, in the Big Data era, bringing together business intelligence methods and tools with corporate sustainability is recommended.
Vision Guided Intelligent Robot Design And Experiments
Slutzky, G. D.; Hall, E. L.
1988-02-01
The concept of an intelligent robot is an important topic combining sensors, manipulators, and artificial intelligence to design a useful machine. Vision systems, tactile sensors, proximity switches and other sensors provide the elements necessary for simple game playing as well as industrial applications. These sensors permit adaption to a changing environment. The AI techniques permit advanced forms of decision making, adaptive responses, and learning while the manipulator provides the ability to perform various tasks. Computer languages such as LISP and OPS5, have been utilized to achieve expert systems approaches in solving real world problems. The purpose of this paper is to describe several examples of visually guided intelligent robots including both stationary and mobile robots. Demonstrations will be presented of a system for constructing and solving a popular peg game, a robot lawn mower, and a box stacking robot. The experience gained from these and other systems provide insight into what may be realistically expected from the next generation of intelligent machines.
New challenges in computational collective intelligence
Energy Technology Data Exchange (ETDEWEB)
Nguyen, Ngoc Thanh; Katarzyniak, Radoslaw Piotr [Wroclaw Univ. of Technology (Poland). Inst. of Informatics; Janiak, Adam (eds.) [Wroclaw Univ. of Technology (Poland). Inst. of Computer Engineering, Control and Robotics
2009-07-01
The book consists of 29 chapters which have been selected and invited from the submissions to the 1{sup st} International Conference on Collective Intelligence - Semantic Web, Social Networks and Multiagent Systems (ICCCI 2009). All chapters in the book discuss various examples of applications of computational collective intelligence and related technologies to such fields as semantic web, information systems ontologies, social networks, agent and multiagent systems. The editors hope that the book can be useful for graduate and Ph.D. students in Computer Science, in particular participants to courses on Soft Computing, Multi-Agent Systems and Robotics. This book can also be useful for researchers working on the concept of computational collective intelligence in artificial populations. It is the hope of the editors that readers of this volume can find many inspiring ideas and use them to create new cases intelligent collectives. Many such challenges are suggested by particular approaches and models presented in particular chapters of this book. (orig.)
Computational intelligence, medicine and biology selected links
Zaitseva, Elena
2015-01-01
This book contains an interesting and state-of the art collection of chapters presenting several examples of attempts to developing modern tools utilizing computational intelligence in different real life problems encountered by humans. Reasoning, prediction, modeling, optimization, decision making, etc. need modern, soft and intelligent algorithms, methods and methodologies to solve, in the efficient ways, problems appearing in human activity. The contents of the book is divided into two parts. Part I, consisting of four chapters, is devoted to selected links of computational intelligence, medicine, health care and biomechanics. Several problems are considered: estimation of healthcare system reliability, classification of ultrasound thyroid images, application of fuzzy logic to measure weight status and central fatness, and deriving kinematics directly from video records. Part II, also consisting of four chapters, is devoted to selected links of computational intelligence and biology. The common denominato...
Energy Technology Data Exchange (ETDEWEB)
AlperEker; Mark Giammattia; Paul Houpt; Aditya Kumar; Oscar Montero; Minesh Shah; Norberto Silvi; Timothy Cribbs
2003-04-24
''Intelligent Extruder'' described in this report is a software system and associated support services for monitoring and control of compounding extruders to improve material quality, reduce waste and energy use, with minimal addition of new sensors or changes to the factory floor system components. Emphasis is on process improvements to the mixing, melting and de-volatilization of base resins, fillers, pigments, fire retardants and other additives in the :finishing'' stage of high value added engineering polymer materials. While GE Plastics materials were used for experimental studies throughout the program, the concepts and principles are broadly applicable to other manufacturers materials. The project involved a joint collaboration among GE Global Research, GE Industrial Systems and Coperion Werner & Pleiderer, USA, a major manufacturer of compounding equipment. Scope of the program included development of a algorithms for monitoring process material viscosity without rheological sensors or generating waste streams, a novel detection scheme for rapid detection of process upsets and an adaptive feedback control system to compensate for process upsets where at line adjustments are feasible. Software algorithms were implemented and tested on a laboratory scale extruder (50 lb/hr) at GE Global Research and data from a production scale system (2000 lb/hr) at GE Plastics was used to validate the monitoring and detection software. Although not evaluated experimentally, a new concept for extruder process monitoring through estimation of high frequency drive torque without strain gauges is developed and demonstrated in simulation. A plan to commercialize the software system is outlined, but commercialization has not been completed.
Li, Jing; Ma, Sujuan; Ma, Linqing
Firstly, in this article, we expound the theory of the educational games and multiple intelligence and analyze the relationship between them. Then, further, we elaborate educational games' effect on the development of students' multiple intelligence, taking logic-mathematics intelligence for example. Also, we discuss the strategies of using educational games to improve students' intelligence. In a word, we can use the computer games to develop the students' multi-intelligence.
Intelligent Mission Controller Node
National Research Council Canada - National Science Library
Perme, David
2002-01-01
The goal of the Intelligent Mission Controller Node (IMCN) project was to improve the process of translating mission taskings between real-world Command, Control, Communications, Computers, and Intelligence (C41...
Algorithms in ambient intelligence
Aarts, E.H.L.; Korst, J.H.M.; Verhaegh, W.F.J.; Verhaegh, W.F.J.; Aarts, E.H.L.; Korst, J.H.M.
2004-01-01
In this chapter, we discuss the new paradigm for user-centered computing known as ambient intelligence and its relation with methods and techniques from the field of computational intelligence, including problem solving, machine learning, and expert systems.
Ryoo, Young; Jang, Moon-soo; Bae, Young-Chul
2014-01-01
Intelligent systems have been initiated with the attempt to imitate the human brain. People wish to let machines perform intelligent works. Many techniques of intelligent systems are based on artificial intelligence. According to changing and novel requirements, the advanced intelligent systems cover a wide spectrum: big data processing, intelligent control, advanced robotics, artificial intelligence and machine learning. This book focuses on coordinating intelligent systems with highly integrated and foundationally functional components. The book consists of 19 contributions that features social network-based recommender systems, application of fuzzy enforcement, energy visualization, ultrasonic muscular thickness measurement, regional analysis and predictive modeling, analysis of 3D polygon data, blood pressure estimation system, fuzzy human model, fuzzy ultrasonic imaging method, ultrasonic mobile smart technology, pseudo-normal image synthesis, subspace classifier, mobile object tracking, standing-up moti...
Static models, recursive estimators and the zero-variance approach
Rubino, Gerardo
2016-01-07
When evaluating dependability aspects of complex systems, most models belong to the static world, where time is not an explicit variable. These models suffer from the same problems than dynamic ones (stochastic processes), such as the frequent combinatorial explosion of the state spaces. In the Monte Carlo domain, on of the most significant difficulties is the rare event situation. In this talk, we describe this context and a recent technique that appears to be at the top performance level in the area, where we combined ideas that lead to very fast estimation procedures with another approach called zero-variance approximation. Both ideas produced a very efficient method that has the right theoretical property concerning robustness, the Bounded Relative Error one. Some examples illustrate the results.
Tool path strategy and cutting process monitoring in intelligent machining
Chen, Ming; Wang, Chengdong; An, Qinglong; Ming, Weiwei
2018-06-01
Intelligent machining is a current focus in advanced manufacturing technology, and is characterized by high accuracy and efficiency. A central technology of intelligent machining—the cutting process online monitoring and optimization—is urgently needed for mass production. In this research, the cutting process online monitoring and optimization in jet engine impeller machining, cranio-maxillofacial surgery, and hydraulic servo valve deburring are introduced as examples of intelligent machining. Results show that intelligent tool path optimization and cutting process online monitoring are efficient techniques for improving the efficiency, quality, and reliability of machining.
Directory of Open Access Journals (Sweden)
Pengfei Liu
2018-01-01
Full Text Available Traditionally, asphalt pavements are considered as linear elastic materials in finite element (FE method to save computational time for engineering design. However, asphalt mixture exhibits linear viscoelasticity at small strain and low temperature. Therefore, the results derived from the elastic analysis will inevitably lead to discrepancies from reality. Currently, several FE programs have already adopted viscoelasticity, but the high hardware demands and long execution times render them suitable primarily for research purposes. Semianalytical finite element method (SAFEM was proposed to solve the abovementioned problem. The SAFEM is a three-dimensional FE algorithm that only requires a two-dimensional mesh by incorporating the Fourier series in the third dimension, which can significantly reduce the computational time. This paper describes the development of SAFEM to capture the viscoelastic property of asphalt pavements by using a recursive formulation. The formulation is verified by comparison with the commercial FE software ABAQUS. An application example is presented for simulations of creep deformation of the asphalt pavement. The investigation shows that the SAFEM is an efficient tool for pavement engineers to fast and reliably predict asphalt pavement responses; furthermore, the SAFEM provides a flexible, robust platform for the future development in the numerical simulation of asphalt pavements.
Video Analytics for Business Intelligence
Porikli, Fatih; Xiang, Tao; Gong, Shaogang
2012-01-01
Closed Circuit TeleVision (CCTV) cameras have been increasingly deployed pervasively in public spaces including retail centres and shopping malls. Intelligent video analytics aims to automatically analyze content of massive amount of public space video data and has been one of the most active areas of computer vision research in the last two decades. Current focus of video analytics research has been largely on detecting alarm events and abnormal behaviours for public safety and security applications. However, increasingly CCTV installations have also been exploited for gathering and analyzing business intelligence information, in order to enhance marketing and operational efficiency. For example, in retail environments, surveillance cameras can be utilised to collect statistical information about shopping behaviour and preference for marketing (e.g., how many people entered a shop; how many females/males or which age groups of people showed interests to a particular product; how long did they stay in the sho...
Lansaw, John; Schmalzel, John; Figueroa, Jorge
2009-01-01
John C. Stennis Space Center (SSC) provides rocket engine propulsion testing for NASA's space programs. Since the development of the Space Shuttle, every Space Shuttle Main Engine (SSME) has undergone acceptance testing at SSC before going to Kennedy Space Center (KSC) for integration into the Space Shuttle. The SSME is a large cryogenic rocket engine that uses Liquid Hydrogen (LH2) as the fuel. As NASA moves to the new ARES V launch system, the main engines on the new vehicle, as well as the upper stage engine, are currently base lined to be cryogenic rocket engines that will also use LH2. The main rocket engines for the ARES V will be larger than the SSME, while the upper stage engine will be approximately half that size. As a result, significant quantities of hydrogen will be required during the development, testing, and operation of these rocket engines.Better approaches are needed to simplify sensor integration and help reduce life-cycle costs. 1.Smarter sensors. Sensor integration should be a matter of "plug-and-play" making sensors easier to add to a system. Sensors that implement new standards can help address this problem; for example, IEEE STD 1451.4 defines transducer electronic data sheet (TEDS) templates for commonly used sensors such as bridge elements and thermocouples. When a 1451.4 compliant smart sensor is connected to a system that can read the TEDS memory, all information needed to configure the data acquisition system can be uploaded. This reduces the amount of labor required and helps minimize configuration errors. 2.Intelligent sensors. Data received from a sensor be scaled, linearized; and converted to engineering units. Methods to reduce sensor processing overhead at the application node are needed. Smart sensors using low-cost microprocessors with integral data acquisition and communication support offer the means to add these capabilities. Once a processor is embedded, other features can be added; for example, intelligent sensors can make
Artificial Intelligence Project
1990-01-01
Symposium on Aritificial Intelligence and Software Engineering Working Notes, March 1989. Blumenthal, Brad, "An Architecture for Automating...Artificial Intelligence Project Final Technical Report ARO Contract: DAAG29-84-K-OGO Artificial Intelligence LaboratO"ry The University of Texas at...Austin N>.. ~ ~ JA 1/I 1991 n~~~ Austin, Texas 78712 ________k A,.tificial Intelligence Project i Final Technical Report ARO Contract: DAAG29-84-K-0060
Orchestrating Multiple Intelligences
Moran, Seana; Kornhaber, Mindy; Gardner, Howard
2006-01-01
Education policymakers often go astray when they attempt to integrate multiple intelligences theory into schools, according to the originator of the theory, Howard Gardner, and his colleagues. The greatest potential of a multiple intelligences approach to education grows from the concept of a profile of intelligences. Each learner's intelligence…
Reflection on robotic intelligence
Bartneck, C.
2006-01-01
This paper reflects on the development or robots, both their physical shape as well as their intelligence. The later strongly depends on the progress made in the artificial intelligence (AI) community which does not yet provide the models and tools necessary to create intelligent robots. It is time
Discrete event simulation in an artificial intelligence environment: Some examples
International Nuclear Information System (INIS)
Roberts, D.J.; Farish, T.
1991-01-01
Several Los Alamos National Laboratory (LANL) object-oriented discrete-event simulation efforts have been completed during the past three years. One of these systems has been put into production and has a growing customer base. Another (started two years earlier than the first project) was completed but has not yet been used. This paper will describe these simulation projects. Factors which were pertinent to the success of the one project, and to the failure of the second project will be discussed (success will be measured as the extent to which the simulation model was used as originally intended). 5 figs
Increasing Organizational Productivity Through Heightened Emotional Intelligence.
Maulding, Wanda S.
According to psychologist Daniel Goleman, a strong IQ can set the baseline for success but does not guarantee prosperity. Goleman believes that factors contributing to "emotional intelligence" (for example, self-control, zeal and persistence, and ability to motivate oneself) are key to success in the corporate world. Howard Gardner has…
Business Intelligence: Magnum B.I.
Briggs, Linda L.
2007-01-01
Business intelligence (BI) tools offer schools the ability to look beyond a routine statistic, such as what percentage of students have passed a given test. Through data analysis, schools can view specific scores for a select group of students, for example, and compare that data to other groups, classes, or teachers. That is the kind of…
Artificial Intelligence Applications to Fire Management
Don J. Latham
1987-01-01
Artificial intelligence could be used in Forest Service fire management and land-use planning to a larger degree than is now done. Robots, for example, could be programmed to monitor for fire and insect activity, to keep track of wildlife, and to do elementary thinking about the environment. Catching up with the fast-changing technology is imperative.
DEFF Research Database (Denmark)
Ejlskov, Linda; Wulff, Jesper; Bøggild, Henrik
2017-01-01
and demographic correlates were poor identifiers of loneliness. The regression tree suggested that loneliness was not raised among those with poor mental wellbeing if they identified their partner as closest confidante and had frequent social contact. CONCLUSION: Recursive partitioning can identify which......OBJECTIVES: Improving the design and targeting of interventions is important for alleviating loneliness among older adults. This requires identifying which correlates are the most important predictors of loneliness. This study demonstrates the use of recursive partitioning in exploring...... the characteristics and assessing the relative importance of correlates of loneliness in older adults. METHOD: Using exploratory regression trees and random forests, we examined combinations and the relative importance of 42 correlates in relation to loneliness at age 68 among 2453 participants from the birth cohort...
Berends-Giele recursions and the BCJ duality in superspace and components
Energy Technology Data Exchange (ETDEWEB)
Mafra, Carlos R. [Institute for Advanced Study, School of Natural Sciences,Einstein Drive, Princeton, NJ 08540 (United States); DAMTP, University of Cambridge,Wilberforce Road, Cambridge, CB3 0WA (United Kingdom); Schlotterer, Oliver [Max-Planck-Institut für Gravitationsphysik, Albert-Einstein-Institut,Am Muehlenberg, 14476 Potsdam (Germany)
2016-03-15
The recursive method of Berends and Giele to compute tree-level gluon amplitudes is revisited using the framework of ten-dimensional super Yang-Mills. First, we prove that the pure spinor formula to compute SYM tree amplitudes derived in 2010 reduces to the standard Berends-Giele formula from the 80s when restricted to gluon amplitudes and additionally determine the fermionic completion. Second, using BRST cohomology manipulations in superspace, alternative representations of the component amplitudes are explored and the Bern-Carrasco-Johansson relations among partial tree amplitudes are derived in a novel way. Finally, it is shown how the supersymmetric components of manifestly local BCJ-satisfying tree-level numerators can be computed in a recursive fashion.
International Nuclear Information System (INIS)
Damek, Nawel; Kamoun, Samira
2011-01-01
In this communication, two recursive parametric estimation algorithms are analyzed and applied to an squirrelcage asynchronous machine located at the research ''Unit of Automatic Control'' (UCA) at ENIS. The first algorithm which, use the transfer matrix mathematical model, is based on the gradient principle. The second algorithm, which use the state-space mathematical model, is based on the minimization of the estimation error. These algorithms are applied as a key technique to estimate asynchronous machine with unknown, but constant or timevarying parameters. Stator voltage and current are used as measured data. The proposed recursive parametric estimation algorithms are validated on the experimental data of an asynchronous machine under normal operating condition as full load. The results show that these algorithms can estimate effectively the machine parameters with reliability.
A Recursive Formula for the Evaluation of Earth Return Impedance on Buried Cables
Directory of Open Access Journals (Sweden)
Reynaldo Iracheta
2015-09-01
Full Text Available This paper presents an alternative solution based on infinite series for the accurate and efficient evaluation of cable earth return impedances. This method uses Wedepohl and Wilcox’s transformation to decompose Pollaczek’s integral in a set of Bessel functions and a definite integral. The main feature of Bessel functions is that they are easy to compute in modern mathematical software tools such as Matlab. The main contributions of this paper are the approximation of the definite integral by an infinite series, since it does not have analytical solution; and its numerical solution by means of a recursive formula. The accuracy and efficiency of this recursive formula is compared against the numerical integration method for a broad range of frequencies and cable configurations. Finally, the proposed method is used as a subroutine for cable parameter calculation in the inverse Numerical Laplace Transform (NLT to obtain accurate transient responses in the time domain.
Symmetries and recursion operators of variable coefficient Korteweg-de Vries equations
International Nuclear Information System (INIS)
Baby, B.V.
1987-01-01
The infinitely many symmetries and recursion operators are constructed for two recently introduced variable coefficient Korteweg-de Vries equations, u t +αt n uu x +βt 2n+1 u xxx =0 and v t +βt 2n+1 (v 3 -6vv x )+(n+1)/t(xv x +2v)=0. The recursion operators are developed from Lax-pairs and this method is extended to nonisospectral problems. Olver's method of finding the existence of infinitely many symmetries for an evolution equation is found to be true for the nonisospectral case. It is found that the minimum number of different infinite sets of symmetries is the same as the number of independent similarity transformation groups associated with the given evolution equation. The relation between Painleve property and symmetries is also discussed in this paper. (author). 29 refs
Explicit flow equations and recursion operator of the ncKP hierarchy
International Nuclear Information System (INIS)
He, Jingsong; Wang, Lihong; Tu, Junyi; Li, Xiaodong
2011-01-01
The explicit expression of the flow equations of the noncommutative Kadomtsev–Petviashvili (ncKP) hierarchy is derived. Compared with the flow equations of the KP hierarchy, our result shows that the additional terms in the flow equations of the ncKP hierarchy indeed consist of commutators of dynamical coordinates {u i }. The recursion operator for the flow equations under n-reduction is presented. Further, under 2-reduction, we calculate a nonlocal recursion operator Φ(2) of the noncommutative Korteweg–de Vries(ncKdV) hierarchy, which generates a hierarchy of local, higher-order flows. Thus we solve the open problem proposed by Olver and Sokolov (1998 Commun. Math. Phys. 193 245–68)
Kelly, D. A.; Fermelia, A.; Lee, G. K. F.
1990-01-01
An adaptive Kalman filter design that utilizes recursive maximum likelihood parameter identification is discussed. At the center of this design is the Kalman filter itself, which has the responsibility for attitude determination. At the same time, the identification algorithm is continually identifying the system parameters. The approach is applicable to nonlinear, as well as linear systems. This adaptive Kalman filter design has much potential for real time implementation, especially considering the fast clock speeds, cache memory and internal RAM available today. The recursive maximum likelihood algorithm is discussed in detail, with special attention directed towards its unique matrix formulation. The procedure for using the algorithm is described along with comments on how this algorithm interacts with the Kalman filter.
Recursive construction of (J,L (J,L QC LDPC codes with girth 6
Directory of Open Access Journals (Sweden)
Mohammad Gholami
2016-06-01
Full Text Available In this paper, a recursive algorithm is presented to generate some exponent matrices which correspond to Tanner graphs with girth at least 6. For a J×L J×L exponent matrix E E, the lower bound Q(E Q(E is obtained explicitly such that (J,L (J,L QC LDPC codes with girth at least 6 exist for any circulant permutation matrix (CPM size m≥Q(E m≥Q(E. The results show that the exponent matrices constructed with our recursive algorithm have smaller lower-bound than the ones proposed recently with girth 6
Kazemi, Mahdi; Arefi, Mohammad Mehdi
2017-03-01
In this paper, an online identification algorithm is presented for nonlinear systems in the presence of output colored noise. The proposed method is based on extended recursive least squares (ERLS) algorithm, where the identified system is in polynomial Wiener form. To this end, an unknown intermediate signal is estimated by using an inner iterative algorithm. The iterative recursive algorithm adaptively modifies the vector of parameters of the presented Wiener model when the system parameters vary. In addition, to increase the robustness of the proposed method against variations, a robust RLS algorithm is applied to the model. Simulation results are provided to show the effectiveness of the proposed approach. Results confirm that the proposed method has fast convergence rate with robust characteristics, which increases the efficiency of the proposed model and identification approach. For instance, the FIT criterion will be achieved 92% in CSTR process where about 400 data is used. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.
A novel intrusion detection method based on OCSVM and K-means recursive clustering
Directory of Open Access Journals (Sweden)
Leandros A. Maglaras
2015-01-01
Full Text Available In this paper we present an intrusion detection module capable of detecting malicious network traffic in a SCADA (Supervisory Control and Data Acquisition system, based on the combination of One-Class Support Vector Machine (OCSVM with RBF kernel and recursive k-means clustering. Important parameters of OCSVM, such as Gaussian width o and parameter v affect the performance of the classifier. Tuning of these parameters is of great importance in order to avoid false positives and over fitting. The combination of OCSVM with recursive k- means clustering leads the proposed intrusion detection module to distinguish real alarms from possible attacks regardless of the values of parameters o and v, making it ideal for real-time intrusion detection mechanisms for SCADA systems. Extensive simulations have been conducted with datasets extracted from small and medium sized HTB SCADA testbeds, in order to compare the accuracy, false alarm rate and execution time against the base line OCSVM method.
Recursive approach for non-Markovian time-convolutionless master equations
Gasbarri, G.; Ferialdi, L.
2018-02-01
We consider a general open system dynamics and we provide a recursive method to derive the associated non-Markovian master equation in a perturbative series. The approach relies on a momenta expansion of the open system evolution. Unlike previous perturbative approaches of this kind, the method presented in this paper provides a recursive definition of each perturbative term. Furthermore, we give an intuitive diagrammatic description of each term of the series, which provides a useful analytical tool to build them and to derive their structure in terms of commutators and anticommutators. We eventually apply our formalism to the evolution of the observables of the reduced system, by showing how the method can be applied to the adjoint master equation, and by developing a diagrammatic description of the associated series.
A self-applicable online partial evaluator for recursive flowchart languages
DEFF Research Database (Denmark)
Glück, Robert
2012-01-01
This paper describes a self-applicable online partial evaluator for a ¿owchart language with recursive calls. Self-application of the partial evaluator yields generating extensions that are as ef¿cient as those reported in the literature for of¿ine partial evaluation. This result is remarkable...... because it has been assumed that online partial evaluation techniques unavoidably lead to inef¿cient and overgeneralized generating extensions. The purpose of this paper is not to determine which kind of partial evaluation is better, but to show how the problem can be solved by recursive polyvariant...... specialization. The design of the self-applicable online partial evaluator is based on a number of known techniques, but by combining them in a new way this result can be produced. The partial evaluator, its techniques, and its implementation are presented in full. Self-application according to all three...
Berends-Giele recursions and the BCJ duality in superspace and components
International Nuclear Information System (INIS)
Mafra, Carlos R.; Schlotterer, Oliver
2016-01-01
The recursive method of Berends and Giele to compute tree-level gluon amplitudes is revisited using the framework of ten-dimensional super Yang-Mills. First, we prove that the pure spinor formula to compute SYM tree amplitudes derived in 2010 reduces to the standard Berends-Giele formula from the 80s when restricted to gluon amplitudes and additionally determine the fermionic completion. Second, using BRST cohomology manipulations in superspace, alternative representations of the component amplitudes are explored and the Bern-Carrasco-Johansson relations among partial tree amplitudes are derived in a novel way. Finally, it is shown how the supersymmetric components of manifestly local BCJ-satisfying tree-level numerators can be computed in a recursive fashion.
QCD amplitudes with 2 initial spacelike legs via generalised BCFW recursion
Energy Technology Data Exchange (ETDEWEB)
Kutak, Krzysztof; Hameren, Andreas van; Serino, Mirko [The H. Niewodniczański Institute of Nuclear Physics, Polish Academy of Sciences, ul. Radzikowskiego 152, 31-342, Cracow (Poland)
2017-02-02
We complete the generalisation of the BCFW recursion relation to the off-shell case, allowing for the computation of tree level scattering amplitudes for full High Energy Factorisation (HEF), i.e. with both incoming partons having a non-vanishing transverse momentum. We provide explicit results for color-ordered amplitudes with two off-shell legs in massless QCD up to 4 point, continuing the program begun in two previous papers. For the 4-fermion amplitudes, which are not BCFW-recursible, we perform a diagrammatic computation, so as to offer a complete set of expressions. We explicitly show and discuss some plots of the squared 2→2 matrix elements as functions of the differences in rapidity and azimuthal angle of the final state particles.
CP-recursion and the derivation of verb second in Germanic main and embedded clauses
DEFF Research Database (Denmark)
Vikner, Sten
2017-01-01
, this is normally not the case for all types of embedded clauses, as e. g. embedded questions (almost) never allow V2 (Julien 2007, Vikner 2001, though see McCloskey 2006 and Biberauer 2015). As in Nyvad et al. (2016), I will explore a particular derivation of (embedded) V2, in terms of a cP/CP-distinction, which...... may be seen as a version of the CP-recursion analysis (deHaan & Weerman 1986, Vikner 1995 and many others). The idea is that because embedded V2 clauses do not allow extraction, whereas other types of CP-recursion clauses do (Christensen et al. 2013a; Christensen et al. 2013b; Christensen & Nyvad 2014...
Recursive parameter estimation for Hammerstein-Wiener systems using modified EKF algorithm.
Yu, Feng; Mao, Zhizhong; Yuan, Ping; He, Dakuo; Jia, Mingxing
2017-09-01
This paper focuses on the recursive parameter estimation for the single input single output Hammerstein-Wiener system model, and the study is then extended to a rarely mentioned multiple input single output Hammerstein-Wiener system. Inspired by the extended Kalman filter algorithm, two basic recursive algorithms are derived from the first and the second order Taylor approximation. Based on the form of the first order approximation algorithm, a modified algorithm with larger parameter convergence domain is proposed to cope with the problem of small parameter convergence domain of the first order one and the application limit of the second order one. The validity of the modification on the expansion of convergence domain is shown from the convergence analysis and is demonstrated with two simulation cases. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.
Recursive estimation of the claim rates and sizes in an insurance model
Directory of Open Access Journals (Sweden)
Lakhdar Aggoun
2004-01-01
Full Text Available It is a common fact that for most classes of general insurance, many possible sources of heterogeneity of risk exist. Premium rates based on information from a heterogeneous portfolio might be quite inadequate. One way of reducing this danger is by grouping policies according to the different levels of the various risk factors involved. Using measure change techniques, we derive recursive filters and predictors for the claim rates and claim sizes for the different groups.
Separating the Classes of Recursively Enumerable Languages Based on Machine Size
Czech Academy of Sciences Publication Activity Database
van Leeuwen, J.; Wiedermann, Jiří
2015-01-01
Roč. 26, č. 6 (2015), s. 677-695 ISSN 0129-0541 R&D Projects: GA ČR GAP202/10/1333 Grant - others:GA ČR(CZ) GA15-04960S Institutional support: RVO:67985807 Keywords : recursively enumerable languages * RE hierarchy * finite languages * machine size * descriptional complexity * Turing machines with advice Subject RIV: IN - Informatics, Computer Science Impact factor: 0.467, year: 2015
Recursive estimation of high-order Markov chains: Approximation by finite mixtures
Czech Academy of Sciences Publication Activity Database
Kárný, Miroslav
2016-01-01
Roč. 326, č. 1 (2016), s. 188-201 ISSN 0020-0255 R&D Projects : GA ČR GA13-13502S Institutional support: RVO:67985556 Keywords : Markov chain * Approximate parameter estimation * Bayesian recursive estimation * Adaptive systems * Kullback–Leibler divergence * Forgetting Subject RIV: BC - Control Systems Theory Impact factor: 4.832, year: 2016 http://library.utia.cas.cz/separaty/2015/AS/karny-0447119.pdf
Numerical solution of recirculating flow by a simple finite element recursion relation
Energy Technology Data Exchange (ETDEWEB)
Pepper, D W; Cooper, R E
1980-01-01
A time-split finite element recursion relation, based on linear basis functions, is used to solve the two-dimensional equations of motion. Recirculating flow in a rectangular cavity and free convective flow in an enclosed container are analyzed. The relation has the advantage of finite element accuracy and finite difference speed and simplicity. Incorporating dissipation parameters in the functionals decreases numerical dispersion and improves phase lag.
All-Pole Recursive Digital Filters Design Based on Ultraspherical Polynomials
N. Stojanovic; N. Stamenkovic; V. Stojanovic
2014-01-01
A simple method for approximation of all-pole recursive digital filters, directly in digital domain, is described. Transfer function of these filters, referred to as Ultraspherical filters, is controlled by order of the Ultraspherical polynomial, nu. Parameter nu, restricted to be a nonnegative real number (nu ≥ 0), controls ripple peaks in the passband of the magnitude response and enables a trade-off between the passband loss and the group delay response of the resulting filter. Chebyshev f...
Local Stability Conditions for Two Types of Monetary Models with Recursive Utility
Miyazaki, Kenji; Utsunomiya, Hitoshi
2009-01-01
This paper explores local stability conditions for money-in-utility-function (MIUF) and transaction-costs (TC) models with recursive utility.A monetary variant of the Brock-Gale condition provides a theoretical justification of the comparative statics analysis. One of sufficient conditions for local stability is increasing marginal impatience (IMI) in consumption and money. However, this does not deny the possibility of decreasing marginal impatience (DMI). The local stability with DMI is mor...
Sumiyana, Sumiyana; Baridwan, Zaki
2015-01-01
This study investigates association between accounting fundamentals and variations of stock prices using recursive simultaneous equation model. The accounting fundamentalsconsist of earnings yield, book value, profitability, growth opportunities and discount rate. The prior single relationships model has been investigated by Chen and Zhang (2007),Sumiyana (2011) and Sumiyana et al. (2010). They assume that all accounting fundamentals associate direct-linearly to the stock returns. This study ...
Sumiyana, Sumiyana; Baridwan, Zaki
2013-01-01
This study investigates association between accounting fundamentals and variations of stock prices using recursive simultaneous equation model. The accounting fundamentalsconsist of earnings yield, book value, profitability, growth opportunities and discount rate. The prior single relationships model has been investigated by Chen and Zhang (2007),Sumiyana (2011) and Sumiyana et al. (2010). They assume that all accounting fundamentals associate direct-linearly to the stock returns. This study ...
Nobuoki, Eshima; Minoru, Tabata; Geng, Zhi; Department of Medical Information Analysis, Faculty of Medicine, Oita Medical University; Department of Applied Mathematics, Faculty of Engineering, Kobe University; Department of Probability and Statistics, Peking University
2001-01-01
This paper discusses path analysis of categorical variables with logistic regression models. The total, direct and indirect effects in fully recursive causal systems are considered by using model parameters. These effects can be explained in terms of log odds ratios, uncertainty differences, and an inner product of explanatory variables and a response variable. A study on food choice of alligators as a numerical exampleis reanalysed to illustrate the present approach.
A new term in the recursive expansion of the inverse Baker-Campbell-Hausdorff formula
International Nuclear Information System (INIS)
Riccardi, A.
1984-01-01
A recursive algorithm is derived, allowing the expansion in lambda of z=exp(x+lambda y) for noncommuting x and y, written as ordered product of exponentials. Such an expansion is the inverse of the usual Baker-Campbell-Hausdorff formula. The explicit form of the terms, up to third order in lambda is also given. The same method provides the explicit expansion to any order for the matrix elements of z
Directory of Open Access Journals (Sweden)
Yu. D. Gensitskiy
2015-12-01
Full Text Available Purpose. Understanding the philosophical and anthropological importance of the development the artificial intelligence systems requires the analysis of the socio and anthropological content of intercomputer problems of interaction in the context of media philosophical praxis, anthropological maintenance of intellect nature, considering the specifics of the concept of artificial intelligence systems in the environment of M2M development of socio-cognitive practices of intercomputer interaction of social and humanitarian potential. Methodology. The implementation target is seen in the use of scientific and theoretical basis of the media philosophical, philosophical anthropology, the media philosophical approach to understanding society, science and technology, the use of publications on selected topics of research. Scientific novelty. The concept of artificial intelligence systems in the aspect of social and humanitarian potential of their formation and development in the environment of M2M was considered. The problems of machine learning as technology transformation M2M were analysed. The anthropological threats to the development of artificially created intelligent systems were defined. Conclusions. From the global risks point of view, one of the most critical circumstances due to the artificial intelligent system can strengthen its intelligence very quickly. The obvious reason for suspecting such an opportunity – a recursive self-improvement. Such system becomes smarter, including the intelligent writing of internal cognitive function, that the ability to rewrite their existing cognitive function to make it work better. This will make such systems more intelligent, and smarter in terms of the processing itself. The success of artificial intelligence may be the beginning of the end of the human race. Almost any technology falling into malicious hands reveals the potential for harm, but when it comes to artificial intelligent system, there is a
International Nuclear Information System (INIS)
Abadi, Mohammad Tahaye
2015-01-01
A recursive solution method is derived for the transient response of one-dimensional structures subjected to the general form of time dependent boundary conditions. Unlike previous solution methods that assumed the separation of variables, the present method involves formulating and solving the dynamic problems using the summation of two single-argument functions satisfying the motion equation. Based on boundary and initial conditions, a recursive procedure is derived to determine the single-argument functions. Such a procedure is applied to the general form of boundary conditions, and an analytical solution is derived by solving the recursive equation. The present solution method is implemented for base excitation problems, and the results are compared with those of the previous analytical solution and the Finite element (FE) analysis. The FE results converge to the present analytical solution, although considerable error is found in predicting a solution method on the basis of the separation of variables. The present analytical solution predicts the transient response for wave propagation problems in broadband excitation frequencies.
Energy Technology Data Exchange (ETDEWEB)
Abadi, Mohammad Tahaye [Aerospace Research Institute, Tehran (Iran, Islamic Republic of)
2015-10-15
A recursive solution method is derived for the transient response of one-dimensional structures subjected to the general form of time dependent boundary conditions. Unlike previous solution methods that assumed the separation of variables, the present method involves formulating and solving the dynamic problems using the summation of two single-argument functions satisfying the motion equation. Based on boundary and initial conditions, a recursive procedure is derived to determine the single-argument functions. Such a procedure is applied to the general form of boundary conditions, and an analytical solution is derived by solving the recursive equation. The present solution method is implemented for base excitation problems, and the results are compared with those of the previous analytical solution and the Finite element (FE) analysis. The FE results converge to the present analytical solution, although considerable error is found in predicting a solution method on the basis of the separation of variables. The present analytical solution predicts the transient response for wave propagation problems in broadband excitation frequencies.
Social intelligence, human intelligence and niche construction.
Sterelny, Kim
2007-04-29
This paper is about the evolution of hominin intelligence. I agree with defenders of the social intelligence hypothesis in thinking that externalist models of hominin intelligence are not plausible: such models cannot explain the unique cognition and cooperation explosion in our lineage, for changes in the external environment (e.g. increasing environmental unpredictability) affect many lineages. Both the social intelligence hypothesis and the social intelligence-ecological complexity hybrid I outline here are niche construction models. Hominin evolution is hominin response to selective environments that earlier hominins have made. In contrast to social intelligence models, I argue that hominins have both created and responded to a unique foraging mode; a mode that is both social in itself and which has further effects on hominin social environments. In contrast to some social intelligence models, on this view, hominin encounters with their ecological environments continue to have profound selective effects. However, though the ecological environment selects, it does not select on its own. Accidents and their consequences, differential success and failure, result from the combination of the ecological environment an agent faces and the social features that enhance some opportunities and suppress others and that exacerbate some dangers and lessen others. Individuals do not face the ecological filters on their environment alone, but with others, and with the technology, information and misinformation that their social world provides.
DEFF Research Database (Denmark)
2016-01-01
An example of how to use the magni.reproducibility package for storing metadata along with results from a computational experiment. The example is based on simulating the Mandelbrot set.......An example of how to use the magni.reproducibility package for storing metadata along with results from a computational experiment. The example is based on simulating the Mandelbrot set....
Quality control of intelligence research
International Nuclear Information System (INIS)
Lu Yan; Xin Pingping; Wu Jian
2014-01-01
Quality control of intelligence research is the core issue of intelligence management, is a problem in study of information science This paper focuses on the performance of intelligence to explain the significance of intelligence research quality control. In summing up the results of the study on the basis of the analysis, discusses quality control methods in intelligence research, introduces the experience of foreign intelligence research quality control, proposes some recommendations to improve quality control in intelligence research. (authors)
Epistasis analysis using artificial intelligence.
Moore, Jason H; Hill, Doug P
2015-01-01
Here we introduce artificial intelligence (AI) methodology for detecting and characterizing epistasis in genetic association studies. The ultimate goal of our AI strategy is to analyze genome-wide genetics data as a human would using sources of expert knowledge as a guide. The methodology presented here is based on computational evolution, which is a type of genetic programming. The ability to generate interesting solutions while at the same time learning how to solve the problem at hand distinguishes computational evolution from other genetic programming approaches. We provide a general overview of this approach and then present a few examples of its application to real data.
International Nuclear Information System (INIS)
Alkhatib, Sari F.; Park, Chang Je; Jeong, Hae Yong; Lee, Yongdeok
2016-01-01
Highlights: • A simple formalism is suggested for the recursive approach and then it is used to produce buildup factors for certain multilayer shields. • The newly layer-splitting technique is implemented on the studied cases for testing the suggested formalism performance. • The buildup factors are generated using cubic polynomial fitting functions that are produced based on previous well-acknowledge data. - Abstract: This study illustrates the implementation of the newly suggested layer-splitting testing technique. This technique is introduced in order to be implemented in examining suggested formalisms for the recursive scheme (or iterative scheme). The recursive scheme is a concept used in treating and producing the gamma ray buildup factors in the case of multilayer shields. The layer-splitting technique simply enforces the scheme to treat a single layer of one material as two separated layers with similar characteristics. Thus it subjects the scheme to an abnormal definition of the multilayer shield that will test its performance in treating the successive layers. Thus, it will act as a method of verification for the approximations and assumptions taken in consideration. A simple formalism was suggested for the recursive scheme then the splitting technique was implemented on it. The results of implementing both the suggested formalism and the splitting technique are then illustrated and discussed. Throughout this study, cubic polynomial fitting functions were used to generate the data of buildup factors for the basic single-media that constitute the multilayer shields understudy. This study is limited to the cases of multiple shields consisting of repeated consecutive thin layers of lead–water and iron–water shields for 1 MeV gamma rays. The produced results of the buildup factor values through the implementation of the suggested formalism showed good consistency with the Monte Carlo simulation results of Lin and Jiang work. In the implementation of
2018-04-18
simple example? 15. SUBJECT TERMS cybersecurity , cyber defense, autonomous agents, resilience, adversarial intelligence 16. SECURITY CLASSIFICATION...explained” based on other attack sequences (e.g., Kullback–Leibler [K-L] divergence). For example, the DARPA Explainable Artificial Intelligence ...a failure of humanity, not artificial intelligence . The notion of self-guidance approaches the field of robot ethics. How can autonomous agents be
2018-04-01
simple example? 15. SUBJECT TERMS cybersecurity , cyber defense, autonomous agents, resilience, adversarial intelligence 16. SECURITY CLASSIFICATION...explained” based on other attack sequences (e.g., Kullback–Leibler [K-L] divergence). For example, the DARPA Explainable Artificial Intelligence ...a failure of humanity, not artificial intelligence . The notion of self-guidance approaches the field of robot ethics. How can autonomous agents be
Brain Intelligence: Go Beyond Artificial Intelligence
Lu, Huimin; Li, Yujie; Chen, Min; Kim, Hyoungseop; Serikawa, Seiichi
2017-01-01
Artificial intelligence (AI) is an important technology that supports daily social life and economic activities. It contributes greatly to the sustainable growth of Japan's economy and solves various social problems. In recent years, AI has attracted attention as a key for growth in developed countries such as Europe and the United States and developing countries such as China and India. The attention has been focused mainly on developing new artificial intelligence information communication ...
Machine learning an artificial intelligence approach
Banerjee, R; Bradshaw, Gary; Carbonell, Jaime Guillermo; Mitchell, Tom Michael; Michalski, Ryszard Spencer
1983-01-01
Machine Learning: An Artificial Intelligence Approach contains tutorial overviews and research papers representative of trends in the area of machine learning as viewed from an artificial intelligence perspective. The book is organized into six parts. Part I provides an overview of machine learning and explains why machines should learn. Part II covers important issues affecting the design of learning programs-particularly programs that learn from examples. It also describes inductive learning systems. Part III deals with learning by analogy, by experimentation, and from experience. Parts IV a
Intelligent Design versus Evolution
Directory of Open Access Journals (Sweden)
Nathan Aviezer
2010-07-01
Full Text Available Intelligent Design (ID burst onto the scene in 1996, with the publication of Darwin’s Black Box by Michael Behe. Since then, there has been a plethora of articles written about ID, both pro and con. However, most of the articles critical of ID deal with peripheral issues, such as whether ID is just another form of creationism or whether ID qualifies as science or whether ID should be taught in public schools. It is our view that the central issue is whether the basic claim of ID is correct. Our goal is fourfold: (I to show that most of the proposed refutations of ID are unconvincing and/or incorrect, (II to describe the single fundamental error of ID, (III to discuss the historic tradition surrounding the ID controversy, showing that ID is an example of a “god-of-the-gaps” argument, and (IV to place the ID controversy in the larger context of proposed proofs for the existence of God, with the emphasis on Jewish tradition.
Machine intelligence and signal processing
Vatsa, Mayank; Majumdar, Angshul; Kumar, Ajay
2016-01-01
This book comprises chapters on key problems in machine learning and signal processing arenas. The contents of the book are a result of a 2014 Workshop on Machine Intelligence and Signal Processing held at the Indraprastha Institute of Information Technology. Traditionally, signal processing and machine learning were considered to be separate areas of research. However in recent times the two communities are getting closer. In a very abstract fashion, signal processing is the study of operator design. The contributions of signal processing had been to device operators for restoration, compression, etc. Applied Mathematicians were more interested in operator analysis. Nowadays signal processing research is gravitating towards operator learning – instead of designing operators based on heuristics (for example wavelets), the trend is to learn these operators (for example dictionary learning). And thus, the gap between signal processing and machine learning is fast converging. The 2014 Workshop on Machine Intel...
Quo Vadis, Artificial Intelligence?
Berrar, Daniel; Sato, Naoyuki; Schuster, Alfons
2010-01-01
Since its conception in the mid 1950s, artificial intelligence with its great ambition to understand and emulate intelligence in natural and artificial environments alike is now a truly multidisciplinary field that reaches out and is inspired by a great diversity of other fields. Rapid advances in research and technology in various fields have created environments into which artificial intelligence could embed itself naturally and comfortably. Neuroscience with its desire to understand nervou...
Principles of artificial intelligence
Nilsson, Nils J
1980-01-01
A classic introduction to artificial intelligence intended to bridge the gap between theory and practice, Principles of Artificial Intelligence describes fundamental AI ideas that underlie applications such as natural language processing, automatic programming, robotics, machine vision, automatic theorem proving, and intelligent data retrieval. Rather than focusing on the subject matter of the applications, the book is organized around general computational concepts involving the kinds of data structures used, the types of operations performed on the data structures, and the properties of th
Energy Technology Data Exchange (ETDEWEB)
Novak, D
1982-01-01
A general discussion about the level of artificial intelligence in computer programs is presented. The suitability of various languages for the development of complex, intelligent programs is discussed, considering fourth-generation language as well as the well established structured COBOL language. It is concluded that the success of automation in many administrative fields depends to a large extent on the development of intelligent programs.
Intelligence analysis – the royal discipline of Competitive Intelligence
František Bartes
2011-01-01
The aim of this article is to propose work methodology for Competitive Intelligence teams in one of the intelligence cycle’s specific area, in the so-called “Intelligence Analysis”. Intelligence Analysis is one of the stages of the Intelligence Cycle in which data from both the primary and secondary research are analyzed. The main result of the effort is the creation of added value for the information collected. Company Competiitve Intelligence, correctly understood and implemented in busines...
Machine listening intelligence
Cella, C. E.
2017-05-01
This manifesto paper will introduce machine listening intelligence, an integrated research framework for acoustic and musical signals modelling, based on signal processing, deep learning and computational musicology.
STANFORD ARTIFICIAL INTELLIGENCE PROJECT.
ARTIFICIAL INTELLIGENCE , GAME THEORY, DECISION MAKING, BIONICS, AUTOMATA, SPEECH RECOGNITION, GEOMETRIC FORMS, LEARNING MACHINES, MATHEMATICAL MODELS, PATTERN RECOGNITION, SERVOMECHANISMS, SIMULATION, BIBLIOGRAPHIES.
Federal Laboratory Consortium — The Intelligent Optics Laboratory supports sophisticated investigations on adaptive and nonlinear optics; advancedimaging and image processing; ground-to-ground and...
Intelligence and childlessness.
Kanazawa, Satoshi
2014-11-01
Demographers debate why people have children in advanced industrial societies where children are net economic costs. From an evolutionary perspective, however, the important question is why some individuals choose not to have children. Recent theoretical developments in evolutionary psychology suggest that more intelligent individuals may be more likely to prefer to remain childless than less intelligent individuals. Analyses of the National Child Development Study show that more intelligent men and women express preference to remain childless early in their reproductive careers, but only more intelligent women (not more intelligent men) are more likely to remain childless by the end of their reproductive careers. Controlling for education and earnings does not at all attenuate the association between childhood general intelligence and lifetime childlessness among women. One-standard-deviation increase in childhood general intelligence (15 IQ points) decreases women's odds of parenthood by 21-25%. Because women have a greater impact on the average intelligence of future generations, the dysgenic fertility among women is predicted to lead to a decline in the average intelligence of the population in advanced industrial nations. Copyright © 2014 Elsevier Inc. All rights reserved.
Routledge companion to intelligence studies
Dover, Robert; Hillebrand, Claudia
2013-01-01
The Routledge Companion to Intelligence Studies provides a broad overview of the growing field of intelligence studies. The recent growth of interest in intelligence and security studies has led to an increased demand for popular depictions of intelligence and reference works to explain the architecture and underpinnings of intelligence activity. Divided into five comprehensive sections, this Companion provides a strong survey of the cutting-edge research in the field of intelligence studies: Part I: The evolution of intelligence studies; Part II: Abstract approaches to intelligence; Part III: Historical approaches to intelligence; Part IV: Systems of intelligence; Part V: Contemporary challenges. With a broad focus on the origins, practices and nature of intelligence, the book not only addresses classical issues, but also examines topics of recent interest in security studies. The overarching aim is to reveal the rich tapestry of intelligence studies in both a sophisticated and accessible way. This Companion...
Applications of artificial intelligence to scientific research
Prince, Mary Ellen
1986-01-01
Artificial intelligence (AI) is a growing field which is just beginning to make an impact on disciplines other than computer science. While a number of military and commercial applications were undertaken in recent years, few attempts were made to apply AI techniques to basic scientific research. There is no inherent reason for the discrepancy. The characteristics of the problem, rather than its domain, determines whether or not it is suitable for an AI approach. Expert system, intelligent tutoring systems, and learning programs are examples of theoretical topics which can be applied to certain areas of scientific research. Further research and experimentation should eventurally make it possible for computers to act as intelligent assistants to scientists.
Cost-effective implementation of intelligent systems
Lum, Henry, Jr.; Heer, Ewald
1990-01-01
Significant advances have occurred during the last decade in knowledge-based engineering research and knowledge-based system (KBS) demonstrations and evaluations using integrated intelligent system technologies. Performance and simulation data obtained to date in real-time operational environments suggest that cost-effective utilization of intelligent system technologies can be realized. In this paper the rationale and potential benefits for typical examples of application projects that demonstrate an increase in productivity through the use of intelligent system technologies are discussed. These demonstration projects have provided an insight into additional technology needs and cultural barriers which are currently impeding the transition of the technology into operational environments. Proposed methods which addresses technology evolution and implementation are also discussed.
Business intelligence making decisions through data analytics
Surma, Jerzy
2014-01-01
This book is about using business intelligence as a management information system for supporting managerial decision making. It concentrates primarily on practical business issues and demonstrates how to apply data warehousing and data analytics to support business decision making. This book progresses through a logical sequence, starting with data model infrastructure, then data preparation, followed by data analysis, integration, knowledge discovery, and finally the actual use of discovered knowledge. All examples are based on the most recent achievements in business intelligence. Finally this book outlines an overview of a methodology that takes into account the complexity of developing applications in an integrated business intelligence environment. This book is written for managers, business consultants, and undergraduate and postgraduates students in business administration.
Artificial Consciousness or Artificial Intelligence
Spanache Florin
2017-01-01
Artificial intelligence is a tool designed by people for the gratification of their own creative ego, so we can not confuse conscience with intelligence and not even intelligence in its human representation with conscience. They are all different concepts and they have different uses. Philosophically, there are differences between autonomous people and automatic artificial intelligence. This is the difference between intelligence and artificial intelligence, autonomous versus a...
2015 Chinese Intelligent Systems Conference
Du, Junping; Li, Hongbo; Zhang, Weicun; CISC’15
2016-01-01
This book presents selected research papers from the 2015 Chinese Intelligent Systems Conference (CISC’15), held in Yangzhou, China. The topics covered include multi-agent systems, evolutionary computation, artificial intelligence, complex systems, computation intelligence and soft computing, intelligent control, advanced control technology, robotics and applications, intelligent information processing, iterative learning control, and machine learning. Engineers and researchers from academia, industry and the government can gain valuable insights into solutions combining ideas from multiple disciplines in the field of intelligent systems.
Topological recursion for chord diagrams, RNA complexes, and cells in moduli spaces
DEFF Research Database (Denmark)
Andersen, Jørgen Ellegaard; Chekhov, Leonid O.; Penner, Robert
2013-01-01
and free energies are convergent for small t and all s as a perturbation of the Gaussian potential, which arises for st=0. This perturbation is computed using the formalism of the topological recursion. The corresponding enumeration of chord diagrams gives at once the number of RNA complexes of a given...... topology as well as the number of cells in Riemann's moduli spaces for bordered surfaces. The free energies are computed here in principle for all genera and explicitly for genera less than four....
Loop equations and topological recursion for the arbitrary-$\\beta$ two-matrix model
Bergère, Michel; Marchal, Olivier; Prats-Ferrer, Aleix
2012-01-01
We write the loop equations for the $\\beta$ two-matrix model, and we propose a topological recursion algorithm to solve them, order by order in a small parameter. We find that to leading order, the spectral curve is a "quantum" spectral curve, i.e. it is given by a differential operator (instead of an algebraic equation for the hermitian case). Here, we study the case where that quantum spectral curve is completely degenerate, it satisfies a Bethe ansatz, and the spectral curve is the Baxter TQ relation.
Recursive polarization of nuclear spins in diamond at arbitrary magnetic fields
International Nuclear Information System (INIS)
Pagliero, Daniela; Laraoui, Abdelghani; Henshaw, Jacob D.; Meriles, Carlos A.
2014-01-01
We introduce an alternate route to dynamically polarize the nuclear spin host of nitrogen-vacancy (NV) centers in diamond. Our approach articulates optical, microwave, and radio-frequency pulses to recursively transfer spin polarization from the NV electronic spin. Using two complementary variants of the same underlying principle, we demonstrate nitrogen nuclear spin initialization approaching 80% at room temperature both in ensemble and single NV centers. Unlike existing schemes, our approach does not rely on level anti-crossings and is thus applicable at arbitrary magnetic fields. This versatility should prove useful in applications ranging from nanoscale metrology to sensitivity-enhanced NMR
Categorical Semantics for Functional Reactive Programming with Temporal Recursion and Corecursion
Directory of Open Access Journals (Sweden)
Wolfgang Jeltsch
2014-06-01
Full Text Available Functional reactive programming (FRP makes it possible to express temporal aspects of computations in a declarative way. Recently we developed two kinds of categorical models of FRP: abstract process categories (APCs and concrete process categories (CPCs. Furthermore we showed that APCs generalize CPCs. In this paper, we extend APCs with additional structure. This structure models recursion and corecursion operators that are related to time. We show that the resulting categorical models generalize those CPCs that impose an additional constraint on time scales. This constraint boils down to ruling out ω-supertasks, which are closely related to Zeno's paradox of Achilles and the tortoise.
Directory of Open Access Journals (Sweden)
Showe Louise C
2007-05-01
Full Text Available Abstract Background Classification studies using gene expression datasets are usually based on small numbers of samples and tens of thousands of genes. The selection of those genes that are important for distinguishing the different sample classes being compared, poses a challenging problem in high dimensional data analysis. We describe a new procedure for selecting significant genes as recursive cluster elimination (RCE rather than recursive feature elimination (RFE. We have tested this algorithm on six datasets and compared its performance with that of two related classification procedures with RFE. Results We have developed a novel method for selecting significant genes in comparative gene expression studies. This method, which we refer to as SVM-RCE, combines K-means, a clustering method, to identify correlated gene clusters, and Support Vector Machines (SVMs, a supervised machine learning classification method, to identify and score (rank those gene clusters for the purpose of classification. K-means is used initially to group genes into clusters. Recursive cluster elimination (RCE is then applied to iteratively remove those clusters of genes that contribute the least to the classification performance. SVM-RCE identifies the clusters of correlated genes that are most significantly differentially expressed between the sample classes. Utilization of gene clusters, rather than individual genes, enhances the supervised classification accuracy of the same data as compared to the accuracy when either SVM or Penalized Discriminant Analysis (PDA with recursive feature elimination (SVM-RFE and PDA-RFE are used to remove genes based on their individual discriminant weights. Conclusion SVM-RCE provides improved classification accuracy with complex microarray data sets when it is compared to the classification accuracy of the same datasets using either SVM-RFE or PDA-RFE. SVM-RCE identifies clusters of correlated genes that when considered together
A novel noncommutative KdV-type equation, its recursion operator, and solitons
Carillo, Sandra; Lo Schiavo, Mauro; Porten, Egmont; Schiebold, Cornelia
2018-04-01
A noncommutative KdV-type equation is introduced extending the Bäcklund chart in Carillo et al. [Symmetry Integrability Geom.: Methods Appl. 12, 087 (2016)]. This equation, called meta-mKdV here, is linked by Cole-Hopf transformations to the two noncommutative versions of the mKdV equations listed in Olver and Sokolov [Commun. Math. Phys. 193, 245 (1998), Theorem 3.6]. For this meta-mKdV, and its mirror counterpart, recursion operators, hierarchies, and an explicit solution class are derived.
Recursion Formulae for Obtaining Surfaces with Constant Mean Curvature in R2,1
International Nuclear Information System (INIS)
Tian Yongbo; Nan Zhijie; Tian Chou
2007-01-01
Though the Baecklund transformation on time-like surfaces with constant mean curvature surfaces in R 2,1 has been obtained, it is not easy to obtain corresponding surfaces because the procedure of solving the related integrable system cannot be avoided when the Baecklund transformation is used. For sake of this, in this article, some special work is done to reform the Baecklund transformation to a recursion formula, by which we can construct time-like surfaces with constant mean curvature form known ones just by quadrature procedure.
Recursive Utility and the Superneutrality of Money on the Transition Path
Miyazaki, Kenji
2010-01-01
this paper investigates whether a change in the growth rate of the money supply enhances the rate of capital accumulation in a cash-in-advance monetary model with recursive utility. Although money is superneutral in the steady state, the effect of the growth rate of money on the speed of capital accumulation depends not only on the curvature of the felicity but also on the slope and curvature of the discount rate function. We find that when the discount rate decreases with consumption and the...
Painlevé equations, topological type property and reconstruction by the topological recursion
Iwaki, K.; Marchal, O.; Saenz, A.
2018-01-01
In this article we prove that Lax pairs associated with ħ-dependent six Painlevé equations satisfy the topological type property proposed by Bergère, Borot and Eynard for any generic choice of the monodromy parameters. Consequently we show that one can reconstruct the formal ħ-expansion of the isomonodromic τ-function and of the determinantal formulas by applying the so-called topological recursion to the spectral curve attached to the Lax pair in all six Painlevé cases. Finally we illustrate the former results with the explicit computations of the first orders of the six τ-functions.
International Nuclear Information System (INIS)
Schek, I.; Wyatt, R.E.
1986-01-01
Molecular multiphoton processes are treated in the Recursive Residue Generation Method (A. Nauts and R.E. Wyatt, Phys. Rev. Lett 51, 2238 (1983)) by converting the molecular-field Hamiltonian matrix into tridiagonal form, using the Lanczos equations. In this study, the self-energies (diagonal) and linking (off-diagaonal) terms in the tridiagonal matrix are obtained by comparing linked moment diagrams in both representations. The dynamics of the source state is introduced and computed in terms of the linked and the irreducible moments
Gluon and quark jets in a recursive model motivated by quantum chromodynamics
International Nuclear Information System (INIS)
Sukhatme, U.P.
1979-01-01
We compute observable quantities like the multiplicity and momentum distributions of hadrons in gluon and quark jets in the framework of a recursive cascade model, which is strongly motivated by the fundamental interactions of QCD. Fragmentation occurs via 3 types of breakups: quark → meson + quark, gluon → meson + gluon, gluon → quark + antiquark. In our model gluon jets are softer than quark jets. The ratio of gluon jet to quark jet multiplicity is found to be 2 asymptotically, but much less at lower energies. Some phenomenological consequences for γ decay are discussed. (orig.)
Gauge amplitude identities by on-shell recursion relation in S-matrix program
International Nuclear Information System (INIS)
Feng Bo; Huang Rijun; Jia Yin
2011-01-01
Using only the Britto-Cachazo-Feng-Witten (BCFW) on-shell recursion relation we prove color-order reversed relation, U(1)-decoupling relation, Kleiss-Kuijf (KK) relation and Bern-Carrasco-Johansson (BCJ) relation for color-ordered gauge amplitude in the framework of S-matrix program without relying on Lagrangian description. Our derivation is the first pure field theory proof of the new discovered BCJ identity, which substantially reduces the color-ordered basis from (n-2)! to (n-3)!. Our proof gives also its physical interpretation as the mysterious bonus relation with 1/(z 2 ) behavior under suitable on-shell deformation for no adjacent pair.
Analytical recursive method to ascertain multisite entanglement in doped quantum spin ladders
Roy, Sudipto Singha; Dhar, Himadri Shekhar; Rakshit, Debraj; SenDe, Aditi; Sen, Ujjwal
2017-08-01
We formulate an analytical recursive method to generate the wave function of doped short-range resonating valence bond (RVB) states as a tool to efficiently estimate multisite entanglement as well as other physical quantities in doped quantum spin ladders. We prove that doped RVB ladder states are always genuine multipartite entangled. Importantly, our results show that within specific doping concentration and model parameter regimes, the doped RVB state essentially characterizes the trends of genuine multiparty entanglement in the exact ground states of the Hubbard model with large on-site interactions, in the limit that yields the t -J Hamiltonian.
Speed control of induction motor using fuzzy recursive least squares technique
Santiago Sánchez; Eduardo Giraldo
2008-01-01
A simple adaptive controller design is presented in this paper, the control system uses the adaptive fuzzy logic, sliding modes and is trained with the recursive least squares technique. The problem of parameter variation is solved with the adaptive controller; the use of an internal PI regulator produces that the speed control of the induction motor be achieved by the stator currents instead the input voltage. The rotor-flux oriented coordinated system model is used to develop and test the c...
Speed control of induction motor using fuzzy recursive least squares technique
Directory of Open Access Journals (Sweden)
Santiago Sánchez
2008-12-01
Full Text Available A simple adaptive controller design is presented in this paper, the control system uses the adaptive fuzzy logic, sliding modes and is trained with the recursive least squares technique. The problem of parameter variation is solved with the adaptive controller; the use of an internal PI regulator produces that the speed control of the induction motor be achieved by the stator currents instead the input voltage. The rotor-flux oriented coordinated system model is used to develop and test the control system.
Parallel Implementation of Riccati Recursion for Solving Linear-Quadratic Control Problems
DEFF Research Database (Denmark)
Frison, Gianluca; Jørgensen, John Bagterp
2013-01-01
In both Active-Set (AS) and Interior-Point (IP) algorithms for Model Predictive Control (MPC), sub-problems in the form of linear-quadratic (LQ) control problems need to be solved at each iteration. The solution of these sub-problems is usually the main computational effort. In this paper...... an alternative version of the Riccati recursion solver for LQ control problems is presented. The performance of both the classical and the alternative version is analyzed from a theoretical as well as a numerical point of view, and the alternative version is found to be approximately 50% faster than...
Projection-based Bayesian recursive estimation of ARX model with uniform innovations
Czech Academy of Sciences Publication Activity Database
Kárný, Miroslav; Pavelková, Lenka
2007-01-01
Roč. 56, 9/10 (2007), s. 646-655 ISSN 0167-6911 R&D Projects: GA AV ČR 1ET100750401; GA MŠk 2C06001; GA MDS 1F43A/003/120 Institutional research plan: CEZ:AV0Z10750506 Keywords : ARX model * Bayesian recursive estimation * Uniform distribution Subject RIV: BC - Control Systems Theory Impact factor: 1.634, year: 2007 http://dx.doi.org/10.1016/j.sysconle.2007.03.005
Conformal symmetry in two-dimensional space: recursion representation of conformal block
International Nuclear Information System (INIS)
Zamolodchikov, A.B.
1988-01-01
The four-point conformal block plays an important part in the analysis of the conformally invariant operator algebra in two-dimensional space. The behavior of the conformal block is calculated in the present paper in the limit in which the dimension Δ of the intermediate operator tends to infinity. This makes it possible to construct a recursion relation for this function that connects the conformal block at arbitrary Δ to the blocks corresponding to the dimensions of the zero vectors in the degenerate representations of the Virasoro algebra. The relation is convenient for calculating the expansion of the conformal block in powers of the uniformizing parameters q = i π tau
Intelligent Design and Earth History
Elders, W. A.
2001-05-01
clumsy, wasteful works of nature as seen in the suffering caused by parasites and in the delight in cruelty shown by some predators when catching and playing with their prey". The positions of other contemporary proponents of ID are far from uniform. Some, while rejecting unguided evolution, appear to accept the concepts of common descent and an Earth 4.6 billion years old. However, within the ID movement there has been very little discussion of its implications for Earth history. For example, is it valid to ask, "Were the Himalayas intelligently designed?" Or should the question be, "Is the physics of plate tectonics intelligently designed?" As well as contingency in the history of life, there are strong elements of contingency in the history of the Earth, in the history of the solar system and in the history of the cosmos. Does ID matter? From a purely operational viewpoint, the rock record could equally well be interpreted in pattern-based investigations as being the product of either naturalistic processes, or as a sequence of intelligently designed events. For example, in correlating horizons between adjacent oil wells using micropaleontology, or in doing seismic stratigraphy, it makes little difference whether foraminifera or unconformities formed by natural or supernatural agencies. However, ID is an anathema for process-based research and its cultural implications are enormous. While we must be careful in our work to separate methodological naturalism from culturally bound philosophical naturalism, methodological naturalism has been an enormously successful approach in the advancement of knowledge. We have moved from the "demon-haunted" world to the world of the human genome. We must take ID seriously; it is a retrograde step.
Ma, Zhi-Sai; Liu, Li; Zhou, Si-Da; Yu, Lei; Naets, Frank; Heylen, Ward; Desmet, Wim
2018-01-01
The problem of parametric output-only identification of time-varying structures in a recursive manner is considered. A kernelized time-dependent autoregressive moving average (TARMA) model is proposed by expanding the time-varying model parameters onto the basis set of kernel functions in a reproducing kernel Hilbert space. An exponentially weighted kernel recursive extended least squares TARMA identification scheme is proposed, and a sliding-window technique is subsequently applied to fix the computational complexity for each consecutive update, allowing the method to operate online in time-varying environments. The proposed sliding-window exponentially weighted kernel recursive extended least squares TARMA method is employed for the identification of a laboratory time-varying structure consisting of a simply supported beam and a moving mass sliding on it. The proposed method is comparatively assessed against an existing recursive pseudo-linear regression TARMA method via Monte Carlo experiments and shown to be capable of accurately tracking the time-varying dynamics. Furthermore, the comparisons demonstrate the superior achievable accuracy, lower computational complexity and enhanced online identification capability of the proposed kernel recursive extended least squares TARMA approach.
National Research Council Canada - National Science Library
Cook, James
1998-01-01
...; all the other voyagers are tried and true initiates. His brotherhood lives under arcane rules -- one may not eat beans, for instance -- and dedicates itself to discovering mathematical regularity in nature...
International Nuclear Information System (INIS)
Berg, B.A.
1996-01-01
Recently multicanonical Monte Carlo (MC) sampling and closely related methods have received much attention. Considerable gains have been achieved in situations with open-quotes supercriticalclose quotes slowing down, such as first-order transition, and systems with conflicting constrains, for instance, spin glasses or proteins. In the multicanonical ensemble one samples configurations such that exact reconstruction of canonical expectation values becomes feasible for a desired temperature range. This requires a broad energy distribution, and leaves innovative freedom concerning the optimal shape. Considerable practical experience exists only for the uniform energy distribution
Smith, Scott G.
2015-01-01
In this article, Scott Smith presents an innocent problem (Problem 12 of the May 2001 Calendar from "Mathematics Teacher" ("MT" May 2001, vol. 94, no. 5, p. 384) that was transformed by several timely "what if?" questions into a rewarding investigation of some interesting mathematics. These investigations led to two…
A Survey on Evolutionary Algorithm Based Hybrid Intelligence in Bioinformatics
Directory of Open Access Journals (Sweden)
Shan Li
2014-01-01
Full Text Available With the rapid advance in genomics, proteomics, metabolomics, and other types of omics technologies during the past decades, a tremendous amount of data related to molecular biology has been produced. It is becoming a big challenge for the bioinformatists to analyze and interpret these data with conventional intelligent techniques, for example, support vector machines. Recently, the hybrid intelligent methods, which integrate several standard intelligent approaches, are becoming more and more popular due to their robustness and efficiency. Specifically, the hybrid intelligent approaches based on evolutionary algorithms (EAs are widely used in various fields due to the efficiency and robustness of EAs. In this review, we give an introduction about the applications of hybrid intelligent methods, in particular those based on evolutionary algorithm, in bioinformatics. In particular, we focus on their applications to three common problems that arise in bioinformatics, that is, feature selection, parameter estimation, and reconstruction of biological networks.
Distributed intelligence in CAMAC
International Nuclear Information System (INIS)
Kunz, P.F.
1977-01-01
The CAMAC digital interface standard has served us well since 1969. During this time there have been enormous advances in digital electronics. In particular, low cost microprocessors now make it feasible to consider use of distributed intelligence even in simple data acquisition systems. This paper describes a simple extension of the CAMAC standard which allows distributed intelligence at the crate level
Intelligent design som videnskab?
DEFF Research Database (Denmark)
Klausen, Søren Harnow
2007-01-01
Diskuterer hvorvidt intelligent design kan betegnes som videnskab; argumenterer for at dette grundet fraværet af klare demarkationskriterier næppe kan afvises.......Diskuterer hvorvidt intelligent design kan betegnes som videnskab; argumenterer for at dette grundet fraværet af klare demarkationskriterier næppe kan afvises....
Distributed intelligence in CAMAC
International Nuclear Information System (INIS)
Kunz, P.F.
1977-01-01
A simple extension of the CAMAC standard is described which allows distributed intelligence at the crate level. By distributed intelligence is meant that there is more than one source of control in a system. This standard is just now emerging from the NIM Dataway Working Group and its European counterpart. 1 figure
Intelligence and treaty ratification
International Nuclear Information System (INIS)
Cahn, A.H.
1990-01-01
This paper reports that there are two sets of questions applicable to the ratification phase: what is the role of intelligence in the ratification process? What effect did intelligence have on that process. The author attempts to answer these and other questions
Applying Multiple Intelligences
Christodoulou, Joanna A.
2009-01-01
The ideas of multiple intelligences introduced by Howard Gardner of Harvard University more than 25 years ago have taken form in many ways, both in schools and in other sometimes-surprising settings. The silver anniversary of Gardner's learning theory provides an opportunity to reflect on the ways multiple intelligences theory has taken form and…
Next generation Emotional Intelligence
J. Saveland
2012-01-01
Emotional Intelligence has been a hot topic in leadership training since Dan Goleman published his book on the subject in 1995. Emotional intelligence competencies are typically focused on recognition and regulation of emotions in one's self and social situations, yielding four categories: self-awareness, self-management, social awareness and relationship...
DEFF Research Database (Denmark)
Diderichsen, Adam; Rønn, Kira Vrist
2017-01-01
This article contributes to the current discussions concerning an adequate framework for intelligence ethics. The first part critically scrutinises the use of Just War Theory in intelligence ethics with specific focus on the just cause criterion. We argue that using self-defence as justifying cau...
Intelligence and Physical Attractiveness
Kanazawa, Satoshi
2011-01-01
This brief research note aims to estimate the magnitude of the association between general intelligence and physical attractiveness with large nationally representative samples from two nations. In the United Kingdom, attractive children are more intelligent by 12.4 IQ points (r=0.381), whereas in the United States, the correlation between…
Intelligence and treaty ratification
International Nuclear Information System (INIS)
Naftzinger, J.E.
1990-01-01
This paper describes the atmosphere leading up to the Senate INF hearings and then surveys the broad issues they raised. After that, the author highlights several aspects of the intelligence community's involvement and discusses the specific intelligence-related issues as the Senate committees saw them, notes their impact on the outcome, and finally draws several conclusions and lessons pertinent to the future
Intelligence, Race, and Genetics
Sternberg, Robert J.; Grigorenko, Elena L.; Kidd, Kenneth K.
2005-01-01
In this article, the authors argue that the overwhelming portion of the literature on intelligence, race, and genetics is based on folk taxonomies rather than scientific analysis. They suggest that because theorists of intelligence disagree as to what it is, any consideration of its relationships to other constructs must be tentative at best. They…
Multiple Intelligences in Action.
Campbell, Bruce
1992-01-01
Describes the investigation of the effects of a four-step model program used with third through fifth grade students to implement Gardener's concepts of seven human intelligences--linguistic, logical/mathematical, visual/spatial, musical, kinesthetic, intrapersonal, and interpersonal intelligence--into daily learning. (BB)
The Reproduction of Intelligence
Meisenberg, Gerhard
2010-01-01
Although a negative relationship between fertility and education has been described consistently in most countries of the world, less is known about the relationship between intelligence and reproductive outcomes. Also the paths through which intelligence influences reproductive outcomes are uncertain. The present study uses the NLSY79 to analyze…
Intelligent robot action planning
Energy Technology Data Exchange (ETDEWEB)
Vamos, T; Siegler, A
1982-01-01
Action planning methods used in intelligent robot control are discussed. Planning is accomplished through environment understanding, environment representation, task understanding and planning, motion analysis and man-machine communication. These fields are analysed in detail. The frames of an intelligent motion planning system are presented. Graphic simulation of the robot's environment and motion is used to support the planning. 14 references.
Computational Intelligence in Intelligent Data Analysis
Nürnberger, Andreas
2013-01-01
Complex systems and their phenomena are ubiquitous as they can be found in biology, finance, the humanities, management sciences, medicine, physics and similar fields. For many problems in these fields, there are no conventional ways to mathematically or analytically solve them completely at low cost. On the other hand, nature already solved many optimization problems efficiently. Computational intelligence attempts to mimic nature-inspired problem-solving strategies and methods. These strategies can be used to study, model and analyze complex systems such that it becomes feasible to handle them. Key areas of computational intelligence are artificial neural networks, evolutionary computation and fuzzy systems. As only a few researchers in that field, Rudolf Kruse has contributed in many important ways to the understanding, modeling and application of computational intelligence methods. On occasion of his 60th birthday, a collection of original papers of leading researchers in the field of computational intell...
Learning for intelligent mobile robots
Hall, Ernest L.; Liao, Xiaoqun; Alhaj Ali, Souma M.
2003-10-01
mathematical model of the creative control process is presented that illustrates the use for mobile robots. Examples from a variety of intelligent mobile robot applications are also presented. The significance of this work is in providing a greater understanding of the applications of learning to mobile robots that could lead to many applications.
Intelligent medical image processing by simulated annealing
International Nuclear Information System (INIS)
Ohyama, Nagaaki
1992-01-01
Image processing is being widely used in the medical field and already has become very important, especially when used for image reconstruction purposes. In this paper, it is shown that image processing can be classified into 4 categories; passive, active, intelligent and visual image processing. These 4 classes are explained at first through the use of several examples. The results show that the passive image processing does not give better results than the others. Intelligent image processing, then, is addressed, and the simulated annealing method is introduced. Due to the flexibility of the simulated annealing, formulated intelligence is shown to be easily introduced in an image reconstruction problem. As a practical example, 3D blood vessel reconstruction from a small number of projections, which is insufficient for conventional method to give good reconstruction, is proposed, and computer simulation clearly shows the effectiveness of simulated annealing method. Prior to the conclusion, medical file systems such as IS and C (Image Save and Carry) is pointed out to have potential for formulating knowledge, which is indispensable for intelligent image processing. This paper concludes by summarizing the advantages of simulated annealing. (author)
Intelligence and Prosocial Behavior
DEFF Research Database (Denmark)
Han, Ru; Shi, Jiannong; Yong, W.
2012-01-01
Results of prev ious studies of the relationship between prosocial behav ior and intelligence hav e been inconsistent. This study attempts to distinguish the dif f erences between sev eral prosocial tasks, and explores the way s in which cognitiv e ability inf luences prosocial behav ior. In Study...... One and Two, we reexamined the relationship between prosocial behav ior and intelligence by employ ing a costly signaling theory with f our games. The results rev ealed that the prosocial lev el of smarter children is higher than that of other children in more complicated tasks but not so in simple...... tasks. In Study Three, we tested the moderation ef f ect of the av erage intelligence across classes, and the results did not show any group intelligence ef f ect on the relationship between intelligence and prosocial behav ior....
Directory of Open Access Journals (Sweden)
Bogdan NEDELCU
2014-02-01
Full Text Available The aim of this article is to show the importance of business intelligence and its growing influence. It also shows when the concept of business intelligence was used for the first time and how it evolved over time. The paper discusses the utility of a business intelligence system in any organization and its contribution to daily activities. Furthermore, we highlight the role and the objectives of business intelligence systems inside an organization and the needs to grow the incomes and reduce the costs, to manage the complexity of the business environment and to cut IT costs so that the organization survives in the current competitive climate. The article contains information about architectural principles of a business intelligence system and how such a system can be achieved.
Waltman, Ludo; Yan, Erjia; van Eck, Nees Jan
2011-10-01
Two commonly used ideas in the development of citation-based research performance indicators are the idea of normalizing citation counts based on a field classification scheme and the idea of recursive citation weighing (like in PageRank-inspired indicators). We combine these two ideas in a single indicator, referred to as the recursive mean normalized citation score indicator, and we study the validity of this indicator. Our empirical analysis shows that the proposed indicator is highly sensitive to the field classification scheme that is used. The indicator also has a strong tendency to reinforce biases caused by the classification scheme. Based on these observations, we advise against the use of indicators in which the idea of normalization based on a field classification scheme and the idea of recursive citation weighing are combined.
A MURI Center for Intelligent Biomimetic Image Processing and Classification
2007-11-01
times, labeled "plage" or "open space" or "natural", the system learns to associate multiple classes with a given input. Testbed image examples have shown...brain color perception and category learning. Commentary on "Coordinating perceptually grounded categories through language " by Luc Steels and Tony...Symposium on Computational Intelligence (ISCI), Kosice, Slovakia, June 2002. 9. Carpenter, G.A., Award from the Slovak Artificial Intelligence Society, 2002
Directory of Open Access Journals (Sweden)
Reem Yassine
2016-12-01
Full Text Available The frequency response function is a quantitative measure used in structural analysis and engineering design; hence, it is targeted for accuracy. For a large structure, a high number of substructures, also called cells, must be considered, which will lead to a high amount of computational time. In this paper, the recursive method, a finite element method, is used for computing the frequency response function, independent of the number of cells with much lesser time costs. The fundamental principle is eliminating the internal degrees of freedom that are at the interface between a cell and its succeeding one. The method is applied solely for free (no load nodes. Based on the boundary and interior degrees of freedom, the global dynamic stiffness matrix is computed by means of products and inverses resulting with a dimension the same as that for one cell. The recursive method is demonstrated on periodic structures (cranes and buildings under harmonic vibrations. The method yielded a satisfying time decrease with a maximum time ratio of 1 18 and a percentage difference of 19%, in comparison with the conventional finite element method. Close values were attained at low and very high frequencies; the analysis is supported for two types of materials (steel and plastic. The method maintained its efficiency with a high number of forces, excluding the case when all of the nodes are under loads.
Image defog algorithm based on open close filter and gradient domain recursive bilateral filter
Liu, Daqian; Liu, Wanjun; Zhao, Qingguo; Fei, Bowen
2017-11-01
To solve the problems of fuzzy details, color distortion, low brightness of the image obtained by the dark channel prior defog algorithm, an image defog algorithm based on open close filter and gradient domain recursive bilateral filter, referred to as OCRBF, was put forward. The algorithm named OCRBF firstly makes use of weighted quad tree to obtain more accurate the global atmospheric value, then exploits multiple-structure element morphological open and close filter towards the minimum channel map to obtain a rough scattering map by dark channel prior, makes use of variogram to correct the transmittance map,and uses gradient domain recursive bilateral filter for the smooth operation, finally gets recovery images by image degradation model, and makes contrast adjustment to get bright, clear and no fog image. A large number of experimental results show that the proposed defog method in this paper can be good to remove the fog , recover color and definition of the fog image containing close range image, image perspective, the image including the bright areas very well, compared with other image defog algorithms,obtain more clear and natural fog free images with details of higher visibility, what's more, the relationship between the time complexity of SIDA algorithm and the number of image pixels is a linear correlation.
Recursive wind speed forecasting based on Hammerstein Auto-Regressive model
International Nuclear Information System (INIS)
Ait Maatallah, Othman; Achuthan, Ajit; Janoyan, Kerop; Marzocca, Pier
2015-01-01
Highlights: • Developed a new recursive WSF model for 1–24 h horizon based on Hammerstein model. • Nonlinear HAR model successfully captured chaotic dynamics of wind speed time series. • Recursive WSF intrinsic error accumulation corrected by applying rotation. • Model verified for real wind speed data from two sites with different characteristics. • HAR model outperformed both ARIMA and ANN models in terms of accuracy of prediction. - Abstract: A new Wind Speed Forecasting (WSF) model, suitable for a short term 1–24 h forecast horizon, is developed by adapting Hammerstein model to an Autoregressive approach. The model is applied to real data collected for a period of three years (2004–2006) from two different sites. The performance of HAR model is evaluated by comparing its prediction with the classical Autoregressive Integrated Moving Average (ARIMA) model and a multi-layer perceptron Artificial Neural Network (ANN). Results show that the HAR model outperforms both the ARIMA model and ANN model in terms of root mean square error (RMSE), mean absolute error (MAE), and Mean Absolute Percentage Error (MAPE). When compared to the conventional models, the new HAR model can better capture various wind speed characteristics, including asymmetric (non-gaussian) wind speed distribution, non-stationary time series profile, and the chaotic dynamics. The new model is beneficial for various applications in the renewable energy area, particularly for power scheduling
Badia, Santiago; Martín, Alberto F.; Planas, Ramon
2014-10-01
The thermally coupled incompressible inductionless magnetohydrodynamics (MHD) problem models the flow of an electrically charged fluid under the influence of an external electromagnetic field with thermal coupling. This system of partial differential equations is strongly coupled and highly nonlinear for real cases of interest. Therefore, fully implicit time integration schemes are very desirable in order to capture the different physical scales of the problem at hand. However, solving the multiphysics linear systems of equations resulting from such algorithms is a very challenging task which requires efficient and scalable preconditioners. In this work, a new family of recursive block LU preconditioners is designed and tested for solving the thermally coupled inductionless MHD equations. These preconditioners are obtained after splitting the fully coupled matrix into one-physics problems for every variable (velocity, pressure, current density, electric potential and temperature) that can be optimally solved, e.g., using preconditioned domain decomposition algorithms. The main idea is to arrange the original matrix into an (arbitrary) 2 × 2 block matrix, and consider an LU preconditioner obtained by approximating the corresponding Schur complement. For every one of the diagonal blocks in the LU preconditioner, if it involves more than one type of unknowns, we proceed the same way in a recursive fashion. This approach is stated in an abstract way, and can be straightforwardly applied to other multiphysics problems. Further, we precisely explain a flexible and general software design for the code implementation of this type of preconditioners.
On а Recursive-Parallel Algorithm for Solving the Knapsack Problem
Directory of Open Access Journals (Sweden)
Vladimir V. Vasilchikov
2018-01-01
Full Text Available In this paper, we offer an efficient parallel algorithm for solving the NP-complete Knapsack Problem in its basic, so-called 0-1 variant. To find its exact solution, algorithms belonging to the category ”branch and bound methods” have long been used. To speed up the solving with varying degrees of efficiency, various options for parallelizing computations are also used. We propose here an algorithm for solving the problem, based on the paradigm of recursive-parallel computations. We consider it suited well for problems of this kind, when it is difficult to immediately break up the computations into a sufficient number of subtasks that are comparable in complexity, since they appear dynamically at run time. We used the RPM ParLib library, developed by the author, as the main tool to program the algorithm. This library allows us to develop effective applications for parallel computing on a local network in the .NET Framework. Such applications have the ability to generate parallel branches of computation directly during program execution and dynamically redistribute work between computing modules. Any language with support for the .NET Framework can be used as a programming language in conjunction with this library. For our experiments, we developed some C# applications using this library. The main purpose of these experiments was to study the acceleration achieved by recursive-parallel computing. A detailed description of the algorithm and its testing, as well as the results obtained, are also given in the paper.
WKB solutions of difference equations and reconstruction by the topological recursion
Marchal, Olivier
2018-01-01
The purpose of this article is to analyze the connection between Eynard-Orantin topological recursion and formal WKB solutions of a \\hbar -difference equation: \\Psi(x+\\hbar)=≤ft(e\\hbar\\fracd{dx}\\right) \\Psi(x)=L(x;\\hbar)\\Psi(x) with L(x;\\hbar)\\in GL_2( ({C}(x))[\\hbar]) . In particular, we extend the notion of determinantal formulas and topological type property proposed for formal WKB solutions of \\hbar -differential systems to this setting. We apply our results to a specific \\hbar -difference system associated to the quantum curve of the Gromov-Witten invariants of {P}1 for which we are able to prove that the correlation functions are reconstructed from the Eynard-Orantin differentials computed from the topological recursion applied to the spectral curve y=\\cosh-1\\frac{x}{2} . Finally, identifying the large x expansion of the correlation functions, proves a recent conjecture made by Dubrovin and Yang regarding a new generating series for Gromov-Witten invariants of {P}1 .
Working Memory: A Cognitive Limit to Non-Human Primate Recursive Thinking Prior to Hominid Evolution
Directory of Open Access Journals (Sweden)
Dwight W. Read
2008-10-01
Full Text Available In this paper I explore the possibility that recursion is not part of the cognitive repertoire of non-human primates such as chimpanzees due to limited working memory capacity. Multiple lines of data, from nut cracking to the velocity and duration of cognitive development, imply that chimpanzees have a short-term memory size that limits working memory to dealing with two, or at most three, concepts at a time. If so, as a species they lack the cognitive capacity for recursive thinking to be integrated into systems of social organization and communication. If this limited working memory capacity is projected back to a common ancestor for Pan and Homo, it follows that early hominid ancestors would have had limited working memory capacity. Hence we should find evidence for expansion of working memory capacity during hominid evolution reflected in changes in the products of conceptually framed activities such as stone tool production. Data on the artifacts made by our hominid ancestors support this expansion hypothesis for hominid working memory, thereby leading to qualitative differences between Pan and Homo.
The understanding of the students about the nature of light in recursive curriculum
Directory of Open Access Journals (Sweden)
Geide Rosa Coelho
2010-01-01
Full Text Available We report an inquiry on the development of students' understanding about the nature of light. The study happened in a learning environment with a recursive and spiral Physics syllabus. We investigated the change in students' understanding about the nature of light during their 3rd year in High School, and the level of understanding about this subject achieved by students at the end of this year. To assess the students' understanding, we developed an open questionnaire form and a set of hierarchical categories, consisting of five different models about the nature of light. The questionnaire was used to access the students´ understanding at the beginning and at the end of the third level of the recursive curriculum. The results showed that students have a high level of prior knowledge, and also that the Physics learning they experienced had enhanced their understanding, despite the effects are not verified in all the Physics classes. By the end of the third year, most of the students explain the nature of light using or a corpuscular electromagnetic model or a dual electromagnetic model, but some students use these models with inconsistencies in their explanations.
International Nuclear Information System (INIS)
Fu, Y; Xu, O; Yang, W; Zhou, L; Wang, J
2017-01-01
To investigate time-variant and nonlinear characteristics in industrial processes, a soft sensor modelling method based on time difference, moving-window recursive partial least square (PLS) and adaptive model updating is proposed. In this method, time difference values of input and output variables are used as training samples to construct the model, which can reduce the effects of the nonlinear characteristic on modelling accuracy and retain the advantages of recursive PLS algorithm. To solve the high updating frequency of the model, a confidence value is introduced, which can be updated adaptively according to the results of the model performance assessment. Once the confidence value is updated, the model can be updated. The proposed method has been used to predict the 4-carboxy-benz-aldehyde (CBA) content in the purified terephthalic acid (PTA) oxidation reaction process. The results show that the proposed soft sensor modelling method can reduce computation effectively, improve prediction accuracy by making use of process information and reflect the process characteristics accurately. (paper)
Efficient O(N) recursive computation of the operational space inertial matrix
International Nuclear Information System (INIS)
Lilly, K.W.; Orin, D.E.
1993-01-01
The operational space inertia matrix Λ reflects the dynamic properties of a robot manipulator to its tip. In the control domain, it may be used to decouple force and/or motion control about the manipulator workspace axes. The matrix Λ also plays an important role in the development of efficient algorithms for the dynamic simulation of closed-chain robotic mechanisms, including simple closed-chain mechanisms such as multiple manipulator systems and walking machines. The traditional approach used to compute Λ has a computational complexity of O(N 3 ) for an N degree-of-freedom manipulator. This paper presents the development of a recursive algorithm for computing the operational space inertia matrix (OSIM) that reduces the computational complexity to O(N). This algorithm, the inertia propagation method, is based on a single recursion that begins at the base of the manipulator and progresses out to the last link. Also applicable to redundant systems and mechanisms with multiple-degree-of-freedom joints, the inertia propagation method is the most efficient method known for computing Λ for N ≥ 6. The numerical accuracy of the algorithm is discussed for a PUMA 560 robot with a fixed base
Stability of recursive out-of-sequence measurement filters: an open problem
Chen, Lingji; Moshtagh, Nima; Mehra, Raman K.
2011-06-01
In many applications where communication delays are present, measurements with earlier time stamps can arrive out-of-sequence, i.e., after state estimates have been obtained for the current time instant. To incorporate such an Out-Of-Sequence Measurement (OOSM), many algorithms have been proposed in the literature to obtain or approximate the optimal estimate that would have been obtained if the OOSM had arrived in-sequence. When OOSM occurs repeatedly, approximate estimations as a result of incorporating one OOSM have to serve as the basis for incorporating yet another OOSM. The question of whether the "approximation of approximation" is well behaved, i.e., whether approximation errors accumulate in a recursive setting, has not been adequately addressed in the literature. This paper draws attention to the stability question of recursive OOSM processing filters, formulates the problem in a specific setting, and presents some simulation results that suggest that such filters are indeed well-behaved. Our hope is that more research will be conducted in the future to rigorously establish stability properties of these filters.
Energy Technology Data Exchange (ETDEWEB)
Lorber, A.A.; Carey, G.F.; Bova, S.W.; Harle, C.H. [Univ. of Texas, Austin, TX (United States)
1996-12-31
The connection between the solution of linear systems of equations by iterative methods and explicit time stepping techniques is used to accelerate to steady state the solution of ODE systems arising from discretized PDEs which may involve either physical or artificial transient terms. Specifically, a class of Runge-Kutta (RK) time integration schemes with extended stability domains has been used to develop recursion formulas which lead to accelerated iterative performance. The coefficients for the RK schemes are chosen based on the theory of Chebyshev iteration polynomials in conjunction with a local linear stability analysis. We refer to these schemes as Chebyshev Parameterized Runge Kutta (CPRK) methods. CPRK methods of one to four stages are derived as functions of the parameters which describe an ellipse {Epsilon} which the stability domain of the methods is known to contain. Of particular interest are two-stage, first-order CPRK and four-stage, first-order methods. It is found that the former method can be identified with any two-stage RK method through the correct choice of parameters. The latter method is found to have a wide range of stability domains, with a maximum extension of 32 along the real axis. Recursion performance results are presented below for a model linear convection-diffusion problem as well as non-linear fluid flow problems discretized by both finite-difference and finite-element methods.
Pieters, Thomas A; Conner, Christopher R; Tandon, Nitin
2013-05-01
Precise localization of subdural electrodes (SDEs) is essential for the interpretation of data from intracranial electrocorticography recordings. Blood and fluid accumulation underneath the craniotomy flap leads to a nonlinear deformation of the brain surface and of the SDE array on postoperative CT scans and adversely impacts the accurate localization of electrodes located underneath the craniotomy. Older methods that localize electrodes based on their identification on a postimplantation CT scan with coregistration to a preimplantation MR image can result in significant problems with accuracy of the electrode localization. The authors report 3 novel methods that rely on the creation of a set of 3D mesh models to depict the pial surface and a smoothed pial envelope. Two of these new methods are designed to localize electrodes, and they are compared with 6 methods currently in use to determine their relative accuracy and reliability. The first method involves manually localizing each electrode using digital photographs obtained at surgery. This is highly accurate, but requires time intensive, operator-dependent input. The second uses 4 electrodes localized manually in conjunction with an automated, recursive partitioning technique to localize the entire electrode array. The authors evaluated the accuracy of previously published methods by applying the methods to their data and comparing them against the photograph-based localization. Finally, the authors further enhanced the usability of these methods by using automatic parcellation techniques to assign anatomical labels to individual electrodes as well as by generating an inflated cortical surface model while still preserving electrode locations relative to the cortical anatomy. The recursive grid partitioning had the least error compared with older methods (672 electrodes, 6.4-mm maximum electrode error, 2.0-mm mean error, p < 10(-18)). The maximum errors derived using prior methods of localization ranged from 8
Business Intelligence & Analytical Intelligence: hou het zakelijk
Van Nieuwenhuyse, Dries
2013-01-01
Technologie democratiseert, de markt consolideert, terwijl de hoeveelheid data explodeert. Het lijkt een ideale voedingsbodem voor projecten rond business intelligence en analytics. “Hoe minder de technologie het verschil zal maken, hoe prominenter de business aanwezig zal zijn.”
Social Intelligence Design in Ambient Intelligence
Nijholt, Antinus; Stock, Oliviero; Stock, O.; Nishida, T.; Nishida, Toyoaki
2009-01-01
This Special Issue of AI and Society contains a selection of papers presented at the 6th Social Intelligence Design Workshop held at ITC-irst, Povo (Trento, Italy) in July 2007. Being the 6th in a series means that there now is a well-established and also a growing research area. The interest in
Spiritual Intelligence, Emotional Intelligence and Auditor’s Performance
Hanafi, Rustam
2010-01-01
The objective of this research was to investigate empirical evidence about influence audi-tor spiritual intelligence on the performance with emotional intelligence as a mediator variable. Linear regression models are developed to examine the hypothesis and path analysis. The de-pendent variable of each model is auditor performance, whereas the independent variable of model 1 is spiritual intelligence, of model 2 are emotional intelligence and spiritual intelligence. The parameters were estima...
Intelligence and treaty ratification
International Nuclear Information System (INIS)
Sojka, G.L.
1990-01-01
What did the intelligence community and the Intelligence Committee di poorly in regard to the treaty ratification process for arms control? We failed to solve the compartmentalization problem/ This is a second-order problem, and, in general, analysts try to be very open; but there are problems nevertheless. There are very few, if any, people within the intelligence community who are cleared for everything relevant to our monitoring capability emdash short of probably the Director of Central Intelligence and the president emdash and this is a major problem. The formal monitoring estimates are drawn up by individuals who do not have access to all the information to make the monitoring judgements. This paper reports that the intelligence community did not present a formal document on either Soviet incentives of disincentives to cheat or on the possibility of cheating scenarios, and that was a mistake. However, the intelligence community was very responsive in producing those types of estimates, and, ultimately, the evidence behind them in response to questions. Nevertheless, the author thinks the intelligence community would do well to address this issue up front before a treaty is submitted to the Senate for advice and consent
The Epistemic Status of Intelligence
DEFF Research Database (Denmark)
Rønn, Kira Vrist; Høffding, Simon
2012-01-01
We argue that the majority of intelligence definitions fail to recognize that the normative epistemic status of intelligence is knowledge and not an inferior alternative. We refute the counter-arguments that intelligence ought not to be seen as knowledge because of 1) its action-oriented scope...... and robustness of claims to intelligence-knowledge can be assessed....
Moral Intelligence in the Schools
Clarken, Rodney H.
2009-01-01
Moral intelligence is newer and less studied than the more established cognitive, emotional and social intelligences, but has great potential to improve our understanding of learning and behavior. Moral intelligence refers to the ability to apply ethical principles to personal goals, values and actions. The construct of moral intelligence consists…
Multiple predictor smoothing methods for sensitivity analysis: Example results
International Nuclear Information System (INIS)
Storlie, Curtis B.; Helton, Jon C.
2008-01-01
The use of multiple predictor smoothing methods in sampling-based sensitivity analyses of complex models is investigated. Specifically, sensitivity analysis procedures based on smoothing methods employing the stepwise application of the following nonparametric regression techniques are described in the first part of this presentation: (i) locally weighted regression (LOESS), (ii) additive models, (iii) projection pursuit regression, and (iv) recursive partitioning regression. In this, the second and concluding part of the presentation, the indicated procedures are illustrated with both simple test problems and results from a performance assessment for a radioactive waste disposal facility (i.e., the Waste Isolation Pilot Plant). As shown by the example illustrations, the use of smoothing procedures based on nonparametric regression techniques can yield more informative sensitivity analysis results than can be obtained with more traditional sensitivity analysis procedures based on linear regression, rank regression or quadratic regression when nonlinear relationships between model inputs and model predictions are present
Computational intelligence in automotive applications
Energy Technology Data Exchange (ETDEWEB)
Prokhorov, Danil (ed.) [Toyota Motor Engineering and Manufacturing (TEMA), Ann Arbor, MI (United States). Toyota Technical Center
2008-07-01
What is computational intelligence (CI)? Traditionally, CI is understood as a collection of methods from the fields of neural networks (NN), fuzzy logic and evolutionary computation. This edited volume is the first of its kind, suitable to automotive researchers, engineers and students. It provides a representative sample of contemporary CI activities in the area of automotive technology. The volume consists of 13 chapters, including but not limited to these topics: vehicle diagnostics and vehicle system safety, control of vehicular systems, quality control of automotive processes, driver state estimation, safety of pedestrians, intelligent vehicles. All chapters contain overviews of state of the art, and several chapters illustrate their methodologies on examples of real-world systems. About the Editor: Danil Prokhorov began his technical career in St. Petersburg, Russia, after graduating with Honors from Saint Petersburg State University of Aerospace Instrumentation in 1992 (MS in Robotics). He worked as a research engineer in St. Petersburg Institute for Informatics and Automation, one of the institutes of the Russian Academy of Sciences. He came to the US in late 1993 for Ph.D. studies. He became involved in automotive research in 1995 when he was a Summer intern at Ford Scientific Research Lab in Dearborn, MI. Upon his graduation from the EE Department of Texas Tech University, Lubbock, in 1997, he joined Ford to pursue application-driven research on neural networks and other machine learning algorithms. While at Ford, he took part in several production-bound projects including neural network based engine misfire detection. Since 2005 he is with Toyota Technical Center, Ann Arbor, MI, overseeing important mid- and long-term research projects in computational intelligence. (orig.)
Advanced intelligence and mechanism approach
Institute of Scientific and Technical Information of China (English)
ZHONG Yixin
2007-01-01
Advanced intelligence will feature the intelligence research in next 50 years.An understanding of the concept of advanced intelligence as well as its importance will be provided first,and detailed analysis on an approach,the mechanism approach.suitable to the advanced intelligence research will then be flolowed.And the mutual relationship among mechanism approach,traditional approaches existed in artificial intelligence research,and the cognitive informatics will be discussed.It is interesting to discover that mechanism approach is a good one to the Advanced Intelligence research and a tmified form of the existed approaches to artificial intelligence.
Intelligent environmental sensing
Mukhopadhyay, Subhas
2015-01-01
Developing environmental sensing and monitoring technologies become essential especially for industries that may cause severe contamination. Intelligent environmental sensing uses novel sensor techniques, intelligent signal and data processing algorithms, and wireless sensor networks to enhance environmental sensing and monitoring. It finds applications in many environmental problems such as oil and gas, water quality, and agriculture. This book addresses issues related to three main approaches to intelligent environmental sensing and discusses their latest technological developments. Key contents of the book include: Agricultural monitoring Classification, detection, and estimation Data fusion Geological monitoring Motor monitoring Multi-sensor systems Oil reservoirs monitoring Sensor motes Water quality monitoring Wireless sensor network protocol
Greer, Kieran
2014-01-01
Our understanding of intelligence is directed primarily at the level of human beings. This paper attempts to give a more unifying definition that can be applied to the natural world in general. The definition would be used more to verify a degree of intelligence, not to quantify it and might help when making judgements on the matter. A version of an accepted test for AI is then put forward as the 'acid test' for Artificial Intelligence itself. It might be what a free-thinking program or robot...
Firearm microstamping technology: counterinsurgency intelligence gathering tool
Lizotte, Todd E.; Ohar, Orest P.
2009-05-01
military rifles to assist in developing real time intelligence providing a greater level of situational awareness. Proactively Microstamping firearms that are introduced and distributed to the host nation's security forces, it will become easier to track the firearms if they go missing or end up on the black market in the hands of an insurgency. This paper will explain the technology and key attributes of microstamping technology, test data showing its ability to identifying a specific firearm, examples of implementation strategies and to what extent data could be utilized in war zone security and counterinsurgency intelligence operations.
Multiple Intelligences and quotient spaces
Malatesta, Mike; Quintana, Yamilet
2006-01-01
The Multiple Intelligence Theory (MI) is one of the models that study and describe the cognitive abilities of an individual. In [7] is presented a referential system which allows to identify the Multiple Intelligences of the students of a course and to classify the level of development of such Intelligences. Following this tendency, the purpose of this paper is to describe the model of Multiple Intelligences as a quotient space, and also to study the Multiple Intelligences of an individual in...
Business Intelligence using Software Agents
Ana-Ramona BOLOGA; Razvan BOLOGA
2011-01-01
This paper presents some ideas about business intelligence today and the importance of developing real time business solutions. The authors make an exploration of links between business intelligence and artificial intelligence and focuses specifically on the implementation of software agents-based systems in business intelligence. There are briefly presented some of the few solutions proposed so far that use software agents properties for the benefit of business intelligence. The authors then...
Krishnan, M.; Bhowmik, B.; Hazra, B.; Pakrashi, V.
2018-02-01
In this paper, a novel baseline free approach for continuous online damage detection of multi degree of freedom vibrating structures using Recursive Principal Component Analysis (RPCA) in conjunction with Time Varying Auto-Regressive Modeling (TVAR) is proposed. In this method, the acceleration data is used to obtain recursive proper orthogonal components online using rank-one perturbation method, followed by TVAR modeling of the first transformed response, to detect the change in the dynamic behavior of the vibrating system from its pristine state to contiguous linear/non-linear-states that indicate damage. Most of the works available in the literature deal with algorithms that require windowing of the gathered data owing to their data-driven nature which renders them ineffective for online implementation. Algorithms focussed on mathematically consistent recursive techniques in a rigorous theoretical framework of structural damage detection is missing, which motivates the development of the present framework that is amenable for online implementation which could be utilized along with suite experimental and numerical investigations. The RPCA algorithm iterates the eigenvector and eigenvalue estimates for sample covariance matrices and new data point at each successive time instants, using the rank-one perturbation method. TVAR modeling on the principal component explaining maximum variance is utilized and the damage is identified by tracking the TVAR coefficients. This eliminates the need for offline post processing and facilitates online damage detection especially when applied to streaming data without requiring any baseline data. Numerical simulations performed on a 5-dof nonlinear system under white noise excitation and El Centro (also known as 1940 Imperial Valley earthquake) excitation, for different damage scenarios, demonstrate the robustness of the proposed algorithm. The method is further validated on results obtained from case studies involving
Intelligent robots: Do we need them and can they be built?
International Nuclear Information System (INIS)
Mann, R.C.
1993-01-01
For avid watchers of science fiction movies, the mention of robotics and artificial intelligence conjures up images of humanlike machines. Often, news reports of scientific advances that enable machines to behave in a flexible manner for a limited set of tests draw parallels to science fiction robots. The effect of this unfortunate kind of publicity is that the scientific disciplines of robotics and artificial intelligence are sometimes regarded as a playground for slightly crazed scientists trying to create artificial humans. In reality, the fields of robotics and artificial intelligence can best be described by answering a few commonly asked questions: What is an intelligent robot, anyway? Why would we need things like that? Could we build them and make them reliable for certain uses? An example of an intelligent machine, or robot is presented and the question of whether intelligent robots are needed is addressed. The impact of ORNL research on uses for intelligent machines is described
Non-Newtonian Aspects of Artificial Intelligence
Zak, Michail
2016-05-01
The challenge of this work is to connect physics with the concept of intelligence. By intelligence we understand a capability to move from disorder to order without external resources, i.e., in violation of the second law of thermodynamics. The objective is to find such a mathematical object described by ODE that possesses such a capability. The proposed approach is based upon modification of the Madelung version of the Schrodinger equation by replacing the force following from quantum potential with non-conservative forces that link to the concept of information. A mathematical formalism suggests that a hypothetical intelligent particle, besides the capability to move against the second law of thermodynamics, acquires such properties like self-image, self-awareness, self-supervision, etc. that are typical for Livings. However since this particle being a quantum-classical hybrid acquires non-Newtonian and non-quantum properties, it does not belong to the physics matter as we know it: the modern physics should be complemented with the concept of the information force that represents a bridge to intelligent particle. As a follow-up of the proposed concept, the following question is addressed: can artificial intelligence (AI) system composed only of physical components compete with a human? The answer is proven to be negative if the AI system is based only on simulations, and positive if digital devices are included. It has been demonstrated that there exists such a quantum neural net that performs simulations combined with digital punctuations. The universality of this quantum-classical hybrid is in capability to violate the second law of thermodynamics by moving from disorder to order without external resources. This advanced capability is illustrated by examples. In conclusion, a mathematical machinery of the perception that is the fundamental part of a cognition process as well as intelligence is introduced and discussed.
Engineering general intelligence
Goertzel, Ben; Geisweiller, Nil
2014-01-01
The work outlines a novel conceptual and theoretical framework for understanding Artificial General Intelligence and based on this framework outlines a practical roadmap for the development of AGI with capability at the human level and ultimately beyond.
Understanding US National Intelligence
DEFF Research Database (Denmark)
Leander, Anna
2014-01-01
In July 2010, the Washington Post (WP) published the results of a project on “Top Secret America” on which twenty investigative journalists had been working for two years. The project drew attention to the change and growth in National Intelligence following 9/11 (Washington Post 2010a......). The initial idea had been to work on intelligence generally, but given that this proved overwhelming, the team narrowed down to focus only on intelligence qualified as “top secret.” Even so, the growth in this intelligence activity is remarkable. This public is returning, or in this case expanding...... at an impressive speed confirming the general contention of this volume. Between 2001 and 2010 the budget had increased by 250 percent, reaching $75 billion (the GDP of the Czech Republic). Thirty-three building complexes for top secret work had been or were under construction in the Washington area; 1...
Engineering general intelligence
Goertzel, Ben; Geisweiller, Nil
2014-01-01
The work outlines a detailed blueprint for the creation of an Artificial General Intelligence system with capability at the human level and ultimately beyond, according to the Cog Prime AGI design and the Open Cog software architecture.
Intelligence Issues for Congress
National Research Council Canada - National Science Library
Best, Jr, Richard A
2007-01-01
To address the challenges facing the U.S. Intelligence Community in the 21st century, congressional and executive branch initiatives have sought to improve coordination among the different agencies and to encourage better analysis...
Intelligence Issues for Congress
National Research Council Canada - National Science Library
Best, Jr, Richard A
2006-01-01
To address the challenges facing the U.S. Intelligence Community in the 21st Century, congressional and executive branch initiatives have sought to improve coordination among the different agencies and to encourage better analysis...
Intelligence Issues for Congress
National Research Council Canada - National Science Library
Best, Jr, Richard A
2008-01-01
To address the challenges facing the U.S. Intelligence Community in the 21st century, congressional and executive branch initiatives have sought to improve coordination among the different agencies and to encourage better analysis...
Intelligent Information Systems Institute
National Research Council Canada - National Science Library
Gomes, Carla
2004-01-01
...) at Cornell during the first three years of operation. IISI's mandate is threefold: To perform and stimulate research in computational and data-intensive methods for intelligent decision making systems...
Quo vadis, Intelligent Machine?
Directory of Open Access Journals (Sweden)
Rosemarie Velik
2010-09-01
Full Text Available Artificial Intelligence (AI is a branch of computer science concerned with making computers behave like humans. At least this was the original idea. However, it turned out that this is no task easy to be solved. This article aims to give a comprehensible review on the last 60 years of artificial intelligence taking a philosophical viewpoint. It is outlined what happened so far in AI, what is currently going on in this research area, and what can be expected in future. The goal is to mediate an understanding for the developments and changes in thinking in course of time about how to achieve machine intelligence. The clear message is that AI has to join forces with neuroscience and other brain disciplines in order to make a step towards the development of truly intelligent machines.
Bibliography: Artificial Intelligence.
Smith, Richard L.
1986-01-01
Annotates reference material on artificial intelligence, mostly at an introductory level, with applications to education and learning. Topics include: (1) programing languages; (2) expert systems; (3) language instruction; (4) tutoring systems; and (5) problem solving and reasoning. (JM)
Handbook of Intelligent Vehicles
2012-01-01
The Handbook of Intelligent Vehicles provides a complete coverage of the fundamentals, new technologies, and sub-areas essential to the development of intelligent vehicles; it also includes advances made to date, challenges, and future trends. Significant strides in the field have been made to date; however, so far there has been no single book or volume which captures these advances in a comprehensive format, addressing all essential components and subspecialties of intelligent vehicles, as this book does. Since the intended users are engineering practitioners, as well as researchers and graduate students, the book chapters do not only cover fundamentals, methods, and algorithms but also include how software/hardware are implemented, and demonstrate the advances along with their present challenges. Research at both component and systems levels are required to advance the functionality of intelligent vehicles. This volume covers both of these aspects in addition to the fundamentals listed above.
Genes, evolution and intelligence.
Bouchard, Thomas J
2014-11-01
I argue that the g factor meets the fundamental criteria of a scientific construct more fully than any other conception of intelligence. I briefly discuss the evidence regarding the relationship of brain size to intelligence. A review of a large body of evidence demonstrates that there is a g factor in a wide range of species and that, in the species studied, it relates to brain size and is heritable. These findings suggest that many species have evolved a general-purpose mechanism (a general biological intelligence) for dealing with the environments in which they evolved. In spite of numerous studies with considerable statistical power, we know of very few genes that influence g and the effects are very small. Nevertheless, g appears to be highly polygenic. Given the complexity of the human brain, it is not surprising that that one of its primary faculties-intelligence-is best explained by the near infinitesimal model of quantitative genetics.
Modelling intelligent behavior
Green, H. S.; Triffet, T.
1993-01-01
An introductory discussion of the related concepts of intelligence and consciousness suggests criteria to be met in the modeling of intelligence and the development of intelligent materials. Methods for the modeling of actual structure and activity of the animal cortex have been found, based on present knowledge of the ionic and cellular constitution of the nervous system. These have led to the development of a realistic neural network model, which has been used to study the formation of memory and the process of learning. An account is given of experiments with simple materials which exhibit almost all properties of biological synapses and suggest the possibility of a new type of computer architecture to implement an advanced type of artificial intelligence.
Emotional Intelligence: Requiring Attention
Directory of Open Access Journals (Sweden)
Monica Tudor
2016-01-01
Full Text Available This article aims to highlight the need for emotional intelligence. Two methods of measurementare presented in this research, in order to better understand the necessity of a correct result. Theresults of research can lead to recommendations for improving levels of emotional intelligence andare useful for obtaining data to better compare past and present result. The papers presented inthis research are significant for future study of this subject. The first paper presents the evolutionof emotional intelligence in the past two years, more specifically its decrease concerning certaincharacteristics. The second one presents a research on the differences between generations. Thethird one shows a difference in emotional intelligence levels of children from rural versus urbanenvironments and the obstacles that they encounter in their own development.
Intelligence Issues for Congress
National Research Council Canada - National Science Library
Best. Jr, Richard A
2006-01-01
To address the challenges facing the U.S. Intelligence Community in the 21st century, congressional and executive branch initiatives have sought to improve coordination among the different agencies and to encourage better analysis...