Intermediate Results Of Calculations Research Articles

Usage of a computer cluster for physics simulations using bullet engine and OpenCL

The study focuses on using a computer cluster for implementing real-time physical simulations, responding to a growing need for such use in various sectors, including medicine, video processing, automated transport management, robotics, and visualisation. The object of research is cluster and cloud technologies for conducting costly physical simulations for specific sectors, particularly high-budget and entertainment ones, such as cinematography and interactive entertainment. Research methods include using a modified Bullet engine to carry out physical simulations, integrated with OpenCL to work with the cluster. The choice of these technologies was determined by their high performance and adaptability to cluster systems. The research was based on a typical Bullet framework’s benchmark falling tower scene with the primary goal of measuring computational performance in frames per second. Results showed that the use of clusters is not advisable in environments with a low network throughput and the use of non-uniform computers. Under those conditions, simulations using a cluster become unstable with many objects and contacts between them and show a degradation in performance by an average of 50–60 % (to values of 10–20 frames per second). Despite the intermediate results of calculations on the cluster, the study met the expectations within the goals set and resources available. These results have significant implications for the further development of cluster and cloud technologies in physical simulations, providing valuable information about the limitations and capabilities of these systems.

Algorithms for analytical and geomarketing research of commercial objects

Modern methods of data processing within the framework of various studies require a comprehensive study. Currently, geoanalytic methods are increasingly used to solve economic problems. To assess the dynamics of the market and economy development, it is necessary to offer such tools that, in addition to classical economic and statistical research methods, were able to take into account the data of the location, environment, territorial features of the objects of research and other characteristics. This one will allow for a more in-depth study of commercial facilities. An important task of economics and management is the development of marketing strategies. To solve this group of problems in geoanalytics and geoanalysis, a whole direction of geomarketing has been developed. The main steps of the geomarketing research algorithm using geoanalytic tools will be discussedin this article. Some intermediate results of calculations are not indicated in the text, the tables of results are shown partially. The missing fragments are obtained similarly according to the algorithm of geomarketing research of a commercial object.

Fast Piecewise Polynomial Fitting of Time-Series Data for Streaming Computing

Streaming computing attracts intense attention because of the demand for massive data analyzing in real-time. Due to unbounded and continuous input, the volume of streaming data is so high that all the data cannot be permanently stored. Piecewise polynomial fitting is a popular data compression method that approximately represents the raw data stream with multiple polynomials. The polynomial coefficients corresponding to the best-fitting curve can be calculated by the method of least squares, which minimizes the sum of the squared residuals between observed and fitted values. However, built on several matrix calculations, the method of least squares always leads to high time complexity and is difficult to be applied to streaming computing. This paper puts forward a fast piecewise polynomial fitting for time-series data in streaming computing. The input data stream is dynamically segmented according to a given residual bound. Meanwhile, the data points in each segment are fitted using an improved polynomial fitting method, which has less time overhead than general polynomial fitting by reusing the intermediate calculation results. Experimental results on four time-series datasets show that our algorithm can achieve the highest speedup to the general piecewise polynomial fitting of 2.82x for periodically sampled time-series data and 1.85x for aperiodically sampled time-series data, without affecting the compression ratio and fitting accuracy. Moreover, the event-time latency comparison in a streaming environment indicates that the improved method can endure higher throughput than general piecewise polynomial fitting with the same latency.

Controlled Logic Gate Based on a Four-Node Linear Hybrid Cluster State

In the case of a large amount of computation, a situation may arise when the intermediate results of calculations need to be stored for a given time. In this work, we show how to create a hybrid atomic-field cluster state and create a controlled gate in such a way that the results of calculations are recorded under long-lived degrees of freedom of an atomic ensemble and can be stored for a long time.

Reductus: a stateless Python data reduction service with a browser front end

The online data reduction service reductus transforms measurements in experimental science from laboratory coordinates into physically meaningful quantities with accurate estimation of uncertainties from instrumental settings and properties. This reduction process is based on a few well known transformations, but flexibility in the application of the transforms and algorithms supports flexibility in experiment design, enabling a broader range of measurements than a rigid reduction scheme for data. The user interface allows easy construction of arbitrary pipelines from well known data transforms using a visual data flow diagram. Source data are drawn from a networked, open data repository. The Python back end uses intelligent caching to store intermediate results of calculations for a highly responsive user experience. The reference implementation allows immediate reduction of measurements as they are recorded for the three neutron reflectometry instruments at the NIST Center for Neutron Research, without the need for visiting scientists to install additional software on their own computers.

Використання програмного комплексу mdsolids у викладанні дисципліни "Механіка матеріалів і конструкцій"

