Search

There are now several comprehensive web applications, stand-alone computer programs and computer algebra functions that, given a floating point number such as 6.518670730718491, can return concise nonfloat constants such as 3 arctan 2 + ln 9 + 1 that closely approximate the float. Examples include AskConstants, Inverse Symbolic Calculator, the Maple identify function, MESearch, OEIS, Ordner, RIES, and WolframAlpha. Usefully often such a result is the exact limit as the float is computed with increasing precision, which is rather like unscrambling an egg. Therefore these program results are candidates for proving an exact result that you could not conjecture without the program. Moreover, candidates that are not the exact limit can be provable bounds, or convey qualitative insight, or suggest series that they truncate, or provide sufficiently close efficient approximations for subsequent computation. This article describes some of these programs, how they work, and how best to use each of them. Almost everyone who uses or should use mathematical software can benefit from acquaintance with several such programs, because these programs differ in the sets of constants that they can return. [ABSTRACT FROM AUTHOR]

Copyright of RGO: Revista Gaúcha de Odontologia is the property of RGO: Revista Gaucha de Odontologia and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Relational program verification is a variant of program verification where one can reason about two programs and as a special case about two executions of a single program on different inputs. Relational program verification can be used for reasoning about a broad range of properties, including equivalence and refinement, and specialized notions such as continuity, information flow security, or relative cost. In a higher-order setting, relational program verification can be achieved using relational refinement type systems, a form of refinement types where assertions have a relational interpretation. Relational refinement type systems excel at relating structurally equivalent terms but provide limited support for relating terms with very different structures. We present a logic, called relational higher-order logic (RHOL), for proving relational properties of a simply typed λ-calculus with inductive types and recursive definitions. RHOL retains the type-directed flavor of relational refinement type systems but achieves greater expressivity through rules which simultaneously reason about the two terms as well as rules which only contemplate one of the two terms. We show that RHOL has strong foundations, by proving an equivalence with higher-order logic, and leverage this equivalence to derive key meta-theoretical properties: subject reduction, admissibility of a transitivity rule, and set-theoretical soundness. Moreover, we define sound embeddings for several existing relational type systems such as relational refinement types and type systems for dependency analysis and relative cost, and we verify examples that were out of reach of prior work. [ABSTRACT FROM AUTHOR]

Summary: There is a strong prejudice against the friendship access control mechanism in C++. People claim that friendship breaks the encapsulation, reflects bad design, and creates too strong coupling. However, friends appear even in the most carefully designed systems, and if it is used judiciously (like using the attorney‐client idiom), they may be better choice than widening the public interface of the class. In this paper, we investigate how the friendship mechanism is used in C++ programs. We have made measurements on several open source projects to understand the current use of friends. Our results show various holes and errors in friend usage, like friend functions accessing only public members or not accessing members at all or the class, which declare friends has no private members at all. The results also show that friend functions actually use only a low percentage of the private members they were granted to access, which is a source of errors. These results have motivated us to propose a selective friend language construct for C++, which can restrict friendship only to well‐defined members. Such a new language element may decrease the degradation of encapsulation and significantly increase the diagnostic capacity of the compiler. We have created a proof‐of‐concept implementation based on the LLVM/Clang compiler infrastructure to show that such constructs can be established with a minimal syntactical and compilation overhead. [ABSTRACT FROM AUTHOR]

We consider the NP-hard m - parallel two-stage flowshop problem, abbreviated as the ( m , 2 ) -PFS problem, where we need to schedule n jobs to m parallel identical two-stage flowshops in order to minimize the makespan, i.e. the maximum completion time of all the jobs on the m flowshops. The ( m , 2 ) -PFS problem can be decomposed into two subproblems: to assign the n jobs to the m parallel flowshops, and for each flowshop to schedule the jobs assigned to the flowshop. We first present a pseudo-polynomial time dynamic programming algorithm to solve the ( m , 2 ) -PFS problem optimally, for any fixed m , based on an earlier idea for solving the ( 2 , 2 ) -PFS problem. Using the dynamic programming algorithm as a subroutine, we design a fully polynomial-time approximation scheme (FPTAS) for the ( m , 2 ) -PFS problem. [ABSTRACT FROM AUTHOR]

