String Handling Research Articles

Heat flux estimation from borehole temperatures acquired during logging while tripping: a case study with the sea floor drill rig MARUM-MeBo

During trip out of the drill string at the end of a drilling operation (logging while tripping) borehole temperatures can be measured without the need for additional operational time. A simple interpretation of the measured borehole temperatures is difficult due to the interfering influences of the drilling operations, mainly due to flushing the borehole during drilling. In this study, we present borehole temperature data from drilling campaigns with the sea floor drill rig MARUM-MeBo200 at the Danube Deep Sea Fan (Black Sea) and west of Taiwan (South China Sea). The temperature measurements were conducted with a PT1000 temperature sensor which is integrated in a memory acoustic borehole logging tool. We developed a modeling approach in order to simulate the drilling perturbations and subsequent evolution of the temperature field within the borehole. By fitting the model data to the measured time dependent temperature depth profiles, we estimated the undisturbed heat flux at the drill sites. This study shows that knowledge of the pattern of drilling operations with alternating phases of drilling/flushing and drill string handling is crucial for comparing temperatures measured during logging while tripping and simulated temperatures.

Laparoscopic skills training – novel methods

Simulation for skill training has a long history in surgery. Initially, surgeons practiced on animals or human cadavers, which is costly and raises ethical questions. Emerging hygienic requirements lead to the development of "artificial" phantoms, on which suturing, anastomoses and other elements of the procedure could be practiced on. Similarly, in minimal invasive surgery surgeons need extensive practice to learn the correct techniques, and to acquire sufficient skills. Laparoscopy requires specific training devices, ranging from animal models to virtual reality simulators. This work focused on physical simulators, development of affordable phantoms and adjoin tasks for a personal laparoscopic training box. Authors described five new tasks that were added to the classical curriculum. The tasks included leading the line, ligation, preparation-ligation, leading a string and camera handling. Data was were derived from a trial with 30 participants. They were categorized into 3 groups: laymen, general practitioner residents (non-surgeons) and surgery residents. Subjective assessment of the new tasks was performed using a 20-points questionnaire (NASA Task Load Index). Participants were asked about the usefulness, mental, physical, temporal demand, performance, effort and frustration. Accomplishment time was also recorded for each task (as well as the number or errors, where applicable). In addition, 10 consecutive task execution sessions were recorded, and in some cases, users' performance was tracked over a follow-up period of several days. Participants considered the tasks suitable and relevant for education, and also approved them for self-education purposes. The three groups showed statistically significant differences in performance, based on their average completion time. The follow-up studies showed continuous progress in the completion of individual tasks.

Test data generation for web application using a UML class diagram with OCL constraints

In this paper, we report on our current work toward efficient and effective verification of web application's basic design. We use a UML class diagram with Object Constraint Language (OCL) to describe the application behaviors and data constraints. Then we generate test data from the formally represented specifications. We make the observation that key web application behaviors can be captured through table size constraints as well as data constraints like foreign key constraints. Based on the observation, we translate the OCL specification into the equivalent constraints using table size expressions. We present a scheme to generate test data from the translated constraints using a Satisfiability Modulo Theories solver. We employ two techniques to reduce constraints. The first is string handling and the other is decomposition of table structures. We also report on an experimental result of test data generation. The result indicates a potential that our scheme works well for real applications in reasonable times.

Requirements for Security Enhancements to Legacy Software with RUP

ABSTRACT This article describes how to adapt a specific part of the Rational Unified Process (RUP) framework for the purpose of conducting requirements gathering for software projects aimed at adding security features to legacy software. The RUP seems particularly fitting for this purpose because it aggregates numerous software engineering terms into a common body of knowledge and strives to give them clear and unambiguous semantics. Furthermore, the RUP allows project coordinators to pick and choose only the process elements best suited to meet the particular needs of a project. The article should prove useful to project managers, process engineers, and software architects responsible for teaching old software new security functions. It should also prove useful to organizations that have already carried out basic software security projects such as those that fix buffer overflows, teach the software to perform better data validation, replace unsafe string handling functions, and recompile code with safe exception handling. This article covers only a small and very specific part of the RUP. It interprets the RUP in ways guided by the author's experience and specializes the Requirements discipline for use in projects tasked with adding new security features to legacy software.

Lead‐free on‐laminate laser soldering: a new module assembling concept

AbstractWe demonstrate lead‐free laser soldering of standard industrial solar cells. The laser‐soldered contacts stay stable for more than 240 accelerated ageing cycles by humidity–freeze test and withstand peel forces in excess of 10 N/cm. Laser soldering is demonstrated while the cells are lying on the ethylene vinyl acetate (EVA) foil. This permits to connect the solar cells to the lead‐free tinned copper ribbons directly on the lamination materials. We also demonstrate soldering on the bottom side by lasering through the glass and the non‐polymerized EVA. With the aid of a pick and place robot it thus becomes possible to avoid all string handling. On‐laminate laser soldering (OLLS) technique, which permits a high level of automation and process control, induces little thermal and mechanical stress, reduces the handling and should thus be of particular advantage for assembling modules with very thin cells at a high yield. Copyright © 2007 John Wiley & Sons, Ltd.

