Academic literature on the topic 'Reduce (Computer program language)'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Reduce (Computer program language).'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Reduce (Computer program language)"

1

Anderson, Ellen M. "Turbidimetric Microbiological Assay Results Calculated by a BASIC Computer Program." Journal of AOAC INTERNATIONAL 72, no. 6 (November 1, 1989): 950–52. http://dx.doi.org/10.1093/jaoac/72.6.950.

Full text
Abstract:
Abstract A BASIC computer program was used to calculate the results of microbiological vitamin assays. The program, which incorporates the official AOAC guidelines for microbiological methods, reduces the uncertainty inherent in manual curve plotting and interpolation and minimizes the human error of repetitive calculations. Because the BASIC programming language is well suited for use on self-contained personal computers, it can be easily adapted by small laboratories
APA, Harvard, Vancouver, ISO, and other styles
2

Liu, Yu, Bo Kong, and Mei Yang. "Using GPTS to Relize Communication by Serial 422." Applied Mechanics and Materials 380-384 (August 2013): 3799–802. http://dx.doi.org/10.4028/www.scientific.net/amm.380-384.3799.

Full text
Abstract:
ATLAS (Abbreviated Test Language for All Systems) is an abbreviated test language .GPTS is a development platform to develop ATLAS programs. RS 422 is widely adopted standard between the radio control box and the host computer .The process to develop test program in ATLAS by GPTS is described in this paper to realize the communication by serial 422.The application shows that it can improve the test speed and reduce the loss of resources by full duplex without handshaking line.
APA, Harvard, Vancouver, ISO, and other styles
3

Barendregt, Henk. "Theoretical Pearls: Self-interpretation in lambda calculus." Journal of Functional Programming 1, no. 2 (April 1991): 229–33. http://dx.doi.org/10.1017/s0956796800020062.

Full text
Abstract:
Programming languages which are capable of interpreting themselves have been fascinating computer scientists. Indeed, if this is possible then a ‘strange loop’ (in the sense of Hofstadter, 1979) is involved. Nevertheless, the phenomenon is a direct consequence of the existence of universal languages. Indeed, if all computable functions can be captured by a language, then so can the particular job of interpreting the code of a program of that language. Self-interpretation will be shown here to be possible in lambda calculus.The set of λ-terms, notation Λ, is defined by the following abstract syntaxwhereis the set {v, v′, v″, v′″,…} of variables. Arbitrary variables are usually denoted by x, y,z,… and λ-terms by M,N,L,…. A redex is a λ-term of the formthat is, the result of substituting N for (the free occurrences of) x in M. Stylistically, it can be said that λ-terms represent functional programs including their input. A reduction machine executes such terms by trying to reduce them to normal form; that is, redexes are continuously replaced by their contracta until hopefully no more redexes are present. If such a normal form can be reached, then this is the output of the functional program; otherwise, the program diverges.
APA, Harvard, Vancouver, ISO, and other styles
4

Raman, K. V. "Some Features of Java Language Illustrated through Examples from Chemistry." Mapana - Journal of Sciences 1, no. 2 (July 3, 2003): 22–56. http://dx.doi.org/10.12723/mjs.2.5.

Full text
Abstract:
Computer programming has been used effectively by theoretical chemists and organic chemists to solve various types of problem in chemistry. Initially the languages used for computations in chemistry were FORTRAN and BASIC. Later the Pascal language was used for solving problems in chemistry and physics. Recently the languages C and C++ and Java have been used to solve problems in chemistry. In this paper I will illustrate features of C, C++ choosing examples from chemistry. Computer programming has been used effectively by theoretical chemists and organic chemists to solve various types of problem in chemistry. Initially the languages used for computations in chemistry were FORTRAN and BASIC. Later the Pascal language was used for solving problems in chemistry and physics. Recently the languages C and C++ and Java have been used to solve problems in chemistry. In this paper I will illustrate features of C, C++ choosing examples from chemistry. Some examples presented in this these languages are Program to calculate reduced mass of homo diatomic or hetero diatomic Program to calculate the molecular weight of a tetra atomic system ABCD Program to calculate NMR frequencies of spin 1/2 nuclei only Program to calculate NMR and ESR frequencies The examples presented in Java 2 are Program to calculate unit cell dimension of a crystal Program to generate the chair form and boat form of cyclohexane. The examples presented in this monograph will help researchers in theoretical chemistry and organic chemistry to develop their own software.
APA, Harvard, Vancouver, ISO, and other styles
5