We propose a new type system for functional logic programming which is more liberal than the classical Damas–Milner usually adopted, but it is also restrictive enough to ensure type soundness. Starting from Damas–Milner typing of expressions, we propose a new notion of well-typed program that adds support for type-indexed functions, a particular form of existential types, opaque higher-order patterns and generic functions – as shown by an extensive collection of examples that illustrate the possibilities of our proposal. In the negative side, the types of functions must be declared, and therefore types are checked but not inferred. Another consequence is that parametricity is lost, although the impact of this flaw is limited as ‘free theorems’ were already compromised in functional logic programming because of non-determinism. [ABSTRACT FROM PUBLISHER]

Software maintainers use the traces of field failures to understand and diagnose faulty functions that cause the system to fail. Despite their usefulness, traces from the field can be quite overwhelming, especially for software systems with a vast client base. In the execution of realistic applications, many of them being millions of lines of code, there are just too many traces that are generated. In addition, traces are known to be extraordinarily large, which further complicates matters. Fortunately, not all field failures are caused by new faults. In fact, previous studies showed that 50% to 90% of field failures are due to previously known faults. In this paper, we propose a machine learning approach that automatically detects recurring faulty functions in the traces of new field failures. We achieve our goal by training decision trees on earlier resolved traces of system failures from the current and prior releases of the system. When applied to a large industrial system with 20 million lines of code and 200,000 functions, our approach was able to detect recurring faulty functions in the traces of field failures with an accuracy of 90%, to even 97% in some cases. [ABSTRACT FROM PUBLISHER]

The long, complex documents that medical writers often work with can place unusual demands on a word processing program. Microsoft Word® is a powerful program, but that does not mean using it properly is always easy or intuitive. Many problems that writers encounter are the result of not knowing exactly how Word works, what unintended effects its options may have, or the best practices for performing certain writing and editing tasks. This article explains some of Word's more troublesome quirks and shows you how to avoid them. [ABSTRACT FROM AUTHOR]

The long, complex documents that medical writers often work with can place unusual demands on a word processing program. Microsoft Word® is a powerful program, but that does not mean using it properly is always easy or intuitive. Many problems that writers encounter are the result of not knowing exactly how Word works, what unintended effects its options may have, or the best practices for performing certain writing and editing tasks. This article explains some of Word's more troublesome quirks and shows you how to avoid them. [ABSTRACT FROM AUTHOR]

The long, complex documents that medical writers often work with can place unusual demands on a word processing program. Microsoft Word® is a powerful program, but that does not mean using it properly is always easy or intuitive. Many problems that writers encounter are the result of not knowing exactly how Word works, what unintended effects its options may have, or the best practices for performing certain writing and editing tasks. This article explains some of Word's more troublesome quirks and shows you how to avoid them. [ABSTRACT FROM AUTHOR]

Software to compute angular and radial Mathieu functions is provided in the case that the parameter q is a complex variable and the independent variable x is real. After an introduction on the notation and the definitions of Mathieu functions and their related properties, Fortran 90 subroutines to compute them are described and validated with some comparisons. A sample application is also provided. [ABSTRACT FROM AUTHOR]

Abstract: The detection of similarities in source code has applications not only in software re-engineering (to eliminate redundancies) but also in software plagiarism detection. This later can be a challenging problem since more or less extensive edits may have been performed on the original copy: insertion or removal of useless chunks of code, rewriting of expressions, transposition of code, inlining and outlining of functions, etc. In this paper, we propose a new similarity detection technique not only based on token sequence matching but also on the factorization of the function call graphs. The factorization process merges shared chunks (factors) of codes to cope, in particular, with inlining and outlining. The resulting call graph offers a view of the similarities with their nesting relations. It is useful to infer metrics quantifying similarity at a function level. [Copyright &y& Elsevier]

