Log in

Relevant bibliographies by topics / BASEX (Computer program language)

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

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

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

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 'BASEX (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 "BASEX (Computer program language)"

1

Van Merriënboer, Jeroen J. G., and Marcel B. M. De Croock. "Strategies for Computer-Based Programming Instruction: Program Completion vs. Program Generation." Journal of Educational Computing Research 8, no. 3 (August 1992): 365–94. http://dx.doi.org/10.2190/mjdx-9pp4-kfmt-09pm.

Full text

Abstract:

Two instructional strategies were implemented in a two-and-a-half hour computer-based training program that was designed to teach elementary turtle graphics programming techniques to novice undergraduate students ( N = 40). Learning activities that either emphasized the completion of existing programs or the generation of new programs were studied for the two strategies. In the completion group, the information needed to perform the program completion tasks appeared to be largely available in the to-be-completed programs; in the generation group, students frequently had to search for useful examples while they were performing their program generation tasks. It is hypothesized that during practice, the direct availability of examples in the form of incomplete computer programs facilitates the acquisition of programming language templates, especially because students cannot complete a program without carefully studying it so that “mindful abstraction” is explicitly provoked. Data in this study on learning outcomes support this hypothesis: the completion group showed a superior use of programming language templates in both a program construction test and a multiple choice test that measured the knowledge of language statements.

APA, Harvard, Vancouver, ISO, and other styles

2

Pezold, Mollee J., Caitlin M. Imgrund, and Holly L. Storkel. "Using Computer Programs for Language Sample Analysis." Language, Speech, and Hearing Services in Schools 51, no. 1 (January 8, 2020): 103–14. http://dx.doi.org/10.1044/2019_lshss-18-0148.

Full text

Abstract:

Purpose Although language sample analysis is widely recommended for assessing children's expressive language, few school-based speech-language pathologists routinely use it, citing a lack of time, resources, and training ( Pavelko, Owens, Ireland, & Hahs-Vaughn, 2016 ). The purpose of this clinical tutorial is (a) to describe options for language sample analysis using computer programs and (b) to demonstrate a process of using language sample analysis focused on the assessment of 2 preschool children as case studies. Method We provide an overview of collecting and analyzing child language samples and describe 3 programs for language sample analysis: 2 dedicated software programs (Computerized Language Analysis [ MacWhinney, 2000 ] and Systematic Analysis of Language Transcripts [ Miller & Iglesias, 2015 ]) and 1 protocol for using word processing software to analyze language samples (Sampling Utterances and Grammatical Analysis Revised; Pavelko & Owens, 2017 ). We also present analysis results from each program for play-based language samples from 2 preschool children and detailed analysis of the samples with potential treatment goals. Results Each program offers different analyses, comparison databases, and sampling contexts. We present options for additional analysis, clinical interpretations, and potential treatment goals based on the 2 preschool cases. Conclusion Clinicians can use computer programs for language sample analysis as part of a process to make naturalistic language assessment more feasible. Supplemental Material https://doi.org/10.23641/asha.10093403

APA, Harvard, Vancouver, ISO, and other styles

3

Sulzmann, Martin, and Răzvan Voicu. "Language-Based Program Verification via Expressive Types." Electronic Notes in Theoretical Computer Science 174, no. 7 (June 2007): 129–47. http://dx.doi.org/10.1016/j.entcs.2006.10.041.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Irshad, Mufeeda, Merel Keijzer, Martijn Wieling, and Marjolijn Verspoor. "Effectiveness of a dynamic usage based computer assisted language program." Dutch Journal of Applied Linguistics 8, no. 2 (April 11, 2019): 137–62. http://dx.doi.org/10.1075/dujal.16018.irs.

Full text

Abstract:

Abstract The current paper explores whether a Dynamic Usage Based (DUB) approach – which takes authentic meaningful language use with repetition and scaffolding for comprehension as its basis – can also be implemented in a CALL environment. The effectiveness of the DUB-CALL program was tested in a semester-long experiment, comparing it with a teacher-fronted DUB program (using the same materials as the CALL program) and a traditional CLT program; 228 university undergraduates in Sri Lanka participated. Language gains were assessed in a pre-post design with an objective General English Proficiency (GEP) test and a writing task. The results show that the students in the DUB-CALL condition performed significantly better on the GEP test than the students in the two teacher-fronted classes. The results of the writing tests show that all groups improved significantly, but here there were no differences among groups.

