Search results for "Subroutine"
showing 10 items of 11 documents
Optimization problem in inductive inference
1995
Algorithms recognizing to which of n classes some total function belongs are constructed (n > 2). In this construction strategies determining to which of two classes the function belongs are used as subroutines. Upper and lower bounds for number of necessary strategies are obtained in several models: FIN- and EX-identification and EX-identification with limited number of mindchanges. It is proved that in EX-identification it is necessary to use n(n−1)/2 strategies. In FIN-identification [3n/2 − 2] strategies are necessary and sufficient, in EX-identification with one mindchange- n log2n+o(n log2n) strategies.
MDA: a MATLAB-based program for morphospace-disparity analysis
2003
A MATLAB® program that examines patterns of state-space occupation is described. Four subroutines are available with which to visualize morphospace patterns: (i) in terms of their features such as dispersion, aggregation and location, thereby allowing users to extract complementary quantitative information about how the state-space is structured, and (ii) in terms of changes in those patterns that can be compared with other biotic (e.g., extinction, origination rates) or abiotic (e.g., environmental proxy) information. The program incorporates many of the latest and most widely used statistical parameters for describing multivariate spaces. The parameters are estimated on the basis of boots…
Understanding Quantum Algorithms via Query Complexity
2017
Query complexity is a model of computation in which we have to compute a function $f(x_1, \ldots, x_N)$ of variables $x_i$ which can be accessed via queries. The complexity of an algorithm is measured by the number of queries that it makes. Query complexity is widely used for studying quantum algorithms, for two reasons. First, it includes many of the known quantum algorithms (including Grover's quantum search and a key subroutine of Shor's factoring algorithm). Second, one can prove lower bounds on the query complexity, bounding the possible quantum advantage. In the last few years, there have been major advances on several longstanding problems in the query complexity. In this talk, we su…
3D finite element analysis of tool wear in machining
2008
Abstract The paper is focused on the 3D numerical prediction of tool wear in metal cutting operations. In particular, an analytical model, able to take into account the diffusive wear mechanism, was implemented through a specific subroutine. Furthermore, an advanced approach to model heat transfer phenomena at the tool–chip interface was included in the numerical simulation. The adopted simulation strategy gave the possibility to properly evaluate the tool wear. The 3D FEM results were compared with some experimental data obtained turning AISI 1045 steel using uncoated WC tool; a good agreement was found out.
Potencialidades de Google Maps en la investigación social aplicada
2019
In recent years, Google has devoted resources to build a complete map of the world. They constantly scan the territory, collecting a large amount of data that provides updated and complete geographic information. This allows us to have an interoperable map that provides the end user with a search tool, not only of routes but also of shops, equipment and any type of geo-referenced information. In addition, Google Maps provides a series of Application Programming Interface (API), which provides a library of set of subroutines, functions and procedures (in object-oriented programming) that can be used by other software to automate the extraction of information of the Google platform. These fre…
Comparison of numerical modelling techniques for impact investigation on a wind turbine blade
2019
Wind turbine blades are exposed to numerous impact risks throughout their lifetimes. The impact risks range from bird collisions during operation to impacts with surrounding structures at the time of transportation and installation. Impact loads on the fibre composite blades can induce several complex, simultaneously interacting and visually undetectable damage modes and have a high potential to reduce the local and global blade stiffness. An assessment of such impact-induced damages is therefore necessary and usually involves high computational costs using numerical procedures, especially when analysing large composite components. To minimise this computational expense, different numerical…
New time-dependent Monte Carlo algorithm designed to model three-phase batch reactor processes: applications on 2,4-dinitro-toluene hydrogenation on …
2003
Abstract The hydrogenation of 2,4-dinitro-toluene on a Pd/C catalyst was employed as a test reaction to simulate, by the time-dependent Monte Carlo method, processes occurring in a three-phase batch reactor working at isobar and isotherm conditions. A new time-dependent Monte Carlo algorithm, including an original subroutine useful to reduce the time of the simulations, was developed and implemented in Fortran language. The paper describes the flowchart of the code together with the main technical details and the involved physical and chemical models. Computational characteristics, such as the simulated time to reach surface steady state conditions and the effects of the catalyst morphology…
IDEA: interface dynamics and energetics algorithm.
2007
IDEA, interface dynamics and energetics algorithm, was implemented, in FORTRAN, under different operating systems to mimic dynamics and energetics of elementary events involved in interfacial processes. The code included a parallel elaboration scheme in which both the stochastic and the deterministic components, involved in the developed physical model, worked simultaneously. IDEA also embodied an optionally running VISUAL subroutine, showing the dynamic energy changes caused by the surface events, e.g., occurring at the gas-solid interface. Monte Carlo and ordinary differential equation system subroutines were employed in a synergistic way to drive the occurrence of the elementary events a…
Run-time profiling of functional logic programs
2005
In this work, we introduce a profiling scheme for modern functional logic languages covering notions like laziness, sharing, and non-determinism. Firstly, we instrument a natural (big-step) semantics in order to associate a symbolic cost to each basic operation (e.g., variable updates, function unfoldings, case evaluations). While this cost semantics provides a formal basis to analyze the cost of a computation, the implementation of a cost-augmented interpreter based on it would introduce a huge overhead. Therefore, we also introduce a sound transformation that instruments a program such that its execution—under the standard semantics—yields not only the corresponding results but also the a…
The finite element implementation of 3D fractional viscoelastic constitutive models
2018
Abstract The aim of this paper is to present the implementation of 3D fractional viscoelastic constitutive theory presented in Alotta et al., 2016 [1]. Fractional viscoelastic models exactly reproduce the time dependent behaviour of real viscoelastic materials which exhibit a long “fading memory”. From an implementation point of view, this feature implies storing the stress/strain history throughout the simulations which may require a large amount of memory. We propose here a number of strategies to effectively limit the memory required. The form of the constitutive equations are summarized and the finite element implementation in a Newton-Raphson integration scheme is described in detail. …