Highlights: [•] This paper presents an automatic and effective method to parallelize applications. [•] The KIR models the whole program handling syntactical variations in the source code. [•] Our technique builds a global OpenMP parallelization targeting multicore processors. [•] The benchmarks include linear algebra routines and applications from SPEC CPU2000. [•] The automatic parallelization of GCC, Intel and PLUTO compilers is evaluated. [ABSTRACT FROM AUTHOR]

The article offers information on the changes made in the computer program language R 3.0.1. It states that this new language has included many features in its different versions such as mcparallel which starts with R process has a new argument known as mc.interactive. It informs about the changes in R 3.0.0 which include a new argument that can be used when comparing functions.

Abstract: The aim of this work is to experimentally and numerically analyze the performance of a integrated power plant composed by a steam oxygen fluidized bed biomass gasifier fed by woods, a Solid Oxide Fuel Cell (SOFC) and a micro Gas Turbine (mGT). The numerical analysis is carried out by using ChemCAD software. In particular, SOFC and gasifier were modeled using proper developed Fortran subroutines interfaced to the basic software. The adopted SOFC model was already validated by the authors in previous works, while the gasifier model was here developed and validated by means of experimental activities carried out by using a bench scale gasifier. Different compounds (Benzene, Toluene, Naphthalene, Phenols) were chosen to analyze the tar evolution in the gaseous stream during the gasification process. Hot gas cleaning (based on catalytic ceramic filter candles inserted in the freeboard of the gasifier – UNIQUE concept) was adopted to remove tar and particulates from the fuel hot gas stream. Different moisture contents in the range between 10 and 30% (i.e. in a deviation of 10% around the usual wood moisture content of 20%) were numerically simulated as well as the degree of purity of the oxygen utilized in the power plant (between 25% and 95%, the rest being N2). The power requirement for pure oxygen production leads to a reduction of the electrical efficiency of the whole power plant. For this reason, a sensitivity analysis was conducted to find the optimal operation conditions in order to maximise the syngas (H2, CO) content in the produced gas, while maintaining a high overall electrical efficiency. [Copyright &y& Elsevier]

Abstract: This work describes an experiment about startle reflex and individual differences in personality with the application of the Presentation and AcqKnowledge software. First, Presentation was useful for the design of the display and timing of a set of pictures from the IAPS (International Affective Picture System) that modulated the elicitation of the startle reflex response to an acoustic stimulus. Second, the AcqKnowledge program allowed to record and store psychophysiological data, while a Java routine helped to transform the output data into a proper data disposition better suited to analyze individual differences. The software used in psychophysiological experiments is of an utmost importance concerning the design and presentation of stimuli, and to the general management of this type of information. In this work, we present an example of the use of two computer programs that are helpful for the research about the psychophysiological bases of individual differences in relation with human personality, even though they are extensible to other biomedical areas of interest. [Copyright &y& Elsevier]

Abstract: A potential-based cohesive zone model, so called the PPR model, is implemented in a commercial software, e.g. ABAQUS, as a user-defined element (UEL) subroutine. The intrinsic cohesive zone modeling approach is employed because it can be formulated within the standard finite element framework. The implementation procedure for a two-dimensional linear cohesive element and the algorithm for the PPR potential-based model are presented in-detail. The source code of the UEL subroutine is provided in for educational purposes. Three computational examples are investigated to verify the PPR model and its implementation. The computational results of the model agree well with the analytical solutions. [Copyright &y& Elsevier]