Poe, Stephen E. "SELF-LEARNING: CD-ROM INSTRUCTION AND AUTHORING." HortScience 31, no. 3 (June 1996): 325e—325. http://dx.doi.org/10.21273/hortsci.31.3.325e.

Full text
Abstract:
A fundamental concern of agricultural education is innovation within the teaching process. In dealing with high technology, increasing subject complexity, and rising costs, educators (including plant managers and training personnel) must look to alternative methods of training and teaching. Educational multimedia software can effectively present a new dimension to traditional computer-assisted instruction (CAI) by adding sound, animation, high-resolution graphics, and live-action video. Multimedia software is not difficult to program; however, the ease of programming depends on the authoring language or languages that are used. A traditional language such as C++ can take extended periods of time to program, possibly hours per minute of program. A program developed specifically for multimedia development can facilitate the interactions between sound, videos, and animation more readily, and reduce the programming time required significantly. The use and development of multimedia software using Toolbook (Asymetrix Corp.) will be presented with copies of the developed software available.
APA, Harvard, Vancouver, ISO, and other styles
6

Paun, Gheorghe, Miklos Szijarto, and Sorina Vicolov. "Further Remarks on Reduced Languages." Fundamenta Informaticae 16, no. 3-4 (May 1, 1992): 337–47. http://dx.doi.org/10.3233/fi-1992-163-407.

Full text
Abstract:
Union, homomorphic and inverse homomorphic representations of languages are obtained, starting from reduced languages introduced in earlier formal language approaches to parallel program schemes. The reduced-ness decidability is also investigated (it is decidable for regular and undecidable for linear languages).
APA, Harvard, Vancouver, ISO, and other styles
7

Tang, Hong Jun. "Program Slicing Technique in Programming Assessment." Applied Mechanics and Materials 263-266 (December 2012): 1884–87. http://dx.doi.org/10.4028/www.scientific.net/amm.263-266.1884.

Full text
Abstract:
For the teachers of teaching basic computer programming language, a very large number of student programs should be graded and human graders have great difficulty in judging the correctness and efficiency of programs. A programming assessment method is proposed based on program slicing technique and the method has reduced the complexity in the assessment of large-scale program by decomposing program. The method divides the program into several slices by generating program dependence graph and on those slices we can get the score of the student program by comparing the student program with the template program. The method has successfully improved the grading process and it is also employed for the undergraduate courses.
APA, Harvard, Vancouver, ISO, and other styles
8

Naveed, Muhammad Shumail, Muhammad Sarim, and Kamran Ahsan. "Learners Programming Language a Helping System for Introductory Programming Courses." July 2016 35, no. 3 (July 1, 2016): 347–58. http://dx.doi.org/10.22581/muet1982.1603.05.

Full text
Abstract:
Programming is the core of computer science and due to this momentousness a special care is taken in designing the curriculum of programming courses. A substantial work has been conducted on the definition of programming courses, yet the introductory programming courses are still facing high attrition, low retention and lack of motivation. This paper introduced a tiny pre-programming language called LPL (Learners Programming Language) as a ZPL (Zeroth Programming Language) to illuminate novice students about elementary concepts of introductory programming before introducing the first imperative programming course. The overall objective and design philosophy of LPL is based on a hypothesis that the soft introduction of a simple and paradigm specific textual programming can increase the motivation level of novice students and reduce the congenital complexities and hardness of the first programming course and eventually improve the retention rate and may be fruitful in reducing the dropout/failure level. LPL also generates the equivalent high level programs from user source program and eventually very fruitful in understanding the syntax of introductory programming languages. To overcome the inherent complexities of unusual and rigid syntax of introductory programming languages, the LPL provide elementary programming concepts in the form of algorithmic and plain natural language based computational statements. The initial results obtained after the introduction of LPL are very encouraging in motivating novice students and improving the retention rate.
APA, Harvard, Vancouver, ISO, and other styles
9

Coelho, Alan A. "TOPASandTOPAS-Academic: an optimization program integrating computer algebra and crystallographic objects written in C++." Journal of Applied Crystallography 51, no. 1 (February 1, 2018): 210–18. http://dx.doi.org/10.1107/s1600576718000183.