One of the ways to increase the effectiveness of teaching is the introduction of information technology in the educational process. Recently, in the teaching of disciplines theoretical mechanics, engineering mechanics, mechanics of materials and structures, strength of materials have become widely used various systems of computer mathematics. The most common are Maple, MathCAD, Matlab. The listed software allow step by step to solve various tasks with the demonstration of intermediate results of calculations, as well as to model dynamic objects and processes based on analytical formulas, which is necessary for solving engineering and technical problems. The text of the article gives grounds for the expediency of using the MDSolids package when studying the discipline of materials and structures mechanics by students of the agrarian and technical higher education institution. Introduction to the program MDSolids, and then independent work in its environment awakens the students additional interest in the discipline "Mechanics of materials and structures", because it allows to informally approach the process of solving educational problems. The program somehow duplicates the work of the student's thoughts, and then confirms or refutes its correctness. Another advantage of introducing MDSolids into the learning process is that, at an early stage in obtaining higher engineering education, students learn about the basics of the automation of engineering analysis. In this acquaintance it becomes obvious that without possessing the engineering concepts familiar with the discipline "Mechanics of materials and constructions", as well as modern computer technologies, it is impossible to become a competent engineer.

Software for Distributed Computation on Medical Databases: A Demonstration Project

Bringing together the information latent in distributed medical databases promises to personalize medical care by enabling reliable, stable modeling of outcomes with rich feature sets (including patient characteristics and treatments received). However, there are barriers to aggregation of medical data, due to lack of standardization of ontologies, privacy concerns, proprietary attitudes toward data, and a reluctance to give up control over end use. Aggregation of data is not always necessary for model fitting. In models based on maximizing a likelihood, the computations can be distributed, with aggregation limited to the intermediate results of calculations on local data, rather than raw data. Distributed fitting is also possible for singular value decomposition. There has been work on the technical aspects of shared computation for particular applications, but little has been published on the software needed to support the social networking aspect of shared computing, to reduce the barriers to collaboration. We describe a set of software tools that allow the rapid assembly of a collaborative computational project, based on the flexible and extensible R statistical software and other open source packages, that can work across a heterogeneous collection of database environments, with full transparency to allow local officials concerned with privacy protections to validate the safety of the method. We describe the principles, architecture, and successful test results for the site-stratified Cox model and rank-k singular value decomposition.

A decision making method under conditions of diversity of means of reducing uncertainty

Most widespread methods of multicriteria optimization are considered as different means of reducing uncertainty arising because the decision making problem is not mathematically closed. The decision making method under uncertainty conditions constructed based on the axiomatic account of the whole set of sufficiently reasonable means of reducing uncertainty is described as an alternative. The method makes it possible to combine the results of application of different means of reducing uncertainty in the framework of a unified procedure, which increases the validity of the obtained conclusions. Note that the explicit inclusion of the set of uncertain factors into the description of the decision making problem gives an opportunity to take into account easily various preferences of the decision making person. This method, being realized in the form of a program system, is easy to use by the decision making person and presents many final and intermediate results of calculations in a compact and obvious form.

The maximal complexity of calculations of systems of elements of a free Abelian group

The problem of the complexity of joint calculation of a system of elements of a free Abelian group is studied in the paper and a model admitting multiple usage of intermediate calculation results is chosen for simulation. A growth asymptotics for the value LF (p, q, K) is obtained under weak restrictions; this value is the minimal number of multiplication operations sufficient for calculation of an arbitrary system of p elements of a free Abelian group (based on q generators and elements of this group inverse to them) possessing the property that in a representation of the elements via the generators all degrees do not exceed K — 1 in absolute value.

Fate and transport of monoterpenes through soils. Part II: Calculation of the effect of soil temperature, water saturation and organic carbon content

This theoretical study was performed to investigate the influence of soil temperature, soil water content and soil organic carbon fraction on the mobility of monoterpenes (C 10H n O n′ ) applied as pesticides to a top soil layer. This mobility was expressed as the amount volatilized and leached from the contaminated soil layer after a certain amount of time. For this, (slightly modified) published analytical solutions to a one dimensional, homogeneous medium, diffusion/advection/biodegradation mass balance equation were used. The required input-parameters were determined in a preceding study. Because the monoterpenes studied differ widely in the values for their physico-chemical properties, the relative importance of the various determinants also differed widely. Increasing soil water saturation reduced monoterpene vaporization and leaching losses although a modest increase was usually observed at high soil water contents. Organic matter served as the major retention domain, reducing volatilization and leaching losses. Increasing temperature resulted in higher volatilization and leaching losses. Monoterpene mobility was influenced by vertical water flow. Volatilization losses could be reduced by adding a clean soil layer on top of the contaminated soil. Detailed insight into the specific behaviour of different monoterpenes was obtained by discussing intermediate calculation results; the transport retardation factors and effective soil diffusion coefficients. One insight was that the air–water interface compartment is probably not an important partitioning domain for monoterpenes in most circumstances. The results further indicated that biodegradation is an important process for monoterpenes in soil.

