ppxscal/embedding_network huggingface dataset:
Logics and Logistics of Community Intervention Against Osteoporosis: An Evidence Basis
Authors: John Waller, Marianne Angbratt, Carina Blomberg, Ann-Charlotte Kronhed, Lasse Larsson, Owe Löfman, Margareta Möller, Göran Toss, Mats Foldevi, Erik Trell
Venue: Journal of Medical Systems (1997)

Under designations like small areas action research and intervention, directed &lsquo;ground-up&rsquo; health promotion and prevention in the population form an important part of the ongoing medical systems development. There is recent evidence of the success of community intervention against cardiovascular disease. In osteoporosis, however, there is still a lack of conclusive data on both the logics and logistics of such an approach. Since 1988, a county health policy program has been formulated and implemented in &Ouml;sterg&ouml;tland, Sweden, following the principles and guidelines of the WHO HFA 2000 declaration. Vadstena (n &asymp; 7,600) was chosen for a local and generalizable osteoporosis prevention project mediated by the primary care organization by means of health promotion and education in the community. In the present report we emphasize that community intervention is an important new advancement of the medical systems, where the basic research questions include operational and management aspects as equally vital and measurable requisites and results as other performance and outcome variables. We found that a community intervention trial against osteoporosis is both motivated and feasible and in this report wish to provide evidence on these crucial issues of logics and logistics.
Position paper
Authors: Brad Balfour
Venue: Proceedings of the conference on TRI-ADA '90 (1990)

On the issue of adding Object Oriented Programming Language features to Ada, I find myself with a mixed view of the issue. As a proponent, innovator, and user of object oriented technology since my introduction to Ada in 1983, I want to gain the benefits that techniques such as inheritance and polymorphism can provide. However, after having participated in sessions about adding OOPL features to Ada I have found good arguments against adopting each of the different proposals which have been made. Currently, I am in search of overwhelming arguments on one side or another. Each of the major points on this issue, pro and con, are summarized below with appropriate rebuttals following in the nested paragraph.
Statistical Condition Estimation for Linear Systems
Authors: C. S. Kenney, A. J. Laub, M. S. Reese
Venue: SIAM Journal on Scientific Computing (1998)

The standard approach to measuring the condition of a linear system compresses all sensitivity information into one number. Thus a loss of information can occur in situations in which the standard condition number with respect to inversion does not accurately reflect the actual sensitivity of a solution or particular entries of a solution. It is shown that a new method for estimating the sensitivity of linear systems addresses these difficulties. The new procedure measures the effects on the solution of small random changes in the input data and, by properly scaling the results, obtains reliable condition estimates for each entry of the computed solution. Moreover, this approach, which is referred to as small-sample statistical condition estimation, is no more costly than the standard 1-norm or power method 2-norm condition estimates, and it has the advantage of considerable flexibility. For example, it easily accommodates restrictions on, or structure associated with, allowable perturbations. The method also has a rigorous statistical theory available for the probability of accuracy of the condition estimates. However, it gives no estimate of an approximate null vector for nearly singular systems. The theory of this approach is discussed along with several illustrative examples.
Numerical Solution of First-Kind Volterra Equations by Sequential Tikhonov Regularization
Authors: Patricia K. Lamm, Lars Eldén
Venue: SIAM Journal on Numerical Analysis (1997)

We consider the problem of finding regularized solutions to ill-posed Volterra integral equations. The method we consider is a sequential form of Tikhonov regularization that is particularly suited to problems of Volterra type. We prove that when this sequential regularization method is coupled with several standard discretizations of the integral equation (collocation, rectangular and midpoint quadrature), one obtains convergence of the method at an optimal rate with respect to noise in the data. In addition we describe a fast algorithm for the implementation of sequential Tikhonov regularization and show that for small values of the regularization parameter, the method is only slightly more expensive computationally than the numerical solution of the original unregularized integral equation. Finally, numerical results are presented to show that the performance of sequential Tikhonov regularization nearly matches that of standard Tikhonov regularization in practice but considerable savings in cost are realized.
A hybrid algorithm for test point selection for scan-based BIST
Authors: Huan-Chih Tsai, Chih-Jen Lin, Sudipta Bhawmik, Kwang-Ting Cheng
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

We propose a new algorithm for test point selection forscan-based BIST.The new algorithm combines the advantagesof both explicit-testability-calculation and gradienttechniques.The test point selection is guided by acost function which is partially based on explicit testabilityrecalculation and partially on gradients.With anevent-driven mechanism, it can quickly identify a set ofnodes whose testability need to be recalculated due toa test point, and then use gradients to estimate the impactof the rest of the circuit.In addition, by incorporatingtiming information into the cost function, timingpenalty caused by test points can be easily avoided.Wepresent the results to illustrate that high fault coveragesfor both area- and timing-driven test point insertionscan be obtained with a small number of test points.Theresults also indicate a significant reduction of computationalcomplexity while the qualities are similar to theexplicitly-testability-calculation method.
Statistical Real-Time Channels on Multiaccess Bus Networks
Authors: Chih-Che Chou, Kang G. Shin
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