A simple computational model for acceptance/rejection of binary sequence generators

A simple binary model to compute the degree of balancedness in the output sequence of LFSR-combinational generators has been developed. The computational method is based exclusively on the handling of binary strings by means of logic operations. The proposed model can serve as a deterministic alternative to existing probabilistic methods for checking balancedness in binary sequence generators. The procedure here described can be devised as a first selective criterium for acceptance/rejection of this type of generators.

Embedding a Tcl web server into APL

Tcl stands for Tool Command Language. It is a script language, but unlike the well-known perl, it is also an extensible interpreter that is designed to be easily embedded into other applications. The Tcl source code is available from the Internet and the package can be used freely even in commercial applications. In addition to its condensed notation and simple syntax, APL's strength is its powerful array handling capacity. Tcl is based on string handling and very strong on gluing different pieces of software together. It is especially the many available Tcl extensions for GUI, network, database, HTML and XML support, which make the combination of APL and Tcl very attractive.With the implementation of a few new APL system commands into the APL2C system, it is possible to create one or several Tcl interpreters from within APL. As each of the Tcl interpreters runs on its own thread, a synchronization mechanism is provided for the communication between APL and Tcl. As an example, a Tcl web server with an APL backbone has been realized to demonstrate the power of the combination between APL and Tcl.

Aliasing, syntax, and string handling in Fortran and in C

No abstract available.

ICON programming for humanists By Alan D. Corre (review)

