Computer Language For Optimization Of Design

Science.gov (United States)

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.

Teaching natural language to computers

OpenAIRE

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 ...

Computers and languages theory and practice

CERN Document Server

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

Elements of matrix modeling and computing with Matlab

CERN Document Server

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

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

A random matrix approach to language acquisition

Science.gov (United States)

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.

Computer Language Settings and Canadian Spellings

Science.gov (United States)

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…

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.

An Overview of Computer-Based Natural Language Processing.

Science.gov (United States)

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…

Computers and Languages: Theory and Practice

NARCIS (Netherlands)

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

Computer Programming Languages for Health Care

Science.gov (United States)

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.

“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.

Some issues of creation of belarusian language computer resources

OpenAIRE

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.

Semantic computing and language knowledge bases

Science.gov (United States)

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.

Development of the Tensoral Computer Language

Science.gov (United States)

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.

Redesigning Triangular Dense Matrix Computations on GPUs

KAUST Repository

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

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

An overview of computer-based natural language processing

Science.gov (United States)

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.

Computers in Language Testing: Present Research and Some Future Directions.

Science.gov (United States)

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…

Matrix Training of Receptive Language Skills with a Toddler with Autism Spectrum Disorder: A Case Study

Science.gov (United States)

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…

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.

Exploiting Data Sparsity for Large-Scale Matrix Computations

KAUST Repository

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.

Exploiting Data Sparsity for Large-Scale Matrix Computations

KAUST Repository

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.

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...

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.

Natural language computing an English generative grammar in Prolog

CERN Document Server

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 (CALL): Using Internet for Effective Language Learning

NARCIS (Netherlands)

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,

Computer-Assisted Language Learning: Current Programs and Projects. ERIC Digest.

Science.gov (United States)

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…

HAL/SM language specification. [programming languages and computer programming for space shuttles

Science.gov (United States)

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.

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 ...

Learning theories in computer-assisted foreign language acquisition

OpenAIRE

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

Efficient sparse matrix-matrix multiplication for computing periodic responses by shooting method on Intel Xeon Phi

Science.gov (United States)

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.

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)

Discriminant Validity of the WISC-IV Culture-Language Interpretive Matrix

Science.gov (United States)

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…

Massively parallel sparse matrix function calculations with NTPoly

Science.gov (United States)

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.

Computer-Assisted Language Learning : proceedings of the seventh Twente Workshop on Language Technology

NARCIS (Netherlands)

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

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.

Collocational Relations in Japanese Language Textbooks and Computer-Assisted Language Learning Resources

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.

Can Computers Be Used for Whole Language Approaches to Reading and Language Arts?

Science.gov (United States)

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…

The Advantages and Disadvantages of Computer Technology in Second Language Acquisition

Science.gov (United States)

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…

Errors and Intelligence in Computer-Assisted Language Learning: Parsers and Pedagogues. Routledge Studies in Computer Assisted Language Learning

Science.gov (United States)

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…

Extended Krylov subspaces approximations of matrix functions. Application to computational electromagnetics

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.

Parallel algorithms for computation of the manipulator inertia matrix

Science.gov (United States)

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.

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.

Computer modelling as a tool for understanding language evolution

NARCIS (Netherlands)

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

Conversation Analysis in Computer-Assisted Language Learning

Science.gov (United States)

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…

Gay guys using gay language: friendship, shared values and the intent-context-effect matrix.

Science.gov (United States)

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.

Computer-Assisted Language Learning: Diversity in Research and Practice

Science.gov (United States)

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…

Students' Motivation toward Computer-Based Language Learning

Science.gov (United States)

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…

Interactive computing in BASIC an introduction to interactive computing and a practical course in the BASIC language

CERN Document Server

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

Structured Design Language for Computer Programs

Science.gov (United States)

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.

Author Languages, Authoring Systems, and Their Relation to the Changing Focus of Computer-Aided Language Learning.

Science.gov (United States)

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…

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....

Thai Language Sentence Similarity Computation Based on Syntactic Structure and Semantic Vector

Science.gov (United States)

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.

From Computer Assisted Language Learning (CALL) to Mobile Assisted Language Use (MALU)

Science.gov (United States)

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…

Computational Nonlinear Morphology with Emphasis on Semitic Languages. Studies in Natural Language Processing.

Science.gov (United States)

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,…

Computational Investigations of Multiword Chunks in Language Learning.

Science.gov (United States)

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.

Computing the Density Matrix in Electronic Structure Theory on Graphics Processing Units.

Science.gov (United States)

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.

Two-Language, Two-Paradigm Introductory Computing Curriculum Model and its Implementation

OpenAIRE

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.

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.)

Second-Language Composition Instruction, Computers and First-Language Pedagogy: A Descriptive Survey.

Science.gov (United States)

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…

A high level language for a high performance computer

Science.gov (United States)

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.

Design and Delivery of Multiple Server-Side Computer Languages Course

Science.gov (United States)

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…

Generic Cospark of a Matrix Can Be Computed in Polynomial Time

OpenAIRE

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...

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)

Linguistics, Computers, and the Language Teacher. A Communicative Approach.

Science.gov (United States)

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…

Projection matrix acquisition for cone-beam computed tomography iterative reconstruction

Science.gov (United States)

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-Aided Transformation of PDE Models: Languages, Representations, and a Calculus of Operations

Science.gov (United States)

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

Artificial intelligence, expert systems, computer vision, and natural language processing

Science.gov (United States)

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.

Foreign Language Teaching and the Computer.

Science.gov (United States)

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.…

Integrating Computer-Assisted Language Learning in Saudi Schools: A Change Model

Science.gov (United States)

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…

System matrix computation vs storage on GPU: A comparative study in cone beam CT.

Science.gov (United States)

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

When technology became language: the origins of the linguistic conception of computer programming, 1950-1960.

Science.gov (United States)

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.

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

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)

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.

The Sizing and Optimization Language, (SOL): Computer language for design problems

Science.gov (United States)

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.

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.

Eye-tracking research in computer-mediated language learning

NARCIS (Netherlands)

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

Computer-Assisted Foreign Language Teaching and Learning: Technological Advances

Science.gov (United States)

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…

Using Primary Language Support via Computer to Improve Reading Comprehension Skills of First-Grade English Language Learners

Science.gov (United States)

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…

An Intelligent Computer Assisted Language Learning System for Arabic Learners

Science.gov (United States)

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…

STAR - A computer language for hybrid AI applications

Science.gov (United States)

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.

On Using Intelligent Computer-Assisted Language Learning in Real-Life Foreign Language Teaching and Learning

Science.gov (United States)

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…

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}.$

Hypergraph partitioning implementation for parallelizing matrix-vector multiplication using CUDA GPU-based parallel computing

Science.gov (United States)

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).

Simple and practical approach for computing the ray Hessian matrix in geometrical optics.

Science.gov (United States)

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.

Attitudes of Jordanian Undergraduate Students towards Using Computer Assisted Language Learning (CALL

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.

Redesigning Triangular Dense Matrix Computations on GPUs

KAUST Repository

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.

A class of parallel algorithms for computation of the manipulator inertia matrix

Science.gov (United States)

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.

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.)

Computer Literacy of Iranian Teachers of English as a Foreign Language: Challenges and Obstacles

Science.gov (United States)

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.…

Enhancing Language Material Availability Using Computers.

Science.gov (United States)

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…

Communicative Language Testing: Implications for Computer Based Language Testing in French for Specific Purposes

Science.gov (United States)

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…

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.)

The Role of Computer-Assisted Language Learning (CALL) in Promoting Learner Autonomy

Science.gov (United States)

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…

System Matrix Analysis for Computed Tomography Imaging

Science.gov (United States)

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

Computer-Assisted Language Learning (CALL) in Support of (Re)-Learning Native Languages: The Case of Runyakitara

Science.gov (United States)

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…

Theory of automata, formal languages and computation

CERN Document Server

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.

Neural Cognition and Affective Computing on Cyber Language.

Science.gov (United States)

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.

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.

COMPUTER-MEDIATED COMMUNICATION IN FOREIGN LANGUAGE EDUCATION: Use of Target Language and Learner Perceptions

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.

Parallel Computation of the Jacobian Matrix for Nonlinear Equation Solvers Using MATLAB

Science.gov (United States)

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.

· 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.

L'Enseignement des langues assiste par ordinateur: nouvelle pedagogie? (Computer Assisted Language Instruction: New Pedagogy?).

Science.gov (United States)

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…

Exploiting Data Sparsity In Covariance Matrix Computations on Heterogeneous Systems

KAUST Repository

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

Computer-Adaptive Testing in Second Language Contexts.

Science.gov (United States)

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.

Science.gov (United States)

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.

Algorithm 589. SICEDR: a FORTRAN subroutine for improving the accuracy of computed matrix eigenvalues

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

When Technology Became Language: The Origins of the Linguistic Conception of Computer Programming, 1950-1960

NARCIS (Netherlands)

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

Multi-Language Programming Environments for High Performance Java Computing

OpenAIRE

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 ...

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.

Aware Computing in Spatial Language Understanding Guided by Cognitively Inspired Knowledge Representation

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.

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

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

Computing the sparse matrix vector product using block-based kernels without zero padding on processors with AVX-512 instructions

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.

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.

Efficacy of Computer Games on Language Learning

Science.gov (United States)

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…

User interfaces for computational science: A domain specific language for OOMMF embedded in Python

Science.gov (United States)

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.

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.

Parallel computational in nuclear group constant calculation

International Nuclear Information System (INIS)

Su'ud, Zaki; Rustandi, Yaddi K.; Kurniadi, Rizal

2002-01-01

In this paper parallel computational method in nuclear group constant calculation using collision probability method will be discuss. The main focus is on the calculation of collision matrix which need large amount of computational time. The geometry treated here is concentric cylinder. The calculation of collision probability matrix is carried out using semi analytic method using Beckley Naylor Function. To accelerate computation speed some computer parallel used to solve the problem. We used LINUX based parallelization using PVM software with C or fortran language. While in windows based we used socket programming using DELPHI or C builder. The calculation results shows the important of optimal weight for each processor in case there area many type of processor speed

Computer-Based English Language Testing in China: Present and Future

Science.gov (United States)

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…

HCIDL: Human-computer interface description language for multi-target, multimodal, plastic user interfaces

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

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

Neurobiological roots of language in primate audition: common computational properties.

Science.gov (United States)

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.

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.

Computational physics an introduction to Monte Carlo simulations of matrix field theory

CERN Document Server

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...

Effects of computer-based immediate feedback on foreign language listening comprehension and test-associated anxiety.

Science.gov (United States)

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.

Exploring English as a Foreign Language (EFL) Teacher Trainers' Perspectives on Challenges to Promoting Computer Literacy of EFL Teachers

Science.gov (United States)

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…

The possibility of coexistence and co-development in language competition: ecology-society computational model and simulation.

Science.gov (United States)

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.

Attitudes of Jordanian Undergraduate Students towards Using Computer Assisted Language Learning (CALL)

Science.gov (United States)

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…

Matrix multiplication operations with data pre-conditioning in a high performance computing architecture

Science.gov (United States)

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.

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.)

Design and Construction of Computer-Assisted Instructional Material: A Handbook for Reading/Language Arts Teachers.

Science.gov (United States)

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…

Some Matrix Iterations for Computing Generalized Inverses and Balancing Chemical Equations

OpenAIRE

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 ...

Pre-Service Teachers' Uses of and Barriers from Adopting Computer-Assisted Language Learning (CALL) Programs

Science.gov (United States)

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…

Matrix-vector multiplication using digital partitioning for more accurate optical computing

Science.gov (United States)

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.

Teaching computer interfacing with virtual instruments in an object-oriented language.

Science.gov (United States)

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

The employment of a spoken language computer applied to an air traffic control task.

Science.gov (United States)

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.

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

COMPARISON OF PYTHON (AN OPEN SOURCE PROGRAMMING LANGUAGE) WITH OTHER PROGRAMMING LANGUAGES

OpenAIRE

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...

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.)

Learning from a Computer Tutor with Natural Language Capabilities

Science.gov (United States)

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…

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...

Mind and Material: The Interplay between Computer-Related and Second Language Factors in Online Communication Dialogues

Science.gov (United States)

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,…

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 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

Algerian EFL University Teachers' Attitudes towards Computer Assisted Language Learning: The Case of Djilali Liabes University

Science.gov (United States)

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…

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

The Computer Integration into the EFL Instruction in Indonesia: An Analysis of Two University Instructors in Integrating Computer Technology into EFL Instruction to Encourage Students' Language Learning Engagement

Science.gov (United States)

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…

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)

A Functional Specification for a Programming Language for Computer Aided Learning Applications.

Science.gov (United States)

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…

‘Shift’ ‘n ‘control’: The computer as a third interactant in Spanish-language

Science.gov (United States)

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.

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.

An Intelligent Computer-Based System for Sign Language Tutoring

Science.gov (United States)

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…

Listening Strategy Use and Influential Factors in Web-Based Computer Assisted Language Learning

Science.gov (United States)

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…

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.

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)

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)

High level language for measurement complex control based on the computer E-100I

Science.gov (United States)

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.

Development of a KSC test and flight engineering oriented computer language, Phase 1

Science.gov (United States)

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.

Introduction to the Atari Computer. A Program Written in the Pilot Programming Language.

Science.gov (United States)

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)

User's guide for SAMMY: a computer model for multilevel r-matrix fits to neutron data using Bayes' equations

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

A Randomized Field Trial of the Fast ForWord Language Computer-Based Training Program

Science.gov (United States)

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…

Optical character recognition systems for different languages with soft computing

CERN Document Server

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.

Brain-computer interface with language model-electroencephalography fusion for locked-in syndrome.

Science.gov (United States)

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.

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...

An Empirical Generative Framework for Computational Modeling of Language Acquisition

Science.gov (United States)

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…

The growth of language: Universal Grammar, experience, and principles of computation.

Science.gov (United States)

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.

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.

A comparison of hardware description languages. [describing digital systems structure and behavior to a computer

Science.gov (United States)

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.

Study on the algorithm of computational ghost imaging based on discrete fourier transform measurement matrix

Science.gov (United States)

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.

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

A computational model of in vitro angiogenesis based on extracellular matrix fibre orientation.

Science.gov (United States)

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.

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.

Computerized Games and Simulations in Computer-Assisted Language Learning: A Meta-Analysis of Research

Science.gov (United States)

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…

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.

Foreign Language Translation of Chemical Nomenclature by Computer

Science.gov (United States)

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

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.

South African sign language human-computer interface in the context of the national accessibility portal

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...

Computers in the Teaching of English as a Foreign Language: Access to the Diversity of Textual Genres and Language Skills

Science.gov (United States)

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

A Comparative Study of Collagen Matrix Density Effect on Endothelial Sprout Formation Using Experimental and Computational Approaches.

Science.gov (United States)

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

La linguistica, la glottodidattica e l'elaboratore elettronico: Note sull'introduzione dell'informatica nell'insegnamento delle lingue (Linguistics, Language Pedagogy, and Computers: Notes on the Introduction of Computer Science in the Teaching of Languages).

Science.gov (United States)

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)

A Study of the Programming Languages Used in Information Systems and in Computer Science Curricula

Science.gov (United States)

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…

Streaming for Functional Data-Parallel Languages

DEFF Research Database (Denmark)

Madsen, Frederik Meisner

In this thesis, we investigate streaming as a general solution to the space inefficiency commonly found in functional data-parallel programming languages. The data-parallel paradigm maps well to parallel SIMD-style hardware. However, the traditional fully materializing execution strategy...... by extending two existing data-parallel languages: NESL and Accelerate. In the extensions we map bulk operations to data-parallel streams that can evaluate fully sequential, fully parallel or anything in between. By a dataflow, piecewise parallel execution strategy, the runtime system can adjust to any target...... flattening necessitates all sub-computations to materialize at the same time. For example, naive n by n matrix multiplication requires n^3 space in NESL because the algorithm contains n^3 independent scalar multiplications. For large values of n, this is completely unacceptable. We address the problem...

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

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

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...

A reduced-scaling density matrix-based method for the computation of the vibrational Hessian matrix at the self-consistent field level

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

Evidence for phosphorus bonding in phosphorus trichloride-methanol adduct: a matrix isolation infrared and ab initio computational study.

Science.gov (United States)

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.

Towards a Computational Comparative Neuroprimatology: Framing the language-ready brain

Science.gov (United States)

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.

Use of personal computer image for processing a magnetic resonance image (MRI)

International Nuclear Information System (INIS)

Yamamoto, Tetsuo; Tanaka, Hitoshi

1988-01-01

Image processing of MR imaging was attempted by using a popular personal computer as 16-bit model. The computer processed the images on a 256 x 256 matrix and 512 x 512 matrix. The softwer languages for image-processing were those of Macro-Assembler performed by (MS-DOS). The original images, acuired with an 0.5 T superconducting machine (VISTA MR 0.5 T, Picker International) were transfered to the computer by the flexible disket. Image process are the display of image to monitor, other the contrast enhancement, the unsharped mask contrast enhancement, the various filter process, the edge detections or the color histogram was obtained in 1.6 sec to 67 sec, indicating that commercialzed personal computer had ability for routine clinical purpose in MRI-processing. (author)

Assessing oral proficiency in computer-assisted foreign language learning: A study in the context of teletandem interactions

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.

Organization of the channel-switching process in parallel computer systems based on a matrix optical switch

Science.gov (United States)

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.

Computation of the Distribution of the Fiber-Matrix Interface Cracks in the Edge Trimming of CFRP

Science.gov (United States)

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.

Numerical computation of the transport matrix in toroidal plasma with a stochastic magnetic field

Science.gov (United States)

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.

Computer programming and computer systems

CERN Document Server

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

English Language Learners' Strategies for Reading Computer-Based Texts at Home and in School

Science.gov (United States)

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…

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.

Towards a Computational Comparative Neuroprimatology: Framing the language-ready brain.

Science.gov (United States)

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.

Is CALL Obsolete? Language Acquisition and Language Learning Revisited in a Digital Age

Science.gov (United States)

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…

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...

Learning Vocabulary in a Foreign Language: A Computer Software Based Model Attempt

Science.gov (United States)

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…

Programming Languages or Generic Software Tools, for Beginners' Courses in Computer Literacy?

Science.gov (United States)

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)

Intra-hemispheric intrinsic connectivity asymmetry and its relationships with handedness and language Lateralization.

Science.gov (United States)

Joliot, M; Tzourio-Mazoyer, N; Mazoyer, B

2016-12-01

Asymmetry in intra-hemispheric intrinsic connectivity, and its association with handedness and hemispheric dominance for language, were investigated in a sample of 290 healthy volunteers enriched in left-handers (52.7%). From the resting-state FMRI data of each participant, we derived an intra-hemispheric intrinsic connectivity asymmetry (HICA) matrix as the difference between the left and right intra-hemispheric matrices of intrinsic correlation computed for each pair of the AICHA atlas ROIs. We defined a similarity measure between the HICA matrices of two individuals as the correlation coefficient of their corresponding elements, and computed for each individual an index of intra-hemispheric intrinsic connectivity asymmetry as the average similarity measure of his HICA matrix to those of the other subjects of the sample (HICAs). Gaussian-mixture modeling of the age-corrected HICAs sample distribution revealed that two types of HICA patterns were present, one (Typical_HICA) including 92.4% of the participants while the other (Atypical_HICA) included only 7.6% of them, mostly left-handers. In addition, we investigated the relationship between asymmetry in intra-hemispheric intrinsic connectivity and language hemispheric dominance, including a potential effect of handedness on this relationship, thanks to an FMRI acquisition during language production from which an hemispheric functional lateralization index for language (HFLI) and a type of hemispheric dominance for language, namely leftward, ambilateral, or rightward, were derived for each individual. There was a significant association between the types of language hemispheric dominance and of intra-hemispheric intrinsic connectivity asymmetry, occurrence of Atypical_HICAs individuals being very high in the group of individuals rightward-lateralized for language (80%), reduced in the ambilateral group (19%) and rare in individuals leftward-lateralized for language (less than 3%). Quantitatively, we found a

Computational segmentation of collagen fibers in bone matrix indicates bone quality in ovariectomized rat spine.

Science.gov (United States)

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.

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.

Systemic functional grammar in natural language generation linguistic description and computational representation

CERN Document Server

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

Assembly processor program converts symbolic programming language to machine language

Science.gov (United States)

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.

Considerations on command and response language features for a network of heterogeneous autonomous computers

Science.gov (United States)

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.

Resolution of ambiguities in cartoons as an illustration of the role of pragmatics in natural language understanding by computers

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.

Computational study of textured ferroelectric polycrystals: Dielectric and piezoelectric properties of template-matrix composites

Science.gov (United States)

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

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.

A formal approach to the analysis of clinical computer-interpretable guideline modeling languages.

Science.gov (United States)

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.

Multi-threaded Sparse Matrix-Matrix Multiplication for Many-Core and GPU Architectures.

Energy Technology Data Exchange (ETDEWEB)

Deveci, Mehmet [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Rajamanickam, Sivasankaran [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Trott, Christian Robert [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

2017-12-01

Sparse Matrix-Matrix multiplication is a key kernel that has applications in several domains such as scienti c computing and graph analysis. Several algorithms have been studied in the past for this foundational kernel. In this paper, we develop parallel algorithms for sparse matrix-matrix multiplication with a focus on performance portability across different high performance computing architectures. The performance of these algorithms depend on the data structures used in them. We compare different types of accumulators in these algorithms and demonstrate the performance difference between these data structures. Furthermore, we develop a meta-algorithm, kkSpGEMM, to choose the right algorithm and data structure based on the characteristics of the problem. We show performance comparisons on three architectures and demonstrate the need for the community to develop two phase sparse matrix-matrix multiplication implementations for efficient reuse of the data structures involved.

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...

A Computer Assisted Method to Track Listening Strategies in Second Language Learning

Science.gov (United States)

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…

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...

Validating a Computer-Assisted Language Learning Attitude Instrument Used in Iranian EFL Context: An Evidence-Based Approach

Science.gov (United States)

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…

Algorithms for computing solvents of unilateral second-order matrix polynomials over prime finite fields using lambda-matrices

Science.gov (United States)

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.

Multi-threaded Sparse Matrix Sparse Matrix Multiplication for Many-Core and GPU Architectures.

Energy Technology Data Exchange (ETDEWEB)

Deveci, Mehmet [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Trott, Christian Robert [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Rajamanickam, Sivasankaran [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

2018-01-01

Sparse Matrix-Matrix multiplication is a key kernel that has applications in several domains such as scientific computing and graph analysis. Several algorithms have been studied in the past for this foundational kernel. In this paper, we develop parallel algorithms for sparse matrix- matrix multiplication with a focus on performance portability across different high performance computing architectures. The performance of these algorithms depend on the data structures used in them. We compare different types of accumulators in these algorithms and demonstrate the performance difference between these data structures. Furthermore, we develop a meta-algorithm, kkSpGEMM, to choose the right algorithm and data structure based on the characteristics of the problem. We show performance comparisons on three architectures and demonstrate the need for the community to develop two phase sparse matrix-matrix multiplication implementations for efficient reuse of the data structures involved.

Computing wave functions in multichannel collisions with non-local potentials using the R-matrix method

Science.gov (United States)

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.

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

Efficient multitasking of Choleski matrix factorization on CRAY supercomputers

Science.gov (United States)

Overman, Andrea L.; Poole, Eugene L.

1991-01-01

A Choleski method is described and used to solve linear systems of equations that arise in large scale structural analysis. The method uses a novel variable-band storage scheme and is structured to exploit fast local memory caches while minimizing data access delays between main memory and vector registers. Several parallel implementations of this method are described for the CRAY-2 and CRAY Y-MP computers demonstrating the use of microtasking and autotasking directives. A portable parallel language, FORCE, is used for comparison with the microtasked and autotasked implementations. Results are presented comparing the matrix factorization times for three representative structural analysis problems from runs made in both dedicated and multi-user modes on both computers. CPU and wall clock timings are given for the parallel implementations and are compared to single processor timings of the same algorithm.

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.

SU-D-206-02: Evaluation of Partial Storage of the System Matrix for Cone Beam Computed Tomography Using a GPU Platform

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

SU-D-206-02: Evaluation of Partial Storage of the System Matrix for Cone Beam Computed Tomography Using a GPU Platform

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

A computational technique to identify the optimal stiffness matrix for a discrete nuclear fuel assembly model

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

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.

Science.gov (United States)

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.

A phenomenographic study of the ways of understanding conditional and repetition structures in computer programming languages

Science.gov (United States)

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

The Euclid Statistical Matrix Tool

Directory of Open Access Journals (Sweden)

Curtis Tilves

2017-06-01

Full Text Available Stataphobia, a term used to describe the fear of statistics and research methods, can result from a lack of improper training in statistical methods. Poor statistical methods training can have an effect on health policy decision making and may play a role in the low research productivity seen in developing countries. One way to reduce Stataphobia is to intervene in the teaching of statistics in the classroom; however, such an intervention must tackle several obstacles, including student interest in the material, multiple ways of learning materials, and language barriers. We present here the Euclid Statistical Matrix, a tool for combatting Stataphobia on a global scale. This free tool is comprised of popular statistical YouTube channels and web sources that teach and demonstrate statistical concepts in a variety of presentation methods. Working with international teams in Iran, Japan, Egypt, Russia, and the United States, we have also developed the Statistical Matrix in multiple languages to address language barriers to learning statistics. By utilizing already-established large networks, we are able to disseminate our tool to thousands of Farsi-speaking university faculty and students in Iran and the United States. Future dissemination of the Euclid Statistical Matrix throughout the Central Asia and support from local universities may help to combat low research productivity in this region.

Fluctuating hyperfine interactions: computational implementation

International Nuclear Information System (INIS)

Zacate, M. O.; Evenson, W. E.

2010-01-01

A library of computational routines has been created to assist in the analysis of stochastic models of hyperfine interactions. We call this library the stochastic hyperfine interactions modeling library (SHIML). It provides routines written in the C programming language that (1) read a text description of a model for fluctuating hyperfine fields, (2) set up the Blume matrix, upon which the evolution operator of the system depends, and (3) find the eigenvalues and eigenvectors of the Blume matrix so that theoretical spectra of experimental hyperfine interaction measurements can be calculated. Example model calculations are included in the SHIML package to illustrate its use and to generate perturbed angular correlation spectra for the special case of polycrystalline samples when anisotropy terms of higher order than A 22 can be neglected.

Computer programs in BASIC language for atomic absorption flame spectroscopy. Part 1. Operating instructions

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

Whole Language, Computers and CD-ROM Technology: A Kindergarten Unit on "Benjamin Bunny."

Science.gov (United States)

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…

Can Synchronous Computer-Mediated Communication (CMC) Help Beginning-Level Foreign Language Learners Speak?

Science.gov (United States)

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,…

The Julia programming language: the future of scientific computing

Science.gov (United States)

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.

On the Computational Complexity of the Languages of General Symbolic Dynamical Systems and Beta-Shifts

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...

Toward an Understanding of Preservice English as a Foreign Language Teachers' Acceptance of Computer-Assisted Language Learning 2.0 in the People's Republic of China

Science.gov (United States)

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…

SIAM 1978 fall meeting and symposium on sparse matrix computations. [Knoxville, Tenn. , October 30--November 3

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)

Bridges to Swaziland: Using Task-Based Learning and Computer-Mediated Instruction to Improve English Language Teaching and Learning

Science.gov (United States)

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…

Computer applications in physics with FORTRAN, BASIC and C

CERN Document Server

Chandra, Suresh

2014-01-01

Because of encouraging response for first two editions of the book and for taking into account valuable suggestion from teachers as well as students, the text for Interpolation, Differentiation, Integration, Roots of an Equation, Solution of Simultaneous Equations, Eigenvalues and Eigenvectors of Matrix, Solution of Differential Equations, Solution of Partial Differential Equations, Monte Carlo Method and Simulation, Computation of some Functions is improved throughout and presented in a more systematic manner by using simple language. These techniques have vast applications in Science, Engineering and Technology. The C language is becoming popular in universities, colleges and engineering institutions. Besides the C language, programs are written in FORTRAN and BASIC languages. Consequently, this book has rather wide scope for its use. Each of the topics are developed in a systematic manner; thus making this book useful for graduate, postgraduate and engineering students. KEY FEATURES: Each topic is self exp...

Electronic Circuit Analysis Language (ECAL)

Science.gov (United States)

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.

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.

L'Ordinateur dans l'enseignement des langues: un colosse aux pieds d'argile? (The Computer in Language Teaching: A Giant with Clay Feet?)

Science.gov (United States)

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)

Mutually Beneficial Foreign Language Learning: Creating Meaningful Interactions through Video-Synchronous Computer-Mediated Communication

Science.gov (United States)

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…

Second language writing anxiety, computer anxiety, and performance in a classroom versus a web-based environment

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.

Residual, restarting and Richardson iteration for the matrix exponential

NARCIS (Netherlands)

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

NARCIS (Netherlands)

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

Tracking Typological Traits of Uralic Languages in Distributed Language Representations

DEFF Research Database (Denmark)

Bjerva, Johannes; Augenstein, Isabelle

2018-01-01

Although linguistic typology has a long history, computational approaches have only recently gained popularity. The use of distributed representations in computational linguistics has also become increasingly popular. A recent development is to learn distributed representations of language...... for model transfer between Uralic languages in deep neural networks. We then investigate which typological features are encoded in these representations by attempting to predict features in the World Atlas of Language Structures, at various stages of fine-tuning of the representations. We focus on Uralic...

Ezhil: A Tamil Programming Language

OpenAIRE

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...

Environmental Factors Affecting Computer Assisted Language Learning Success: A Complex Dynamic Systems Conceptual Model

Science.gov (United States)

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…

[The Russian-language version of the matrix test (RUMatrix) in free field in patients after cochlear implantation in the long term].

Science.gov (United States)

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.

Hardware synthesis from DDL. [Digital Design Language for computer aided design and test of LSI

Science.gov (United States)

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.

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

An Innovative Approach to Balancing Chemical-Reaction Equations: A Simplified Matrix-Inversion Technique for Determining The Matrix Null Space

OpenAIRE

Thorne, Lawrence R.

2011-01-01

I propose a novel approach to balancing equations that is applicable to all chemical-reaction equations; it is readily accessible to students via scientific calculators and basic computer spreadsheets that have a matrix-inversion application. The new approach utilizes the familiar matrix-inversion operation in an unfamiliar and innovative way; its purpose is not to identify undetermined coefficients as usual, but, instead, to compute a matrix null space (or matrix kernel). The null space then...

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.

A Computational Approach to Quantifiers as an Explanation for Some Language Impairments in Schizophrenia

Science.gov (United States)

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…

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

A Research into the Pedagogic Formation, Foreign Language and Computer Related Knowledge of Track and Field Trainers in Turkey

Science.gov (United States)

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…

A SCILAB Program for Computing Rotating Magnetic Compact Objects

Science.gov (United States)

Papasotiriou, P. J.; Geroyannis, V. S.

We implement the so-called ``complex-plane iterative technique'' (CIT) to the computation of classical differentially rotating magnetic white dwarf and neutron star models. The program has been written in SCILAB (© INRIA-ENPC), a matrix-oriented high-level programming language, which can be downloaded free of charge from the site http://www-rocq.inria.fr/scilab. Due to the advanced capabilities of this language, the code is short and understandable. Highlights of the program are: (a) time-saving character, (b) easy use due to the built-in graphics user interface, (c) easy interfacing with Fortran via online dynamic link. We interpret our numerical results in various ways by extensively using the graphics environment of SCILAB.

The Sizing and Optimization Language (SOL): A computer language to improve the user/optimizer interface

Science.gov (United States)

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.

Design Of Computer Based Test Using The Unified Modeling Language

Science.gov (United States)

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.

Modelling language

CERN Document Server

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

Noniterative MAP reconstruction using sparse matrix representations.

Science.gov (United States)

Cao, Guangzhi; Bouman, Charles A; Webb, Kevin J

2009-09-01

We present a method for noniterative maximum a posteriori (MAP) tomographic reconstruction which is based on the use of sparse matrix representations. Our approach is to precompute and store the inverse matrix required for MAP reconstruction. This approach has generally not been used in the past because the inverse matrix is typically large and fully populated (i.e., not sparse). In order to overcome this problem, we introduce two new ideas. The first idea is a novel theory for the lossy source coding of matrix transformations which we refer to as matrix source coding. This theory is based on a distortion metric that reflects the distortions produced in the final matrix-vector product, rather than the distortions in the coded matrix itself. The resulting algorithms are shown to require orthonormal transformations of both the measurement data and the matrix rows and columns before quantization and coding. The second idea is a method for efficiently storing and computing the required orthonormal transformations, which we call a sparse-matrix transform (SMT). The SMT is a generalization of the classical FFT in that it uses butterflies to compute an orthonormal transform; but unlike an FFT, the SMT uses the butterflies in an irregular pattern, and is numerically designed to best approximate the desired transforms. We demonstrate the potential of the noniterative MAP reconstruction with examples from optical tomography. The method requires offline computation to encode the inverse transform. However, once these offline computations are completed, the noniterative MAP algorithm is shown to reduce both storage and computation by well over two orders of magnitude, as compared to a linear iterative reconstruction methods.

Using a Dialogue System Based on Dialogue Maps for Computer Assisted Second Language Learning

Science.gov (United States)

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…

Use of Computer Technology for English Language Learning: Do Learning Styles, Gender, and Age Matter?

Science.gov (United States)

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'…

L'Ordinateur, Un Nouveau Pedagogue? Quelques Exemples d'Application de l'Ordinateur a l'Enseignement des Langues Vivantes (The Computer: A New Teacher? Some Examples of the Use of the Computer in Second Language Teaching). Melanges Pedagogiques, 1975.

Science.gov (United States)

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…

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

Combining Self-Explaining with Computer Architecture Diagrams to Enhance the Learning of Assembly Language Programming

Science.gov (United States)

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…

On the Performance of the Python Programming Language for Serial and Parallel Scientific Computations

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.

A SCILAB Program for Computing General-Relativistic Models of Rotating Neutron Stars by Implementing Hartle's Perturbation Method

Science.gov (United States)

Papasotiriou, P. J.; Geroyannis, V. S.

We implement Hartle's perturbation method to the computation of relativistic rigidly rotating neutron star models. The program has been written in SCILAB (© INRIA ENPC), a matrix-oriented high-level programming language. The numerical method is described in very detail and is applied to many models in slow or fast rotation. We show that, although the method is perturbative, it gives accurate results for all practical purposes and it should prove an efficient tool for computing rapidly rotating pulsars.

Programming languages for MIS concepts and practice

CERN Document Server

Wang, Hai

2014-01-01

Introduction Computers Computer Programming Languages     Role of Computer Programming Language      Software Systems     Taxonomies of Computer Programming LanguagesComputing Architecture in the Internet Environment Key Characteristics Shared by All Procedural Programming Languages      Syntax, Sentence, and Word     Variable     Arithmetic Operation     Execution Sequence      If-Then-Else Logic      Loop      Module C++ Introduction to Function-Oriented and Object-Oriented Programming A Tour of C Language      C and C++ Keyword and User-Defined Word      Comment Statements      Preprocessor

Modern programming language

Science.gov (United States)

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.

Computer Music

Science.gov (United States)

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.).

Language Needs Analysis of Iranian Undergraduate Students of Computer Engineering: A Study of Reading Skill

Science.gov (United States)

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…

The Effects of Self-Explanation and Reading Questions and Answers on Learning Computer Programming Language

Science.gov (United States)

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'…

Combination of artificial intelligence and procedural language programs in a computer application system supporting nuclear reactor operations

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

Combination of artificial intelligence and procedural language programs in a computer application system supporting nuclear reactor operations

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

Principles of a reversible programming language

DEFF Research Database (Denmark)

Yokoyama, Tetsuo; Axelsen, Holger Bock; Glück, Robert

2008-01-01

The principles of reversible programming languages are explicated and illustrated with reference to the design of a high-level imperative language, Janus. The fundamental properties for such languages include backward as well as forward determinism and reversible updates of data. The unique design...... languages, and demonstrate this for Janus. We show the practicality of the language by implementation of a reversible fast Fourier transform. Our results indicate that the reversible programming paradigm has fundamental properties that are relevant to many different areas of computer science....... features of the language include explicit post-condition assertions, direct access to an inverse semantics and the possibility of clean (i.e., garbage-free) computation of injective functions. We suggest the clean simulation of reversible Turing machines as a criterion for computing strength of reversible...

Visualizing Matrix Multiplication

Science.gov (United States)

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…

Eighth SIAM conference on parallel processing for scientific computing: Final program and abstracts

Energy Technology Data Exchange (ETDEWEB)

NONE

1997-12-31

This SIAM conference is the premier forum for developments in parallel numerical algorithms, a field that has seen very lively and fruitful developments over the past decade, and whose health is still robust. Themes for this conference were: combinatorial optimization; data-parallel languages; large-scale parallel applications; message-passing; molecular modeling; parallel I/O; parallel libraries; parallel software tools; parallel compilers; particle simulations; problem-solving environments; and sparse matrix computations.

THE COGNITIVE MATRIX OF EMOTIONAL-COMMUNICATIVE PERSONALITY

Directory of Open Access Journals (Sweden)

В И Шаховский

2018-12-01

. Bali, 1944; A. Binet, 1946; F. Daneṧ, 1987; B. Volek, 1987; R. Dirven, 1997; S. Niemeier, 1997; A. Wierzbicka, 1999 and others. The main research methods used in the article are the critical analysis of theoretical studies, by means of the hypothetical-deductive method, and the scientific intuition of the author of the article. It is found that 1 Language Personality Theory is many-faced but does not constitute a full picture of the described phenomenon, which does not, in its turn, allow to accept a common definition of the language personality; 2 due to the development of emotive linguistics and the theory of communication, it is obvious that there is a lack of the structure-emotive component in the language personality matrix. Also, due to the emergence and rapid development of the linguistics of emo-tions and the theory of communication, a gap in the structure of the language personality has become evident - namely, the absence of the emotional structural component in its model (matrix. In this regard, the article provides argumentation to support the introduction of a new term - “emotionally-communicative personality”, as well as an attempt to describe the cognitive matrix of the emotionally-communicative per-sonality along with the term “language personality”. The new term completes the term “language persona-lity”; 3 the structural emotive component of language personality allows to explain how language per-sonality can be ecological or non-ecological; 4 the term “matrix” helps explaining the emotive-cognitive intellectual competence of homo loquens / homo sentiens.

1957-2007: 50 Years of Higher Order Programming Languages

Directory of Open Access Journals (Sweden)

Alen Lovrenčić

2009-06-01

Full Text Available Fifty years ago one of the greatest breakthroughs in computer programming and in the history of computers happened -- the appearance of FORTRAN, the first higher-order programming language. From that time until now hundreds of programming languages were invented, different programming paradigms were defined, all with the main goal to make computer programming easier and closer to as many people as possible. Many battles were fought among scientists as well as among developers around concepts of programming, programming languages and paradigms. It can be said that programming paradigms and programming languages were very often a trigger for many changes and improvements in computer science as well as in computer industry. Definitely, computer programming is one of the cornerstones of computer science.Today there are many tools that give a help in the process of programming, but there is still a programming tasks that can be solved only manually. Therefore, programming is still one of the most creative parts of interaction with computers.Programmers should chose programming language in accordance to task they have to solve, but very often, they chose it in accordance to their personal preferences, their beliefs and many other subjective reasons.Nevertheless, the market of programming languages can be merciless to languages as history was merciless to some people, even whole nations. Programming languages and developers get born, live and die leaving more or less tracks and successors, and not always the best survives. The history of programming languages is closely connected to the history of computers and computer science itself. Every single thing from one of them has its reflexions onto the other. This paper gives a short overview of last fifty years of computer programming and computer programming languages, but also gives many ideas that influenced other aspects of computer science. Particularly, programming paradigms are described, their

International Conference on Matrix Analysis and its Applications 2015

CERN Document Server

2017-01-01

This volume presents recent advances in the field of matrix analysis based on contributions at the MAT-TRIAD 2015 conference. Topics covered include interval linear algebra and computational complexity, Birkhoff polynomial basis, tensors, graphs, linear pencils, K-theory and statistic inference, showing the ubiquity of matrices in different mathematical areas. With a particular focus on matrix and operator theory, statistical models and computation, the International Conference on Matrix Analysis and its Applications 2015, held in Coimbra, Portugal, was the sixth in a series of conferences. Applied and Computational Matrix Analysis will appeal to graduate students and researchers in theoretical and applied mathematics, physics and engineering who are seeking an overview of recent problems and methods in matrix analysis.

Research in advanced formal theorem-proving techniques. [design and implementation of computer languages

Science.gov (United States)

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.

Response matrix method for large LMFBR analysis

International Nuclear Information System (INIS)

King, M.J.

1977-06-01

The feasibility of using response matrix techniques for computational models of large LMFBRs is examined. Since finite-difference methods based on diffusion theory have generally found a place in fast-reactor codes, a brief review of their general matrix foundation is given first in order to contrast it to the general strategy of response matrix methods. Then, in order to present the general method of response matrix technique, two illustrative examples are given. Matrix algorithms arising in the application to large LMFBRs are discussed, and the potential of the response matrix method is explored for a variety of computational problems. Principal properties of the matrices involved are derived with a view to application of numerical methods of solution. The Jacobi iterative method as applied to the current-balance eigenvalue problem is discussed

VAL language: description and analysis

International Nuclear Information System (INIS)

McGraw, J.R.

1982-01-01

VAL is a high-level, function-based language designed for use on data flow computers. A data flow computer has many small processors organized to cooperate in the executive of a single computation. A computation is represented by its data flow graph; each operator in a graph is scheduled for execution on one of the processors after all of its operands' values are known. VAL promotes the indentification of concurrency in algorithms and simplifies the mapping into data graphs. This paper presents a detailed introduction to VAL and analyzes its usefulness for programming in a highly concurrent environment. VAL provides implicit concurrency (operations that can execute simultaneously are evident without the need for any explicit language notation). The language uses function- and expression-based features that prohibit all side effects, which simplifies translation to graphs. The salient language features are described and illustrated through examples taken from a complete VAL program for adaptive quadrature. Analysis of the language shows that VAL meets the critical needs for a data flow environment. The language encourages programmers to think in terms of general concurrency, enhances readability (due to the absence of side effects), and possesses a structure amenable to verification techniques. However, VAL is still evolving. The language definition needs refining, and more support tools for programmer use need to be developed. Also, some new kinds of optimization problems should be addressed

A language for data-parallel and task parallel programming dedicated to multi-SIMD computers. Contributions to hydrodynamic simulation with lattice gases

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

Language Views on Social Networking Sites for Language Learning: The Case of Busuu

Science.gov (United States)

Álvarez Valencia, José Aldemar

2016-01-01

Social networking has compelled the area of computer-assisted language learning (CALL) to expand its research palette and account for new virtual ecologies that afford language learning and socialization. This study focuses on Busuu, a social networking site for language learning (SNSLL), and analyzes the views of language that are enacted through…

Human Computer Collaboration at the Edge: Enhancing Collective Situation Understanding with Controlled Natural Language

Science.gov (United States)

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

Thermal and mechanical behavior of metal matrix and ceramic matrix composites

Science.gov (United States)

Kennedy, John M. (Editor); Moeller, Helen H. (Editor); Johnson, W. S. (Editor)

1990-01-01

The present conference discusses local stresses in metal-matrix composites (MMCs) subjected to thermal and mechanical loads, the computational simulation of high-temperature MMCs' cyclic behavior, an analysis of a ceramic-matrix composite (CMC) flexure specimen, and a plasticity analysis of fibrous composite laminates under thermomechanical loads. Also discussed are a comparison of methods for determining the fiber-matrix interface frictional stresses of CMCs, the monotonic and cyclic behavior of an SiC/calcium aluminosilicate CMC, the mechanical and thermal properties of an SiC particle-reinforced Al alloy MMC, the temperature-dependent tensile and shear response of a graphite-reinforced 6061 Al-alloy MMC, the fiber/matrix interface bonding strength of MMCs, and fatigue crack growth in an Al2O3 short fiber-reinforced Al-2Mg matrix MMC.

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

Rana computatrix to human language: towards a computational neuroethology of language evolution.

Science.gov (United States)

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.

Reproducible computational biology experiments with SED-ML--the Simulation Experiment Description Markup Language.

Science.gov (United States)

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

Reproducible computational biology experiments with SED-ML - The Simulation Experiment Description Markup Language

Science.gov (United States)

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

SKILLS-BASED ECLECTIC TECHNIQUES MATRIX FOR ELT MICROTEACHINGS

Directory of Open Access Journals (Sweden)

İskender Hakkı Sarıgöz

2016-10-01

Full Text Available Foreign language teaching undergoes constant changes due to the methodological improvement. This progress may be examined in two parts. They are the methods era and the post-methods era. It is not pragmatic today to propose a particular language teaching method and its techniques for all purposes. The holistic inflexibility of mid-century methods has long gone. In the present day, constructivist foreign language teaching trends attempt to see the learner as a whole person and an individual who may be different from the other students in many respects. At the same time, the individual differences should not keep the learners away from group harmony. For this reason, current teacher training programs require eclectic teaching matrixes for unit design considering the mixed ability student groups. These matrixes can be prepared in a multidimensional fashion because there are many functional techniques in different methods and other new techniques to be created by instructors freely in accordance with the teaching aims. The hypothesis in this argument is that the collection of foreign language teaching techniques compiled in ELT microteachings for a particular group of learners has to be arranged eclectically in order to update the teaching process. Nevertheless, designing a teaching format of this sort is a demanding and highly criticized task. This study briefly argues eclecticism in language-skills based methodological struggle from the perspective of ELT teacher education.

Artificial intelligence programming languages for computer aided manufacturing

Science.gov (United States)

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.

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

Matrix algebra theory, computations and applications in statistics

CERN Document Server

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...

LABORATORY PROCESS CONTROLLER USING NATURAL LANGUAGE COMMANDS FROM A PERSONAL COMPUTER

Science.gov (United States)

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.

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.

Language, mobile phones and internet : a study of SMS texting, email, IM and SNS chats in computer mediated communication (CMC) in Kenya

NARCIS (Netherlands)

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

Efficient diagonalization of the sparse matrices produced within the framework of the UK R-matrix molecular codes

Science.gov (United States)

Galiatsatos, P. G.; Tennyson, J.

2012-11-01

The most time consuming step within the framework of the UK R-matrix molecular codes is that of the diagonalization of the inner region Hamiltonian matrix (IRHM). Here we present the method that we follow to speed up this step. We use shared memory machines (SMM), distributed memory machines (DMM), the OpenMP directive based parallel language, the MPI function based parallel language, the sparse matrix diagonalizers ARPACK and PARPACK, a variation for real symmetric matrices of the official coordinate sparse matrix format and finally a parallel sparse matrix-vector product (PSMV). The efficient application of the previous techniques rely on two important facts: the sparsity of the matrix is large enough (more than 98%) and in order to get back converged results we need a small only part of the matrix spectrum.

BT-Nurse: computer generation of natural language shift summaries from complex heterogeneous medical data.

Science.gov (United States)

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.

How Can We Use Corpus Wordlists for Language Learning? Interfaces between Computer Corpora and Expert Intervention

Science.gov (United States)

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…

Investigating the Effectiveness of Computer-Assisted Language Learning (CALL) Using Google Documents in Enhancing Writing--A Study on Senior 1 Students in a Chinese Independent High School

Science.gov (United States)

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…

The physics of randomness and regularities for languages (lifetimes, family trees, and the second languages); in terms of random matrices

OpenAIRE

Tuncay, Caglar

2007-01-01

The physics of randomness and regularities for languages (mother tongues) and their lifetimes and family trees and for the second languages are studied in terms of two opposite processes; random multiplicative noise [1], and fragmentation [2], where the original model is given in the matrix format. We start with a random initial world, and come out with the regularities, which mimic various empirical data [3] for the present languages.

Language matters a guide to everyday questions about language

CERN Document Server

Napoli, Donna Jo

2003-01-01

Is Ebonics really a dialect or simply bad English? Do women and men speak differently? Will computers ever really learn human language? The author shows how many of our most deeply held ideas about language and its role in our lives are either misconceived or influenced by myths and stereotypes.

CPL: A Core Language for Cloud Computing

OpenAIRE

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...

An IBM 370 assembly language program verifier

Science.gov (United States)

Maurer, W. D.

1977-01-01

The paper describes a program written in SNOBOL which verifies the correctness of programs written in assembly language for the IBM 360 and 370 series of computers. The motivation for using assembly language as a source language for a program verifier was the realization that many errors in programs are caused by misunderstanding or ignorance of the characteristics of specific computers. The proof of correctness of a program written in assembly language must take these characteristics into account. The program has been compiled and is currently running at the Center for Academic and Administrative Computing of The George Washington University.

Introduction to Computational Chemistry: Teaching Hu¨ckel Molecular Orbital Theory Using an Excel Workbook for Matrix Diagonalization

Science.gov (United States)

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…

Development of a Java Package for Matrix Programming

OpenAIRE

Lim, Ngee-Peng; Ling, Maurice HT; Lim, Shawn YC; Choi, Ji-Hee; Teo, Henry BK

2003-01-01

We had assembled a Java package, known as MatrixPak, of four classes for the purpose of numerical matrix computation. The classes are matrix, matrix_operations, StrToMatrix, and MatrixToStr; all of which are inherited from java.lang.Object class. Class matrix defines a matrix as a two-dimensional array of float types, and contains the following mathematical methods: transpose, adjoint, determinant, inverse, minor and cofactor. Class matrix_operations contains the following mathematical method...

Matrix thermalization

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.

Matrix thermalization

Science.gov (United States)

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.

Matrix thermalization

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.

Teachers' Perceptions of the Use of Computer Assisted Language Learning to Develop Children's Reading Skills in English as a Second Language in the United Arab Emirates

Science.gov (United States)

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…

Computing Accurate Grammatical Feedback in a Virtual Writing Conference for German-Speaking Elementary-School Children: An Approach Based on Natural Language Generation

Science.gov (United States)

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…

Tutorial Computer-Assisted Language Learning

Science.gov (United States)

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…

Computer-assisted Language Learning for the Development of Listening Skills: A Case Study of Pre-university Russian as a Foreign Language

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.

Speech data collection in an under-resourced language within a multilingual context

CSIR Research Space (South Africa)

Molapo, B

2014-05-01

Full Text Available first describe the collection and processing of the text corpus crawled from the World Wide Web using the Rapid Language Adaptation Toolkit. In particular, we highlight the challenges faced when foreign languages are embedded within the matrix language...

HAL/S programmer's guide. [space shuttle flight software language

Science.gov (United States)

Newbold, P. M.; Hotz, R. L.

1974-01-01

HAL/S is a programming language developed to satisfy the flight software requirements for the space shuttle program. The user's guide explains pertinent language operating procedures and described the various HAL/S facilities for manipulating integer, scalar, vector, and matrix data types.

Second Language Writing Anxiety, Computer Anxiety, and Performance in a Classroom versus a Web-Based Environment

Science.gov (United States)

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…

Introducing Laptops to Children: An Examination of Ubiquitous Computing in Grade 3 Reading, Language, and Mathematics

Science.gov (United States)

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. 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…

Advances in natural language processing.

Science.gov (United States)

Hirschberg, Julia; Manning, Christopher D

2015-07-17

Natural language processing employs computational techniques for the purpose of learning, understanding, and producing human language content. Early computational approaches to language research focused on automating the analysis of the linguistic structure of language and developing basic technologies such as machine translation, speech recognition, and speech synthesis. Today's researchers refine and make use of such tools in real-world applications, creating spoken dialogue systems and speech-to-speech translation engines, mining social media for information about health or finance, and identifying sentiment and emotion toward products and services. We describe successes and challenges in this rapidly advancing area. Copyright © 2015, American Association for the Advancement of Science.

Tensor operators in R-matrix approach

International Nuclear Information System (INIS)

Bytsko, A.G.; Rossijskaya Akademiya Nauk, St. Petersburg

1995-12-01

The definitions and some properties (e.g. the Wigner-Eckart theorem, the fusion procedure) of covariant and contravariant q-tensor operators for quasitriangular quantum Lie algebras are formulated in the R-matrix language. The case of U q (sl(n)) (in particular, for n=2) is discussed in more detail. (orig.)

Algerian EFL University Teachers’ Attitudes towards Computer Assisted Language Learning: The Case of Djilali Liabes University

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.

Introduction to computational linear algebra

CERN Document Server

Nassif, Nabil; Erhel, Jocelyne

2015-01-01

Introduction to Computational Linear Algebra introduces the reader with a background in basic mathematics and computer programming to the fundamentals of dense and sparse matrix computations with illustrating examples. The textbook is a synthesis of conceptual and practical topics in ""Matrix Computations."" The book's learning outcomes are twofold: to understand state-of-the-art computational tools to solve matrix computations problems (BLAS primitives, MATLAB® programming) as well as essential mathematical concepts needed to master the topics of numerical linear algebra. It is suitable for s

Mixed language programming

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)

Emerging Approach of Natural Language Processing in Opinion Mining: A Review

Science.gov (United States)

Kim, Tai-Hoon

Natural language processing (NLP) is a subfield of artificial intelligence and computational linguistics. It studies the problems of automated generation and understanding of natural human languages. This paper outlines a framework to use computer and natural language techniques for various levels of learners to learn foreign languages in Computer-based Learning environment. We propose some ideas for using the computer as a practical tool for learning foreign language where the most of courseware is generated automatically. We then describe how to build Computer Based Learning tools, discuss its effectiveness, and conclude with some possibilities using on-line resources.

Exploration of the Attitudes of Freshman Foreign Language Students toward Using Computers at a Turkish State University

Science.gov (United States)

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…

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.

The Internet, Language Learning, and International Dialogue: Constructing Online Foreign Language Learning Websites

Science.gov (United States)

Kartal, Erdogan; Uzun, Levent

2010-01-01

In the present study we call attention to the close connection between languages and globalization, and we also emphasize the importance of the Internet and online websites in foreign language teaching and learning as unavoidable elements of computer assisted language learning (CALL). We prepared a checklist by which we investigated 28 foreign…

Challenges and insights for situated language processing: Comment on "Towards a computational comparative neuroprimatology: Framing the language-ready brain" by Michael A. Arbib

Science.gov (United States)

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].

The Didactics of Foreign Language Teaching with Multimedia

NARCIS (Netherlands)

Kanselaar, G.

1993-01-01

The way computers are used in foreign language teaching reflects teachers’ ideas about how foreign languages should be learned. We describe different methods of foreign language teaching, one of which is at the base of our computer program IT’S English. In this program, different types of exercises

Programming Languages RESONAN

Indian Academy of Sciences (India)

Introduction. Programming languages for computers are developed with the ... detailed algorithm to solve a problem is the starting point and it is expressed as ... All modern programming .... which precisely specify the 'words' of the language, and how they may .... network within an organization using protocols and providing.

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.

TGIN language reference manual: NAMMU and MATDIF commands

International Nuclear Information System (INIS)

Cliffe, K.A.; Herbert, A.W.

1992-03-01

NAMMU is a finite-element program for modelling groundwater flow and transport. The matrix diffusion option models the transport of radionuclides including the effects of rock-matrix diffusion. It uses the free-format structured-input TGIN. This report describes the commands in the TGIN language for running the NAMMU and MATDIF package. (author)

The Internet, Language Learning, And International Dialogue: 
Constructing Online Foreign Language Learning Websites

OpenAIRE

KARTAL, Erdogan; UZUN, Levent

2015-01-01

In the present study we call attention to the close connection between languages and globalization, and we also emphasize the importance of the Internet and online websites in foreign language teaching and learning as unavoidable elements of computer assisted language learning (CALL). We prepared a checklist by which we investigated 28 foreign language teaching websites (4 from each of seven languages including English, French, German, Italian, Russian, Spanish and Turkish). The participants ...

Effects of Synchronous and Asynchronous Computer-Mediated Communication (CMC) Oral Conversations on English Language Learners' Discourse Functions

Science.gov (United States)

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…

Unsupervised Language Acquisition

Science.gov (United States)

de Marcken, Carl

1996-11-01

This thesis presents a computational theory of unsupervised language acquisition, precisely defining procedures for learning language from ordinary spoken or written utterances, with no explicit help from a teacher. The theory is based heavily on concepts borrowed from machine learning and statistical estimation. In particular, learning takes place by fitting a stochastic, generative model of language to the evidence. Much of the thesis is devoted to explaining conditions that must hold for this general learning strategy to arrive at linguistically desirable grammars. The thesis introduces a variety of technical innovations, among them a common representation for evidence and grammars, and a learning strategy that separates the ``content'' of linguistic parameters from their representation. Algorithms based on it suffer from few of the search problems that have plagued other computational approaches to language acquisition. The theory has been tested on problems of learning vocabularies and grammars from unsegmented text and continuous speech, and mappings between sound and representations of meaning. It performs extremely well on various objective criteria, acquiring knowledge that causes it to assign almost exactly the same structure to utterances as humans do. This work has application to data compression, language modeling, speech recognition, machine translation, information retrieval, and other tasks that rely on either structural or stochastic descriptions of language.

A functional language for describing reversible logic

DEFF Research Database (Denmark)

Thomsen, Michael Kirkedal

2012-01-01

Reversible logic is a computational model where all gates are logically reversible and combined in circuits such that no values are lost or duplicated. This paper presents a novel functional language that is designed to describe only reversible logic circuits. The language includes high....... Reversibility of descriptions is guaranteed with a type system based on linear types. The language is applied to three examples of reversible computations (ALU, linear cosine transformation, and binary adder). The paper also outlines a design flow that ensures garbage- free translation to reversible logic...... circuits. The flow relies on a reversible combinator language as an intermediate language....

Towards Domain-specific Flow-based Languages

DEFF Research Database (Denmark)

Zarrin, Bahram; Baumeister, Hubert; Sarjoughian, Hessam S.

2018-01-01

describe their problems and solutions, instead of using general purpose programming languages. The goal of these languages is to improve the productivity and efficiency of the development and simulation of concurrent scientific models and systems. Moreover, they help to expose parallelism and to specify...... the concurrency within a component or across different independent components. In this paper, we introduce the concept of domain-specific flowbased languages which allows domain experts to use flow-based languages adapted to a particular problem domain. Flow-based programming is used to support concurrency, while......Due to the significant growth of the demand for data-intensive computing, in addition to the emergence of new parallel and distributed computing technologies, scientists and domain experts are leveraging languages specialized for their problem domain, i.e., domain-specific languages, to help them...

Effectiveness of speech language therapy either alone or with add-on computer-based language therapy software (Malayalam version) for early post stroke aphasia: A feasibility study.

Science.gov (United States)

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.

Probabilistic language models in cognitive neuroscience: Promises and pitfalls.

Science.gov (United States)

Armeni, Kristijan; Willems, Roel M; Frank, Stefan L

2017-12-01

Cognitive neuroscientists of language comprehension study how neural computations relate to cognitive computations during comprehension. On the cognitive part of the equation, it is important that the computations and processing complexity are explicitly defined. Probabilistic language models can be used to give a computationally explicit account of language complexity during comprehension. Whereas such models have so far predominantly been evaluated against behavioral data, only recently have the models been used to explain neurobiological signals. Measures obtained from these models emphasize the probabilistic, information-processing view of language understanding and provide a set of tools that can be used for testing neural hypotheses about language comprehension. Here, we provide a cursory review of the theoretical foundations and example neuroimaging studies employing probabilistic language models. We highlight the advantages and potential pitfalls of this approach and indicate avenues for future research. Copyright © 2017 Elsevier Ltd. All rights reserved.

Computer Networking Laboratory for Undergraduate Computer Technology Program

National Research Council Canada - National Science Library

Naghedolfeizi, Masoud

2000-01-01

...) To improve the quality of education in the existing courses related to computer networks and data communications as well as other computer science courses such programming languages and computer...

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.

Visual languages and applications

CERN Document Server

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

A programming language for composable DNA circuits.

Science.gov (United States)

Phillips, Andrew; Cardelli, Luca

2009-08-06

Recently, a range of information-processing circuits have been implemented in DNA by using strand displacement as their main computational mechanism. Examples include digital logic circuits and catalytic signal amplification circuits that function as efficient molecular detectors. As new paradigms for DNA computation emerge, the development of corresponding languages and tools for these paradigms will help to facilitate the design of DNA circuits and their automatic compilation to nucleotide sequences. We present a programming language for designing and simulating DNA circuits in which strand displacement is the main computational mechanism. The language includes basic elements of sequence domains, toeholds and branch migration, and assumes that strands do not possess any secondary structure. The language is used to model and simulate a variety of circuits, including an entropy-driven catalytic gate, a simple gate motif for synthesizing large-scale circuits and a scheme for implementing an arbitrary system of chemical reactions. The language is a first step towards the design of modelling and simulation tools for DNA strand displacement, which complements the emergence of novel implementation strategies for DNA computing.

Language Needs Analysis of Iranian Undergraduate Students of Computer Engineering: A Study of Reading Skill

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

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.

Using Problem Solving to Teach a Programming Language.

Science.gov (United States)

Milbrandt, George

1995-01-01

Computer studies courses should incorporate as many computer concepts and programming language experiences as possible. A gradual increase in problem difficulty will help the student to understand various computer concepts, and the programming language's syntax and structure. A sidebar provides two examples of how to establish a learning…

The Sprint/1 language for the dynamic evaluation of the mathematic formulas by direct communication with a computer

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

Martin Benjamin (EPFL), The Particles of Language: "The Dictionary" as elemental data for 7000 languages across time and space

CERN Multimedia

CERN. Geneva

2015-01-01

WhiteArea lectures' twiki HERE How can we document detailed data about all the world's language in a consistent, unified source, in a way that can serve knowledge and technology needs for people and their machines around the globe? Dictionaries have historically presented selective information about words and their meanings within a language, or translation equivalents between languages, in idiosyncratic, incommensurable formats with little basis in data science. The Kamusi Project introduces a new approach, conceiving of language as a matrix of interrelated data elements. By documenting these elements within each language, and linking elements at conceptual and functional nodes across languages, Kamusi aims toward an elusive Big Data goal: "every word in every language." If successful, the results will run the gamut from preserving the human heritage embedded in endangered languages, to providing international vocabularies for students to succeed in science, to a Star Trek-...

The discrete hungry Lotka Volterra system and a new algorithm for computing matrix eigenvalues

Science.gov (United States)

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.

Porosity characterization of fiber-reinforced ceramic matrix composite using synchrotron X-ray computed tomography

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

Ready…, Set, Go!. Comment on "Towards a Computational Comparative Neuroprimatology: Framing the language-ready brain" by Michael A. Arbib

Science.gov (United States)

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.

beachmat: A Bioconductor C++ API for accessing high-throughput biological data from a variety of R matrix types.

Directory of Open Access Journals (Sweden)

Aaron T L Lun

2018-05-01

Full Text Available Biological experiments involving genomics or other high-throughput assays typically yield a data matrix that can be explored and analyzed using the R programming language with packages from the Bioconductor project. Improvements in the throughput of these assays have resulted in an explosion of data even from routine experiments, which poses a challenge to the existing computational infrastructure for statistical data analysis. For example, single-cell RNA sequencing (scRNA-seq experiments frequently generate large matrices containing expression values for each gene in each cell, requiring sparse or file-backed representations for memory-efficient manipulation in R. These alternative representations are not easily compatible with high-performance C++ code used for computationally intensive tasks in existing R/Bioconductor packages. Here, we describe a C++ interface named beachmat, which enables agnostic data access from various matrix representations. This allows package developers to write efficient C++ code that is interoperable with dense, sparse and file-backed matrices, amongst others. We evaluated the performance of beachmat for accessing data from each matrix representation using both simulated and real scRNA-seq data, and defined a clear memory/speed trade-off to motivate the choice of an appropriate representation. We also demonstrate how beachmat can be incorporated into the code of other packages to drive analyses of a very large scRNA-seq data set.

beachmat: A Bioconductor C++ API for accessing high-throughput biological data from a variety of R matrix types.

Science.gov (United States)

Lun, Aaron T L; Pagès, Hervé; Smith, Mike L

2018-05-01

Biological experiments involving genomics or other high-throughput assays typically yield a data matrix that can be explored and analyzed using the R programming language with packages from the Bioconductor project. Improvements in the throughput of these assays have resulted in an explosion of data even from routine experiments, which poses a challenge to the existing computational infrastructure for statistical data analysis. For example, single-cell RNA sequencing (scRNA-seq) experiments frequently generate large matrices containing expression values for each gene in each cell, requiring sparse or file-backed representations for memory-efficient manipulation in R. These alternative representations are not easily compatible with high-performance C++ code used for computationally intensive tasks in existing R/Bioconductor packages. Here, we describe a C++ interface named beachmat, which enables agnostic data access from various matrix representations. This allows package developers to write efficient C++ code that is interoperable with dense, sparse and file-backed matrices, amongst others. We evaluated the performance of beachmat for accessing data from each matrix representation using both simulated and real scRNA-seq data, and defined a clear memory/speed trade-off to motivate the choice of an appropriate representation. We also demonstrate how beachmat can be incorporated into the code of other packages to drive analyses of a very large scRNA-seq data set.

beachmat: A Bioconductor C++ API for accessing high-throughput biological data from a variety of R matrix types

Science.gov (United States)

Pagès, Hervé

2018-01-01

Biological experiments involving genomics or other high-throughput assays typically yield a data matrix that can be explored and analyzed using the R programming language with packages from the Bioconductor project. Improvements in the throughput of these assays have resulted in an explosion of data even from routine experiments, which poses a challenge to the existing computational infrastructure for statistical data analysis. For example, single-cell RNA sequencing (scRNA-seq) experiments frequently generate large matrices containing expression values for each gene in each cell, requiring sparse or file-backed representations for memory-efficient manipulation in R. These alternative representations are not easily compatible with high-performance C++ code used for computationally intensive tasks in existing R/Bioconductor packages. Here, we describe a C++ interface named beachmat, which enables agnostic data access from various matrix representations. This allows package developers to write efficient C++ code that is interoperable with dense, sparse and file-backed matrices, amongst others. We evaluated the performance of beachmat for accessing data from each matrix representation using both simulated and real scRNA-seq data, and defined a clear memory/speed trade-off to motivate the choice of an appropriate representation. We also demonstrate how beachmat can be incorporated into the code of other packages to drive analyses of a very large scRNA-seq data set. PMID:29723188

A matrix model for WZW

International Nuclear Information System (INIS)

Dorey, Nick; Tong, David; Turner, Carl

2016-01-01

We study a U(N) gauged matrix quantum mechanics which, in the large N limit, is closely related to the chiral WZW conformal field theory. This manifests itself in two ways. First, we construct the left-moving Kac-Moody algebra from matrix degrees of freedom. Secondly, we compute the partition function of the matrix model in terms of Schur and Kostka polynomials and show that, in the large N limit, it coincides with the partition function of the WZW model. This same matrix model was recently shown to describe non-Abelian quantum Hall states and the relationship to the WZW model can be understood in this framework.

Rank diversity of languages: generic behavior in computational linguistics.

Science.gov (United States)

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.

Languages for structural calculations

International Nuclear Information System (INIS)

Thomas, J.B.; Chambon, M.R.

1988-01-01

The differences between human and computing languages are recalled. It is argued that they are to some extent structured in antagonistic ways. Languages in structural calculation, in the past, present, and future, are considered. The contribution of artificial intelligence is stressed [fr

Programming Languages for Distributed Computing Systems

NARCIS (Netherlands)

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

A computer-based matrix for rapid calculation of pulmonary hemodynamic parameters in congenital heart disease

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)

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

Repair work in the context of English language mediated computer interface use: A conversation analytic study

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...

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 ....

DEMONIC programming: a computational language for single-particle equilibrium thermodynamics, and its formal semantics.

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.

How language production shapes language form and comprehension

Directory of Open Access Journals (Sweden)

Maryellen C MacDonald

2013-04-01

Full Text Available Language production processes can provide insight into how language comprehension works and language typology—why languages tend to have certain characteristics more often than others. Drawing on work in memory retrieval, motor planning, and serial order in action planning, the Production-Distribution-Comprehension (PDC account links work in the fields of language production, typology, and comprehension: 1 faced with substantial computational burdens of planning and producing utterances, language producers implicitly follow three biases in utterance planning that promote word order choices that reduce these burdens, thereby improving production fluency. 2 These choices, repeated over many utterances and individuals, shape the distributions of utterance forms in language. The claim that language form stems in large degree from producers’ attempts to mitigate utterance planning difficulty is contrasted with alternative accounts in which form is driven by language use more broadly, language acquisition processes, or producers’ attempts to create language forms that are easily understood by comprehenders. 3 Language perceivers implicitly learn the statistical regularities in their linguistic input, and they use this prior experience to guide comprehension of subsequent language. In particular, they learn to predict the sequential structure of linguistic signals, based on the statistics of previously-encountered input. Thus key aspects of comprehension behavior are tied to lexico-syntactic statistics in the language, which in turn derive from utterance planning biases promoting production of comparatively easy utterance forms over more difficult ones. This approach contrasts with classic theories in which comprehension behaviors are attributed to innate design features of the language comprehension system and associated working memory. The PDC instead links basic features of comprehension to a different source: production processes that shape

Language as skill

DEFF Research Database (Denmark)

Chater, Nick; McCauley, Stewart M.; Christiansen, M. H.

2016-01-01

occurs on-line. These properties are difficult to reconcile with the 'abstract knowledge' viewpoint, and crucially suggest that language comprehension and production are facets of a unitary skill. This viewpoint is exemplified in the Chunk-Based Learner, a computational acquisition model that processes...... incrementally and learns on-line. The model both parses and produces language; and implements the idea that language acquisition is nothing more than learning to process. We suggest that the Now-or-Never bottleneck also provides a strong motivation for unified perception-production models in other domains......Are comprehension and production a single, integrated skill, or are they separate processes drawing on a shared abstract knowledge of language? We argue that a fundamental constraint on memory, the Now-or-Never bottleneck, implies that language processing is incremental and that language learning...

An improved 4-step commutation method application for matrix converter

DEFF Research Database (Denmark)

Guo, Yu; Guo, Yougui; Deng, Wenlang

2014-01-01

A novel four-step commutation method is proposed for matrix converter cell, 3 phase inputs to 1 phase output in this paper, which is obtained on the analysis of published commutation methods for matrix converter. The first and fourth step can be shorter than the second or third one. The discussed...... method here is implemented by programming in VHDL language. Finally, the novel method in this paper is verified by experiments....

Accelerated time-of-flight (TOF) PET image reconstruction using TOF bin subsetization and TOF weighting matrix pre-computation

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 Comparison of Inductive Reasoning under Risk Conditions between Chinese and Japanese Based on Computational Models: Toward the Application to CAE for Foreign Language

Science.gov (United States)

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…

Language and Cognition Interaction Neural Mechanisms

Directory of Open Access Journals (Sweden)

Leonid Perlovsky

2011-01-01

Full Text Available How language and cognition interact in thinking? Is language just used for communication of completed thoughts, or is it fundamental for thinking? Existing approaches have not led to a computational theory. We develop a hypothesis that language and cognition are two separate but closely interacting mechanisms. Language accumulates cultural wisdom; cognition develops mental representations modeling surrounding world and adapts cultural knowledge to concrete circumstances of life. Language is acquired from surrounding language “ready-made” and therefore can be acquired early in life. This early acquisition of language in childhood encompasses the entire hierarchy from sounds to words, to phrases, and to highest concepts existing in culture. Cognition is developed from experience. Yet cognition cannot be acquired from experience alone; language is a necessary intermediary, a “teacher.” A mathematical model is developed; it overcomes previous difficulties and leads to a computational theory. This model is consistent with Arbib's “language prewired brain” built on top of mirror neuron system. It models recent neuroimaging data about cognition, remaining unnoticed by other theories. A number of properties of language and cognition are explained, which previously seemed mysterious, including influence of language grammar on cultural evolution, which may explain specifics of English and Arabic cultures.

Language and cognition interaction neural mechanisms.

Science.gov (United States)

Perlovsky, Leonid

2011-01-01

How language and cognition interact in thinking? Is language just used for communication of completed thoughts, or is it fundamental for thinking? Existing approaches have not led to a computational theory. We develop a hypothesis that language and cognition are two separate but closely interacting mechanisms. Language accumulates cultural wisdom; cognition develops mental representations modeling surrounding world and adapts cultural knowledge to concrete circumstances of life. Language is acquired from surrounding language "ready-made" and therefore can be acquired early in life. This early acquisition of language in childhood encompasses the entire hierarchy from sounds to words, to phrases, and to highest concepts existing in culture. Cognition is developed from experience. Yet cognition cannot be acquired from experience alone; language is a necessary intermediary, a "teacher." A mathematical model is developed; it overcomes previous difficulties and leads to a computational theory. This model is consistent with Arbib's "language prewired brain" built on top of mirror neuron system. It models recent neuroimaging data about cognition, remaining unnoticed by other theories. A number of properties of language and cognition are explained, which previously seemed mysterious, including influence of language grammar on cultural evolution, which may explain specifics of English and Arabic cultures.

Language and Cognition Interaction Neural Mechanisms

Science.gov (United States)

Perlovsky, Leonid

2011-01-01

How language and cognition interact in thinking? Is language just used for communication of completed thoughts, or is it fundamental for thinking? Existing approaches have not led to a computational theory. We develop a hypothesis that language and cognition are two separate but closely interacting mechanisms. Language accumulates cultural wisdom; cognition develops mental representations modeling surrounding world and adapts cultural knowledge to concrete circumstances of life. Language is acquired from surrounding language “ready-made” and therefore can be acquired early in life. This early acquisition of language in childhood encompasses the entire hierarchy from sounds to words, to phrases, and to highest concepts existing in culture. Cognition is developed from experience. Yet cognition cannot be acquired from experience alone; language is a necessary intermediary, a “teacher.” A mathematical model is developed; it overcomes previous difficulties and leads to a computational theory. This model is consistent with Arbib's “language prewired brain” built on top of mirror neuron system. It models recent neuroimaging data about cognition, remaining unnoticed by other theories. A number of properties of language and cognition are explained, which previously seemed mysterious, including influence of language grammar on cultural evolution, which may explain specifics of English and Arabic cultures. PMID:21876687

Construction of the exact Fisher information matrix of Gaussian time series models by means of matrix differential rules

NARCIS (Netherlands)

Klein, A.A.B.; Melard, G.; Zahaf, T.

2000-01-01

The Fisher information matrix is of fundamental importance for the analysis of parameter estimation of time series models. In this paper the exact information matrix of a multivariate Gaussian time series model expressed in state space form is derived. A computationally efficient procedure is used

Reducing computational costs in large scale 3D EIT by using a sparse Jacobian matrix with block-wise CGLS reconstruction

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)

Reducing computational costs in large scale 3D EIT by using a sparse Jacobian matrix with block-wise CGLS reconstruction.

Science.gov (United States)

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.

Rank Diversity of Languages: Generic Behavior in Computational Linguistics

Science.gov (United States)

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

Six-degree-of-freedom missile simulation using the ADI AD 100 digital computer and ADSIM simulation language

Science.gov (United States)

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.

Flipped Approach to Mobile Assisted Language Learning

Science.gov (United States)

Yamamoto, Junko

2013-01-01

There are abundant possibilities for using smart phones and tablet computers for foreign language learning. However, if there is an emphasis on memorization or on technology, language learners may not develop proficiency in their target language. Therefore, language teachers should be familiar with strategies for facilitating creative…

Language and Cognition Interaction Neural Mechanisms

OpenAIRE

Perlovsky, Leonid

2011-01-01

How language and cognition interact in thinking? Is language just used for communication of completed thoughts, or is it fundamental for thinking? Existing approaches have not led to a computational theory. We develop a hypothesis that language and cognition are two separate but closely interacting mechanisms. Language accumulates cultural wisdom; cognition develops mental representations modeling surrounding world and adapts cultural knowledge to concrete circumstances of life. Language is a...

DEPOT system for the creation of a translator from the COC language

International Nuclear Information System (INIS)

Kehnig, Kh.; Lehttsch, Yu.; Nefed'eva, L.S.; Shtiller, G.

1976-01-01

Approaches to the creation of specialized languages and their translators are given. The DENOT system for developing translators from various specialized languages is described. Use of the system was made to translate the STS (spectra treatment system) language into the FORTRAN language.The language of STS was realized with help of DEPOT on the BESM-6 computer. The DEROT system installed at various computer provides for simple and rapid transition from one computer to the other

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...

EISPACK, Subroutines for Eigenvalues, Eigenvectors, Matrix Operations

International Nuclear Information System (INIS)

Garbow, Burton S.; Cline, A.K.; Meyering, J.

1993-01-01

1 - Description of problem or function: EISPACK3 is a collection of 75 FORTRAN subroutines, both single- and double-precision, that compute the eigenvalues and eigenvectors of nine classes of matrices. The package can determine the Eigen-system of complex general, complex Hermitian, real general, real symmetric, real symmetric band, real symmetric tridiagonal, special real tridiagonal, generalized real, and generalized real symmetric matrices. In addition, there are two routines which use the singular value decomposition to solve certain least squares problem. The individual subroutines are - Identification/Description: BAKVEC: Back transform vectors of matrix formed by FIGI; BALANC: Balance a real general matrix; BALBAK: Back transform vectors of matrix formed by BALANC; BANDR: Reduce sym. band matrix to sym. tridiag. matrix; BANDV: Find some vectors of sym. band matrix; BISECT: Find some values of sym. tridiag. matrix; BQR: Find some values of sym. band matrix; CBABK2: Back transform vectors of matrix formed by CBAL; CBAL: Balance a complex general matrix; CDIV: Perform division of two complex quantities; CG: Driver subroutine for a complex general matrix; CH: Driver subroutine for a complex Hermitian matrix; CINVIT: Find some vectors of complex Hess. matrix; COMBAK: Back transform vectors of matrix formed by COMHES; COMHES: Reduce complex matrix to complex Hess. (elementary); COMLR: Find all values of complex Hess. matrix (LR); COMLR2: Find all values/vectors of cmplx Hess. matrix (LR); CCMQR: Find all values of complex Hessenberg matrix (QR); COMQR2: Find all values/vectors of cmplx Hess. matrix (QR); CORTB: Back transform vectors of matrix formed by CORTH; CORTH: Reduce complex matrix to complex Hess. (unitary); CSROOT: Find square root of complex quantity; ELMBAK: Back transform vectors of matrix formed by ELMHES; ELMHES: Reduce real matrix to real Hess. (elementary); ELTRAN: Accumulate transformations from ELMHES (for HQR2); EPSLON: Estimate unit roundoff

Computer Lexis and Terminology

Directory of Open Access Journals (Sweden)

Gintautas Grigas

2011-04-01

Full Text Available Computer becomes a widely used tool in everyday work and at home. Every computer user sees texts on its screen containing a lot of words naming new concepts. Those words come from the terminology used by specialists. The common vocabury between computer terminology and lexis of everyday language comes into existence. The article deals with the part of computer terminology which goes to everyday usage and the influence of ordinary language to computer terminology. The relation between English and Lithuanian computer terminology, the construction and pronouncing of acronyms are discussed as well.

The J-Matrix Method Developments and Applications

CERN Document Server

Alhaidari, Abdulaziz D; Heller, Eric J; Abdelmonem, Mohamed S

2008-01-01

This volume aims to provide the fundamental knowledge to appreciate the advantages of the J-matrix method and to encourage its use and further development. The J-matrix method is an algebraic method of quantum scattering with substantial success in atomic and nuclear physics. The accuracy and convergence property of the method compares favourably with other successful scattering calculation methods. Despite its thirty-year long history new applications are being found for the J-matrix method. This book gives a brief account of the recent developments and some selected applications of the method in atomic and nuclear physics. New findings are reported in which experimental results are compared to theoretical calculations. Modifications, improvements and extensions of the method are discussed using the language of the J-matrix. The volume starts with a Foreword by the two co-founders of the method, E.J. Heller and H.A. Yamani and it contains contributions from 24 prominent international researchers.

A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix

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

Fast sparse matrix-vector multiplication by partitioning and reordering

NARCIS (Netherlands)

Yzelman, A.N.

2011-01-01

The thesis introduces a cache-oblivious method for the sparse matrix-vector (SpMV) multiplication, which is an important computational kernel in many applications. The method works by permuting rows and columns of the input matrix so that the resulting reordered matrix induces cache-friendly

Object-Oriented Programming in the Beta Programming Language

DEFF Research Database (Denmark)

Madsen, Ole Lehrmann; Møller-Pedersen, Birger; Nygaard, Kristen

This is a book on object-oriented programming and the BETA programming language. Object-oriented programming originated with the Simula languages developed at the Norwegian Computing Center, Oslo, in the 1960s. The first Simula language, Simula I, was intended for writing simulation programs....... Simula I was later used as a basis for defining a general purpose programming language, Simula 67. In addition to being a programming language, Simula1 was also designed as a language for describing and communicating about systems in general. Simula has been used by a relatively small community for many...... years, although it has had a major impact on research in computer science. The real breakthrough for object-oriented programming came with the development of Smalltalk. Since then, a large number of programming languages based on Simula concepts have appeared. C++ is the language that has had...

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.

Methodologies, languages and tools

International Nuclear Information System (INIS)

Amako, Katsuya

1994-01-01

This is a summary of the open-quotes Methodologies, Languages and Toolsclose quotes session in the CHEP'94 conference. All the contributions to methodologies and languages are relevant to the object-oriented approach. Other topics presented are related to various software tools in the down-sized computing environment

Massive Asynchronous Parallelization of Sparse Matrix Factorizations

Energy Technology Data Exchange (ETDEWEB)

Chow, Edmond [Georgia Inst. of Technology, Atlanta, GA (United States)

2018-01-08

Solving sparse problems is at the core of many DOE computational science applications. We focus on the challenge of developing sparse algorithms that can fully exploit the parallelism in extreme-scale computing systems, in particular systems with massive numbers of cores per node. Our approach is to express a sparse matrix factorization as a large number of bilinear constraint equations, and then solving these equations via an asynchronous iterative method. The unknowns in these equations are the matrix entries of the factorization that is desired.

Computer hardware description languages - A tutorial

Science.gov (United States)

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.

Computational Sociolinguistics: A Survey

NARCIS (Netherlands)

Nguyen, Dong-Phuong; Doğruöz, A. Seza; Rosé, Carolyn P.; de Jong, Franciska M.G.

Language is a social phenomenon and variation is inherent to its social nature. Recently, there has been a surge of interest within the computational linguistics (CL) community in the social dimension of language. In this article we present a survey of the emerging field of “computational

Computational Sociolinguistics: A Survey.

NARCIS (Netherlands)

de Jong, F.M.G.; Nguyen, Dong

2016-01-01

Language is a social phenomenon and variation is inherent to its social nature. Recently, there has been a surge of interest within the computational linguistics (CL) community in the social dimension of language. In this article we present a survey of the emerging field of “computational

Principles of parametric estimation in modeling language competition.

Science.gov (United States)

Zhang, Menghan; Gong, Tao

2013-06-11

It is generally difficult to define reasonable parameters and interpret their values in mathematical models of social phenomena. Rather than directly fitting abstract parameters against empirical data, we should define some concrete parameters to denote the sociocultural factors relevant for particular phenomena, and compute the values of these parameters based upon the corresponding empirical data. Taking the example of modeling studies of language competition, we propose a language diffusion principle and two language inheritance principles to compute two critical parameters, namely the impacts and inheritance rates of competing languages, in our language competition model derived from the Lotka-Volterra competition model in evolutionary biology. These principles assign explicit sociolinguistic meanings to those parameters and calculate their values from the relevant data of population censuses and language surveys. Using four examples of language competition, we illustrate that our language competition model with thus-estimated parameter values can reliably replicate and predict the dynamics of language competition, and it is especially useful in cases lacking direct competition data.

A matrix of social accounting for Asturias

Directory of Open Access Journals (Sweden)

Margarita Argüelles

2003-01-01

Full Text Available A Social Accounting Matrix is an integrated system of accounts that presents in a double-entry table all the transactions made in an economy among productive sectors, production factors, institutional sectors and the rest of the world. In comparison with an Input-Output Table, it offers a greater deal of information and shows completely the circular process of income, captivating more precisely the effects of exogenous changes. One of the main profits of a Social Accounting Matrix is to serve as a database for the development and application of a computable general equilibrium model. This is, in fact, the aim pursued with the elaboration of the Social Accounting Matrix for the Asturian economy presented here. This Matrix has been constructed with data from the 1995 Regional Accounts of Asturias, and its structure has been adapted to its future use as a database for a computable general equilibrium model of this regional economy.

Incremental Nonnegative Matrix Factorization for Face Recognition

Directory of Open Access Journals (Sweden)

Wen-Sheng Chen

2008-01-01

Full Text Available Nonnegative matrix factorization (NMF is a promising approach for local feature extraction in face recognition tasks. However, there are two major drawbacks in almost all existing NMF-based methods. One shortcoming is that the computational cost is expensive for large matrix decomposition. The other is that it must conduct repetitive learning, when the training samples or classes are updated. To overcome these two limitations, this paper proposes a novel incremental nonnegative matrix factorization (INMF for face representation and recognition. The proposed INMF approach is based on a novel constraint criterion and our previous block strategy. It thus has some good properties, such as low computational complexity, sparse coefficient matrix. Also, the coefficient column vectors between different classes are orthogonal. In particular, it can be applied to incremental learning. Two face databases, namely FERET and CMU PIE face databases, are selected for evaluation. Compared with PCA and some state-of-the-art NMF-based methods, our INMF approach gives the best performance.

Programming languages for business problem solving

CERN Document Server

Wang, Shouhong

2007-01-01

It has become crucial for managers to be computer literate in today's business environment. It is also important that those entering the field acquire the fundamental theories of information systems, the essential practical skills in computer applications, and the desire for life-long learning in information technology. Programming Languages for Business Problem Solving presents a working knowledge of the major programming languages, including COBOL, C++, Java, HTML, JavaScript, VB.NET, VBA, ASP.NET, Perl, PHP, XML, and SQL, used in the current business computing environment. The book examin

An efficient parallel algorithm for matrix-vector multiplication

Energy Technology Data Exchange (ETDEWEB)

Hendrickson, B.; Leland, R.; Plimpton, S.

1993-03-01

The multiplication of a vector by a matrix is the kernel computation of many algorithms in scientific computation. A fast parallel algorithm for this calculation is therefore necessary if one is to make full use of the new generation of parallel supercomputers. This paper presents a high performance, parallel matrix-vector multiplication algorithm that is particularly well suited to hypercube multiprocessors. For an n x n matrix on p processors, the communication cost of this algorithm is O(n/[radical]p + log(p)), independent of the matrix sparsity pattern. The performance of the algorithm is demonstrated by employing it as the kernel in the well-known NAS conjugate gradient benchmark, where a run time of 6.09 seconds was observed. This is the best published performance on this benchmark achieved to date using a massively parallel supercomputer.

Gradient-based stochastic estimation of the density matrix

Science.gov (United States)

Wang, Zhentao; Chern, Gia-Wei; Batista, Cristian D.; Barros, Kipton

2018-03-01

Fast estimation of the single-particle density matrix is key to many applications in quantum chemistry and condensed matter physics. The best numerical methods leverage the fact that the density matrix elements f(H)ij decay rapidly with distance rij between orbitals. This decay is usually exponential. However, for the special case of metals at zero temperature, algebraic decay of the density matrix appears and poses a significant numerical challenge. We introduce a gradient-based probing method to estimate all local density matrix elements at a computational cost that scales linearly with system size. For zero-temperature metals, the stochastic error scales like S-(d+2)/2d, where d is the dimension and S is a prefactor to the computational cost. The convergence becomes exponential if the system is at finite temperature or is insulating.

Computer programs in BASIC language for graphite furnace atomic absorption using the method of additions. Part 1. Operating instructions

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

Towards a reversible functional language

DEFF Research Database (Denmark)

Yokoyama, Tetsuo; Axelsen, Holger Bock; Glück, Robert

2012-01-01

/equality operator also simplifies inverse computation and program inversion. We discuss the advantages of a reversible functional language using example programs, including run-length encoding. Program inversion is seen to be as lightweight as for imperative reversible languages and realized by recursive descent...

High performance computing of density matrix renormalization group method for 2-dimensional model. Parallelization strategy toward peta computing

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)

Software reliability and programming language

International Nuclear Information System (INIS)

Ehrenberger, W.

1983-01-01

When discussing advantages and drawbacks of programming languages, it is sometimes suggested to use these languages also for safety-related tasks. The author states the demands to be made on programming languages for this purpose. His recommendations are based on the work of TC7 of the European Workshop on Industrial Computer Systems and WG A3 of IEC SC 45a. (orig./HP) [de

Modeling Coevolution between Language and Memory Capacity during Language Origin

Science.gov (United States)

Gong, Tao; Shuai, Lan

2015-01-01

Memory is essential to many cognitive tasks including language. Apart from empirical studies of memory effects on language acquisition and use, there lack sufficient evolutionary explorations on whether a high level of memory capacity is prerequisite for language and whether language origin could influence memory capacity. In line with evolutionary theories that natural selection refined language-related cognitive abilities, we advocated a coevolution scenario between language and memory capacity, which incorporated the genetic transmission of individual memory capacity, cultural transmission of idiolects, and natural and cultural selections on individual reproduction and language teaching. To illustrate the coevolution dynamics, we adopted a multi-agent computational model simulating the emergence of lexical items and simple syntax through iterated communications. Simulations showed that: along with the origin of a communal language, an initially-low memory capacity for acquired linguistic knowledge was boosted; and such coherent increase in linguistic understandability and memory capacities reflected a language-memory coevolution; and such coevolution stopped till memory capacities became sufficient for language communications. Statistical analyses revealed that the coevolution was realized mainly by natural selection based on individual communicative success in cultural transmissions. This work elaborated the biology-culture parallelism of language evolution, demonstrated the driving force of culturally-constituted factors for natural selection of individual cognitive abilities, and suggested that the degree difference in language-related cognitive abilities between humans and nonhuman animals could result from a coevolution with language. PMID:26544876

ABCD Matrix Method a Case Study

CERN Document Server

Seidov, Zakir F; Yahalom, Asher

2004-01-01

In the Israeli Electrostatic Accelerator FEL, the distance between the accelerator's end and the wiggler's entrance is about 2.1 m, and 1.4 MeV electron beam is transported through this space using four similar quadrupoles (FODO-channel). The transfer matrix method (ABCD matrix method) was used for simulating the beam transport, a set of programs is written in the several programming languages (MATHEMATICA, MATLAB, MATCAD, MAPLE) and reasonable agreement is demonstrated between experimental results and simulations. Comparison of ABCD matrix method with the direct "numerical experiments" using EGUN, ELOP, and GPT programs with and without taking into account the space-charge effects showed the agreement to be good enough as well. Also the inverse problem of finding emittance of the electron beam at the S1 screen position (before FODO-channel), by using the spot image at S2 screen position (after FODO-channel) as function of quad currents, is considered. Spot and beam at both screens are described as tilted eel...

A Model of Computation for Bit-Level Concurrent Computing and Programming: APEC

Science.gov (United States)

Ajiro, Takashi; Tsuchida, Kensei

A concurrent model of computation and a language based on the model for bit-level operation are useful for developing asynchronous and concurrent programs compositionally, which frequently use bit-level operations. Some examples are programs for video games, hardware emulation (including virtual machines), and signal processing. However, few models and languages are optimized and oriented to bit-level concurrent computation. We previously developed a visual programming language called A-BITS for bit-level concurrent programming. The language is based on a dataflow-like model that computes using processes that provide serial bit-level operations and FIFO buffers connected to them. It can express bit-level computation naturally and develop compositionally. We then devised a concurrent computation model called APEC (Asynchronous Program Elements Connection) for bit-level concurrent computation. This model enables precise and formal expression of the process of computation, and a notion of primitive program elements for controlling and operating can be expressed synthetically. Specifically, the model is based on a notion of uniform primitive processes, called primitives, that have three terminals and four ordered rules at most, as well as on bidirectional communication using vehicles called carriers. A new notion is that a carrier moving between two terminals can briefly express some kinds of computation such as synchronization and bidirectional communication. The model's properties make it most applicable to bit-level computation compositionally, since the uniform computation elements are enough to develop components that have practical functionality. Through future application of the model, our research may enable further research on a base model of fine-grain parallel computer architecture, since the model is suitable for expressing massive concurrency by a network of primitives.

PRO/Mapper: a plotting program for the DEC PRO/300 personal computers utilizing the MAPPER graphics language

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

Finite element electromagnetic field computation on the Sequent Symmetry 81 parallel computer

International Nuclear Information System (INIS)

Ratnajeevan, S.; Hoole, H.

1990-01-01

Finite element field analysis algorithms lend themselves to parallelization and this fact is exploited in this paper to implement a finite element analysis program for electromagnetic field computation on the Sequent Symmetry 81 parallel computer with three processors. In terms of waiting time, the maximum gains are to be made in matrix solution and therefore this paper concentrates on the gains in parallelizing the solution part of finite element analysis. An outline of how parallelization could be exploited in most finite element operations is given in this paper although the actual implemention of parallelism on the Sequent Symmetry 81 parallel computer was in sparsity computation, matrix assembly and the matrix solution areas. In all cases, the algorithms were modified suit the parallel programming application rather than allowing the compiler to parallelize on existing algorithms