Abstract: This paper shows that the generalized finite element method with global–local enrichment functions (GFEMgl) can be implemented non-intrusively in existing closed-source FEM software as an add-on module. The GFEMgl is based on the solution of interdependent global (structural) and local (crack) scale problems. In the approach presented here, an initial global scale problem is solved by a commercial finite element analysis software, local problems containing 3-D fractures are solved by an hp-adaptive GFEM software and an enriched global scale problem is solved by a combination of the FEM and GFEM softwares. The interactions between the solvers are limited to the exchange of load and solution vectors and does not require the introduction of user subroutines to existing FEM software. As a results, the user can benefit from built-in features of available commercial grade FEM software while adding the benefits of the GFEM for this class of problems. Several three-dimensional fracture mechanics problems aimed at investigating the applicability and accuracy of the proposed two-solver methodology are presented. [Copyright &y& Elsevier]

Abstract: Abstract interpretation techniques are used to derive a control-flow analysis for a simple higher-order functional language. The analysis approximates the interprocedural control-flow of both function calls and returns in the presence of first-class functions and tail-call optimization. In addition to an abstract environment, the analysis computes for each expression an abstract call-stack, effectively approximating where function calls return. The analysis is systematically derived by abstract interpretation of the stack-based abstract machine of Flanagan et al. using a series of Galois connections. We prove that the analysis is equivalent to an analysis obtained by first transforming the program into continuation-passing style and then performing control flow analysis of the transformed program. We then show how the analysis induces an equivalent constraint-based formulation, thereby providing a rational reconstruction of a constraint-based CFA from abstract interpretation principles. [Copyright &y& Elsevier]

In an open distributed system, it is desirable to have dynamic selection of required services. Trading is a common ODP function that enables client (service consumers) to choose appropriate servers (service providers) at run time so that clients can be configured into an ODP system without prior knowledge of the server objects. An ODP-trader is an object that provides such a trading function. In this paper, we explore the benefits provided by using the proof construction approach to define ODP systems, focusing in particular in its application to develop an ODP common function - the ODP trader. [ABSTRACT FROM AUTHOR]

The article discusses research on the identification (comparison) possibilities and accuracy analysis of digital images applying the theory of covariation method. The digital images created by remote methods are processed in programming-packet operators environment applying Matlab 7 computer program. By using this program are compared in between two digital images, which interdependence is evaluated by calculated correlation coefficient values. With higher correlation coefficient absolute values dependence is higher and vice versa. That allows to estimate the two digital images or image of one of two parts (fragments) of the appropriate parameters the values of mutual deviation. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, we study the ratio of meromorphic -valent functions in the punctured disk of the form to its sequence of partial sums of the form . Also, we determine sharp lower bounds for and . [Copyright &y& Elsevier]

The high dimensional model representation (HDMR) method is a set of tools which can be used to construct a fully functional metamodel and to calculate variance based sensitivity indices very efficiently. Extensions to the existing set of random sampling (RS)-HDMR tools have been developed in order to make the method more applicable for complex models with a large number of input parameters as often appear in environmental modelling. The HDMR software described here combines the RS-HDMR tools and its extensions in one Matlab package equipped with a graphical user interface (GUI). This makes the HDMR method easily available for all interested users. The performance of the GUI–HDMR software has been tested in this paper using two analytical test models, the Ishigami function and the Sobol'' g-function. In both cases the model is highly non-linear, non-monotonic and has significant parameter interactions. The developed GUI–HDMR software copes very well with the test cases and sensitivity indices of first and second order could be calculated accurately with only low computational effort. The efficiency of the software has also been compared against other recently developed approaches and is shown to be competitive. GUI–HDMR can be applied to a wide range of applications in all fields, because in principle only one random or quasi-random set of input and output values is required to estimate all sensitivity indices up to second order. The size of the set of samples is however dependent on the problem and can be successively increased if additional accuracy is required. A brief description of its application within a range of modelling environments is given. [Copyright &y& Elsevier]