APA, Harvard, Vancouver, ISO, and other styles

5

McGuire, Richard A. "Computer-Based Instrumentation." Language, Speech, and Hearing Services in Schools 26, no. 3 (July 1995): 223–31. http://dx.doi.org/10.1044/0161-1461.2603.223.

Full text

Abstract:

Currently, there are a number of useful computer-based programs available to assist speech-language pathologists in clinical intervention. As clinicians acquire computer-based systems, they must realize that responsible use of these systems is dependent on an understanding of the usefulness and limitations of this type of instrumentation. The purpose of this report is to provide a basic overview of (a) speech signal acquisition, (b) computer processing, and (c) some basic applications related to computer-based manipulation of speech. Although it may not be necessary for the clinician to configure and/or program these systems, a general understanding of the capacities and limitations of this instrumentation will provide a foundation for responsible and creative applications.

APA, Harvard, Vancouver, ISO, and other styles

6

Sarkisyan, A. A., and Yu G. Shukuryan. "Program testing technology based on specification language." Cybernetics 26, no. 6 (1991): 795–804. http://dx.doi.org/10.1007/bf01069487.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Moslemi Nezhad Arani, Saieed. "Teaching and Researching Computer-Assisted Language Learning." GiST Education and Learning Research Journal, no. 17 (December 17, 2018): 260–67. http://dx.doi.org/10.26817/16925777.421.

Full text

Abstract:

The prominence of technology has always been booming since computers generated new lanes for human to make use of high-tech for many different purposes. Utilizing computers for learning goals, among many, is one of the main concerns followed by educational issues in teaching and learning, especially, of a new language. Computer-assisted language learning (CALL) is known as a branch of language studies which focuses on teaching and learning of a new language through applications of computers in language learning contexts. Many books, articles, reviews, and etc. being published regularly consider one or some issues related to the CALL. To this, researchers have tried to introduce or evaluate particular application of CALL in the mentioned field. Cameron (1988, p. 15) reasons that “The fact that there are so many different types of CALL programs in existence illustrates the futility of attempting to define a single set of program principles or structures to fit all situations.” Other subordinate technologies interconnected to the computerized exemplar have arrived the inclined in practice. For example, information communication technology (ICT) “has been integrated within the overall design of the methodology used in the language learning process is a key factor.” (Zhang, 2012, p. 8). Other similar well-intentioned works can be referred to as (Holland & Fisher, 2008; Donaldson & Haggstrom, 2006; Thomas, Reinders, & Warschauer, 2013) which consider discussions of series of actions taken as regards the CALL subject. Beatty’s “teaching and research in computer-assisted language learning” (2010) is considered as one of the most comprehensive books on defining and reorganizing concept of CALL into the language education. The following is a review based on Beatty’s book which is also highly recommended as for reading by the reviewer.

APA, Harvard, Vancouver, ISO, and other styles

8

Sugimoto, Toru, Noriko Ito, and Shino Iwashita. "A Proposal of a Language-Based Context-Sensitive Programming System." Journal of Advanced Computational Intelligence and Intelligent Informatics 11, no. 8 (October 20, 2007): 1015–22. http://dx.doi.org/10.20965/jaciii.2007.p1015.

Full text

Abstract:

This paper describes a programming system with which even novice users can easily specify complex requests as natural language texts, in other words, write programs in everyday language, to operate computing systems. Based on a study of task specification texts written by non-programmers, the processing model is designed so that implicit and ambiguous information in an input text is detected and transformed into an explicit executable program structure. Context dependency in programming is also considered. Context-dependent factors in the situation of program development and the situation of program execution are considered in text understanding and program execution phases, bridging the gap between these two contexts. We have developed a prototype system that deals with personal email management tasks. In this paper, we explain our processing model, give evaluation results, and discuss our proposal’s effectiveness and projected work.

APA, Harvard, Vancouver, ISO, and other styles

9

