To see the other types of publications on this topic, follow the link: Computer program theory.

Journal articles on the topic 'Computer program theory'

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Computer program theory.'

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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Middelburg, Cornelis. "Program Algebra for Random Access Machine Programs." Scientific Annals of Computer Science XXXII, no. 2 (December 7, 2022): 285–319. http://dx.doi.org/10.7561/sacs.2022.2.285.

Full text
Abstract:
This paper presents an algebraic theory of instruction sequences with instructions for a random access machine (RAM) as basic instructions, the behaviours produced by the instruction sequences concerned under execution, and the interaction between such behaviours and RAM memories. This theory provides a setting for the development of theory in areas such as computational complexity and analysis of algorithms that distinguishes itself by offering the possibility of equational reasoning to establish whether an instruction sequence computes a given function and being more general than the setting provided by any known version of the RAM model of computation. In this setting, a semi-realistic version of the RAM model of computation and a bit-oriented time complexity measure for this version are introduced. Under the time measure concerned, semi-realistic RAMs can be simulated by multi-tape Turing machines with quadratic time overhead.
APA, Harvard, Vancouver, ISO, and other styles
2

Gerkushenko, Svetlana, and Georgy Gerkushenko. "The Play Theory and Computer Games Using in Early Childhood Education." International Journal of Game-Based Learning 4, no. 3 (July 2014): 47–60. http://dx.doi.org/10.4018/ijgbl.2014070105.

Full text
Abstract:
The article describes the role of play in child's development and identifies the characteristics of mature play in preschool age. The paper gives an overview of the computer games for preschool children used in Russian kindergartens. The research conducted with 50 Russian kindergarten teachers provides the analysis of the most important factors of computer programs selection made by teachers for their classroom activities. It is analyzed whether the factors concern the theory of children's play and whether the kindergarten teachers need the scaffolding program for choosing computer games appropriate for children's development. It is described the essence of the scaffolding program. They are formulated the criteria for evaluating computer games to make classroom activities developmentally appropriate.
APA, Harvard, Vancouver, ISO, and other styles
3

HENRY, SHAWN R., and JEFFREY R. WEEKS. "SYMMETRY GROUPS OF HYPERBOLIC KNOTS AND LINKS." Journal of Knot Theory and Its Ramifications 01, no. 02 (June 1992): 185–201. http://dx.doi.org/10.1142/s0218216592000100.

Full text
Abstract:
Canonical triangulations provide an algorithm to compute the symmetry groups of hyperbolic links and their complements, along with information on how each symmetry acts on the link components. The latter information determines the chirality and invertibility of the link. Symmetry groups of knots to ten crossings and multicomponent hyperbolic links to nine crossing are listed, with some exceptions. A Macintosh computer program, available free of charge, computes symmetry groups interactively.
APA, Harvard, Vancouver, ISO, and other styles
4

Zhu, Ming-Yuan. "Program transformation in constructive type theory." ACM SIGPLAN Notices 30, no. 1 (January 3, 1995): 11–19. http://dx.doi.org/10.1145/199818.199833.

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

Pittenger, David J. "Perception Laboratory: A Computer Program to Demonstrate Perceptual Phenomena." Teaching of Psychology 23, no. 1 (February 1996): 46–48. http://dx.doi.org/10.1207/s15328023top2301_12.

Full text
Abstract:
I developed an interactive computer program that allows one to demonstrate and experiment with various phenomena in visual perception using IBM-compatible computers. The program contains modules for demonstrating the color afterimage, the cafe illusion, additive color mixing and the opponent-process theory of color vision, the glowing axes illusion, the Hermann grid, the McCollough effect, the motion aftereffect, the neon illusion, and simultaneous contrast. The user has considerable control over the stimuli making up the image and can manipulate the variables that contribute to the perception of the effect. The program can be used far classroom demonstrations and student laboratory projects.
APA, Harvard, Vancouver, ISO, and other styles
6

Burnett, R. B., and A. P. Schwab. "A computer program to aid in teaching diffuse layer theory." Journal of Agronomic Education 16, no. 1 (March 1987): 30–33. http://dx.doi.org/10.2134/jae1987.0030.

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

Pavelcik, Frantisek. "Phased rotation, conformation and translation function: theory and computer program." Journal of Applied Crystallography 39, no. 4 (July 15, 2006): 483–86. http://dx.doi.org/10.1107/s0021889806013008.

Full text
Abstract:
A new crystallographic function, phased rotation conformation and translation (PRCTF), has been developed. The function is designed for automatic interpretation of electron density utilizing molecular fragments with some conformational freedom. A computer program,NUT, has been written for the calculation of the PRCTF.
APA, Harvard, Vancouver, ISO, and other styles
8

Vessey, Iris. "Toward a theory of computer program bugs: an empirical test." International Journal of Man-Machine Studies 30, no. 1 (January 1989): 23–46. http://dx.doi.org/10.1016/s0020-7373(89)80019-7.

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

Luo, Zhaohui. "Program specification and data refinement in type theory." Mathematical Structures in Computer Science 3, no. 3 (September 1993): 333–63. http://dx.doi.org/10.1017/s0960129500000256.