Full text
Abstract:
TOPASand its academic variantTOPAS-Academicare nonlinear least-squares optimization programs written in the C++ programming language. This paper describes their functionality and architecture. The latter is of benefit to developers seeking to reduce development time.TOPASallows linear and nonlinear constraints through the use of computer algebra, with parameter dependencies, required for parameter derivatives, automatically determined. In addition, the objective function can include restraints and penalties, which again are defined using computer algebra. Of importance is a conjugate gradient solution routine with bounding constraints which guide refinements to convergence. Much of the functionality ofTOPASis achieved through the use of generic functionality; for example, flexible peak-shape generation allows neutron time-of-flight (TOF) peak shapes to be described using generic functions. The kernel ofTOPAScan be run from the command line for batch mode operation or from a closely integrated graphical user interface. The functionality ofTOPASincludes peak fitting, Pawley and Le Bail refinement, Rietveld refinement, single-crystal refinement, pair distribution function refinement, magnetic structures, constant wavelength neutron refinement, TOF refinement, stacking-fault analysis, Laue refinement, indexing, charge flipping, and structure solution through simulated annealing.
APA, Harvard, Vancouver, ISO, and other styles
10

Pan, D., and R. S. Sharp. "Automatic Formulation of Dynamic Equations of Motion of Robot Manipulators." Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science 202, no. 6 (November 1988): 397–404. http://dx.doi.org/10.1243/pime_proc_1988_202_141_02.

Full text
Abstract:
Based on the use of homogeneous transformation matrices with Denavit-Hartenberg notation and the Lagrangian formulation method, a general computer program ROBDYN.RED for the symbolic derivation of dynamic equations of motion for robot manipulators has been developed and is discussed in this paper. The program is developed by using REDUCE, an algebraic manipulation language, and is versatile for open-chain structure robot manipulators with any number of degrees of freedom and with any combination of types of joint. Considerations are also given to saving computer memory space required for execution and to minimizing the runtime. Several examples are included to demonstrate the use of the program. Equations of motion in scalar form can be automatically transferred to FORTRAN format for later numerical simulations. The efficiency of the resulting equations in terms of numerical integration is also discussed and some further developments to improve the efficiency are suggested.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Reduce (Computer program language)"

1

Shepherd, David. "Natural language program analysis combining natural language processing with program analysis to improve software maintenance tools /." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 176 p, 2007. http://proquest.umi.com/pqdweb?did=1397920371&sid=6&Fmt=2&clientId=8331&RQT=309&VName=PQD.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ou, Jen-Chieh. "HARDWARE DESCRIPTION LANGUAGE PROGRAM SLICING AND WAY TO REDUCE BOUNDED MODEL CHECKING SEARCH OVERHEAD." Case Western Reserve University School of Graduate Studies / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=case1159738055.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Chou, Robert Shih-pei. "A program design language for COBOL." Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/13200.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Richardson, Joel E. "E a persistent systems implementation language /." Madison, Wis. : University of Wisconsin-Madison, Computer Sciences Dept, 1989. http://catalog.hathitrust.org/api/volumes/oclc/20839601.html.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Gordon, Christopher Todd. "A visual language for ADA program unit specifications." Thesis, This resource online, 1990. http://scholar.lib.vt.edu/theses/available/etd-06232009-063007/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Martin, Walter E. "Cview, a graphical program generator for the C programming language /." Online version of thesis, 1988. http://hdl.handle.net/1850/10224.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Yessenov, Kuat T. "A lightweight specification language for bounded program verification." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/53184.

Full text
Abstract:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 63-64).
This thesis presents a new light-weight specification language called JForge Specification Language (JFSL) for object-oriented languages such as Java. The language is amenable to bounded verification analysis by a tool called JForge that interprets JFSL specifications, fully integrates with a mainstream development environment, and assists programmers in examining counter example traces and debugging specifications. JFSL attempts to address challenges of specification languages such as inheritance, frame conditions, dynamic dispatch, and method calls inside specifications in the context of bounded verification. A collection of verification tasks illustrates the expressiveness and conciseness of JForge specifications and demonstrates effectiveness of the bounded verification technique.
by Kuat T. Yessenov.
M.Eng.
APA, Harvard, Vancouver, ISO, and other styles
8

Leoutsarakos, Nikolaos. "A context sensitive command language /." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=63274.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Gibson, Barbara Brunner. "Ada as a design specification language /." Online version of thesis, 1988. http://hdl.handle.net/1850/10215.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