Real-time communication with performance guarantees is expected to become an important and necessary feature of future computer networks. In this paper, we present a scheme which can provide real-time communication services with both absolute and statistical performance guarantees on multiaccess bus networks for given input traffic characteristics and performance requirements. The proposed scheme reserves network bandwidth for real-time connections according to their needs. It also allows for independent addition and deletion of real-time connections while preserving existing guarantees. Our extensive simulation results for motion video communication have shown the proposed scheme to outperform the other well-known schemes.
Decomposing 4-Regular Graphs into Triangle-Free 2-Factors
Authors: Edward Bertram, Peter Horák
Venue: SIAM Journal on Discrete Mathematics (1997)

There is a polynomial algorithm which finds a decomposition of any given 4-regular graph into two triangle-free 2-factors or shows that such a decomposition does not exist.
An instruction reoderer for pipelined computers
Authors: Jong-Jiann Shieh, Christos A. Papachristou
Venue: Proceedings of the 23rd annual workshop and symposium on Microprogramming and microarchitecture (1990)

In paper [19], we proposed an algorithm to reorder the straight line instruction streams for pipelined computers. In this paper, we extend the algorithm to handle streams with branches and loops as well. The input is the intermediate code of a compiler and is represented by the data control dependence graph(DCG). The DCG is preprocessed to construct a branch nest tree which is related to the structure of the branches and loops within the instruction streams. A priority list is then constructed for scheduling the nodes. The algorithm finds a most suitable slot for each node of the DCG.
General modeling and technology-mapping technique for LUT-based FPGAs
Authors: Amit Chowdhary, John P. Hayes
Venue: Proceedings of the 1997 ACM fifth international symposium on Field-programmable gate arrays (1997)

We present a general approach to the FPGA technology mapping problem that applies to any logic block composed of lookup tables (LUTs) and can yield optimal solutions. The connections between LUTs of a logic block are modeled by virtual switches, which define a set of multiple-LUT blocks (MLBs) called an MLB-basis. We identify the MLB-bases for various commercial logic blocks. Given a n MLB-basis, we formulate FPGA mapping as a mixed integer linear programming (MILP) problem to achieve both the generality and the optimality objectives. We solve the MILP models using a general-purpose MILP solver, and present the results of mapping some ISCAS.85 benchmark circuits with a variety of commercial FPGAs. Circuits of a few hundred gates can be mapped in reasonable time using the MILP approach directly. Larger circuits can be handled by partitioning them prior to technology mapping. We show that optimal or provably near-optimal solutions can be obtained for the large ISCAS.85 benchmark circuits using partitions defined by their high-level functions.
Strategies for large-scale structural problems on high-performance computers
Authors: Ahmed K. Noor, Jeanne M. Peters
Venue: ACM SIGARCH Computer Architecture News (1990)

Novel computational strategies are presented for the analysis of large and complex structures. The strategies are based on generating the response of the complex structure using large perturbations from that of a simpler model, associated with a simpler structure (or a simpler mathematical/discrete model of the original structure). Numerical examples are presented to demonstrate the effectiveness of the strategies developed.
An Experimental and Theoretical Comparison of Model SelectionMethods
Authors: Michael Kearns, Yishay Mansour, Andrew Y. Ng, Dana Ron
Venue: Machine Learning (1997)

We investigate the problem of {\it model\ selection} in the setting of supervised learning of boolean functions from independent random examples. More precisely, we compare methods for finding a balance between the complexity of the hypothesis chosen and its observed error on a random training sample of limited size, when the goal is that of minimizing the resulting generalization error. We undertake a detailed comparison of three well-known model selection methods &mdash; a variation of Vapnik&lsquo;s {\it Guaranteed\ Risk\ Minimization} (GRM), an instance of Rissanen&lsquo;s {\it Minimum\ Description\ Length\ Principle} (MDL), and (hold-out) cross validation (CV). We introduce a general class of model selection methods (called {\it penalty-based} methods) that includes both GRM and MDL, and provide general methods for analyzing such rules. We provide both controlled experimental evidence and formal theorems to support the following conclusions:\bulletEven on simple model selection problems, the behavior of the methods examined can be both complex and incomparable. Furthermore, no amount of &ldquo;tuning&rdquo; of the rules investigated (such as introducing constant multipliers on the complexity penalty terms, or a distribution-specific &ldquo;effective dimension&rdquo;) can eliminate this incomparability.\bulletIt is possible to give rather general bounds on the generalization error, as a function of sample size, for penalty-based methods. The quality of such bounds depends in a precise way on the extent to which the method considered automatically limits the complexity of the hypothesis selected.\bulletFor {\it any} model selection problem, the additional error of cross validation compared to {\it any} other method can be bounded above by the sum of two terms. The first term is large only if the learning curve of the underlying function classes experiences a phase transition&rdquo; between (1-\gamma)m andm examples (where \gamma is the fraction saved for testing in CV). The second and competing term can be made arbitrarily small by increasing\gamma .\bulletThe class of penalty-based methods is fundamentally handicapped in the sense that there exist two types of model selection problems for which every penalty-based method must incur large generalization error on at least one, while CV enjoys small generalization error on both.
AFATDS&mdash;from concept evaluation to full scale development
Authors: Dale Gaumer, Ron Lawson
Venue: Proceedings of the conference on TRI-ADA '90 (1990)