Full text
Abstract:
The study of type theory may offer a uniform language for modular programming, structured specification and logical reasoning. We develop an approach to program specification and data refinement in a type theory with a strong logical power and nice structural mechanisms to show that it provides an adequate formalism for modular development of programs and specifications. Specification of abstract data types is considered, and a notion of abstract implementation between specifications is defined in the type theory and studied as a basis for correct and modular development of programs by stepwise refinement. The higher-order structural mechanisms in the type theory provide useful and flexible tools (specification operations and parameterized specifications) for modular design and structured specification. Refinement maps (programs and design decisions) and proofs of implementation correctness can be developed by means of the existing proof development systems based on type theories.
APA, Harvard, Vancouver, ISO, and other styles
10

Shange, Thembeka. "The Possible Role of the English Word Power (EWP) Program in Motivating ICT Foundation Students to Learn English at a University of Technology in South Africa." International Journal of Applied Linguistics and English Literature 10, no. 5 (September 30, 2021): 28. http://dx.doi.org/10.7575/aiac.ijalel.v.10n.5p.28.

Full text
Abstract:
This study reports on the possible role of the English Word Power (EWP) program in motivating ICT Foundation students to learn English at a University of Technology in South Africa. Current research indicates that computer-assisted language programs increase motivation and increase enjoyment of learning activities, but no study in South Africa has been conducted on whether this is the case with the EWP program. A qualitative approach was adopted. The sample comprised 44 purposefully selected student observations (n = 44); and five students completed journals. The findings from student observations indicate that they were enthusiastic about the program and that they enjoyed it. The findings from the journals show that students were unsure about certain instructions used in the program and they were too preoccupied with getting the correct answers. It is concluded that ICT Foundation students are positively motivated by the EWP program because, for most of them, learning by means of computers is a new experience in terms of their previous schooling backgrounds. This paves the way for further investigations in developing CALL programs that will have an impact on student learning. Future research should focus on whether similar computer-based programs like EWP do increase student learning.
APA, Harvard, Vancouver, ISO, and other styles
11

Bougé, Luc. "A contribution to the theory of program testing." Theoretical Computer Science 37 (1985): 151–81. http://dx.doi.org/10.1016/0304-3975(85)90090-8.

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

JIN, XIAN'AN, and FUJI ZHANG. "ON COMPUTING KAUFFMAN BRACKET POLYNOMIAL OF MONTESINOS LINKS." Journal of Knot Theory and Its Ramifications 19, no. 08 (August 2010): 1001–23. http://dx.doi.org/10.1142/s0218216510008297.

Full text
Abstract:
It is well known that Jones polynomial (hence, Kauffman bracket polynomial) of links is, in general, hard to compute. By now, Jones polynomials or Kauffman bracket polynomials of many link families have been computed, see [4, 7–11]. In recent years, the computer algebra (Maple) techniques were used to calculate link polynomials for various link families, see [7, 12–14]. In this paper, we try to design a maple program to calculate the explicit expression of the Kauffman bracket polynomial of Montesinos links. We first introduce a family of "ring of tangles" links, which includes Montesinos links as a special subfamily. Then, we provide a closed-form formula of Kauffman bracket polynomial for a "ring of tangles" link in terms of Kauffman bracket polynomials of the numerators and denominators of the tangles building the link. Finally, using this formula and known results on rational links, the Maple program is designed.
APA, Harvard, Vancouver, ISO, and other styles
13

Beck, Cheryl T., and Robert K. Gable. "Item Response Theory in Affective Instrument Development: An Illustration." Journal of Nursing Measurement 9, no. 1 (May 2001): 5–22. http://dx.doi.org/10.1891/1061-3749.9.1.5.

Full text
Abstract:
The benefits of item response theory (IRT) analysis in obtaining empirical support for construct validity make it an essential step in the instrument development process. IRT analysis can result in finer construct interpretations that lead to more thorough descriptions of low- and high-scoring respondents. A critical function of IRT is its ability to determine the adequacy with which the attitude continuum underlying each dimension is assessed by the respective items in an instrument. Many nurse researchers, however, are not reaping the benefits of IRT in the development of affective instruments. The purpose of this article is to familiarize nurse researchers with this valuable approach through a description of the Facets computer program. Facets uses a one parameter (i.e., item difficulty) Rasch measurement model. Data from a survey of 525 new mothers that assessed the psychometric properties of the Postpartum Depresssion Screening Scale are used to illustrate the Facets program. It is hoped that IRT will gain increased prominence in affective instrument development as more nurse researchers become aware of computer programs such as Facets to assist in analysis.
APA, Harvard, Vancouver, ISO, and other styles
14

Weng, Juyang. "Autonomous Programming for General Purposes: Theory." International Journal of Humanoid Robotics 17, no. 04 (August 2020): 2050016. http://dx.doi.org/10.1142/s0219843620500164.