von, Oldenburg Tim. "Making scope explorable in Software Development Environments to reduce defects and support program understanding." Thesis, Malmö högskola, Fakulteten för kultur och samhälle (KS), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-24006.

Full text
Abstract:
Programming language tools help software developers to understand a program and to recognize possible pitfalls. Used with the right knowledge, they can be instrumented to achieve better software quality. However, creating language tools that integrate well into the development environment and workflow is challenging.This thesis utilizes a user-centered design process to identify the needs of professional developers through in-depth interviews, address those needs through a concept, and finally implement and evaluate the concept. Taking 'scope' as an exemplary source of misconceptions in programming, a “Scope Inspector” plug-in for the Atom IDE—targeting experienced JavaScript developers in the open source community—is implemented.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Reduce (Computer program language)"

1

Hearn, Anthony C. Reduce user's manual. 3rd ed. Santa Monica: Rand, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hearn, Anthony C. Reduce user's manual. 3rd ed. Santa Monica: Rand, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hearn, Anthony C. Reduce user's manual. 3rd ed. Santa Monica: Rand, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Marti, Jeb B. REDUCE as a LISP benchmark. Santa Monica, Calf: Rand Publications, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Marti, Jed. REDUCE as a LISP benchmark. Santa Monica, Calif: Rand Corporation, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

D, Constales, ed. Computer algebra with LISP and REDUCE: An introduction to computer-aided pure mathematics. Dordrecht: Kluwer Academic Publishers, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

SPARC architecture, assembly language programming, and C. Englewood Cliffs, N.J: Prentice Hall, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

SPARC architecture, assembly language programming, and C. 2nd ed. Upper Saddle River, N.J: Prentice Hall, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Waldron, John. Introduction to RISC assembly language programming. Harlow, England: Addison-Wesley, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Olga, Pekelny, ed. Computer language C. San Diego: Harcourt Brace Jovanovich, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Reduce (Computer program language)"

1

Eilers, Marco, Severin Meier, and Peter Müller. "Product Programs in the Wild: Retrofitting Program Verifiers to Check Information Flow Security." In Computer Aided Verification, 718–41. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81685-8_34.

Full text
Abstract:
AbstractMost existing program verifiers check trace properties such as functional correctness, but do not support the verification of hyperproperties, in particular, information flow security. In principle, product programs allow one to reduce the verification of hyperproperties to trace properties and, thus, apply standard verifiers to check them; in practice, product constructions are usually defined only for simple programming languages without features like dynamic method binding or concurrency and, consequently, cannot be directly applied to verify information flow security in a full-fledged language. However, many existing verifiers encode programs from source languages into simple intermediate verification languages, which opens up the possibility of constructing a product program on the intermediate language level, reusing the existing encoding and drastically reducing the effort required to develop new verification tools for information flow security. In this paper, we explore the potential of this approach along three dimensions: (1) Soundness: We show that the combination of an encoding and a product construction that are individually sound can still be unsound, and identify a novel condition on the encoding that ensures overall soundness. (2) Concurrency: We show how sequential product programs on the intermediate language level can be used to verify information flow security of concurrent source programs. (3) Performance: We implement a product construction in Nagini, a Python verifier built upon the Viper intermediate language, and evaluate it on a number of challenging examples. We show that the resulting tool offers acceptable performance, while matching or surpassing existing tools in its combination of language feature support and expressiveness.
APA, Harvard, Vancouver, ISO, and other styles
2

Weik, Martin H. "language program." In Computer Science and Communications Dictionary, 871. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_9931.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Weik, Martin H. "program design language." In Computer Science and Communications Dictionary, 1347. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_14835.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Craven, Paul Vincent. "What Is a Computer Language?" In Program Arcade Games, 33–40. Berkeley, CA: Apress, 2016. http://dx.doi.org/10.1007/978-1-4842-1790-0_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Jebali, Adel. "Does CMC Reduce Foreign Language Classroom Anxiety?" In Lecture Notes in Computer Science, 277–87. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-07485-6_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Volpano, Dennis, and Geoffrey Smith. "Language Issues in Mobile Program Security." In Lecture Notes in Computer Science, 25–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-68671-1_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Harf, Mait, Kristiina Kindel, Vahur Kotkas, Peep Küngas, and Enn Tyugu. "Automated Program Synthesis for Java Programming Language." In Lecture Notes in Computer Science, 157–64. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45575-2_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Roșu, Grigore. "From Rewriting Logic, to Programming Language Semantics, to Program Verification." In Lecture Notes in Computer Science, 598–616. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23165-5_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kobayashi, Naoki. "Higher-Order Program Verification and Language-Based Security." In Advances in Computer Science - ASIAN 2009. Information Security and Privacy, 17–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10622-4_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Xue, Hongfa, Yurong Chen, Guru Venkataramani, and Tian Lan. "Hecate: Automated Customization of Program and Communication Features to Reduce Attack Surfaces." In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 305–19. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-37231-6_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Reduce (Computer program language)"

