Search

Paleomagnetic data is collected from bulk samples, containing a mixture of stable and unstable magnetic particles. Recently, magnetic microscopy techniques have allowed the examination of individual magnetic grains. However, accurately determining the magnetic moments of these grains is difficult and time‐consuming due to the inherent ambiguity of the data and the large number of grains in each image. Here we introduce a fast and semi‐automated algorithm that estimates the position and magnetization of dipolar sources solely based on the magnetic microscopy data. The algorithm follows a three‐step process: (a) employ image processing techniques to identify and isolate data windows for each magnetic source; (b) use Euler Deconvolution to estimate the position of each source; (c) solve a linear inverse problem to estimate the dipole moment of each source. To validate the algorithm, we conducted synthetic data tests, including varying particle concentrations and non‐dipolarity. The tests show that our method is able to accurately recover the position and dipole moment of particles that are at least 15 μm apart for a source‐sensor separation of 5 μm. For grain concentrations of 6,250 grains/mm3, our method is able to detect over 60% of the particles present in the data. We applied the method to real data of a speleothem sample, where it accurately retrieved the expected directions induced in the sample. The semi‐automated nature of our algorithm, combined with its low processing cost and ability to determine the magnetic moments of numerous particles, represents a significant advancement in facilitating paleomagnetic applications of magnetic microscopy. Plain Language Summary: Very small magnetic particles in rocks and other materials can store information about what the Earth's magnetic field was like in the past. But not all particles are good recorders of this magnetic information, and some may have recorded different overlapping directions and strengths. So it is important to measure each particle separately in order to identify and separate the good recorders from the bad ones. A device called a "quantum diamond microscope" is able to measure the magnetic field near the surface of a rock sample at microscopic scale. We propose a new method for processing data from this microscope that is able to find out the individual magnetizations of large amounts of small magnetic particles automatically. We created a computer program to execute the method, which calculates the 3D position and magnetization of each particle using the simple model of a magnetic dipole. We tested the method on simulated data, using fake magnetic particles for which we know the correct magnetization and position, and real data, both of which showed good results in most cases. The method we created has the potential to enable the widespread study of the magnetism of natural materials with more detail than before. Key Points: We present a fast algorithm to estimate the position and magnetization of individual sources using only magnetic microscopy dataThe algorithm was validated using synthetic samples that included both dipolar and non‐dipolar sources with varying depths and intensitiesThe successful application of the algorithm on a speleothem sample represents an advancement of this methodology for paleomagnetic studies [ABSTRACT FROM AUTHOR]

Purpose: Deformable dose accumulation (DDA) has uncertainties which impede the implementation of DDA-based adaptive radiotherapy (ART) in clinic. The purpose of this study is to develop a multi-layer quality assurance (MLQA) program to evaluate uncertainties in DDA. Methods: A computer program is developed to generate a pseudo-inverse displacement vector field (DVF) for each deformable image registration (DIR) performed in Accuray’s PreciseART. The pseudo-inverse DVF is first used to calculate a pseudo-inverse consistency error (PICE) and then implemented in an energy and mass congruent mapping (EMCM) method to reconstruct a deformed dose. The PICE is taken as a metric to estimate DIR uncertainties. A pseudo-inverse dose agreement rate (PIDAR) is used to evaluate the consequence of the DIR uncertainties in DDA and the principle of energy conservation is used to validate the integrity of dose mappings. The developed MLQA program was tested using the data collected from five representative cancer patients treated with tomotherapy. Results: DIRs were performed in PreciseART to generate primary DVFs for the five patients. The fidelity index and PICE of these DVFs on average are equal to 0.028 mm and 0.169 mm, respectively.With the criteria of 3 mm/3% and 5 mm/5%,the PIDARs of the PreciseART-reconstructed doses are 73.9 ± 4.4% and 87.2 ± 3.3%, respectively. The PreciseART and EMCM-based dose reconstructions have their deposited energy changed by 5.6 ± 3.9% and 2.6 ± 1.5% in five GTVs, and by 9.2 ± 7.8% and 4.7 ± 3.6% in 30 OARs, respectively. Conclusions: A pseudo-inverse map-based EMCM program has been developed to evaluate DIR and dose mapping uncertainties. This program could also be used as a sanity check tool for DDA-based ART. [ABSTRACT FROM AUTHOR]

