Filters








31,089 Hits in 4.0 sec

Page 250 of Behavior Research Methods Vol. 2, Issue 5 [page]

1970 Behavior Research Methods  
Button 1 would connect only Contact I, Button 2 only Contact 2, Button 3 only Contacts 1 and 2, and so forth, for as many contacts as are available).  ...  vr0Z4 ootf AC With Button Codt (BUTTIN) Tufn on Li 9 M« iDISPLYI Cioat Button Coat Buttff (6UTBCR) Device Seiectot WI03 IFItp Flop R204 R204 [Fhp Fto^ R204 iFlip Flop I R204 I Citor Button Stnst 1 Buffer  ... 

Using functor categories to generate intermediate code

John C. Reynolds
1995 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95  
where they describe the translation of (nonrecursive) procedures into open or "inline" code.  ...  It is important to distinguish these concepts for two reasons: As we have already seen, a procedure may be implemented by inline expansion rather than by a subroutine, and on the other hand, because of  ... 
doi:10.1145/199448.199452 dblp:conf/popl/Reynolds95 fatcat:acyvtuixljgilapkllefe5mq64

The program for the transformation of atomic state functions from LS- to jj-coupled basis [article]

Tomas Zalandauskas, Gediminas Gaigalas
2004 arXiv   pre-print
The program is a part of the coupling optimization package Laris and allows to transform the multiconfigurational expansions with the arbitrary number of open shells (including f-electrons) and to identify  ...  The first one lsjj form csf basis jj fill occupations() is meant for the definition of the number of jj-coupled shells (and occupation numbers − N i , + N i ) for the given LS coupled shell l Ni i .  ...  = l i and + κ i = −l i − 1.  ... 
arXiv:physics/0405061v1 fatcat:4qkxs6ocxbhtfeyx6ej5jeklpq

Page 23 of Journal of Research and Practice in Information Technology Vol. 6, Issue 1 [page]

1974 Journal of Research and Practice in Information Technology  
The checking process varies consider- ably from one question to another, the most common procedure being comparison of an array with the cor- rect version.  ...  IS 8 NUMBER OF LOOPS ( 8) IS NOT CORRECT = THE ANSWER IS lo m OPEN PATHS ARE INCORRECT = THE CORRECT ONES ARE = a: 2 Sa 0» 6 0 — tt tet et ee Scoceccan 7 7 8 = 5 7 7 Ss) 1 SUBROUTINE ( CHECKED Figure  ... 

Development and Numerical Implementation of a Modified Mixed-Mode Traction–Separation Law for the Simulation of Interlaminar Fracture of Co-Consolidated Thermoplastic Laminates Considering the Effect of Fiber Bridging

Ioannis Sioutis, Konstantinos Tserpes
2022 Materials  
Initially, the data from mode I (DCB) and mode II (ENF) fracture toughness tests were used to construct the R-curves of the joints in the opening and sliding directions.  ...  The constructed curves were incorporated into the numerical models employing a user-defined material subroutine developed in the LS-Dyna finite element (FE) code.  ...  ini σ b,I = 0.389 mm (10) Following the same procedure for mode II loading, δ 0,I I , δ b,I I and δ f ,I I could be calculated as 0.004 mm, 0.049 mm, and 0.182 mm, respectively.  ... 
doi:10.3390/ma15155108 pmid:35897540 pmcid:PMC9329915 fatcat:3s3k3tnsa5h65acahmbkeor3vi

Page 80 of Communications of the Association for Computing Machinery Vol. 3, Issue 2 [page]

1960 Communications of the Association for Computing Machinery  
In the case of open subroutines, these functions are taken over by the translator.  ...  Function and array declarations lead to static subroutines, procedure declara- tions permit dynamic routines.  ... 

Eye-movement data: Cumulative fixation time and cluster analysis

C. R. Latimer
1988 Behavoir research methods, instruments & computers  
Cluster analyses such as k means  ...  This paper describes procedures for the visual presentation and cluster analysis of eye-movement data.  ...  One classification procedure <Wallace & Boulton, 1968a Boulton, , 1968b , based on information theory, avoids these initial assumptions.  ... 
doi:10.3758/bf03202698 fatcat:flkxhkzunnbz3cjpbm5wtnhp34

Efficient computation of the genomic relationship matrix and other matrices used in single-step evaluation

I. Aguilar, I. Misztal, A. Legarra, S. Tsuruta
2011 Journal of Animal Breeding and Genetics  
Optimizations were by modification of the code into simple and easy to optimize tasks by some compilers, by using existing subroutines with efficient automatic optimization provided as open source, or  ...  Optimized BLAS subroutines were developed by Whaley & Dongarra (1998) , and an open source of these libraries is available as Automatically Tuned Linear Algebra Software (ATLAS; http://math-atlas. sourceforge.net  ... 
doi:10.1111/j.1439-0388.2010.00912.x pmid:22059575 fatcat:jx5awzxbzracbajj7ftp45l27i

Page 208 of Behavior Research Methods Vol. 4, Issue 4 [page]

1972 Behavior Research Methods  
PROSS I/O statements contain one or more words, separated by blanks, commas, or parentheses.  ...  The resulting macro call is then expanded by the assembler into either the appropriate subroutine call or into the actual code necessary to control the I/O operation.  ... 

Analyzing and compressing assembly code

Christopher W. Fraser, Eugene W. Myers, Alan L. Wendt
1984 Proceedings of the 1984 SIGPLAN symposium on Compiler construction - SIGPLAN '84  
The system is retargetable and generalizes cross-jumping and procedural abstraction.  ...  It can be used as a space optimizer that trades time for space, it can turn assembly code into interpretive code, and it can help formalize and automate the traditionally ad hoe design of both real and  ...  If the entry sequence is empty, one subroutine may fall into another, as in Section l's procedural abstraction example. Repeated open fragments are replaced with a simple branch.  ... 
doi:10.1145/502874.502886 dblp:conf/sigplan/FraserMW84 fatcat:y2zfec36g5cqhfysht5i5bggcu

Analyzing and compressing assembly code

Christopher W. Fraser, Eugene W. Myers, Alan L. Wendt
1984 SIGPLAN notices  
The system is retargetable and generalizes cross-jumping and procedural abstraction.  ...  It can be used as a space optimizer that trades time for space, it can turn assembly code into interpretive code, and it can help formalize and automate the traditionally ad hoe design of both real and  ...  If the entry sequence is empty, one subroutine may fall into another, as in Section l's procedural abstraction example. Repeated open fragments are replaced with a simple branch.  ... 
doi:10.1145/502949.502886 fatcat:d4x3geh2cjf4jaaqagefcizo74

Page 19 of Communications of the Association for Computing Machinery Vol. 2, Issue 2 [page]

1959 Communications of the Association for Computing Machinery  
Owing to the fact that compilation of an open subroutine into the main body of an object program is an essentially ad hoc procedure—depending, as it does, on the particu- lar nature of the function in  ...  (i) S; defines an open subroutine, viz., WV; is the name of an integer constant less than 7. The same remarks apply here as for (D) (iv) (q.v.). (ii) S; defines a closed subroutine.  ... 

SKED program for a modified sternberg procedure

Robert D. Dingler, E. H. Uhlenhuth, Martin Stern
1975 Behavior Research Methods  
Specifically, F3s have been developed that (I) open input files and read data from these files; (2) do various plotting functions for the CRT; and (3) calculate winnings that are then displayed on the  ...  Since all of the subroutines are located in Field I, all F3s first branch to a common location in Field O.  ... 
doi:10.3758/bf03201337 fatcat:b3et33zik5blpes5xaxmzcf3ou

An Atlas Autocode to ALGOL 60 Translator

A. T. McEwan
1967 Computer journal  
Counts are initiated on entry to the routines dealing with the delimiter words begin, routine and fn. These counts keep track of all blocks opened and closed.  ...  Nevertheless, the translator has still proved a sound investment, as users may translate their Atlas Autocode programs or subroutines for subsequent use as, or in, ALGOL programs, and take advantage of  ... 
doi:10.1093/comjnl/9.4.353 fatcat:smmxkdfjfzbutjx2vwy3dehxg4

Efficient and effective heuristics for the coordinated capacitated lot-size problem

Arunachalam Narayanan, Powell Robinson
2010 European Journal of Operational Research  
The heuristics are strong candidates for application as stand alone solvers or as an upper bounding procedure within an optimization based algorithm.  ...  The procedures are currently being tested as a solver in the procurement software suite of a nationally recognized procurement software provider.  ...  The final difference is the cost savings calculation in subroutine I where there is no need for either item or family savings adjustment (as described in the Appendix: step 2 of subroutine I) in the TPH  ... 
doi:10.1016/j.ejor.2009.08.015 fatcat:wxv3a4dldrhynba3acvoxjseuu
« Previous Showing results 1 — 15 out of 31,089 results