ANBERRÉE, THOMAS. "Semantical proofs of correctness for programs performing non-deterministic tests on real numbers." Mathematical Structures in Computer Science 20, no. 5 (October 2010): 723–51. http://dx.doi.org/10.1017/s0960129510000186.

Full text

Abstract:

We consider a functional language that performs non-deterministic tests on real numbers and define a denotational semantics for that language based on Smyth powerdomains. The semantics is only an approximate one because the denotation of a program for a real number may not be precise enough to tell which real number the program computes. However, for many first-order total functions f : n → , there exists a program for f whose denotation is precise enough to show that the program indeed computes the function f. In practice, it is not difficult to find programs like this that possess a faithful denotation. We provide a few examples of such programs and the corresponding proofs of correctness.

APA, Harvard, Vancouver, ISO, and other styles

10

DE LUCIA, A., G. TORTORA, and M. TUCCI. "CREATING TOOLS IN A SOFTWARE ENVIRONMENT BASED ON GRAPH REWRITING RULES." International Journal of Software Engineering and Knowledge Engineering 10, no. 02 (April 2000): 153–83. http://dx.doi.org/10.1142/s0218194000000109.

Full text

Abstract:

This paper presents the software development workbench WSDW (Web structure-oriented Software Development Workbench) together with the tool development language TDL. WSDW is an integrated structure-oriented software environment which contains several tools for software evolution. The integration of tools is achieved by sharing a program representation which is based upon the mathematical concept of relation: the web structure is the basic high level representation of programs within the environment. The TDL language is a structure-oriented language that supports the creation of a wide variety of tools both for software development and maintenance. The elementary statements in a TDL program are web rewriting rules and manipulations of programs are expressed as web transformations. Moreover, to make program transformations more intuitive to the tool programmer, web rewriting rules are expressed graphically. Each tool in WSDW performs a sequence of web transformations and new software tools can be implemented as TDL programs and integrated into WSDW.

APA, Harvard, Vancouver, ISO, and other styles

More sources

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

1

Veselinov, Roman Nikolov. "Formalization and verification of rewriting-based security polices." Worcester, Mass. : Worcester Polytechnic Institute, 2008. http://www.wpi.edu/Pubs/ETD/Available/etd-043008-165615/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Chamberlain, Bradford L. "The design and implementation of a region-based parallel programming language /." Thesis, Connect to this title online; UW restricted, 2001. http://hdl.handle.net/1773/6953.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Mehldau, Gerhard 1959. "A RULE-BASED PROGRAMMING LANGUAGE AND ITS APPLICATION TO IMAGE RECOGNITION." Thesis, The University of Arizona, 1986. http://hdl.handle.net/10150/276360.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Haugh, J. Steven. "The design of a virtual fact base for Prolog." Master's thesis, This resource online, 1991. http://scholar.lib.vt.edu/theses/available/etd-02022010-020103/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Dorlando, Laura Morales. "A Computer-Based Course to Teach Speech Acts: Prototype for the Technology Assisted Language Learning Program." BYU ScholarsArchive, 2006. https://scholarsarchive.byu.edu/etd/1051.

Full text

Abstract:

The following report discusses the design and formative evaluation of a prototype for a computer-based course to teach speech acts as part of the Technology Assisted Language Learning (TALL) program. The report includes a literature review on speech acts and current methods and strategies for language teaching and instructional design. Next, there is a description of the lessons and the design process, as well as a summary of the formative evaluation. Following is the prototype of the lesson on apologies. The report concludes with a discussion of the project's limitations and suggestions for future research.

APA, Harvard, Vancouver, ISO, and other styles

6

Graunke, Kenneth William. "Extensible Scheduling in a Haskell-based Operating System." PDXScholar, 2010. https://pdxscholar.library.pdx.edu/open_access_etds/1.

Full text

Abstract:

This thesis presents Lighthouse, an experimental branch of the Haskell-based House operating system which integrates Li et al.'s Lightweight Concurrency framework. First and foremost, it improves House's viability as a "real operating system" by providing a new extensible scheduler framework which makes it easy to experiment with different scheduling policies. In particular, Lighthouse extends Concurrent Haskell with thread priority and implements a priority-based scheduler which significantly improves system responsiveness when compared with GHC's normal round-robin scheduler. Even while doing this, it improves on House's claim of being "written in Haskell" by moving a whole subsystem out of the complex C-based runtime system and into Haskell itself. In addition, Lighthouse also includes an alternate, simpler implementation of Lightweight Concurrency which takes advantage of House's unique setting (running directly on uniprocessor x86 hardware). This experience sheds light on areas that need further attention before the system can truly be viable---primarily interactions between blackholing and interrupt handling. In particular, this thesis uncovers a potential case of self-deadlock and suggests potential solutions. Finally, this work offers further insight into the viability of using high-level languages such as Haskell for systems programming. Although laziness and blackholing present unique problems, many parts of the system are still much easier to express in Haskell than traditional languages such as C.

APA, Harvard, Vancouver, ISO, and other styles

7

Fang, Weijian. "Distributed object sharing for cluster-based Java virtual machine /." View the Table of Contents & Abstract, 2004. http://sunzi.lib.hku.hk/hkuto/record/B30575163.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Fang, Weijian, and 方維堅. "Distributed object sharing for cluster-based Java virtual machine." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B45014772.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Chen, Chun-Ting 1955. "IMPLEMENTATION OF THE MODEL BASE CONCEPT IN SIMSCRIPT II.5: APPLICATION TO COMPUTER NETWORK DESIGN." Thesis, The University of Arizona, 1987. http://hdl.handle.net/10150/291990.

Full text

Abstract:

This thesis presents an implementation of the model base concept in SIMSCRIPT II.5. It shows two principles in designing a flexible general simulation system. First of all, the input and output port intercommunication and synchronization should be done by an I/O coupling scheme, i.e. a coordinator. Second, every input port should be a separate file in the model base. Users can retrieve these files to couple them together and evaluate the simulation run. A well-designed computer network model base is shown through several examples. It will help the computer network system design to be done in a modular, hierarchical, coordinated fashion.

APA, Harvard, Vancouver, ISO, and other styles

10

Kuo, Yung-Li. "Developing a rule-based expert system with C programming language." Virtual Press, 1988. http://liblink.bsu.edu/uhtbin/catkey/552943.

Full text

Abstract:

Expert system techniques are now being incorporated successfully in commercial computer software packages. This thesis introduces the techniques of developing a rule-based expert system in a general-purpose programming language -- C. The topics of this thesis include significance of expert system shells and approaches used, structure of the knowledge base, loading of the knowledge base, manipulation of the probabilities of rule attributes, and implementation of the inference engine. The inference engine uses the information that users supply to find an object that matches. Today C language is one of the most popular programming languages in use and C compilers consistently produce extremely fast and efficient executable programs. Thisthesisdemonstrates that C language is an appropriate computer language for a rule-based expert system.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

More sources

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

1

Assembly language for Intel-based computers. 4th ed. Upper Saddle River, NJ: Prentice Hall, 2003.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

1951-, Irvine Kip R., ed. Assembly language for Intel-based computers. 3rd ed. Upper Saddle River, N.J: Prentice-Hall, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Assembly language for intel-based computers. 5th ed. Upper Saddle River, NJ: Pearson Prentice Hall, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

D, Federighi F., ed. Pascalgorithms: A Pascal-based introduction to computer science. Boston: Houghton Mifflin, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Chun, Wesley. Python fundamentals: Based on Core Python programming 2nd ed. Upper Saddle River, NJ: Prentice Hall, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Reilly, Edwin D. Pascalgorithms: A Pascal-based introduction to computerscience. Boston: Houghton Mifflin, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

C for programmers: A complete tutorial based on the ANSI standard. 2nd ed. Chichester: Wiley, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

S, Trout Matt, ed. The definitive guide to Catalyst: Writing extensible, scalable, and maintainable Perl-based Web applications. Berkeley, Calif: Apress, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Uppsala universitet. Institutionen för ADB och datalogi. and Swedish Institute of Computer Science., eds. AKL, a multiparadigm programming language: Based on a concurrent constraint framework. Uppsala: Computing Science Dept., Uppsala University, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Enrique, Castillo. Functional networks with applications: A neural-based paradigm. New York: Springer Science, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

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