Non-RAM-based architectural designs of wavelet-based digital systems based on novel nonlinear I/O data space transformations

The designs of application specific integrated circuits and/or multiprocessor systems are usually required in order to improve the performance of multidimensional applications such as digital-image processing and computer vision. Wavelet-based algorithms have been found promising among these applications due to the features of hierarchical signal analysis and multiresolution analysis. Because of the large size of multidimensional input data, off-chip random access memory (RAM) based systems have ever been necessary for calculating algorithms in these applications, where either memory address pointers or data preprocessing and rearrangements in off-chip memories are employed. This paper establishes and follows novel concepts in data dependence analysis for generalized and arbitrarily multidimensional wavelet-based algorithms, i.e., the wavelet-adjacent field and the super wavelet-dependence vector. Based on them, a series of novel nonlinear I/O data space transformations for variable localization and dependence graph regularization for wavelet algorithms is proposed. It leads to general designs of non-RAM-based architectures for wavelet-based algorithms where off-chip communications for intermediate calculation results are eliminated without preprocessing or rearranging input data.

Decision diagram method for calculation of pruned Walsh transform

Discrete Walsh transform is an orthogonal transform often used in spectral methods for different applications in signal processing and logic design. FFT-like algorithms make it possible to efficiently calculate the discrete Walsh spectrum. However, for their exponential complexity, these algorithms are practically unsuitable for large functions. For this reason, a Binary Decision Diagram (BDD) based recursive method for Walsh spectrum calculation has been introduced in Clarke et al. (1993). A disadvantage of this algorithm is that the resulting Multi-Terminal Binary Decision Diagram (MTBDD) representing the Walsh spectrum for f can be large for some functions. Another disadvantage turns out if particular Walsh coefficients are to be computed separately. The algorithm always calculates the entire spectrum and, therefore, it is rather inefficient for applications where a subset of Walsh spectral coefficients, i.e., the pruned Walsh spectrum, is required. In this paper, we propose another BDD-based method for Walsh spectrum calculation adapted for application where the pruned Walsh spectrum is needed. The method takes advantage of the property that for most switching functions, the size of a BDD for f is usually quite a bit smaller than the size of the MTBDD for the Walsh spectrum. In our method, a MTBDD representing the Walsh spectrum is not: constructed. Instead, two additional fields are assigned to each node in the BDD for the processed function f. These fields are used to store the results of intermediate calculations. Pairs of spectral coefficients are calculated and stored in the fields assigned to the root node. Therefore, the calculation complexity of the proposed algorithm is proportional to the size of the BDD for f whose spectrum is calculated. Experimental results demonstrate the efficiency of the approach.

Efficient Intersection of Surface Normals With Milling Tool Swept Volumes for Discrete Three-Axis NC Verification

An efficient algorithm is presented for intersecting vectors with swept solids which represent three-axis numerically controlled (NC) milling tool motions. The intersection calculation proceeds in hierarchical steps through a series of progressively more exact definitions of the shape of the tool swept volume. At each step, results of intermediate calculations are used to determine whether intersection with an exact representation of the solid is possible and, if so, where and how the swept volume model must be refined for the next step. This structure ensures that superfluous intersection calculations are minimized. This intersection technique has been successfully implemented as part of an algorithm for automatic verification of three-axis NC milling programs, and may also be useful for applications in robotics and factory automation.

COMPUTATION OF 1-LOOP CONTRIBUTIONS IN Y.M. THEORIES WITH CLASS III NONRELATIVISTIC GAUGES

A program to compute the gluon self-energy diagram in class III nonrelativistic gauges has been constructed. It succeeded to show that axial gauges do not exhibit nonlocal counterterms. The high complexity of the calculations, the need to be able to control intermediate steps of calculations and the necessity to work inside a limited memory of a few Mbytes led us to give it special features which may serve outside the specific application for which it has been designed. The structure of the program and its salient working features are described. It is divided into four modules, which are almost independent except that they are linked by their respective output. Files containing intermediate results of calculations are automatically generated. The amount of algebraic manipulations has been greatly reduced thanks to a careful choice of the representation of the expression adapted to each stage of the calculation. The adaptative character of this program is discussed as well as the generalization it needs to cover other types of Feynman diagram calculations.