1

Abdel-Malek, Karim A. "An Off-Line Graphical Environment for Programming Robots Using Commercial CAD Systems." In ASME 1994 International Computers in Engineering Conference and Exhibition and the ASME 1994 8th Annual Database Symposium collocated with the ASME 1994 Design Technical Conferences. American Society of Mechanical Engineers, 1994. http://dx.doi.org/10.1115/cie1994-0437.

Full text
Abstract:
Abstract Because current robot teaching methods are inadequate to fully control a high accuracy manipulator, the concept of a graphical interface which combines both teaching and programming methods is presented here. The complexity of user interfaces has become significant as manipulators and other programmable automation are applied to more industrial applications. Three dimensional visualization is an increasingly important aspect of the problem facing robotics programmer. Often the effector coordinates passed to the manipulator are not easily visualized in space. The introduction of a graphical environment the reduces the task of visualizing points, orientations, and trajectories. The environment developed here (the “TR-Environment”) provides the user with an off-line programming method where logic, repetitive tasks, and sensory control can be simplified. The environment consists of the integration of commercial CAD packages with computer languages. The program utilizes the so called “NODES” which define the six generalized coordinates and the state of the end-effector at a point in space. Trajectories in space can be planned by connecting nodes via “entities”. A new language (“Criptic”) associated with nodes where program branching, sensory control, digital communication, and adaptive control occurs, has been developed.
APA, Harvard, Vancouver, ISO, and other styles
2

To, Cho W. S., and Lingchuan Li. "Exact Reduction by Group Theoretic Approach in Computational Nonlinear Structural Dynamics." In ASME 1997 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1997. http://dx.doi.org/10.1115/detc97/cie-4447.

Full text
Abstract:
Abstract The reduction method based on symmetry group or the so-called group theoretic approach (GTA) of Healey and associates for bifurcation analysis and free vibration analysis of geometrically nonlinear systems with symmetries is applied in the investigation reported here to the computations of responses of geometrically nonlinear systems under intensive transient excitations. A digital computer program written in Fortran language has also been developed for the work. Two space trusses discretized by the finite element method are chosen to illustrate the use of the GTA for cases undergoing large deflections. In the response computations for both the full space and reduced space or subspace problems the central difference method is employed. Numerical results are obtained. Comparisons of results for full space problems to subspace problems are made. It is concluded that the GTA is mathematically very elegant and rigorous. Computationally, the solution is exact and it is very efficient for geometrically nonlinear systems undergoing large deformation. The GTA is currently being developed for the response analysis of geometrically nonlinear systems with partial symmetries.
APA, Harvard, Vancouver, ISO, and other styles
3

Buta, Monica, Lavinia Cheie, and Laura Visu-Petra. "A computer mediated training program to reduce children’s math anxiety." In 2nd International Conference on Advanced Research in Education. Acavent, 2019. http://dx.doi.org/10.33422/2nd.educationconf.2019.11.805.