The wide variety of disasters and the large number of activities involved have resulted in the demand for separate Decision Support System (DSS) models to manage different requirements. The modular approach to model management is to provide a framework in which to focus multidisciplinary research and model integration. A broader view of our approach is to provide the flexibility to organize and adapt a tailored DSS model (or existing modular subroutines) according to the dynamic needs of a disaster. For this purpose, the existing modular subroutines of DSS models are selected and integrated to produce a dynamic integrated model focussed on a given disaster scenario. In order to facilitate the effective integration of these subroutines, it is necessary to select the appropriate modular subroutine beforehand. Therefore, subroutine selection is an important preliminary step towards model integration in developing Disaster Management Decision Support Systems (DMDSS). The ability to identify a modular subroutine for a problem is an important feature before performing model integration. Generally, decision support needs are combined, and encapsulate different requirements of decision-making in the disaster management area. Categorization of decision support needs can provide the basis for such model selection to facilitate effective and efficient decision-making in disaster management. Therefore, our focus in this paper is on developing a methodology to help identify subroutines from existing DSS models developed for disaster management on the basis of needs categorization. The problem of the formulation and execution of such modular subroutines are not addressed here. Since the focus is on the selection of the modular subroutines from the existing DMDSS models on basis of a proposed needs classification scheme. [ABSTRACT FROM AUTHOR]

The authors discuss Universal Multimedia Access (UMA), which promises to adaptively deliver multimedia content to users according to their needs. Central to UMA is the development of metadata standards for describing multimedia resources to allow their adaptation. The authors report on the development of the Bitstream Syntax Description Language (BSDL), which allows computers to perform operations on data without requiring specific software for every format they might encounter. The article describes applications for scalable content adaptation, format independent streaming, and delivery and configurable media coding.

The aim of the paper is to propose an improved procedure of damage material parameters identification of the Chaboche model, coupled with the concept of isotropic damage model proposed by AMAR and DUFAILLY [2] . The proposed approach has been implemented into subroutines of the FE MSC.Marc code, as the user's viscoplastic subroutine UVSCPL, and has been used to perform FE static and dynamic computations. The paper gives a brief description of the Chaboche model including damage. The results are also presented of FE dynamic analyses using the respective UVSCPL subroutine. Analyses have been made for the nickel-based superalloy INCO718 and for steel. The numerical examples prove that the proposed identification approach is effective and the numerical implementation is correct. [ABSTRACT FROM AUTHOR]

A translation to Fortran 90 of Gertrude Blanch's algorithm for computing the expansion coefficients of the series that represent Mathieu functions is presented. Its advantages are portability, higher precision, practicality of use, and extended documentation. In addition, numerical validations and comparisons with other existing methods are presented. [ABSTRACT FROM AUTHOR]

Abstract: The paper discusses a concept of dynamic reuse of subroutine results. The described technique uses a hardware mechanism that caches the address of the called subroutine along with its arguments and returned value. When the same subroutine is called again using the same arguments, the returned value can be accurately predicted without an actual execution of the subroutine. Although this approach can be highly effective in some cases, it is limited to subroutines that do not use side effects, and use only by-value parameter passing. Since the proposed method requires that both the user and the compiler be aware of this mechanism, it might be more appropriate for specific computing-intensive applications, rather than standard all-purpose programming. [Copyright &y& Elsevier]

We present a program-generation approach to address a software-reuse challenge in the area of scientific computing. More specifically, we describe the design of a program generator for the specification of subroutines that can be generic in the dimensions of arrays, parameter lists, and called subroutines. We describe the application of that approach to a real-world problem in scientific computing which requires the generic description of inverse ocean modeling tools. In addition to a compiler that can transform generic specifications into efficient Fortran code for models, we have also developed a type system that can identify possible errors already in the specifications. This type system is important for the acceptance of the program generator among scientists because it prevents a large class of errors in the generated code. [ABSTRACT FROM AUTHOR]

Basic algorithmic and numerical issues involved in subspace-based linear multivariable discrete-time system identification are described. A new identification toolbox—SLIDENT—has been developed and incorporated in the freely available Subroutine Library in Control Theory (SLICOT). Reliability, efficiency, and ability to solve industrial identification problems received a special consideration. Two algorithmic subspace-based approaches (MOESP and N4SID) and their combination, and both standard and fast techniques for data compression are provided. Structure exploiting algorithms and dedicated linear algebra tools enhance the computational efficiency and reliability. Extensive comparisons with the available computational tools based on subspace techniques show the better efficiency of the SLIDENT toolbox, at comparable numerical accuracy, and its capabilities to solve identification problems with many thousands of samples and hundreds of parameters. [Copyright &y& Elsevier]