1

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

2

Chen, Xiaohong, Zhengyao Lin, Minh-Thai Trinh, and Grigore Roşu. "Towards a Trustworthy Semantics-Based Language Framework via Proof Generation." In Computer Aided Verification, 477–99. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81688-9_23.

Full text

Abstract:

AbstractWe pursue the vision of an ideal language framework, where programming language designers only need to define the formal syntax and semantics of their languages, and all language tools are automatically generated by the framework. Due to the complexity of such a language framework, it is a big challenge to ensure its trustworthiness and to establish the correctness of the autogenerated language tools. In this paper, we propose an innovative approach based on proof generation. The key idea is to generate proof objects as correctness certificates for each individual task that the language tools conduct, on a case-by-case basis, and use a trustworthy proof checker to check the proof objects. This way, we avoid formally verifying the entire framework, which is practically impossible, and thus can make the language framework both practical and trustworthy. As a first step, we formalize program execution as mathematical proofs and generate their complete proof objects. The experimental result shows that the performance of our proof object generation and proof checking is very promising.

APA, Harvard, Vancouver, ISO, and other styles

3

Wolf, Felix A., Linard Arquint, Martin Clochard, Wytse Oortwijn, João C. Pereira, and Peter Müller. "Gobra: Modular Specification and Verification of Go Programs." In Computer Aided Verification, 367–79. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81685-8_17.

Full text

Abstract:

AbstractGo is an increasingly-popular systems programming language targeting, especially, concurrent and distributed systems. Go differentiates itself from other imperative languages by offering structural subtyping and lightweight concurrency through goroutines with message-passing communication. This combination of features poses interesting challenges for static verification, most prominently the combination of a mutable heap and advanced concurrency primitives.We present Gobra, a modular, deductive program verifier for Go that proves memory safety, crash safety, data-race freedom, and user-provided specifications. Gobra is based on separation logic and supports a large subset of Go. Its implementation translates an annotated Go program into the Viper intermediate verification language and uses an existing SMT-based verification backend to compute and discharge proof obligations.

APA, Harvard, Vancouver, ISO, and other styles

4

Parthasarathy, Gaurav, Peter Müller, and Alexander J. Summers. "Formally Validating a Practical Verification Condition Generator." In Computer Aided Verification, 704–27. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81688-9_33.

Full text

Abstract:

AbstractA program verifier produces reliable results only if both the logic used to justify the program’s correctness is sound, and the implementation of the program verifier is itself correct. Whereas it is common to formally prove soundness of the logic, the implementation of a verifier typically remains unverified. Bugs in verifier implementations may compromise the trustworthiness of successful verification results. Since program verifiers used in practice are complex, evolving software systems, it is generally not feasible to formally verify their implementation.In this paper, we present an alternative approach: we validate successful runs of the widely-used Boogie verifier by producing a certificate which proves correctness of the obtained verification result. Boogie performs a complex series of program translations before ultimately generating a verification condition whose validity should imply the correctness of the input program. We show how to certify three of Boogie’s core transformation phases: the elimination of cyclic control flow paths, the (SSA-like) replacement of assignments by assumptions using fresh variables (passification), and the final generation of verification conditions. Similar translations are employed by other verifiers. Our implementation produces certificates in Isabelle, based on a novel formalisation of the Boogie language.

APA, Harvard, Vancouver, ISO, and other styles

5

Sheng, Quanwei. "Based on the Big Data Program Language Learning Website Generation System." In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 38–53. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-63955-6_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Unno, Hiroshi, Tachio Terauchi, and Eric Koskinen. "Constraint-Based Relational Verification." In Computer Aided Verification, 742–66. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81685-8_35.

Full text

Abstract:

AbstractIn recent years they have been numerous works that aim to automate relational verification. Meanwhile, although Constrained Horn Clauses ($$\mathrm {CHCs}$$ CHCs ) empower a wide range of verification techniques and tools, they lack the ability to express hyperproperties beyond k-safety such as generalized non-interference and co-termination.This paper describes a novel and fully automated constraint-based approach to relational verification. We first introduce a new class of predicate Constraint Satisfaction Problems called $$\mathrm {pfwCSP}$$ pfwCSP where constraints are represented as clauses modulo first-order theories over predicate variables of three kinds: ordinary, well-founded, or functional. This generalization over $$\mathrm {CHCs}$$ CHCs permits arbitrary (i.e., possibly non-Horn) clauses, well-foundedness constraints, functionality constraints, and is capable of expressing these relational verification problems. Our approach enables us to express and automatically verify problem instances that require non-trivial (i.e., non-sequential and non-lock-step) self-composition by automatically inferring appropriate schedulers (or alignment) that dictate when and which program copies move. To solve problems in this new language, we present a constraint solving method for $$\mathrm {pfwCSP}$$ pfwCSP based on stratified CounterExample-Guided Inductive Synthesis (CEGIS) of ordinary, well-founded, and functional predicates.We have implemented the proposed framework and obtained promising results on diverse relational verification problems that are beyond the scope of the previous verification frameworks.

APA, Harvard, Vancouver, ISO, and other styles

7

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

8

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

9

Sakagami, Hitoshi. "Three-Dimensional Fluid Code with XcalableMP." In XcalableMP PGAS Programming Language, 165–79. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-7683-6_6.

Full text

Abstract:

AbstractIn order to adapt parallel computers to general convenient tools for computational scientists, a high-level and easy-to-use portable parallel programming paradigm is mandatory. XcalableMP, which is proposed by the XcalableMP Specification Working Group, is a directive-based language extension for Fortran and C to easily describe parallelization in programs for distributed memory parallel computers. The Omni XcalableMP compiler, which is provided as a reference XcalableMP compiler, is currently implemented as a source-to-source translator. It converts XcalableMP programs to standard MPI programs, which can be easily compiled by the native Fortran compiler and executed on most of parallel computers. A three-dimensional Eulerian fluid code written in Fortran is parallelized by XcalableMP using two different programming models with the ordinary domain decomposition method, and its performances are measured on the K computer. Programs converted by the Omni XcalableMP compiler prevent native Fortran compiler optimizations and show lower performance than that of hand-coded MPI programs. Finally almost the same performances are obtained by using specific compiler options of the native Fortran compiler in the case of a global-view programming model, but performance degradation is not improved by specifying any native compiler options when the code is parallelized by a local-view programming model.

APA, Harvard, Vancouver, ISO, and other styles

10

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

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

1

Johannesson, H. L. "Parametric Computer Aided Hydraulic Cylinder Design: Piston Component Modeling." In ASME 1989 Design Technical Conferences. American Society of Mechanical Engineers, 1989. http://dx.doi.org/10.1115/detc1989-0046.

Full text

Abstract:

Abstract In this work a procedure for parametric computer aided design of hydraulic cylinder pistons has been developed. Such a piston is a kind of component that has a geometry that is dependent and determined of surrounding and interacting parts. The piston seal has a very strong influence on the piston geometry, and the kind of piston design rules that can be found in piston seal catalogues have been used in the developed computer programs. The design procedure is divided in two parts. In the piston family design part, a piston family product model, which is common for a group of pistons with different dimensions but uses the same seal cross section, is created and stored in a piston family product model data base. In the member design part the piston family data is retrieved, dimension determining parameters are given, and one particular piston of a certain size is created and presented. The software system needed in order to be able to apply the suggested procedure consists of - a CAD-system, containing a graphic application program language - a specific CAD-system dependent interface program written in the graphic application program language - two CAD-system independent interface programs written in a common high level language lite FORTRAN - CAD-system independent product model data bases All these programs except the CAD-system have been developed in this work, and the use of the programs is demonstrated with an example.

APA, Harvard, Vancouver, ISO, and other styles

2

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

3

Johannesson, H. L. "System Independent Product Models in Computer Aided Elastomeric Compact Seal Design." In ASME 1988 Design Technology Conferences. American Society of Mechanical Engineers, 1988. http://dx.doi.org/10.1115/detc1988-0003.

Full text

Abstract:

Abstract In this work the problem of designing a CAD-system independent product model data base, to be used in computer aided elastomeric seal design, is treated. It is shown how a general purpose turn-key CAD-system can be used together with an external product model data base and external calculation programs. The importance of storing product information in a CAD-system independent data base instead of on drawings in one particular CAD-system is pointed out. This is of special interest from long time storage point of view, as product related information is expected to live longer in a manufacturing company than one particular CAD-system. In order to be able to transmit data between the CAD-system and the external product model data base, and between the data base and the external calculation programs, special interfaces must be designed. Here it is demonstrated how such interface programs can be designed using FORTRAN 77 and a particular graphic application program language available in the CAD-system CDM 300. For the creation of the data base and for the data storage and data retrieval, the data base management system TORNADO is used. Finally the simultaneous use of the CAD-system, the external data base and the calculation program, when designing an elastomeric seal cross section, is demonstrated with a test example.

APA, Harvard, Vancouver, ISO, and other styles

4

Ariamaharani, Andhika, Subyantoro Subyantoro, and U’um Qomariyah. "Development of Computer-Based BIPA Learning Evaluation Tools." In Proceedings of the 2nd Konferensi BIPA Tahunan by Postgraduate Program of Javanese Literature and Language Education in Collaboration with Association of Indonesian Language and Literature Lecturers, KEBIPAAN, 9 November, 2019, Surakarta, Central Java, Indonesia. EAI, 2020. http://dx.doi.org/10.4108/eai.9-11-2019.2294955.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Omar, Hossin. "Interactive Computer Aided Preliminary Design of Shell and Tube Heat Exchangers." In ASME 2010 Power Conference. ASMEDC, 2010. http://dx.doi.org/10.1115/power2010-27011.

Full text

Abstract:

The objective of this work is to develop an interactive computer aided preliminary design program for shell and tube heat exchanger based on the Bell (Delaware) method with internal evaluation of all required physical properties utilizing the best methods in the open literature known for their accuracy and reliability. FORTRAN90 is the program language used in this work. All mechanical and geometrical required data are internally evaluated. This program will be used to study the performance of Bell (Delaware) method by comparing the results obtained via this program with experimental data from industry. Cost estimates are to be generated by the program for all components, using very well known cost estimate techniques. Finally, the developed program was tested for accuracy and consistency against existing design cases from industry. The program was tested with other six experimental samples, and it was found that the program work accurately and the percentage of error in most parameters are in the allowable.

APA, Harvard, Vancouver, ISO, and other styles

6

Alabbad, Abbad M. "Interactive computer/network-based program for teaching English as a foreign language in the elementary levels in Saudi Arabia." In 2011 International Conference on Multimedia Computing and Systems (ICMCS). IEEE, 2011. http://dx.doi.org/10.1109/icmcs.2011.5945699.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Zhao, M., and N. Tailor. "Development of a Test Facility and Its Application for Validation and Reliability Testing of Safety-Critical Software." In 18th International Conference on Nuclear Engineering. ASMEDC, 2010. http://dx.doi.org/10.1115/icone18-29958.

Full text

Abstract:

This paper describes a versatile test facility developed by AECL for validation and reliability (V&R) testing of safety-critical software used in the process trip computers for CANDU reactors. It describes the hardware and software aspects of the test facility. The test hardware consists of a test rig with a test computer used for executing the test software and a process trip computer emulator. The test software is comprised of an operating system, a test interpreter, a test oracle, and a man-machine interface. This paper also discusses the application of the test facility in V&R testing of the process trip computer, how test scripts are prepared and automatically run on the test computer, and how test results are automatically generated by the test computer, thus eliminating potential human errors. The test scripts, which contain specific instructions for testing, are text files written in a special AECL test language. An AECL Test Language Interpreter (ATLIN) program interprets the test scripts and translates structured English statements in the test scripts into test actions. The intuitive nature of the special AECL test language, the version controlled test scripts in text format and automatic test logging feature facilitate the preparation of test cases, which are easy to repeat, review and readily modifiable, and production of consistent results. This paper presents the concept of adding a process trip computer emulator for use in preparation of V&R testing. The process trip computer emulator is designed independently from the actual process trip computer but based on the same functional specification as for the process trip computer. The use of the process trip computer emulator allows the test scripts to be exercised before the actual process trip computers are available for V&R testing, thereby, resulting in a significant improvement to the project schedule. The test facility, with the built-in process trip computer emulator, is also a valuable training tool for the V&R staff and plant personnel.