Full text
Abstract:
The universal Turing Machine (TM) is a model for Von Neumann computers — general-purpose computers. A human brain, linked with its biological body, can inside-skull-autonomously learn a universal TM so that he acts as a general-purpose computer and writes a computer program for any practical purposes. It is unknown whether a robot can accomplish the same. This theoretical work shows how the Developmental Network (DN), linked with its robot body, can accomplish this. Unlike a traditional TM, the TM learned by DN is a super TM — Grounded, Emergent, Natural, Incremental, Skulled, Attentive, Motivated, and Abstractive (GENISAMA). A DN is free of any central controller (e.g., Master Map, convolution, or error back-propagation). Its learning from a teacher TM is one transition observation at a time, immediate, and error-free until all its neurons have been initialized by early observed teacher transitions. From that point on, the DN is no longer error-free but is always optimal at every time instance in the sense of maximal likelihood, conditioned on its limited computational resources and the learning experience. This paper extends the Church–Turing thesis to a stronger version — a GENISAMA TM is capable of Autonomous Programming for General Purposes (APFGP) — and proves both the Church–Turing thesis and its stronger version.
APA, Harvard, Vancouver, ISO, and other styles
15

Voevodin, V. V. "Supercomputing technologies in the digital world: theory, practice, education." Вестник Российской академии наук 89, no. 4 (April 24, 2019): 351–54. http://dx.doi.org/10.31857/s0869-5873894351-354.

Full text
Abstract:
Supercomputing technologies are used in almost all fields of science today, and determine the competitiveness of science and industry among national entities. USA, Europe, China, and Japan are investing billions in the development of supercomputing technologies, promoting national programs for the development of this field, and these programs will determine the success of future developments. The underestimation of the value of supercomputing technologies has led Russia to fall behind in global trends, and squanders the enormous potential of Russian specialists in computer science. Russia needs a comprehensive supercomputer program, and cannot delay its enactment.
APA, Harvard, Vancouver, ISO, and other styles
16

Widodo, Catur Edi. "VIRTUAL LABORATORY OF THIN LENSES USING ANDROID SMARTPHONE WITH PYTHON PROGRAMMING." International Journal of Innovative Research in Advanced Engineering 9, no. 5 (May 31, 2022): 128–32. http://dx.doi.org/10.26562/ijirae.2022.v0905.05.

Full text
Abstract:
A computer program has been created to simulate a ray diagram on a thin lens using the Python programming language. The program is a ray diagram simulation on a convex lens and a concave lens. The program is built using the canvas, create line, button and motion functions in the object-oriented programming language Python. The object being simulated is a convex and concave lens with a focal length of 10 cm and an object's height of 4 cm. The simulation results are in the form of an interface with the user using computer graphic media and interaction via a touch screen. The program can run on Android mobile phones. The results of ray diagrams on computers and Android cellular phones show that they are in accordance with theory, so that the program can be used as a virtual laboratory material.
APA, Harvard, Vancouver, ISO, and other styles
17

Liang, Hui Yi, and Chih Chien Yang. "Computer Assisted Language Learning and Gray Model for Promoting Phonics Learning in Continuing Education." Applied Mechanics and Materials 284-287 (January 2013): 3554–58. http://dx.doi.org/10.4028/www.scientific.net/amm.284-287.3554.

Full text
Abstract:
This study uses quantitative methods to rate content and teaching on a phonics program delivered by computer assisted language learning (CALL). Data was obtained by Questionnaire and analysed using GM (0,N) model of Grey Theory. Results showed a high effectiveness rating and underlined the value of computer assisted language learning in the continuing education programs in the subject University.
APA, Harvard, Vancouver, ISO, and other styles
18

Petersson, Kent, and Jan M. Smith. "Program derivation in type theory: A partitioning problem." Computer Languages 11, no. 3-4 (January 1986): 161–72. http://dx.doi.org/10.1016/0096-0551(86)90009-3.

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

Bollinger, Terry. "Fundamental As Fewer Bits." Terry's Archive Online 2018, no. 01 (February 8, 2021): 0122. http://dx.doi.org/10.48034/20180122.

Full text
Abstract:
A physics theory predicts precise experimental results for some set of naturally occurring phenomena. Consequently, every well-formed physics theory is equivalent to a computer program that uses input descriptions of specific experimental setups to generate the outputs expected from those setups. The Kolmogorov complexity (or Kolmogorov minimum) of such a computer program is the program that uses the smallest number of bits to represent the largest possible of such input-output data pairs accurately. The principle of concise prediction asserts that the theory whose program length is shortest for a given set of experimental inputs and results is the one most likely to lead to deeper insights and new physics.
APA, Harvard, Vancouver, ISO, and other styles
20

Azmi, Ahmad Faza. "Structural Analysis Program Using Direct Stiffness Method for The Design of Reinforced Concrete Column." JEECS (Journal of Electrical Engineering and Computer Sciences) 2, no. 1 (June 30, 2017): 183–90. http://dx.doi.org/10.54732/jeecs.v2i1.161.