Java is normally compiled to bytecode, which is verified and then executed by the Java Virtual Machine. Bytecode produced via compilation must pass verification. The main cause of complexity for bytecode verification is subroutines, used by compilers to generate more compact code. The techniques to verify subroutines proposed in the literature reject certain programs produced by mundane compilers, are difficult to realize within an implementation of the Java Virtual Machine or are relatively complicated. This paper presents a novel technique which is very simple to understand, implement and prove sound. It is also very powerful: the set of accepted programs has a simple characterization which most likely includes all the code produced by current compilers and which enables future compilers to make more extensive use of subroutines. Copyright © 2004 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

This paper presents an efficient and accurate high-level software energy estimation methodology using the concept of characterization-based macromodeling. In characterization-based macromodeling, a function or subroutine is characterized using an accurate lower level energy model of the target processor to construct a macromodel that relates the energy consumed in the function under consideration to various parameters that can be easily observed or calculated from a high-level programming language description. The constructed macromodels eliminate the need for significantly slower instruction-level interpretation or hardware simulation that is required in conventional approaches to software energy estimation. The authors present two different approaches to macromodeling for embedded software that offer distinct efficiency-accuracy characteristics: 1) complexity-based macromodeling, where the variables that determine the algorithmic complexity of the function under consideration are used as macromodeling parameters and 2) profiling-based macromodeling, where internal profiling statistics for the functions are used as the parameters in the energy macromodels. The authors have experimentally validated their software energy macromodeling techniques on a wide range of embedded software routines and two different target processor architectures. The experiments demonstrate that high-level macromodels constructed using the proposed techniques are able to estimate the energy consumption to within 94% accuracy on the average, while commanding speedups of one to five orders-of-magnitude over current instruction-level and architectural energy estimation techniques. This paper presents an efficient and accurate high-level software energy estimation methodology using the concept of characterization-based macromodeling. In characterization-based macromodeling, a function or subroutine is characterized using an accurate lower level energy model of the target processor to... [ABSTRACT FROM AUTHOR]

A significant barrier to the reuse of software is the rigid interface presented by a subroutine. For nontrivial data structures, it is unlikely that the existing form of the data of an application will match the requirements of a separately written subroutine. We describe two methods of interfacing existing data to a subroutine: generation of a program to convert the data to the form needed by the subroutine, and rewriting the subroutine, through compilation, to fit the existing data. Both methods can be invoked through easily used menu-based negotiation with the user. These methods have been implemented using the GLISP language and compiler. [ABSTRACT FROM AUTHOR]

Several inequalities are derived for use in certifying function subroutines by means of black box testing. It is assumed that a function is approximated by means of a polynomial of limited degree on a closed interval. These inequalities give upper bounds on the error of the approximation over the entire interval based on the error measured over a finite sample and known properties of the function. [ABSTRACT FROM AUTHOR]

Presents guidelines for using a computer program to identify the planets. Study of the distance, brightness and atmosphere of each planet; Insertion of modules to the almanac program; Subroutines called in by the program; Generation of moon and climatology data; Data lines for each planet.

The article focuses on the computer program that helps in producing superior specimens of Melopsittacus Undulatus, a parakeet native to Australia. It was programmed in BASIC on a Digital Equipment Corp. 20/50 mainframe. Some subroutines of the program was changed and certain syntax differences in the BASIC were adapted in order to conform on the IBM-XT personal computer. To avoid prohibitive processing time, a subroutine was designed which could be evaluated by other subroutine within the program. This subroutine allows a reduction in processing time. A pro forma data-input sheet was also created which matches to the data file layout. This is used to provide efficient data input related to the birds.