Full text
Abstract:
Mathematics anxiety is widespread among children, interfering with their ability to solve math problems in academic and every-day situations. This has detrimental, long term effects on academic achievement, engagement in STEM-related careers and employability. While a number of apps and programs have been created to improve children’s mathematical competence, they were mostly created for commercial purposes, lacking scientific validity and being prone to inaccuracies. Therefore, we designed an evidence-based, adaptive training program (Math-trolls) in order to investigate how computer mediated tutoring might reduce math anxiety. Math-trolls is an interactive online computer game designed so that children successively discover 7 planets following an intense cognitive tutoring program. With the help of a tutor, the game helps children make meaning in math, improving number sense. The space exploration theme is engaging and child-friendly, employed to reduce children’s anxiety. We conducted a pilot study on 60 primary-school children, who completed the Math-trolls game in 8 sessions. We also measured children’s math anxiety and math performance pre- and post- computerized tutoring. Preliminary results of this pilot study suggest that Math-trolls, a computer mediated training program, is efficient in decreasing young children’s math anxiety, also improving number sense and math performance. This offers valuable insights regarding the natural progression of the interrelationships between math anxiety and math performance. The program has the potential to become a valuable tool to be used within the classroom by educators, within the family by parents or by children themselves.
APA, Harvard, Vancouver, ISO, and other styles
4

Yang, Xiaoli, Rong Ge, and Charles Tseng. "Visualizing genetic recombination with interactive computer program." In 2010 International Conference on Audio, Language and Image Processing (ICALIP). IEEE, 2010. http://dx.doi.org/10.1109/icalip.2010.5685128.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kim, Sung-Hun, Jin-Tak Choi, and Kil-Hong Joo. "Development of Cyber Sign Language Interpreting App Program for Deaf." In Next Generation Computer and Information Technology 2017. Science & Engineering Research Support soCiety, 2017. http://dx.doi.org/10.14257/astl.2017.145.03.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ling, Xiang, Guoqing Wu, and Bo Huang. "Comparing program to requirement and design using language acceptance." In 2012 2nd International Conference on Computer Science and Network Technology (ICCSNT). IEEE, 2012. http://dx.doi.org/10.1109/iccsnt.2012.6525961.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Goulding, John R., and Hormoz Zarefar. "Development of a Mechanical Power Transmission Design Supervisor System." In ASME 1990 Design Technical Conferences. American Society of Mechanical Engineers, 1990. http://dx.doi.org/10.1115/detc1990-0037.

Full text
Abstract:
Abstract Computer Aided Design and Computer Aided Manufacturing (CAD/CAM) software programs are used in mechanical engineering industries to reduce the time it takes to draft, simulate, machine, and plan a product. When knowledge-based expert rules, equations, and proprietary languages extend CAD/CAM software, previously designed mechanisms can be scaled to satisfy new design requirements in the shortest time. Two major drawbacks exist in current technology. First, embedded design alternatives needed by design engineers during the product conception and rework stages are lacking. Second, an operator is required who has a thorough understanding of the intended design and the how-to expertise needed to create and optimize the design alternatives. The focus of our research and development was to automate the intellectual operations; e.g., questioning, identifying, selecting, and coordinating the design process. A robust system emerged which: 1. Selects the best mechanisms necessary to design a power transmission device from proven solutions. 2. Aids the inexperienced operator in developing complex design solutions. 3. Provides design alternatives which add back-to-the-drawing-board capabilities to knowledge-based mechanical power transmission CAD programs.
APA, Harvard, Vancouver, ISO, and other styles
8

Qin, Yi, and Guonian Wang. "A computer-aided Chinese pronunciation training program for English-speaking learners." In 2014 International Conference on Asian Language Processing (IALP). IEEE, 2014. http://dx.doi.org/10.1109/ialp.2014.6973499.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Salem, O., A. Hossain, and M. Kamala. "Awareness Program and AI based Tool to Reduce Risk of Phishing Attacks." In 2010 IEEE 10th International Conference on Computer and Information Technology (CIT). IEEE, 2010. http://dx.doi.org/10.1109/cit.2010.254.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Menotti, Ricardo, Joao M. P. Cardoso, Marcio M. Fernandes, and Eduardo Marques. "LALP: A Novel Language to Program Custom FPGA-Based Architectures." In 2009 21st International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD). IEEE, 2009. http://dx.doi.org/10.1109/sbac-pad.2009.23.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Reduce (Computer program language)"

1

Pennekamp, Richard A. A Computer Program to Reduce Digitized Yaw-Card Data from Finned Kinetic-Energy Projectiles. Fort Belvoir, VA: Defense Technical Information Center, December 1991. http://dx.doi.org/10.21236/ada244098.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wackerbarth, D. E., M. U. Anderson, and R. A. Graham. PVDFSTRESS: A PC-based computer program to reduce Bauer PVDF stress-rate gauge data. Office of Scientific and Technical Information (OSTI), February 1992. http://dx.doi.org/10.2172/5413767.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography