Computationally intensive econometrics using a distributed matrix-programming language.
Doornik, Jurgen A; Hendry, David F; Shephard, Neil
2002-06-15
This paper reviews the need for powerful computing facilities in econometrics, focusing on concrete problems which arise in financial economics and in macroeconomics. We argue that the profession is being held back by the lack of easy-to-use generic software which is able to exploit the availability of cheap clusters of distributed computers. Our response is to extend, in a number of directions, the well-known matrix-programming interpreted language Ox developed by the first author. We note three possible levels of extensions: (i) Ox with parallelization explicit in the Ox code; (ii) Ox with a parallelized run-time library; and (iii) Ox with a parallelized interpreter. This paper studies and implements the first case, emphasizing the need for deterministic computing in science. We give examples in the context of financial economics and time-series modelling.
Method of computer algebraic calculation of the matrix elements in the second quantization language
International Nuclear Information System (INIS)
Gotoh, Masashi; Mori, Kazuhide; Itoh, Reikichi
1995-01-01
An automated method by the algebraic programming language REDUCE3 for specifying the matrix elements expressed in second quantization language is presented and then applied to the case of the matrix elements in the TDHF theory. This program works in a very straightforward way by commuting the electron creation and annihilation operator (a † and a) until these operators have completely vanished from the expression of the matrix element under the appropriate elimination conditions. An improved method using singlet generators of unitary transformations in the place of the electron creation and annihilation operators is also presented. This improvement reduces the time and memory required for the calculation. These methods will make programming in the field of quantum chemistry much easier. 11 refs., 1 tab
Parallelism in matrix computations
Gallopoulos, Efstratios; Sameh, Ahmed H
2016-01-01
This book is primarily intended as a research monograph that could also be used in graduate courses for the design of parallel algorithms in matrix computations. It assumes general but not extensive knowledge of numerical linear algebra, parallel architectures, and parallel programming paradigms. The book consists of four parts: (I) Basics; (II) Dense and Special Matrix Computations; (III) Sparse Matrix Computations; and (IV) Matrix functions and characteristics. Part I deals with parallel programming paradigms and fundamental kernels, including reordering schemes for sparse matrices. Part II is devoted to dense matrix computations such as parallel algorithms for solving linear systems, linear least squares, the symmetric algebraic eigenvalue problem, and the singular-value decomposition. It also deals with the development of parallel algorithms for special linear systems such as banded ,Vandermonde ,Toeplitz ,and block Toeplitz systems. Part III addresses sparse matrix computations: (a) the development of pa...
Numerical methods in matrix computations
Björck, Åke
2015-01-01
Matrix algorithms are at the core of scientific computing and are indispensable tools in most applications in engineering. This book offers a comprehensive and up-to-date treatment of modern methods in matrix computation. It uses a unified approach to direct and iterative methods for linear systems, least squares and eigenvalue problems. A thorough analysis of the stability, accuracy, and complexity of the treated methods is given. Numerical Methods in Matrix Computations is suitable for use in courses on scientific computing and applied technical areas at advanced undergraduate and graduate level. A large bibliography is provided, which includes both historical and review papers as well as recent research papers. This makes the book useful also as a reference and guide to further study and research work. Åke Björck is a professor emeritus at the Department of Mathematics, Linköping University. He is a Fellow of the Society of Industrial and Applied Mathematics.
International Nuclear Information System (INIS)
Heggarty, J.W.
1999-06-01
For almost thirty years, sequential R-matrix computation has been used by atomic physics research groups, from around the world, to model collision phenomena involving the scattering of electrons or positrons with atomic or molecular targets. As considerable progress has been made in the understanding of fundamental scattering processes, new data, obtained from more complex calculations, is of current interest to experimentalists. Performing such calculations, however, places considerable demands on the computational resources to be provided by the target machine, in terms of both processor speed and memory requirement. Indeed, in some instances the computational requirements are so great that the proposed R-matrix calculations are intractable, even when utilising contemporary classic supercomputers. Historically, increases in the computational requirements of R-matrix computation were accommodated by porting the problem codes to a more powerful classic supercomputer. Although this approach has been successful in the past, it is no longer considered to be a satisfactory solution due to the limitations of current (and future) Von Neumann machines. As a consequence, there has been considerable interest in the high performance multicomputers, that have emerged over the last decade which appear to offer the computational resources required by contemporary R-matrix research. Unfortunately, developing codes for these machines is not as simple a task as it was to develop codes for successive classic supercomputers. The difficulty arises from the considerable differences in the computing models that exist between the two types of machine and results in the programming of multicomputers to be widely acknowledged as a difficult, time consuming and error-prone task. Nevertheless, unless parallel R-matrix computation is realised, important theoretical and experimental atomic physics research will continue to be hindered. This thesis describes work that was undertaken in
Pascal-SC a computer language for scientific computation
Bohlender, Gerd; von Gudenberg, Jürgen Wolff; Rheinboldt, Werner; Siewiorek, Daniel
1987-01-01
Perspectives in Computing, Vol. 17: Pascal-SC: A Computer Language for Scientific Computation focuses on the application of Pascal-SC, a programming language developed as an extension of standard Pascal, in scientific computation. The publication first elaborates on the introduction to Pascal-SC, a review of standard Pascal, and real floating-point arithmetic. Discussions focus on optimal scalar product, standard functions, real expressions, program structure, simple extensions, real floating-point arithmetic, vector and matrix arithmetic, and dynamic arrays. The text then examines functions a
Analysis of computer programming languages
International Nuclear Information System (INIS)
Risset, Claude Alain
1967-01-01
This research thesis aims at trying to identify some methods of syntax analysis which can be used for computer programming languages while putting aside computer devices which influence the choice of the programming language and methods of analysis and compilation. In a first part, the author proposes attempts of formalization of Chomsky grammar languages. In a second part, he studies analytical grammars, and then studies a compiler or analytic grammar for the Fortran language
Teaching natural language to computers
Corneli, Joseph; Corneli, Miriam
2016-01-01
"Natural Language," whether spoken and attended to by humans, or processed and generated by computers, requires networked structures that reflect creative processes in semantic, syntactic, phonetic, linguistic, social, emotional, and cultural modules. Being able to produce novel and useful behavior following repeated practice gets to the root of both artificial intelligence and human language. This paper investigates the modalities involved in language-like applications that computers -- and ...
Redesigning Triangular Dense Matrix Computations on GPUs
Charara, Ali; Ltaief, Hatem; Keyes, David E.
2016-01-01
A new implementation of the triangular matrix-matrix multiplication (TRMM) and the triangular solve (TRSM) kernels are described on GPU hardware accelerators. Although part of the Level 3 BLAS family, these highly computationally intensive kernels
A random matrix approach to language acquisition
Nicolaidis, A.; Kosmidis, Kosmas; Argyrakis, Panos
2009-12-01
Since language is tied to cognition, we expect the linguistic structures to reflect patterns that we encounter in nature and are analyzed by physics. Within this realm we investigate the process of lexicon acquisition, using analytical and tractable methods developed within physics. A lexicon is a mapping between sounds and referents of the perceived world. This mapping is represented by a matrix and the linguistic interaction among individuals is described by a random matrix model. There are two essential parameters in our approach. The strength of the linguistic interaction β, which is considered as a genetically determined ability, and the number N of sounds employed (the lexicon size). Our model of linguistic interaction is analytically studied using methods of statistical physics and simulated by Monte Carlo techniques. The analysis reveals an intricate relationship between the innate propensity for language acquisition β and the lexicon size N, N~exp(β). Thus a small increase of the genetically determined β may lead to an incredible lexical explosion. Our approximate scheme offers an explanation for the biological affinity of different species and their simultaneous linguistic disparity.
A random matrix approach to language acquisition
International Nuclear Information System (INIS)
Nicolaidis, A; Kosmidis, Kosmas; Argyrakis, Panos
2009-01-01
Since language is tied to cognition, we expect the linguistic structures to reflect patterns that we encounter in nature and are analyzed by physics. Within this realm we investigate the process of lexicon acquisition, using analytical and tractable methods developed within physics. A lexicon is a mapping between sounds and referents of the perceived world. This mapping is represented by a matrix and the linguistic interaction among individuals is described by a random matrix model. There are two essential parameters in our approach. The strength of the linguistic interaction β, which is considered as a genetically determined ability, and the number N of sounds employed (the lexicon size). Our model of linguistic interaction is analytically studied using methods of statistical physics and simulated by Monte Carlo techniques. The analysis reveals an intricate relationship between the innate propensity for language acquisition β and the lexicon size N, N∼exp(β). Thus a small increase of the genetically determined β may lead to an incredible lexical explosion. Our approximate scheme offers an explanation for the biological affinity of different species and their simultaneous linguistic disparity
Quantum Computers and Quantum Computer Languages: Quantum Assembly Language and Quantum C Language
Blaha, Stephen
2002-01-01
We show a representation of Quantum Computers defines Quantum Turing Machines with associated Quantum Grammars. We then create examples of Quantum Grammars. Lastly we develop an algebraic approach to high level Quantum Languages using Quantum Assembly language and Quantum C language as examples.
Computers and Languages: Theory and Practice
Nijholt, Antinus
A global introduction to language technology and the areas of computer science where language technology plays a role. Surveyed in this volume are issueas related to the parsing problem in the fields of natural languages, programming languages, and formal languages. Throughout the book attention is
Distributed-memory matrix computations
DEFF Research Database (Denmark)
Balle, Susanne Mølleskov
1995-01-01
The main goal of this project is to investigate, develop, and implement algorithms for numerical linear algebra on parallel computers in order to acquire expertise in methods for parallel computations. An important motivation for analyzaing and investigating the potential for parallelism in these......The main goal of this project is to investigate, develop, and implement algorithms for numerical linear algebra on parallel computers in order to acquire expertise in methods for parallel computations. An important motivation for analyzaing and investigating the potential for parallelism...... in these algorithms is that many scientific applications rely heavily on the performance of the involved dense linear algebra building blocks. Even though we consider the distributed-memory as well as the shared-memory programming paradigm, the major part of the thesis is dedicated to distributed-memory architectures....... We emphasize distributed-memory massively parallel computers - such as the Connection Machines model CM-200 and model CM-5/CM-5E - available to us at UNI-C and at Thinking Machines Corporation. The CM-200 was at the time this project started one of the few existing massively parallel computers...
Computability, complexity, and languages fundamentals of theoretical computer science
Davis, Martin D; Rheinboldt, Werner
1983-01-01
Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science provides an introduction to the various aspects of theoretical computer science. Theoretical computer science is the mathematical study of models of computation. This text is composed of five parts encompassing 17 chapters, and begins with an introduction to the use of proofs in mathematics and the development of computability theory in the context of an extremely simple abstract programming language. The succeeding parts demonstrate the performance of abstract programming language using a macro expa
Computers and languages theory and practice
Nijholt, A
1988-01-01
A global introduction to language technology and the areas of computer science where language technology plays a role. Surveyed in this volume are issues related to the parsing problem in the fields of natural languages, programming languages, and formal languages.Throughout the book attention is paid to the social forces which influenced the development of the various topics. Also illustrated are the development of the theory of language analysis, its role in compiler construction, and its role in computer applications with a natural language interface between men and machine. Parts of the ma
High-level language computer architecture
Chu, Yaohan
1975-01-01
High-Level Language Computer Architecture offers a tutorial on high-level language computer architecture, including von Neumann architecture and syntax-oriented architecture as well as direct and indirect execution architecture. Design concepts of Japanese-language data processing systems are discussed, along with the architecture of stack machines and the SYMBOL computer system. The conceptual design of a direct high-level language processor is also described.Comprised of seven chapters, this book first presents a classification of high-level language computer architecture according to the pr
Language evolution and human-computer interaction
Grudin, Jonathan; Norman, Donald A.
1991-01-01
Many of the issues that confront designers of interactive computer systems also appear in natural language evolution. Natural languages and human-computer interfaces share as their primary mission the support of extended 'dialogues' between responsive entities. Because in each case one participant is a human being, some of the pressures operating on natural languages, causing them to evolve in order to better support such dialogue, also operate on human-computer 'languages' or interfaces. This does not necessarily push interfaces in the direction of natural language - since one entity in this dialogue is not a human, this is not to be expected. Nonetheless, by discerning where the pressures that guide natural language evolution also appear in human-computer interaction, we can contribute to the design of computer systems and obtain a new perspective on natural languages.
Computer Language Settings and Canadian Spellings
Shuttleworth, Roger
2011-01-01
The language settings used on personal computers interact with the spell-checker in Microsoft Word, which directly affects the flagging of spellings that are deemed incorrect. This study examined the language settings of personal computers owned by a group of Canadian university students. Of 21 computers examined, only eight had their Windows…
Computer Assisted Language Learning (CALL) Software: Evaluation ...
African Journals Online (AJOL)
Evaluating the nature and extent of the influence of Computer Assisted Language Learning (CALL) on the quality of language learning is highly problematic. This is owing to the number and complexity of interacting variables involved in setting the items for teaching and learning languages. This paper identified and ...
Efficient computation method of Jacobian matrix
International Nuclear Information System (INIS)
Sasaki, Shinobu
1995-05-01
As well known, the elements of the Jacobian matrix are complex trigonometric functions of the joint angles, resulting in a matrix of staggering complexity when we write it all out in one place. This article addresses that difficulties to this subject are overcome by using velocity representation. The main point is that its recursive algorithm and computer algebra technologies allow us to derive analytical formulation with no human intervention. Particularly, it is to be noted that as compared to previous results the elements are extremely simplified throughout the effective use of frame transformations. Furthermore, in case of a spherical wrist, it is shown that the present approach is computationally most efficient. Due to such advantages, the proposed method is useful in studying kinematically peculiar properties such as singularity problems. (author)
Redesigning Triangular Dense Matrix Computations on GPUs
Charara, Ali
2016-08-09
A new implementation of the triangular matrix-matrix multiplication (TRMM) and the triangular solve (TRSM) kernels are described on GPU hardware accelerators. Although part of the Level 3 BLAS family, these highly computationally intensive kernels fail to achieve the percentage of the theoretical peak performance on GPUs that one would expect when running kernels with similar surface-to-volume ratio on hardware accelerators, i.e., the standard matrix-matrix multiplication (GEMM). The authors propose adopting a recursive formulation, which enriches the TRMM and TRSM inner structures with GEMM calls and, therefore, reduces memory traffic while increasing the level of concurrency. The new implementation enables efficient use of the GPU memory hierarchy and mitigates the latency overhead, to run at the speed of the higher cache levels. Performance comparisons show up to eightfold and twofold speedups for large dense matrix sizes, against the existing state-of-the-art TRMM and TRSM implementations from NVIDIA cuBLAS, respectively, across various GPU generations. Once integrated into high-level Cholesky-based dense linear algebra algorithms, the performance impact on the overall applications demonstrates up to fourfold and twofold speedups, against the equivalent native implementations, linked with cuBLAS TRMM and TRSM kernels, respectively. The new TRMM/TRSM kernel implementations are part of the open-source KBLAS software library (http://ecrc.kaust.edu.sa/Pages/Res-kblas.aspx) and are lined up for integration into the NVIDIA cuBLAS library in the upcoming v8.0 release.
Computer Language For Optimization Of Design
Scotti, Stephen J.; Lucas, Stephen H.
1991-01-01
SOL is computer language geared to solution of design problems. Includes mathematical modeling and logical capabilities of computer language like FORTRAN; also includes additional power of nonlinear mathematical programming methods at language level. SOL compiler takes SOL-language statements and generates equivalent FORTRAN code and system calls. Provides syntactic and semantic checking for recovery from errors and provides detailed reports containing cross-references to show where each variable used. Implemented on VAX/VMS computer systems. Requires VAX FORTRAN compiler to produce executable program.
Contracting for Computer Software in Standardized Computer Languages
Brannigan, Vincent M.; Dayhoff, Ruth E.
1982-01-01
The interaction between standardized computer languages and contracts for programs which use these languages is important to the buyer or seller of software. The rationale for standardization, the problems in standardizing computer languages, and the difficulties of determining whether the product conforms to the standard are issues which must be understood. The contract law processes of delivery, acceptance testing, acceptance, rejection, and revocation of acceptance are applicable to the contracting process for standard language software. Appropriate contract language is suggested for requiring strict compliance with a standard, and an overview of remedies is given for failure to comply.
A New Language Design for Prototyping Numerical Computation
Directory of Open Access Journals (Sweden)
Thomas Derby
1996-01-01
Full Text Available To naturally and conveniently express numerical algorithms, considerable expressive power is needed in the languages in which they are implemented. The language Matlab is widely used by numerical analysts for this reason. Expressiveness or ease-of-use can also result in a loss of efficiency, as is the case with Matlab. In particular, because numerical analysts are highly interested in the performance of their algorithms, prototypes are still often implemented in languages such as Fortran. In this article we describe a language design that is intended to both provide expressiveness for numerical computation, and at the same time provide performance guarantees. In our language, EQ, we attempt to include both syntactic and semantic features that correspond closely to the programmer's model of the problem, including unordered equations, large-granularity state transitions, and matrix notation. The resulting language does not fit into standard language categories such as functional or imperative but has features of both paradigms. We also introduce the notion of language dependability, which is the idea that a language should guarantee that certain program transformations are performed by all implementations. We first describe the interesting features of EQ, and then present three examples of algorithms written using it. We also provide encouraging performance results from an initial implementation of our language.
System Matrix Analysis for Computed Tomography Imaging
Flores, Liubov; Vidal, Vicent; Verdú, Gumersindo
2015-01-01
In practical applications of computed tomography imaging (CT), it is often the case that the set of projection data is incomplete owing to the physical conditions of the data acquisition process. On the other hand, the high radiation dose imposed on patients is also undesired. These issues demand that high quality CT images can be reconstructed from limited projection data. For this reason, iterative methods of image reconstruction have become a topic of increased research interest. Several algorithms have been proposed for few-view CT. We consider that the accurate solution of the reconstruction problem also depends on the system matrix that simulates the scanning process. In this work, we analyze the application of the Siddon method to generate elements of the matrix and we present results based on real projection data. PMID:26575482
Contracting for Computer Software in Standardized Computer Languages
Brannigan, Vincent M.; Dayhoff, Ruth E.
1982-01-01
The interaction between standardized computer languages and contracts for programs which use these languages is important to the buyer or seller of software. The rationale for standardization, the problems in standardizing computer languages, and the difficulties of determining whether the product conforms to the standard are issues which must be understood. The contract law processes of delivery, acceptance testing, acceptance, rejection, and revocation of acceptance are applicable to the co...
Computer Programming Languages for Health Care
O'Neill, Joseph T.
1979-01-01
This paper advocates the use of standard high level programming languages for medical computing. It recommends that U.S. Government agencies having health care missions implement coordinated policies that encourage the use of existing standard languages and the development of new ones, thereby enabling them and the medical computing community at large to share state-of-the-art application programs. Examples are based on a model that characterizes language and language translator influence upon the specification, development, test, evaluation, and transfer of application programs.
Gabriela Mistral, in a Maternal-Matrix-Material Language
Directory of Open Access Journals (Sweden)
María Binetti
2017-10-01
Full Text Available For some decades, feminist thinkers such as Luce Irigaray, Luisa Muraro and Rosi Braidotti —among others— have tried to reconstruct the ontological assumptions of a language independent of the abstract phallogocentric logic, emerging by metonymic mediation from the maternal-material-matristic substrate, in essential continuity with that origin and immediate connection with life. In the context of this new maternal-matrix-material symbolic, this article aims to read Mistralian poetics, conceived and nurtured by the same matrix from which life is born.
Structured Design Language for Computer Programs
Pace, Walter H., Jr.
1986-01-01
Box language used at all stages of program development. Developed to provide improved productivity in designing, coding, and maintaining computer programs. BOX system written in FORTRAN 77 for batch execution.
Beta-shifts, their languages and computability
DEFF Research Database (Denmark)
Simonsen, Jakob Grue
2011-01-01
they give into the dynamics of the underlying system. We prove that the language of the ß-shift is recursive iff ß is a computable real number. That fact yields a precise characterization of the reals: The real numbers ß for which we can compute arbitrarily good approximations—hence in particular......For every real number ß >1, the ß-shift is a dynamical system describing iterations of the map x ¿ ßx mod 1 and is studied intensively in number theory. Each ß-shift has an associated language of finite strings of characters; properties of this language are studied for the additional insight...
Computer language evaluation for MFTF SCDS
International Nuclear Information System (INIS)
Anderson, R.E.; McGoldrick, P.R.; Wyman, R.H.
1979-01-01
The computer languages available for the systems and application implementation on the Supervisory Control and Diagnostics System (SCDS) for the Mirror Fusion Test Facility (MFTF) were surveyed and evaluated. Four language processors, CAL (Common Assembly Language), Extended FORTRAN, CORAL 66, and Sequential Pascal (SPASCAL, a subset of Concurrent Pascal [CPASCAL]) are commercially available for the Interdata 7/32 and 8/32 computers that constitute the SCDS. Of these, the Sequential Pascal available from Kansas State University appears best for the job in terms of minimizing the implementation time, debugging time, and maintenance time. This improvement in programming productivity is due to the availability of a high-level, block-structured language that includes many compile-time and run-time checks to detect errors. In addition, the advanced data-types in language allow easy description of the program variables. 1 table
“Computer Assisted Language Learning” (CALL
Directory of Open Access Journals (Sweden)
Nazlı Gündüz
2005-10-01
Full Text Available This article will provide an overview of computers; an overview of the history of CALL, itspros and cons, the internet, World Wide Web, Multimedia, and research related to the uses of computers in the language classroom. Also, it also aims to provide some background for the beginnerson using the Internet in language classes today. It discusses some of the common types of Internetactivities that are being used today, what the minimum requirements are for using the Internet forlanguage learning, and some easy activities you can adapt for your classes. Some special terminology related to computers will also be used in this paper. For example, computer assisted language learning(CALL refers to the sets of instructions which need to be loaded into the computer for it to be able to work in the language classroom. It should be borne in mind that CALL does not refer to the use of acomputer by a teacher to type out a worksheet or a class list or preparing his/her own teaching alone.Hardware refers to any computer equipment used, including the computer itself, the keyboard, screen (or the monitor, the disc-drive, and the printer. Software (computer programs refers to the sets of instructions which need to be loaded into the computer for it to be able to work.
Quantum Computers and Quantum Computer Languages: Quantum Assembly Language and Quantum C
Blaha, Stephen
2002-01-01
We show a representation of Quantum Computers defines Quantum Turing Machines with associated Quantum Grammars. We then create examples of Quantum Grammars. Lastly we develop an algebraic approach to high level Quantum Languages using Quantum Assembly language and Quantum C language as examples.
Exploring HPCS languages in scientific computing
International Nuclear Information System (INIS)
Barrett, R F; Alam, S R; Almeida, V F d; Bernholdt, D E; Elwasif, W R; Kuehn, J A; Poole, S W; Shet, A G
2008-01-01
As computers scale up dramatically to tens and hundreds of thousands of cores, develop deeper computational and memory hierarchies, and increased heterogeneity, developers of scientific software are increasingly challenged to express complex parallel simulations effectively and efficiently. In this paper, we explore the three languages developed under the DARPA High-Productivity Computing Systems (HPCS) program to help address these concerns: Chapel, Fortress, and X10. These languages provide a variety of features not found in currently popular HPC programming environments and make it easier to express powerful computational constructs, leading to new ways of thinking about parallel programming. Though the languages and their implementations are not yet mature enough for a comprehensive evaluation, we discuss some of the important features, and provide examples of how they can be used in scientific computing. We believe that these characteristics will be important to the future of high-performance scientific computing, whether the ultimate language of choice is one of the HPCS languages or something else
Exploring HPCS languages in scientific computing
Barrett, R. F.; Alam, S. R.; Almeida, V. F. d.; Bernholdt, D. E.; Elwasif, W. R.; Kuehn, J. A.; Poole, S. W.; Shet, A. G.
2008-07-01
As computers scale up dramatically to tens and hundreds of thousands of cores, develop deeper computational and memory hierarchies, and increased heterogeneity, developers of scientific software are increasingly challenged to express complex parallel simulations effectively and efficiently. In this paper, we explore the three languages developed under the DARPA High-Productivity Computing Systems (HPCS) program to help address these concerns: Chapel, Fortress, and X10. These languages provide a variety of features not found in currently popular HPC programming environments and make it easier to express powerful computational constructs, leading to new ways of thinking about parallel programming. Though the languages and their implementations are not yet mature enough for a comprehensive evaluation, we discuss some of the important features, and provide examples of how they can be used in scientific computing. We believe that these characteristics will be important to the future of high-performance scientific computing, whether the ultimate language of choice is one of the HPCS languages or something else.
Development of the Tensoral Computer Language
Ferziger, Joel; Dresselhaus, Eliot
1996-01-01
The research scientist or engineer wishing to perform large scale simulations or to extract useful information from existing databases is required to have expertise in the details of the particular database, the numerical methods and the computer architecture to be used. This poses a significant practical barrier to the use of simulation data. The goal of this research was to develop a high-level computer language called Tensoral, designed to remove this barrier. The Tensoral language provides a framework in which efficient generic data manipulations can be easily coded and implemented. First of all, Tensoral is general. The fundamental objects in Tensoral represent tensor fields and the operators that act on them. The numerical implementation of these tensors and operators is completely and flexibly programmable. New mathematical constructs and operators can be easily added to the Tensoral system. Tensoral is compatible with existing languages. Tensoral tensor operations co-exist in a natural way with a host language, which may be any sufficiently powerful computer language such as Fortran, C, or Vectoral. Tensoral is very-high-level. Tensor operations in Tensoral typically act on entire databases (i.e., arrays) at one time and may, therefore, correspond to many lines of code in a conventional language. Tensoral is efficient. Tensoral is a compiled language. Database manipulations are simplified optimized and scheduled by the compiler eventually resulting in efficient machine code to implement them.
Semantic computing and language knowledge bases
Wang, Lei; Wang, Houfeng; Yu, Shiwen
2017-09-01
As the proposition of the next-generation Web - semantic Web, semantic computing has been drawing more and more attention within the circle and the industries. A lot of research has been conducted on the theory and methodology of the subject, and potential applications have also been investigated and proposed in many fields. The progress of semantic computing made so far cannot be detached from its supporting pivot - language resources, for instance, language knowledge bases. This paper proposes three perspectives of semantic computing from a macro view and describes the current status of affairs about the construction of language knowledge bases and the related research and applications that have been carried out on the basis of these resources via a case study in the Institute of Computational Linguistics at Peking University.
Computer Assisted Language Learning. Routledge Studies in Computer Assisted Language Learning
Pennington, Martha
2011-01-01
Computer-assisted language learning (CALL) is an approach to language teaching and learning in which computer technology is used as an aid to the presentation, reinforcement and assessment of material to be learned, usually including a substantial interactive element. This books provides an up-to date and comprehensive overview of…
Elements of matrix modeling and computing with Matlab
White, Robert E
2006-01-01
As discrete models and computing have become more common, there is a need to study matrix computation and numerical linear algebra. Encompassing a diverse mathematical core, Elements of Matrix Modeling and Computing with MATLAB examines a variety of applications and their modeling processes, showing you how to develop matrix models and solve algebraic systems. Emphasizing practical skills, it creates a bridge from problems with two and three variables to more realistic problems that have additional variables. Elements of Matrix Modeling and Computing with MATLAB focuses on seven basic applicat
Random matrix model of adiabatic quantum computing
International Nuclear Information System (INIS)
Mitchell, David R.; Adami, Christoph; Lue, Waynn; Williams, Colin P.
2005-01-01
We present an analysis of the quantum adiabatic algorithm for solving hard instances of 3-SAT (an NP-complete problem) in terms of random matrix theory (RMT). We determine the global regularity of the spectral fluctuations of the instantaneous Hamiltonians encountered during the interpolation between the starting Hamiltonians and the ones whose ground states encode the solutions to the computational problems of interest. At each interpolation point, we quantify the degree of regularity of the average spectral distribution via its Brody parameter, a measure that distinguishes regular (i.e., Poissonian) from chaotic (i.e., Wigner-type) distributions of normalized nearest-neighbor spacings. We find that for hard problem instances - i.e., those having a critical ratio of clauses to variables - the spectral fluctuations typically become irregular across a contiguous region of the interpolation parameter, while the spectrum is regular for easy instances. Within the hard region, RMT may be applied to obtain a mathematical model of the probability of avoided level crossings and concomitant failure rate of the adiabatic algorithm due to nonadiabatic Landau-Zener-type transitions. Our model predicts that if the interpolation is performed at a uniform rate, the average failure rate of the quantum adiabatic algorithm, when averaged over hard problem instances, scales exponentially with increasing problem size
New Computer Terms in Bloggers’ Language
Directory of Open Access Journals (Sweden)
Vilija Celiešienė
2012-06-01
Full Text Available The article presents an analysis of new words in computer terminology that make their way to blogs and analyzes how the official neologisms and computer terms, especially the equivalents to barbarisms, are employed in everyday use. The article also discusses the ways of including the new computer terms into texts. The blogs on topics of information technology are the objects of the research. The analysis of the aforementioned blogs allowed highlighting certain trends in the use of new computer terms. An observation was made that even though the authors of the blogs could freely choose their writing style, they were not bound by the standards of literary language. Thus, their language was full of non-standard vocabulary; however, self-control regarding the language used could still be noticed. An interest in novelties of computer terminology and the tendency to accept some of the suggested new Lithuanian and loaned computer terms were noticed. When using the new words the bloggers frequently employed specific graphical elements and (or comments. The graphical elements were often chosen by bloggers to express their feelings of doubt regarding the suitability of the use of the suggested loanword. Attempting to explain the meaning of the new word to the readers the bloggers tended to post comments about the new computer terms.
Computers in Language Testing: Present Research and Some Future Directions.
Brown, James Dean
1997-01-01
Explores recent developments in the use of computers in language testing in four areas: (1) item banking; (2) computer-assisted language testing; (3) computerized-adaptive language testing; and (4) research on the effectiveness of computers in language testing. Examines educational measurement literature in an attempt to forecast the directions…
Some issues of creation of belarusian language computer resources
Rubashko, N.; Nevmerjitskaia, G.
2003-01-01
The main reason for creation of computer resources of natural language is the necessity to bring into accord the ways of language normalization with the form of its existence - the computer form of language usage should correspond to the computer form of language standards fixation. This paper discusses various aspects of the creation of Belarusian language computer resources. It also briefly gives an overview of the objectives of the project involved.
Foreign Language Teaching and the Computer.
Garrett, Nina, Ed.; Hart, Robert S., Ed.
1986-01-01
"Juegos comunicativos," a software program designed for use with the Apple IIe, IIc, or II+, emphasizes "communicative" computer-assisted Spanish language learning through five educational games. The program uses Spanish vocabulary and structures to solve "problems" rather than the standard drill-and-practice format.…
Enhancing Language Material Availability Using Computers.
Miyashita, Mizuki; Moll, Laura A.
This paper describes the use of computer technology to produce an updated online Tohono O'odham dictionary. Spoken in southern Arizona and northern Mexico, Tohono O'odham (formerly Papago) and its close relative Akimel O'odham (Pima) had a total of about 25,000 speakers in 1988. Although the language is taught to school children through community…
Efficacy of Computer Games on Language Learning
Klimova, Blanka; Kacet, Jaroslav
2017-01-01
Information and communication technologies (ICT) have become an inseparable part of people's lives. For children the use of ICT is as natural as breathing and therefore they find the use of ICT in school education as normal as the use of textbooks. The purpose of this review study is to explore the efficacy of computer games on language learning…
An Overview of Computer-Based Natural Language Processing.
Gevarter, William B.
Computer-based Natural Language Processing (NLP) is the key to enabling humans and their computer-based creations to interact with machines using natural languages (English, Japanese, German, etc.) rather than formal computer languages. NLP is a major research area in the fields of artificial intelligence and computational linguistics. Commercial…
Theory of automata, formal languages and computation
Xavier, SPE
2004-01-01
This book is aimed at providing an introduction to the basic models of computability to the undergraduate students. This book is devoted to Finite Automata and their properties. Pushdown Automata provides a class of models and enables the analysis of context-free languages. Turing Machines have been introduced and the book discusses computability and decidability. A number of problems with solutions have been provided for each chapter. A lot of exercises have been given with hints/answers to most of these tutorial problems.
Natural language processing tools for computer assisted language learning
Directory of Open Access Journals (Sweden)
Vandeventer Faltin, Anne
2003-01-01
Full Text Available This paper illustrates the usefulness of natural language processing (NLP tools for computer assisted language learning (CALL through the presentation of three NLP tools integrated within a CALL software for French. These tools are (i a sentence structure viewer; (ii an error diagnosis system; and (iii a conjugation tool. The sentence structure viewer helps language learners grasp the structure of a sentence, by providing lexical and grammatical information. This information is derived from a deep syntactic analysis. Two different outputs are presented. The error diagnosis system is composed of a spell checker, a grammar checker, and a coherence checker. The spell checker makes use of alpha-codes, phonological reinterpretation, and some ad hoc rules to provide correction proposals. The grammar checker employs constraint relaxation and phonological reinterpretation as diagnosis techniques. The coherence checker compares the underlying "semantic" structures of a stored answer and of the learners' input to detect semantic discrepancies. The conjugation tool is a resource with enhanced capabilities when put on an electronic format, enabling searches from inflected and ambiguous verb forms.
Curiel, Emily S. L.; Sainato, Diane M.; Goldstein, Howard
2016-01-01
Matrix training is a systematic teaching approach that can facilitate generalized language. Specific responses are taught that result in the emergence of untrained responses. This type of training facilitates the use of generalized language in children with autism spectrum disorder (ASD). This study used a matrix training procedure with a toddler…
Computing the eigenvalues and eigenvectors of a fuzzy matrix
Directory of Open Access Journals (Sweden)
A. Kumar
2012-08-01
Full Text Available Computation of fuzzy eigenvalues and fuzzy eigenvectors of a fuzzy matrix is a challenging problem. Determining the maximal and minimal symmetric solution can help to find the eigenvalues. So, we try to compute these eigenvalues by determining the maximal and minimal symmetric solution of the fully fuzzy linear system $widetilde{A}widetilde{X}= widetilde{lambda} widetilde{X}.$
Computer modelling as a tool for understanding language evolution
de Boer, Bart; Gontier, N; VanBendegem, JP; Aerts, D
2006-01-01
This paper describes the uses of computer models in studying the evolution of language. Language is a complex dynamic system that can be studied at the level of the individual and at the level of the population. Much of the dynamics of language evolution and language change occur because of the
Exploiting Data Sparsity for Large-Scale Matrix Computations
Akbudak, Kadir; Ltaief, Hatem; Mikhalev, Aleksandr; Charara, Ali; Keyes, David E.
2018-01-01
Exploiting data sparsity in dense matrices is an algorithmic bridge between architectures that are increasingly memory-austere on a per-core basis and extreme-scale applications. The Hierarchical matrix Computations on Manycore Architectures (HiCMA) library tackles this challenging problem by achieving significant reductions in time to solution and memory footprint, while preserving a specified accuracy requirement of the application. HiCMA provides a high-performance implementation on distributed-memory systems of one of the most widely used matrix factorization in large-scale scientific applications, i.e., the Cholesky factorization. It employs the tile low-rank data format to compress the dense data-sparse off-diagonal tiles of the matrix. It then decomposes the matrix computations into interdependent tasks and relies on the dynamic runtime system StarPU for asynchronous out-of-order scheduling, while allowing high user-productivity. Performance comparisons and memory footprint on matrix dimensions up to eleven million show a performance gain and memory saving of more than an order of magnitude for both metrics on thousands of cores, against state-of-the-art open-source and vendor optimized numerical libraries. This represents an important milestone in enabling large-scale matrix computations toward solving big data problems in geospatial statistics for climate/weather forecasting applications.
Exploiting Data Sparsity for Large-Scale Matrix Computations
Akbudak, Kadir
2018-02-24
Exploiting data sparsity in dense matrices is an algorithmic bridge between architectures that are increasingly memory-austere on a per-core basis and extreme-scale applications. The Hierarchical matrix Computations on Manycore Architectures (HiCMA) library tackles this challenging problem by achieving significant reductions in time to solution and memory footprint, while preserving a specified accuracy requirement of the application. HiCMA provides a high-performance implementation on distributed-memory systems of one of the most widely used matrix factorization in large-scale scientific applications, i.e., the Cholesky factorization. It employs the tile low-rank data format to compress the dense data-sparse off-diagonal tiles of the matrix. It then decomposes the matrix computations into interdependent tasks and relies on the dynamic runtime system StarPU for asynchronous out-of-order scheduling, while allowing high user-productivity. Performance comparisons and memory footprint on matrix dimensions up to eleven million show a performance gain and memory saving of more than an order of magnitude for both metrics on thousands of cores, against state-of-the-art open-source and vendor optimized numerical libraries. This represents an important milestone in enabling large-scale matrix computations toward solving big data problems in geospatial statistics for climate/weather forecasting applications.
A high level language for a high performance computer
Perrott, R. H.
1978-01-01
The proposed computational aerodynamic facility will join the ranks of the supercomputers due to its architecture and increased execution speed. At present, the languages used to program these supercomputers have been modifications of programming languages which were designed many years ago for sequential machines. A new programming language should be developed based on the techniques which have proved valuable for sequential programming languages and incorporating the algorithmic techniques required for these supercomputers. The design objectives for such a language are outlined.
Computer Understanding of Conventional Metaphoric Language
National Research Council Canada - National Science Library
Martin, James H
1990-01-01
.... This approach asserts that the interpretation of conventional metaphoric language should proceed through the direct application of specific knowledge about the metaphors in the language. MIDAS...
Computer Assisted Language Learning (CALL): Using Internet for Effective Language Learning
Kremenska, Anelly
2006-01-01
Please, cite this publication as: Kremenska, A. (2006). Computer Assisted Language Learning (CALL): Using Internet for Effective Language Learning. Proceedings of International Workshop in Learning Networks for Lifelong Competence Development, TENCompetence Conference. March 30th-31st, Sofia,
Scientific Computing in the CH Programming Language
Directory of Open Access Journals (Sweden)
Harry H. Cheng
1993-01-01
Full Text Available We have developed a general-purpose block-structured interpretive programming Ianguage. The syntax and semantics of this language called CH are similar to C. CH retains most features of C from the scientific computing point of view. In this paper, the extension of C to CH for numerical computation of real numbers will be described. Metanumbers of −0.0, 0.0, Inf, −Inf, and NaN are introduced in CH. Through these metanumbers, the power of the IEEE 754 arithmetic standard is easily available to the programmer. These metanumbers are extended to commonly used mathematical functions in the spirit of the IEEE 754 standard and ANSI C. The definitions for manipulation of these metanumbers in I/O; arithmetic, relational, and logic operations; and built-in polymorphic mathematical functions are defined. The capabilities of bitwise, assignment, address and indirection, increment and decrement, as well as type conversion operations in ANSI C are extended in CH. In this paper, mainly new linguistic features of CH in comparison to C will be described. Example programs programmed in CH with metanumbers and polymorphic mathematical functions will demonstrate capabilities of CH in scientific computing.
Parallel algorithms for computation of the manipulator inertia matrix
Amin-Javaheri, Masoud; Orin, David E.
1989-01-01
The development of an O(log2N) parallel algorithm for the manipulator inertia matrix is presented. It is based on the most efficient serial algorithm which uses the composite rigid body method. Recursive doubling is used to reformulate the linear recurrence equations which are required to compute the diagonal elements of the matrix. It results in O(log2N) levels of computation. Computation of the off-diagonal elements involves N linear recurrences of varying-size and a new method, which avoids redundant computation of position and orientation transforms for the manipulator, is developed. The O(log2N) algorithm is presented in both equation and graphic forms which clearly show the parallelism inherent in the algorithm.
Linguistics, Computers, and the Language Teacher. A Communicative Approach.
Underwood, John H.
This analysis of the state of the art of computer programs and programming for language teaching has two parts. In the first part, an overview of the theory and practice of language teaching, Noam Chomsky's view of language, and the implications and problems of generative theory are presented. The theory behind the input model of language…
An Intelligent Computer Assisted Language Learning System for Arabic Learners
Shaalan, Khaled F.
2005-01-01
This paper describes the development of an intelligent computer-assisted language learning (ICALL) system for learning Arabic. This system could be used for learning Arabic by students at primary schools or by learners of Arabic as a second or foreign language. It explores the use of Natural Language Processing (NLP) techniques for learning…
Natural language computing an English generative grammar in Prolog
Dougherty, Ray C
2013-01-01
This book's main goal is to show readers how to use the linguistic theory of Noam Chomsky, called Universal Grammar, to represent English, French, and German on a computer using the Prolog computer language. In so doing, it presents a follow-the-dots approach to natural language processing, linguistic theory, artificial intelligence, and expert systems. The basic idea is to introduce meaningful answers to significant problems involved in representing human language data on a computer. The book offers a hands-on approach to anyone who wishes to gain a perspective on natural language
Computer-Assisted Language Learning: Diversity in Research and Practice
Stockwell, Glenn, Ed.
2012-01-01
Computer-assisted language learning (CALL) is an approach to teaching and learning languages that uses computers and other technologies to present, reinforce, and assess material to be learned, or to create environments where teachers and learners can interact with one another and the outside world. This book provides a much-needed overview of the…
The use of Computer Assisted Language Learning (CALL) Devices ...
African Journals Online (AJOL)
Despite the numerous advantages that can be made of the computer in language teaching, many ... be made of the computer in English Language teaching by low technologically exposed teachers. ... http://dx.doi.org/10.4314/ict.v2i1.31950.
Learning theories in computer-assisted foreign language acquisition
Baeva, D.
2013-01-01
This paper reviews the learning theories, focusing to the strong interest in technology use for language learning. It is important to look at how technology has been used in the field thus far. The goals of this review are to understand how computers have been used in the past years to support foreign language learning, and to explore any research evidence with regards to how computer technology can enhance language skills acquisition
Can Computers Be Used for Whole Language Approaches to Reading and Language Arts?
Balajthy, Ernest
Holistic approaches to the teaching of reading and writing, most notably the Whole Language movement, reject the philosophy that language skills can be taught. Instead, holistic teachers emphasize process, and they structure the students' classroom activities to be rich in language experience. Computers can be used as tools for whole language…
Appelo, L.; de Jong, Franciska M.G.
1994-01-01
TWLT is an acronym of Twente Workshop(s) on Language Technology. These workshops on natural language theory and technology are organised bij Project Parlevink (sometimes with the help of others) a language theory and technology project conducted at the Department of Computer Science of the
A stochastic method for computing hadronic matrix elements
Energy Technology Data Exchange (ETDEWEB)
Alexandrou, Constantia [Cyprus Univ., Nicosia (Cyprus). Dept. of Physics; The Cyprus Institute, Nicosia (Cyprus). Computational-based Science and Technology Research Center; Dinter, Simon; Drach, Vincent [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany). John von Neumann-Inst. fuer Computing NIC; Jansen, Karl [Cyprus Univ., Nicosia (Cyprus). Dept. of Physics; Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany). John von Neumann-Inst. fuer Computing NIC; Hadjiyiannakou, Kyriakos [Cyprus Univ., Nicosia (Cyprus). Dept. of Physics; Renner, Dru B. [Thomas Jefferson National Accelerator Facility, Newport News, VA (United States); Collaboration: European Twisted Mass Collaboration
2013-02-15
We present a stochastic method for the calculation of baryon three-point functions that is more versatile compared to the typically used sequential method. We analyze the scaling of the error of the stochastically evaluated three-point function with the lattice volume and find a favorable signal-to-noise ratio suggesting that our stochastic method can be used efficiently at large volumes to compute hadronic matrix elements.
Artificial intelligence, expert systems, computer vision, and natural language processing
Gevarter, W. B.
1984-01-01
An overview of artificial intelligence (AI), its core ingredients, and its applications is presented. The knowledge representation, logic, problem solving approaches, languages, and computers pertaining to AI are examined, and the state of the art in AI is reviewed. The use of AI in expert systems, computer vision, natural language processing, speech recognition and understanding, speech synthesis, problem solving, and planning is examined. Basic AI topics, including automation, search-oriented problem solving, knowledge representation, and computational logic, are discussed.
An overview of computer-based natural language processing
Gevarter, W. B.
1983-01-01
Computer based Natural Language Processing (NLP) is the key to enabling humans and their computer based creations to interact with machines in natural language (like English, Japanese, German, etc., in contrast to formal computer languages). The doors that such an achievement can open have made this a major research area in Artificial Intelligence and Computational Linguistics. Commercial natural language interfaces to computers have recently entered the market and future looks bright for other applications as well. This report reviews the basic approaches to such systems, the techniques utilized, applications, the state of the art of the technology, issues and research requirements, the major participants and finally, future trends and expectations. It is anticipated that this report will prove useful to engineering and research managers, potential users, and others who will be affected by this field as it unfolds.
Partitions in languages and parallel computations
Energy Technology Data Exchange (ETDEWEB)
Burgin, M S; Burgina, E S
1982-05-01
Partitions of entries (linguistic structures) are studied that are intended for parallel data processing. The representations of formal languages with the aid of such structures is examined, and the relationships are considered between partitions of entries and abstract families of languages and automata. 18 references.
Computational Investigations of Multiword Chunks in Language Learning.
McCauley, Stewart M; Christiansen, Morten H
2017-07-01
Second-language learners rarely arrive at native proficiency in a number of linguistic domains, including morphological and syntactic processing. Previous approaches to understanding the different outcomes of first- versus second-language learning have focused on cognitive and neural factors. In contrast, we explore the possibility that children and adults may rely on different linguistic units throughout the course of language learning, with specific focus on the granularity of those units. Following recent psycholinguistic evidence for the role of multiword chunks in online language processing, we explore the hypothesis that children rely more heavily on multiword units in language learning than do adults learning a second language. To this end, we take an initial step toward using large-scale, corpus-based computational modeling as a tool for exploring the granularity of speakers' linguistic units. Employing a computational model of language learning, the Chunk-Based Learner, we compare the usefulness of chunk-based knowledge in accounting for the speech of second-language learners versus children and adults speaking their first language. Our findings suggest that while multiword units are likely to play a role in second-language learning, adults may learn less useful chunks, rely on them to a lesser extent, and arrive at them through different means than children learning a first language. Copyright © 2017 Cognitive Science Society, Inc.
A fast algorithm for sparse matrix computations related to inversion
International Nuclear Information System (INIS)
Li, S.; Wu, W.; Darve, E.
2013-01-01
We have developed a fast algorithm for computing certain entries of the inverse of a sparse matrix. Such computations are critical to many applications, such as the calculation of non-equilibrium Green’s functions G r and G for nano-devices. The FIND (Fast Inverse using Nested Dissection) algorithm is optimal in the big-O sense. However, in practice, FIND suffers from two problems due to the width-2 separators used by its partitioning scheme. One problem is the presence of a large constant factor in the computational cost of FIND. The other problem is that the partitioning scheme used by FIND is incompatible with most existing partitioning methods and libraries for nested dissection, which all use width-1 separators. Our new algorithm resolves these problems by thoroughly decomposing the computation process such that width-1 separators can be used, resulting in a significant speedup over FIND for realistic devices — up to twelve-fold in simulation. The new algorithm also has the added advantage that desired off-diagonal entries can be computed for free. Consequently, our algorithm is faster than the current state-of-the-art recursive methods for meshes of any size. Furthermore, the framework used in the analysis of our algorithm is the first attempt to explicitly apply the widely-used relationship between mesh nodes and matrix computations to the problem of multiple eliminations with reuse of intermediate results. This framework makes our algorithm easier to generalize, and also easier to compare against other methods related to elimination trees. Finally, our accuracy analysis shows that the algorithms that require back-substitution are subject to significant extra round-off errors, which become extremely large even for some well-conditioned matrices or matrices with only moderately large condition numbers. When compared to these back-substitution algorithms, our algorithm is generally a few orders of magnitude more accurate, and our produced round-off errors
A discrete ordinate response matrix method for massively parallel computers
International Nuclear Information System (INIS)
Hanebutte, U.R.; Lewis, E.E.
1991-01-01
A discrete ordinate response matrix method is formulated for the solution of neutron transport problems on massively parallel computers. The response matrix formulation eliminates iteration on the scattering source. The nodal matrices which result from the diamond-differenced equations are utilized in a factored form which minimizes memory requirements and significantly reduces the required number of algorithm utilizes massive parallelism by assigning each spatial node to a processor. The algorithm is accelerated effectively by a synthetic method in which the low-order diffusion equations are also solved by massively parallel red/black iterations. The method has been implemented on a 16k Connection Machine-2, and S 8 and S 16 solutions have been obtained for fixed-source benchmark problems in X--Y geometry
Exploiting Data Sparsity In Covariance Matrix Computations on Heterogeneous Systems
Charara, Ali M.
2018-05-24
Covariance matrices are ubiquitous in computational sciences, typically describing the correlation of elements of large multivariate spatial data sets. For example, covari- ance matrices are employed in climate/weather modeling for the maximum likelihood estimation to improve prediction, as well as in computational ground-based astronomy to enhance the observed image quality by filtering out noise produced by the adap- tive optics instruments and atmospheric turbulence. The structure of these covariance matrices is dense, symmetric, positive-definite, and often data-sparse, therefore, hier- archically of low-rank. This thesis investigates the performance limit of dense matrix computations (e.g., Cholesky factorization) on covariance matrix problems as the number of unknowns grows, and in the context of the aforementioned applications. We employ recursive formulations of some of the basic linear algebra subroutines (BLAS) to accelerate the covariance matrix computation further, while reducing data traffic across the memory subsystems layers. However, dealing with large data sets (i.e., covariance matrices of billions in size) can rapidly become prohibitive in memory footprint and algorithmic complexity. Most importantly, this thesis investigates the tile low-rank data format (TLR), a new compressed data structure and layout, which is valuable in exploiting data sparsity by approximating the operator. The TLR com- pressed data structure allows approximating the original problem up to user-defined numerical accuracy. This comes at the expense of dealing with tasks with much lower arithmetic intensities than traditional dense computations. In fact, this thesis con- solidates the two trends of dense and data-sparse linear algebra for HPC. Not only does the thesis leverage recursive formulations for dense Cholesky-based matrix al- gorithms, but it also implements a novel TLR-Cholesky factorization using batched linear algebra operations to increase hardware occupancy and
Conversation Analysis in Computer-Assisted Language Learning
González-Lloret, Marta
2015-01-01
The use of Conversation Analysis (CA) in the study of technology-mediated interactions is a recent methodological addition to qualitative research in the field of Computer-assisted Language Learning (CALL). The expansion of CA in Second Language Acquisition research, coupled with the need for qualitative techniques to explore how people interact…
Students' Motivation toward Computer-Based Language Learning
Genc, Gulten; Aydin, Selami
2011-01-01
The present article examined some factors affecting the motivation level of the preparatory school students in using a web-based computer-assisted language-learning course. The sample group of the study consisted of 126 English-as-a-foreign-language learners at a preparatory school of a state university. After performing statistical analyses…
Computer-Assisted Foreign Language Teaching and Learning: Technological Advances
Zou, Bin; Xing, Minjie; Wang, Yuping; Sun, Mingyu; Xiang, Catherine H.
2013-01-01
Computer-Assisted Foreign Language Teaching and Learning: Technological Advances highlights new research and an original framework that brings together foreign language teaching, experiments and testing practices that utilize the most recent and widely used e-learning resources. This comprehensive collection of research will offer linguistic…
SYNCOM: A general syntax conversion language and computer program
International Nuclear Information System (INIS)
Bindon, D.C.
1972-09-01
The problems of syntax conversion are discussed and the reasons given for the choice of the Interpretive method. A full description is given of the SYNCON language and computer program together with brief details of some programs written in the language. (author)
CPL : A Core Language for Cloud Computing
Bračevac, Oliver; Erdweg, S.T.; Salvaneschi, Guido; Mezini, Mira
2016-01-01
Running distributed applications in the cloud involves deployment. That is, distribution and configuration of application services and middleware infrastructure. The considerable complexity of these tasks resulted in the emergence of declarative JSON-based domain-specific deployment languages to
CPL: A Core Language for Cloud Computing
Bračevac, Oliver; Erdweg, S.T.; Salvaneschi, Guido; Mezini, Mira
2016-01-01
Running distributed applications in the cloud involves deployment. That is, distribution and configuration of application services and middleware infrastructure. The considerable complexity of these tasks resulted in the emergence of declarative JSON-based domain-specific deployment languages to develop deployment programs. However, existing deployment programs unsafely compose artifacts written in different languages, leading to bugs that are hard to detect before run time. Furthermore, depl...
Heift, Trude; Schulze, Mathias
2012-01-01
This book provides the first comprehensive overview of theoretical issues, historical developments and current trends in ICALL (Intelligent Computer-Assisted Language Learning). It assumes a basic familiarity with Second Language Acquisition (SLA) theory and teaching, CALL and linguistics. It is of interest to upper undergraduate and/or graduate…
Simulating quantum systems on classical computers with matrix product states
International Nuclear Information System (INIS)
Kleine, Adrian
2010-01-01
In this thesis, the numerical simulation of strongly-interacting many-body quantum-mechanical systems using matrix product states (MPS) is considered. Matrix-Product-States are a novel representation of arbitrary quantum many-body states. Using quantum information theory, it is possible to show that Matrix-Product-States provide a polynomial-sized representation of one-dimensional quantum systems, thus allowing an efficient simulation of one-dimensional quantum system on classical computers. Matrix-Product-States form the conceptual framework of the density-matrix renormalization group (DMRG). After a general introduction in the first chapter of this thesis, the second chapter deals with Matrix-Product-States, focusing on the development of fast and stable algorithms. To obtain algorithms to efficiently calculate ground states, the density-matrix renormalization group is reformulated using the Matrix-Product-States framework. Further, time-dependent problems are considered. Two different algorithms are presented, one based on a Trotter decomposition of the time-evolution operator, the other one on Krylov subspaces. Finally, the evaluation of dynamical spectral functions is discussed, and a correction vector-based method is presented. In the following chapters, the methods presented in the second chapter, are applied to a number of different physical problems. The third chapter deals with the existence of chiral phases in isotropic one-dimensional quantum spin systems. A preceding analytical study based on a mean-field approach indicated the possible existence of those phases in an isotropic Heisenberg model with a frustrating zig-zag interaction and a magnetic field. In this thesis, the existence of the chiral phases is shown numerically by using Matrix-Product-States-based algorithms. In the fourth chapter, we propose an experiment using ultracold atomic gases in optical lattices, which allows a well controlled observation of the spin-charge separation (of
Simulating quantum systems on classical computers with matrix product states
Energy Technology Data Exchange (ETDEWEB)
Kleine, Adrian
2010-11-08
In this thesis, the numerical simulation of strongly-interacting many-body quantum-mechanical systems using matrix product states (MPS) is considered. Matrix-Product-States are a novel representation of arbitrary quantum many-body states. Using quantum information theory, it is possible to show that Matrix-Product-States provide a polynomial-sized representation of one-dimensional quantum systems, thus allowing an efficient simulation of one-dimensional quantum system on classical computers. Matrix-Product-States form the conceptual framework of the density-matrix renormalization group (DMRG). After a general introduction in the first chapter of this thesis, the second chapter deals with Matrix-Product-States, focusing on the development of fast and stable algorithms. To obtain algorithms to efficiently calculate ground states, the density-matrix renormalization group is reformulated using the Matrix-Product-States framework. Further, time-dependent problems are considered. Two different algorithms are presented, one based on a Trotter decomposition of the time-evolution operator, the other one on Krylov subspaces. Finally, the evaluation of dynamical spectral functions is discussed, and a correction vector-based method is presented. In the following chapters, the methods presented in the second chapter, are applied to a number of different physical problems. The third chapter deals with the existence of chiral phases in isotropic one-dimensional quantum spin systems. A preceding analytical study based on a mean-field approach indicated the possible existence of those phases in an isotropic Heisenberg model with a frustrating zig-zag interaction and a magnetic field. In this thesis, the existence of the chiral phases is shown numerically by using Matrix-Product-States-based algorithms. In the fourth chapter, we propose an experiment using ultracold atomic gases in optical lattices, which allows a well controlled observation of the spin-charge separation (of
Directory of Open Access Journals (Sweden)
Irena SRDANOVIĆ
2011-05-01
Full Text Available In this paper, we explore presence of collocational relations in the computer-assisted language learning systems and other language resources for the Japanese language, on one side, and, in the Japanese language learning textbooks and wordlists, on the other side. After introducing how important it is to learn collocational relations in a foreign language, we examine their coverage in the various learners’ resources for the Japanese language. We particularly concentrate on a few collocations at the beginner’s level, where we demonstrate their treatment across various resources. A special attention is paid to what is referred to as unpredictable collocations, which have a bigger foreign language learning-burden than the predictable ones.
From Computer Assisted Language Learning (CALL) to Mobile Assisted Language Use (MALU)
Jarvis, Huw; Achilleos, Marianna
2013-01-01
This article begins by critiquing the long-established acronym CALL (Computer Assisted Language Learning). We then go on to report on a small-scale study which examines how student non-native speakers of English use a range of digital devices beyond the classroom in both their first (L1) and second (L2) languages. We look also at the extent to…
Kiraz, George Anton
This book presents a tractable computational model that can cope with complex morphological operations, especially in Semitic languages, and less complex morphological systems present in Western languages. It outlines a new generalized regular rewrite rule system that uses multiple finite-state automata to cater to root-and-pattern morphology,…
Tutorial Computer-Assisted Language Learning
Heift, Trude; Schulze, Mathias
2015-01-01
"Sometimes maligned for its allegedly behaviorist connotations but critical for success in many fields from music to sport to mathematics and language learning, 'practice' is undergoing something of a revival in the applied linguistics literature" (Long & Richards 2007, p. xi). This research timeline provides a systematic overview of…
Battle Management Language capable Computer Generated Forces
Bronkers, R.; Henderson, H.; Reus, N.M. de; Alstad, A.; Mevassvik, O.M.; Skogsrud, G.
2011-01-01
The development of Coalition Battle Management Language (C-BML) by SISO and its evaluation by the NATO MSG-085 task group and predecessor NATO MSG-048 has led Norway and the Netherlands to develop C-BML interfaces for their Command and Control Information Systems (C2ISs) NORTaC-C2IS and ISIS. FFI
Computer hardware description languages - A tutorial
Shiva, S. G.
1979-01-01
The paper introduces hardware description languages (HDL) as useful tools for hardware design and documentation. The capabilities and limitations of HDLs are discussed along with the guidelines needed in selecting an appropriate HDL. The directions for future work are provided and attention is given to the implementation of HDLs in microcomputers.
Programming Languages for Distributed Computing Systems
Bal, H.E.; Steiner, J.G.; Tanenbaum, A.S.
1989-01-01
When distributed systems first appeared, they were programmed in traditional sequential languages, usually with the addition of a few library procedures for sending and receiving messages. As distributed applications became more commonplace and more sophisticated, this ad hoc approach became less
Discriminant Validity of the WISC-IV Culture-Language Interpretive Matrix
Styck, Kara M.; Watkins, Marley W.
2014-01-01
The Culture-Language Interpretive Matrix (C-LIM) was developed to help practitioners determine the validity of test scores obtained from students who are culturally and linguistically different from the normative group of a test. The present study used an idiographic approach to investigate the diagnostic utility of the C-LIM for the Wechsler…
Eye-tracking research in computer-mediated language learning
Michel, Marije; Smith, Bryan
2017-01-01
Though eye-tracking technology has been used in reading research for over 100 years, researchers have only recently begun to use it in studies of computer-assisted language learning (CALL). This chapter provides an overview of eye-tracking research to date, which is relevant to computer-mediated
A fast algorithm for sparse matrix computations related to inversion
Energy Technology Data Exchange (ETDEWEB)
Li, S., E-mail: lisong@stanford.edu [Institute for Computational and Mathematical Engineering, Stanford University, 496 Lomita Mall, Durand Building, Stanford, CA 94305 (United States); Wu, W. [Department of Electrical Engineering, Stanford University, 350 Serra Mall, Packard Building, Room 268, Stanford, CA 94305 (United States); Darve, E. [Institute for Computational and Mathematical Engineering, Stanford University, 496 Lomita Mall, Durand Building, Stanford, CA 94305 (United States); Department of Mechanical Engineering, Stanford University, 496 Lomita Mall, Durand Building, Room 209, Stanford, CA 94305 (United States)
2013-06-01
We have developed a fast algorithm for computing certain entries of the inverse of a sparse matrix. Such computations are critical to many applications, such as the calculation of non-equilibrium Green’s functions G{sup r} and G{sup <} for nano-devices. The FIND (Fast Inverse using Nested Dissection) algorithm is optimal in the big-O sense. However, in practice, FIND suffers from two problems due to the width-2 separators used by its partitioning scheme. One problem is the presence of a large constant factor in the computational cost of FIND. The other problem is that the partitioning scheme used by FIND is incompatible with most existing partitioning methods and libraries for nested dissection, which all use width-1 separators. Our new algorithm resolves these problems by thoroughly decomposing the computation process such that width-1 separators can be used, resulting in a significant speedup over FIND for realistic devices — up to twelve-fold in simulation. The new algorithm also has the added advantage that desired off-diagonal entries can be computed for free. Consequently, our algorithm is faster than the current state-of-the-art recursive methods for meshes of any size. Furthermore, the framework used in the analysis of our algorithm is the first attempt to explicitly apply the widely-used relationship between mesh nodes and matrix computations to the problem of multiple eliminations with reuse of intermediate results. This framework makes our algorithm easier to generalize, and also easier to compare against other methods related to elimination trees. Finally, our accuracy analysis shows that the algorithms that require back-substitution are subject to significant extra round-off errors, which become extremely large even for some well-conditioned matrices or matrices with only moderately large condition numbers. When compared to these back-substitution algorithms, our algorithm is generally a few orders of magnitude more accurate, and our produced round
Gay guys using gay language: friendship, shared values and the intent-context-effect matrix.
McCormack, Mark; Wignall, Liam; Morris, Max
2016-12-01
This article draws on in-depth interviews with 35 openly gay male undergraduates from four universities in England to develop an understanding of the changing nature of language related to homosexuality. In addition to finding a diminution in the prevalence of homophobic language, we demonstrate that participants maintain complex and nuanced understandings of phrases that do not use homophobic pejoratives, such as 'that's so gay'. The majority of participants rejected the notion that these phrases are inherently homophobic, instead arguing that the intent with which they are said and the context in which they are used are vital in understanding their meaning and effect. We conceptualize an intent-context-effect matrix to understand the interdependency of these variables. Highlighting the situated nature of this matrix, we also demonstrate the importance of the existence of shared norms between those saying and hearing the phrase when interpreting such language. © London School of Economics and Political Science 2016.
Multi-Language Programming Environments for High Performance Java Computing
Vladimir Getov; Paul Gray; Sava Mintchev; Vaidy Sunderam
1999-01-01
Recent developments in processor capabilities, software tools, programming languages and programming paradigms have brought about new approaches to high performance computing. A steadfast component of this dynamic evolution has been the scientific community’s reliance on established scientific packages. As a consequence, programmers of high‐performance applications are reluctant to embrace evolving languages such as Java. This paper describes the Java‐to‐C Interface (JCI) tool which provides ...
76 Computer Assisted Language Learning (CALL) Software ...
African Journals Online (AJOL)
Ike Odimegwu
combination with other factors which may enhance or ameliorate the ... form of computer-based learning which carries two important features: .... To take some commonplace examples, a ... photographs, and even full-motion video clips.
Harvey, T. Edward
1987-01-01
A national survey of full-time instructional faculty (N=208) at universities, 2-year colleges, and high schools regarding attitudes toward using computers in second-language composition instruction revealed a predomination of Apple and IBM-PC computers used, a major frustration in lack of foreign character support, and mixed opinions about real…
García Laborda, Jesús; López Santiago, Mercedes; Otero de Juan, Nuria; Álvarez Álvarez, Alfredo
2014-01-01
Current evolutions of language testing have led to integrating computers in FSP assessments both in oral and written communicative tasks. This paper deals with two main issues: learners' expectations about the types of questions in FSP computer based assessments and the relation with their own experience. This paper describes the experience of 23…
STAR - A computer language for hybrid AI applications
Borchardt, G. C.
1986-01-01
Constructing Artificial Intelligence application systems which rely on both symbolic and non-symbolic processing places heavy demands on the communication of data between dissimilar languages. This paper describes STAR (Simple Tool for Automated Reasoning), a computer language for the development of AI application systems which supports the transfer of data structures between a symbolic level and a non-symbolic level defined in languages such as FORTRAN, C and PASCAL. The organization of STAR is presented, followed by the description of an application involving STAR in the interpretation of airborne imaging spectrometer data.
The Potential of Incorporating Computer Games in Foreign Language Curricula
Directory of Open Access Journals (Sweden)
Jayakaran Mukundan
2014-04-01
Full Text Available There is ample evidence that technology-enhanced instruction could result in students’ learning. With the advancement and ever-increasing growth of technology, the use of educational electronic games or computer games in education has appealed to both educators and students. Because of their potential to enhance students’ interest, motivation and creativity, computer games can be used to teach various skills and strategies to different types of students, particularly schoolchildren. These games have also made inroads into language learning classrooms as they provide language learners with a rich learning context to engage in authentic and meaningful learning experiences. This paper reviews the potential of integrating computer games into second/foreign language syllabi and curricula by offering a synopsis of the assumptions, prior studies and theoretical background in support of these games in language education. At the end, the paper touches upon the role of teachers and the likely inhibiting factors affecting the integration of computer games into English language programs.
Stoykov, S.; Atanassov, E.; Margenov, S.
2016-10-01
Many of the scientific applications involve sparse or dense matrix operations, such as solving linear systems, matrix-matrix products, eigensolvers, etc. In what concerns structural nonlinear dynamics, the computations of periodic responses and the determination of stability of the solution are of primary interest. Shooting method iswidely used for obtaining periodic responses of nonlinear systems. The method involves simultaneously operations with sparse and dense matrices. One of the computationally expensive operations in the method is multiplication of sparse by dense matrices. In the current work, a new algorithm for sparse matrix by dense matrix products is presented. The algorithm takes into account the structure of the sparse matrix, which is obtained by space discretization of the nonlinear Mindlin's plate equation of motion by the finite element method. The algorithm is developed to use the vector engine of Intel Xeon Phi coprocessors. It is compared with the standard sparse matrix by dense matrix algorithm and the one developed by Intel MKL and it is shown that by considering the properties of the sparse matrix better algorithms can be developed.
HAL/SM language specification. [programming languages and computer programming for space shuttles
Williams, G. P. W., Jr.; Ross, C.
1975-01-01
A programming language is presented for the flight software of the NASA Space Shuttle program. It is intended to satisfy virtually all of the flight software requirements of the space shuttle. To achieve this, it incorporates a wide range of features, including applications-oriented data types and organizations, real time control mechanisms, and constructs for systems programming tasks. It is a higher order language designed to allow programmers, analysts, and engineers to communicate with the computer in a form approximating natural mathematical expression. Parts of the English language are combined with standard notation to provide a tool that readily encourages programming without demanding computer hardware expertise. Block diagrams and flow charts are included. The semantics of the language is discussed.
Sussex, Roland
1991-01-01
Considers how the effectiveness of computer-assisted language learning (CALL) has been hampered by language teachers who lack programing and software engineering expertise, and explores the limitations and potential contributions of author languages, programs, and environments in increasing the range of options for language teachers who are not…
A recursive algorithm for computing the inverse of the Vandermonde matrix
Directory of Open Access Journals (Sweden)
Youness Aliyari Ghassabeh
2016-12-01
Full Text Available The inverse of a Vandermonde matrix has been used for signal processing, polynomial interpolation, curve fitting, wireless communication, and system identification. In this paper, we propose a novel fast recursive algorithm to compute the inverse of a Vandermonde matrix. The algorithm computes the inverse of a higher order Vandermonde matrix using the available lower order inverse matrix with a computational cost of $ O(n^2 $. The proposed algorithm is given in a matrix form, which makes it appropriate for hardware implementation. The running time of the proposed algorithm to find the inverse of a Vandermonde matrix using a lower order Vandermonde matrix is compared with the running time of the matrix inversion function implemented in MATLAB.
Neural Cognition and Affective Computing on Cyber Language.
Huang, Shuang; Zhou, Xuan; Xue, Ke; Wan, Xiqiong; Yang, Zhenyi; Xu, Duo; Ivanović, Mirjana; Yu, Xueer
2015-01-01
Characterized by its customary symbol system and simple and vivid expression patterns, cyber language acts as not only a tool for convenient communication but also a carrier of abundant emotions and causes high attention in public opinion analysis, internet marketing, service feedback monitoring, and social emergency management. Based on our multidisciplinary research, this paper presents a classification of the emotional symbols in cyber language, analyzes the cognitive characteristics of different symbols, and puts forward a mechanism model to show the dominant neural activities in that process. Through the comparative study of Chinese, English, and Spanish, which are used by the largest population in the world, this paper discusses the expressive patterns of emotions in international cyber languages and proposes an intelligent method for affective computing on cyber language in a unified PAD (Pleasure-Arousal-Dominance) emotional space.
Neural Cognition and Affective Computing on Cyber Language
Directory of Open Access Journals (Sweden)
Shuang Huang
2015-01-01
Full Text Available Characterized by its customary symbol system and simple and vivid expression patterns, cyber language acts as not only a tool for convenient communication but also a carrier of abundant emotions and causes high attention in public opinion analysis, internet marketing, service feedback monitoring, and social emergency management. Based on our multidisciplinary research, this paper presents a classification of the emotional symbols in cyber language, analyzes the cognitive characteristics of different symbols, and puts forward a mechanism model to show the dominant neural activities in that process. Through the comparative study of Chinese, English, and Spanish, which are used by the largest population in the world, this paper discusses the expressive patterns of emotions in international cyber languages and proposes an intelligent method for affective computing on cyber language in a unified PAD (Pleasure-Arousal-Dominance emotional space.
Neurobiological roots of language in primate audition: common computational properties.
Bornkessel-Schlesewsky, Ina; Schlesewsky, Matthias; Small, Steven L; Rauschecker, Josef P
2015-03-01
Here, we present a new perspective on an old question: how does the neurobiology of human language relate to brain systems in nonhuman primates? We argue that higher-order language combinatorics, including sentence and discourse processing, can be situated in a unified, cross-species dorsal-ventral streams architecture for higher auditory processing, and that the functions of the dorsal and ventral streams in higher-order language processing can be grounded in their respective computational properties in primate audition. This view challenges an assumption, common in the cognitive sciences, that a nonhuman primate model forms an inherently inadequate basis for modeling higher-level language functions. Copyright © 2014 Elsevier Ltd. All rights reserved.
Computer language Mathsy and applications to solid state physics
International Nuclear Information System (INIS)
Peterson, G.; Budgor, A.B.
1980-01-01
The high-level interactive mathematics and graphics computer language, Mathsy, is discussed and demonstrated with sample applications. Mathsy is an interpretive, interactive, mathematical, array processing, and graphics system. Among its diverse uses in the laser fusion project at the Lawrence Livermore Laboratory, it has enabled the conceptualization of a new algorithm to compute the density of electron or phonon states spectra which requires no root solving
An Empirical Generative Framework for Computational Modeling of Language Acquisition
Waterfall, Heidi R.; Sandbank, Ben; Onnis, Luca; Edelman, Shimon
2010-01-01
This paper reports progress in developing a computer model of language acquisition in the form of (1) a generative grammar that is (2) algorithmically learnable from realistic corpus data, (3) viable in its large-scale quantitative performance and (4) psychologically real. First, we describe new algorithmic methods for unsupervised learning of…
Learning from a Computer Tutor with Natural Language Capabilities
Michael, Joel; Rovick, Allen; Glass, Michael; Zhou, Yujian; Evens, Martha
2003-01-01
CIRCSIM-Tutor is a computer tutor designed to carry out a natural language dialogue with a medical student. Its domain is the baroreceptor reflex, the part of the cardiovascular system that is responsible for maintaining a constant blood pressure. CIRCSIM-Tutor's interaction with students is modeled after the tutoring behavior of two experienced…
An Intelligent Computer-Based System for Sign Language Tutoring
Ritchings, Tim; Khadragi, Ahmed; Saeb, Magdy
2012-01-01
A computer-based system for sign language tutoring has been developed using a low-cost data glove and a software application that processes the movement signals for signs in real-time and uses Pattern Matching techniques to decide if a trainee has closely replicated a teacher's recorded movements. The data glove provides 17 movement signals from…
Computer-Adaptive Testing in Second Language Contexts.
Chalhoub-Deville, Micheline; Deville, Craig
1999-01-01
Provides a broad overview of computerized testing issues with an emphasis on computer-adaptive testing (CAT). A survey of the potential benefits and drawbacks of CAT are given, the process of CAT development is described; and some L2 instruments developed to assess various language skills are summarized. (Author/VWL)
Lexical access in sign language: a computational model.
Caselli, Naomi K; Cohen-Goldberg, Ariel M
2014-01-01
PSYCHOLINGUISTIC THEORIES HAVE PREDOMINANTLY BEEN BUILT UPON DATA FROM SPOKEN LANGUAGE, WHICH LEAVES OPEN THE QUESTION: How many of the conclusions truly reflect language-general principles as opposed to modality-specific ones? We take a step toward answering this question in the domain of lexical access in recognition by asking whether a single cognitive architecture might explain diverse behavioral patterns in signed and spoken language. Chen and Mirman (2012) presented a computational model of word processing that unified opposite effects of neighborhood density in speech production, perception, and written word recognition. Neighborhood density effects in sign language also vary depending on whether the neighbors share the same handshape or location. We present a spreading activation architecture that borrows the principles proposed by Chen and Mirman (2012), and show that if this architecture is elaborated to incorporate relatively minor facts about either (1) the time course of sign perception or (2) the frequency of sub-lexical units in sign languages, it produces data that match the experimental findings from sign languages. This work serves as a proof of concept that a single cognitive architecture could underlie both sign and word recognition.
Lexical access in sign language: A computational model
Directory of Open Access Journals (Sweden)
Naomi Kenney Caselli
2014-05-01
Full Text Available Psycholinguistic theories have predominantly been built upon data from spoken language, which leaves open the question: How many of the conclusions truly reflect language-general principles as opposed to modality-specific ones? We take a step toward answering this question in the domain of lexical access in recognition by asking whether a single cognitive architecture might explain diverse behavioral patterns in signed and spoken language. Chen and Mirman (2012 presented a computational model of word processing that unified opposite effects of neighborhood density in speech production, perception, and written word recognition. Neighborhood density effects in sign language also vary depending on whether the neighbors share the same handshape or location. We present a spreading activation architecture that borrows the principles proposed by Chen and Mirman (2012, and show that if this architecture is elaborated to incorporate relatively minor facts about either 1 the time course of sign perception or 2 the frequency of sub-lexical units in sign languages, it produces data that match the experimental findings from sign languages. This work serves as a proof of concept that a single cognitive architecture could underlie both sign and word recognition.
SIGMA, a new language for interactive array-oriented computing
International Nuclear Information System (INIS)
Hagedorn, R.; Reinfelds, J.; Vandoni, C.; Hove, L. van.
1978-01-01
A description is given of the principles and the main facilities of SIGMA (System for Interactive Graphical Mathematical Applications), a programming language for scientific computing whose major characteristics are: automatic handling of multi-dimensional rectangular arrays as basic data units, interactive operation of the system, and graphical display facilities. After introducing the basic concepts and features of the language, it describes in some detail the methods and operators for the automatic handling of arrays and for their graphical display, the procedures for construction of programs by users, and other facilities of the system. The report is a new version of CERN 73-5. (Auth.)
Generic Cospark of a Matrix Can Be Computed in Polynomial Time
Zhong, Sichen; Zhao, Yue
2017-01-01
The cospark of a matrix is the cardinality of the sparsest vector in the column space of the matrix. Computing the cospark of a matrix is well known to be an NP hard problem. Given the sparsity pattern (i.e., the locations of the non-zero entries) of a matrix, if the non-zero entries are drawn from independently distributed continuous probability distributions, we prove that the cospark of the matrix equals, with probability one, to a particular number termed the generic cospark of the matrix...
The Advantages and Disadvantages of Computer Technology in Second Language Acquisition
Lai, Cheng-Chieh; Kritsonis, William Allan
2006-01-01
The purpose of this article is to discuss the advantages and disadvantages of computer technology and Computer Assisted Language Learning (CALL) programs for current second language learning. According to the National Clearinghouse for English Language Acquisition & Language Instruction Educational Programs' report (2002), more than nine million…
Computer-Assisted Language Learning: Current Programs and Projects. ERIC Digest.
Higgins, Chris
For many years, foreign language teachers have used the computer to provide supplemental exercises in the instruction of foreign languages. In recent years, advances in computer technology have motivated teachers to reassess the computer and consider it a valuable part of daily foreign language learning. Innovative software programs, authoring…
Prolog as description and implementation language in computer science teaching
DEFF Research Database (Denmark)
Christiansen, Henning
population with uneven mathematical backgrounds. % Definitional interpreters, compilers, and other models of computation are defined in a systematic way as Prolog programs, and as a result, formal descriptions become running prototypes that can be tested and modified by the students. These programs can......Prolog is a powerful pedagogical instrument for theoretical elements of computer science when used as combined description language and experimentation tool. A teaching methodology based on this principle has been developed and successfully applied in a context with a heterogeneous student...
Exploiting Data Sparsity In Covariance Matrix Computations on Heterogeneous Systems
Charara, Ali
2018-01-01
the thesis leverage recursive formulations for dense Cholesky-based matrix al- gorithms, but it also implements a novel TLR-Cholesky factorization using batched linear algebra operations to increase hardware occupancy and reduce the overhead of the API
Rodriguez, Cathi Draper; Filler, John; Higgins, Kyle
2012-01-01
Through this exploratory study the authors investigated the effects of primary language support delivered via computer on the English reading comprehension skills of English language learners. Participants were 28 First-grade students identified as Limited English Proficient. The primary language of all participants was Spanish. Students were…
Optical character recognition systems for different languages with soft computing
Chaudhuri, Arindam; Badelia, Pratixa; K Ghosh, Soumya
2017-01-01
The book offers a comprehensive survey of soft-computing models for optical character recognition systems. The various techniques, including fuzzy and rough sets, artificial neural networks and genetic algorithms, are tested using real texts written in different languages, such as English, French, German, Latin, Hindi and Gujrati, which have been extracted by publicly available datasets. The simulation studies, which are reported in details here, show that soft-computing based modeling of OCR systems performs consistently better than traditional models. Mainly intended as state-of-the-art survey for postgraduates and researchers in pattern recognition, optical character recognition and soft computing, this book will be useful for professionals in computer vision and image processing alike, dealing with different issues related to optical character recognition.
2016-01-05
Computer-aided transformation of PDE models: languages, representations, and a calculus of operations A domain-specific embedded language called...languages, representations, and a calculus of operations Report Title A domain-specific embedded language called ibvp was developed to model initial...Computer-aided transformation of PDE models: languages, representations, and a calculus of operations 1 Vision and background Physical and engineered systems
Functional Automata - Formal Languages for Computer Science Students
Directory of Open Access Journals (Sweden)
Marco T. Morazán
2014-12-01
Full Text Available An introductory formal languages course exposes advanced undergraduate and early graduate students to automata theory, grammars, constructive proofs, computability, and decidability. Programming students find these topics to be challenging or, in many cases, overwhelming and on the fringe of Computer Science. The existence of this perception is not completely absurd since students are asked to design and prove correct machines and grammars without being able to experiment nor get immediate feedback, which is essential in a learning context. This article puts forth the thesis that the theory of computation ought to be taught using tools for actually building computations. It describes the implementation and the classroom use of a library, FSM, designed to provide students with the opportunity to experiment and test their designs using state machines, grammars, and regular expressions. Students are able to perform random testing before proceeding with a formal proof of correctness. That is, students can test their designs much like they do in a programming course. In addition, the library easily allows students to implement the algorithms they develop as part of the constructive proofs they write. Providing students with this ability ought to be a new trend in the formal languages classroom.
Matrix algebra theory, computations and applications in statistics
Gentle, James E
2017-01-01
This textbook for graduate and advanced undergraduate students presents the theory of matrix algebra for statistical applications, explores various types of matrices encountered in statistics, and covers numerical linear algebra. Matrix algebra is one of the most important areas of mathematics in data science and in statistical theory, and the second edition of this very popular textbook provides essential updates and comprehensive coverage on critical topics in mathematics in data science and in statistical theory. Part I offers a self-contained description of relevant aspects of the theory of matrix algebra for applications in statistics. It begins with fundamental concepts of vectors and vector spaces; covers basic algebraic properties of matrices and analytic properties of vectors and matrices in multivariate calculus; and concludes with a discussion on operations on matrices in solutions of linear systems and in eigenanalysis. Part II considers various types of matrices encountered in statistics, such as...
Energy Technology Data Exchange (ETDEWEB)
Druskin, V.; Lee, Ping [Schlumberger-Doll Research, Ridgefield, CT (United States); Knizhnerman, L. [Central Geophysical Expedition, Moscow (Russian Federation)
1996-12-31
There is now a growing interest in the area of using Krylov subspace approximations to compute the actions of matrix functions. The main application of this approach is the solution of ODE systems, obtained after discretization of partial differential equations by method of lines. In the event that the cost of computing the matrix inverse is relatively inexpensive, it is sometimes attractive to solve the ODE using the extended Krylov subspaces, originated by actions of both positive and negative matrix powers. Examples of such problems can be found frequently in computational electromagnetics.
Representing and computing regular languages on massively parallel networks
Energy Technology Data Exchange (ETDEWEB)
Miller, M.I.; O' Sullivan, J.A. (Electronic Systems and Research Lab., of Electrical Engineering, Washington Univ., St. Louis, MO (US)); Boysam, B. (Dept. of Electrical, Computer and Systems Engineering, Rensselaer Polytechnic Inst., Troy, NY (US)); Smith, K.R. (Dept. of Electrical Engineering, Southern Illinois Univ., Edwardsville, IL (US))
1991-01-01
This paper proposes a general method for incorporating rule-based constraints corresponding to regular languages into stochastic inference problems, thereby allowing for a unified representation of stochastic and syntactic pattern constraints. The authors' approach first established the formal connection of rules to Chomsky grammars, and generalizes the original work of Shannon on the encoding of rule-based channel sequences to Markov chains of maximum entropy. This maximum entropy probabilistic view leads to Gibb's representations with potentials which have their number of minima growing at precisely the exponential rate that the language of deterministically constrained sequences grow. These representations are coupled to stochastic diffusion algorithms, which sample the language-constrained sequences by visiting the energy minima according to the underlying Gibbs' probability law. The coupling to stochastic search methods yields the all-important practical result that fully parallel stochastic cellular automata may be derived to generate samples from the rule-based constraint sets. The production rules and neighborhood state structure of the language of sequences directly determines the necessary connection structures of the required parallel computing surface. Representations of this type have been mapped to the DAP-510 massively-parallel processor consisting of 1024 mesh-connected bit-serial processing elements for performing automated segmentation of electron-micrograph images.
Directory of Open Access Journals (Sweden)
Nesrin OZDENER
2008-04-01
Full Text Available Among the challenges many teachers face in facilitating the improvement of speaking skills are sparing sufficient time for practice to enable students to achieve fluency in speaking through internalizing the structures, and establishing a balance between fluency and accuracy. This study aimed to seek an answer to the question as to whether Computer-Mediated Communication Technologies be a solution for overcoming these problems. The study was conducted as additional practice to the foreign language lessons with the participation of 60 students. Task-based language teaching principles were taken as basis in preparation of the teaching materials in the study, in which text and voice chat applications among the Computer-Mediated Communication Technologies were used. During the applications data were collected in several ways: participants’ perspectives regarding their changing experiences and the types of tasks used were investigated through the use of open-ended questionnaires after each session; a general insight was obtained into the students’ experiences with close-ended questionnaires given at the end of the study; and the use of the target language in communications among students were determined by investigating the text communication logs. From a user-oriented perspective, the results of the study shed light on the strategies that can be used in computer-mediated communication technologies valuing the experiences and perceptions of the learners.
Nofre, David; Priestley, Mark; Alberts, Gerard
2014-01-01
Language is one of the central metaphors around which the discipline of computer science has been built. The language metaphor entered modern computing as part of a cybernetic discourse, but during the second half of the 1950s acquired a more abstract meaning, closely related to the formal languages of logic and linguistics. The article argues that this transformation was related to the appearance of the commercial computer in the mid-1950s. Managers of computing installations and specialists on computer programming in academic computer centers, confronted with an increasing variety of machines, called for the creation of "common" or "universal languages" to enable the migration of computer code from machine to machine. Finally, the article shows how the idea of a universal language was a decisive step in the emergence of programming languages, in the recognition of computer programming as a proper field of knowledge, and eventually in the way we think of the computer.
Murni, Bustamam, A.; Ernastuti, Handhika, T.; Kerami, D.
2017-07-01
Calculation of the matrix-vector multiplication in the real-world problems often involves large matrix with arbitrary size. Therefore, parallelization is needed to speed up the calculation process that usually takes a long time. Graph partitioning techniques that have been discussed in the previous studies cannot be used to complete the parallelized calculation of matrix-vector multiplication with arbitrary size. This is due to the assumption of graph partitioning techniques that can only solve the square and symmetric matrix. Hypergraph partitioning techniques will overcome the shortcomings of the graph partitioning technique. This paper addresses the efficient parallelization of matrix-vector multiplication through hypergraph partitioning techniques using CUDA GPU-based parallel computing. CUDA (compute unified device architecture) is a parallel computing platform and programming model that was created by NVIDIA and implemented by the GPU (graphics processing unit).
Mixed-Language High-Performance Computing for Plasma Simulations
Directory of Open Access Journals (Sweden)
Quanming Lu
2003-01-01
Full Text Available Java is receiving increasing attention as the most popular platform for distributed computing. However, programmers are still reluctant to embrace Java as a tool for writing scientific and engineering applications due to its still noticeable performance drawbacks compared with other programming languages such as Fortran or C. In this paper, we present a hybrid Java/Fortran implementation of a parallel particle-in-cell (PIC algorithm for plasma simulations. In our approach, the time-consuming components of this application are designed and implemented as Fortran subroutines, while less calculation-intensive components usually involved in building the user interface are written in Java. The two types of software modules have been glued together using the Java native interface (JNI. Our mixed-language PIC code was tested and its performance compared with pure Java and Fortran versions of the same algorithm on a Sun E6500 SMP system and a Linux cluster of Pentium~III machines.
Foreign Language Translation of Chemical Nomenclature by Computer
2009-01-01
Chemical compound names remain the primary method for conveying molecular structures between chemists and researchers. In research articles, patents, chemical catalogues, government legislation, and textbooks, the use of IUPAC and traditional compound names is universal, despite efforts to introduce more machine-friendly representations such as identifiers and line notations. Fortunately, advances in computing power now allow chemical names to be parsed and generated (read and written) with almost the same ease as conventional connection tables. A significant complication, however, is that although the vast majority of chemistry uses English nomenclature, a significant fraction is in other languages. This complicates the task of filing and analyzing chemical patents, purchasing from compound vendors, and text mining research articles or Web pages. We describe some issues with manipulating chemical names in various languages, including British, American, German, Japanese, Chinese, Spanish, Swedish, Polish, and Hungarian, and describe the current state-of-the-art in software tools to simplify the process. PMID:19239237
Computer Literacy of Iranian Teachers of English as a Foreign Language: Challenges and Obstacles
Dashtestani, Reza
2014-01-01
Basically, one of the requirements for the implementation of computer-assisted language learning (CALL) is English as a foreign language (EFL) teachers' ability to use computers effectively. Educational authorities and planners should identify EFL teachers' computer literacy levels and make attempts to improve the teachers' computer competence.…
An algorithm to compute the square root of 3x3 positive definite matrix
International Nuclear Information System (INIS)
Franca, L.P.
1988-06-01
An efficient closed form to compute the square root of a 3 x 3 positive definite matrix is presented. The derivation employs the Cayley-Hamilton theorem avoiding calculation of eigenvectors. We show that evaluation of one eigenvalue of the square root matrix is needed and can not be circumvented. The algorithm is robust and efficient. (author) [pt
A Domain-Specific Programming Language for Secure Multiparty Computation
DEFF Research Database (Denmark)
Nielsen, Janus Dam; Schwartzbach, Michael Ignatieff
2007-01-01
We present a domain-specific programming language for Secure Multiparty Computation (SMC). Information is a resource of vital importance and considerable economic value to individuals, public administration, and private companies. This means that the confidentiality of information is crucial...... on secret values and results are only revealed according to specific protocols. We identify the key linguistic concepts of SMC and bridge the gap between high-level security requirements and low-level cryptographic operations constituting an SMC platform, thus improving the efficiency and security of SMC...
Nofre, D.; Priestley, M.; Alberts, G.
2014-01-01
Language is one of the central metaphors around which the discipline of computer science has been built. The language metaphor entered modern computing as part of a cybernetic discourse, but during the second half of the 1950s acquired a more abstract meaning, closely related to the formal languages
Elkabas, Charles
1989-01-01
Recent second language instruction computer software focuses almost exclusively on the structures and forms of language, and on programed learning instead of developing communicative skills. Until artificial intelligence changes these old behavioristic principles, computer-assisted language instruction can only play a minor role in language…
The Sizing and Optimization Language, (SOL): Computer language for design problems
Lucas, Stephen H.; Scotti, Stephen J.
1988-01-01
The Sizing and Optimization Language, (SOL), a new high level, special purpose computer language was developed to expedite application of numerical optimization to design problems and to make the process less error prone. SOL utilizes the ADS optimization software and provides a clear, concise syntax for describing an optimization problem, the OPTIMIZE description, which closely parallels the mathematical description of the problem. SOL offers language statements which can be used to model a design mathematically, with subroutines or code logic, and with existing FORTRAN routines. In addition, SOL provides error checking and clear output of the optimization results. Because of these language features, SOL is best suited to model and optimize a design concept when the model consits of mathematical expressions written in SOL. For such cases, SOL's unique syntax and error checking can be fully utilized. SOL is presently available for DEC VAX/VMS systems. A SOL package is available which includes the SOL compiler, runtime library routines, and a SOL reference manual.
A computer language for reducing activation analysis data
International Nuclear Information System (INIS)
Friedman, M.H.; Tanner, J.T.
1978-01-01
A program, written in FORTRAN, which defines a language for reducing activation analysis data is described. An attempt was made to optimize the choice of commands and their definitions so as to concisely express what should be done, make the language natural to use and easy to learn, arranqe a system of checks to guard against communication errors and have the language be inclusive. Communications are effected through commands, and these can be given in almost any order. Consistency checks are done and diagnostic messages are printed automatically to guard against the incorrect use of commands. Default options on the commands allow instructions to be expressed concisely while providing a capability to specify details for the data reduction process. The program has been implemented on a UNIVAC 1108 computer. A complete description of the commands, the algorithms used, and the internal consistency checks used are given elsewhere. The applications of the program and the methods for obtaining data automatically have already been described. (T.G.)
Multi-Language Programming Environments for High Performance Java Computing
Directory of Open Access Journals (Sweden)
Vladimir Getov
1999-01-01
Full Text Available Recent developments in processor capabilities, software tools, programming languages and programming paradigms have brought about new approaches to high performance computing. A steadfast component of this dynamic evolution has been the scientific community’s reliance on established scientific packages. As a consequence, programmers of high‐performance applications are reluctant to embrace evolving languages such as Java. This paper describes the Java‐to‐C Interface (JCI tool which provides application programmers wishing to use Java with immediate accessibility to existing scientific packages. The JCI tool also facilitates rapid development and reuse of existing code. These benefits are provided at minimal cost to the programmer. While beneficial to the programmer, the additional advantages of mixed‐language programming in terms of application performance and portability are addressed in detail within the context of this paper. In addition, we discuss how the JCI tool is complementing other ongoing projects such as IBM’s High‐Performance Compiler for Java (HPCJ and IceT’s metacomputing environment.
Directory of Open Access Journals (Sweden)
Bérenger Bramas
2018-04-01
Full Text Available The sparse matrix-vector product (SpMV is a fundamental operation in many scientific applications from various fields. The High Performance Computing (HPC community has therefore continuously invested a lot of effort to provide an efficient SpMV kernel on modern CPU architectures. Although it has been shown that block-based kernels help to achieve high performance, they are difficult to use in practice because of the zero padding they require. In the current paper, we propose new kernels using the AVX-512 instruction set, which makes it possible to use a blocking scheme without any zero padding in the matrix memory storage. We describe mask-based sparse matrix formats and their corresponding SpMV kernels highly optimized in assembly language. Considering that the optimal blocking size depends on the matrix, we also provide a method to predict the best kernel to be used utilizing a simple interpolation of results from previous executions. We compare the performance of our approach to that of the Intel MKL CSR kernel and the CSR5 open-source package on a set of standard benchmark matrices. We show that we can achieve significant improvements in many cases, both for sequential and for parallel executions. Finally, we provide the corresponding code in an open source library, called SPC5.
Computational physics an introduction to Monte Carlo simulations of matrix field theory
Ydri, Badis
2017-01-01
This book is divided into two parts. In the first part we give an elementary introduction to computational physics consisting of 21 simulations which originated from a formal course of lectures and laboratory simulations delivered since 2010 to physics students at Annaba University. The second part is much more advanced and deals with the problem of how to set up working Monte Carlo simulations of matrix field theories which involve finite dimensional matrix regularizations of noncommutative and fuzzy field theories, fuzzy spaces and matrix geometry. The study of matrix field theory in its own right has also become very important to the proper understanding of all noncommutative, fuzzy and matrix phenomena. The second part, which consists of 9 simulations, was delivered informally to doctoral students who are working on various problems in matrix field theory. Sample codes as well as sample key solutions are also provided for convenience and completness. An appendix containing an executive arabic summary of t...
Computing Generalized Matrix Inverse on Spiking Neural Substrate
Shukla, Rohit; Khoram, Soroosh; Jorgensen, Erik; Li, Jing; Lipasti, Mikko; Wright, Stephen
2018-01-01
Emerging neural hardware substrates, such as IBM's TrueNorth Neurosynaptic System, can provide an appealing platform for deploying numerical algorithms. For example, a recurrent Hopfield neural network can be used to find the Moore-Penrose generalized inverse of a matrix, thus enabling a broad class of linear optimizations to be solved efficiently, at low energy cost. However, deploying numerical algorithms on hardware platforms that severely limit the range and precision of representation for numeric quantities can be quite challenging. This paper discusses these challenges and proposes a rigorous mathematical framework for reasoning about range and precision on such substrates. The paper derives techniques for normalizing inputs and properly quantizing synaptic weights originating from arbitrary systems of linear equations, so that solvers for those systems can be implemented in a provably correct manner on hardware-constrained neural substrates. The analytical model is empirically validated on the IBM TrueNorth platform, and results show that the guarantees provided by the framework for range and precision hold under experimental conditions. Experiments with optical flow demonstrate the energy benefits of deploying a reduced-precision and energy-efficient generalized matrix inverse engine on the IBM TrueNorth platform, reflecting 10× to 100× improvement over FPGA and ARM core baselines. PMID:29593483
Computing Generalized Matrix Inverse on Spiking Neural Substrate
Directory of Open Access Journals (Sweden)
Rohit Shukla
2018-03-01
Full Text Available Emerging neural hardware substrates, such as IBM's TrueNorth Neurosynaptic System, can provide an appealing platform for deploying numerical algorithms. For example, a recurrent Hopfield neural network can be used to find the Moore-Penrose generalized inverse of a matrix, thus enabling a broad class of linear optimizations to be solved efficiently, at low energy cost. However, deploying numerical algorithms on hardware platforms that severely limit the range and precision of representation for numeric quantities can be quite challenging. This paper discusses these challenges and proposes a rigorous mathematical framework for reasoning about range and precision on such substrates. The paper derives techniques for normalizing inputs and properly quantizing synaptic weights originating from arbitrary systems of linear equations, so that solvers for those systems can be implemented in a provably correct manner on hardware-constrained neural substrates. The analytical model is empirically validated on the IBM TrueNorth platform, and results show that the guarantees provided by the framework for range and precision hold under experimental conditions. Experiments with optical flow demonstrate the energy benefits of deploying a reduced-precision and energy-efficient generalized matrix inverse engine on the IBM TrueNorth platform, reflecting 10× to 100× improvement over FPGA and ARM core baselines.
Neurolinguistics and psycholinguistics as a basis for computer acquisition of natural language
Energy Technology Data Exchange (ETDEWEB)
Powers, D.M.W.
1983-04-01
Research into natural language understanding systems for computers has concentrated on implementing particular grammars and grammatical models of the language concerned. This paper presents a rationale for research into natural language understanding systems based on neurological and psychological principles. Important features of the approach are that it seeks to place the onus of learning the language on the computer, and that it seeks to make use of the vast wealth of relevant psycholinguistic and neurolinguistic theory. 22 references.
Image matrix processor for fast multi-dimensional computations
Roberson, George P.; Skeate, Michael F.
1996-01-01
An apparatus for multi-dimensional computation which comprises a computation engine, including a plurality of processing modules. The processing modules are configured in parallel and compute respective contributions to a computed multi-dimensional image of respective two dimensional data sets. A high-speed, parallel access storage system is provided which stores the multi-dimensional data sets, and a switching circuit routes the data among the processing modules in the computation engine and the storage system. A data acquisition port receives the two dimensional data sets representing projections through an image, for reconstruction algorithms such as encountered in computerized tomography. The processing modules include a programmable local host, by which they may be configured to execute a plurality of different types of multi-dimensional algorithms. The processing modules thus include an image manipulation processor, which includes a source cache, a target cache, a coefficient table, and control software for executing image transformation routines using data in the source cache and the coefficient table and loading resulting data in the target cache. The local host processor operates to load the source cache with a two dimensional data set, loads the coefficient table, and transfers resulting data out of the target cache to the storage system, or to another destination.
Pérez López, César
2014-01-01
MATLAB is a high-level language and environment for numerical computation, visualization, and programming. Using MATLAB, you can analyze data, develop algorithms, and create models and applications. The language, tools, and built-in math functions enable you to explore multiple approaches and reach a solution faster than with spreadsheets or traditional programming languages, such as C/C++ or Java. MATLAB Matrix Algebra introduces you to the MATLAB language with practical hands-on instructions and results, allowing you to quickly achieve your goals. Starting with a look at symbolic and numeric variables, with an emphasis on vector and matrix variables, you will go on to examine functions and operations that support vectors and matrices as arguments, including those based on analytic parent functions. Computational methods for finding eigenvalues and eigenvectors of matrices are detailed, leading to various matrix decompositions. Applications such as change of bases, the classification of quadratic forms and ...
A class of parallel algorithms for computation of the manipulator inertia matrix
Fijany, Amir; Bejczy, Antal K.
1989-01-01
Parallel and parallel/pipeline algorithms for computation of the manipulator inertia matrix are presented. An algorithm based on composite rigid-body spatial inertia method, which provides better features for parallelization, is used for the computation of the inertia matrix. Two parallel algorithms are developed which achieve the time lower bound in computation. Also described is the mapping of these algorithms with topological variation on a two-dimensional processor array, with nearest-neighbor connection, and with cardinality variation on a linear processor array. An efficient parallel/pipeline algorithm for the linear array was also developed, but at significantly higher efficiency.
Amaral, Luiz A.; Meurers, Detmar
2011-01-01
This paper explores the motivation and prerequisites for successful integration of Intelligent Computer-Assisted Language Learning (ICALL) tools into current foreign language teaching and learning (FLTL) practice. We focus on two aspects, which we argue to be important for effective ICALL system development and use: (i) the relationship between…
Katushemererwe, Fridah; Nerbonne, John
2015-01-01
This study presents the results from a computer-assisted language learning (CALL) system of Runyakitara (RU_CALL). The major objective was to provide an electronic language learning environment that can enable learners with mother tongue deficiencies to enhance their knowledge of grammar and acquire writing skills in Runyakitara. The system…
System matrix computation vs storage on GPU: A comparative study in cone beam CT.
Matenine, Dmitri; Côté, Geoffroi; Mascolo-Fortin, Julia; Goussard, Yves; Després, Philippe
2018-02-01
Iterative reconstruction algorithms in computed tomography (CT) require a fast method for computing the intersection distances between the trajectories of photons and the object, also called ray tracing or system matrix computation. This work focused on the thin-ray model is aimed at comparing different system matrix handling strategies using graphical processing units (GPUs). In this work, the system matrix is modeled by thin rays intersecting a regular grid of box-shaped voxels, known to be an accurate representation of the forward projection operator in CT. However, an uncompressed system matrix exceeds the random access memory (RAM) capacities of typical computers by one order of magnitude or more. Considering the RAM limitations of GPU hardware, several system matrix handling methods were compared: full storage of a compressed system matrix, on-the-fly computation of its coefficients, and partial storage of the system matrix with partial on-the-fly computation. These methods were tested on geometries mimicking a cone beam CT (CBCT) acquisition of a human head. Execution times of three routines of interest were compared: forward projection, backprojection, and ordered-subsets convex (OSC) iteration. A fully stored system matrix yielded the shortest backprojection and OSC iteration times, with a 1.52× acceleration for OSC when compared to the on-the-fly approach. Nevertheless, the maximum problem size was bound by the available GPU RAM and geometrical symmetries. On-the-fly coefficient computation did not require symmetries and was shown to be the fastest for forward projection. It also offered reasonable execution times of about 176.4 ms per view per OSC iteration for a detector of 512 × 448 pixels and a volume of 384 3 voxels, using commodity GPU hardware. Partial system matrix storage has shown a performance similar to the on-the-fly approach, while still relying on symmetries. Partial system matrix storage was shown to yield the lowest relative
Computing the Density Matrix in Electronic Structure Theory on Graphics Processing Units.
Cawkwell, M J; Sanville, E J; Mniszewski, S M; Niklasson, Anders M N
2012-11-13
The self-consistent solution of a Schrödinger-like equation for the density matrix is a critical and computationally demanding step in quantum-based models of interatomic bonding. This step was tackled historically via the diagonalization of the Hamiltonian. We have investigated the performance and accuracy of the second-order spectral projection (SP2) algorithm for the computation of the density matrix via a recursive expansion of the Fermi operator in a series of generalized matrix-matrix multiplications. We demonstrate that owing to its simplicity, the SP2 algorithm [Niklasson, A. M. N. Phys. Rev. B2002, 66, 155115] is exceptionally well suited to implementation on graphics processing units (GPUs). The performance in double and single precision arithmetic of a hybrid GPU/central processing unit (CPU) and full GPU implementation of the SP2 algorithm exceed those of a CPU-only implementation of the SP2 algorithm and traditional matrix diagonalization when the dimensions of the matrices exceed about 2000 × 2000. Padding schemes for arrays allocated in the GPU memory that optimize the performance of the CUBLAS implementations of the level 3 BLAS DGEMM and SGEMM subroutines for generalized matrix-matrix multiplications are described in detail. The analysis of the relative performance of the hybrid CPU/GPU and full GPU implementations indicate that the transfer of arrays between the GPU and CPU constitutes only a small fraction of the total computation time. The errors measured in the self-consistent density matrices computed using the SP2 algorithm are generally smaller than those measured in matrices computed via diagonalization. Furthermore, the errors in the density matrices computed using the SP2 algorithm do not exhibit any dependence of system size, whereas the errors increase linearly with the number of orbitals when diagonalization is employed.
Thai Language Sentence Similarity Computation Based on Syntactic Structure and Semantic Vector
Wang, Hongbin; Feng, Yinhan; Cheng, Liang
2018-03-01
Sentence similarity computation plays an increasingly important role in text mining, Web page retrieval, machine translation, speech recognition and question answering systems. Thai language as a kind of resources scarce language, it is not like Chinese language with HowNet and CiLin resources. So the Thai sentence similarity research faces some challenges. In order to solve this problem of the Thai language sentence similarity computation. This paper proposes a novel method to compute the similarity of Thai language sentence based on syntactic structure and semantic vector. This method firstly uses the Part-of-Speech (POS) dependency to calculate two sentences syntactic structure similarity, and then through the word vector to calculate two sentences semantic similarity. Finally, we combine the two methods to calculate two Thai language sentences similarity. The proposed method not only considers semantic, but also considers the sentence syntactic structure. The experiment result shows that this method in Thai language sentence similarity computation is feasible.
Design Of Computer Based Test Using The Unified Modeling Language
Tedyyana, Agus; Danuri; Lidyawati
2017-12-01
The Admission selection of Politeknik Negeri Bengkalis through interest and talent search (PMDK), Joint Selection of admission test for state Polytechnics (SB-UMPN) and Independent (UM-Polbeng) were conducted by using paper-based Test (PBT). Paper Based Test model has some weaknesses. They are wasting too much paper, the leaking of the questios to the public, and data manipulation of the test result. This reasearch was Aimed to create a Computer-based Test (CBT) models by using Unified Modeling Language (UML) the which consists of Use Case diagrams, Activity diagram and sequence diagrams. During the designing process of the application, it is important to pay attention on the process of giving the password for the test questions before they were shown through encryption and description process. RSA cryptography algorithm was used in this process. Then, the questions shown in the questions banks were randomized by using the Fisher-Yates Shuffle method. The network architecture used in Computer Based test application was a client-server network models and Local Area Network (LAN). The result of the design was the Computer Based Test application for admission to the selection of Politeknik Negeri Bengkalis.
Sanderson, Peter C
1973-01-01
Interactive Computing in BASIC: An Introduction to Interactive Computing and a Practical Course in the BASIC Language provides a general introduction to the principles of interactive computing and a comprehensive practical guide to the programming language Beginners All-purpose Symbolic Instruction Code (BASIC). The book starts by providing an introduction to computers and discussing the aspects of terminal usage, programming languages, and the stages in writing and testing a program. The text then discusses BASIC with regard to methods in writing simple arithmetical programs, control stateme
PRAXIS, High Level Computer Language for System Applications
International Nuclear Information System (INIS)
Holloway, F.W.
1998-01-01
1 - Description of program or function: PRAXIS is a systems implementation programming language designed especially for control and communications programming. It is a modern, strongly-typed, block-structured language similar to PASCAL but with extensions and features particular to control systems applications. The software consists of three PRAXIS compilers and three associated support utilities - the PRAXIS RMS-11 Interface, a set of procedures, functions, and type declarations which allow PRAXIS programs to interface to the RMS-11 Input/Output system under VAX/VMS and the RSX-11M systems; TEXTIO, character I/O software for terminal and line-printer text operations; and UNPASCAL, a program which translates simple PASCAL programs into PRAXIS. The compilers included are: a VAX/VMS version which generates VAX code, a VAX/VMS version which generates PDP11 codes, and a PDP11/RSX-11M version which generates PDP11 code. NESC Edition B of PRAXIS is designated as Version 7.3 by the contributors. The PDP11 compiler is not supported and has not been changed since February 1982. 2 - Method of solution: The PRAXIS compilers use LALR parsing technique to generate an intermediate machine-independent code. This is then processed using templates for the target computer to generate actual machine instructions
Eichenberger, Alexandre E; Gschwind, Michael K; Gunnels, John A
2013-11-05
Mechanisms for performing matrix multiplication operations with data pre-conditioning in a high performance computing architecture are provided. A vector load operation is performed to load a first vector operand of the matrix multiplication operation to a first target vector register. A load and splat operation is performed to load an element of a second vector operand and replicating the element to each of a plurality of elements of a second target vector register. A multiply add operation is performed on elements of the first target vector register and elements of the second target vector register to generate a partial product of the matrix multiplication operation. The partial product of the matrix multiplication operation is accumulated with other partial products of the matrix multiplication operation.
Subroutine library for error estimation of matrix computation (Ver. 1.0)
International Nuclear Information System (INIS)
Ichihara, Kiyoshi; Shizawa, Yoshihisa; Kishida, Norio
1999-03-01
'Subroutine Library for Error Estimation of Matrix Computation' is a subroutine library which aids the users in obtaining the error ranges of the linear system's solutions or the Hermitian matrices' eigenvalues. This library contains routines for both sequential computers and parallel computers. The subroutines for linear system error estimation calculate norms of residual vectors, matrices's condition numbers, error bounds of solutions and so on. The subroutines for error estimation of Hermitian matrix eigenvalues derive the error ranges of the eigenvalues according to the Korn-Kato's formula. The test matrix generators supply the matrices appeared in the mathematical research, the ones randomly generated and the ones appeared in the application programs. This user's manual contains a brief mathematical background of error analysis on linear algebra and usage of the subroutines. (author)
International Nuclear Information System (INIS)
Dongarra, J.J.
1982-01-01
SICEDR is a FORTRAN subroutine for improving the accuracy of a computed real eigenvalue and improving or computing the associated eigenvector. It is first used to generate information during the determination of the eigenvalues by the Schur decomposition technique. In particular, the Schur decomposition technique results in an orthogonal matrix Q and an upper quasi-triangular matrix T, such that A = QTQ/sup T/. Matrices A, Q, and T and the approximate eigenvalue, say lambda, are then used in the improvement phase. SICEDR uses an iterative method similar to iterative improvement for linear systems to improve the accuracy of lambda and improve or compute the eigenvector x in O(n 2 ) work, where n is the order of the matrix A
Shiva, S. G.
1978-01-01
Several high level languages which evolved over the past few years for describing and simulating the structure and behavior of digital systems, on digital computers are assessed. The characteristics of the four prominent languages (CDL, DDL, AHPL, ISP) are summarized. A criterion for selecting a suitable hardware description language for use in an automatic integrated circuit design environment is provided.
Parallel Computation of the Jacobian Matrix for Nonlinear Equation Solvers Using MATLAB
Rose, Geoffrey K.; Nguyen, Duc T.; Newman, Brett A.
2017-01-01
Demonstrating speedup for parallel code on a multicore shared memory PC can be challenging in MATLAB due to underlying parallel operations that are often opaque to the user. This can limit potential for improvement of serial code even for the so-called embarrassingly parallel applications. One such application is the computation of the Jacobian matrix inherent to most nonlinear equation solvers. Computation of this matrix represents the primary bottleneck in nonlinear solver speed such that commercial finite element (FE) and multi-body-dynamic (MBD) codes attempt to minimize computations. A timing study using MATLAB's Parallel Computing Toolbox was performed for numerical computation of the Jacobian. Several approaches for implementing parallel code were investigated while only the single program multiple data (spmd) method using composite objects provided positive results. Parallel code speedup is demonstrated but the goal of linear speedup through the addition of processors was not achieved due to PC architecture.
On the Relationship between a Computational Natural Logic and Natural Language
DEFF Research Database (Denmark)
Andreasen, Troels; Bulskov, Henrik; Nilsson, Jørgen Fischer
2016-01-01
This paper makes a case for adopting appropriate forms of natural logic as target language for computational reasoning with descriptive natural language. Natural logics are stylized fragments of natural language where reasoning can be conducted directly by natural reasoning rules reflecting intui...... intuitive reasoning in natural language. The approach taken in this paper is to extend natural logic stepwise with a view to covering successively larger parts of natural language. We envisage applications for computational querying and reasoning, in particular within the life-sciences....
THE ROLE OF COMPUTER TECHNOLOGY IN TEACHING ENGLISH LANGUAGE
Directory of Open Access Journals (Sweden)
Батагоз Талгатовна Керимбаева
2017-12-01
Full Text Available In the article an attempt was made to define the role and to study the peculiarities of functioning of English language in higher education. The state of education of the Republic of Kazakhstan and trends of development of society are the most result problems of priority development of the education system on the basis of computer technology and the creation of a unified educational information environment. With the rapid development of science, fast updates of information, it is impossible to learn for a lifetime, it is important to develop the interest in obtaining knowledge for continuous self- education. Intense changes in society caused by the development of modern educational technologies, has led to the need for change of the education system. The main objective of the training is to achieve a new modern quality of education.Modernization of the Kazakhstan education defines the main goal of professional education as the training of qualified professional of the appropriate level and profile, fluent in their profession, capable to effective work on a speciality at the level of world standards, ready for professional growth and professional mobility. Modern trends of modernization of educational programs demand introduction of modern methods of teaching. The increasing introduction of new computer technology and the application of the competence approach in educational process of H.A. Yasawi International kazakh- turkish university promotes increase of efficiency of process of teaching English.
The Julia programming language: the future of scientific computing
Gibson, John
2017-11-01
Julia is an innovative new open-source programming language for high-level, high-performance numerical computing. Julia combines the general-purpose breadth and extensibility of Python, the ease-of-use and numeric focus of Matlab, the speed of C and Fortran, and the metaprogramming power of Lisp. Julia uses type inference and just-in-time compilation to compile high-level user code to machine code on the fly. A rich set of numeric types and extensive numerical libraries are built-in. As a result, Julia is competitive with Matlab for interactive graphical exploration and with C and Fortran for high-performance computing. This talk interactively demonstrates Julia's numerical features and benchmarks Julia against C, C++, Fortran, Matlab, and Python on a spectral time-stepping algorithm for a 1d nonlinear partial differential equation. The Julia code is nearly as compact as Matlab and nearly as fast as Fortran. This material is based upon work supported by the National Science Foundation under Grant No. 1554149.
Lucas, S. H.; Scotti, S. J.
1989-01-01
The nonlinear mathematical programming method (formal optimization) has had many applications in engineering design. A figure illustrates the use of optimization techniques in the design process. The design process begins with the design problem, such as the classic example of the two-bar truss designed for minimum weight as seen in the leftmost part of the figure. If formal optimization is to be applied, the design problem must be recast in the form of an optimization problem consisting of an objective function, design variables, and constraint function relations. The middle part of the figure shows the two-bar truss design posed as an optimization problem. The total truss weight is the objective function, the tube diameter and truss height are design variables, with stress and Euler buckling considered as constraint function relations. Lastly, the designer develops or obtains analysis software containing a mathematical model of the object being optimized, and then interfaces the analysis routine with existing optimization software such as CONMIN, ADS, or NPSOL. This final state of software development can be both tedious and error-prone. The Sizing and Optimization Language (SOL), a special-purpose computer language whose goal is to make the software implementation phase of optimum design easier and less error-prone, is presented.
Integrating Computer-Assisted Language Learning in Saudi Schools: A Change Model
Alresheed, Saleh; Leask, Marilyn; Raiker, Andrea
2015-01-01
Computer-assisted language learning (CALL) technology and pedagogy have gained recognition globally for their success in supporting second language acquisition (SLA). In Saudi Arabia, the government aims to provide most educational institutions with computers and networking for integrating CALL into classrooms. However, the recognition of CALL's…
Design and Delivery of Multiple Server-Side Computer Languages Course
Wang, Shouhong; Wang, Hai
2011-01-01
Given the emergence of service-oriented architecture, IS students need to be knowledgeable of multiple server-side computer programming languages to be able to meet the needs of the job market. This paper outlines the pedagogy of an innovative course of multiple server-side computer languages for the undergraduate IS majors. The paper discusses…
The Role of Computer-Assisted Language Learning (CALL) in Promoting Learner Autonomy
Mutlu, Arzu; Eroz-Tuga, Betil
2013-01-01
Problem Statement: Teaching a language with the help of computers and the Internet has attracted the attention of many practitioners and researchers in the last 20 years, so the number of studies that investigate whether computers and the Internet promote language learning continues to increase. These studies have focused on exploring the beliefs…
Bouchefra, Miloud; Baghoussi, Meriem
2017-01-01
Computer Assisted Language Learning (CALL) is still groping its way into Algerian English as a Foreign Language (EFL) classroom, where Information Communications Technologies (ICTs) are defined in terms of occasional use of computers and data projectors for material presentation in the classroom. Though major issues in the image of the lack of…
Two-Language, Two-Paradigm Introductory Computing Curriculum Model and its Implementation
Zanev, Vladimir; Radenski, Atanas
2011-01-01
This paper analyzes difficulties with the introduction of object-oriented concepts in introductory computing education and then proposes a two-language, two-paradigm curriculum model that alleviates such difficulties. Our two-language, two-paradigm curriculum model begins with teaching imperative programming using Python programming language, continues with teaching object-oriented computing using Java, and concludes with teaching object-oriented data structures with Java.
Simple and practical approach for computing the ray Hessian matrix in geometrical optics.
Lin, Psang Dain
2018-02-01
A method is proposed for simplifying the computation of the ray Hessian matrix in geometrical optics by replacing the angular variables in the system variable vector with their equivalent cosine and sine functions. The variable vector of a boundary surface is similarly defined in such a way as to exclude any angular variables. It is shown that the proposed formulations reduce the computation time of the Hessian matrix by around 10 times compared to the previous method reported by the current group in Advanced Geometrical Optics (2016). Notably, the method proposed in this study involves only polynomial differentiation, i.e., trigonometric function calls are not required. As a consequence, the computation complexity is significantly reduced. Five illustrative examples are given. The first three examples show that the proposed method is applicable to the determination of the Hessian matrix for any pose matrix, irrespective of the order in which the rotation and translation motions are specified. The last two examples demonstrate the use of the proposed Hessian matrix in determining the axial and lateral chromatic aberrations of a typical optical system.
Daghma, Diaa Eldin S; Malhan, Deeksha; Simon, Paul; Stötzel, Sabine; Kern, Stefanie; Hassan, Fathi; Lips, Katrin Susanne; Heiss, Christian; El Khassawna, Thaqif
2018-05-01
Bone loss varies according to disease and age and these variations affect bone cells and extracellular matrix. Osteoporosis rat models are widely investigated to assess mechanical and structural properties of bone; however, bone matrix proteins and their discrepant regulation of diseased and aged bone are often overlooked. The current study considered the spine matrix properties of ovariectomized rats (OVX) against control rats (Sham) at 16 months of age. Diseased bone showed less compact structure with inhomogeneous distribution of type 1 collagen (Col1) and changes in osteocyte morphology. Intriguingly, demineralization patches were noticed in the vicinity of blood vessels in the OVX spine. The organic matrix structure was investigated using computational segmentation of collagen fibril properties. In contrast to the aged bone, diseased bone showed longer fibrils and smaller orientation angles. The study shows the potential of quantifying transmission electron microscopy images to predict the mechanical properties of bone tissue.
Some Matrix Iterations for Computing Generalized Inverses and Balancing Chemical Equations
Soleimani, Farahnaz; Stanimirovi´c, Predrag; Soleymani, Fazlollah
2015-01-01
An application of iterative methods for computing the Moore–Penrose inverse in balancing chemical equations is considered. With the aim to illustrate proposed algorithms, an improved high order hyper-power matrix iterative method for computing generalized inverses is introduced and applied. The improvements of the hyper-power iterative scheme are based on its proper factorization, as well as on the possibility to accelerate the iterations in the initial phase of the convergence. Although the ...
Projection matrix acquisition for cone-beam computed tomography iterative reconstruction
Yang, Fuqiang; Zhang, Dinghua; Huang, Kuidong; Shi, Wenlong; Zhang, Caixin; Gao, Zongzhao
2017-02-01
Projection matrix is an essential and time-consuming part in computed tomography (CT) iterative reconstruction. In this article a novel calculation algorithm of three-dimensional (3D) projection matrix is proposed to quickly acquire the matrix for cone-beam CT (CBCT). The CT data needed to be reconstructed is considered as consisting of the three orthogonal sets of equally spaced and parallel planes, rather than the individual voxels. After getting the intersections the rays with the surfaces of the voxels, the coordinate points and vertex is compared to obtain the index value that the ray traversed. Without considering ray-slope to voxel, it just need comparing the position of two points. Finally, the computer simulation is used to verify the effectiveness of the algorithm.
Computer Language Choices in Arms Control and Nonproliferation Regimes
International Nuclear Information System (INIS)
White, G K
2005-01-01
The U.S. and Russian Federation continue to make substantive progress in the arms control and nonproliferation transparency regimes. We are moving toward an implementation choice for creating radiation measurement systems that are transparent in both their design and in their implementation. In particular, the choice of a programming language to write software for such regimes can decrease or significantly increase the costs of authentication. In this paper, we compare procedural languages with object-oriented languages. In particular, we examine the C and C++ languages; we compare language features, code generation, implementation details, and executable size and demonstrate how these attributes aid or hinder authentication and backdoor threats. We show that programs in lower level, procedural languages are more easily authenticated than are object-oriented ones. Potential tools and methods for authentication are covered. Possible mitigations are suggested for using object-oriented programming languages
Energy Technology Data Exchange (ETDEWEB)
1978-01-01
The program and abstracts of the SIAM 1978 fall meeting in Knoxville, Tennessee, are given, along with those of the associated symposium on sparse matrix computations. The papers dealt with both pure mathematics and mathematics applied to many different subject areas. (RWR)
Uchill, Joseph H.; Assadi, Amir H.
2003-01-01
The advent of the internet has opened a host of new and exciting questions in the science and mathematics of information organization and data mining. In particular, a highly ambitious promise of the internet is to bring the bulk of human knowledge to everyone with access to a computer network, providing a democratic medium for sharing and communicating knowledge regardless of the language of the communication. The development of sharing and communication of knowledge via transfer of digital files is the first crucial achievement in this direction. Nonetheless, available solutions to numerous ancillary problems remain far from satisfactory. Among such outstanding problems are the first few fundamental questions that have been responsible for the emergence and rapid growth of the new field of Knowledge Engineering, namely, classification of forms of data, their effective organization, and extraction of knowledge from massive distributed data sets, and the design of fast effective search engines. The precision of machine learning algorithms in classification and recognition of image data (e.g. those scanned from books and other printed documents) are still far from human performance and speed in similar tasks. Discriminating the many forms of ASCII data from each other is not as difficult in view of the emerging universal standards for file-format. Nonetheless, most of the past and relatively recent human knowledge is yet to be transformed and saved in such machine readable formats. In particular, an outstanding problem in knowledge engineering is the problem of organization and management--with precision comparable to human performance--of knowledge in the form of images of documents that broadly belong to either text, image or a blend of both. It was shown in that the effectiveness of OCR was intertwined with the success of language and font recognition.
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
Numerical computation of the transport matrix in toroidal plasma with a stochastic magnetic field
Zhu, Siqiang; Chen, Dunqiang; Dai, Zongliang; Wang, Shaojie
2018-04-01
A new numerical method, based on integrating along the full orbit of guiding centers, to compute the transport matrix is realized. The method is successfully applied to compute the phase-space diffusion tensor of passing electrons in a tokamak with a stochastic magnetic field. The new method also computes the Lagrangian correlation function, which can be used to evaluate the Lagrangian correlation time and the turbulence correlation length. For the case of the stochastic magnetic field, we find that the order of magnitude of the parallel correlation length can be estimated by qR0, as expected previously.
Artificial intelligence programming languages for computer aided manufacturing
Rieger, C.; Samet, H.; Rosenberg, J.
1979-01-01
Eight Artificial Intelligence programming languages (SAIL, LISP, MICROPLANNER, CONNIVER, MLISP, POP-2, AL, and QLISP) are presented and surveyed, with examples of their use in an automated shop environment. Control structures are compared, and distinctive features of each language are highlighted. A simple programming task is used to illustrate programs in SAIL, LISP, MICROPLANNER, and CONNIVER. The report assumes reader knowledge of programming concepts, but not necessarily of the languages surveyed.
Dashtestani, Reza
2014-01-01
Computer literacy is a significant component of language teachers' computer-assisted language learning (call) knowledge. Despite its importance, limited research has been undertaken to analyze factors which might influence language teachers' computer literacy levels. This qualitative study explored the perspectives of 39 Iranian EFL teacher…
Rana computatrix to human language: towards a computational neuroethology of language evolution.
Arbib, Michael A
2003-10-15
Walter's Machina speculatrix inspired the name Rana computatrix for a family of models of visuomotor coordination in the frog, which contributed to the development of computational neuroethology. We offer here an 'evolutionary' perspective on models in the same tradition for rat, monkey and human. For rat, we show how the frog-like taxon affordance model provides a basis for the spatial navigation mechanisms that involve the hippocampus and other brain regions. For monkey, we recall two models of neural mechanisms for visuomotor coordination. The first, for saccades, shows how interactions between the parietal and frontal cortex augment superior colliculus seen as the homologue of frog tectum. The second, for grasping, continues the theme of parieto-frontal interactions, linking parietal affordances to motor schemas in premotor cortex. It further emphasizes the mirror system for grasping, in which neurons are active both when the monkey executes a specific grasp and when it observes a similar grasp executed by others. The model of human-brain mechanisms is based on the mirror-system hypothesis of the evolution of the language-ready brain, which sees the human Broca's area as an evolved extension of the mirror system for grasping.
Experience in programming Assembly language of CDC CYBER 170/750 computer
International Nuclear Information System (INIS)
Caldeira, A.D.
1987-10-01
Aiming to optimize processing time of BCG computer code in the CDC CYBER 170/750 computer, the FORTRAN-V language of INTERP subroutine was converted to Assembly language. The BCG code was developed for solving neutron transport equation by iterative method, and the INTERP subroutine is innermost loop of the code carrying out 5 interpolation types. The central processor unit Assembly language of the CDC CYBER 170/750 computer and its application in implementing the interpolation subroutine of BCG code are described. (M.C.K.)
A Study of the Programming Languages Used in Information Systems and in Computer Science Curricula
Russell, Jack; Russell, Barbara; Pollacia, Lissa F.; Tastle, William J.
2010-01-01
This paper researches the computer languages taught in the first, second and third programming courses in Computer Information Systems (CIS), Management Information Systems (MIS or IS) curricula as well as in Computer Science (CS) and Information Technology (IT) curricula. Instructors teaching the first course in programming within a four year…
Zhang, Leihong; Liang, Dong; Li, Bei; Kang, Yi; Pan, Zilan; Zhang, Dawei; Gao, Xiumin; Ma, Xiuhua
2016-07-01
On the basis of analyzing the cosine light field with determined analytic expression and the pseudo-inverse method, the object is illuminated by a presetting light field with a determined discrete Fourier transform measurement matrix, and the object image is reconstructed by the pseudo-inverse method. The analytic expression of the algorithm of computational ghost imaging based on discrete Fourier transform measurement matrix is deduced theoretically, and compared with the algorithm of compressive computational ghost imaging based on random measurement matrix. The reconstruction process and the reconstruction error are analyzed. On this basis, the simulation is done to verify the theoretical analysis. When the sampling measurement number is similar to the number of object pixel, the rank of discrete Fourier transform matrix is the same as the one of the random measurement matrix, the PSNR of the reconstruction image of FGI algorithm and PGI algorithm are similar, the reconstruction error of the traditional CGI algorithm is lower than that of reconstruction image based on FGI algorithm and PGI algorithm. As the decreasing of the number of sampling measurement, the PSNR of reconstruction image based on FGI algorithm decreases slowly, and the PSNR of reconstruction image based on PGI algorithm and CGI algorithm decreases sharply. The reconstruction time of FGI algorithm is lower than that of other algorithms and is not affected by the number of sampling measurement. The FGI algorithm can effectively filter out the random white noise through a low-pass filter and realize the reconstruction denoising which has a higher denoising capability than that of the CGI algorithm. The FGI algorithm can improve the reconstruction accuracy and the reconstruction speed of computational ghost imaging.
Matrix-vector multiplication using digital partitioning for more accurate optical computing
Gary, C. K.
1992-01-01
Digital partitioning offers a flexible means of increasing the accuracy of an optical matrix-vector processor. This algorithm can be implemented with the same architecture required for a purely analog processor, which gives optical matrix-vector processors the ability to perform high-accuracy calculations at speeds comparable with or greater than electronic computers as well as the ability to perform analog operations at a much greater speed. Digital partitioning is compared with digital multiplication by analog convolution, residue number systems, and redundant number representation in terms of the size and the speed required for an equivalent throughput as well as in terms of the hardware requirements. Digital partitioning and digital multiplication by analog convolution are found to be the most efficient alogrithms if coding time and hardware are considered, and the architecture for digital partitioning permits the use of analog computations to provide the greatest throughput for a single processor.
A Randomized Field Trial of the Fast ForWord Language Computer-Based Training Program
Borman, Geoffrey D.; Benson, James G.; Overman, Laura
2009-01-01
This article describes an independent assessment of the Fast ForWord Language computer-based training program developed by Scientific Learning Corporation. Previous laboratory research involving children with language-based learning impairments showed strong effects on their abilities to recognize brief and fast sequences of nonspeech and speech…
High level language for measurement complex control based on the computer E-100I
Zubkov, B. V.
1980-01-01
A high level language was designed to control the process of conducting an experiment using the computer "Elektrinika-1001". Program examples are given to control the measuring and actuating devices. The procedure of including these programs in the suggested high level language is described.
Saeed, Farah Jamal Abed Alrazeq; Al-Zayed, Norma Nawaf
2018-01-01
The study aimed at investigating the attitudes of Jordanian undergraduate students towards using computer assisted-language learning (CALL) and its effectiveness in the process of learning the English language. In order to fulfill the study's objective, the researchers used a questionnaire to collect data, followed-up with semi-structured…
Listening Strategy Use and Influential Factors in Web-Based Computer Assisted Language Learning
Chen, L.; Zhang, R.; Liu, C.
2014-01-01
This study investigates second and foreign language (L2) learners' listening strategy use and factors that influence their strategy use in a Web-based computer assisted language learning (CALL) system. A strategy inventory, a factor questionnaire and a standardized listening test were used to collect data from a group of 82 Chinese students…
Peterson, Mark
2010-01-01
This article explores research on the use of computerized games and simulations in language education. The author examined the psycholinguistic and sociocultural constructs proposed as a basis for the use of games and simulations in computer-assisted language learning. Research in this area is expanding rapidly. However, to date, few studies have…
Criteria for Appraising Computer-Based Simulations for Teaching Arabic as a Foreign Language
National Research Council Canada - National Science Library
Dabrowski, Richard
2005-01-01
This was an exploratory study aimed at defining more sharply the pedagogical and practical challenges entailed in designing and creating computer-based game-types simulations for learning Arabic as a foreign language...
CPL: A Core Language for Cloud Computing -- Technical Report
Bračevac, Oliver; Erdweg, Sebastian; Salvaneschi, Guido; Mezini, Mira
2016-01-01
Running distributed applications in the cloud involves deployment. That is, distribution and configuration of application services and middleware infrastructure. The considerable complexity of these tasks resulted in the emergence of declarative JSON-based domain-specific deployment languages to develop deployment programs. However, existing deployment programs unsafely compose artifacts written in different languages, leading to bugs that are hard to detect before run time. Furthermore, depl...
Some Matrix Iterations for Computing Generalized Inverses and Balancing Chemical Equations
Directory of Open Access Journals (Sweden)
Farahnaz Soleimani
2015-11-01
Full Text Available An application of iterative methods for computing the Moore–Penrose inverse in balancing chemical equations is considered. With the aim to illustrate proposed algorithms, an improved high order hyper-power matrix iterative method for computing generalized inverses is introduced and applied. The improvements of the hyper-power iterative scheme are based on its proper factorization, as well as on the possibility to accelerate the iterations in the initial phase of the convergence. Although the effectiveness of our approach is confirmed on the basis of the theoretical point of view, some numerical comparisons in balancing chemical equations, as well as on randomly-generated matrices are furnished.
The Application of Visual Basic Computer Programming Language to Simulate Numerical Iterations
Directory of Open Access Journals (Sweden)
Abdulkadir Baba HASSAN
2006-06-01
Full Text Available This paper examines the application of Visual Basic Computer Programming Language to Simulate Numerical Iterations, the merit of Visual Basic as a Programming Language and the difficulties faced when solving numerical iterations analytically, this research paper encourage the uses of Computer Programming methods for the execution of numerical iterations and finally fashion out and develop a reliable solution using Visual Basic package to write a program for some selected iteration problems.
The employment of a spoken language computer applied to an air traffic control task.
Laveson, J. I.; Silver, C. A.
1972-01-01
Assessment of the merits of a limited spoken language (56 words) computer in a simulated air traffic control (ATC) task. An airport zone approximately 60 miles in diameter with a traffic flow simulation ranging from single-engine to commercial jet aircraft provided the workload for the controllers. This research determined that, under the circumstances of the experiments carried out, the use of a spoken-language computer would not improve the controller performance.
FORMATION OF PUPILS’ LEXICAL COMPETENCE BY COMPUTER GAMES IN THE STUDY OF UKRAINIAN LANGUAGE
Directory of Open Access Journals (Sweden)
Oksana A. Kucheruk
2018-02-01
Full Text Available The article deals with the problem of forming the lexical competence of younger teenage pupils with the use of computer games in the process of learning the Ukrainian language, the ways of its solution and the corresponding methodical recommendations are offered. The importance of creating and using computer games in order to improve the quality level of Ukrainian-language education is substantiated. The essence of the concepts of «lexical competence», «educational computer game» is specified. On the basis of analysis of scientific works, synthesis of educational and methodological ideas, generalization of own experience of pedagogical work the conditions of effective use of educational computer games within the limits of Ukrainian-language education are determined. It has been established that the integration of computer games into the traditional Ukrainian language learning system helps to provide internal motivation for learning, activating pupils ‘cognitive activity, forming general and substantive competencies. It is emphasized that the effectiveness of educational computer games in the language training of students depends on the level of professional education, ICT competence and linguodidactic skill of a teacher-translator. The educational potential of an interactive educational game complex is described, which is to stimulate interest in teaching the Ukrainian language and creates opportunities for the formation of lexical competence on the basis of electronic linguodidactics.
Prihatin, Pius N.
2012-01-01
Computer technology has been popular for teaching English as a foreign language in non-English speaking countries. This case study explored the way language instructors designed and implemented computer-based instruction so that students are engaged in English language learning. This study explored the beliefs, practices and perceptions of…
International Nuclear Information System (INIS)
Park, Nam-Gyu; Kim, Kyoung-Joo; Kim, Kyoung-Hong; Suh, Jung-Min
2013-01-01
Highlights: ► An identification method of the optimal stiffness matrix for a fuel assembly structure is discussed. ► The least squares optimization method is introduced, and a closed form solution of the problem is derived. ► The method can be expanded to the system with the limited number of modes. ► Identification error due to the perturbed mode shape matrix is analyzed. ► Verification examples show that the proposed procedure leads to a reliable solution. -- Abstract: A reactor core structural model which is used to evaluate the structural integrity of the core contains nuclear fuel assembly models. Since the reactor core consists of many nuclear fuel assemblies, the use of a refined fuel assembly model leads to a considerable amount of computing time for performing nonlinear analyses such as the prediction of seismic induced vibration behaviors. The computational time could be reduced by replacing the detailed fuel assembly model with a simplified model that has fewer degrees of freedom, but the dynamic characteristics of the detailed model must be maintained in the simplified model. Such a model based on an optimal design method is proposed in this paper. That is, when a mass matrix and a mode shape matrix are given, the optimal stiffness matrix of a discrete fuel assembly model can be estimated by applying the least squares minimization method. The verification of the method is completed by comparing test results and simulation results. This paper shows that the simplified model's dynamic behaviors are quite similar to experimental results and that the suggested method is suitable for identifying reliable mathematical model for fuel assemblies
CSIR Research Space (South Africa)
Olivrin, GJ
2006-02-01
Full Text Available example, between a deaf person who can sign and an able person or a person with a different disability who cannot sign). METHODOLOGY A signing avatar is set up to work together with a chatterbot. The chatterbot is a natural language dialogue interface... are then offered in sign language as the replies are interpreted by a signing avatar, a living character that can reproduce human-like gestures and expressions. To make South African Sign Language (SASL) available digitally, computational models of the language...
Rank diversity of languages: generic behavior in computational linguistics.
Cocho, Germinal; Flores, Jorge; Gershenson, Carlos; Pineda, Carlos; Sánchez, Sergio
2015-01-01
Statistical studies of languages have focused on the rank-frequency distribution of words. Instead, we introduce here a measure of how word ranks change in time and call this distribution rank diversity. We calculate this diversity for books published in six European languages since 1800, and find that it follows a universal lognormal distribution. Based on the mean and standard deviation associated with the lognormal distribution, we define three different word regimes of languages: "heads" consist of words which almost do not change their rank in time, "bodies" are words of general use, while "tails" are comprised by context-specific words and vary their rank considerably in time. The heads and bodies reflect the size of language cores identified by linguists for basic communication. We propose a Gaussian random walk model which reproduces the rank variation of words in time and thus the diversity. Rank diversity of words can be understood as the result of random variations in rank, where the size of the variation depends on the rank itself. We find that the core size is similar for all languages studied.
Rank Diversity of Languages: Generic Behavior in Computational Linguistics
Cocho, Germinal; Flores, Jorge; Gershenson, Carlos; Pineda, Carlos; Sánchez, Sergio
2015-01-01
Statistical studies of languages have focused on the rank-frequency distribution of words. Instead, we introduce here a measure of how word ranks change in time and call this distribution rank diversity. We calculate this diversity for books published in six European languages since 1800, and find that it follows a universal lognormal distribution. Based on the mean and standard deviation associated with the lognormal distribution, we define three different word regimes of languages: “heads” consist of words which almost do not change their rank in time, “bodies” are words of general use, while “tails” are comprised by context-specific words and vary their rank considerably in time. The heads and bodies reflect the size of language cores identified by linguists for basic communication. We propose a Gaussian random walk model which reproduces the rank variation of words in time and thus the diversity. Rank diversity of words can be understood as the result of random variations in rank, where the size of the variation depends on the rank itself. We find that the core size is similar for all languages studied. PMID:25849150
Directory of Open Access Journals (Sweden)
Masao Yokota
2012-01-01
Full Text Available Mental image directed semantic theory (MIDST has proposed an omnisensory mental image model and its description language Lmd. This language is designed to represent and compute human intuitive knowledge of space and can provide multimedia expressions with intermediate semantic descriptions in predicate logic. It is hypothesized that such knowledge and semantic descriptions are controlled by human attention toward the world and therefore subjective to each human individual. This paper describes Lmd expression of human subjective knowledge of space and its application to aware computing in cross-media operation between linguistic and pictorial expressions as spatial language understanding.
A computational model of in vitro angiogenesis based on extracellular matrix fibre orientation.
Edgar, Lowell T; Sibole, Scott C; Underwood, Clayton J; Guilkey, James E; Weiss, Jeffrey A
2013-01-01
Recent interest in the process of vascularisation within the biomedical community has motivated numerous new research efforts focusing on the process of angiogenesis. Although the role of chemical factors during angiogenesis has been well documented, the role of mechanical factors, such as the interaction between angiogenic vessels and the extracellular matrix, remains poorly understood. In vitro methods for studying angiogenesis exist; however, measurements available using such techniques often suffer from limited spatial and temporal resolutions. For this reason, computational models have been extensively employed to investigate various aspects of angiogenesis. This paper outlines the formulation and validation of a simple and robust computational model developed to accurately simulate angiogenesis based on length, branching and orientation morphometrics collected from vascularised tissue constructs. Microvessels were represented as a series of connected line segments. The morphology of the vessels was determined by a linear combination of the collagen fibre orientation, the vessel density gradient and a random walk component. Excellent agreement was observed between computational and experimental morphometric data over time. Computational predictions of microvessel orientation within an anisotropic matrix correlated well with experimental data. The accuracy of this modelling approach makes it a valuable platform for investigating the role of mechanical interactions during angiogenesis.
Translator program converts computer printout into braille language
Powell, R. A.
1967-01-01
Computer program converts print image tape files into six dot Braille cells, enabling a blind computer programmer to monitor and evaluate data generated by his own programs. The Braille output is printed 8 lines per inch.
Training Senior Teachers in Compulsory Computer Based Language Tests
Laborda, Jesus Garcia; Royo, Teresa Magal
2009-01-01
The IBT TOEFL has become the principal example of online high stakes language testing since 2005. Most instructors who do the preparation for IBT TOEFL face two main realities: first, students are eager and highly motivated to take the test because of the prospective implications; and, second, specific studies would be necessary to see if…
Computing an Ontological Semantics for a Natural Language Fragment
DEFF Research Database (Denmark)
Szymczak, Bartlomiej Antoni
tried to establish a domain independent “ontological semantics” for relevant fragments of natural language. The purpose of this research is to develop methods and systems for taking advantage of formal ontologies for the purpose of extracting the meaning contents of texts. This functionality...
A method to compute the inverse of a complex n-block tridiagonal quasi-hermitian matrix
International Nuclear Information System (INIS)
Godfrin, Elena
1990-01-01
This paper presents a method to compute the inverse of a complex n-block tridiagonal quasi-hermitian matrix using adequate partitions of the complete matrix. This type of matrix is very usual in quantum mechanics and, more specifically, in solid state physics (e.g., interfaces and superlattices), when the tight-binding approximation is used. The efficiency of the method is analyzed comparing the required CPU time and work-area for different usual techniques. (Author)
Design Patterns for Sparse-Matrix Computations on Hybrid CPU/GPU Platforms
Directory of Open Access Journals (Sweden)
Valeria Cardellini
2014-01-01
Full Text Available We apply object-oriented software design patterns to develop code for scientific software involving sparse matrices. Design patterns arise when multiple independent developments produce similar designs which converge onto a generic solution. We demonstrate how to use design patterns to implement an interface for sparse matrix computations on NVIDIA GPUs starting from PSBLAS, an existing sparse matrix library, and from existing sets of GPU kernels for sparse matrices. We also compare the throughput of the PSBLAS sparse matrix–vector multiplication on two platforms exploiting the GPU with that obtained by a CPU-only PSBLAS implementation. Our experiments exhibit encouraging results regarding the comparison between CPU and GPU executions in double precision, obtaining a speedup of up to 35.35 on NVIDIA GTX 285 with respect to AMD Athlon 7750, and up to 10.15 on NVIDIA Tesla C2050 with respect to Intel Xeon X5650.
Dos Santos, Roberto-Márcio; Sobrinho, Jerônimo Coura
In the area of language teaching both language skills and textual genres can be worked with simultaneously (thus responding to the Brazilian Curricular Parameters and to the trends in contemporary education, which emphasize contextualized teaching) by means of computers. Computers can make the teaching process dynamic and rich, since they enable the access to the foreign language through virtual environments, which creates a larger number of learning contexts, with all their specific vocabulary and linguistic features in real communication. This study focuses on possible applications of this kind of approach. The computer online is a resource of diverse textual genres and can be an important tool in the language classroom as well as an access to authentic material produced in contextualized practice close to real-life communication. On the other hand, all these materials must be appropriately used without ever worshipping the technology as if it were a miraculous solution. After all, the professional pedagogic skills of the teacher should never be forgotten or taken for granted. In this study, a series of interviews with teachers was carried out - both with Brazilian teachers of the public sector (basic education) and language institutes (private English courses) as well as teacher trainers (university professors), in order to verify if the teachers were prepared to work with informatics in teaching practices, and check the professionals’ views on the subject. The ideas of Maingueneau and Marcuschi about textual genres are a theoretical base in this work, besides the concept of cognitive economy. The text and its typology are focused here as the basic material for teaching English, through digital technologies and hypermedia. The study is also based on Sharma and Barrett’s notion of blended learning as a balanced combination of technological resources and traditional practices in the classroom. Thus, this is an attempt to investigate the relevance of
Zhou, Jie E.; Yan, Yongke; Priya, Shashank; Wang, Yu U.
2017-01-01
Quantitative relationships between processing, microstructure, and properties in textured ferroelectric polycrystals and the underlying responsible mechanisms are investigated by phase field modeling and computer simulation. This study focuses on three important aspects of textured ferroelectric ceramics: (i) grain microstructure evolution during templated grain growth processing, (ii) crystallographic texture development as a function of volume fraction and seed size of the templates, and (iii) dielectric and piezoelectric properties of the obtained template-matrix composites of textured polycrystals. Findings on the third aspect are presented here, while an accompanying paper of this work reports findings on the first two aspects. In this paper, the competing effects of crystallographic texture and template seed volume fraction on the dielectric and piezoelectric properties of ferroelectric polycrystals are investigated. The phase field model of ferroelectric composites consisting of template seeds embedded in matrix grains is developed to simulate domain evolution, polarization-electric field (P-E), and strain-electric field (ɛ-E) hysteresis loops. The coercive field, remnant polarization, dielectric permittivity, piezoelectric coefficient, and dissipation factor are studied as a function of grain texture and template seed volume fraction. It is found that, while crystallographic texture significantly improves the polycrystal properties towards those of single crystals, a higher volume fraction of template seeds tends to decrease the electromechanical properties, thus canceling the advantage of ferroelectric polycrystals textured by templated grain growth processing. This competing detrimental effect is shown to arise from the composite effect, where the template phase possesses material properties inferior to the matrix phase, causing mechanical clamping and charge accumulation at inter-phase interfaces between matrix and template inclusions. The computational
Computer-Based English Language Testing in China: Present and Future
Yu, Guoxing; Zhang, Jing
2017-01-01
In this special issue on high-stakes English language testing in China, the two articles on computer-based testing (Jin & Yan; He & Min) highlight a number of consistent, ongoing challenges and concerns in the development and implementation of the nationwide IB-CET (Internet Based College English Test) and institutional computer-adaptive…
English Language Learners' Strategies for Reading Computer-Based Texts at Home and in School
Park, Ho-Ryong; Kim, Deoksoon
2016-01-01
This study investigated four elementary-level English language learners' (ELLs') use of strategies for reading computer-based texts at home and in school. The ELLs in this study were in the fourth and fifth grades in a public elementary school. We identify the ELLs' strategies for reading computer-based texts in home and school environments. We…
A Functional Specification for a Programming Language for Computer Aided Learning Applications.
National Research Council of Canada, Ottawa (Ontario).
In 1972 there were at least six different course authoring languages in use in Canada with little exchange of course materials between Computer Assisted Learning (CAL) centers. In order to improve facilities for producing "transportable" computer based course materials, a working panel undertook the definition of functional requirements of a user…
Introduction to the Atari Computer. A Program Written in the Pilot Programming Language.
Schlenker, Richard M.
Designed to be an introduction to the Atari microcomputers for beginners, the interactive computer program listed in this document is written in the Pilot programing language. Instructions are given for entering and storing the program in the computer memory for use by students. (MES)
New computational method for non-LTE, the linear response matrix
International Nuclear Information System (INIS)
Fournier, K.B.; Grasiani, F.R.; Harte, J.A.; Libby, S.B.; More, R.M.; Zimmerman, G.B.
1998-01-01
My coauthors have done extensive theoretical and computational calculations that lay the ground work for a linear response matrix method to calculate non-LTE (local thermodynamic equilibrium) opacities. I will give briefly review some of their work and list references. Then I will describe what has been done to utilize this theory to create a computational package to rapidly calculate mild non-LTE emission and absorption opacities suitable for use in hydrodynamic calculations. The opacities are obtained by performing table look-ups on data that has been generated with a non-LTE package. This scheme is currently under development. We can see that it offers a significant computational speed advantage. It is suitable for mild non-LTE, quasi-steady conditions. And it offers a new insertion path for high-quality non-LTE data. Currently, the linear response matrix data file is created using XSN. These data files could be generated by more detailed and rigorous calculations without changing any part of the implementation in the hydro code. The scheme is running in Lasnex and is being tested and developed
Computer-Assisted Instruction: Authoring Languages. ERIC Digest.
Reeves, Thomas C.
One of the most perplexing tasks in producing computer-assisted instruction (CAI) is the authoring process. Authoring is generally defined as the process of turning the flowcharts, control algorithms, format sheets, and other documentation of a CAI program's design into computer code that will operationalize the simulation on the delivery system.…
Umstead, Lyubov
2013-01-01
The number of English Language Learners (ELLs) is rapidly growing. Teachers continue facing challenges in providing effective content instruction to ELLs while helping them learn English. New and improved approaches are necessary to meet the individual learning needs of this diverse group of students and help them progress academically while…
Sevilla-Pavón, Ana
2015-01-01
The internationalisation of the Portuguese language has become a priority for academic institutions of different Portuguese-speaking countries which are trying to adapt to the current context of globalisation and ubiquitous communications through digital media. In order to achieve it, several challenges should be faced, namely providing…
Monaghan, Padraic; Rowland, Caroline F.
2017-01-01
Historically, first language acquisition research was a painstaking process of observation, requiring the laborious hand coding of children's linguistic productions, followed by the generation of abstract theoretical proposals for how the developmental process unfolds. Recently, the ability to collect large-scale corpora of children's language…
Engelberg, N.; Shaw, C., III
1984-01-01
The design of a uniform command language to be used in a local area network of heterogeneous, autonomous nodes is considered. After examining the major characteristics of such a network, and after considering the profile of a scientist using the computers on the net as an investigative aid, a set of reasonable requirements for the command language are derived. Taking into account the possible inefficiencies in implementing a guest-layered network operating system and command language on a heterogeneous net, the authors examine command language naming, process/procedure invocation, parameter acquisition, help and response facilities, and other features found in single-node command languages, and conclude that some features may extend simply to the network case, others extend after some restrictions are imposed, and still others require modifications. In addition, it is noted that some requirements considered reasonable (user accounting reports, for example) demand further study before they can be efficiently implemented on a network of the sort described.
Chan, Garnet Kin-Lic; Keselman, Anna; Nakatani, Naoki; Li, Zhendong; White, Steven R.
2016-07-01
Current descriptions of the ab initio density matrix renormalization group (DMRG) algorithm use two superficially different languages: an older language of the renormalization group and renormalized operators, and a more recent language of matrix product states and matrix product operators. The same algorithm can appear dramatically different when written in the two different vocabularies. In this work, we carefully describe the translation between the two languages in several contexts. First, we describe how to efficiently implement the ab initio DMRG sweep using a matrix product operator based code, and the equivalence to the original renormalized operator implementation. Next we describe how to implement the general matrix product operator/matrix product state algebra within a pure renormalized operator-based DMRG code. Finally, we discuss two improvements of the ab initio DMRG sweep algorithm motivated by matrix product operator language: Hamiltonian compression, and a sum over operators representation that allows for perfect computational parallelism. The connections and correspondences described here serve to link the future developments with the past and are important in the efficient implementation of continuing advances in ab initio DMRG and related algorithms.
International Nuclear Information System (INIS)
Vecharynski, Eugene; Yang, Chao; Pask, John E.
2015-01-01
We present an iterative algorithm for computing an invariant subspace associated with the algebraically smallest eigenvalues of a large sparse or structured Hermitian matrix A. We are interested in the case in which the dimension of the invariant subspace is large (e.g., over several hundreds or thousands) even though it may still be small relative to the dimension of A. These problems arise from, for example, density functional theory (DFT) based electronic structure calculations for complex materials. The key feature of our algorithm is that it performs fewer Rayleigh–Ritz calculations compared to existing algorithms such as the locally optimal block preconditioned conjugate gradient or the Davidson algorithm. It is a block algorithm, and hence can take advantage of efficient BLAS3 operations and be implemented with multiple levels of concurrency. We discuss a number of practical issues that must be addressed in order to implement the algorithm efficiently on a high performance computer
Programming language for computations in the Interkosmos program
Schmidt, K.
1975-01-01
The programming system for Intercosmos data processing, based on the structural programming theory, which considers a program as an ordered set of standardized elementary parts, from which the user programs are automatically generated, is described. The programs are comprised of several modules, which are briefly summarized. The general structure of the programming system is presented in a block diagram. A programming control language developed to formulate the problem quickly and completely is presented along with basic symbols which are characteristic of the Intercosmos programming system.
Development of a KSC test and flight engineering oriented computer language, Phase 1
Case, C. W.; Kinney, E. L.; Gyure, J.
1970-01-01
Ten, primarily test oriented, computer languages reviewed during the phase 1 study effort are described. Fifty characteristics of ATOLL, ATLAS, and CLASP are compared. Unique characteristics of the other languages, including deficiencies, problems, safeguards, and checking provisions are identified. Programming aids related to these languages are reported, and the conclusions resulting from this phase of the study are discussed. A glossary and bibliography are included. For the reports on phase 2 of the study, see N71-35027 and N71-35029.
Fast Tree: Computing Large Minimum-Evolution Trees with Profiles instead of a Distance Matrix
Energy Technology Data Exchange (ETDEWEB)
N. Price, Morgan; S. Dehal, Paramvir; P. Arkin, Adam
2009-07-31
Gene families are growing rapidly, but standard methods for inferring phylogenies do not scale to alignments with over 10,000 sequences. We present FastTree, a method for constructing large phylogenies and for estimating their reliability. Instead of storing a distance matrix, FastTree stores sequence profiles of internal nodes in the tree. FastTree uses these profiles to implement neighbor-joining and uses heuristics to quickly identify candidate joins. FastTree then uses nearest-neighbor interchanges to reduce the length of the tree. For an alignment with N sequences, L sites, and a different characters, a distance matrix requires O(N^2) space and O(N^2 L) time, but FastTree requires just O( NLa + N sqrt(N) ) memory and O( N sqrt(N) log(N) L a ) time. To estimate the tree's reliability, FastTree uses local bootstrapping, which gives another 100-fold speedup over a distance matrix. For example, FastTree computed a tree and support values for 158,022 distinct 16S ribosomal RNAs in 17 hours and 2.4 gigabytes of memory. Just computing pairwise Jukes-Cantor distances and storing them, without inferring a tree or bootstrapping, would require 17 hours and 50 gigabytes of memory. In simulations, FastTree was slightly more accurate than neighbor joining, BIONJ, or FastME; on genuine alignments, FastTree's topologies had higher likelihoods. FastTree is available at http://microbesonline.org/fasttree.
Computational Modeling for Language Acquisition: A Tutorial With Syntactic Islands.
Pearl, Lisa S; Sprouse, Jon
2015-06-01
Given the growing prominence of computational modeling in the acquisition research community, we present a tutorial on how to use computational modeling to investigate learning strategies that underlie the acquisition process. This is useful for understanding both typical and atypical linguistic development. We provide a general overview of why modeling can be a particularly informative tool and some general considerations when creating a computational acquisition model. We then review a concrete example of a computational acquisition model for complex structural knowledge referred to as syntactic islands. This includes an overview of syntactic islands knowledge, a precise definition of the acquisition task being modeled, the modeling results, and how to meaningfully interpret those results in a way that is relevant for questions about knowledge representation and the learning process. Computational modeling is a powerful tool that can be used to understand linguistic development. The general approach presented here can be used to investigate any acquisition task and any learning strategy, provided both are precisely defined.
The Potential of Incorporating Computer Games in Foreign Language Curricula
Mukundan, Jayakaran; Kalajahi, Seyed Ali Rezvani; Naghdipour, Bakhtiar
2014-01-01
There is ample evidence that technology-enhanced instruction could result in students' learning. With the advancement and ever-increasing growth of technology, the use of educational electronic games or computer games in education has appealed to both educators and students. Because of their potential to enhance students' interest, motivation and…
Language Learners & Computer Games: From "Space Invaders" to "Second Life"
Stanley, Graham; Mawer, Kyle
2008-01-01
The term serious game is often used to refer to "games used for training, advertising, simulation, or education." In this article, the authors use the term computer game in its broadest sense, believing it to encompass the broad spectrum of what is usually referred to now as all digital gaming (video games, console games, online games, etc.). They…
Cooperative Learning with a Computer in a Native Language Class.
Bennett, Ruth
In a cooperative task, American Indian elementary students produced bilingual natural history dictionaries using a Macintosh computer. Students in grades 3 through 8 attended weekly, multi-graded bilingual classes in Hupa/English or Yurok/English, held at two public school field sites for training elementary teaching-credential candidates. Teams…
Predicting Lexical Proficiency in Language Learner Texts Using Computational Indices
Crossley, Scott A.; Salsbury, Tom; McNamara, Danielle S.; Jarvis, Scott
2011-01-01
The authors present a model of lexical proficiency based on lexical indices related to vocabulary size, depth of lexical knowledge, and accessibility to core lexical items. The lexical indices used in this study come from the computational tool Coh-Metrix and include word length scores, lexical diversity values, word frequency counts, hypernymy…
A user's manual of Tools for Error Estimation of Complex Number Matrix Computation (Ver.1.0)
International Nuclear Information System (INIS)
Ichihara, Kiyoshi.
1997-03-01
'Tools for Error Estimation of Complex Number Matrix Computation' is a subroutine library which aids the users in obtaining the error ranges of the complex number linear system's solutions or the Hermitian matrices' eigen values. This library contains routines for both sequential computers and parallel computers. The subroutines for linear system error estimation calulate norms of residual vectors, matrices's condition numbers, error bounds of solutions and so on. The error estimation subroutines for Hermitian matrix eigen values' derive the error ranges of the eigen values according to the Korn-Kato's formula. This user's manual contains a brief mathematical background of error analysis on linear algebra and usage of the subroutines. (author)
International Nuclear Information System (INIS)
Kussmann, Jörg; Luenser, Arne; Beer, Matthias; Ochsenfeld, Christian
2015-01-01
An analytical method to calculate the molecular vibrational Hessian matrix at the self-consistent field level is presented. By analysis of the multipole expansions of the relevant derivatives of Coulomb-type two-electron integral contractions, we show that the effect of the perturbation on the electronic structure due to the displacement of nuclei decays at least as r −2 instead of r −1 . The perturbation is asymptotically local, and the computation of the Hessian matrix can, in principle, be performed with O(N) complexity. Our implementation exhibits linear scaling in all time-determining steps, with some rapid but quadratic-complexity steps remaining. Sample calculations illustrate linear or near-linear scaling in the construction of the complete nuclear Hessian matrix for sparse systems. For more demanding systems, scaling is still considerably sub-quadratic to quadratic, depending on the density of the underlying electronic structure
User interfaces for computational science: A domain specific language for OOMMF embedded in Python
Beg, Marijan; Pepper, Ryan A.; Fangohr, Hans
2017-05-01
Computer simulations are used widely across the engineering and science disciplines, including in the research and development of magnetic devices using computational micromagnetics. In this work, we identify and review different approaches to configuring simulation runs: (i) the re-compilation of source code, (ii) the use of configuration files, (iii) the graphical user interface, and (iv) embedding the simulation specification in an existing programming language to express the computational problem. We identify the advantages and disadvantages of different approaches and discuss their implications on effectiveness and reproducibility of computational studies and results. Following on from this, we design and describe a domain specific language for micromagnetics that is embedded in the Python language, and allows users to define the micromagnetic simulations they want to carry out in a flexible way. We have implemented this micromagnetic simulation description language together with a computational backend that executes the simulation task using the Object Oriented MicroMagnetic Framework (OOMMF). We illustrate the use of this Python interface for OOMMF by solving the micromagnetic standard problem 4. All the code is publicly available and is open source.
User interfaces for computational science: A domain specific language for OOMMF embedded in Python
Directory of Open Access Journals (Sweden)
Marijan Beg
2017-05-01
Full Text Available Computer simulations are used widely across the engineering and science disciplines, including in the research and development of magnetic devices using computational micromagnetics. In this work, we identify and review different approaches to configuring simulation runs: (i the re-compilation of source code, (ii the use of configuration files, (iii the graphical user interface, and (iv embedding the simulation specification in an existing programming language to express the computational problem. We identify the advantages and disadvantages of different approaches and discuss their implications on effectiveness and reproducibility of computational studies and results. Following on from this, we design and describe a domain specific language for micromagnetics that is embedded in the Python language, and allows users to define the micromagnetic simulations they want to carry out in a flexible way. We have implemented this micromagnetic simulation description language together with a computational backend that executes the simulation task using the Object Oriented MicroMagnetic Framework (OOMMF. We illustrate the use of this Python interface for OOMMF by solving the micromagnetic standard problem 4. All the code is publicly available and is open source.
Colmayer, Ciro
1991-01-01
Attempts to show that the use of computers in the classroom should not be limited to the teaching of math but that the language classroom is an even more appropriate place for the introduction and use of computers. (CFM)
Fast GPU-based computation of the sensitivity matrix for a PET list-mode OSEM algorithm
Energy Technology Data Exchange (ETDEWEB)
Nassiri, Moulay Ali; Carrier, Jean-Francois [Montreal Univ., QC (Canada). Dept. de Radio-Oncologie; Hissoiny, Sami [Ecole Polytechnique de Montreal, QC (Canada). Dept. de Genie Informatique et Genie Logiciel; Despres, Philippe [Quebec Univ. (Canada). Dept. de Radio-Oncologie
2011-07-01
One of the obstacle in introducing a list-mode PET reconstruction algorithm for routine clinical use is the long computation time required for the sensitivity matrix calculation. This matrix must be computed for each study because it depends on the object attenuation map. During the last decade, studies have shown that 3D list-mode OSEM reconstruction algorithms could be effectively performed and considerably accelerated by GPU devices. However, most of that preliminary work (1) was done for pre-clinical PET systems in which the number of LORs is small compared to modern human PET systems and (2) supposed that the sensitivity matrix is pre-calculated. The time required to compute this matrix can however be longer than the reconstruction time itself. The objective of this work is to investigate the performance of sensitivity matrix calculations in terms of computation time with modern GPUs, for clinical fully 3D LM-OSEM for modern PET scanners. For this purpose, sensitivity matrix calculations and full list-mode OSEM reconstruction for human PET systems were implemented on GPUs using the CUDA framework. The system matrices were built on-the-fly by using the multi-ray Siddon algorithm. The time to compute the sensitivity matrix for 288 x 288 x 57 arrays using 3 tangential LORs was 29 seconds. The 3D LM-OSEM algorithm, including the sensitivity matrix calculation, was performed for the same LORs in 71 seconds for 62 millions events, 6 frames and 1 iterations. This work let envision fast reconstructions for advanced PET application such as dynamic studies and parametric image reconstruction. (orig.)
A formal approach to the analysis of clinical computer-interpretable guideline modeling languages.
Grando, M Adela; Glasspool, David; Fox, John
2012-01-01
To develop proof strategies to formally study the expressiveness of workflow-based languages, and to investigate their applicability to clinical computer-interpretable guideline (CIG) modeling languages. We propose two strategies for studying the expressiveness of workflow-based languages based on a standard set of workflow patterns expressed as Petri nets (PNs) and notions of congruence and bisimilarity from process calculus. Proof that a PN-based pattern P can be expressed in a language L can be carried out semi-automatically. Proof that a language L cannot provide the behavior specified by a PNP requires proof by exhaustion based on analysis of cases and cannot be performed automatically. The proof strategies are generic but we exemplify their use with a particular CIG modeling language, PROforma. To illustrate the method we evaluate the expressiveness of PROforma against three standard workflow patterns and compare our results with a previous similar but informal comparison. We show that the two proof strategies are effective in evaluating a CIG modeling language against standard workflow patterns. We find that using the proposed formal techniques we obtain different results to a comparable previously published but less formal study. We discuss the utility of these analyses as the basis for principled extensions to CIG modeling languages. Additionally we explain how the same proof strategies can be reused to prove the satisfaction of patterns expressed in the declarative language CIGDec. The proof strategies we propose are useful tools for analysing the expressiveness of CIG modeling languages. This study provides good evidence of the benefits of applying formal methods of proof over semi-formal ones. Copyright © 2011 Elsevier B.V. All rights reserved.
DEFF Research Database (Denmark)
Sanden, Guro Refsum
2016-01-01
Purpose: – The purpose of this paper is to analyse the consequences of globalisation in the area of corporate communication, and investigate how language may be managed as a strategic resource. Design/methodology/approach: – A review of previous studies on the effects of globalisation on corporate...... communication and the implications of language management initiatives in international business. Findings: – Efficient language management can turn language into a strategic resource. Language needs analyses, i.e. linguistic auditing/language check-ups, can be used to determine the language situation...... of a company. Language policies and/or strategies can be used to regulate a company’s internal modes of communication. Language management tools can be deployed to address existing and expected language needs. Continuous feedback from the front line ensures strategic learning and reduces the risk of suboptimal...
Learning Analytics: The next frontier for computer assisted language learning in big data age
Directory of Open Access Journals (Sweden)
Yu Qinglan
2015-01-01
Full Text Available Learning analytics (LA has been applied to various learning environments, though it is quite new in the field of computer assisted language learning (CALL. This article attempts to examine the application of learning analytics in the upcoming big data age. It starts with an introduction and application of learning analytics in other fields, followed by a retrospective review of historical interaction between learning and media in CALL, and a penetrating analysis on why people would go to learning analytics to increase the efficiency of foreign language education. As approved in previous research, new technology, including big data mining and analysis, would inevitably enhance the learning of foreign languages. Potential changes that learning analytics would bring to Chinese foreign language education and researches are also presented in the article.
International Nuclear Information System (INIS)
Boyle, W.G. Jr.
1977-01-01
These instructions describe how to use three BASIC language programs to process data from atomic absorption spectrophotometers operated in the flame mode. These programs will also control an automatic sampler if desired. The instructions cover loading the programs, responding to computer prompts, choosing among various options for processing the data, operating the automatic sampler, and producing reports. How the programs differ is also explained. Examples of computer/operator dialogue are presented for typical cases
International Nuclear Information System (INIS)
Lopes, Antonio Augusto; Miranda, Rogerio dos Anjos; Goncalves, Rilvani Cavalcante; Thomaz, Ana Maria
2009-01-01
In patients with congenital heart disease undergoing cardiac catheterization for hemodynamic purposes, parameter estimation by the indirect Fick method using a single predicted value of oxygen consumption has been a matter of criticism. We developed a computer-based routine for rapid estimation of replicate hemodynamic parameters using multiple predicted values of oxygen consumption. Using Microsoft Excel facilities, we constructed a matrix containing 5 models (equations) for prediction of oxygen consumption, and all additional formulas needed to obtain replicate estimates of hemodynamic parameters. By entering data from 65 patients with ventricular septal defects, aged 1 month to 8 years, it was possible to obtain multiple predictions for oxygen consumption, with clear between-age groups ( P <.001) and between-methods ( P <.001) differences. Using these predictions in the individual patient, it was possible to obtain the upper and lower limits of a likely range for any given parameter, which made estimation more realistic. The organized matrix allows for rapid obtainment of replicate parameter estimates, without error due to exhaustive calculations. (author)
Teaching Computer Languages and Elementary Theory for Mixed Audiences at University Level
DEFF Research Database (Denmark)
Christiansen, Henning
2004-01-01
Theoretical issues of computer science are traditionally taught in a way that presupposes a solid mathematical background and are usually considered more or less unaccessible for students without this. An effective methodology is described which has been developed for a target group of university...... into a learning-by-doing approach having the students to develop such descriptions themselves from an informal introduction....... students with different backgrounds such as natural science or humanities. It has been developed for a course that integrates theoretical material on computer languages and abstract machines with practical programming techniques. Prolog used as meta-language for describing language issues is the central...... instrument in the approach: Formal descriptions become running prototypes that are easy and appealing to test and modify, and can be extended into analyzers, interpreters, and tools such as tracers and debuggers. Experience shows a high learning curve, especially when the principles are extended...
The discrete hungry Lotka Volterra system and a new algorithm for computing matrix eigenvalues
Fukuda, Akiko; Ishiwata, Emiko; Iwasaki, Masashi; Nakamura, Yoshimasa
2009-01-01
The discrete hungry Lotka-Volterra (dhLV) system is a generalization of the discrete Lotka-Volterra (dLV) system which stands for a prey-predator model in mathematical biology. In this paper, we show that (1) some invariants exist which are expressed by dhLV variables and are independent from the discrete time and (2) a dhLV variable converges to some positive constant or zero as the discrete time becomes sufficiently large. Some characteristic polynomial is then factorized with the help of the dhLV system. The asymptotic behaviour of the dhLV system enables us to design an algorithm for computing complex eigenvalues of a certain band matrix.
International Nuclear Information System (INIS)
Zou, C.; Li, B.; Zhang, C.; Wang, S.; Marrow, T.J.; Reinhard, C.
2016-01-01
The pore structure and porosity of a continuous fiber reinforced ceramic matrix composite has been characterized using high-resolution synchrotron X-ray computed tomography (XCT). Segmentation of the reconstructed tomograph images reveals different types of pores within the composite, the inter-fiber bundle open pores displaying a 'node-bond' geometry, and the intra-fiber bundle isolated micropores showing a piping shape. The 3D morphology of the pores is resolved and each pore is labeled. The quantitative filtering of the pores measures a total porosity 8.9% for the composite, amid which there is about 7.1∼ 9.3% closed micropores
The discrete hungry Lotka–Volterra system and a new algorithm for computing matrix eigenvalues
International Nuclear Information System (INIS)
Fukuda, Akiko; Ishiwata, Emiko; Iwasaki, Masashi; Nakamura, Yoshimasa
2009-01-01
The discrete hungry Lotka–Volterra (dhLV) system is a generalization of the discrete Lotka–Volterra (dLV) system which stands for a prey–predator model in mathematical biology. In this paper, we show that (1) some invariants exist which are expressed by dhLV variables and are independent from the discrete time and (2) a dhLV variable converges to some positive constant or zero as the discrete time becomes sufficiently large. Some characteristic polynomial is then factorized with the help of the dhLV system. The asymptotic behaviour of the dhLV system enables us to design an algorithm for computing complex eigenvalues of a certain band matrix
· Attitude towards Computers and Classroom Management of Language School Teachers
Directory of Open Access Journals (Sweden)
Sara Jalali
2014-07-01
Full Text Available Computer-assisted language learning (CALL is the realization of computers in schools and universities which has potentially enhanced the language learning experience inside the classrooms. The integration of the technologies into the classroom demands that the teachers adopt a number of classroom management procedures to maintain a more learner-centered and conducive language learning environment. The current study explored the relationship between computer attitudes and behavior and instructional classroom management approaches implemented by English institute teachers. In so doing, a total of 105 male (n = 27 and female (n = 78 EFL teachers participated in this study. A computer attitude questionnaire adapted from Albirini (2006 and a Behavior and Instructional Management Scale (BIMS adopted from Martin and Sass (2010 were benefitted from for the purpose of collecting the data. The results of the Pearson Correlation Coefficient revealed that there were no significant relationships between attitude and behavior and instructional management across gender. However, it was found that the more male teachers experience tendency toward using computers in their classes, the more teacher-centered their classes become. In addition, the more female teachers are prone to use computers in their classes, the more student-centered and lenient their classes become.
Directory of Open Access Journals (Sweden)
Farah Jamal Abed Alrazeq Saeed
2018-01-01
Full Text Available The study aimed at investigating the attitudes of Jordanian undergraduate students towards using computer assisted -language learning (CALL and its effectiveness in the process of learning the English language. In order to fulfill the study’s objective, the researchers used a questionnaire to collect data, followed-up with semi-structured interviews to investigate the students’ beliefs towards CALL. Twenty- one of Jordanian BA students majoring in English language and literature were selected according to simple random sampling. The results revealed positive attitudes towards CALL in facilitating the process of writing assignments, gaining information; making learning enjoyable; improving their creativity, productivity, academic achievement, critical thinking skills, and enhancing their knowledge about vocabulary grammar, and culture. Furthermore, they believed that computers can motivate them to learn English language and help them to communicate and interact with their teachers and colleagues. The researchers recommended conducting a research on the same topic, taking into consideration the variables of age, gender, experience in using computers, and computer skills.
Chen, Yu-Hua; Bruncak, Radovan
2015-01-01
With the advances in technology, wordlists retrieved from computer corpora have become increasingly popular in recent years. The lexical items in those wordlists are usually selected, according to a set of robust frequency and dispersion criteria, from large corpora of authentic and naturally occurring language. Corpus wordlists are of great value…
Learning Vocabulary in a Foreign Language: A Computer Software Based Model Attempt
Yelbay Yilmaz, Yasemin
2015-01-01
This study aimed at devising a vocabulary learning software that would help learners learn and retain vocabulary items effectively. Foundation linguistics and learning theories have been adapted to the foreign language vocabulary learning context using a computer software named Parole that was designed exclusively for this study. Experimental…
Marek, Michael W.; Wu, Wen-Chi Vivian
2014-01-01
This conceptual, interdisciplinary inquiry explores Complex Dynamic Systems as the concept relates to the internal and external environmental factors affecting computer assisted language learning (CALL). Based on the results obtained by de Rosnay ["World Futures: The Journal of General Evolution", 67(4/5), 304-315 (2011)], who observed…
A Computer Assisted Method to Track Listening Strategies in Second Language Learning
Roussel, Stephanie
2011-01-01
Many studies about listening strategies are based on what learners report while listening to an oral message in the second language (Vandergrift, 2003; Graham, 2006). By recording a video of the computer screen while L2 learners (L1 French) were listening to an MP3-track in German, this study uses a novel approach and recent developments in…
Whole Language, Computers and CD-ROM Technology: A Kindergarten Unit on "Benjamin Bunny."
Balajthy, Ernest
A kindergarten teacher, two preservice teachers, and a college consultant on educational computer technology designed and developed a 10-day whole-language integrated unit on the theme of Beatrix Potter's "Benjamin Bunny." The project was designed as a demonstration of the potential of integrating the CD-ROM-based version of…
Zajenkowski, Marcin; Styla, Rafal; Szymanik, Jakub
2011-01-01
We compared the processing of natural language quantifiers in a group of patients with schizophrenia and a healthy control group. In both groups, the difficulty of the quantifiers was consistent with computational predictions, and patients with schizophrenia took more time to solve the problems. However, they were significantly less accurate only…
Kato, Fumie; Spring, Ryan; Mori, Chikako
2016-01-01
Providing learners of a foreign language with meaningful opportunities for interactions, specifically with native speakers, is especially challenging for instructors. One way to overcome this obstacle is through video-synchronous computer-mediated communication tools such as Skype software. This study reports quantitative and qualitative data from…
Using a Dialogue System Based on Dialogue Maps for Computer Assisted Second Language Learning
Choi, Sung-Kwon; Kwon, Oh-Woog; Kim, Young-Kil; Lee, Yunkeun
2016-01-01
In order to use dialogue systems for computer assisted second-language learning systems, one of the difficult issues in such systems is how to construct large-scale dialogue knowledge that matches the dialogue modelling of a dialogue system. This paper describes how we have accomplished the short-term construction of large-scale and…
Fard-Kashani, Alireza; Jahromi, Abdol Hossein Zahedi; Javadi, Ali; Fallahi, Ali Mohammad
2015-01-01
The current study aimed at diagnosing the language needs of Iranian undergraduate students of computer engineering in order to find out whether there is any significant difference in perceptions between the students and their ESAP (English for Specific Academic Purpose) teachers, concerning their Reading skill needs. To conduct the intended…
Lee, Cynthia; Yeung, Alexander Seeshing; Ip, Tiffany
2016-01-01
Computer technology provides spaces and locales for language learning. However, learning style preference and demographic variables may affect the effectiveness of technology use for a desired goal. Adapting Reid's pioneering Perceptual Learning Style Preference Questionnaire (PLSPQ), this study investigated the relations of university students'…
Bernard, Robert M.; Bethel, Edward Clement; Abrami, Philip C.; Wade, C. Anne
2007-01-01
This study examines the achievement outcomes accompanying the implementation of a Grade 3 laptop or so-called "ubiquitous computing" program in a Quebec school district. CAT3 reading, language, and mathematics batteries were administered at the end of Grade 2 and again at the end of Grade 3, after the first year of computer…
Ko, Chao-Jung
2012-01-01
This study investigated the possibility that initial-level learners may acquire oral skills through synchronous computer-mediated communication (SCMC). Twelve Taiwanese French as a foreign language (FFL) students, divided into three groups, were required to conduct a variety of tasks in one of the three learning environments (video/audio, audio,…
Hung, Y.-C.
2012-01-01
This paper investigates the impact of combining self explaining (SE) with computer architecture diagrams to help novice students learn assembly language programming. Pre- and post-test scores for the experimental and control groups were compared and subjected to covariance (ANCOVA) statistical analysis. Results indicate that the SE-plus-diagram…
Lee, Nancy
2013-01-01
The current study explored the differential effects of two learning strategies, self-explanation and reading questions and answers, on students' test performance in the computer programming language JavaScript. Students' perceptions toward the two strategies as to their effectiveness in learning JavaScript was also explored by examining students'…
Programming Languages or Generic Software Tools, for Beginners' Courses in Computer Literacy?
Neuwirth, Erich
1987-01-01
Discussion of methods that can be used to teach beginner courses in computer literacy focuses on students aged 10-12. The value of using a programing language versus using a generic software package is highlighted; Logo and Prolog are reviewed; and the use of databases is discussed. (LRW)
Golomidov, Y. V.; Li, S. K.; Popov, S. A.; Smolov, V. B.
1986-01-01
After a classification and analysis of electronic and optoelectronic switching devices, the design principles and structure of a matrix optical switch is described. The switching and pair-exclusion operations in this type of switch are examined, and a method for the optical switching of communication channels is elaborated. Finally, attention is given to the structural organization of a parallel computer system with a matrix optical switch.
Burtyka, Filipp
2018-01-01
The paper considers algorithms for finding diagonalizable and non-diagonalizable roots (so called solvents) of monic arbitrary unilateral second-order matrix polynomial over prime finite field. These algorithms are based on polynomial matrices (lambda-matrices). This is an extension of existing general methods for computing solvents of matrix polynomials over field of complex numbers. We analyze how techniques for complex numbers can be adapted for finite field and estimate asymptotic complexity of the obtained algorithms.
Samani, Ebrahim; Baki, Roselan; Razali, Abu Bakar
2014-01-01
Success in implementation of computer-assisted language learning (CALL) programs depends on the teachers' understanding of the roles of CALL programs in education. Consequently, it is also important to understand the barriers teachers face in the use of computer-assisted language learning (CALL) programs. The current study was conducted on 14…
Wu, Pin-hsiang Natalie; Kawamura, Michelle
2014-01-01
With a growing demand for learning English and a trend of utilizing computers in education, methods that can achieve the effectiveness of computer-mediated communication (CMC) to support language learning in higher education have been examined. However, second language factors manipulate both the process and production of CMC and, therefore,…
Balajthy, Ernest
Intended for reading and language arts teachers at all educational levels, this guide presents information to be used by teachers in constructing their own computer assisted educational software using the BASIC programming language and Apple computers. Part 1 provides an overview of the components of traditional tutorial and drill-and-practice…
Energy Technology Data Exchange (ETDEWEB)
Mazlack, L.J.; Paz, N.M.
1983-01-01
Newspaper cartoons can graphically display the result of ambiguity in human speech; the result can be unexpected and funny. Likewise, computer analysis of natural language statements also needs to successfully resolve ambiguous situations. Computer techniques already developed use restricted world knowledge in resolving ambiguous language use. This paper illustrates how these techniques can be used in resolving ambiguous situations arising in cartoons. 8 references.
International Nuclear Information System (INIS)
Larson, N.M.; Perey, F.G.
1980-11-01
A method is described for determining the parameters of a model from experimental data based upon the utilization of Bayes' theorem. This method has several advantages over the least-squares method as it is commonly used; one important advantage is that the assumptions under which the parameter values have been determined are more clearly evident than in many results based upon least squares. Bayes' method has been used to develop a computer code which can be utilized to analyze neutron cross-section data by means of the R-matrix theory. The required formulae from the R-matrix theory are presented, and the computer implementation of both Bayes' equations and R-matrix theory is described. Details about the computer code and compelte input/output information are given
Proceedings of the workshop on Compilation of (Symbolic) Languages for Parallel Computers
Energy Technology Data Exchange (ETDEWEB)
Foster, I.; Tick, E. (comp.)
1991-11-01
This report comprises the abstracts and papers for the talks presented at the Workshop on Compilation of (Symbolic) Languages for Parallel Computers, held October 31--November 1, 1991, in San Diego. These unreferred contributions were provided by the participants for the purpose of this workshop; many of them will be published elsewhere in peer-reviewed conferences and publications. Our goal is planning this workshop was to bring together researchers from different disciplines with common problems in compilation. In particular, we wished to encourage interaction between researchers working in compilation of symbolic languages and those working on compilation of conventional, imperative languages. The fundamental problems facing researchers interested in compilation of logic, functional, and procedural programming languages for parallel computers are essentially the same. However, differences in the basic programming paradigms have led to different communities emphasizing different species of the parallel compilation problem. For example, parallel logic and functional languages provide dataflow-like formalisms in which control dependencies are unimportant. Hence, a major focus of research in compilation has been on techniques that try to infer when sequential control flow can safely be imposed. Granularity analysis for scheduling is a related problem. The single- assignment property leads to a need for analysis of memory use in order to detect opportunities for reuse. Much of the work in each of these areas relies on the use of abstract interpretation techniques.
Brain-computer interface with language model-electroencephalography fusion for locked-in syndrome.
Oken, Barry S; Orhan, Umut; Roark, Brian; Erdogmus, Deniz; Fowler, Andrew; Mooney, Aimee; Peters, Betts; Miller, Meghan; Fried-Oken, Melanie B
2014-05-01
Some noninvasive brain-computer interface (BCI) systems are currently available for locked-in syndrome (LIS) but none have incorporated a statistical language model during text generation. To begin to address the communication needs of individuals with LIS using a noninvasive BCI that involves rapid serial visual presentation (RSVP) of symbols and a unique classifier with electroencephalography (EEG) and language model fusion. The RSVP Keyboard was developed with several unique features. Individual letters are presented at 2.5 per second. Computer classification of letters as targets or nontargets based on EEG is performed using machine learning that incorporates a language model for letter prediction via Bayesian fusion enabling targets to be presented only 1 to 4 times. Nine participants with LIS and 9 healthy controls were enrolled. After screening, subjects first calibrated the system, and then completed a series of balanced word generation mastery tasks that were designed with 5 incremental levels of difficulty, which increased by selecting phrases for which the utility of the language model decreased naturally. Six participants with LIS and 9 controls completed the experiment. All LIS participants successfully mastered spelling at level 1 and one subject achieved level 5. Six of 9 control participants achieved level 5. Individuals who have incomplete LIS may benefit from an EEG-based BCI system, which relies on EEG classification and a statistical language model. Steps to further improve the system are discussed.
Efficient Support for Matrix Computations on Heterogeneous Multi-core and Multi-GPU Architectures
Energy Technology Data Exchange (ETDEWEB)
Dong, Fengguang [Univ. of Tennessee, Knoxville, TN (United States); Tomov, Stanimire [Univ. of Tennessee, Knoxville, TN (United States); Dongarra, Jack [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
2011-06-01
We present a new methodology for utilizing all CPU cores and all GPUs on a heterogeneous multicore and multi-GPU system to support matrix computations e ciently. Our approach is able to achieve the objectives of a high degree of parallelism, minimized synchronization, minimized communication, and load balancing. Our main idea is to treat the heterogeneous system as a distributed-memory machine, and to use a heterogeneous 1-D block cyclic distribution to allocate data to the host system and GPUs to minimize communication. We have designed heterogeneous algorithms with two di erent tile sizes (one for CPU cores and the other for GPUs) to cope with processor heterogeneity. We propose an auto-tuning method to determine the best tile sizes to attain both high performance and load balancing. We have also implemented a new runtime system and applied it to the Cholesky and QR factorizations. Our experiments on a compute node with two Intel Westmere hexa-core CPUs and three Nvidia Fermi GPUs demonstrate good weak scalability, strong scalability, load balance, and e ciency of our approach.
International Nuclear Information System (INIS)
Ablinger, J.; Schneider, C.; Manteuffel, A. von
2015-09-01
Three loop ladder and V-topology diagrams contributing to the massive operator matrix element A Qg are calculated. The corresponding objects can all be expressed in terms of nested sums and recurrences depending on the Mellin variable N and the dimensional parameter ε. Given these representations, the desired Laurent series expansions in ε can be obtained with the help of our computer algebra toolbox. Here we rely on generalized hypergeometric functions and Mellin-Barnes representations, on difference ring algorithms for symbolic summation, on an optimized version of the multivariate Almkvist-Zeilberger algorithm for symbolic integration, and on new methods to calculate Laurent series solutions of coupled systems of differential equations. The solutions can be computed for general coefficient matrices directly for any basis also performing the expansion in the dimensional parameter in case it is expressible in terms of indefinite nested product-sum expressions. This structural result is based on new results of our difference ring theory. In the cases discussed we deal with iterative sum- and integral-solutions over general alphabets. The final results are expressed in terms of special sums, forming quasi-shuffle algebras, such as nested harmonic sums, generalized harmonic sums, and nested binomially weighted (cyclotomic) sums. Analytic continuations to complex values of N are possible through the recursion relations obeyed by these quantities and their analytic asymptotic expansions. The latter lead to a host of new constants beyond the multiple zeta values, the infinite generalized harmonic and cyclotomic sums in the case of V-topologies.
Ablinger, J.; Behring, A.; Blümlein, J.; De Freitas, A.; von Manteuffel, A.; Schneider, C.
2016-05-01
Three loop ladder and V-topology diagrams contributing to the massive operator matrix element AQg are calculated. The corresponding objects can all be expressed in terms of nested sums and recurrences depending on the Mellin variable N and the dimensional parameter ε. Given these representations, the desired Laurent series expansions in ε can be obtained with the help of our computer algebra toolbox. Here we rely on generalized hypergeometric functions and Mellin-Barnes representations, on difference ring algorithms for symbolic summation, on an optimized version of the multivariate Almkvist-Zeilberger algorithm for symbolic integration, and on new methods to calculate Laurent series solutions of coupled systems of differential equations. The solutions can be computed for general coefficient matrices directly for any basis also performing the expansion in the dimensional parameter in case it is expressible in terms of indefinite nested product-sum expressions. This structural result is based on new results of our difference ring theory. In the cases discussed we deal with iterative sum- and integral-solutions over general alphabets. The final results are expressed in terms of special sums, forming quasi-shuffle algebras, such as nested harmonic sums, generalized harmonic sums, and nested binomially weighted (cyclotomic) sums. Analytic continuations to complex values of N are possible through the recursion relations obeyed by these quantities and their analytic asymptotic expansions. The latter lead to a host of new constants beyond the multiple zeta values, the infinite generalized harmonic and cyclotomic sums in the case of V-topologies.
Efficient computation of the inverse of gametic relationship matrix for a marked QTL
Directory of Open Access Journals (Sweden)
Iwaisaki Hiroaki
2006-04-01
Full Text Available Abstract Best linear unbiased prediction of genetic merits for a marked quantitative trait locus (QTL using mixed model methodology includes the inverse of conditional gametic relationship matrix (G-1 for a marked QTL. When accounting for inbreeding, the conditional gametic relationships between two parents of individuals for a marked QTL are necessary to build G-1 directly. Up to now, the tabular method and its adaptations have been used to compute these relationships. In the present paper, an indirect method was implemented at the gametic level to compute these few relationships. Simulation results showed that the indirect method can perform faster with significantly less storage requirements than adaptation of the tabular method. The efficiency of the indirect method was mainly due to the use of the sparseness of G-1. The indirect method can also be applied to construct an approximate G-1 for populations with incomplete marker data, providing approximate probabilities of descent for QTL alleles for individuals with incomplete marker data.
International Nuclear Information System (INIS)
Yamada, Susumu; Igarashi, Ryo; Machida, Masahiko; Imamura, Toshiyuki; Okumura, Masahiko; Onishi, Hiroaki
2010-01-01
We parallelize the density matrix renormalization group (DMRG) method, which is a ground-state solver for one-dimensional quantum lattice systems. The parallelization allows us to extend the applicable range of the DMRG to n-leg ladders i.e., quasi two-dimension cases. Such an extension is regarded to bring about several breakthroughs in e.g., quantum-physics, chemistry, and nano-engineering. However, the straightforward parallelization requires all-to-all communications between all processes which are unsuitable for multi-core systems, which is a mainstream of current parallel computers. Therefore, we optimize the all-to-all communications by the following two steps. The first one is the elimination of the communications between all processes by only rearranging data distribution with the communication data amount kept. The second one is the avoidance of the communication conflict by rescheduling the calculation and the communication. We evaluate the performance of the DMRG method on multi-core supercomputers and confirm that our two-steps tuning is quite effective. (author)
Directory of Open Access Journals (Sweden)
Lamia Gaouar
2018-06-01
Full Text Available From the human-computer interface perspectives, the challenges to be faced are related to the consideration of new, multiple interactions, and the diversity of devices. The large panel of interactions (touching, shaking, voice dictation, positioning … and the diversification of interaction devices can be seen as a factor of flexibility albeit introducing incidental complexity. Our work is part of the field of user interface description languages. After an analysis of the scientific context of our work, this paper introduces HCIDL, a modelling language staged in a model-driven engineering approach. Among the properties related to human-computer interface, our proposition is intended for modelling multi-target, multimodal, plastic interaction interfaces using user interface description languages. By combining plasticity and multimodality, HCIDL improves usability of user interfaces through adaptive behaviour by providing end-users with an interaction-set adapted to input/output of terminals and, an optimum layout. Keywords: Model driven engineering, Human-computer interface, User interface description languages, Multimodal applications, Plastic user interfaces
Yun, Jian; Shang, Song-Chao; Wei, Xiao-Dan; Liu, Shuang; Li, Zhi-Jie
2016-01-01
Language is characterized by both ecological properties and social properties, and competition is the basic form of language evolution. The rise and decline of one language is a result of competition between languages. Moreover, this rise and decline directly influences the diversity of human culture. Mathematics and computer modeling for language competition has been a popular topic in the fields of linguistics, mathematics, computer science, ecology, and other disciplines. Currently, there are several problems in the research on language competition modeling. First, comprehensive mathematical analysis is absent in most studies of language competition models. Next, most language competition models are based on the assumption that one language in the model is stronger than the other. These studies tend to ignore cases where there is a balance of power in the competition. The competition between two well-matched languages is more practical, because it can facilitate the co-development of two languages. A third issue with current studies is that many studies have an evolution result where the weaker language inevitably goes extinct. From the integrated point of view of ecology and sociology, this paper improves the Lotka-Volterra model and basic reaction-diffusion model to propose an "ecology-society" computational model for describing language competition. Furthermore, a strict and comprehensive mathematical analysis was made for the stability of the equilibria. Two languages in competition may be either well-matched or greatly different in strength, which was reflected in the experimental design. The results revealed that language coexistence, and even co-development, are likely to occur during language competition.
Hardware synthesis from DDL. [Digital Design Language for computer aided design and test of LSI
Shah, A. M.; Shiva, S. G.
1981-01-01
The details of the digital systems can be conveniently input into the design automation system by means of Hardware Description Languages (HDL). The Computer Aided Design and Test (CADAT) system at NASA MSFC is used for the LSI design. The Digital Design Language (DDL) has been selected as HDL for the CADAT System. DDL translator output can be used for the hardware implementation of the digital design. This paper addresses problems of selecting the standard cells from the CADAT standard cell library to realize the logic implied by the DDL description of the system.
Operator-generated command language for computer control of Doublet III
International Nuclear Information System (INIS)
Drobnis, D.; Petersen, P.
1982-02-01
The Control System for Doublet III consists of a medium-sized minicomputer system, with several keyboards and color alphanumeric CRTs for interactive operator interface to a large distributed CAMAC I/O system. Under normal operating conditions, however, all of the sequential and decision-making operations necessary to prepare each tokamak shot are performed directly by the computer, executing a set of Procedures coded in a convenient command language. Most of these Procedures have been developed by the Doublet III operators themselves, and are maintained, altered, and augmented as required without programmer attention. In effect, the Procedures have become a high-level tokamak Command Language
Bucks, Gregory Warren
Computers have become an integral part of how engineers complete their work, allowing them to collect and analyze data, model potential solutions and aiding in production through automation and robotics. In addition, computers are essential elements of the products themselves, from tennis shoes to construction materials. An understanding of how computers function, both at the hardware and software level, is essential for the next generation of engineers. Despite the need for engineers to develop a strong background in computing, little opportunity is given for engineering students to develop these skills. Learning to program is widely seen as a difficult task, requiring students to develop not only an understanding of specific concepts, but also a way of thinking. In addition, students are forced to learn a new tool, in the form of the programming environment employed, along with these concepts and thought processes. Because of this, many students will not develop a sufficient proficiency in programming, even after progressing through the traditional introductory programming sequence. This is a significant problem, especially in the engineering disciplines, where very few students receive more than one or two semesters' worth of instruction in an already crowded engineering curriculum. To address these issues, new pedagogical techniques must be investigated in an effort to enhance the ability of engineering students to develop strong computing skills. However, these efforts are hindered by the lack of published assessment instruments available for probing an individual's understanding of programming concepts across programming languages. Traditionally, programming knowledge has been assessed by producing written code in a specific language. This can be an effective method, but does not lend itself well to comparing the pedagogical impact of different programming environments, languages or paradigms. This dissertation presents a phenomenographic research study
Utilization of a computer using programless language for radiation protection management
International Nuclear Information System (INIS)
Masuko, Syozi; Kasahara, Shigeru
1985-01-01
The practice of radiation management is different for each laboratory both in point of view and in the form of recording. Therefore, the computer program for the radiation management, especially for the management of radioisotopes is required to meet many amendments. In this standpoint, we have developed a ''programless language'' or ''programless software'' and have used in our work for several years. As the result of our experience, we have found that the programless language is quite satisfactory for the management of radioisotopes and that it has an advantage in some aspects over conventional programs. It is thought that this ''programless language'' is effective not only for our own works, but also applicable to other radioisotope laboratories. (author)
Litofsky, Joshua; Viswanathan, Rama
2015-01-01
Matrix diagonalization, the key technique at the heart of modern computational chemistry for the numerical solution of the Schrödinger equation, can be easily introduced in the physical chemistry curriculum in a pedagogical context using simple Hückel molecular orbital theory for p bonding in molecules. We present details and results of…
DEFF Research Database (Denmark)
Simonsen, Jakob Grue
2009-01-01
We consider the computational complexity of languages of symbolic dynamical systems. In particular, we study complexity hierarchies and membership of the non-uniform class P/poly. We prove: 1.For every time-constructible, non-decreasing function t(n)=@w(n), there is a symbolic dynamical system...... with language decidable in deterministic time O(n^2t(n)), but not in deterministic time o(t(n)). 2.For every space-constructible, non-decreasing function s(n)=@w(n), there is a symbolic dynamical system with language decidable in deterministic space O(s(n)), but not in deterministic space o(s(n)). 3.There...... are symbolic dynamical systems having hard and complete languages under @?"m^l^o^g^s- and @?"m^p-reduction for every complexity class above LOGSPACE in the backbone hierarchy (hence, P-complete, NP-complete, coNP-complete, PSPACE-complete, and EXPTIME-complete sets). 4.There are decidable languages of symbolic...
The growth of language: Universal Grammar, experience, and principles of computation.
Yang, Charles; Crain, Stephen; Berwick, Robert C; Chomsky, Noam; Bolhuis, Johan J
2017-10-01
Human infants develop language remarkably rapidly and without overt instruction. We argue that the distinctive ontogenesis of child language arises from the interplay of three factors: domain-specific principles of language (Universal Grammar), external experience, and properties of non-linguistic domains of cognition including general learning mechanisms and principles of efficient computation. We review developmental evidence that children make use of hierarchically composed structures ('Merge') from the earliest stages and at all levels of linguistic organization. At the same time, longitudinal trajectories of development show sensitivity to the quantity of specific patterns in the input, which suggests the use of probabilistic processes as well as inductive learning mechanisms that are suitable for the psychological constraints on language acquisition. By considering the place of language in human biology and evolution, we propose an approach that integrates principles from Universal Grammar and constraints from other domains of cognition. We outline some initial results of this approach as well as challenges for future research. Copyright © 2017 Elsevier Ltd. All rights reserved.
Towards a Computational Comparative Neuroprimatology: Framing the language-ready brain
Arbib, Michael A.
2016-03-01
We make the case for developing a Computational Comparative Neuroprimatology to inform the analysis of the function and evolution of the human brain. First, we update the mirror system hypothesis on the evolution of the language-ready brain by (i) modeling action and action recognition and opportunistic scheduling of macaque brains to hypothesize the nature of the last common ancestor of macaque and human (LCA-m); and then we (ii) introduce dynamic brain modeling to show how apes could acquire gesture through ontogenetic ritualization, hypothesizing the nature of evolution from LCA-m to the last common ancestor of chimpanzee and human (LCA-c). We then (iii) hypothesize the role of imitation, pantomime, protosign and protospeech in biological and cultural evolution from LCA-c to Homo sapiens with a language-ready brain. Second, we suggest how cultural evolution in Homo sapiens led from protolanguages to full languages with grammar and compositional semantics. Third, we assess the similarities and differences between the dorsal and ventral streams in audition and vision as the basis for presenting and comparing two models of language processing in the human brain: A model of (i) the auditory dorsal and ventral streams in sentence comprehension; and (ii) the visual dorsal and ventral streams in defining ;what language is about; in both production and perception of utterances related to visual scenes provide the basis for (iii) a first step towards a synthesis and a look at challenges for further research.
Computational Screening of MOF-Based Mixed Matrix Membranes for CO2/N2 Separations
Directory of Open Access Journals (Sweden)
Zeynep Sumer
2016-01-01
Full Text Available Atomically detailed simulations were used to examine CO2/N2 separation potential of metal organic framework- (MOF- based mixed matrix membranes (MMMs in this study. Gas permeability and selectivity of 700 new MMMs composed of 70 different MOFs and 10 different polymers were calculated for CO2/N2 separation. This is the largest number of MOF-based MMMs for which computational screening is done to date. Selecting the appropriate MOFs as filler particles in polymers resulted in MMMs that have higher CO2/N2 selectivities and higher CO2 permeabilities compared to pure polymer membranes. We showed that, for polymers that have low CO2 permeabilities but high CO2 selectivities, the identity of the MOF used as filler is not important. All MOFs enhanced the CO2 permeabilities of this type of polymers without changing their selectivities. Several MOF-based MMMs were identified to exceed the upper bound established for polymers. The methods we introduced in this study will create many opportunities to select the MOF/polymer combinations with useful properties for CO2 separation applications.
Shamloo, Amir; Mohammadaliha, Negar; Heilshorn, Sarah C; Bauer, Amy L
2016-04-01
A thorough understanding of determining factors in angiogenesis is a necessary step to control the development of new blood vessels. Extracellular matrix density is known to have a significant influence on cellular behaviors and consequently can regulate vessel formation. The utilization of experimental platforms in combination with numerical models can be a powerful method to explore the mechanisms of new capillary sprout formation. In this study, using an integrative method, the interplay between the matrix density and angiogenesis was investigated. Owing the fact that the extracellular matrix density is a global parameter that can affect other parameters such as pore size, stiffness, cell-matrix adhesion and cross-linking, deeper understanding of the most important biomechanical or biochemical properties of the ECM causing changes in sprout morphogenesis is crucial. Here, we implemented both computational and experimental methods to analyze the mechanisms responsible for the influence of ECM density on the sprout formation that is difficult to be investigated comprehensively using each of these single methods. For this purpose, we first utilized an innovative approach to quantify the correspondence of the simulated collagen fibril density to the collagen density in the experimental part. Comparing the results of the experimental study and computational model led to some considerable achievements. First, we verified the results of the computational model using the experimental results. Then, we reported parameters such as the ratio of proliferating cells to migrating cells that was difficult to obtain from experimental study. Finally, this integrative system led to gain an understanding of the possible mechanisms responsible for the effect of ECM density on angiogenesis. The results showed that stable and long sprouts were observed at an intermediate collagen matrix density of 1.2 and 1.9 mg/ml due to a balance between the number of migrating and proliferating
Raphael, B.; Fikes, R.; Waldinger, R.
1973-01-01
The results are summarised of a project aimed at the design and implementation of computer languages to aid in expressing problem solving procedures in several areas of artificial intelligence including automatic programming, theorem proving, and robot planning. The principal results of the project were the design and implementation of two complete systems, QA4 and QLISP, and their preliminary experimental use. The various applications of both QA4 and QLISP are given.
APPLICATION OF INFORMATION AND COMMUNICATION TECHNOLOGIES IN COMPUTER AIDED LANGUAGE LEARNING
Directory of Open Access Journals (Sweden)
I. B. Tampel
2013-01-01
Full Text Available The article deals with the various ways of application for automatic speech recognition, Text-to-Speech technology, pronunciation and communication skills training, vocabulary check of the taught person, audition skills training in computer aided language learning (CALL-system. In spite of some constraints such technologies application is effective both for education problems simplification and for comfort growth of the system application.
2016-09-06
conversational agent with information exchange disabled until the end of the experiment run. The meaning of the indicator in the top- right of the agent... Human Computer Collaboration at the Edge: Enhancing Collective Situation Understanding with Controlled Natural Language Alun Preece∗, William...email: PreeceAD@cardiff.ac.uk †Emerging Technology Services, IBM United Kingdom Ltd, Hursley Park, Winchester, UK ‡US Army Research Laboratory, Human
Computer programs in BASIC language for atomic absorption flame spectroscopy. Part 2. Documentation
International Nuclear Information System (INIS)
Boyle, W.G. Jr.
1977-01-01
There are three computer programs, written in the BASIC language, used for taking data from an atomic absorption spectrophotometer operating in the flame mode. The programs are divided into logical sections, and these have been flow-charted. The general features, the structure, the order of subroutines and functions, and the storage of data are discussed. In addition, variables are listed and defined, and a complete listing of each program with a symbol occurrence table is provided
Teich, Elke
1999-01-01
This volume deals with the computational application of systemic functional grammar (SFG) for natural language generation. In particular, it describes the implementation of a fragment of the grammar of German in the computational framework of KOMET-PENMAN for multilingual generation. The text also presents a specification of explicit well-formedness constraints on syntagmatic structure which are defined in the form of typed feature structures. It thus achieves a model of systemic functional grammar that unites both the strengths of systemics, such as stratification, functional diversification
Programming languages as a way of training in polytechnics computer. Your Social conditioning
Directory of Open Access Journals (Sweden)
Raimundo González Fernández
2007-03-01
Full Text Available This article presents a panorama of the necessity the current Cuban society has to form high quality technicians in Computer science, and the social and historical conditions that compromise the existence of the subject “Language of Programming ”inside its study plan, as well as the necessity to upgrade teachers who teach this subject, in Computer Science's Polytechnical School "Carlos Hidalgo Díaz” in Pinar del Río province. Regarding the inadequacies there are in these programs, in the theoretical and methodological order, it is expected that with an intervention strategy consisting on an upgrading course this problem can be solved.
Teaching computer interfacing with virtual instruments in an object-oriented language.
Gulotta, M
1995-01-01
LabVIEW is a graphic object-oriented computer language developed to facilitate hardware/software communication. LabVIEW is a complete computer language that can be used like Basic, FORTRAN, or C. In LabVIEW one creates virtual instruments that aesthetically look like real instruments but are controlled by sophisticated computer programs. There are several levels of data acquisition VIs that make it easy to control data flow, and many signal processing and analysis algorithms come with the software as premade VIs. In the classroom, the similarity between virtual and real instruments helps students understand how information is passed between the computer and attached instruments. The software may be used in the absence of hardware so that students can work at home as well as in the classroom. This article demonstrates how LabVIEW can be used to control data flow between computers and instruments, points out important features for signal processing and analysis, and shows how virtual instruments may be used in place of physical instrumentation. Applications of LabVIEW to the teaching laboratory are also discussed, and a plausible course outline is given. PMID:8580361
National Research Council Canada - National Science Library
Lu, Chao
2008-01-01
...) using p-adic arithmetic. New algorithms have been designed and implemented for matrix operations with rational numbers by representing numerator and denominator with arbitrary length integers, all integers and fractional...
Pekel, Haci Ahmet
2014-01-01
Foreign language, computer programs and social network applications or web sites are widely used by many people nowadays for various aims. In the literature, the number of studies investigating over university departments of physical education or more specifically to say, taking sports students' and teachers' foreign language and social networking…
Pierson, Susan Jacques
2015-01-01
One way to provide high quality instruction for underserved English Language Learners around the world is to combine Task-Based English Language Learning with Computer- Assisted Instruction. As part of an ongoing project, "Bridges to Swaziland," these approaches have been implemented in a determined effort to improve the ESL program for…
Aryadoust, Vahid; Mehran, Parisa; Alizadeh, Mehrasa
2016-01-01
A few computer-assisted language learning (CALL) instruments have been developed in Iran to measure EFL (English as a foreign language) learners' attitude toward CALL. However, these instruments have no solid validity argument and accordingly would be unable to provide a reliable measurement of attitude. The present study aimed to develop a CALL…
Lee, Shu-Ping; Su, Hui-Kai; Lee, Shin-Da
2012-06-01
This study investigated the effects of immediate feedback on computer-based foreign language listening comprehension tests and on intrapersonal test-associated anxiety in 72 English major college students at a Taiwanese University. Foreign language listening comprehension of computer-based tests designed by MOODLE, a dynamic e-learning environment, with or without immediate feedback together with the state-trait anxiety inventory (STAI) were tested and repeated after one week. The analysis indicated that immediate feedback during testing caused significantly higher anxiety and resulted in significantly higher listening scores than in the control group, which had no feedback. However, repeated feedback did not affect the test anxiety and listening scores. Computer-based immediate feedback did not lower debilitating effects of anxiety but enhanced students' intrapersonal eustress-like anxiety and probably improved their attention during listening tests. Computer-based tests with immediate feedback might help foreign language learners to increase attention in foreign language listening comprehension.
Joshi, Prasad Ramesh; Ramanathan, N; Sundararajan, K; Sankaran, K
2015-04-09
The weak interaction between PCl3 and CH3OH was investigated using matrix isolation infrared spectroscopy and ab initio computations. In a nitrogen matrix at low temperature, the noncovalent adduct was generated and characterized using Fourier transform infrared spectroscopy. Computations were performed at B3LYP/6-311++G(d,p), B3LYP/aug-cc-pVDZ, and MP2/6-311++G(d,p) levels of theory to optimize the possible geometries of PCl3-CH3OH adducts. Computations revealed two minima on the potential energy surface, of which, the global minimum is stabilized by a noncovalent P···O interaction, known as a pnictogen bonding (phosphorus bonding or P-bonding). The local minimum corresponded to a cyclic adduct, stabilized by the conventional hydrogen bonding (Cl···H-O and Cl···H-C interactions). Experimentally, 1:1 P-bonded PCl3-CH3OH adduct in nitrogen matrix was identified, where shifts in the P-Cl modes of PCl3, O-C, and O-H modes of CH3OH submolecules were observed. The observed vibrational frequencies of the P-bonded adduct in a nitrogen matrix agreed well with the computed frequencies. Furthermore, computations also predicted that the P-bonded adduct is stronger than H-bonded adduct by ∼1.56 kcal/mol. Atoms in molecules and natural bond orbital analyses were performed to understand the nature of interactions and effect of charge transfer interaction on the stability of the adducts.
Computation of the Distribution of the Fiber-Matrix Interface Cracks in the Edge Trimming of CFRP
Wang, Fu-ji; Zhang, Bo-yu; Ma, Jian-wei; Bi, Guang-jian; Hu, Hai-bo
2018-04-01
Edge trimming is commonly used to bring the CFRP components to right dimension and shape in aerospace industries. However, various forms of undesirable machining damage occur frequently which will significantly decrease the material performance of CFRP. The damage is difficult to predict and control due to the complicated changing laws, causing unsatisfactory machining quality of CFRP components. Since the most of damage has the same essence: the fiber-matrix interface cracks, this study aims to calculate the distribution of them in edge trimming of CFRP, thereby to obtain the effects of the machining parameters, which could be helpful to guide the optimal selection of the machining parameters in engineering. Through the orthogonal cutting experiments, the quantitative relation between the fiber-matrix interface crack depth and the fiber cutting angle, cutting depth as well as cutting speed is established. According to the analysis on material removal process on any location of the workpiece in edge trimming, the instantaneous cutting parameters are calculated, and the formation process of the fiber-matrix interface crack is revealed. Finally, the computational method for the fiber-matrix interface cracks in edge trimming of CFRP is proposed. Upon the computational results, it is found that the fiber orientations of CFRP workpieces is the most significant factor on the fiber-matrix interface cracks, which can not only change the depth of them from micrometers to millimeters, but control the distribution image of them. Other machining parameters, only influence the fiber-matrix interface cracks depth but have little effect on the distribution image.
The semantics of Chemical Markup Language (CML for computational chemistry : CompChem
Directory of Open Access Journals (Sweden)
Phadungsukanan Weerapong
2012-08-01
Full Text Available Abstract This paper introduces a subdomain chemistry format for storing computational chemistry data called CompChem. It has been developed based on the design, concepts and methodologies of Chemical Markup Language (CML by adding computational chemistry semantics on top of the CML Schema. The format allows a wide range of ab initio quantum chemistry calculations of individual molecules to be stored. These calculations include, for example, single point energy calculation, molecular geometry optimization, and vibrational frequency analysis. The paper also describes the supporting infrastructure, such as processing software, dictionaries, validation tools and database repositories. In addition, some of the challenges and difficulties in developing common computational chemistry dictionaries are discussed. The uses of CompChem are illustrated by two practical applications.
The semantics of Chemical Markup Language (CML) for computational chemistry : CompChem.
Phadungsukanan, Weerapong; Kraft, Markus; Townsend, Joe A; Murray-Rust, Peter
2012-08-07
: This paper introduces a subdomain chemistry format for storing computational chemistry data called CompChem. It has been developed based on the design, concepts and methodologies of Chemical Markup Language (CML) by adding computational chemistry semantics on top of the CML Schema. The format allows a wide range of ab initio quantum chemistry calculations of individual molecules to be stored. These calculations include, for example, single point energy calculation, molecular geometry optimization, and vibrational frequency analysis. The paper also describes the supporting infrastructure, such as processing software, dictionaries, validation tools and database repositories. In addition, some of the challenges and difficulties in developing common computational chemistry dictionaries are discussed. The uses of CompChem are illustrated by two practical applications.
Directory of Open Access Journals (Sweden)
Xing Cai
2005-01-01
Full Text Available This article addresses the performance of scientific applications that use the Python programming language. First, we investigate several techniques for improving the computational efficiency of serial Python codes. Then, we discuss the basic programming techniques in Python for parallelizing serial scientific applications. It is shown that an efficient implementation of the array-related operations is essential for achieving good parallel performance, as for the serial case. Once the array-related operations are efficiently implemented, probably using a mixed-language implementation, good serial and parallel performance become achievable. This is confirmed by a set of numerical experiments. Python is also shown to be well suited for writing high-level parallel programs.
Hunter, James; Freer, Yvonne; Gatt, Albert; Reiter, Ehud; Sripada, Somayajulu; Sykes, Cindy; Westwater, Dave
2011-01-01
The BT-Nurse system uses data-to-text technology to automatically generate a natural language nursing shift summary in a neonatal intensive care unit (NICU). The summary is solely based on data held in an electronic patient record system, no additional data-entry is required. BT-Nurse was tested for two months in the Royal Infirmary of Edinburgh NICU. Nurses were asked to rate the understandability, accuracy, and helpfulness of the computer-generated summaries; they were also asked for free-text comments about the summaries. The nurses found the majority of the summaries to be understandable, accurate, and helpful (pgenerated summaries. In conclusion, natural language NICU shift summaries can be automatically generated from an electronic patient record, but our proof-of-concept software needs considerable additional development work before it can be deployed.
Bonitati, Joey; Slimmer, Ben; Li, Weichuan; Potel, Gregory; Nunes, Filomena
2017-09-01
The calculable form of the R-matrix method has been previously shown to be a useful tool in approximately solving the Schrodinger equation in nuclear scattering problems. We use this technique combined with the Gauss quadrature for the Lagrange-mesh method to efficiently solve for the wave functions of projectile nuclei in low energy collisions (1-100 MeV) involving an arbitrary number of channels. We include the local Woods-Saxon potential, the non-local potential of Perey and Buck, a Coulomb potential, and a coupling potential to computationally solve for the wave function of two nuclei at short distances. Object oriented programming is used to increase modularity, and parallel programming techniques are introduced to reduce computation time. We conclude that the R-matrix method is an effective method to predict the wave functions of nuclei in scattering problems involving both multiple channels and non-local potentials. Michigan State University iCER ACRES REU.
Directory of Open Access Journals (Sweden)
Douglas Altamiro CONSOLO
2015-12-01
Full Text Available ABSTRACT An innovative aspect in the area of language assessment has been to evaluate oral language proficiency in distant interactions by means of computers. In this paper, we present the results of a qualitative research study that aimed at analyzing features of language spoken in a computer-aided learning and teaching context, which is constituted by teletandem interactions. The data were collected in the scope of the Teletandem Brazil project by means of interviews, audio and video recordings of online interactions, questionnaires and field notes. The results offer contributions for the areas of assessment, teacher education and teaching Portuguese for foreigners.
Towards a Computational Comparative Neuroprimatology: Framing the language-ready brain.
Arbib, Michael A
2016-03-01
We make the case for developing a Computational Comparative Neuroprimatology to inform the analysis of the function and evolution of the human brain. First, we update the mirror system hypothesis on the evolution of the language-ready brain by (i) modeling action and action recognition and opportunistic scheduling of macaque brains to hypothesize the nature of the last common ancestor of macaque and human (LCA-m); and then we (ii) introduce dynamic brain modeling to show how apes could acquire gesture through ontogenetic ritualization, hypothesizing the nature of evolution from LCA-m to the last common ancestor of chimpanzee and human (LCA-c). We then (iii) hypothesize the role of imitation, pantomime, protosign and protospeech in biological and cultural evolution from LCA-c to Homo sapiens with a language-ready brain. Second, we suggest how cultural evolution in Homo sapiens led from protolanguages to full languages with grammar and compositional semantics. Third, we assess the similarities and differences between the dorsal and ventral streams in audition and vision as the basis for presenting and comparing two models of language processing in the human brain: A model of (i) the auditory dorsal and ventral streams in sentence comprehension; and (ii) the visual dorsal and ventral streams in defining "what language is about" in both production and perception of utterances related to visual scenes provide the basis for (iii) a first step towards a synthesis and a look at challenges for further research. Copyright © 2015 Elsevier B.V. All rights reserved.
Integrating Molecular Computation and Material Production in an Artificial Subcellular Matrix
DEFF Research Database (Denmark)
Fellermann, Harold; Hadorn, Maik; Bönzli, Eva
Living systems are unique in that they integrate molecular recognition and information processing with material production on the molecular scale. Pre- dominant locus of this integration is the cellular matrix, where a multitude of biochemical reactions proceed simultaneously in highly compartmen......Living systems are unique in that they integrate molecular recognition and information processing with material production on the molecular scale. Pre- dominant locus of this integration is the cellular matrix, where a multitude of biochemical reactions proceed simultaneously in highly...... compartmentalized re- action compartments that interact and get delivered through vesicle trafficking. The European Commission funded project MatchIT (Matrix for Chemical IT) aims at creating an artificial cellular matrix that seamlessly integrates infor- mation processing and material production in much the same...
A Computer Program to Compile a Flander-Amidon Interaction Analysis Matrix
Hardy, Robert C.
1970-01-01
A program was written in FORTRAN IV for an IBM 3600 to produce the Flanders-Amidon Interaction Analysis Matrix and to also produce percentages of certain p FORTRAN IV and V for the Univac 1108. (Editor/RT)
Library designs for generic C++ sparse matrix computations of iterative methods
Energy Technology Data Exchange (ETDEWEB)
Pozo, R.
1996-12-31
A new library design is presented for generic sparse matrix C++ objects for use in iterative algorithms and preconditioners. This design extends previous work on C++ numerical libraries by providing a framework in which efficient algorithms can be written *independent* of the matrix layout or format. That is, rather than supporting different codes for each (element type) / (matrix format) combination, only one version of the algorithm need be maintained. This not only reduces the effort for library developers, but also simplifies the calling interface seen by library users. Furthermore, the underlying matrix library can be naturally extended to support user-defined objects, such as hierarchical block-structured matrices, or application-specific preconditioners. Utilizing optimized kernels whenever possible, the resulting performance of such framework can be shown to be competitive with optimized Fortran programs.
ANIBAL - a Hybrid Computer Language for EAI 680-PDP 8/I, FPP 12
DEFF Research Database (Denmark)
Højberg, Kristian Søe
1974-01-01
and special hybrid computer commands. ANIBAL consists of a general-purpose analog interface subroutine ANI and the macro processor 8BAL (DECUS NO 8-497A.1). When a source program with FORTRAN and 8BAL statements is processed, the FORTRAN statements are transferred unchanged, while the 8BAL code is translated...... essentially to ANI sub-routine calls, which are defined in a macro library. The resulting code is translated by the standard FORTRAN compiler. The language is very flexible as the instructions can be changed and commands can be added to or excluded from the library ....
Al-Awidi, Hamed Mubarak; Ismail, Sadiq Abdulwahed
2014-01-01
This study investigated ESL teachers' perceptions regarding the use of Computer Assisted Language Learning (CALL) in teaching reading to children. A random sample of 145 teachers participated in the study by completing a survey developed by the researchers. To explore the situation in depth, 16 teachers were later interviewed. Results indicated…
POLYMAT-C: a comprehensive SPSS program for computing the polychoric correlation matrix.
Lorenzo-Seva, Urbano; Ferrando, Pere J
2015-09-01
We provide a free noncommercial SPSS program that implements procedures for (a) obtaining the polychoric correlation matrix between a set of ordered categorical measures, so that it can be used as input for the SPSS factor analysis (FA) program; (b) testing the null hypothesis of zero population correlation for each element of the matrix by using appropriate simulation procedures; (c) obtaining valid and accurate confidence intervals via bootstrap resampling for those correlations found to be significant; and (d) performing, if necessary, a smoothing procedure that makes the matrix amenable to any FA estimation procedure. For the main purpose (a), the program uses a robust unified procedure that allows four different types of estimates to be obtained at the user's choice. Overall, we hope the program will be a very useful tool for the applied researcher, not only because it provides an appropriate input matrix for FA, but also because it allows the researcher to carefully check the appropriateness of the matrix for this purpose. The SPSS syntax, a short manual, and data files related to this article are available as Supplemental materials that are available for download with this article.
DEFF Research Database (Denmark)
Raudaskoski, Pirkko
1992-01-01
The main aim in this study is to develop an understanding of how repair work is managed in the intertwining of activities and actions with talk and language. By doing this, the richness of the concept of repair in interactional studies is shown. The core work concentrates on exploring repair work...... the English language as a resource. The computer interface use context was chosen to show how narrowly traditional research has seen repair work.......The main aim in this study is to develop an understanding of how repair work is managed in the intertwining of activities and actions with talk and language. By doing this, the richness of the concept of repair in interactional studies is shown. The core work concentrates on exploring repair work...... in the context of participants solving interactional troubles in their activities. Many types of resources are potentially available in any situation, from the physical features of tools to the cultural context. In this study the interest lies especially in the more complicated artifacts which also offer...
The Internet and computer enhanced foreign language learning and intercultural communication
Directory of Open Access Journals (Sweden)
Levent Uzun
2012-07-01
Full Text Available The present study aims at discussing the potential of the Internet and computer-mediated artefacts for education. The understanding of digitalised and technology utilised education, which is the current trend of our age, is highlighted and some computer-mediated artefacts such as the so called modular object-oriented dynamic learning environment (MOODLE, the online virtual reality chatting game Second Life, and some others are introduced in a unified connection to show how they can be practically integrated in education, and how they can foster foreign language learning and practice, and intercultural communication. It is emphasised that the current situation of the physical conditions, and also the needs, interests and abilities of the new-age learners should be considered more carefully to give education a correct direction in the future.
Eichenberger, Alexandre E; Gschwind, Michael K; Gunnels, John A
2014-02-11
Mechanisms for performing a complex matrix multiplication operation are provided. A vector load operation is performed to load a first vector operand of the complex matrix multiplication operation to a first target vector register. The first vector operand comprises a real and imaginary part of a first complex vector value. A complex load and splat operation is performed to load a second complex vector value of a second vector operand and replicate the second complex vector value within a second target vector register. The second complex vector value has a real and imaginary part. A cross multiply add operation is performed on elements of the first target vector register and elements of the second target vector register to generate a partial product of the complex matrix multiplication operation. The partial product is accumulated with other partial products and a resulting accumulated partial product is stored in a result vector register.
Image Matrix Processor for Volumetric Computations Final Report CRADA No. TSB-1148-95
Energy Technology Data Exchange (ETDEWEB)
Roberson, G. Patrick [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Browne, Jolyon [Advanced Research & Applications Corporation, Sunnyvale, CA (United States)
2018-01-22
The development of an Image Matrix Processor (IMP) was proposed that would provide an economical means to perform rapid ray-tracing processes on volume "Giga Voxel" data sets. This was a multi-phased project. The objective of the first phase of the IMP project was to evaluate the practicality of implementing a workstation-based Image Matrix Processor for use in volumetric reconstruction and rendering using hardware simulation techniques. Additionally, ARACOR and LLNL worked together to identify and pursue further funding sources to complete a second phase of this project.
Directory of Open Access Journals (Sweden)
Miloud Bouchefra
2017-04-01
Full Text Available Computer Assisted Language Learning (CALL is still groping its way into Algerian English as a Foreign Language (EFL classroom, where Information Communications Technologies (ICTs are defined in terms of occasional use of computers and data projectors for material presentation in the classroom. Though major issues in the image of the lack of training and absence of facilities are clearly apparent, stakeholders’ attitudes are a decisive aspect that needs to be mapped out if we are to alter the current situation. Thus, the present work aims at investigating EFL university teachers’ attitudes towards CALL at Djilali Liabes University (western Algeria. The current work is a cross-sectional descriptive study that explores teachers’ attitudes across the three domains (affective, cognitive, and behavioural and investigates other related aspects that may help indicate teachers’ likelihood to adopt CALL in the future. The results are promising as the investigated population not only demonstrated a clearly positive attitude towards CALL but also manifested a number of signs that indicate their likelihood to adopt CALL in the future if circumstances are favourable.
Directory of Open Access Journals (Sweden)
Alireza Fard-Kashani
2015-10-01
Full Text Available The current study aimed at diagnosing the language needs of Iranian undergraduate students of computer engineering in order to find out whether there is any significant difference in perceptions between the students and their ESAP (English for Specific Academic Purpose teachers, concerning their Reading skill needs. To conduct the intended research study, both qualitative and quantitative approaches were taken. The quantitative approach included the use of self-assessment, and two questionnaires, and the qualitative approach included participant observation. The questionnaires were adapted from Atai and Shoja (2009, and were distributed among 500 undergraduate students of computer engineering and 30 ESAP teachers who were chosen randomly through cluster sampling method from thirteen universities. Mann-Whitney U-test results showed that there was a significant difference between perceptions of the students and their teachers about their Reading skill needs and ‘Reading’ was mentioned as one of the most difficult skills for the students. Moreover, it was found that the majority of students suffered from low level of General English Language Proficiency, and also ‘low motivation’ and the ‘character’ of teachers were found to be important factors affecting students’ learning. Keywords: Needs analysis, English for specific purposes, English for academic purposes, Present situation analysis, Target situation analysis
TAO-2/SPARTE, a language-enhanced computer aided teleoperation system
International Nuclear Information System (INIS)
Gravez, P.; Fournier, R.
1991-01-01
TAO-2 is a computer system designed by CEA/DTA/UR for the remote control of nuclear servicing servomanipulators. It results from several years of research which have led to the current availability of an industrial product featuring highly advanced performances. For undersea applications, a development has also been carried out with CYBERNETIX for controlling the new hydraulic arm built by this company. An integral element of TAO-2 is the SPARTE language which deals with off-line task programming and focuses on combined manual, automatic and mixed control modes. Additionally, it takes into account the on-line part of the human operator relative to adjustment, monitoring and incident recovery. Other promising features are hybrid control specification, mechanisms for the management of external events and 'learning by touching' capabilities. The present paper describes the basic principles of TAO-2. It first recalls the fundamentals of Computer Aided Teleoperation (CAT). The functional and hardware architectures which implement the TAO-2 CAT concepts are then outlined. The next parts emphasize the original characteristics of the SPARTE control and programming language. The paper ends with a brief presentation of our approach for CAT symbolic control
Waltemath, Dagmar; Adams, Richard; Bergmann, Frank T; Hucka, Michael; Kolpakov, Fedor; Miller, Andrew K; Moraru, Ion I; Nickerson, David; Sahle, Sven; Snoep, Jacky L; Le Novère, Nicolas
2011-12-15
The increasing use of computational simulation experiments to inform modern biological research creates new challenges to annotate, archive, share and reproduce such experiments. The recently published Minimum Information About a Simulation Experiment (MIASE) proposes a minimal set of information that should be provided to allow the reproduction of simulation experiments among users and software tools. In this article, we present the Simulation Experiment Description Markup Language (SED-ML). SED-ML encodes in a computer-readable exchange format the information required by MIASE to enable reproduction of simulation experiments. It has been developed as a community project and it is defined in a detailed technical specification and additionally provides an XML schema. The version of SED-ML described in this publication is Level 1 Version 1. It covers the description of the most frequent type of simulation experiments in the area, namely time course simulations. SED-ML documents specify which models to use in an experiment, modifications to apply on the models before using them, which simulation procedures to run on each model, what analysis results to output, and how the results should be presented. These descriptions are independent of the underlying model implementation. SED-ML is a software-independent format for encoding the description of simulation experiments; it is not specific to particular simulation tools. Here, we demonstrate that with the growing software support for SED-ML we can effectively exchange executable simulation descriptions. With SED-ML, software can exchange simulation experiment descriptions, enabling the validation and reuse of simulation experiments in different tools. Authors of papers reporting simulation experiments can make their simulation protocols available for other scientists to reproduce the results. Because SED-ML is agnostic about exact modeling language(s) used, experiments covering models from different fields of research
2011-01-01
Background The increasing use of computational simulation experiments to inform modern biological research creates new challenges to annotate, archive, share and reproduce such experiments. The recently published Minimum Information About a Simulation Experiment (MIASE) proposes a minimal set of information that should be provided to allow the reproduction of simulation experiments among users and software tools. Results In this article, we present the Simulation Experiment Description Markup Language (SED-ML). SED-ML encodes in a computer-readable exchange format the information required by MIASE to enable reproduction of simulation experiments. It has been developed as a community project and it is defined in a detailed technical specification and additionally provides an XML schema. The version of SED-ML described in this publication is Level 1 Version 1. It covers the description of the most frequent type of simulation experiments in the area, namely time course simulations. SED-ML documents specify which models to use in an experiment, modifications to apply on the models before using them, which simulation procedures to run on each model, what analysis results to output, and how the results should be presented. These descriptions are independent of the underlying model implementation. SED-ML is a software-independent format for encoding the description of simulation experiments; it is not specific to particular simulation tools. Here, we demonstrate that with the growing software support for SED-ML we can effectively exchange executable simulation descriptions. Conclusions With SED-ML, software can exchange simulation experiment descriptions, enabling the validation and reuse of simulation experiments in different tools. Authors of papers reporting simulation experiments can make their simulation protocols available for other scientists to reproduce the results. Because SED-ML is agnostic about exact modeling language(s) used, experiments covering models from
Lie-optic matrix algorithm for computer simulation of paraxial self ...
Indian Academy of Sciences (India)
It gives rise to a matrix method for self-focusing beam propagation that is ... are applicable for other media like linear optical fibers and to more general ..... operators for small slices of the plasma of thickness ¡z each, it is advisable to work.
Aberration studies and computer algebra
International Nuclear Information System (INIS)
Hawkes, P.W.
1981-01-01
The labour of calculating expressions for aberration coefficients is considerably lightened if a computer algebra language is used to perform the various substitutions and expansions involved. After a brief discussion of matrix representations of aberration coefficients, a particular language, which has shown itself to be well adapted to particle optics, is described and applied to the study of high frequency cavity lenses. (orig.)
Directory of Open Access Journals (Sweden)
Samson Abramsky
2015-11-01
Full Text Available Maxwell's Demon, 'a being whose faculties are so sharpened that he can follow every molecule in its course', has been the centre of much debate about its abilities to violate the second law of thermodynamics. Landauer's hypothesis, that the Demon must erase its memory and incur a thermodynamic cost, has become the standard response to Maxwell's dilemma, and its implications for the thermodynamics of computation reach into many areas of quantum and classical computing. It remains, however, still a hypothesis. Debate has often centred around simple toy models of a single particle in a box. Despite their simplicity, the ability of these systems to accurately represent thermodynamics (specifically to satisfy the second law and whether or not they display Landauer Erasure, has been a matter of ongoing argument. The recent Norton-Ladyman controversy is one such example. In this paper we introduce a programming language to describe these simple thermodynamic processes, and give a formal operational semantics and program logic as a basis for formal reasoning about thermodynamic systems. We formalise the basic single-particle operations as statements in the language, and then show that the second law must be satisfied by any composition of these basic operations. This is done by finding a computational invariant of the system. We show, furthermore, that this invariant requires an erasure cost to exist within the system, equal to kTln2 for a bit of information: Landauer Erasure becomes a theorem of the formal system. The Norton-Ladyman controversy can therefore be resolved in a rigorous fashion, and moreover the formalism we introduce gives a set of reasoning tools for further analysis of Landauer erasure, which are provably consistent with the second law of thermodynamics.
Mardyukov, Artur; Crespo-Otero, Rachel; Sanchez-Garcia, Elsa; Sander, Wolfram
2010-08-02
The reaction of the phenyl radical 1 with water has been investigated by using matrix isolation spectroscopy and quantum chemical calculations. The primary thermal product of the reaction between 1 and water is a weakly bound complex stabilized by an OH...pi interaction. This complex is photolabile, and visible-light irradiation (lambda>420 nm) results in hydrogen atom transfer from water to radical 1 and the formation of a highly labile complex between benzene and the OH radical. This complex is stable under the conditions of matrix isolation, however, continuous irradiation with lambda>420 nm light results in the complete destruction of the aromatic system and formation of an acylic unsaturated ketene. The mechanisms of all reaction steps are discussed in the light of ab initio and DFT calculations.
FastTree: Computing Large Minimum Evolution Trees with Profiles instead of a Distance Matrix
Price, Morgan N.; Dehal, Paramvir S.; Arkin, Adam P.
2009-01-01
Gene families are growing rapidly, but standard methods for inferring phylogenies do not scale to alignments with over 10,000 sequences. We present FastTree, a method for constructing large phylogenies and for estimating their reliability. Instead of storing a distance matrix, FastTree stores sequence profiles of internal nodes in the tree. FastTree uses these profiles to implement Neighbor-Joining and uses heuristics to quickly identify candidate joins. FastTree then uses nearest neighbor in...
LT^2C^2: A language of thought with Turing-computable Kolmogorov complexity
Directory of Open Access Journals (Sweden)
Santiago Figueira
2013-03-01
Full Text Available In this paper, we present a theoretical effort to connect the theory of program size to psychology by implementing a concrete language of thought with Turing-computable Kolmogorov complexity (LT^2C^2 satisfying the following requirements: 1 to be simple enough so that the complexity of any given finite binary sequence can be computed, 2 to be based on tangible operations of human reasoning (printing, repeating,. . . , 3 to be sufficiently powerful to generate all possible sequences but not too powerful as to identify regularities which would be invisible to humans. We first formalize LT^2C^2, giving its syntax and semantics, and defining an adequate notion of program size. Our setting leads to a Kolmogorov complexity function relative to LT^2C^2 which is computable in polynomial time, and it also induces a prediction algorithm in the spirit of Solomonoff’s inductive inference theory. We then prove the efficacy of this language by investigating regularities in strings produced by participants attempting to generate random strings. Participants had a profound understanding of randomness and hence avoided typical misconceptions such as exaggerating the number of alternations. We reasoned that remaining regularities would express the algorithmic nature of human thoughts, revealed in the form of specific patterns. Kolmogorov complexity relative to LT^2C^2 passed three expected tests examined here: 1 human sequences were less complex than control PRNG sequences, 2 human sequences were not stationary showing decreasing values of complexity resulting from fatigue 3 each individual showed traces of algorithmic stability since fitting of partial data was more effective to predict subsequent data than average fits. This work extends on previous efforts to combine notions of Kolmogorov complexity theory and algorithmic information theory to psychology, by explicitly proposing a language which may describe the patterns of human thoughts.Received: 12
Outlook of Instructors and Students on Ethical Issues in Computer Assisted Language Learning
Directory of Open Access Journals (Sweden)
V. R. Mirzaeian
2016-07-01
Full Text Available One of major concerns of human beings regardless of their religion or school of thought is to observe ethical issues. This paper discusses the issue and lays emphasis on observing ethical matters in teaching in virtual learning environments in general and computer assisted language learning in particular. The paper tries to throw light on the current status of observing ethical issues in virtual learning environments and drawing both instructors and students’ attention to this issue. The research has been conducted by using two questionnaires one given to students and the other to instructors. Data analysis revealed that majority of instructors observed ethical issues when confronted with students’ personal details. Students were most sensitive regarding disclosing their personal photos in these virtual environments; however, they were comfortable if their personal details were controlled by the instructors. The Chi-Square test showed no substantial difference between gender and observing ethical issues in virtual learning environments.
LABORATORY PROCESS CONTROLLER USING NATURAL LANGUAGE COMMANDS FROM A PERSONAL COMPUTER
Will, H.
1994-01-01
The complex environment of the typical research laboratory requires flexible process control. This program provides natural language process control from an IBM PC or compatible machine. Sometimes process control schedules require changes frequently, even several times per day. These changes may include adding, deleting, and rearranging steps in a process. This program sets up a process control system that can either run without an operator, or be run by workers with limited programming skills. The software system includes three programs. Two of the programs, written in FORTRAN77, record data and control research processes. The third program, written in Pascal, generates the FORTRAN subroutines used by the other two programs to identify the user commands with the user-written device drivers. The software system also includes an input data set which allows the user to define the user commands which are to be executed by the computer. To set the system up the operator writes device driver routines for all of the controlled devices. Once set up, this system requires only an input file containing natural language command lines which tell the system what to do and when to do it. The operator can make up custom commands for operating and taking data from external research equipment at any time of the day or night without the operator in attendance. This process control system requires a personal computer operating under MS-DOS with suitable hardware interfaces to all controlled devices. The program requires a FORTRAN77 compiler and user-written device drivers. This program was developed in 1989 and has a memory requirement of about 62 Kbytes.
Fast Tree: Computing Large Minimum-Evolution Trees with Profiles instead of a Distance Matrix
N. Price, Morgan
2009-01-01
Gene families are growing rapidly, but standard methods for inferring phylogenies do not scale to alignments with over 10,000 sequences. We present FastTree, a method for constructing large phylogenies and for estimating their reliability. Instead of storing a distance matrix, FastTree stores sequence profiles of internal nodes in the tree. FastTree uses these profiles to implement neighbor-joining and uses heuristics to quickly identify candidate joins. FastTree then uses nearest-neighbor i...
Optimal fabrication processes for unidirectional metal-matrix composites: A computational simulation
Saravanos, D. A.; Murthy, P. L. N.; Morel, M.
1990-01-01
A method is proposed for optimizing the fabrication process of unidirectional metal matrix composites. The temperature and pressure histories are optimized such that the residual microstresses of the composite at the end of the fabrication process are minimized and the material integrity throughout the process is ensured. The response of the composite during the fabrication is simulated based on a nonlinear micromechanics theory. The optimal fabrication problem is formulated and solved with non-linear programming. Application cases regarding the optimization of the fabrication cool-down phases of unidirectional ultra-high modulus graphite/copper and silicon carbide/titanium composites are presented.
Saravanos, D. A.; Murthy, P. L. N.; Morel, M.
1990-01-01
A method is proposed for optimizing the fabrication process of unidirectional metal matrix composites. The temperature and pressure histories are optimized such that the residual microstresses of the composite at the end of the fabrication process are minimized and the material integrity throughout the process is ensured. The response of the composite during the fabrication is simulated based on a nonlinear micromechanics theory. The optimal fabrication problem is formulated and solved with nonlinear programming. Application cases regarding the optimization of the fabrication cool-down phases of unidirectional ultra-high modulus graphite/copper and silicon carbide/titanium composites are presented.
Knoeferle, Pia
2016-03-01
In his review article [19], Arbib outlines an ambitious research agenda: to accommodate within a unified framework the evolution, the development, and the processing of language in natural settings (implicating other systems such as vision). He does so with neuro-computationally explicit modeling in mind [1,2] and inspired by research on the mirror neuron system in primates. Similar research questions have received substantial attention also among other scientists [3,4,12].
Computers and Tuvan language: an overview of research at Tuvan State University
Directory of Open Access Journals (Sweden)
Sergey M. Dalaa
2016-12-01
Full Text Available Since their very beginnings, both philology and information technologies have faced the challenge of processing textual information. With the arrival of the Internet, this task has become more topical than ever before. In the Republic of Tuva, it is being dealt with by the Research and Education Center for Turkic Studies at the Tuvan State University in collaboration with the university’s Department of Information Technologies. This article is an overview of their joint projects. Computer processing of texts in Tuvan used to be a difficult task since the Tuvan alphabet is Cyrillic-based, but makes use of three letters absent in Russian - ң, ө and ү which did not have special codes assigned before the arrival of UNICODE. When the spread of UNICODE began in 1990s, Tuvan texts finally could be coded in their entirety. The article provides short summaries and abstracts of databases and software created by Tuva’s researchers in collaborative projects and registered at the Federal Service for Intellectual Property (Rospatent in 2013-2015. All patent rights belong to Tuvan State University. The list includes such pieces of software as “Chastotnyi slovar po khudozhestvennym proizvedeniiam na tuvinskom iazyke” (Frequency dictionary of literary texts in Tuvan language, “Poisk slov v tekste na tuvinskom iazyke” (Word search in Tuvan texts, “Tyva dyl. Sөzүglel. Praktiktig stilistika 10-11 klasstarga өөredilge nomu” (Practical stylistics for 10th and 11th grades, “Leksika landshafta Tuvy” (The vocabulary of Tuvan landscape, CMS “Pisateli Tuvy” (The writers of Tuva, databases “Slovar’ dialektnykh slov altaiskogo dialekta Tuvinskogo iazyka” (A vocabulary of the Altai dialect of Tuvan language, Morfemno-orfograficheskii slovar’ Tuvinskogo iazyka” (Morphemic and orthographic dictionary of Tuvan language, and “Analiticheskie skrepy Tuvinskogo iazyka” (Analytical foundations of Tuvan language Given the rise of mobile
International Nuclear Information System (INIS)
Mehranian, Abolfazl; Kotasidis, Fotis; Zaidi, Habib
2016-01-01
Time-of-flight (TOF) positron emission tomography (PET) technology has recently regained popularity in clinical PET studies for improving image quality and lesion detectability. Using TOF information, the spatial location of annihilation events is confined to a number of image voxels along each line of response, thereby the cross-dependencies of image voxels are reduced, which in turns results in improved signal-to-noise ratio and convergence rate. In this work, we propose a novel approach to further improve the convergence of the expectation maximization (EM)-based TOF PET image reconstruction algorithm through subsetization of emission data over TOF bins as well as azimuthal bins. Given the prevalence of TOF PET, we elaborated the practical and efficient implementation of TOF PET image reconstruction through the pre-computation of TOF weighting coefficients while exploiting the same in-plane and axial symmetries used in pre-computation of geometric system matrix. In the proposed subsetization approach, TOF PET data were partitioned into a number of interleaved TOF subsets, with the aim of reducing the spatial coupling of TOF bins and therefore to improve the convergence of the standard maximum likelihood expectation maximization (MLEM) and ordered subsets EM (OSEM) algorithms. The comparison of on-the-fly and pre-computed TOF projections showed that the pre-computation of the TOF weighting coefficients can considerably reduce the computation time of TOF PET image reconstruction. The convergence rate and bias-variance performance of the proposed TOF subsetization scheme were evaluated using simulated, experimental phantom and clinical studies. Simulations demonstrated that as the number of TOF subsets is increased, the convergence rate of MLEM and OSEM algorithms is improved. It was also found that for the same computation time, the proposed subsetization gives rise to further convergence. The bias-variance analysis of the experimental NEMA phantom and a clinical
The computational design of junctions by carbon nanotube insertion into a graphene matrix
International Nuclear Information System (INIS)
Mao Yuliang; Zhong Jianxin
2009-01-01
Using first-principles density functional theory calculations, two types of junction models constructed from armchair and zigzag carbon nanotube (CNT) insertion into a graphene matrix have been envisioned. It has been found that the insertion of the CNT into the graphene matrix leads to the formation of C-C covalent bonds between graphene and the CNT that distort the CNT geometry. However, the hydrogenation of the suspended carbon bonds on the graphene resumes the graphene-like structure of the pristine tube. The calculated band structure of armchair CNT insertion into graphene or hydrogenation graphene opens up a band gap and converts the metallic CNT into a semiconductor. For the zigzag CNT, the sp 3 hybridization between the graphene and nanotube alters the band structure of the tube significantly, whereas saturating the dangling bonds of terminal carbon atoms of graphene makes the CNT almost keep the same character of the bands as that in the pristine tube. The synthesis of our designed hybrid structures must be increasingly driven by an interest in molecules that not only have intriguing structures but also have special functions such as hydrogen storage.
Finley, Gail T.
1988-01-01
This report covers the study of the relational database implementation in the NASCAD computer program system. The existing system is used primarily for computer aided design. Attention is also directed to a hidden-surface algorithm for final drawing output.
Miyazaki, Yoshinori
2000-01-01
This paper is strongly based on two powerful general theorems proved by Ikebe, et. al in 1993[15] and 1996[13], which will be referred to as Theorem A and Theorem B in this paper. They were recently published and justify the approximate computations of simple eigenvalues of infinite matrices of certain types by truncation, giving an extremely accurate error estimates. So far, they have applied to some important problems in engineering, such as computing the zeros of some special functions, an...
International Nuclear Information System (INIS)
Town, G.G.; Stratton, R.C.
1985-01-01
A computer application system is described which provides nuclear reactor power plant operators with an improved decision support system. This system combines traditional computer applications such as graphics display with artificial intelligence methodologies such as reasoning and diagnosis so as to improve plant operability. This paper discusses the issues, and a solution, involved with the system integration of applications developed using traditional and artificial intelligence languages
International Nuclear Information System (INIS)
Stratton, R.C.; Town, G.G.
1985-01-01
A computer application system is described which provides nuclear reactor power plant operators with an improved decision support system. This system combines traditional computer applications such as graphics display with artifical intelligence methodologies such as reasoning and diagnosis so as to improve plant operability. This paper discusses the issues, and a solution, involved with the system integration of applications developed using traditional and artificial intelligence languages
Goykhburg, M V; Bakhshinyan, V V; Petrova, I P; Wazybok, A; Kollmeier, B; Tavartkiladze, G A
The deterioration of speech intelligibility in the patients using cochlear implantation (CI) systems is especially well apparent in the noisy environment. It explains why phrasal speech tests, such as a Matrix sentence test, have become increasingly more popular in the speech audiometry during rehabilitation after CI. The Matrix test allows to estimate speech perception by the patients in a real life situation. The objective of this study was to assess the effectiveness of audiological rehabilitation of CI patients using the Russian-language version of the matrix test (RUMatrix) in free field in the noisy environment. 33 patients aged from 5 to 40 years with a more than 3 year experience of using cochlear implants inserted at the National Research Center for Audiology and Hearing Rehabilitation were included in our study. Five of these patients were implanted bilaterally. The results of our study showed a statistically significant improvement of speech intelligibility in the noisy environment after the speech processor adjustment; dynamics of the signal-to-noise ratio changes was -1.7 dB (planguages makes possible its application in international multicenter studies.
Massively parallel sparse matrix function calculations with NTPoly
Dawson, William; Nakajima, Takahito
2018-04-01
We present NTPoly, a massively parallel library for computing the functions of sparse, symmetric matrices. The theory of matrix functions is a well developed framework with a wide range of applications including differential equations, graph theory, and electronic structure calculations. One particularly important application area is diagonalization free methods in quantum chemistry. When the input and output of the matrix function are sparse, methods based on polynomial expansions can be used to compute matrix functions in linear time. We present a library based on these methods that can compute a variety of matrix functions. Distributed memory parallelization is based on a communication avoiding sparse matrix multiplication algorithm. OpenMP task parallellization is utilized to implement hybrid parallelization. We describe NTPoly's interface and show how it can be integrated with programs written in many different programming languages. We demonstrate the merits of NTPoly by performing large scale calculations on the K computer.
‘Shift’ ‘n ‘control’: The computer as a third interactant in Spanish-language
Goble, Ryan; Vickers, Caroline H
2015-01-01
The purpose of this paper is to examine the role of the computer in medical consultations in which English- Spanish-bilingual medical providers interact with Spanish-monolingual patients. Following previous studies that have revealed that the presence of the computer in consultations detracts from direct provider– patient communication, we pay specific attention to how the use of the computer in Spanish-language medical consultations can complement or adversely affect the co-construction of the patient’s health narrative. The data for the present study consist of 36 Spanish-language medical consultations in Southern California. Applying a conversation analytical approach to the health narratives in the corpus, we argue that the computer is essentially a third interactant to which medical providers orient through lowered volume, minimal responses, bureaucratic side talk, and, most importantly, code-switching to English – all of which strip the patients of control over the co-construction of their health narrative with their medical provider. Because the patient does not have access to the computational task and the language, we posit that this exacerbates the already existing adverse effects that the computer has on provider–patient interaction.
AbuSeileek, Ali Farhan; Qatawneh, Khaleel
2013-01-01
This study aimed to explore the effects of synchronous and asynchronous computer mediated communication (CMC) oral discussions on question types and strategies used by English as a Foreign Language (EFL) learners. The participants were randomly assigned to two treatment conditions/groups; the first group used synchronous CMC, while the second…
Dracopoulos, Effie; Pichette, François
2011-01-01
This study examined the impact of writing anxiety and computer anxiety on language learning for 45 ESL adult learners enrolled in an English grammar and writing course. Two sections of the course were offered in a traditional classroom setting whereas two others were given in a hybrid form that involved distance learning. Contrary to previous…
Akbulut, Yavuz
2008-01-01
The present study expands the design of Warschauer (1996) surveying freshman foreign language students at a Turkish university. Motivating aspects of computer assisted instruction in terms of writing and e-mailing are explored through an exploratory factor analysis conducted on the survey developed by Warschauer (1996). Findings suggest that…
Ohta, Shinri; Fukui, Naoki; Sakai, Kuniyoshi L
2013-01-01
The nature of computational principles of syntax remains to be elucidated. One promising approach to this problem would be to construct formal and abstract linguistic models that parametrically predict the activation modulations in the regions specialized for linguistic processes. In this article, we review recent advances in theoretical linguistics and functional neuroimaging in the following respects. First, we introduce the two fundamental linguistic operations: Merge (which combines two words or phrases to form a larger structure) and Search (which searches and establishes a syntactic relation of two words or phrases). We also illustrate certain universal properties of human language, and present hypotheses regarding how sentence structures are processed in the brain. Hypothesis I is that the Degree of Merger (DoM), i.e., the maximum depth of merged subtrees within a given domain, is a key computational concept to properly measure the complexity of tree structures. Hypothesis II is that the basic frame of the syntactic structure of a given linguistic expression is determined essentially by functional elements, which trigger Merge and Search. We then present our recent functional magnetic resonance imaging experiment, demonstrating that the DoM is indeed a key syntactic factor that accounts for syntax-selective activations in the left inferior frontal gyrus and supramarginal gyrus. Hypothesis III is that the DoM domain changes dynamically in accordance with iterative Merge applications, the Search distances, and/or task requirements. We confirm that the DoM accounts for activations in various sentence types. Hypothesis III successfully explains activation differences between object- and subject-relative clauses, as well as activations during explicit syntactic judgment tasks. A future research on the computational principles of syntax will further deepen our understanding of uniquely human mental faculties.
LeBlanc, Raymond; Guberman, Solange
1988-01-01
The computer's potential in second language teaching is compared with the reality of commercial programs and teacher training in an effort to separate beliefs from facts. It is concluded that based on recent developments, the computer is about to occupy its rightful place in language teaching. (Author/MSE)
A method for accurate computation of elastic and discrete inelastic scattering transfer matrix
International Nuclear Information System (INIS)
Garcia, R.D.M.; Santina, M.D.
1986-05-01
A method for accurate computation of elastic and discrete inelastic scattering transfer matrices is discussed. In particular, a partition scheme for the source energy range that avoids integration over intervals containing points where the integrand has discontinuous derivative is developed. Five-figure accurate numerical results are obtained for several test problems with the TRAMA program which incorporates the porposed method. A comparison with numerical results from existing processing codes is also presented. (author) [pt
International Nuclear Information System (INIS)
Suzuki, Yoshio; Kushida, Noriyuki; Tatekawa, Takayuki; Teshima, Naoya; Caniou, Yves; Guivarch, Ronan; Dayde, Michel; Ramet, Pierre
2010-01-01
The 'Research and Development of International Matrix-Solver Prediction System (REDIMPS)' project aimed at improving the TLSE sparse linear algebra expert website by establishing an international grid computing environment between Japan and France. To help users in identifying the best solver or sparse linear algebra tool for their problems, we have developed an interoperable environment between French and Japanese grid infrastructures (respectively managed by DIET and AEGIS). Two main issues were considered. The first issue is how to submit a job from DIET to AEGIS. The second issue is how to bridge the difference of security between DIET and AEGIS. To overcome these issues, we developed APIs to communicate between different grid infrastructures by improving the client API of AEGIS. By developing a server deamon program (SeD) of DIET which behaves like an AEGIS user, DIET can call functions in AEGIS: authentication, file transfer, job submission, and so on. To intensify the security, we also developed functionalities to authenticate DIET sites and DIET users in order to access AEGIS computing resources. By this study, the set of software and computers available within TLSE to find an appropriate solver is enlarged over France (DIET) and Japan (AEGIS). (author)
Borensztajn, G.; Zuidema, W.; Carlson, L.; Hoelscher, C.; Shipley, T.F.
2011-01-01
We present a model of the interaction of semantic and episodic memory in language processing. Our work shows how language processing can be understood in terms of memory retrieval. We point out that the perceived dichotomy between rule-based versus exemplar-based language modelling can be
Campiñez, María Dolores; Caraballo, Isidoro; Puchkov, Maxim; Kuentz, Martin
2017-07-01
The aim of the present work was to better understand the drug-release mechanism from sustained release matrices prepared with two new polyurethanes, using a novel in silico formulation tool based on 3-dimensional cellular automata. For this purpose, two polymers and theophylline as model drug were used to prepare binary matrix tablets. Each formulation was simulated in silico, and its release behavior was compared to the experimental drug release profiles. Furthermore, the polymer distributions in the tablets were imaged by scanning electron microscopy (SEM) and the changes produced by the tortuosity were quantified and verified using experimental data. The obtained results showed that the polymers exhibited a surprisingly high ability for controlling drug release at low excipient concentrations (only 10% w/w of excipient controlled the release of drug during almost 8 h). The mesoscopic in silico model helped to reveal how the novel biopolymers were controlling drug release. The mechanism was found to be a special geometrical arrangement of the excipient particles, creating an almost continuous barrier surrounding the drug in a very effective way, comparable to lipid or waxy excipients but with the advantages of a much higher compactability, stability, and absence of excipient polymorphism.
Computational Characterization of Type I collagen-based Extra-cellular Matrix
Liang, Long; Jones, Christopher Allen Rucksack; Lin, Daniel; Jiao, Yang; Sun, Bo
2015-03-01
A model of extracellular matrix (ECM) of collagen fibers has been built, in which cells could communicate with distant partners via fiber-mediated long-range-transmitted stress states. The ECM is modeled as a spring-like fiber network derived from skeletonized confocal microscopy data. Different local and global perturbations have been performed on the network, each followed by an optimized global Monte-Carlo (MC) energy minimization leading to the deformed network in response to the perturbations. In the optimization, a highly efficient local energy update procedure is employed and force-directed MC moves are used, which results in a convergence to the energy minimum state 20 times faster than the commonly used random displacement trial moves in MC. Further analysis and visualization of the distribution and correlation of the resulting force network reveal that local perturbations can give rise to global impacts: the force chains formed with a linear extent much further than the characteristic length scale associated with the perturbation sites and average fiber length. This behavior provides a strong evidence for our hypothesis of fiber-mediated long-range force transmission in ECM networks and the resulting long-range cell-cell mechanical signaling. ASU Seed Grant.
Directory of Open Access Journals (Sweden)
Effie Dracopoulos
2011-04-01
Full Text Available This study examined the impact of writing anxiety and computer anxiety on language learning for 45 ESL adult learners enrolled in an English grammar and writing course. Two sections of the course were offered in a traditional classroom setting whereas two others were given in a hybrid form that involved distance learning. Contrary to previous research, writing anxiety showed no correlation with learning performance, whereas computer anxiety only yielded a positive correlation with performance in the case of classroom learners. There were no significant differences across learning environments on any measures. These observations are discussed in light of the role computer technologies now play in our society as well as the merging of socio-demographic profiles between classroom and distance learners. Our data suggest that comparisons of profiles between classroom and distance learners may not be an issue worth investigating anymore in language studies, at least in developed countries.
Simulation of classical thermal states on a quantum computer: A transfer-matrix approach
International Nuclear Information System (INIS)
Yung, Man-Hong; Nagaj, Daniel; Whitfield, James D.; Aspuru-Guzik, Alan
2010-01-01
We present a hybrid quantum-classical algorithm to simulate thermal states of classical Hamiltonians on a quantum computer. Our scheme employs a sequence of locally controlled rotations, building up the desired state by adding qubits one at a time. We identified a class of classical models for which our method is efficient and avoids potential exponential overheads encountered by Grover-like or quantum Metropolis schemes. Our algorithm also gives an exponential advantage for two-dimensional Ising models with magnetic field on a square lattice, compared with the previously known Zalka's algorithm.
Kesav, Praveen; Vrinda, S L; Sukumaran, Sajith; Sarma, P S; Sylaja, P N
2017-09-15
This study aimed to assess the feasibility of professional based conventional speech language therapy (SLT) either alone (Group A/less intensive) or assisted by novel computer based local language software (Group B/more intensive) for rehabilitation in early post stroke aphasia. Comprehensive Stroke Care Center of a tertiary health care institute situated in South India, with the study design being prospective open randomised controlled trial with blinded endpoint evaluation. This study recruited 24 right handed first ever acute ischemic stroke patients above 15years of age affecting middle cerebral artery territory within 90days of stroke onset with baseline Western Aphasia Battery (WAB) Aphasia Quotient (AQ) score of aphasia. Copyright © 2017 Elsevier B.V. All rights reserved.
Directory of Open Access Journals (Sweden)
Robert M. Bernard
2008-05-01
Full Text Available This study examines the achievement outcomes accompanying the implementation of a Grade 3 laptop or so-called ubiquitous computing program in a Quebec school district. CAT-3 reading, language, and mathematics batteries were administered at the end of Grade 2 and again at the end of Grade 3, after the first year of computer implementation. Overall gain was found in all three content areas, but was differential when compared with the norms of the CAT-3. Additionally, some evidence suggested a differential gain for lower and middle-level learners during the school year. Teachers were administered an instrument called the Technology Implementation Questionnaire (TIQ that assessed the purposes and extent of technology integration. Negative correlations were found in reading achievement gain for items associated with the higher use of communicative, evaluative, and creative uses of computers. Open-ended teacher responses indicated the need for more professional support for instructional implementations of computing. Résumé: Cette étude examine les performances accompagnant l’implantation d’un programme d’ordinateurs portables en 3 ième année du primaire, aussi appelé programme d’ubiquité computationnelle, dans une école d’un district scolaire du Québec. Des batteries de tests, CAT-3 en lecture, en langue et en mathématiques ont été administrées à la fin de la deuxième année du primaire et une autre fois à la fin de la troisième année du primaire, après un an d’implantation des ordinateurs. Un gain fut observé dans les trois matières, mais était différencié lorsque comparé aux normes du CAT-3. De plus, un gain différencié fut mis en évidence pour les apprenants de niveau inférieur et moyen durant l’année scolaire. Les enseignants ont rempli le Technology Implementation Questionnaire (TIQ qui mesure le but et l’étendue de l’intégration technologique. Des corrélations négatives ont été trouvées en
Simoncini, Valeria
2016-01-01
Focusing on special matrices and matrices which are in some sense "near" to structured matrices, this volume covers a broad range of topics of current interest in numerical linear algebra. Exploitation of these less obvious structural properties can be of great importance in the design of efficient numerical methods, for example algorithms for matrices with low-rank block structure, matrices with decay, and structured tensor computations. Applications range from quantum chemistry to queuing theory. Structured matrices arise frequently in applications. Examples include banded and sparse matrices, Toeplitz-type matrices, and matrices with semi-separable or quasi-separable structure, as well as Hamiltonian and symplectic matrices. The associated literature is enormous, and many efficient algorithms have been developed for solving problems involving such matrices. The text arose from a C.I.M.E. course held in Cetraro (Italy) in June 2015 which aimed to present this fast growing field to young researchers, exploit...
Directory of Open Access Journals (Sweden)
Ya-huei Wang
2017-08-01
Full Text Available This study attempted to test whether the use of computer-assisted language learning (CALL and innovative collaborative learning could be more effective than the use of traditional collaborative learning in improving students’ English proficiencies. A true experimental design was used in the study. Four randomly-assigned groups participated in the study: a traditional collaborative learning group (TCLG, 34 students, an innovative collaborative learning group (ICLG, 31 students, a CALL traditional collaborative learning group (CALLTCLG, 32 students, and a CALL innovative collaborative learning group (CALLICLG, 31 students. TOEIC (Test of English for International Communication listening, reading, speaking, and writing pre-test and post-test assessments were given to all students at an interval of sixteen weeks. Multivariate analysis of covariance (MANCOVA, multivariate analysis of variance (MANOVA, and analysis of variance (ANOVA were used to analyze the data. The results revealed that students who used CALL had significantly better learning performance than those who did not. Students in innovative collaborative learning had significantly better learning performances than those in traditional collaborative learning. Additionally, students using CALL innovative collaborative learning had better learning performances than those in CALL collaborative learning, those in innovative collaborative learning, and those in traditional collaborative learning.
Directory of Open Access Journals (Sweden)
Marlene R. Castillo
2015-08-01
Full Text Available The study aimed to determine the relationship between the use of a computer-assisted language learning (CALL software and the TOEFL performance of nursing students. This descriptive study used a pre-test and post-test and a survey questionnaire to gather data. Interviews and observations were also conducted to gain further insights in the use of the software. Results indicate that for the three areas of the TOEFL model practice test, there is a statistically significant increase in the gain scores of the students in the post-test after being exposed to the use of the software for two semesters. They performed well in Sentence Completion and Error Identification, both under Structure and Written Expression. On the other hand, they performed only fairly for Reading Comprehension and Vocabulary. For Structure and Written Expression, the areas of strength included correct choice of main verbs, subject pronouns, and comparative use of adjective while the areas of weaknesses include correlative conjunctions, adverb-related structures, and indefinite subject and verb agreement.
A remote sensing computer-assisted learning tool developed using the unified modeling language
Friedrich, J.; Karslioglu, M. O.
The goal of this work has been to create an easy-to-use and simple-to-make learning tool for remote sensing at an introductory level. Many students struggle to comprehend what seems to be a very basic knowledge of digital images, image processing and image arithmetic, for example. Because professional programs are generally too complex and overwhelming for beginners and often not tailored to the specific needs of a course regarding functionality, a computer-assisted learning (CAL) program was developed based on the unified modeling language (UML), the present standard for object-oriented (OO) system development. A major advantage of this approach is an easier transition from modeling to coding of such an application, if modern UML tools are being used. After introducing the constructed UML model, its implementation is briefly described followed by a series of learning exercises. They illustrate how the resulting CAL tool supports students taking an introductory course in remote sensing at the author's institution.
Evaluation of verifiability in HAL/S. [programming language for aerospace computers
Young, W. D.; Tripathi, A. R.; Good, D. I.; Browne, J. C.
1979-01-01
The ability of HAL/S to write verifiable programs, a characteristic which is highly desirable in aerospace applications, is lacking since many of the features of HAL/S do not lend themselves to existing verification techniques. The methods of language evaluation are described along with the means in which language features are evaluated for verifiability. These methods are applied in this study to various features of HAL/S to identify specific areas in which the language fails with respect to verifiability. Some conclusions are drawn for the design of programming languages for aerospace applications and ongoing work to identify a verifiable subset of HAL/S is described.
Mei, Bing; Brown, Gavin T. L.; Teo, Timothy
2018-01-01
Despite the rapid proliferation of information and communication technologies, there exists a paucity of empirical research on the causes of the current low acceptance of computer-assisted language learning (CALL) by English as a foreign language (EFL) teachers in the People's Republic of China (PRC). This study aims to remedy this situation…
Iriki, Atsushi
2016-03-01
;Language-READY brain; in the title of this article [1] seems to be the expression that the author prefers to use to illustrate his theoretical framework. The usage of the term ;READY; appears to be of extremely deep connotation, for three reasons. Firstly, of course it needs a ;principle; - the depth and the width of the computational theory depicted here is as expected from the author's reputation. However, ;readiness; implies that it is much more than just ;a theory;. That is, such a principle is not static, but it rather has dynamic properties, which are ready to gradually proceed to flourish once brains are put in adequate conditions to make time progressions - namely, evolution and development. So the second major connotation is that this article brought in the perspectives of the comparative primatology as a tool to relativise the language-realizing human brains among other animal species, primates in particular, in the context of evolutionary time scale. The tertiary connotation lies in the context of the developmental time scale. The author claims that it is the interaction of the newborn with its care takers, namely its mother and other family or social members in its ecological conditions, that brings the brain mechanism subserving language faculty to really mature to its final completion. Taken together, this article proposes computational theories and mechanisms of Evo-Devo-Eco interactions for language acquisition in the human brains.
Directory of Open Access Journals (Sweden)
Maria Yu. Lebedeva
2016-11-01
Full Text Available The research explores the effectiveness of using computer-assisted language learning (CALL approach for the development of non-reciprocal listening skills in the context of studying Russian as a foreign language (RFL. Despite the fact that the influence of CALL on the development of listening skills has been well studied based on a case study of teaching other languages (especially English, a similar study in the context of teaching the Russian language is performed for the first time. The RFL students (N=68 and teachers (N=7 of the Preparatory Department in Russian took part in the intervention study. The students were divided into experimental and control groups. The research was conducted based on both qualitative and quantitative methods. The researchers focused the attention on two kinds of listening: listening for general information and selective listening. As the listening competence, and especially academic listening proficiency, is critically important for the students of the preparatory department, he researchers’ target was to research ways of improving listening abilities with different approaches of using CALL. The testing and assessment materials were developed and the statistics was collected for each kind of listening. In addition, the students of the experimental group were surveyed to identify their experiences from using CALL in the classroom. The research findings allowed concluding about the effectiveness of CALL application for developing listening for the detail skills, whereas in the general listening no significant effect was found. In addition, the study revealed specific complexities in the application of CALL in teaching listening in Russian.
Dunn, H. J.
1981-01-01
A computer program for performing frequency analysis of time history data is presented. The program uses circular convolution and the fast Fourier transform to calculate power density spectrum (PDS) of time history data. The program interfaces with the advanced continuous simulation language (ACSL) so that a frequency analysis may be performed on ACSL generated simulation variables. An example of the calculation of the PDS of a Van de Pol oscillator is presented.
Abedi, Jamal
2014-01-01
Among the several forms of accommodations used in the assessment of English language learners (ELLs), language-based accommodations are the most effective in making assessments linguistically accessible to these students. However, there are significant challenges associated with the implementation of many of these accommodations. This article…
Ai, Haiyang
2017-01-01
Corrective feedback (CF), a response to linguistic errors made by second language (L2) learners, has received extensive scholarly attention in second language acquisition. While much of the previous research in the field has focused on whether CF facilitates or impedes L2 development, few studies have examined the efficacy of gradually modifying…
Crossley, Scott A.
2013-01-01
This paper provides an agenda for replication studies focusing on second language (L2) writing and the use of natural language processing (NLP) tools and machine learning algorithms. Specifically, it introduces a range of the available NLP tools and machine learning algorithms and demonstrates how these could be used to replicate seminal studies…
Zwaanenburg, Koos
1989-01-01
The use of an AD 100 computer and the ADSIM language in the six-degree-of-freedom digital simulation of an air-to-ground missile is illustrated. The missile is launched from a moving platform, typically a helicopter, and is capable of striking a mobile target up to 10 kilometers away. The missile could be any tactical missile. The performance numbers of the AD 100 show that it is possible to implement a high performance missile model in a real-time simulation without the problems associated with an implementation on a general purpose computer using FORTRAN.
International Nuclear Information System (INIS)
Boyle, W.G. Jr.; Ryan, D.P.
1979-01-01
These instructions describe how to use BASIC language programs to process data from atomic absorption spectrophotometers using the graphite furnace and the method of additions calibration technique. The instructions cover loading the programs, responding to computer prompts, choosing among various options for processing the data, performing operations with an automatic sampler, and producing reports. How the programs interact with each other is also explained. Examples of computer/operator dialogue are presented for typical cases. In addition, a concise set of operating instructions is included as an appendix
Directory of Open Access Journals (Sweden)
Kevin Durkin
Full Text Available Computer use draws on linguistic abilities. Using this medium thus presents challenges for young people with Specific Language Impairment (SLI and raises questions of whether computer-based tasks are appropriate for them. We consider theoretical arguments predicting impaired performance and negative outcomes relative to peers without SLI versus the possibility of positive gains. We examine the relationship between frequency of computer use (for leisure and educational purposes and educational achievement; in particular examination performance at the end of compulsory education and level of educational progress two years later. Participants were 49 young people with SLI and 56 typically developing (TD young people. At around age 17, the two groups did not differ in frequency of educational computer use or leisure computer use. There were no associations between computer use and educational outcomes in the TD group. In the SLI group, after PIQ was controlled for, educational computer use at around 17 years of age contributed substantially to the prediction of educational progress at 19 years. The findings suggest that educational uses of computers are conducive to educational progress in young people with SLI.
Harbusch, Karin; Itsova, Gergana; Koch, Ulrich; Kuhner, Christine
2009-01-01
We built a natural language processing (NLP) system implementing a "virtual writing conference" for elementary-school children, with German as the target language. Currently, state-of-the-art computer support for writing tasks is restricted to multiple-choice questions or quizzes because automatic parsing of the often ambiguous and fragmentary…
Barasa, Sandra Nekesa
2010-01-01
This book examines the use of language in Computer Mediated Communication (CMC) genres in Kenya. It focuses on Short Messaging Service (SMS), Email, Instant Messages (IM) and Social Network Sites (SNS) genres. It presents an overview of the use and characteristics of Kenyan languages in CMC texts
Zhang, Yujie; Terai, Asuka; Nakagawa, Masanori
2013-01-01
Inductive reasoning under risk conditions is an important thinking process not only for sciences but also in our daily life. From this viewpoint, it is very useful for language learning to construct computational models of inductive reasoning which realize the CAE for foreign languages. This study proposes the comparison of inductive reasoning…
Cardey, Sylviane
2013-01-01
In response to the need for reliable results from natural language processing, this book presents an original way of decomposing a language(s) in a microscopic manner by means of intra/inter‑language norms and divergences, going progressively from languages as systems to the linguistic, mathematical and computational models, which being based on a constructive approach are inherently traceable. Languages are described with their elements aggregating or repelling each other to form viable interrelated micro‑systems. The abstract model, which contrary to the current state of the art works in int
Recent advances in modeling languages for pathway maps and computable biological networks.
Slater, Ted
2014-02-01
As our theories of systems biology grow more sophisticated, the models we use to represent them become larger and more complex. Languages necessarily have the expressivity and flexibility required to represent these models in ways that support high-resolution annotation, and provide for simulation and analysis that are sophisticated enough to allow researchers to master their data in the proper context. These languages also need to facilitate model sharing and collaboration, which is currently best done by using uniform data structures (such as graphs) and language standards. In this brief review, we discuss three of the most recent systems biology modeling languages to appear: BEL, PySB and BCML, and examine how they meet these needs. Copyright © 2014 Elsevier Ltd. All rights reserved.
Janitza, Jean
1985-01-01
A productive language exercise that uses the computer and a variation on the cloze procedure by deleting every third word and requiring the student to insert a grammatically and thematically acceptable term is described. (MSE)
A novel tablet computer platform for advanced language mapping during awake craniotomy procedures.
Morrison, Melanie A; Tam, Fred; Garavaglia, Marco M; Golestanirad, Laleh; Hare, Gregory M T; Cusimano, Michael D; Schweizer, Tom A; Das, Sunit; Graham, Simon J
2016-04-01
A computerized platform has been developed to enhance behavioral testing during intraoperative language mapping in awake craniotomy procedures. The system is uniquely compatible with the environmental demands of both the operating room and preoperative functional MRI (fMRI), thus providing standardized testing toward improving spatial agreement between the 2 brain mapping techniques. Details of the platform architecture, its advantages over traditional testing methods, and its use for language mapping are described. Four illustrative cases demonstrate the efficacy of using the testing platform to administer sophisticated language paradigms, and the spatial agreement between intraoperative mapping and preoperative fMRI results. The testing platform substantially improved the ability of the surgeon to detect and characterize language deficits. Use of a written word generation task to assess language production helped confirm areas of speech apraxia and speech arrest that were inadequately characterized or missed with the use of traditional paradigms, respectively. Preoperative fMRI of the analogous writing task was also assistive, displaying excellent spatial agreement with intraoperative mapping in all 4 cases. Sole use of traditional testing paradigms can be limiting during awake craniotomy procedures. Comprehensive assessment of language function will require additional use of more sophisticated and ecologically valid testing paradigms. The platform presented here provides a means to do so.
International Nuclear Information System (INIS)
Craps, Ben; Evnin, Oleg; Nguyen, Kévin
2017-01-01
Matrix quantum mechanics offers an attractive environment for discussing gravitational holography, in which both sides of the holographic duality are well-defined. Similarly to higher-dimensional implementations of holography, collapsing shell solutions in the gravitational bulk correspond in this setting to thermalization processes in the dual quantum mechanical theory. We construct an explicit, fully nonlinear supergravity solution describing a generic collapsing dilaton shell, specify the holographic renormalization prescriptions necessary for computing the relevant boundary observables, and apply them to evaluating thermalizing two-point correlation functions in the dual matrix theory.
Craps, Ben; Evnin, Oleg; Nguyen, Kévin
2017-02-01
Matrix quantum mechanics offers an attractive environment for discussing gravitational holography, in which both sides of the holographic duality are well-defined. Similarly to higher-dimensional implementations of holography, collapsing shell solutions in the gravitational bulk correspond in this setting to thermalization processes in the dual quantum mechanical theory. We construct an explicit, fully nonlinear supergravity solution describing a generic collapsing dilaton shell, specify the holographic renormalization prescriptions necessary for computing the relevant boundary observables, and apply them to evaluating thermalizing two-point correlation functions in the dual matrix theory.
Energy Technology Data Exchange (ETDEWEB)
Craps, Ben [Theoretische Natuurkunde, Vrije Universiteit Brussel (VUB), and International Solvay Institutes, Pleinlaan 2, B-1050 Brussels (Belgium); Evnin, Oleg [Department of Physics, Faculty of Science, Chulalongkorn University, Thanon Phayathai, Pathumwan, Bangkok 10330 (Thailand); Theoretische Natuurkunde, Vrije Universiteit Brussel (VUB), and International Solvay Institutes, Pleinlaan 2, B-1050 Brussels (Belgium); Nguyen, Kévin [Theoretische Natuurkunde, Vrije Universiteit Brussel (VUB), and International Solvay Institutes, Pleinlaan 2, B-1050 Brussels (Belgium)
2017-02-08
Matrix quantum mechanics offers an attractive environment for discussing gravitational holography, in which both sides of the holographic duality are well-defined. Similarly to higher-dimensional implementations of holography, collapsing shell solutions in the gravitational bulk correspond in this setting to thermalization processes in the dual quantum mechanical theory. We construct an explicit, fully nonlinear supergravity solution describing a generic collapsing dilaton shell, specify the holographic renormalization prescriptions necessary for computing the relevant boundary observables, and apply them to evaluating thermalizing two-point correlation functions in the dual matrix theory.
Arbib, Michael A.
2016-03-01
The target article [6], henceforth TA, had as its main title Towards a Computational Comparative Neuroprimatology. This unpacks into three claims: Comparative Primatology: If one wishes to understand the behavior of any one primate species (whether monkey, ape or human - TA did not discuss, e.g., lemurs but that study could well be of interest), one will gain new insight by comparing behaviors across species, sharpening one's analysis of one class of behaviors by analyzing similarities and differences between two or more species.
THE MIGHT OF RUSSIAN LANGUAGE ACCORDING TO SYNONYMIC DICTIONARY BY COMPUTER EVALUATION SYSTEM ASIS®
Directory of Open Access Journals (Sweden)
Vitaly N. Trishin
2013-01-01
Full Text Available The article describes electronic dictionary of synonyms in Russian language by ASIS® system (more than 500 000 words and collocations, 190 000 synonymic connections.The program can be used not just as a dictionary of synonyms and close meaning words, but also as spelling dictionary and definition dictionary of Russian language in order to check the orthography and define the meaning of unknown words. The dictionary is also designed to be an instrument of philological surveys and studies of the language trough the extensive query system on different characteristic of words (definition, composition, synonymy, etc.. Program’s lexical base includes words from dictionaries and guides in all subject areas - from astronomy to Japanese painting. Over compilation of dictionary developer used published dictionaries: spelling, synonymic, definition dictionaries, dictionary of collocations, dictionary of foreign words and etc. of 19-21 cc. Newspapers, magazines and web-resources were active used as well for appending the dictionary. This dictionary practically shows, that by the amount of words Russian language belongs with the most developed languages in the world, and by the scale and density of synonymic space, in the author’s opinion, it has no equal.
Energy Technology Data Exchange (ETDEWEB)
Matenine, D; Cote, G; Mascolo-Fortin, J [Universite Laval, Quebec, QC (Canada); Goussard, Y [Ecole Polytechnique de Montreal, Montreal, QC (Canada); Despres, P [Universite Laval, Quebec, QC (Canada); Departement de radio-oncologie and Centre de recherche du CHU de Quebec, Quebec, QC (Canada)
2016-06-15
Purpose: Iterative reconstruction algorithms in computed tomography (CT) require a fast method for computing the intersections between the photons’ trajectories and the object, also called ray-tracing or system matrix computation. This work evaluates different ways to store the system matrix, aiming to reconstruct dense image grids in reasonable time. Methods: We propose an optimized implementation of the Siddon’s algorithm using graphics processing units (GPUs) with a novel data storage scheme. The algorithm computes a part of the system matrix on demand, typically, for one projection angle. The proposed method was enhanced with accelerating options: storage of larger subsets of the system matrix, systematic reuse of data via geometric symmetries, an arithmetic-rich parallel code and code configuration via machine learning. It was tested on geometries mimicking a cone beam CT acquisition of a human head. To realistically assess the execution time, the ray-tracing routines were integrated into a regularized Poisson-based reconstruction algorithm. The proposed scheme was also compared to a different approach, where the system matrix is fully pre-computed and loaded at reconstruction time. Results: Fast ray-tracing of realistic acquisition geometries, which often lack spatial symmetry properties, was enabled via the proposed method. Ray-tracing interleaved with projection and backprojection operations required significant additional time. In most cases, ray-tracing was shown to use about 66 % of the total reconstruction time. In absolute terms, tracing times varied from 3.6 s to 7.5 min, depending on the problem size. The presence of geometrical symmetries allowed for non-negligible ray-tracing and reconstruction time reduction. Arithmetic-rich parallel code and machine learning permitted a modest reconstruction time reduction, in the order of 1 %. Conclusion: Partial system matrix storage permitted the reconstruction of higher 3D image grid sizes and larger
International Nuclear Information System (INIS)
Matenine, D; Cote, G; Mascolo-Fortin, J; Goussard, Y; Despres, P
2016-01-01
Purpose: Iterative reconstruction algorithms in computed tomography (CT) require a fast method for computing the intersections between the photons’ trajectories and the object, also called ray-tracing or system matrix computation. This work evaluates different ways to store the system matrix, aiming to reconstruct dense image grids in reasonable time. Methods: We propose an optimized implementation of the Siddon’s algorithm using graphics processing units (GPUs) with a novel data storage scheme. The algorithm computes a part of the system matrix on demand, typically, for one projection angle. The proposed method was enhanced with accelerating options: storage of larger subsets of the system matrix, systematic reuse of data via geometric symmetries, an arithmetic-rich parallel code and code configuration via machine learning. It was tested on geometries mimicking a cone beam CT acquisition of a human head. To realistically assess the execution time, the ray-tracing routines were integrated into a regularized Poisson-based reconstruction algorithm. The proposed scheme was also compared to a different approach, where the system matrix is fully pre-computed and loaded at reconstruction time. Results: Fast ray-tracing of realistic acquisition geometries, which often lack spatial symmetry properties, was enabled via the proposed method. Ray-tracing interleaved with projection and backprojection operations required significant additional time. In most cases, ray-tracing was shown to use about 66 % of the total reconstruction time. In absolute terms, tracing times varied from 3.6 s to 7.5 min, depending on the problem size. The presence of geometrical symmetries allowed for non-negligible ray-tracing and reconstruction time reduction. Arithmetic-rich parallel code and machine learning permitted a modest reconstruction time reduction, in the order of 1 %. Conclusion: Partial system matrix storage permitted the reconstruction of higher 3D image grid sizes and larger
Najbauer, Eszter E.; Bazsó, Gábor; Apóstolo, Rui; Fausto, Rui; Biczysko, Malgorzata; Barone, Vincenzo; Tarczay, György
2018-01-01
The conformers of α-serine were investigated by matrix-isolation IR spectroscopy combined with NIR laser irradiation. This method, aided by 2D correlation analysis, enabled unambiguously grouping the spectral lines to individual conformers. On the basis of comparison of at least nine experimentally observed vibrational transitions of each conformer with empirically scaled (SQM) and anharmonic (GVPT2) computed IR spectra, 6 conformers were identified. In addition, the presence of at least one more conformer in Ar matrix was proved, and a short-lived conformer with a half-live of (3.7±0.5)·103 s in N2 matrix was generated by NIR irradiation. The analysis of the NIR laser induced conversions revealed that the excitation of the stretching overtone of both the side-chain and the carboxylic OH groups can effectively promote conformational changes, but remarkably different paths were observed for the two kinds of excitations. PMID:26201050
International Nuclear Information System (INIS)
Boyle, W.G. Jr.; Ryan, D.P.
1979-08-01
There are four computer programs, written in the BASIC language, used for taking and processing data from an atomic absorption spectrophotometer using the graphite furnace and the method of additions for calibration. The programs chain to each other and are divided into logical sections that have been flow-charted. The chaining sequences, general features, structure, order of subroutines and functions, and the storage of data are discussed. In addition, variables are listed and defined, and a complete listing of each program with a symbol occurrence table is provided
1988-07-08
Marcus and C. Baczynski), Computer Science Press, Rockville, Maryland, 1986. 3. An Introduction to Pascal and Precalculus , Computer Science Press...Science Press, Rockville, Maryland, 1986. 35. An Introduction to Pascal and Precalculus , Computer Science Press, Rockville, Maryland, 1986. 36
1987-04-01
facilities. BBN is developing a series of increasingly sophisticated natural language understanding systems which will serve as an integrated interface...Haas, A.R. A Syntactic Theory of Belief and Action. Artificial Intelligence. 1986. Forthcoming. [6] Hinrichs, E. Temporale Anaphora im Englischen
The World Center for Computing's Pilot Videodisc Project for French Language Instruction.
Eastmond, J. Nicholls, Jr.; Mosenthal, Richard
1985-01-01
Describes a pilot videodisc project for French language instruction. Unique features include (1) learner control of instruction by a mouse or touch-sensitive screen, (2) extensive cultural interaction, and (3) an elaborate lexicon of word meanings portrayed visually for selected key words. (Author/SED)
Syntactic Complexity Metrics and the Readability of Programs in a Functional Computer Language
van den Berg, Klaas; Engel, F.L.; Bouwhuis, D.G.; Bosser, T.; d'Ydewalle, G.
This article reports on the defintion and the measutement of the software complexity metrics of Halstead and McCabe for programs written in the functional programming language Miranda. An automated measurement of these metrics is described. In a case study, the correlation is established between the
Computer Testing as a Form of Accommodation for English Language Learners
Abedi, Jamal
2009-01-01
This study compared performance of both English language learners (ELLs) and non-ELL students in Grades 4 and 8 under accommodated and nonaccommodated testing conditions. The accommodations used in this study included a computerized administration of a math test with a pop-up glossary, a customized English dictionary, extra testing time, and…
Sanz, Ana Gimeno; Pavón, Ana Sevilla
2015-01-01
In 2008 the Spanish Government announced the inclusion of an oral section in the foreign language exam of the National University Entrance Examination during the year 2012 (Royal Decree 1892/2008, of 14 November 2008, Ministerio de Educación, Gobierno de España, 2008). Still awaiting the implementation of these changes, and in an attempt to offer…
Jalali, Sara; Panahzade, Vahid
2014-01-01
The advent of modern technologies has had a remarkable role in revolutionizing the classroom setting. It is, therefore, incumbent on teachers to utilize strategies for effective managing of the change. The aim of the present study was to find out English as a Foreign Language (EFL) teachers' beliefs regarding classroom management. In so doing, the…
Penn-Edwards, Sorrel
2015-01-01
This paper argues that the use of metaphoric language is common in non-literary fields of learning. Considering its potential for application as evidenced by reference in books, journal papers, e-zine discussions and blogs, and the historical time over which metaphors have been engaged in rhetoric, it is surprising that there is little allusion to…
Matusevych, Y.; Alishahi, A.; Backus, A.M.; Bello, P.; Guarini, M.; McShane, M.; Scassellati, B.
2014-01-01
The study of second language acquisition (SLA) is often hindered by substantial variability in the background of learners, their learning process and the input they receive. This diversity often makes it difficult to isolate specific learning factors and study their impact on L2 development. We
Ethical Issues in Computer-Assisted Language Learning: Perceptions of Teachers and Learners
Wang, Shudong; Heffernan, Neil
2010-01-01
Pedagogical theories and the applications of information technology for language learning have been widely researched in various dimensions. However, ethical issues, such as online privacy and security, and learners' personal data disclosure, are not receiving enough research attention. The perceptions and attitudes from those who participate in…
Interpreting beyond Syntactics: A Semiotic Learning Model for Computer Programming Languages
May, Jeffrey; Dhillon, Gurpreet
2009-01-01
In the information systems field there are numerous programming languages that can be used in specifying the behavior of concurrent and distributed systems. In the literature it has been argued that a lack of pragmatic and semantic consideration decreases the effectiveness of such specifications. In other words, to simply understand the syntactic…
Effect of the green/blue flicker matrix for P300-based brain–computer interface: an EEG–fMRI study.
Directory of Open Access Journals (Sweden)
Shiro eIkegami
2012-07-01
Full Text Available The visual P300 brain–computer interface (BCI, a popular system for EEG-based BCI, utilizes the P300 event-related potential to select an icon arranged in a flicker matrix. In the conventional P300 BCI speller paradigm, white/gray luminance intensification of each row/column in the matrix is used. In an earlier study, we applied green/blue luminance and chromatic change in the P300 BCI system and reported that this luminance and chromatic flicker matrix was associated with better performance and greater subject comfort compared with the conventional white/gray luminance flicker matrix. In this study, we used simultaneous EEG-fMRI recordings to identify brain areas that were more enhanced in the green/blue flicker matrix than in the white/gray flicker matrix, as these may highlight areas devoted to improved P300-BCI performance. The peak of the positive wave in the EEG data was detected under both conditions, and the peak amplitudes were larger at the parietal and occipital electrodes, particularly in the late components, under the green/blue condition than under the white/gray condition. fMRI data showed activation in the bilateral parietal and occipital cortices, and these areas, particularly those in the right hemisphere, were more activated under the green/blue condition than under the white/gray condition. The parietal and occipital regions more involved in the green/blue condition were part of the areas devoted to conventional P300s. These results suggest that the green/blue flicker matrix was useful for enhancing the so-called P300 responses.
International Nuclear Information System (INIS)
Yang, C L; Wei, H Y; Soleimani, M; Adler, A
2013-01-01
Electrical impedance tomography (EIT) is a fast and cost-effective technique to provide a tomographic conductivity image of a subject from boundary current–voltage data. This paper proposes a time and memory efficient method for solving a large scale 3D EIT inverse problem using a parallel conjugate gradient (CG) algorithm. The 3D EIT system with a large number of measurement data can produce a large size of Jacobian matrix; this could cause difficulties in computer storage and the inversion process. One of challenges in 3D EIT is to decrease the reconstruction time and memory usage, at the same time retaining the image quality. Firstly, a sparse matrix reduction technique is proposed using thresholding to set very small values of the Jacobian matrix to zero. By adjusting the Jacobian matrix into a sparse format, the element with zeros would be eliminated, which results in a saving of memory requirement. Secondly, a block-wise CG method for parallel reconstruction has been developed. The proposed method has been tested using simulated data as well as experimental test samples. Sparse Jacobian with a block-wise CG enables the large scale EIT problem to be solved efficiently. Image quality measures are presented to quantify the effect of sparse matrix reduction in reconstruction results. (paper)
Yang, C L; Wei, H Y; Adler, A; Soleimani, M
2013-06-01
Electrical impedance tomography (EIT) is a fast and cost-effective technique to provide a tomographic conductivity image of a subject from boundary current-voltage data. This paper proposes a time and memory efficient method for solving a large scale 3D EIT inverse problem using a parallel conjugate gradient (CG) algorithm. The 3D EIT system with a large number of measurement data can produce a large size of Jacobian matrix; this could cause difficulties in computer storage and the inversion process. One of challenges in 3D EIT is to decrease the reconstruction time and memory usage, at the same time retaining the image quality. Firstly, a sparse matrix reduction technique is proposed using thresholding to set very small values of the Jacobian matrix to zero. By adjusting the Jacobian matrix into a sparse format, the element with zeros would be eliminated, which results in a saving of memory requirement. Secondly, a block-wise CG method for parallel reconstruction has been developed. The proposed method has been tested using simulated data as well as experimental test samples. Sparse Jacobian with a block-wise CG enables the large scale EIT problem to be solved efficiently. Image quality measures are presented to quantify the effect of sparse matrix reduction in reconstruction results.
Langenbucher, Frieder
2005-01-01
A linear system comprising n compartments is completely defined by the rate constants between any of the compartments and the initial condition in which compartment(s) the drug is present at the beginning. The generalized solution is the time profiles of drug amount in each compartment, described by polyexponential equations. Based on standard matrix operations, an Excel worksheet computes the rate constants and the coefficients, finally the full time profiles for a specified range of time values.
Challe, Odile; And Others
1985-01-01
Describes a French project entitled "Lecticiel," jointly undertaken by specialists in reading, computer programing, and second language instruction to integrate these disciplines and provide assistance for students learning to read French as a foreign language. (MSE)
International Nuclear Information System (INIS)
Cavadia, I.C.
1968-06-01
The Sprint/1 system is indented for real-time production of present day computers and can be used by persons without a special preparation in the programming field. All input operations (instructions, comments, data) and corresponding output operations (printing of results and diagnostics) are done by a type-writer. It assures a bidirectional communication between the user and his program during its execution, the user indicating to the computer each step that must be performed to resolve the problem. At the same time the machine immediately flags the detection of a syntax or semantic error which allows him to correct or to improve his program immediately. It should be emphasized that the language is an evolutive one. Each introduced instruction enriches the language, the user having the possibility to easily build complex structures from very simple expressions. Thus he can make a general study of the behaviour of a dynamic learning process of the machine which constitutes one of the characteristics of artificial intelligence. (author) [fr
Laboratory process control using natural language commands from a personal computer
Will, Herbert A.; Mackin, Michael A.
1989-01-01
PC software is described which provides flexible natural language process control capability with an IBM PC or compatible machine. Hardware requirements include the PC, and suitable hardware interfaces to all controlled devices. Software required includes the Microsoft Disk Operating System (MS-DOS) operating system, a PC-based FORTRAN-77 compiler, and user-written device drivers. Instructions for use of the software are given as well as a description of an application of the system.
Assessing Affordances of Selected Cloud Computing Tools for Language Teacher Education in Nigeria
Ofemile, Abdulmalik Yusuf
2015-01-01
This paper reports part of a study that hoped to understand Teacher Educators' (TE) assessment of the affordances of selected cloud computing tools ranked among the top 100 for the year 2010. Research has shown that ICT and by extension cloud computing has positive impacts on daily life and this informed the Nigerian government's policy to…
Bucks, Gregory Warren
2010-01-01
Computers have become an integral part of how engineers complete their work, allowing them to collect and analyze data, model potential solutions and aiding in production through automation and robotics. In addition, computers are essential elements of the products themselves, from tennis shoes to construction materials. An understanding of how…
International Nuclear Information System (INIS)
Wachter, J.W.
1986-05-01
PRO/Mapper is an application for the Digital Equipment Corporation PRO/300 series of personal computers that facilitates the preparation of visuals such as graphs, charts, and maps in color or black and white. The user prepares an input data file containing English-language commands and writes it into a file using standard editor. PRO/Mapper then reads these files and draws graphs, maps, boxes, and complex line segments onto the computer screen. Axes, curves, and error bars may be plotted in graphical presentations. The commands of PRO/Mapper are a subset of the commands of the more sophisticated MAPPER program written for mainframe computers. The PRO/Mapper commands were chosen primarily for the production of linear graphs. Command files written for the PRO/300 are upward compatible with the Martin Marietta Energy Systems version of MAPPER and can be used to produce publication-quality slides, drawings, and maps on the various output devices of the Oak Ridge National Laboratory mainframe computers
DEFF Research Database (Denmark)
Ager, Mads Sig; Danvy, Olivier; Midtgaard, Jan
2005-01-01
We extend our correspondence between evaluators and abstract machines from the pure setting of the lambda-calculus to the impure setting of the computational lambda-calculus. We show how to derive new abstract machines from monadic evaluators for the computational lambda-calculus. Starting from (1......) a generic evaluator parameterized by a monad and (2) a monad specifying a computational effect, we inline the components of the monad in the generic evaluator to obtain an evaluator written in a style that is specific to this computational effect. We then derive the corresponding abstract machine by closure......-converting, CPS-transforming, and defunctionalizing this specific evaluator. We illustrate the construction first with the identity monad, obtaining the CEK machine, and then with a lifting monad, a state monad, and with a lifted state monad, obtaining variants of the CEK machine with error handling, state...
Boulton , Alex
2011-01-01
International audience; This paper outlines how corpora (in printed, electronic or multi-modal form) can be used in language learning, an area often referred to as "data-driven learning" or DDL (Johns 1991). The alleged advantages are numerous, but are in need of empirical support which is frequently claimed to be lacking in the field. However, over 80 studies have so far attempted to evaluate some aspect of corpus use by non-native speakers (Boulton 2010): these are briefly reviewed as a who...
THIRD GENERATION TELEPHONY: NEW TECHNOLOGICAL SUPPORT FOR COMPUTER ASSISTED LANGUAGE LEARNING
Directory of Open Access Journals (Sweden)
Jose Carlos Garcia Cabrero
2002-06-01
Full Text Available The expansion of the lnternet has Ied to the development of distance teaching models based on the net (e learning. One of the crucial factors in this phenomenon is the continuous training required by workers to maintain or improve their professional skills. Foreign languages are, without doubt, one of the most in demand subjects. This is because they are needed for comunication in an increasingly globalized world.
The development of new wireless communication technologies, UMTS or 3G nets, and their corresponding access terminals (Palm-size PCs, PPCs, with wireless telephone connection. also called smart-phones. will enable solutions to be found for some of the problems Iaeed hy current e-learning users. These problems include access speed and the physical constraints of tlhe ( The new wireless comunication technologies will bring other benefits like portability. always on-line, etc.
This article presents one on' the world's first prototypes of language learning software or smart-phones, produced by the Laboratorio de lngenieria Didactica e lngenieria Linguistica of UNED (Didactic Engineering and Linguistic Engineering Laboratory (LIDIL, http://www.vip.~ined.es. i¿le Enl
International Nuclear Information System (INIS)
Grigoriev, Y.A.; Petrosyan, A.I.; Penzyakov, V.V.; Pimenov, V.G.; Rogovin, V.I.; Shesterkin, V.I.; Kudryashov, V.P.; Semyonov, V.C.
1997-01-01
The experimental study of matrix carbon field-emission cathodes (MCFECs), which has led to the stable operation of the cathodes with current emission values up to 100 mA, is described. A method of computer aided design of TWT electron guns (EGs) with MCFEC, based on the results of the MCFEC emission experimental study, is presented. The experimental MCFEC emission characteristics are used to define the field gain coefficient K and the cathode effective emission area S eff . The EG program computes the electric field upon the MCFEC surface, multiplies it by the K value and uses the Fowler Nordheim law and the S eff value to calculate the MCFEC current; the electron trajectories are computed as well. copyright 1997 American Vacuum Society
Lu, Qian
2017-07-01
Exploring language universal is one of the major goals of linguistic researches, which are largely devoted to answering the ;Platonic questions; in linguistics, that is, what is the language knowledge, how to get and use this knowledge. However, if solely guided by linguistic intuition, it is very difficult for syntactic studies to answer these questions, or to achieve abstractions in the scientific sense. This suggests that linguistic analyses based on the probability theory may provide effective ways to investigate into language universals in terms of biological motivations or cognitive psychological mechanisms. With the view that ;Language is a human-driven system;, Liu, Xu & Liang's review [1] pointed out that dependency distance minimization (DDM), which has been corroborated by big data analysis of corpus, may be a language universal shaped in language evolution, a universal that has profound effect on syntactic patterns.
International Nuclear Information System (INIS)
Reis, S.C. dos; Lage, A.F.; Braga, D.; Ferraz, W.B.
2006-01-01
Plate type fuel elements have high efficiency of thermal transference what benefits the heat flux with high rates of power output. In reactor cores, fuel elements, in general, are subject to a high neutrons flux, high working temperatures, severe corrosion conditions, direct interference of fission products that result from nuclear reactions and radiation interaction-matter. For plate type fuels composed of ceramic particles dispersed in metallic matrix, one can observe the damage regions that arise due to the interaction fission products in the metallic matrix. Aiming at evaluating the extension of the damage regions in function of the particles and its diameters, in this paper, computational geometric simulations structure of plate type fuel cores, composed of UO 2 microspheres dispersed in stainless steel in several fractions of volume and diameters were carried out. The results of the simulations were exported to AutoCAD R where it was possible its visualization and analysis. (author)
COMPARISON OF PYTHON (AN OPEN SOURCE PROGRAMMING LANGUAGE) WITH OTHER PROGRAMMING LANGUAGES
Sushil Kumar*1 & Richa Aggarwal2
2018-01-01
Language is a communication tool through which we can communicate with each other like Hindi, English etc any other language. So if we want to communicate with computer, we need computer programming languages. So in computer we have two types of languages, one is low level language which is easily understood by computer but difficult to learn. Second is high level language which is same like English language, not understood by computer but easy to learn. Python is a high level language. This...
Hucka, M; Finney, A; Bornstein, B J; Keating, S M; Shapiro, B E; Matthews, J; Kovitz, B L; Schilstra, M J; Funahashi, A; Doyle, J C; Kitano, H
2004-06-01
Biologists are increasingly recognising that computational modelling is crucial for making sense of the vast quantities of complex experimental data that are now being collected. The systems biology field needs agreed-upon information standards if models are to be shared, evaluated and developed cooperatively. Over the last four years, our team has been developing the Systems Biology Markup Language (SBML) in collaboration with an international community of modellers and software developers. SBML has become a de facto standard format for representing formal, quantitative and qualitative models at the level of biochemical reactions and regulatory networks. In this article, we summarise the current and upcoming versions of SBML and our efforts at developing software infrastructure for supporting and broadening its use. We also provide a brief overview of the many SBML-compatible software tools available today.
ZettaBricks: A Language Compiler and Runtime System for Anyscale Computing
Energy Technology Data Exchange (ETDEWEB)
Amarasinghe, Saman [Massachusetts Inst. of Technology (MIT), Cambridge, MA (United States)
2015-03-27
This grant supported the ZettaBricks and OpenTuner projects. ZettaBricks is a new implicitly parallel language and compiler where defining multiple implementations of multiple algorithms to solve a problem is the natural way of programming. ZettaBricks makes algorithmic choice a first class construct of the language. Choices are provided in a way that also allows our compiler to tune at a finer granularity. The ZettaBricks compiler autotunes programs by making both fine-grained as well as algorithmic choices. Choices also include different automatic parallelization techniques, data distributions, algorithmic parameters, transformations, and blocking. Additionally, ZettaBricks introduces novel techniques to autotune algorithms for different convergence criteria. When choosing between various direct and iterative methods, the ZettaBricks compiler is able to tune a program in such a way that delivers near-optimal efficiency for any desired level of accuracy. The compiler has the flexibility of utilizing different convergence criteria for the various components within a single algorithm, providing the user with accuracy choice alongside algorithmic choice. OpenTuner is a generalization of the experience gained in building an autotuner for ZettaBricks. OpenTuner is a new open source framework for building domain-specific multi-objective program autotuners. OpenTuner supports fully-customizable configuration representations, an extensible technique representation to allow for domain-specific techniques, and an easy to use interface for communicating with the program to be autotuned. A key capability inside OpenTuner is the use of ensembles of disparate search techniques simultaneously; techniques that perform well will dynamically be allocated a larger proportion of tests.
Hussmann, Katja; Grande, Marion; Meffert, Elisabeth; Christoph, Swetlana; Piefke, Martina; Willmes, Klaus; Huber, Walter
2012-01-01
Although generally accepted as an important part of aphasia assessment, detailed analysis of spontaneous speech is rarely carried out in clinical practice mostly due to time limitations. The Aachener Sprachanalyse (ASPA; Aachen Speech Analysis) is a computer-assisted method for the quantitative analysis of German spontaneous speech that allows for…
Computer-Assisted Learning for the Hearing Impaired: An Interactive Written Language Enviroment.
Ward, R. D.; Rostron, A. B.
1983-01-01
To help hearing-impaired children develop their linguistic competence, a computer system that can process sentences and give feedback about their acceptability was developed. Suggestions are made of ways to use the system as an environment for interactive written communication. (Author/CL)
Symons, Duncan; Pierce, Robyn
2015-01-01
In this study we examine the use of cumulative and exploratory talk types in a year 5 computer supported collaborative learning environment. The focus for students in this environment was to participate in mathematical problem solving, with the intention of developing the proficiencies of problem solving and reasoning. Findings suggest that…
Teaching Computer Languages and Elementary Theory for Mixed Audiences at University Level
DEFF Research Database (Denmark)
Christiansen, Henning
2004-01-01
Theoretical issues of computer science are traditionally taught in a way that presupposes a solid mathematical background and are usually considered more or less unaccessible for students without this. An effective methodology is described which has been developed for a target group of university...... into a learning-by-doing approach having the students to develop such descriptions themselves from an informal introduction....
Teaching Computer Languages and Elementary Theory for Mixed Audiences at University Level
DEFF Research Database (Denmark)
Christiansen, Henning
Theoretical issues of computer science are traditionally taught in a way that presupposes a solid mathematical background and are usually considered more or less unaccessible for students without this. An effective methodology is described which has been developed for a target group of university...... into a learning-by-doing approach having the students to develop such descriptions themselves from an informal introduction....
Borgdorff, J.; Bona-Casas, C.; Mamonski, M.; Kurowski, K.; Piontek, T.; Bosak, B.; Rycerz, K.; Ciepiela, E.; Gubala, T.; Harezlak, D.; Bubak, M.; Lorenz, E.; Hoekstra, A.G.
2012-01-01
Nature is observed at all scales; with multiscale modeling, scientists bring together several scales for a holistic analysis of a phenomenon. The models on these different scales may require significant but also heterogeneous computational resources, creating the need for distributed multiscale
Mohr, Stephan; Dawson, William; Wagner, Michael; Caliste, Damien; Nakajima, Takahito; Genovese, Luigi
2017-10-10
We present CheSS, the "Chebyshev Sparse Solvers" library, which has been designed to solve typical problems arising in large-scale electronic structure calculations using localized basis sets. The library is based on a flexible and efficient expansion in terms of Chebyshev polynomials and presently features the calculation of the density matrix, the calculation of matrix powers for arbitrary powers, and the extraction of eigenvalues in a selected interval. CheSS is able to exploit the sparsity of the matrices and scales linearly with respect to the number of nonzero entries, making it well-suited for large-scale calculations. The approach is particularly adapted for setups leading to small spectral widths of the involved matrices and outperforms alternative methods in this regime. By coupling CheSS to the DFT code BigDFT, we show that such a favorable setup is indeed possible in practice. In addition, the approach based on Chebyshev polynomials can be massively parallelized, and CheSS exhibits excellent scaling up to thousands of cores even for relatively small matrix sizes.
Directory of Open Access Journals (Sweden)
Leif E. Peterson
1997-11-01
Full Text Available A computer program for multifactor relative risks, confidence limits, and tests of hypotheses using regression coefficients and a variance-covariance matrix obtained from a previous additive or multiplicative regression analysis is described in detail. Data used by the program can be stored and input from an external disk-file or entered via the keyboard. The output contains a list of the input data, point estimates of single or joint effects, confidence intervals and tests of hypotheses based on a minimum modified chi-square statistic. Availability of the program is also discussed.
Measuring attitudes towards nuclear and technological risks (computer programs in SPSS language)
International Nuclear Information System (INIS)
Leonin, T.V. Jr.
1981-04-01
A number of methodologies have been developed for measuring public attitudes towards nuclear and other technological risks. The Fishbein model, as modified by the IAEA Risk Assessment group, and which was found to be applicable for Philippine public attitude measurements, is briefly explained together with two other models which are utilized for comparative correlations. A step by step guide on the procedures involved and the calculations required in measuring and analyzing attitude using these models is likewise described, with special emphasis on the computer processing aspect. The use of the Statistical Package for the Social Sciences (SPSS) in the analysis is also described and a number of computer programs in SPSS for the various statistical calculations required in the analysis is presented. (author)
INTERCULTURAL COMMUNICATION PATTERNS AND LANGUAGE USE IN COMPUTER MEDIATED-COMMUNICATION
Adriana Teodorescu
2012-01-01
This paper aims at analyzing the degree to which intercultural communication patterns are embedded in computer-mediated communication. Drawing on Hall's and Hofstede's intercultural communication dimensions, this study evaluates empirically high-versus-low context cultural orientations as reflected in the electronic medium, namely the blog, in three different cultures. Cultural variation is also analyzed in linguistic features and communication style in a synchronous mode of communication, by...
Vinney, Lisa A; Howles, Les; Leverson, Glen; Connor, Nadine P
2016-08-01
This study examined whether undergraduate college students' immediate recall and longer-term retention of introductory voice disorder concepts improved by using mini quiz games (MQGs; interactive knowledge tests in game format) compared with (a) traditional study alone, (b) MQGs and traditional study together, or (c) a no-study control condition. Ninety-three college students participated in proctored sessions in which they were given a pretest, viewed an online lecture on introductory voice disorder concepts, and then engaged in either no intervention or interventions including traditional study, MQG play, or both MQG play and traditional study, followed by an immediate recall posttest and longer-term retention follow-up test. Analyses suggested that the effects of all interventions (traditional study, MQG play, and the combination of the 2) were equivalent and resulted in significantly greater improvements from pretest to immediate recall posttest performance than the control condition. In contrast, MQGs and MQGs with traditional study, but not traditional study alone, showed better results for long-term retention than no study. Results provide preliminary support for the idea that there may be multiple effective learning modes, beyond traditional study, that enhance recall and retention of knowledge foundational to speech-language pathology clinical training and practice.
Energetic arousal and language: predictions from the computational theory of quantifiers processing.
Zajenkowski, Marcin
2013-10-01
The author examines the relationship between energetic arousal (EA) and the processing of sentences containing natural-language quantifiers. Previous studies and theories have shown that energy may differentially affect various cognitive functions. Recent investigations devoted to quantifiers strongly support the theory that various types of quantifiers involve different cognitive functions in the sentence-picture verification task. In the present study, 201 students were presented with a sentence-picture verification task consisting of simple propositions containing a quantifier that referred to the color of a car on display. Color pictures of cars accompanied the propositions. In addition, the level of participants' EA was measured before and after the verification task. It was found that EA and performance on proportional quantifiers (e.g., "More than half of the cars are red") are in an inverted U-shaped relationship. This result may be explained by the fact that proportional sentences engage working memory to a high degree, and previous models of EA-cognition associations have been based on the assumption that tasks that require parallel attentional and memory processes are best performed when energy is moderate. The research described in the present article has several applications, as it shows the optimal human conditions for verbal comprehension. For instance, it may be important in workplace design to control the level of arousal experienced by office staff when work is mostly related to the processing of complex texts. Energy level may be influenced by many factors, such as noise, time of day, or thermal conditions.
International Nuclear Information System (INIS)
Bedini, Andrea; Jacobsen, Jesper Lykke
2010-01-01
Combining tree decomposition and transfer matrix techniques provides a very general algorithm for computing exact partition functions of statistical models defined on arbitrary graphs. The algorithm is particularly efficient in the case of planar graphs. We illustrate it by computing the Potts model partition functions and chromatic polynomials (the number of proper vertex colourings using Q colours) for large samples of random planar graphs with up to N = 100 vertices. In the latter case, our algorithm yields a sub-exponential average running time of ∼ exp(1.516√N), a substantial improvement over the exponential running time ∼exp (0.245N) provided by the hitherto best-known algorithm. We study the statistics of chromatic roots of random planar graphs in some detail, comparing the findings with results for finite pieces of a regular lattice.
International Nuclear Information System (INIS)
Alvarenga, M.A.B.
1980-12-01
An analytical procedure to solve the neutron diffusion equation in two dimensions and two energy groups was developed. The response matrix method was used coupled with an expansion of the neutron flux in finite Fourier series. A computer code 'MRF2D' was elaborated to implement the above mentioned procedure for PWR reactor core calculations. Different core symmetry options are allowed by the code, which is also flexible enough to allow for improvements by means of algorithm optimization. The code performance was compared with a corner mesh finite difference code named TVEDIM by using a International Atomic Energy Agency (IAEA) standard problem. Computer processing time 12,7% smaller is required by the MRF2D code to reach the same precision on criticality eigenvalue. (Author) [pt
End-User Recommendations on LOGOMON - a Computer Based Speech Therapy System for Romanian Language
Directory of Open Access Journals (Sweden)
SCHIPOR, O. A.
2010-11-01
Full Text Available In this paper we highlight the relations between LOGOMON - a Computer Based Speech Therapy System and dyslalia's training steps. Dyslalia is a speech disorder that affects pronunciation of one or many sounds. This presentation of the system is completed by a research regarding end-user (i.e. teachers and parents attitude about the speech assisted therapy in general and about LOGOMON System in particular. The results of this research allow the improvement of our CBST system because the obtained information can be a source of adaptability to different expectations of the beneficiaries.
INTERCULTURAL COMMUNICATION PATTERNS AND LANGUAGE USE IN COMPUTER MEDIATED-COMMUNICATION
Directory of Open Access Journals (Sweden)
Adriana Teodorescu
2012-11-01
Full Text Available This paper aims at analyzing the degree to which intercultural communication patterns are embedded in computer-mediated communication. Drawing on Hall’s and Hofstede’s intercultural communication dimensions, this study evaluates empirically high-versus-low context cultural orientations as reflected in the electronic medium, namely the blog, in three different cultures. Cultural variation is also analyzed in linguistic features and communication style in a synchronous mode of communication, by investigating data from several popular blogs from Japan, Germany and Italy.
Parmaxi, Antigoni; Zaphiris, Panayiotis
2017-01-01
This study explores the research development pertaining to the use of Web 2.0 technologies in the field of Computer-Assisted Language Learning (CALL). Published research manuscripts related to the use of Web 2.0 tools in CALL have been explored, and the following research foci have been determined: (1) Web 2.0 tools that dominate second/foreign…
van Han, Nguyen; van Rensburg, Henriette
2014-01-01
Many companies and organizations have been using the Test of English for International Communication (TOEIC) for business and commercial communication purpose in Vietnam and around the world. The present study investigated the effect of Computer Assisted Language Learning (CALL) on performance in the Test of English for International Communication…
Pu, Minran
2009-01-01
The purpose of the study was to investigate the relationship between college EFL students' autonomous learning capacity and motivation in using web-based Computer-Assisted Language Learning (CALL) in China. This study included three questionnaires: the student background questionnaire, the questionnaire on student autonomous learning capacity, and…
Sagarra, Nuria; Abbuhl, Rebekha
2013-01-01
This study investigates whether practice with computer-administered feedback in the absence of meaning-focused interaction can help second language learners notice the corrective intent of recasts and develop linguistic accuracy. A group of 218 beginning Anglophone learners of Spanish received 1 of 4 types of automated feedback (no feedback,…
Liang, Fan; Yen, Stephen L-K; Imahiyerobo, Thomas; Sanborn, Luke; Yen, Leia; Yen, Daniel; Nazarian, Sheila; Jedrzejewski, Breanna; Urata, Mark; Hammoudeh, Jeffrey
2017-10-01
Recent studies indicate that recombinant human bone morphogenetic protein-2 (rhBMP-2) in a demineralized bone matrix scaffold is a comparable alternative to iliac bone autograft in the setting of secondary alveolar cleft repair. Postreconstruction occlusal radiographs demonstrate improved bone stock when rhBMP-2/demineralized bone matrix (DBM) scaffold is used but lack the capacity to evaluate bone growth in three dimensions. This study uses cone beam computed tomography to provide the first clinical evaluation of volumetric and density comparisons between these two treatment modalities. A prospective study was conducted with 31 patients and 36 repairs of the alveolar cleft over a 2-year period. Twenty-one repairs used rhBMP-2/DBM scaffold and 14 repairs used iliac bone grafting. Postoperatively, occlusal radiographs were obtained at 3 months to evaluate bone fill; cone beam computed tomographic images were obtained at 6 to 9 months to compare volumetric and density data. At 3 months, postoperative occlusal radiographs demonstrated that 67 percent of patients receiving rhBMP-2/DBM scaffold had complete bone fill of the alveolus, versus 56 percent of patients in the autologous group. In contrast, cone beam computed tomographic data showed 31.6 percent (95 percent CI, 24.2 to 38.5 percent) fill in the rhBMP-2 group compared with 32.5 percent (95 percent CI, 22.1 to 42.9 percent) in the autologous population. Density analysis demonstrated identical average values between the groups (1.38 g/cc). These data demonstrate comparable bone regrowth and density values following secondary alveolar cleft repair using rhBMP-2/DBM scaffold versus autologous iliac bone graft. Cone beam computed tomography provides a more nuanced understanding of true bone regeneration within the alveolar cleft that may contribute to the information provided by occlusal radiographs alone. Therapeutic, II.
Directory of Open Access Journals (Sweden)
Yogi Widiawati
2017-11-01
in the language laboratory by using this software
The FORCE: A portable parallel programming language supporting computational structural mechanics
Jordan, Harry F.; Benten, Muhammad S.; Brehm, Juergen; Ramanan, Aruna
1989-01-01
This project supports the conversion of codes in Computational Structural Mechanics (CSM) to a parallel form which will efficiently exploit the computational power available from multiprocessors. The work is a part of a comprehensive, FORTRAN-based system to form a basis for a parallel version of the NICE/SPAR combination which will form the CSM Testbed. The software is macro-based and rests on the force methodology developed by the principal investigator in connection with an early scientific multiprocessor. Machine independence is an important characteristic of the system so that retargeting it to the Flex/32, or any other multiprocessor on which NICE/SPAR might be imnplemented, is well supported. The principal investigator has experience in producing parallel software for both full and sparse systems of linear equations using the force macros. Other researchers have used the Force in finite element programs. It has been possible to rapidly develop software which performs at maximum efficiency on a multiprocessor. The inherent machine independence of the system also means that the parallelization will not be limited to a specific multiprocessor.
Hawkins, John A.
2016-03-01
Arbib makes the interesting proposal [3, §1.6] that the first Homo sapiens could have been ;language-ready;, without possessing the kind of rich lexicon, grammar and compositional semantics that we see in the world's languages today. This early language readiness would have consisted of a set of ;protolanguage; abilities, which he enumerates (1-7 in §1.6), supported by brain mechanisms unique to humans. The transition to full ;language; (properties 8-11 in §1.6 and §3) would have required no changes in the genome, he argues, but could have resulted from cultural evolution plus some measure of Baldwinian evolution favoring offspring with greater linguistic skill. The full picture is set out in [1].
Zerling, J. P.
The aim of this paper is to present linguists--both members of research teams and language teachers--with some possible applications of computing science to language teaching. First, it is possible to use a computer's output system merely in order to print any type of information, e.g., a list of students' names and their marks. The computer also…
Ambrose, Regina Maria; Palpanathan, Shanthini
2017-01-01
Computer-assisted language learning (CALL) has evolved through various stages in both technology as well as the pedagogical use of technology (Warschauer & Healey, 1998). Studies show that the CALL trend has facilitated students in their English language writing with useful tools such as computer based activities and word processing. Students…
Limmer, Steffen; Fey, Dietmar
2013-07-01
Thin-film computations are often a time-consuming task during optical design. An efficient way to accelerate these computations with the help of graphics processing units (GPUs) is described. It turned out that significant speed-ups can be achieved. We investigate the circumstances under which the best speed-up values can be expected. Therefore we compare different GPUs among themselves and with a modern CPU. Furthermore, the effect of thickness modulation on the speed-up and the runtime behavior depending on the input data is examined.
Directory of Open Access Journals (Sweden)
Lorraine Komisarjevsky Tyler
2013-05-01
Full Text Available The core human capacity of syntactic analysis involves a left hemisphere network involving left inferior frontal gyrus (LIFG and posterior middle temporal gyrus (LMTG and the anatomical connections between them. Here we use MEG to determine the spatio-temporal properties of syntactic computations in this network. Listeners heard spoken sentences containing a local syntactic ambiguity (e.g. …landing planes…, at the offset of which they heard a disambiguating verb and decided whether it was an acceptable/unacceptable continuation of the sentence. We charted the time-course of processing and resolving syntactic ambiguity by measuring MEG responses from the onset of each word in the ambiguous phrase and the disambiguating word. We used representational similarity analysis (RSA to characterize syntactic information represented in the LIFG and LpMTG over time and to investigate their relationship to each other. Testing a variety of lexico-syntactic and ambiguity models against the MEG data, our results suggest early lexico-syntactic responses in the LpMTG and later effects of ambiguity in the LIFG, pointing to a clear differentiation in the functional roles of these two regions. Our results suggest the LpMTG represents and transmits lexical information to the LIFG, which responds to and resolves the ambiguity.
Directory of Open Access Journals (Sweden)
Zuraina Ali
2013-07-01
Full Text Available This study investigates the effectiveness of three vocabulary learning methods that are Contextual Clues, Dictionary Strategy, and Computer Assisted Language Learning (CALL in learning vocabulary among ESL learners. First, it aims at finding which of the vocabulary learning methods namely Dictionary Strategy, Contextual Clues, and CALL that may result in the highest number of words learnt in the immediate and delayed recall tests. Second, it compares the results of the Pre-test and the Delayed Recall Post-test to determine the differences of learning vocabulary using the methods. A quasi-experiment that tested the effectiveness of learning vocabulary using Dictionary Strategy, Contextual clues, and CALL involved 123 first year university students. Qualitative procedures included the collection of data from interviews which were conducted to triangulate the data obtain from the quantitative inquiries. Findings from the study using ANOVA revealed that there were significant differences when students were exposed to Dictionary Strategy, Contextual Clues and CALL in the immediate recall tests but not in the Delayed Recall Post-test. Also, there were significant differences when t test was used to compare the scores between the Pre-test and the Delayed Recall Post-test in using the three methods of vocabulary learning. Although many researchers have advocated the relative effectiveness of Dictionary Strategy, Contextual Clues, and CALL in learning vocabulary, the study however, is still paramount since there is no study has ever empirically investigated the relative efficacy of these three methods in a single study.
International Nuclear Information System (INIS)
Komninos, Yannis; Mercouris, Theodoros; Nicolaides, Cleanthes A.
2002-01-01
We develop practical formulas for the calculation of the matrix elements of the interaction of the electromagnetic field with an atomic state, beyond the long-wavelength approximation. The atom-plus-field Hamiltonian is chosen to have the multipolar form, containing the electric, paramagnetic, and diamagnetic operators. The final workable expressions include the interactions to all orders and are derived by first expanding the fields in partial waves. The electric-field operator reaches a constant value as the radial variable becomes large, contrary to the result of the electric-dipole approximation (EDA) where the value of the corresponding operator increases indefinitely. Applications are given for Rydberg states of hydrogen up to n=50 and for free-free transitions in a Coulomb potential. Such matrix elements are relevant to a number of real and virtual processes occurring during laser-atom interactions. The computation is done numerically, using a combination of analytic with numerical techniques. By comparing the results of the EDA with those of the exact treatment, it is shown that the former is inadequate in such cases. This finding has repercussions on the theory and understanding of the physics of quantum systems in high-lying Rydberg levels and wave packets or in scattering states
Energy Technology Data Exchange (ETDEWEB)
Quiney, Z.; Bache, M.R.; Jones, J.P. [Swansea Univ. (United Kingdom). Inst. of Structural Materials
2015-07-01
Hi-Nicalon SiC{sub f}/SiC ceramic matrix composite (CMC) specimens have been inspected using laboratory based X-ray computed micro-tomography (μCT) both prior and subsequent to isothermal fatigue assessment. The fatigue specimens were in the form of a dog bone-shaped geometry with a minimum cross-sectional area of 40 mm{sup 2}. Pre-test μCT inspections were conducted to identify the subsurface composite architecture and locate associated features introduced during the manufacturing process (e.g. isolated or conjoined porosity, matrix or interface discontinuities etc.). These μCT scans were subsequently correlated with matching post-test volumes in an attempt to determine the influence of such features upon damage accumulation and the ultimate failure position and cyclic damage mode(s). The relationship between μCT scan resolution and identification of critical features is also discussed. In typical cone-beam X-ray systems, resolution is proportional to the source-to-specimen distance, but for efficiency may also be chosen so as to minimise the number of scans needed to capture the whole area of interest. The investigations are intended to provide input into the future development of an in situ mechanical testing μCT facility using lab-based X-ray systems.
International Nuclear Information System (INIS)
Lage, Aldo M.F.; Reis, Sergio C.; Braga, Daniel M.; Santos, Armindo; Ferraz, Wilmar B.
2005-01-01
In this report it is presented the development of a geometric model to simulate the plate type fuel fabrication process with fuels microspheres dispersed in metallic matrix, as well as its software implementation. The developed geometric model encloses the steps of pellets pressing and sintering, as well as the plate rolling passes. The model permits the simulation of structures, where the values of the various variables of the fabrication processes can be studied and modified. The following variables were analyzed: microspheres diameters, density of the powder/microspheres mixing, microspheres density, fuel volume fraction, sintering densification, and rolling passes number. In the model implementation, which was codified in DELPHI programming language, systems of structured analysis techniques were utilized. The structures simulated were visualized utilizing the AutoCAD applicative, what permitted to obtain planes sections in diverse directions. The objective of this model is to enable the analysis of the simulated structures and supply information that can help in the improvement of the dispersion microspheres fuel plates fabrication process, now in development at CDTN (Centro de Desenvolvimento da Tecnologia Nuclear) in cooperation with the CTMSP (Centro Tecnologico da Marinha em Sao Paulo). (author)
International Nuclear Information System (INIS)
Pic, Marc Michel
1995-01-01
Parallel programming covers task-parallelism and data-parallelism. Many problems need both parallelisms. Multi-SIMD computers allow hierarchical approach of these parallelisms. The T++ language, based on C++, is dedicated to exploit Multi-SIMD computers using a programming paradigm which is an extension of array-programming to tasks managing. Our language introduced array of independent tasks to achieve separately (MIMD), on subsets of processors of identical behaviour (SIMD), in order to translate the hierarchical inclusion of data-parallelism in task-parallelism. To manipulate in a symmetrical way tasks and data we propose meta-operations which have the same behaviour on tasks arrays and on data arrays. We explain how to implement this language on our parallel computer SYMPHONIE in order to profit by the locally-shared memory, by the hardware virtualization, and by the multiplicity of communications networks. We analyse simultaneously a typical application of such architecture. Finite elements scheme for Fluid mechanic needs powerful parallel computers and requires large floating points abilities. Lattice gases is an alternative to such simulations. Boolean lattice bases are simple, stable, modular, need to floating point computation, but include numerical noise. Boltzmann lattice gases present large precision of computation, but needs floating points and are only locally stable. We propose a new scheme, called multi-bit, who keeps the advantages of each boolean model to which it is applied, with large numerical precision and reduced noise. Experiments on viscosity, physical behaviour, noise reduction and spurious invariants are shown and implementation techniques for parallel Multi-SIMD computers detailed. (author) [fr
Cook, Perry R.
This chapter covers algorithms, technologies, computer languages, and systems for computer music. Computer music involves the application of computers and other digital/electronic technologies to music composition, performance, theory, history, and the study of perception. The field combines digital signal processing, computational algorithms, computer languages, hardware and software systems, acoustics, psychoacoustics (low-level perception of sounds from the raw acoustic signal), and music cognition (higher-level perception of musical style, form, emotion, etc.).
Assembly processor program converts symbolic programming language to machine language
Pelto, E. V.
1967-01-01
Assembly processor program converts symbolic programming language to machine language. This program translates symbolic codes into computer understandable instructions, assigns locations in storage for successive instructions, and computer locations from symbolic addresses.
Visualizing Matrix Multiplication
Daugulis, Peteris; Sondore, Anita
2018-01-01
Efficient visualizations of computational algorithms are important tools for students, educators, and researchers. In this article, we point out an innovative visualization technique for matrix multiplication. This method differs from the standard, formal approach by using block matrices to make computations more visual. We find this method a…
Graphics-oriented application language for LASNEX
International Nuclear Information System (INIS)
Stringer, L.M.
1985-01-01
GOAL, a graphics-oriented application language, was developed to help physicists understand the large amounts of data produced by LASNEX. GOAL combines many aspects of the old LASNEX language, computer graphics, and standard computer languages
McEwan, Phil; Bergenheim, Klas; Yuan, Yong; Tetlow, Anthony P; Gordon, Jason P
2010-01-01
Simulation techniques are well suited to modelling diseases yet can be computationally intensive. This study explores the relationship between modelled effect size, statistical precision, and efficiency gains achieved using variance reduction and an executable programming language. A published simulation model designed to model a population with type 2 diabetes mellitus based on the UKPDS 68 outcomes equations was coded in both Visual Basic for Applications (VBA) and C++. Efficiency gains due to the programming language were evaluated, as was the impact of antithetic variates to reduce variance, using predicted QALYs over a 40-year time horizon. The use of C++ provided a 75- and 90-fold reduction in simulation run time when using mean and sampled input values, respectively. For a series of 50 one-way sensitivity analyses, this would yield a total run time of 2 minutes when using C++, compared with 155 minutes for VBA when using mean input values. The use of antithetic variates typically resulted in a 53% reduction in the number of simulation replications and run time required. When drawing all input values to the model from distributions, the use of C++ and variance reduction resulted in a 246-fold improvement in computation time compared with VBA - for which the evaluation of 50 scenarios would correspondingly require 3.8 hours (C++) and approximately 14.5 days (VBA). The choice of programming language used in an economic model, as well as the methods for improving precision of model output can have profound effects on computation time. When constructing complex models, more computationally efficient approaches such as C++ and variance reduction should be considered; concerns regarding model transparency using compiled languages are best addressed via thorough documentation and model validation.
Wu, Haifeng; Sun, Tao; Wang, Jingjing; Li, Xia; Wang, Wei; Huo, Da; Lv, Pingxin; He, Wen; Wang, Keyang; Guo, Xiuhua
2013-08-01
The objective of this study was to investigate the method of the combination of radiological and textural features for the differentiation of malignant from benign solitary pulmonary nodules by computed tomography. Features including 13 gray level co-occurrence matrix textural features and 12 radiological features were extracted from 2,117 CT slices, which came from 202 (116 malignant and 86 benign) patients. Lasso-type regularization to a nonlinear regression model was applied to select predictive features and a BP artificial neural network was used to build the diagnostic model. Eight radiological and two textural features were obtained after the Lasso-type regularization procedure. Twelve radiological features alone could reach an area under the ROC curve (AUC) of 0.84 in differentiating between malignant and benign lesions. The 10 selected characters improved the AUC to 0.91. The evaluation results showed that the method of selecting radiological and textural features appears to yield more effective in the distinction of malignant from benign solitary pulmonary nodules by computed tomography.
Hattori, Yusuke; Takaku, Tomomi; Otsuka, Makoto
2018-03-25
The relationships between the physicochemical properties of milled starch and drug release from tablets were investigated quantitatively using a drug release kinetic method and X-ray computed tomography (XCT). The samples were prepared from raw β-starch by milling in a planetary ball mill. The tablets, containing 5% theophylline (TH), 94% milled starch, and 1% magnesium stearate, were compressed at 6 kN. The drug-release and gel-forming processes were measured simultaneously using an original dissolution tester with an XCT instrument. Drug release from the tablet was delayed with increasing milling time, because the TH tablet formed a typical gel-layer on the outside of the tablet. The relationship between the crystallinity of milled starch and mean drug release time (MDT) for the TH tablets showed almost a straight inverse proportional relationship. The plots of MDT against area under the curve of the swelling ratio profiles of the TH tablets had a good straight line. Copyright © 2018 Elsevier B.V. All rights reserved.
Franklin, Joel N
2003-01-01
Mathematically rigorous introduction covers vector and matrix norms, the condition-number of a matrix, positive and irreducible matrices, much more. Only elementary algebra and calculus required. Includes problem-solving exercises. 1968 edition.
Taylor, Alan M.
2002-01-01
Investigates the code switching of two French teachers in a computer-assisted language learning (CALL) environment. Highlights the importance of the social dynamic and technical aspects of teachers' codeswitching behaviors. (Author/VWL)
Feldman, G. H.; Johnson, J. A.
1980-01-01
Structural-programming language is especially-tailored for producing assembly language programs for MODCOMP II and IV mini-computes. Modern programming language consists of set of simple and powerful control structures that include sequencing alternative selection, looping, sub-module linking, comment insertion, statement continuation, and compilation termination capabilities.
George, Lisa; Kalume, Aimable; El-Khoury, Patrick Z; Tarnovsky, Alexander; Reid, Scott A
2010-02-28
The photolysis products of dibromodifluoromethane (CF(2)Br(2)) were characterized by matrix isolation infrared and UV/Visible spectroscopy, supported by ab initio calculations. Photolysis at wavelengths of 240 and 266 nm of CF(2)Br(2):Ar samples (approximately 1:5000) held at approximately 5 K yielded iso-CF(2)Br(2) (F(2)CBrBr), a weakly bound isomer of CF(2)Br(2), which is characterized here for the first time. The observed infrared and UV/Visible absorptions of iso-CF(2)Br(2) are in excellent agreement with computational predictions at the B3LYP/aug-cc-pVTZ level. Single point energy calculations at the CCSD(T)/aug-cc-pVDZ level on the B3LYP optimized geometries suggest that the isoform is a minimum on the CF(2)Br(2) potential energy surface, lying some 55 kcal/mol above the CF(2)Br(2) ground state. The energies of various stationary points on the CF(2)Br(2) potential energy surface were characterized computationally; taken with our experimental results, these show that iso-CF(2)Br(2) is an intermediate in the Br+CF(2)Br-->CF(2)+Br(2) reaction. The photochemistry of the isoform was also investigated; excitation into the intense 359 nm absorption band resulted in isomerization to CF(2)Br(2). Our results are discussed in view of the rich literature on the gas-phase photochemistry of CF(2)Br(2), particularly with respect to the existence of a roaming atom pathway leading to molecular products.
International Nuclear Information System (INIS)
George, Lisa; Kalume, Aimable; Reid, Scott A.; El-Khoury, Patrick Z.; Tarnovsky, Alexander
2010-01-01
The photolysis products of dibromodifluoromethane (CF 2 Br 2 ) were characterized by matrix isolation infrared and UV/Visible spectroscopy, supported by ab initio calculations. Photolysis at wavelengths of 240 and 266 nm of CF 2 Br 2 :Ar samples (∼1:5000) held at ∼5 K yielded iso-CF 2 Br 2 (F 2 CBrBr), a weakly bound isomer of CF 2 Br 2 , which is characterized here for the first time. The observed infrared and UV/Visible absorptions of iso-CF 2 Br 2 are in excellent agreement with computational predictions at the B3LYP/aug-cc-pVTZ level. Single point energy calculations at the CCSD(T)/aug-cc-pVDZ level on the B3LYP optimized geometries suggest that the isoform is a minimum on the CF 2 Br 2 potential energy surface, lying some 55 kcal/mol above the CF 2 Br 2 ground state. The energies of various stationary points on the CF 2 Br 2 potential energy surface were characterized computationally; taken with our experimental results, these show that iso-CF 2 Br 2 is an intermediate in the Br+CF 2 Br→CF 2 +Br 2 reaction. The photochemistry of the isoform was also investigated; excitation into the intense 359 nm absorption band resulted in isomerization to CF 2 Br 2 . Our results are discussed in view of the rich literature on the gas-phase photochemistry of CF 2 Br 2 , particularly with respect to the existence of a roaming atom pathway leading to molecular products.
Ezhil: A Tamil Programming Language
Annamalai, Muthiah
2009-01-01
Ezhil is a Tamil language based interpreted procedural programming language. Tamil keywords and grammar are chosen to make the native Tamil speaker write programs in the Ezhil system. Ezhil allows easy representation of computer program closer to the Tamil language logical constructs equivalent to the conditional, branch and loop statements in modern English based programming languages. Ezhil is a compact programming language aimed towards Tamil speaking novice computer users. Grammar for Ezh...
Directory of Open Access Journals (Sweden)
Ichitaro Yamazaki
2015-01-01
of their low-rank properties. To compute a low-rank approximation of a dense matrix, in this paper, we study the performance of QR factorization with column pivoting or with restricted pivoting on multicore CPUs with a GPU. We first propose several techniques to reduce the postprocessing time, which is required for restricted pivoting, on a modern CPU. We then examine the potential of using a GPU to accelerate the factorization process with both column and restricted pivoting. Our performance results on two eight-core Intel Sandy Bridge CPUs with one NVIDIA Kepler GPU demonstrate that using the GPU, the factorization time can be reduced by a factor of more than two. In addition, to study the performance of our implementations in practice, we integrate them into a recently developed software StruMF which algebraically exploits such low-rank structures for solving a general sparse linear system of equations. Our performance results for solving Poisson's equations demonstrate that the proposed techniques can significantly reduce the preconditioner construction time of StruMF on the CPUs, and the construction time can be further reduced by 10%–50% using the GPU.
Gupta, Swyeta Jain; Jhingran, Rajesh; Gupta, Vivek; Bains, Vivek Kumar; Madan, Rohit; Rizvi, Iram
2014-07-01
To evaluate and compare the efficacy of platelet-rich fibrin (PRF) with enamel matrix derivative (EMD; Emdogain) in the treatment of periodontal intrabony defects in patients with chronic periodontitis, six months after surgery. Forty-four (44) intrabony defects in 30 patients (15 males) were randomly allocated into two treatment groups: EMD (n = 22) and PRF (n = 22). Measurement of the defects was done using clinical and cone beam computed tomography at baseline and 6 months. Clinical and radiographic parameters such as probing depth, clinical attachment level, intrabony defect depth and defect angle, were recorded at baseline and 6 months post-operatively. Within group change was evaluated using the Wilcoxon signed rank test. Intergroup comparisons were made using the Mann-Whitney U test. Postsurgical measurements revealed that there was an equal reduction in probing depth and a greater but statistically non-significant attachment gain for the Emdogain group when compared to the platelet-rich fibrin group. The Emdogain group presented with significantly greater percentage defect resolution (43.07% ± 12.21) than did the platelet-rich fibrin group (32.41% ± 14.61). Post-operatively the changes in defect width and defect angle were significant in both groups, but upon intergroup comparison they were found to be statistically non-significantly different. Both Emdogain and platelet-rich fibrin were effective in the regeneration of intrabony defects. Emdogain was significantly superior in terms of percentage defect resolution.
Residual, restarting and Richardson iteration for the matrix exponential
Bochev, Mikhail A.; Grimm, Volker; Hochbruck, Marlis
2013-01-01
A well-known problem in computing some matrix functions iteratively is the lack of a clear, commonly accepted residual notion. An important matrix function for which this is the case is the matrix exponential. Suppose the matrix exponential of a given matrix times a given vector has to be computed.
Residual, restarting and Richardson iteration for the matrix exponential
Bochev, Mikhail A.
2010-01-01
A well-known problem in computing some matrix functions iteratively is a lack of a clear, commonly accepted residual notion. An important matrix function for which this is the case is the matrix exponential. Assume, the matrix exponential of a given matrix times a given vector has to be computed. We
Ploog, Bertram O.; Scharf, Alexa; Nelson, DeShawn; Brooks, Patricia J.
2013-01-01
Major advances in multimedia computer technology over the past decades have made sophisticated computer games readily available to the public. This, combined with the observation that most children, including those with autism spectrum disorders (ASD), show an affinity to computers, has led researchers to recognize the potential of computer…
Cross-language information retrieval using PARAFAC2.
Energy Technology Data Exchange (ETDEWEB)
Bader, Brett William; Chew, Peter; Abdelali, Ahmed (New Mexico State University, Las Cruces, NM); Kolda, Tamara Gibson
2007-05-01
A standard approach to cross-language information retrieval (CLIR) uses Latent Semantic Analysis (LSA) in conjunction with a multilingual parallel aligned corpus. This approach has been shown to be successful in identifying similar documents across languages - or more precisely, retrieving the most similar document in one language to a query in another language. However, the approach has severe drawbacks when applied to a related task, that of clustering documents 'language-independently', so that documents about similar topics end up closest to one another in the semantic space regardless of their language. The problem is that documents are generally more similar to other documents in the same language than they are to documents in a different language, but on the same topic. As a result, when using multilingual LSA, documents will in practice cluster by language, not by topic. We propose a novel application of PARAFAC2 (which is a variant of PARAFAC, a multi-way generalization of the singular value decomposition [SVD]) to overcome this problem. Instead of forming a single multilingual term-by-document matrix which, under LSA, is subjected to SVD, we form an irregular three-way array, each slice of which is a separate term-by-document matrix for a single language in the parallel corpus. The goal is to compute an SVD for each language such that V (the matrix of right singular vectors) is the same across all languages. Effectively, PARAFAC2 imposes the constraint, not present in standard LSA, that the 'concepts' in all documents in the parallel corpus are the same regardless of language. Intuitively, this constraint makes sense, since the whole purpose of using a parallel corpus is that exactly the same concepts are expressed in the translations. We tested this approach by comparing the performance of PARAFAC2 with standard LSA in solving a particular CLIR problem. From our results, we conclude that PARAFAC2 offers a very promising alternative to
Chukharev-Hudilainen, Evgeny; Klepikova, Tatiana A.
2016-01-01
The purpose of the present paper is twofold; first, we present an empirical study evaluating the effectiveness of a novel CALL tool for foreign language vocabulary instruction based on spaced repetition of target vocabulary items. The study demonstrates that by spending an average of three minutes each day on automatically generated vocabulary…
Jeong, Allan C.
2006-01-01
This study examined the effects of conversational language (e.g., asking questions, inviting replies, acknowledgments, referencing others by name, closing signatures, "I agree, but", greetings, etc.) on the frequency and types of responses posted in reply to given types of messages (e.g., argument, evidence, critique, explanation), and…
Yüzen, Abdulkadir; Karamete, Aysen
2016-01-01
In this study, using ADDIE instructional design model, it is aimed to prepare English language educational material for 4th grade primary students to teach them numbers. At the same time, ARCS model of motivation's attention, relevance and satisfaction phases are also taken into consideration. This study also comprises of Design Based Research…
Gelan, Anouk; Fastré, Greet; Verjans, Martine; Martin, Niels; Janssenswillen, Gert; Creemers, Mathijs; Lieben, Jonas; Depaire, Benoît; Thomas, Michael
2018-01-01
Learning analytics (LA) has emerged as a field that offers promising new ways to prevent drop-out and aid retention. However, other research suggests that large datasets of learner activity can be used to understand online learning behaviour and improve pedagogy. While the use of LA in language learning has received little attention to date,…
Computer programming and computer systems
Hassitt, Anthony
1966-01-01
Computer Programming and Computer Systems imparts a "reading knowledge? of computer systems.This book describes the aspects of machine-language programming, monitor systems, computer hardware, and advanced programming that every thorough programmer should be acquainted with. This text discusses the automatic electronic digital computers, symbolic language, Reverse Polish Notation, and Fortran into assembly language. The routine for reading blocked tapes, dimension statements in subroutines, general-purpose input routine, and efficient use of memory are also elaborated.This publication is inten
Directory of Open Access Journals (Sweden)
Guez F.
2006-11-01
Full Text Available La recherche des conditions optimales d'exploitation d'un gisement fissuré repose sur une bonne description de la fissuration. En conséquence il est nécessaire de définir les dimensions et volumes des blocs matriciels en chaque point d'une structure. Or la géométrie du milieu (juxtaposition et formes des blocs est généralement trop complexe pour se prêter au calcul. Aussi, dans une précédente communication, avons-nous dû tourner cette difficulté par un raisonnement sur des moyennes (pendages, azimuts, espacement des fissures qui nous a conduits à un ordre de grandeur des volumes. Cependant un volume moyen ne peut pas rendre compte d'une loi de répartition des volumes des blocs. Or c'est cette répartition qui conditionne le choix d'une ou plusieurs méthodes successives de récupération. Aussi présentons-nous ici une méthode originale de calcul statistique de la loi de distribution des volumes des blocs matriciels, applicable en tout point d'un gisement. La part de gisement concernée par les blocs de volume donné en est déduite. La connaissance générale du phénomène de la fracturation sert de base au modèle. Les observations de subsurface sur la fracturation du gisement en fournissent les données (histogramme d'orientation et d'espacement des fissures.Une application au gisement d'Eschau (Alsace, France est rapportée ici pour illustrer la méthode. The search for optimum production conditions for a fissured reservoir depends on having a good description of the fissure pattern. Hence the sizes and volumes of the matrix blocks must be defined at all points in a structure. However, the geometry of the medium (juxtaposition and shapes of blocks in usually too complex for such computation. This is why, in a previous paper, we got around this problem by reasoning on the bases of averages (clips, azimuths, fissure spacing, and thot led us to an order of magnitude of the volumes. Yet a mean volume cannot be used to explain
Alkaria, Ahmed; Alhassan, Riyadh
2017-01-01
This study was conducted to examine the effect of in-service training of computer science teachers in Scratch language using an electronic learning platform on acquiring programming skills and attitudes towards teaching programming. The sample of this study consisted of 40 middle school computer science teachers. They were assigned into two…
Najbauer, Eszter E; Bazsó, Gábor; Apóstolo, Rui; Fausto, Rui; Biczysko, Malgorzata; Barone, Vincenzo; Tarczay, György
2015-08-20
The conformers of α-serine were investigated by matrix-isolation IR spectroscopy combined with NIR laser irradiation. This method, aided by 2D correlation analysis, enabled unambiguously grouping the spectral lines to individual conformers. On the basis of comparison of at least nine experimentally observed vibrational transitions of each conformer with empirically scaled (SQM) and anharmonic (GVPT2) computed IR spectra, six conformers were identified. In addition, the presence of at least one more conformer in Ar matrix was proved, and a short-lived conformer with a half-life of (3.7 ± 0.5) × 10(3) s in N2 matrix was generated by NIR irradiation. The analysis of the NIR laser-induced conversions revealed that the excitation of the stretching overtone of both the side chain and the carboxylic OH groups can effectively promote conformational changes, but remarkably different paths were observed for the two kinds of excitations.
Bodewig, E
1959-01-01
Matrix Calculus, Second Revised and Enlarged Edition focuses on systematic calculation with the building blocks of a matrix and rows and columns, shunning the use of individual elements. The publication first offers information on vectors, matrices, further applications, measures of the magnitude of a matrix, and forms. The text then examines eigenvalues and exact solutions, including the characteristic equation, eigenrows, extremum properties of the eigenvalues, bounds for the eigenvalues, elementary divisors, and bounds for the determinant. The text ponders on approximate solutions, as well
Directory of Open Access Journals (Sweden)
Ian S Howard
Full Text Available Words are made up of speech sounds. Almost all accounts of child speech development assume that children learn the pronunciation of first language (L1 speech sounds by imitation, most claiming that the child performs some kind of auditory matching to the elements of ambient speech. However, there is evidence to support an alternative account and we investigate the non-imitative child behavior and well-attested caregiver behavior that this account posits using Elija, a computational model of an infant. Through unsupervised active learning, Elija began by discovering motor patterns, which produced sounds. In separate interaction experiments, native speakers of English, French and German then played the role of his caregiver. In their first interactions with Elija, they were allowed to respond to his sounds if they felt this was natural. We analyzed the interactions through phonemic transcriptions of the caregivers' utterances and found that they interpreted his output within the framework of their native languages. Their form of response was almost always a reformulation of Elija's utterance into well-formed sounds of L1. Elija retained those motor patterns to which a caregiver responded and formed associations between his motor pattern and the response it provoked. Thus in a second phase of interaction, he was able to parse input utterances in terms of the caregiver responses he had heard previously, and respond using his associated motor patterns. This capacity enabled the caregivers to teach Elija to pronounce some simple words in their native languages, by his serial imitation of the words' component speech sounds. Overall, our results demonstrate that the natural responses and behaviors of human subjects to infant-like vocalizations can take a computational model from a biologically plausible initial state through to word pronunciation. This provides support for an alternative to current auditory matching hypotheses for how children learn to
Gelan, Anouk; Fastré, Greet; Verjans, Martine; Martin, Niels; Janssenswillen, Gert; Creemers, Mathijs; Lieben, Jonas; Depaire, Benoît; Thomas, Michael
2018-01-01
Learning analytics (LA) has emerged as a field that offers promising new ways to prevent drop-out and aid retention. However, other research suggests that large datasets of learner activity can be used to understand online learning behaviour and improve pedagogy. While the use of LA in language learning has received little attention to date, available research suggests that LA could provide valuable insights into task design for instructors and materials designers, as well as help students wi...
1986-05-01
language interface to these new capabilities as well as to the existing data bases and graphic display facilities. BBN is developing a series of...Action. Artificial Intelligence , 1986. Forthcoming. [Hinrichs 81] Hinrichs, E. Temporale Anaphora um Englischen. 1981. Unpublished ms., University of...organized by NIKL has been demonstrated for a wide variety of sentence types. Table 3 shows a series of independent sentences that Penman is now able
Is CALL Obsolete? Language Acquisition and Language Learning Revisited in a Digital Age
Jarvis, Huw; Krashen, Stephen
2014-01-01
In this article, Huw Jarvis and Stephen Krashen ask "Is CALL Obsolete?" When the term CALL (Computer-Assisted Language Learning) was introduced in the 1960s, the language education profession knew only about language learning, not language acquisition, and assumed the computer's primary contribution to second language acquisition…
M. Kasemann
Overview In autumn the main focus was to process and handle CRAFT data and to perform the Summer08 MC production. The operational aspects were well covered by regular Computing Shifts, experts on duty and Computing Run Coordination. At the Computing Resource Board (CRB) in October a model to account for service work at Tier 2s was approved. The computing resources for 2009 were reviewed for presentation at the C-RRB. The quarterly resource monitoring is continuing. Facilities/Infrastructure operations Operations during CRAFT data taking ran fine. This proved to be a very valuable experience for T0 workflows and operations. The transfers of custodial data to most T1s went smoothly. A first round of reprocessing started at the Tier-1 centers end of November; it will take about two weeks. The Computing Shifts procedure was tested full scale during this period and proved to be very efficient: 30 Computing Shifts Persons (CSP) and 10 Computing Resources Coordinators (CRC). The shift program for the shut down w...
Cowley, Billie Jo
2013-01-01
Technology has become increasingly prominent in schools. The purpose of this study was to examine the integration of technology with students with disabilities, particularly the use of one-to-one computing when used in inclusive classrooms. This study took a qualitative approach exploring how one teacher integrated one-to-one computing into her…
Nelde, Peter Hans
1995-01-01
Examines the phenomenon of language contact and recent trends in linguistic contact research, which focuses on language use, language users, and language spheres. Also discusses the role of linguistic and cultural conflicts in language contact situations. (13 references) (MDM)
I. Fisk
2011-01-01
Introduction CMS distributed computing system performed well during the 2011 start-up. The events in 2011 have more pile-up and are more complex than last year; this results in longer reconstruction times and harder events to simulate. Significant increases in computing capacity were delivered in April for all computing tiers, and the utilisation and load is close to the planning predictions. All computing centre tiers performed their expected functionalities. Heavy-Ion Programme The CMS Heavy-Ion Programme had a very strong showing at the Quark Matter conference. A large number of analyses were shown. The dedicated heavy-ion reconstruction facility at the Vanderbilt Tier-2 is still involved in some commissioning activities, but is available for processing and analysis. Facilities and Infrastructure Operations Facility and Infrastructure operations have been active with operations and several important deployment tasks. Facilities participated in the testing and deployment of WMAgent and WorkQueue+Request...
P. McBride
The Computing Project is preparing for a busy year where the primary emphasis of the project moves towards steady operations. Following the very successful completion of Computing Software and Analysis challenge, CSA06, last fall, we have reorganized and established four groups in computing area: Commissioning, User Support, Facility/Infrastructure Operations and Data Operations. These groups work closely together with groups from the Offline Project in planning for data processing and operations. Monte Carlo production has continued since CSA06, with about 30M events produced each month to be used for HLT studies and physics validation. Monte Carlo production will continue throughout the year in the preparation of large samples for physics and detector studies ramping to 50 M events/month for CSA07. Commissioning of the full CMS computing system is a major goal for 2007. Site monitoring is an important commissioning component and work is ongoing to devise CMS specific tests to be included in Service Availa...
M. Kasemann
Overview During the past three months activities were focused on data operations, testing and re-enforcing shift and operational procedures for data production and transfer, MC production and on user support. Planning of the computing resources in view of the new LHC calendar in ongoing. Two new task forces were created for supporting the integration work: Site Commissioning, which develops tools helping distributed sites to monitor job and data workflows, and Analysis Support, collecting the user experience and feedback during analysis activities and developing tools to increase efficiency. The development plan for DMWM for 2009/2011 was developed at the beginning of the year, based on the requirements from the Physics, Computing and Offline groups (see Offline section). The Computing management meeting at FermiLab on February 19th and 20th was an excellent opportunity discussing the impact and for addressing issues and solutions to the main challenges facing CMS computing. The lack of manpower is particul...
Visual languages and applications
Zhang, Kang
2010-01-01
Visual languages have long been a pursuit of effective communication between human and machine. With rapid advances of the Internet and Web technology, human-human communication through the Web or electronic mobile devices is becoming more and more prevalent. Visual Languages and Applications is a comprehensive introduction to diagrammatical visual languages. This book discusses what visual programming languages are, and how such languages and their underlying foundations can be usefully applied to other fields in computer science. It also covers a broad range of contents from the underlying t
International Nuclear Information System (INIS)
Burow, Burkhard D.
1996-01-01
Computing in the next millennium will be using software from this millennium. Programming languages evolve and new ones continue to be created. The use of legacy code demonstrates why some present and future applications may span programming languages. Even a completely new application may mix programming languages, if it allows its components to be more conveniently expressed. Given the need, mixed language programming should be easy and robust. By resolving a variety of difficulties, the well established cfortran.h package provides, the desired convenient interface across the C and Fortran programming languages, as demonstrated using CERN's Book. (author)
Electronic Circuit Analysis Language (ECAL)
Chenghang, C.
1983-03-01
The computer aided design technique is an important development in computer applications and it is an important component of computer science. The special language for electronic circuit analysis is the foundation of computer aided design or computer aided circuit analysis (abbreviated as CACD and CACA) of simulated circuits. Electronic circuit analysis language (ECAL) is a comparatively simple and easy to use circuit analysis special language which uses the FORTRAN language to carry out the explanatory executions. It is capable of conducting dc analysis, ac analysis, and transient analysis of a circuit. Futhermore, the results of the dc analysis can be used directly as the initial conditions for the ac and transient analyses.
International Nuclear Information System (INIS)
Sarma, J.; Robson, P.N.
1979-01-01
The two dimensional transmission line matrix (TLM) numerical method has been adapted to compute electromagnetic field distributions in cylindrical co-ordinates and it is applied to evaluate the radiation loss from a charge bunch passing through a 'pill-box' resonator. The computer program has been developed to calculate not only the total energy loss to the resonator but also that component of it which exists in the TM 010 mode. The numerically computed results are shown to agree very well with the analytically derived values as found in the literature which, therefore, established the degree of accuracy that is obtained with the TLM method. The particular features of computational simplicity, numerical stability and the inherently time-domain solutions produced by the TLM method are cited as additional, attractive reasons for using this numerical procedure in solving such problems. (Auth.)
1980-06-01
primitive, speed languages, all of which contribute negatively to increases approaching that of a ’truly’ high-level the economics of data processing...for the direct dlude vector tunctiona. it was indicated that the processor, it was shoam that 2816 speed gain over maximum MPU per formance is 22 "eA...strictly ’ local. economical way of changing access lists, since it 147 .. . ..".’ ’. .".". . I, rv -’ M WJ, 11 1 P is done at zero cost in conjunction