Full text
Abstract:
Most of the analyzes and calculations in civil engineering have been using computer. But many commercial structuralanalysis programs are relatively expensive. Hence one of the alternative way is using a self developed structuralanalysis program. The computer program is constructed using Visual Basic 6 programming language. Using directstiffness method and theory of ACI 318-02, a numerical procedure along with a computer program was developed forthe structural analysis and design of reinforced concrete member. From the direct stiffness method,in terms ofstructural analysis, the output that obtained from the program are internal element forces and support reactions nodedisplacements. From ACI 318-02 codes, in terms of reinforced concrete member analysis, the program generate theamount of longitudinal and lateral reinforcement of concrete member based on the output in the previous structureanalysis program. The program also reveals the biaxial bending-axial interaction diagrams in each direction ofrectangular and circular column. The interaction diagram of the columns is a visual representation to determine themaximum axial load and moment exceeded the capacity of the column.
APA, Harvard, Vancouver, ISO, and other styles
21

Lepperhoff, Niels. "Dreamscape Testing the Rational Choice Theory." Advances in Complex Systems 03, no. 01n04 (January 2000): 209–20. http://dx.doi.org/10.1142/s0219525900000169.

Full text
Abstract:
This work is an example for the use of computer simulation for testing theory completeness. The multi-agent model Dreamscape is a transformation of the Rational Choice Theory into a computer program. In this work the general applicability of the Rational Choice Theory is tested. The research question is: Does social order emerge out of the "state of nature"? In particular: Do social norms evolve? In a computer-based analysis for non-violent agents it is shown, that conjunct, proscriptive norms are able to emerge – apart from their legitimacy. On the contrary, in a violent population social order does not emerge.
APA, Harvard, Vancouver, ISO, and other styles
22

Wang, Guangming, Hao Zhang, Xiaoyu Li, Jiabo Wang, Xiaohui Zhang, and Guoqiang Fan. "Computer-aided synthesis of spherical and planar 4R linkages for four specified orientations." Mechanical Sciences 10, no. 1 (June 25, 2019): 309–20. http://dx.doi.org/10.5194/ms-10-309-2019.

Full text
Abstract:
Abstract. According to the burmester theory, an infinite number of spherical or planar 4R linkages for a specific four-orientation task can be synthesized, but most of the linkage solutions calculated by this method are invalid because of motion defect, poor performance and others. In order to improve the synthesis efficiency, a program package based on Matlab is developed to find a satisfied linkage solution automatically and quickly. Firstly, the calculation on circle points and the center points based on the burmester theory in spherical problems is introduced. Secondly, the calculation methods of linkage defect discrimination, linkage type classification, linkage performance evaluation and solutions visualization based on the theory of spherical trigonometry are presented respectively. Thirdly, the synthesis calculation of program package is extended to the planar 4R linkage based on the theory of planar analytic geometry. Finally, the examples of the spherical synthesis problem and the planar synthesis problem based on solutions map are introduced to test the program package, the result proves this program package is effective and flexible.
APA, Harvard, Vancouver, ISO, and other styles
23

Greenfield, Gary R. "Art by computer program == programmer creativity." Digital Creativity 17, no. 1 (January 2006): 25–35. http://dx.doi.org/10.1080/14626260600665694.

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

Nazar Muneam Mahmood. "COMPUTER PROGRAM TO PREDICT PERFORMANCE OF FAST RUNNING HORIZONTAL AXIS WIND TURBINE TO REACHING THE OPTIMUM DESIGN." Diyala Journal of Engineering Sciences 4, no. 2 (December 1, 2011): 57–71. http://dx.doi.org/10.24237/djes.2011.04205.

Full text
Abstract:
A computer program in visual basic was designed to predict the performance of fast running horizontal axis wind turbine for electricity generation by using blade element theory and momentum theory. NACA 4415 was chosen for the aerofoil section of blade. the design parameters ( design tip speed ratio , rotor radius and blade number ) represented in scroll bars was designed in visual basic, and by changing these parameters , solidity, chord line and twist angle curves along the blade, in addition to the rotor performance curve (relation of power coefficient with tip speed ratio), will be draw instantly. The numerical integration (trapezoidal method) was used to compute the area under rotor performance curve, the program will record the value of this area, and by change parameter design and by knowing the maximum value of area, we will know the optimal design for turbine rotor. The three and four rotor blades and the values of design tip speed ratio between (5 - 9) give the best performance of rotor. The effect change of rotor radius on performance rotor was found very small, and there is no noticed effect to rated wind speed on rotor performance when changing parameter design in computer program
APA, Harvard, Vancouver, ISO, and other styles
25

Brennan, Susan E. "Caricature Generator: The Dynamic Exaggeration of Faces by Computer." Leonardo 40, no. 4 (August 2007): 392–400. http://dx.doi.org/10.1162/leon.2007.40.4.392.

Full text
Abstract:
The author has researched and developed a theory of computation for caricature and has implemented this theory as an interactive computer graphics program. The Caricature Generator program is used to create caricatures by amplifying the differences between the face to be caricatured and a comparison face. This continuous, parallel amplification of facial features on the computer screen simulates the visualization process in the imagination of the caricaturist. The result is a recognizable, animated caricature, generated by computer and mediated by an individual who may or may not have facility for drawing, but who, like most human beings, is expert at visualizing and recognizing faces.
APA, Harvard, Vancouver, ISO, and other styles
26

Henson, Martin C. "Program development in the constructive set theory TK." Formal Aspects of Computing 1, no. 1 (March 1989): 173–92. http://dx.doi.org/10.1007/bf01887204.

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