APA, Harvard, Vancouver, ISO, and other styles

8

Van Katwyk, Kirk, and Harry H. Cheng. "Xlinkage: A Web-Based Analysis and Simulation Tool for Planar Mechanical Systems." In ASME 1997 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1997. http://dx.doi.org/10.1115/detc97/dac-3863.

Full text

Abstract:

Abstract Web-based network computing is fundamentally different from domain-based computing. Web-based network computing is accomplished through execution of a collection of small programs across different computer platforms on a network. Most tools currently used for analysis and simulation of mechanical systems, such as ADAMS and I-DEAS, are developed for domain specific applications. These programs are very large with significant initialization overhead and a complicated user interface. They are, therefore, not suitable for analysis of mechanical systems through the World Wide Web. In this paper, a new Web-based paradigm for analysis and simulation of mechanical systems will be presented. Web-based analysis of mechanical systems is not optimally achieved through large programs. Instead, it is accomplished through a collection of small utilities executed on different computers across a network. These small utilities are developed using the CH language environment, a superset of C for network computing. Using a Web browser, small programs can be generated by a Web server on the fly and downloaded through the network, and executed on a local client machine. The details about the implementation of the Xlinkage program for Web-based analysis and simulation of planar mechanical systems as well as its integration with analysis utilities and the WWW will be described in this paper. Because of its modular nature, our Web-based system is simple to use and maintain. It is especially suitable for distance learning. The system has been used as a teaching and learning tool at the University of California, Davis. Mechanism design utilities and the Xlinkage program are available for downloading on the WWW at the URL address http://iel.ucdavis.edu/design/.

APA, Harvard, Vancouver, ISO, and other styles

9

Pannu, Jat, Xudong Hu, and Harry H. Cheng. "Retrofitting Industrial Manipulators for Study of Open Architecture Integration of Mechatronic Systems." In ASME 1998 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1998. http://dx.doi.org/10.1115/detc98/cie-5533.

Full text

Abstract:

Abstract We have developed a plug-and-play open architecture CH language environment for integration of mechatronic systems for network-based agile manufacturing (Cheng, 1993). For experimental verification of this language environment in real-time applications, the original controllers of two popular industrial robot manipulators Puma 560 and IBM 7575 have been completely retrofitted and integrated with a conveyer system to form a robot workcell. This robot workcell, bypassing their original controllers, can be programmed to run under the CH language environment. Details about retrofitting these two industrial manipulators with new servo control boards, A/D boards, and I/O boards running the CH language environment under a commercial real-time operating system will be described. The CH language environment is designed for open architecture integration of mechatronic systems. The user application program written in CH is computer platform independent, mechatronic device independent, and mechatronic system independent. A sample CH application program for simulated assembly operations of this robot workcell will be presented to demonstrate the underlying principles of open architecture integration of mechatronic systems under the programming paradigm of the CH language environment.

APA, Harvard, Vancouver, ISO, and other styles

10

Ward, A. C., and W. P. Seering. "Quantitative Inference in a Mechanical Design “Compiler”." In ASME 1989 Design Technical Conferences. American Society of Mechanical Engineers, 1989. http://dx.doi.org/10.1115/detc1989-0011.

Full text

Abstract:

Abstract This paper introduces the theory underlying a computer program that takes as input a schematic of a mechanical or hydraulic power transmission system, plus specifications and a utility function, and returns catalog numbers from predefined catalogs for the optimal selection of components implementing the design. Unlike programs for designing single components or systems, this program provides the designer with a high level “language“ in which to compose new designs. It then performs much of the detailed design process. The process of “compilation”, or transformation from a high to a low level description, is based on a formalization of quantitative inferences about hierarchically organized sets of artifacts and operating conditions. This allows design compilation without the exhaustive enumeration of alternatives. The paper introduces the formalism, illustrating its use with examples. It then outlines some differences from previous work, and summarizes early tests and conclusions.

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!