Introduction Guidelines on hemodialysis (HD) dosing are based on urea kinetics, which can be modeled mathematically. Different schedules can be compared by equivalent continuous clearance. Methods A computer program generating HD prescriptions automatically was developed. In 200 actual HD urea kinetic modeling sessions involving 33 patients the urea distribution volume, generation rate, and concentration profile in the external space were computed using ionic dialysance as dialyzer clearance in the double pool ureakinetic model. Dialyzer in vivo mass area coefficient K0A was calculated from online data with the Michaels' equation. Data from the modeling sessions were used for generating new prescriptions for the same patients. Findings New prescriptions meeting 12 criteria—technical limits and guideline targets—were generated by the model. They showed a wide range of basic treatment parameters (time and frequency, blood and dialysate flow, and ultrafiltration). In five cases, the dialysis time or frequency should have been increased from the actual to achieve the targets, in 72 cases the frequency could have been decreased. Two methods to emphasize RRF were tested. Using a coefficient of 2.0 for renal urea clearance in computing adjusted equivalent continuous clearance (EKR/Va), as suggested by Casino and Basile, decreased further the required treatment frequency in incremental dialysis. Discussion The model produced plausible individual prescriptions, but some unknown factors caused the determination of the dialyzer in vivo K0A to be inaccurate. The model must be tested with modern devices on patients before integration into dialysis machines and information systems. [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 present a static analysis for determining whether and to what extent functions in JavaScript programs are pure. To this end, the analysis classifies functions as pure functions, observers, or procedures. A function is pure if none of its executions generate or depend upon externally observable side effects. A function is an observer as soon as one of its executions depends on an external side effect, but none of its executions generate observable side effects. Otherwise, the function is classified as a procedure. Function executions and associated callers are found by traversing all reachable function execution contexts on the call stack at the point where an effect occurs. Our approach is based on a flow analysis that, in addition to computing traditional control and value flow, keeps track of read and write effects. To increase the precision of our purity analysis, we combine it with an intraprocedural analysis that determines freshness of variables and objects. We formalize the core aspects of our technique and discuss its implementation and results on common JavaScript benchmarks. Results show that our approach is capable of determining function purity in the presence of higher-order functions, dynamic property expressions, and prototypal inheritance. When compared with existing purity analyses, we find that our approach is as precise or more precise than the existing analyses. [ABSTRACT FROM AUTHOR]

Designing minimum possible order (minimal) observers for multi-input multi-output (MIMO) linear systems have always been an interesting subject. In this paper, a new methodology to design minimal multi-functional observers for linear time invariant (LTI) systems is proposed. The approach is applicable, and it also helps in regulating the convergence rate of the observed functions. It is assumed that the system is functional observable or functional detectable, which is less conservative than assuming the observability or detectability of the system. To satisfy the minimality of the observer, a recursive algorithm is provided that increases the order of the observer by appending the minimum required auxiliary functions to the desired functions that are going to be estimated. The algorithm increases the number of functions such that the necessary and sufficient conditions for the existence of a functional observer are satisfied. Moreover, a new methodology to solve the observer design interconnected equations is elaborated. Our new algorithm has advantages with regard to the other available methods in designing minimal order functional observers. Specifically, it is compared with the most common schemes, which are transformation based. Using numerical examples it is shown that under special circumstances, the conventional methods have some drawbacks. The problem partly lies in the lack of sufficient numerical degrees of freedom proposed by the conventional methods. It is shown that our proposed algorithm can resolve this issue. A recursive algorithm is also proposed to summarize the observer design procedure. Several numerical examples and simulation results illustrate the efficacy, superiority and different aspects of the theoretical findings. [ABSTRACT FROM AUTHOR]

What-If Analysis is one of the most commonly used methods for performing a process hazards analysis (PHA) of a potentially hazardous chemical process. It is used so widely because it is perhaps the simplest and quickest way to perform a PHA. The speed of the PHA method often sacrifices quality by missing important scenarios simply because the right what-if question was never asked. This article will show how the quality of a What-If Analysis can be enhanced using failure modes for system component types without significantly increasing study time. A 'smart' system using off-the-shelf computer software combined with specially designed subroutines or macros is used to demonstrate this process. © 2013 American Institute of Chemical Engineers Process Saf Prog 33: 231-236, 2014 [ABSTRACT FROM AUTHOR]