Lin, Fangzhen. "Parameterized Logical Theories." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 7 (May 18, 2021): 6402–9. http://dx.doi.org/10.1609/aaai.v35i7.16794.

Full text
Abstract:
A theory in first-order logic is a set of sentences. A parameterized theory is a first-order theory with some of its predicates and functions identified as parameters, together with some import statements that call other parameterized theories. A KB is then a collection of these interconnected parameterised theories, similar to how a computer program is constructed as a set of functions in a modern programming language. In this paper, we provide a translational semantics for these parameterized theories in first-order logic using the situation calculus. We also discuss their potential uses in areas such as multi-context reasoning and logical formalization of computer programs.
APA, Harvard, Vancouver, ISO, and other styles
28

KAMEYAMA, YUKIYOSHI. "A TYPE-FREE THEORY OF HALF-MONOTONE INDUCTIVE DEFINITIONS." International Journal of Foundations of Computer Science 06, no. 03 (September 1995): 203–34. http://dx.doi.org/10.1142/s0129054195000147.

Full text
Abstract:
This paper studies an extension of inductive definitions in the context of a type-free theory. It is a kind of simultaneous inductive definition of two predicates where the defining formulas are monotone with respect to the first predicate, but not monotone with respect to the second predicate. We call this inductive definition half-monotone in analogy of Allen’s term half-positive. We can regard this definition as a variant of monotone inductive definitions by introducing a refined order between tuples of predicates. We give a general theory for half-monotone inductive definitions in a type-free first-order logic. We then give a realizability interpretation to our theory, and prove its soundness by extending Tatsuta’s technique. The mechanism of half-monotone inductive definitions is shown to be useful in interpreting many theories, including the Logical Theory of Constructions, and Martin-Löf’s Type Theory. We can also formalize the provability relation “a term p is a proof of a proposition P” naturally. As an application of this formalization, several techniques of program/proof-improvement can be formalized in our theory, and we can make use of this fact to develop programs in the paradigm of Constructive Programming. A characteristic point of our approach is that we can extract an optimization program since our theory enjoys the program extraction theorem.
APA, Harvard, Vancouver, ISO, and other styles
29

Huang, Xue Zheng, Yang Tao Liu, and Lei Zhang. "The Computer Simulation of the Acid-Base Titration." Advanced Materials Research 634-638 (January 2013): 20–24. http://dx.doi.org/10.4028/www.scientific.net/amr.634-638.20.

Full text
Abstract:
The mathematical model on acid-base titration was established by using analytical chemistry theory; therefore the author designed a program to solve the model by using of Visual Basic language. The program can not only calculate the pH Value of the acid-base titration solution, choose the appropriate indicator, calculate the endpoint error and judge the feasibility of the titration, but also can draw the curve of the acid-base titration.
APA, Harvard, Vancouver, ISO, and other styles
30

DUDA, P., J. GRABSKI, J. KOTUR, W. PERYT, L. PROBOSZCZ, Z. ZYLA, and R. KUPCZAK. "Computer Aided Physical Laboratory in CAMAC System." International Journal of Modern Physics C 02, no. 01 (March 1991): 337–42. http://dx.doi.org/10.1142/s0129183191000445.

Full text
Abstract:
A new “on-line” physical laboratory for students is presented. Two standards of interfaces are used for communication: CAMAC and GPIB. Programs use pull-down menus fully described in Polish language (the display works in graphics mode). It resembles the “decision tree” technique. The program leads the user by the hand offering him a set of options to choose. Every time a brief help is available on the screen. The assistance can give students more freedom because a computer program watches every mistake that could destroy the device.
APA, Harvard, Vancouver, ISO, and other styles
31

Meier, Scott T., and James P. Sampson. "Use of Computer-Assisted Instruction in the Prevention of Alcohol Abuse." Journal of Drug Education 19, no. 3 (September 1989): 245–56. http://dx.doi.org/10.2190/ktgd-qwgt-qcnh-t2c9.

Full text
Abstract:
Recent critiques of and research with traditional alcohol prevention programs have revealed serious problems. Prevention programs typically increase knowledge and appropriate attitudes about alcohol while having little effect on drinking behavior. In this article several concepts are introduced in support of a technology which has the potential to revitalize alcohol education efforts. First, Bandura's self-efficacy theory offers a direction for re-conceptualizing the design of prevention programs as well as the measurement of their effects. Second, computer-assisted instruction (CAI) programs may provide a means for capturing attention, effectively educating about alcohol, and supplementing traditional approaches. One current CAI program is described in detail. Implications for research and practice and obstacles to effective CAI use are also discussed.
APA, Harvard, Vancouver, ISO, and other styles
32

Guglielmetti, R. "CoxIter – Computing invariants of hyperbolic Coxeter groups." LMS Journal of Computation and Mathematics 18, no. 1 (2015): 754–73. http://dx.doi.org/10.1112/s1461157015000273.