Political, managerial, and technical challenges of taking a large (2M LOC) Army Ada field artillery program through major project phases and related personnel turbulence.
Constrained RTRL To Reduce Learning Rate and Forgetting Phenomenon
Authors: Fabrice Druaux, Emmanuel Rogue, Alain Faure
Venue: Neural Processing Letters (1998)

A fully connected continuous time recurrent neural network, trained by means of Real-Time Recurrent Learning, is investigated. A theoretical analysis of the output vector of the network during the training stage is performed. We point out the necessity to apply an additional constraint to the synaptic weight matrix with the intention of reducing the learning time while the forgetting is decreased. This constraint consists of updating the weights of the output cells using the output error gradient into the RTRL and a matrix of learning rates calculated from an average vector computed from the vectors previously memorized. For this first approach of the problem, only fixpoints attractors have been investigated. Some simple computational simulations validate the method.
A Construction for (t,m,s)-nets in Base q
Authors: Michael J. Adams, Bryan L. Shader
Venue: SIAM Journal on Discrete Mathematics (1997)

It has been shown that (t,m,s)-nets in base b can be characterized by combinatorial objects known as generalized orthogonal arrays. In this paper, a new construction for generalized orthogonal arrays leads to new (t,m,s)-nets in base q, q a prime power. The basic building block for the construction is an array of elements over Fq in which certain collections of rows are linearly independent. It is shown that if there exists an [n,n-m,d] q-ary code with $d\ge 6+2p$, where $p\ge 0$ is an integer, then there exists a (t,m,s)-net in base q with $t=m-(4+2p)$ and $s= \lfloor \frac{n-1}{1+p} \rfloor$.
Hardware/software partitioning for multi-function systems
Authors: Asawaree Kalavade, P. A. Subrahmanyam
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

We are interested in optimizing the design of multi-function embedded systems that run a pre-specified set of applications, such as multi-standard audio/video codecs and multi-system phones. Such systems usually have stringent performance constraints and tend to have mixed hardware-software implementations. The current state of the art in the hardware/software codesign of such systems is to design for each application separately. This often leads to application-specific sub-optimal decisions and inconsistent mappings of common nodes in different applications. We use these as the guiding principles to formulate, as a codesign problem, the design and synthesis of an efficient hardware-software implementation for a multi-function embedded system. Our solution methodology is to first identify nodes that represent similar functionality across different applications. Such "common" nodes are characterized by several metrics. These metrics are quantified and used by a hardware/software partitioning tool to map common nodes to the same resource as far as possible. We demonstrate how this is achieved by modifying a traditional partitioning algorithm (GCLP) used to partition single applications. The overall result of the system-level partitioning process is (1) a hardware or software mapping and (2) a schedule for execution for each node within the application set. On an example set consisting of three video applications, we show that the solution obtained by the use of our method is 38% smaller than that obtained when each application is considered independently.
Using agents for simulating and implementing Petri nets
Authors: Tom Holvoet, Pierre Verbaeten
Venue: Proceedings of the eleventh workshop on Parallel and distributed simulation (1997)

This paper presents a software architecture for simulating and implementing Petri nets. It is based on object-oriented techniques and autonomous agents. Object-orientation enables the adaptation and extension of the software architecture with new or alternatively defined features. Agents allow to model a net as a set of autonomous, cooperating entities. The result is a flexible and extendible framework of reusable components for efficiently implementing a large family of Petri net classes.The execution can be performed on a mono-processor, a parallel or distributed system. This is the result of using the XENOOPS execution environments for parallel applications.
Spare allocation and reconfiguration in large area VLSI
Authors: Sy-Yen Kuo, W. Kent Fuchs
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