The topic of strategic foresight is rapidly attracting scholarly interest and attention within the broad fi elds of organization and management studies. Micro-interactions and the (re) production of everyday organizational routines and practices could help us grasp the logic of strategic foresight. Strategic foresight, in the form of a constellation of structures, practices, and routines, gives form to the creative exploration and exploitation of potentialities and limits in context by providing possibility for actions. Contributing to the existing research on strategic foresight, this special issue contains papers that are varied, eclectic, and stimulating. [ABSTRACT FROM AUTHOR]

SUMMARY The use of high-performance libraries for dense linear algebra operations is of great importance in many numerical scientific applications. The most common operations form the backbone of the Basic Linear Algebra Subroutines (BLAS) library. In this paper, we consider the performance and auto-tuning of level 1 and level 2 BLAS routines on graphical processing units. As examples, we develop single-precision Compute Unified Device Architecture kernels for three of the most popular operations, the Euclidian norm (SNRM2), the matrix-vector multiplication (SGEMV), and the triangular solution (STRSV). The target hardware is the most recent Nvidia (Santa Clara, CA, USA) Tesla 20-series (Fermi architecture), which is designed from the ground up for high-performance computing. We show that it is essentially a matter of fully utilizing the fine-grained parallelism of the many-core graphical processing unit to achieve high performance for level 1 and level 2 BLAS operations. We show that auto-tuning can be successfully employed to kernels for these operations so that they perform well for all input sizes. Copyright © 2012 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Distributed problem-solving (DPS) systems use a framework of human organizational notions and principles of intelligent systems to solve complex problems. Human organizational notions are used to decompose a complex problem into sub-problems that can be solved using intelligent systems. The solutions of these sub-problems are combined to solve the original complex problem. In this paper, we propose a DPS system for probabilistic estimation of software development effort. Using a real-world software engineering dataset, we compare the performance of the DPS system with a neural network (NN) and show that the performance of the DPS system is equal to or better than that of the NN with the additional benefits of modularity, probabilistic estimates, greater interpretability, flexibility and capability to handle incomplete input data. [ABSTRACT FROM AUTHOR]

SUMMARY The popularity of Partitioned Global Address Space (PGAS) languages has increased during the last years thanks to their high programmability and performance through an efficient exploitation of data locality, especially on hierarchical architectures such as multicore clusters. This paper describes UPCBLAS, a parallel numerical library for dense matrix computations using the PGAS Unified Parallel C language. The routines developed in UPCBLAS are built on top of sequential basic linear algebra subprograms functions and exploit the particularities of the PGAS paradigm, taking into account data locality in order to achieve a good performance. Furthermore, the routines implement other optimization techniques, several of them by automatically taking into account the hardware characteristics of the underlying systems on which they are executed. The library has been experimentally evaluated on a multicore supercomputer and compared with a message-passing-based parallel numerical library, demonstrating good scalability and efficiency. Copyright © 2012 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Abstract: Doctors’ orders entered with Computerized Physician Order Entry (CPOE) systems are designed to enhance patient care by standardizing routines that are intended to improve quality of healthcare. As with other health information technology (IT) performance studies, literature shows conflicting results regarding the CPOE–performance relationship. By adopting a more nuanced perspective and employing not just adoption but extent of use of CPOE, we first examine whether or not CPOE use improves patient satisfaction. Next, given that CPOEs are implemented in the backdrop of other hospital IT infrastructure, we examine how IT infrastructure impacts the relationship between CPOE use and satisfaction, testing both a complementary and substitution perspective. Finally, we examine the differential impact of CPOE use between academic and non-academic hospitals. Using data from 806 hospitals nationwide, we find a positive relationship between extent of CPOE use and patient satisfaction. Contrary to extant research, our results suggest this relationship is stronger in non-academic hospitals. We also find evidence that a hospital''s IT infrastructure substitutes for CPOE use in its effect on patient satisfaction. [Copyright &y& Elsevier]