Full text
Abstract:
CoxIter is a computer program designed to compute invariants of hyperbolic Coxeter groups. Given such a group, the program determines whether it is cocompact or of finite covolume, whether it is arithmetic in the non-cocompact case, and whether it provides the Euler characteristic and the combinatorial structure of the associated fundamental polyhedron. The aim of this paper is to present the theoretical background for the program. The source code is available online as supplementary material with the published article and on the author’s website (http://coxiter.rgug.ch).Supplementary materials are available with this article.
APA, Harvard, Vancouver, ISO, and other styles
33

Davidson, MG, RL Dewar, HJ Gardner, and J. Howard. "Hamiltonian Maps for Heliac Magnetic Islands." Australian Journal of Physics 48, no. 5 (1995): 871. http://dx.doi.org/10.1071/ph950871.

Full text
Abstract:
Magnetic islands in toroidal heliac stellarator vacuum fields are explored with Hamiltonian chaos theory and the associated area-preserving maps. Magnetic field line island chains are examined first analytically, with perturbation theory, and then numerically to produce Poincaré sections, which are compared with H−1 Heliac stellarator puncture plot diagrams. Rotational transform profiles are chosen to permit the comparison of twist map and nontwist map predictions with field line behaviour computed by a field line tracing computer program and observed experimentally.
APA, Harvard, Vancouver, ISO, and other styles
34

Rzasinski, Rafal. "Databases Model for Determining of Technological Features Based on the Theory of Technological Similarity." Advanced Materials Research 1036 (October 2014): 891–96. http://dx.doi.org/10.4028/www.scientific.net/amr.1036.891.

Full text
Abstract:
The main achievements presented in this paper are developed method orientated on computer aiding and computer program method, both used in designing process of the new technical features. Analyzed methods develop algorithmisation of selection features and support integration with the process of the preparation of the production. Further analyses will be carried on in order to specify the theory of the technological similarity in the new forms of computer aiding (relational databases). The represented programs were being developed on the practical examples of creating the module systems of hydraulic cylinders used in mining, slag cars used in metallurgy and gears series of types. Programs and data bases presented in the paper are basis of selection of the technological features in the process series of types of the technology creating. All of these applications support the intensive development of the types of technical features and affect on their competitive on the ready market.
APA, Harvard, Vancouver, ISO, and other styles
35

MORIARTY, K. J. M., and T. TRAPPENBERG. "PROGRAMMING TOOLS FOR PARALLEL COMPUTERS." International Journal of Modern Physics C 04, no. 06 (December 1993): 1285–94. http://dx.doi.org/10.1142/s0129183193001002.

Full text
Abstract:
Although software tools already have a place on serial and vector computers they are becoming increasingly important for parallel computing. Message passing libraries, parallel operating systems and high level parallel languages are the basic software tools necessary to implement a parallel processing program. These tools up to now have been specific to each parallel computer system and a short survey will be given. The aim of another class of software tools for parallel computers is to help in writing or rewriting application programs. Because automatic parallelization tools are not very successful, an interactive component has to be incorporated. We will concentrate here on the discussion of SPEFY, a parallel program development facility.
APA, Harvard, Vancouver, ISO, and other styles
36

Vančík, Vladimír, and Milan Jirásek. "Computer-Aided Plastic Limit Analysis of Plates." Applied Mechanics and Materials 821 (January 2016): 547–54. http://dx.doi.org/10.4028/www.scientific.net/amm.821.547.

Full text
Abstract:
This article reports on a new tool for optimized design of reinforced concrete plates based on the yield-line theory. The primary focus is on the development of a computer program which can analyze arbitrary yield-line systems with one degree of freedom. The program includes a GUI for quick and intuitive input, and automatically performs analysis of yield-line systems regardless of the complexity of their analytical solution. Furthermore, optimization of orthotropic reinforcement is implemented. The possibility of yield-line analysis of systems with multiple degrees of freedom by linear programming is examined.
APA, Harvard, Vancouver, ISO, and other styles
37

You, Yong Bin, Shan Shan Zhao, Rui Jun Jing, and Li Yan Liu. "Embedded Computer Performance Evaluation Model Based on Weight Contact Coefficient." Advanced Materials Research 951 (May 2014): 208–13. http://dx.doi.org/10.4028/www.scientific.net/amr.951.208.

Full text
Abstract:
Because the embedded computer performance evaluation indexes are uncertainty, the better method of embedded computer performance evaluation is proposed by applying the set pair analysis theory. First, identical degree, different degree, and contrary degree are respectively determined by the optimal program, intermediate program and worst program, and the weight of performance evaluation indexes are determined by order relation analysis. Finally, the weight contact coefficient is obtained, and the sort of embedded computer performance is determined by situation of weight contact coefficient. The experimental results show that this method can effectively evaluate the embedded computer performance, and the evaluation results are in line with the actual situation.
APA, Harvard, Vancouver, ISO, and other styles
38

Kuokkala, V. T. "Computer simulation of transmission electron micrographs by microscope for windows." Proceedings, annual meeting, Electron Microscopy Society of America 54 (August 11, 1996): 126–27. http://dx.doi.org/10.1017/s0424820100163095.

Full text
Abstract:
microScope for Windows™ is a transmission electron micrograph simulation program for brightfield and darkfield images of dislocations and stacking faults, based on the dynamical two-beam theory and the column approximation. The program is a modification of the original programs of Head et al, which have been rewritten in Visual Basic™ 4.0 for Microsoft® Windows™ 3.1. microScope for Windows™ also includes routines needed to prepare data for the actual calculation of the image, and to calculate and display a rocking curve for any pixel of the previously computed brightfield or darkfield image. On a 120 MHz Pentium, microScope for Windows™ calculates a true gray scale (256 gray level) image consisting of 19840 pixels in about 10 seconds (version 2.3). A 300 dpi laserprinter screendump at the end of the calculation of an image is shown in Fig. 1.
APA, Harvard, Vancouver, ISO, and other styles
39

Horsman, D. C. "Abstraction/Representation Theory for heterotic physical computing." Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 373, no. 2046 (July 28, 2015): 20140224. http://dx.doi.org/10.1098/rsta.2014.0224.

Full text
Abstract:
We give a rigorous framework for the interaction of physical computing devices with abstract computation. Device and program are mediated by the non-logical representation relation ; we give the conditions under which representation and device theory give rise to commuting diagrams between logical and physical domains, and the conditions for computation to occur. We give the interface of this new framework with currently existing formal methods, showing in particular its close relationship to refinement theory, and the implications for questions of meaning and reference in theoretical computer science. The case of hybrid computing is considered in detail, addressing in particular the example of an Internet-mediated social machine , and the abstraction/representation framework used to provide a formal distinction between heterotic and hybrid computing. This forms the basis for future use of the framework in formal treatments of non-standard physical computers.
APA, Harvard, Vancouver, ISO, and other styles
40

Karas, S. I., K. S. Brazovsky, and A. V. Konev. "The methodology of development of computer learning programs in higher medical education." Bulletin of Siberian Medicine 1, no. 2 (June 30, 2002): 59–64. http://dx.doi.org/10.20538/1682-0363-2002-2-59-64.

Full text
Abstract:
The medicine is weakly formalized domain, and preliminary study of knowledge structure is necessary for computerlearning programs development. Semantic network can be offered as an universal knowledge model for higher medical education. The links between nodes reflect their semantic distance. Graph theory is an adequate tool for knowledge structure investigation, and the results of one prove knowledge models for certain domains and optimal navigation through the program. The last depends on personal features of students, too. So, the basic principles for computer learning programs development in higher medical education are knowledge structure modeling and individual learning navigation.
APA, Harvard, Vancouver, ISO, and other styles
41

Zullini, Aldo, and Giuseppe Manganelli. "A new computer program for nematode identification." Bioinformatics 5, no. 3 (1989): 243–44. http://dx.doi.org/10.1093/bioinformatics/5.3.243.

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

Maia, Bruno, and Joao P. A. R. Cunha. "Computer program for distance learning of pesticide application technology." Anais da Academia Brasileira de Ciências 83, no. 4 (October 7, 2011): 1413–20. http://dx.doi.org/10.1590/s0001-37652011005000038.

Full text
Abstract:
Distance learning presents great potential for mitigating field problems on pesticide application technology. Thus, due to the lack of teaching material about pesticide spraying technology in the Portuguese language and the increasing availability of distance learning, this study developed and evaluated a computer program for distance learning about the theory of pesticide spraying technology using the tools of information technology. The modules comprising the course, named Pulverizar, were: (1) Basic concepts, (2) Factors that affect application, (3) Equipments, (4) Spraying nozzles, (5) Sprayer calibration, (6) Aerial application, (7) Chemigation, (8) Physical-chemical properties, (9) Formulations, (10) Adjuvants, (11) Water quality, and (12) Adequate use of pesticides. The program was made available to the public on July 1st, 2008, hosted at the web site www.pulverizar.iciag.ufu.br, and was simple, robust and practical on the complementation of traditional teaching for the education of professionals in Agricultural Sciences. Mastering pesticide spraying technology by people involved in agricultural production can be facilitated by the program Pulverizar, which was well accepted in its initial evaluation.
APA, Harvard, Vancouver, ISO, and other styles
43

Zielenkiewicz, Maciej, and Aleksy Schubert. "Automata theory approach to predicate intuitionistic logic." Journal of Logic and Computation 32, no. 3 (November 16, 2021): 554–80. http://dx.doi.org/10.1093/logcom/exab069.

Full text
Abstract:
Abstract Predicate intuitionistic logic is a well-established fragment of dependent types. Proof construction in this logic, as the Curry–Howard isomorphism states, is the process of program synthesis. We present automata that can handle proof construction and program synthesis in full intuitionistic first-order logic. Given a formula, we can construct an automaton such that the formula is provable if and only if the automaton has an accepting run. As further research, this construction makes it possible to discuss formal languages of proofs or programs, the closure properties of the automata and their connections with the traditional logical connectives.
APA, Harvard, Vancouver, ISO, and other styles
44

Meier, Barbara. "BUCOLIC: A Program for Teaching Color Theory to Art Students." IEEE Computer Graphics and Applications 5, no. 7 (1985): 57–65. http://dx.doi.org/10.1109/mcg.1985.276464.

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

Li, Xiao Bin, and De Rong Jiang. "Study on CAPP System Based on Rough Set Theory." Advanced Materials Research 219-220 (March 2011): 1060–63. http://dx.doi.org/10.4028/www.scientific.net/amr.219-220.1060.

Full text
Abstract:
As a significant technology of Computer Integrated Manufacturing System (CIMS), Computer Aided Process Planning (CAPP) is the bridge between Computer Aided Design (CAD) and Computer Aided Manufacturing (CAM). Meanwhile, it is a momentous foundation for building the overall information model of manufacturing of engineering product. By using of which along with the theory of rough set in rule reduction of expert system, the development of CAPP system framework is basis of .net platform, utilizing Visual Studio 2003 to design the system interface and associated structured query language (SQL) allow distributed data processing and data access, which is supported by SQL Server 2000. By designing and running the program, the method of designing is verified.
APA, Harvard, Vancouver, ISO, and other styles
46

Baryshnikov, Pavel N. "Extension of Critical Programs of the Computational Theory of Mind." Filozofia i Nauka Zeszyt specjalny, no. 10 (May 10, 2022): 263–74. http://dx.doi.org/10.37240/fin.2022.10.zs.12.

Full text
Abstract:
Technological advances in computer science have secured the computer metaphor status of a heuristic methodological tool used to answer the question about the nature of mind. Nevertheless, some philosophers strongly support opposite opinions. Anti-computationalism in the philosophy of mind is a methodological program that uses extremely heterogeneous grounds for argumentation, deserving analysis and discussion. This article provides an overview and interpretation of the traditional criticism of the computational theory of mind (computationalism); its basic theses have been formed in Western philosophy in the last quarter of the 20th century. The main goal is to reveal the content of the arguments of typical anti-computationalist programs and expand their application to the framework of the semantic problems of the Classic Computational Theory of Mind. The main fault of the symbolic ap-proach in the classical computationalism is the absence of a full-fledged theory of semantic properties. The relevance of considering these seemingly outdated problems is justified by the fact that the problem of meaning (and general problems of semantics) remains in the core of the latest developments in various areas of AI and the principles of human-computer interaction.
APA, Harvard, Vancouver, ISO, and other styles
47

Bendor, Jonathan, Terry M. Moe, and Kenneth W. Shotts. "Recycling the Garbage Can: An Assessment of the Research Program." American Political Science Review 95, no. 1 (March 2001): 169–90. http://dx.doi.org/10.1017/s0003055401000041.

Full text
Abstract:
The garbage can theory of organizational choice is one of the best-known innovations in modern organization theory. It also has significantly shaped a major branch of the new institutionalism. Yet, the theory has not received the systematic assessment that it both deserves and needs. We evaluate the early verbal theory and argue that it fails to create an adequate foundation for scientific progress. We then analyze and rerun Cohen, March, and Olsen’s computer model and discover that its agents move in lockstep patterns that are strikingly different from the spirit of the theory. Indeed, the simulation and the theory are incompatible. Next, we examine how the authors have built upon these incompatible formulations in developing the theory further. We assess this larger program, which includes the March-Olsen version of the new institutionalism, and find that many of the problems that attended the original article have intensified over time. We conclude that a fundamental overhaul is required if the theory is to realize its early promise.
APA, Harvard, Vancouver, ISO, and other styles
48

Ma, Ce, Heewon Lee, and David M. Lubman. "Computer Simulation of the Operation of a Three-Dimensional Quadrupole Ion Trap." Applied Spectroscopy 46, no. 12 (December 1992): 1769–79. http://dx.doi.org/10.1366/0003702924123458.

Full text
Abstract:
A computer simulation of the motion of ions in a three-dimensional (3-D) quadrupole ion trap has been performed with a Gateway 386 PC/AT computer. The SIMION program was used as the main program to calculate the potential array of the ion trap space. Several user-written programs were interfaced to the SIMION program to simulate the effects of changing various operating conditions, such as the radio-frequency (rf) potential, the collisional buffer gas, external ion injection, dc ejection from the trap, and resonance ejection. With the use of this simulation, the total storage mass range could be obtained as a function of rf voltage and frequency. The simulations show, as expected, that the collisional buffer gas plays an important role in both stabilizing the trajectory of high-kinetic-energy ions (hot ions) inside the ion trap and trapping ions injected from an external source. Several different buffer gases were studied for their effects upon the trapping motion. In addition, both the total mass ejection that results from applying a dc pulse on the output end-cap electrode and the ion ejection that results from applying an rf frequency to the end cap to produce resonance ejection were also studied with this simulation program. It is demonstrated that a simple PC computer using a modified SIMION program provides results very similar to those expected from theory or from previous work.
APA, Harvard, Vancouver, ISO, and other styles
49

Shu-Xia, Yin, Wang Yan, and Feng Wen-Lin. "A Computer Program for Quantized Calculation of Thermal Rate Constants of Unified Statistical Theory." Acta Physico-Chimica Sinica 14, no. 03 (1998): 232–36. http://dx.doi.org/10.3866/pku.whxb19980308.

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

Gardner, Rick M., and Russel Boice. "A computer program to generate signal-detection theory values for sensitivity and response bias." Behavior Research Methods, Instruments, & Computers 18, no. 1 (January 1986): 54–56. http://dx.doi.org/10.3758/bf03200997.

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