648 LANGUAGE. VOLUME 67, NUMBER 3 (1991) This diversity is evident in the papers of the four plenary speakers. Roger W. Andersen ( 1 24 ) examines the use of verbal inflections, in context, to consider 'what makes it possible for native speakers of a language to convey complex expressive messages quickly and easily to accomplish their purposes in verbal interaction' (2). Rod Ellis's topic (25-60) is the use ofmetalinguistic judgments in second-language research ; he concludes that the reliability of grammaticality-judgment tasks in such research is 'circumspect'. Henning Wode (85-116) questions 'the prevailing assumption' that there is a 'discontinuity' between first-language acquisition and adult second-language acquisition, and proposes a 'continuity' view of language acquisition abilities. Perhaps the most useful paper for not only understanding second-language acquisition but also applying that knowledge to improve second -language teaching is T. Givón's (61-84). Givón's argument is that the natural order of both first- and second-language acquisition involves , first, acquisition of the lexicon (in a 'nongrammatical pidgin mode') and then acquisition of grammar (in a 'grammatical communication mode'). At the outset of language learning, neither word recognition nor grammar use is a habituated task, and both require attention . Only after vocabulary recognition becomes automatic can the learner be free to focus his/her attention on grammar. Givón proposes experiments to test his hypotheses about the 'cognitive basis for acquisition order', 'the efficiency of structured language learning', and 'vocabulary size and grammar-lexicon competition ', and he distinguishes his approach from 'communicative', 'immersion', and 'lexicalpidgin ' approaches. Those with special interests in second-language acquisition are likely to find among these 36 papers at least two or three that address their interests. All in all, these volumes provide, as Burmeister & Rounds claim, 'an up-to-date representation of the relevant issues and current state of affairs in L2 acquisition research' (iii). [Timothy J. Riney. International Christian University.] ICON programming for humanists. By Alan D. Corre. Englewood Cliffs, N.J.: Prentice-Hall, 1990. Pp. xiv, 157. Some linguists will remember SNOBOL, a language with unusual facilities for character manipulation and pattern matching in which considerable linguistic programming was done, especially in the 1960s and early 1970s. Aside from these special features, SNOBOL is a very primitive language, especially in its low-level control structures. ICON is a modern descendant of SNOBOL, syntactically not unlike C and Pascal, designed and implemented by a research group at the University of Arizona led by Ralph Griswold, one of the creators of SNOBOL . ICON has been implemented for a wide variety of machines and operating systems and is distributed electronically at no charge and by mail at cost. ICON'S easy string handling, pattern matching , and mapping facilities make it useful for searching for information in a corpus, translating one representation into another, and constructing word lists, reverse dictionaries, and concordances. These, combined with its automatic storage allocation and rich data structures (lists, queues, stacks, records, and tables), which make it easy to represent graphs (of which the trees and feature structures used in linguistics are special cases), make it very suitable for parsing and morphological analysis. An especially useful feature is the fact that arbitrary values, not just integers, may be used to index into tables. Thus, a word-counting program could increment the count of the word the by this statement: words ["the"] + : = 1 . Corré's book provides an introduction to ICON suitable for those with little or no background in programming. It presupposes very little , explaining such things as how to use the EDLIN and EMACS text editors and how to execute programs once they are written, as well as basic programming techniques. It is very clearly written, with a variety of simple examples . The reader who completes this book should be able to write simple ICON programs and will have a basic knowledge of ICON' s pattern matching facilities. Two factors render the book incomplete as a textbook of ICON for linguists. First, the applications illustrated are almost all concerned with the computation oftext statistics (e.g. computing the standard deviation of the lengths of sentences in a text, or correlating the frequencies of words...

A better way to combine efficient string length encoding and zero-termination

In this note we describe conventions for string handling, and in particular for efficient string length encoding. These conventions are based on the (C-language) zero--terminator convention, and assume that the size of the area containing the string is known. They do not require any special provisions on the part of the language implementation. The mechanism to be described caters smoothly for strings of arbitrary length. The notes are based on several years of experience within the framework of Modular Pascal.

Some sad remarks about string handling in C

Many people have criticized the C programming language for its failure to enforce discipline in programming. They cite the lack of typechecking and the locutions that expose and indeed emphasize the underlying machine model. C is less often criticized for lack of efficiency. Yet in a critical part of the language -- string handling -- the efficiency of C falls short of the mark.String handling is a major application of C. In the original C book by Kernighan and Ritchie, nearly every example has something to do with strings. In systems programming, another major application, string handling is a large part of the task. If a skillful C programmer cannot easily write programs that manipulate strings efficiently, then the language has failed to meet one of its central goals.There are two problems with strings in C. The first is the use of a representation for strings in which a terminating null character indicates the length of the string. The second is the lack of built-in operations on strings analogous to the ones provided for arithmetic data.

String pattern-matching in Prolog

A pattern-matching feature for the Prolog language is described. Through the use of patterns, introduced as Prolog predicates, the feature favors the specification of string handling algorithms in a declarative style. A number of convenient pre-defined patterns, adapted from SNOBOL 4, are included. The use of two-level grammars as a paradigm for developing Prolog programs incorporating the pattern-matching feature is also discussed.

Numerical Turing

Numerical Turing is an extension of the Turing programming language. Turing is a Pascal-like language (with convenient string handling, dynamic arrays, modules and more general parameter lists) developed at the University of Toronto [4]. Turing has been in use since May, 1983, and is now available on several machines.

XPL

XPL

MUMPS implementations on microprocessors.

Microprocessors are becoming increasingly important in the solution of many problems within the medical information field. They are suitable for use in controlling such processes as data entry and verification, stand-alone Computer Assisted Instruction, generation and testing of basic code, and as entry points to larger communication networks with shared data-bases. Because of their potential and versatility, it is desirable to implement on these microprocessors the same language that is to be used on larger members of a full scale medical information system. MUMPS is ideally suited to this environment, having been designed in such a way that it can be run on microprocessors without degradation of its string handling and file management characteristics.Our implementation approach was to adopt a machine-independent technique, using the Transition Diagram Language in which Standard MUMPS has been defined. A high level (ALGOL) driver was written for the Tdl, in which the initial output was assembly code for ...

String manipulation with extended Euler

WITH MANY of the general programming languages available today inadequate in their string handling capabilities, users who wish to process text have to resort to unnatural extensions to languages such as FORTRAN and ALGOL 60, in which string manipulation is often provided by subroutines or procedures from a library. There are, of course, languages specifically designed to meet the needs of those who wish to pursue non-numeric programming activities languages such as SNOBOL IV [1] and SNAP [2] but these may either fall short on numerical or structural capabilities, or not be implemented on the user's machine. Some languages, designed for interactive use, such as SCAN [3], are usually machine dependent. A few more recent languages, such as ALGOL W [4] and ALGOL68 [5], although they have good string manipulative capabilities built into them, are not always available to some sections of the community (ALGOL W is orientated to IBM 360/370 machines, ALGOL 68 has not yet become readily available on many ranges of computers). The general programming language EULER [6], proposed as a successor to ALGOL 60, had many of the characteristics of that language. It also had many new features that need to be described in more detail. The language 'is a block structured language, where a block contains declarations and statements enclosed within begin and end. The essential difference between blocks in EULER and blocks in ALGOL 60 is that EULER blocks, which can return a usable value, can be a valid constituent of an expression, for the value of the block is the result of the last expression evaluated before leaving the block.

String handling in ALGOL

DASH is designed to allow a user to handle strings and perform efficient arithmetic in the same language. There are a number of languages designed to handle strings (Farber, Griswold and Polonsky, 1964 and 1966; Guzman and Mclntyre 1966), but their arithmetic facilities are slight. On the other hand, on many computers the only general purpose languages at present implemented (e.g. ALGOL 60, FORTRAN) are almost purely arithmetic. This hampers both users and those whose job is computer science education. The procedures to be described aim to provide string processing of the SNOBOL type (Farber et al, 1966) to the extent that is reasonably possible within ALGOL. The description is informal, and some details are omitted for brevity. The reader will benefit from a knowledge of SNOBOL, though it is hoped an understanding can be gained without this knowledge. The superimposition of procedures of this type on ALGOL will be rendered easier and more natural with a facility such as the proposed record handling of Wirth and Hoare (1966).