One approach to enhancing the yield of large area VLSI is through design for yield enhancement by means of restructurable interconnect, logic and computational elements. Although extensive literature exists concerning architectural design for inclusion of spares and restructuring mechanisms in memories and processor arrays, little research has been published on optimal spare allocation and reconfiguration in the presence of multiple defects. In this paper, a summary of a systematic approach developed by the authors for spare allocation and reconfiguration is presented. Spare allocation is modeled in graph theoretic terms in which spare allocation for a specific reconfigurable system is shown to be equivalent to either a graph matching or a graph dominating set problem. The complexity of optimal spare allocation for each of the problem classes is analyzed in this paper and reconfiguration algorithms are provided.
Bounded Delay Timing Analysis of a Class of CSP Programs
Authors: Henrik Hulgaard, Steven M. Burns
Venue: Formal Methods in System Design (1997)

We describe an algebraic technique for performing timing analysis of a class of asynchronous circuits described as CSP programs (including Martin&lsquo;s probe operator) with the restrictions that there is no OR-causality and that guard selection is either completely free or mutually exclusive. Such a description is transformed into a safe Petri net with interval time delays specified on the places of the net. The timing analysis we perform determines the extreme separation in time between two communication actions of the CSP program for all possible timed executions of the system. We formally define this problem, propose an algorithm for its solution, and demonstrate polynomial running time on a non-trivial parameterized example. Petri nets with 3000 nodes and 10^16 reachable states have been analyzed using these techniques.
A Note on the Convexity of Service-Level Measures of the (R, Q) System
Authors: Linda V. Green, Peter J. Kolesar, Hongtao Zhang
Venue: Management Science (1998)

This note gives a simple proof that in a (r, q) system the average outstanding backorders andthe average stockouts per unit time are jointly convex in the two control variables q and r.
First- and Second-Order Sufficient Optimality Conditions for Bang-Bang Controls
Authors: Andrei V. Sarychev
Venue: SIAM Journal on Control and Optimization (1997)

We study $L_{1}$-local optimality of a given control $\tu$ in the time-optimal control problem for an affine control system. We start with the necessary optimality condition---the Pontryagin maximum principle, which selects the candidates for minimizers, the extremal controls. Generally the corresponding Pont\-ryagin extremals consist of bang-bang and singular subarcs, separated by switching points. In the present paper we treat only pure bang-bang extremals. We introduce extended first and second variations along a bang-bang extremal and establish first- and second-order sufficient optimality conditions for the bang-bang extremal controls.
Teaching an engineering approach for network computing
Authors: Eric Dillon, Carlos Gamboa Dos Santos, Jacques Guyard
Venue: ACM SIGCSE Bulletin (1997)

Parallelism and concurrency have long been considered as non essential during the cursus of the average programmer. However, thanks to technological advances, new promising forms of parallel computing are now appearing, e.g. "network computing", which are inexpensive and easy to use.In this paper, we present new points to focus on when teaching parallel computing, in addition to the basic principles of it, to let students be aware of problems that often arise when implementing parallel algorithms on this new architecture. Besides, we experimented a different type of exam mainly based on an exercise that had to be solved stepwise, putting the engineering students in a situation which is similar to their future job.
Use of Supercomputers in Quantitative Electron Diffraction
Authors: C. Birkeland, R. Holmestad, K. Marthinsen
Venue: Journal of Scientific Computing (1998)

The method of Quantitative Convergent Beam Electron Diffraction (QCBED) is used to study bonding effects in crystals. Because the accurate determination of electron charge densities requires extremely time consuming computations, the use of supercomputers is often necessary. In this article, we describe how the QCBED algorithm was modified to run on a parallel computer, an Intel Paragon. The implementation is based on the master-slave process and is explained in detail. For comparison, the program is also run on a state-of-the-art vector computer, a CRAY Y-MP. The performances of the two supercomputers are compared and results from a workstation are given as a reference. The parallel implementation is found successful. It demonstrates that parallelization of serial algorithms can be efficient when increasing accuracy and better performance are required.
Two for the price of one: composing partial evaluation and compilation
Authors: Michael Sperber, Peter Thiemann
Venue: ACM SIGPLAN Notices (1997)

One of the flagship applications of partial evaluation is compilation and compiler generation. However, partial evaluation is usually expressed as a source-to-source transformation for high-level languages, whereas realistic compilers produce object code.We close this gap by composing a partial evaluator with a compiler by automatic means. Our work is a successful application of several meta-computation techniques to build the system, both in theory and in practice. The composition is an application of deforestation or fusion.The result is a run-time code generation system built from existing components. Its applications are numerous. For example, it allows the language designer to perform interpreter-based experiments with a source-to-source version of the partial evaluator before building a realistic compiler which generates object code automatically.
Introduction to SIMAN
Authors: C. Dennis Pegden
Venue: Proceedings of the 17th conference on Winter simulation (1985)

This paper discusses the concepts and methods for simulating manufacturing systems using the SIMAN simulation language. SIMAN is a general purpose simulation language which incorporates special purpose features for modeling manufacturing systems. These special purpose features greatly simplify and enhance the modeling of the material handling component of a manufacturing system.