Profiling is a key technique for achieving high performance. Call-path profiling is a refinement of this technique that classifies a function's behavior based on the path taken to reach the function. This information is particularly useful when optimizing programs that use libraries, such as those for communication (MPI or PVM), linear algebra (ScaLAPACK), or threading. We present a new method for call-path profiling called incremental call-path profiling. We profile only a subset of the functions in the program, allowing the use of more complex metrics while lowering the overhead. This combination of call-path information and complex metrics is particularly useful for localizing bottlenecks in frequently called functions. We also describe the implementation and application of iPath, an incremental call-path profiler. iPath was used to profile two real-world applications: the MILC su3_rmd QCD distributed simulation and the Paradyn instrumentation daemon. In both applications we found and removed call-path-specific bottlenecks. Our modifications to su3_rmd reduced the running time of the program from 3001 to 1652 s, a 45% decrease. Our modifications to the Paradyn instrumentation daemon greatly increased its efficiency. The time required to instrument our benchmark program was reduced from 296 to 6.4 s, a 98% decrease. Copyright © 2006 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

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]

The article focuses on the study on the S-storage operators of Church integers. It says that J. L. Krivine introduces the storage operation notion to simulate the call by name and call by value strategy in Church integers. It mentions that the author says that they proved that all the storage operators in Church integers were S-storage operator. It also mentions that λ-term S were Church integers' successor function.

The article presents a study which explores the general recursion theory in the algebraic structures of string functions. It says that the author offers a string functions' computation model which investigates two forms of nondeterminism and several recognazibility variants. It mentions that the authors studied several basic features of the structure's general computability theory. The study also demonstrates the use of some high-level programming constructs and macros.

Proposes a Fortran subroutine for the solution of periodic block-tridiagonal systems. Computation of the average truncation errors for the numerical solution; Verification of the correctness of the subroutine PERTR;

The motivation for this work is the great need of applying light structures for the protection of coastal areas from detrimental effects of rapid water runoff. In case of windy or stormy weather conditions, light structures are extremely vulnerable to be attacked by floating debris and even tree trunks. To meet the safety criteria, speculation of this impulsive force on light structures gains in importance on account of the massive deformation of membrane. This matter provides the incentive to investigate an impact phenomenon numerically. The analysis was first performed within a standalone Abaqus standard environment, where the effect of fluid domain on the flexible structure was executed on structure by user subroutine of DLOAD, which was updated in each iteration based on new deformed shape. This model was extended by a partitioned strategy which makes it possible for fluid and structure domains to be interconnected powerfully. The impact of free surface water flow on the membrane was executed using the finite volume solver of Star CCM+, which behaves in response to displacements of the structures. On account of added mass effects, the implicit coupling algorithm between fluid and solid regions was implemented. [ABSTRACT FROM AUTHOR]

The Fortran90 sources of the UMWEG-specific subroutines of the program UMWEG are presented and deposited, together with the PostScript-plot software subroutines and the simple and short main program of the command-line version of the program UMWEG. [ABSTRACT FROM AUTHOR]

The paper applies a multiscale formulation to thermoplasticity problems. The plasticity model is based on the variationally consistent formulation at the micro level. It is suitable for problems involving large strains. The temperature field is calculated at the macro level and is assumed to be homogeneous at the micro level. The proposed formulation is implemented in the Abaqus software by means of user subroutines. User subroutines are introduced both at the macro and at the micro level. The consistent tangent operator is calculated by the numerical differentiation procedure. Implementation details are briefly addressed. Finally, the methodology is verified on a representative example and relevant results are presented and discussed. (© 2016 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim) [ABSTRACT FROM AUTHOR]

The Fortran90 source of the subroutine UPFORM, which provides dispersion corrections and scattering factors for all free atoms and ions in the range 0 ≤ sinθ/λ≤ 6 Å−1, has been deposited in the IUCr electronic archives. [ABSTRACT FROM AUTHOR]

The Fortran90 sources of the subroutines of the program UMWEG providing the crystallographic data necessary for intensity calculations have been deposited in the IUCr electronic archives. [ABSTRACT FROM AUTHOR]

This article focuses on a method to solve boolean equations through the use of term weights to the base two. While not satisfying a simple weight-limit, the technique does afford a unique solution to a Boolean equation when used in conjunction with a table-lookup following assessment of the truth-value of each term in the set. This technique is often used in computer programming where, for example, any of 2n different subroutines or branches must be taken depending on the truth subset of n elements.