ppxscal/embedding_network huggingface dataset:
Application of Adomian's approximation to blood flow through arteries in the presence of a magnetic field
Authors: K. Haldar
Venue: The Korean Journal of Computational Applied Mathematics (2003)

The present investigation deals with the application of Adomian's decomposition method to blood flow through a constricted artery in the presence of an external transverse magnetic field which is applied uniformly. The blood flowing through the tube is assumed to be Newtonian in character. The expressions for the two-term approximation to the solution of stream function, axial velocity component and wall shear stress are obtained in this analysis. The numerical solutions of the wall shear stress for different values of Reynold number and Hartmann number are shown graphically. The solution of this theoretical result for a particular Hartmann number is compared with the integral method solution of Morgan and Young [17].
XT: a bundle of program transformation tools; System description
Authors: M. Jonge, E. Visser, J. M.W. Visser
Venue:  (2001)

{\sc xt} bundles existing and newly developed program transformation libraries and tools into an open framework that supports component-based development of program transformations. We discuss the roles of {\sc xt}''s constituents in the development process of program transformation tools, as well as some experiences with building program transformation systems with {\sc xt}.
Affective computing: challenges
Authors: Rosalind W. Picard
Venue: International Journal of Human-Computer Studies (2003)

A number of researchers around the world have built machines that recognize, express, model, communicate, and respond to emotional information, instances of "affective computing." This article raises and responds to several criticisms of affective computing, articulating state-of-the art research challenges, especially with respect to affect in human-computer interaction.
Some Remarks on Linear Transform of Variables in Representation of Adders by Word-Level Expressions and Spectral Transform Decision Diagrams
Authors: Radomir S. Stankovic, Jaakko T. Astola
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

This paper discusses transforms for the reductionof complexity ofdifferent representations for binary adders described bybinary-valuedmultiple-output functions and integer-valued single-outputfunctions. For thesebit-level and word-level representations of adders, wecompare the complexityof the corresponding polynomial expressions andrelated decision diagrams. We discuss a linear transform of input variablesfor optimization of AND-OR andAND-EXOR expressions for $n$-bit adders. Therelationships of this transform tothe method for linearization ofmultiple-output switching functions through thetotal autocorrelationfunction are shown. Due to that we extend the applicationof that transformto word-level expressions for adders. We discuss the impactof this transformto the characteristics of different word-level decisiondiagrams consideredas the graphic representations of relatedword-levelexpressions.
Validating simulation-based models of conflict
Authors: Dennis J. D. Sandole
Venue: Simulation and Gaming (2003)

This article discusses the Genesis of War project, in which the author employed the PRISONERS' DILEMMA SIMULATION (PDS) to generate data on the etiology of violent conflict and war as a basis for developing theory relevant to better understanding and dealing with violent ethnic conflicts occurring in post-cold war Europe (e.g., former Yugoslavia). Given the simulation basis of the intended theory construction, there was a need to validate the simulation-generated data before going forward, made more acute by the observation that very little validation of simulation-based data seems to have been done or reported in the literature. Accordingly, a comprehensive validation of the multivariate findings generated by the use of the PDS is presented: an assessment conducted through comparisons with findings from other studies in terms of (a) direction of relationship, (b) magnitude of relationship, (c) ranking of dependent variables by proportion of variation explained, and (d) ranking of independent variables by proportion of variation explained. Across comparisons, the level of agreement between PDS and corresponding (mostly real-world) findings was not only relatively high but also consistent, basically falling within the range of the 75% norm established by Guetzkow's assessment of his INTER-NATION SIMULATION (INS). Such triangulation of findings reinforces the view that some simulations are appropriate for investigating real-world conflict processes.
A Computer Science View Obtained by Automatic Document Processing
Authors: Gerard Salton, D. Bergmark
Venue:  (1977)

Automatic document classification techniques have been widely advocated for the study of various fields of learning, the identification of individual research topics and of influential contributors in a given field, and for information storage and retrieval purposes. Several thousand research documents in computer science are automatically classified in the present study, leading to the generation of a taxonomy which reflects the state of computer science as of 1974. The popularity of various subject areas in the field is assessed, and the clustering characteristics of particular document classes and authors is given.
Real-Time Motion Analysis with Linear-Programming
Authors: Moshe Ben-Ezra, Shmuel Peleg, Michael Werman
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

A method to compute motion models in real time from point-to-line correspondences using linear programming is presented. Point-to-line correspondences are the most reliable motion measurements given the aperture effect, and it is shown how they can approximate other motion measurements as well.Using an L1 error measure for image alignment based on point-to-line correspondences and minimizing this measure using linear programming, achieves results which are more robust than the commonly used L2 metric. While estimators based on L1 are not theoretically robust, experiments show that the proposed method is robust enough to allow accurate motion recovery in hundreds of consecutive frames. The entire computation is performed in real-time on a PC with no special hardware.
Effects of Replication on Data Availability
Authors: Donald B. Johnson, Larry Raab
Venue:  (1990)

In this paper we examine the effects of replication on the availability of data in a large network. This analysis differs from previous analyses in that it compares the performance of a dynamic consistency control protocol not only to that of other consistency control protocols, but also to the performance of non-replication and to an upper bound on data availability. This analysis also differes in that we gather extensive simulations on large networks subject to partitions at realistically high component reliabilities. We examine the dynamic consistency protocol presented by Jajodia and Mutchler [9, 12] and by Long and Paris[18] along with two proposed enhancements to this protocol[10,11]. We study networks of 101 sites and up to 5050 links (fully-connected) in which all components, although highly reliable, are subject to failure. We demonstrate the importance in this realistic environment of an oft neglected parameter of the system model, the ratio of transaction submissions to component failures. We also show the impact of the number of copies on both the protocol performance and the potential of replicaion as measured by the upper bound. Our simulations show that the majority of current protocol performs optimally for topologies that yield availabilities of at least 65%. On the other hand, the availability provided by non-replicaion is inferior to that of the majority of current protocol by a most 5.9 percentage points for these same topologies. At this point of maximum difference, theprimary copy protocol yields availability 59.1% and the majority of current protocol yields availability 65.0%. We discuss the characteristics of the model limiting the performance of replication.
Delay-Insensitive Multiply-Accumulate Unit
Authors: Christian D. Nielsen, Alain J. Martin
Venue:  (1992)

No abstract available.
On temporal logic versus datalog
Authors: Irène Guessarian, Eugénie Foustoucos, Theodore Andronikos, Foto Afrati
Venue: Theoretical Computer Science (2003)

We provide a direct and modular translation from the temporal logics CTL, ETL, FCTL (CTL extended with the ability to express fairness) and the Modal µ-calculus to Monadic inf-Datalog with built-in predicates. We call it inf-Datalog because the semantics we provide is a little different from the conventional Datalog least fixed point semantics, in that some recursive rules (corresponding to least fixed points) are allowed to unfold only finitely many times, whereas others (corresponding to greatest fixed points) are allowed to unfold infinitely many times.We characterize the fragments of Monadic inf-Datalog that have the same expressive power as Modal Logic (resp. CTL, alternation-free Modal µ-calculus and Modal µ-calculus). Our translation is interesting because it is direct and succinct. Moreover the fragments of Monadic inf-Datalog that we have exhibited have very simple syntactic characterizations as subsets of what we call Modal inf-Datalog programs.
Running a job on a collection of dynamic machines, with on-Line restarts
Authors: Rob Stee, J. A. L Poutre
Venue:  (1998)

We consider the problem of running a job on a selected machine of a collection of machines. Each of these machines may become temporarily unavailable (busy) without warning, in which case the scheduler is allowed to restart the job on a different machine. The behaviour of machines is characterized by a Markov chain, and objective is to minimize completion time of the job. For several types of Markov chains, we present optimal policies.
Nomadic Radio: A Spatialized Audio Environment for Wearable Computing
Authors: Nitin Sawhney, Chris Schmandt
Venue: Proceedings of the 1st IEEE International Symposium on Wearable Computers (1997)

This paper describes an on-going research project at the MIT Media Lab, exploring the use of auditory I/O as a primary interaction modality for wearable computing. Nomadic Radio is a framework developed for use on a wearable audio platform. It presents timely information and permits communication within a spatialized audio environment. The contextual state of the user indicated by time of day, physical positioning, scheduled tasks, and message content, is used to model information presented in the user's listening space. We are evaluating techniques for the design of spatial audio streams, speech I/O, and auditory cues in the interface. Issues related to asynchronous communication and peripheral awareness are also being considered.
Traffic shaping of a tagged stream in an ATM network: approximate end-to-end analysis
Authors: R. Landry, I. Stavrakakis
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

Traffic streams-originally shaped to comply with desired traffic descriptors-may suffer substantial distortion within an ATM network due to statistical multiplexing. As a consequence, traffic re-shaping within the network may be necessary. In this work the modification of a tagged traffic stream due to a series of multiplexing operations is studied. The standard FCFS service policy, as well as a peak-rate enforcing multiplexing discipline, are considered. Tagged cell delay, jitter and inter-departure processes are considered for the characterization of the tagged traffic stream.
Ultimate load carrying capacity of long-span steel arch bridges
Authors: J. Cheng, J.-J. Jiang, R.-C. Xiao, H.-F. Xiang
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper investigates the ultimate load carrying capacity of a long-span steel arch bridge up to failure and evaluates the overall safety of the bridge. The example bridge is a long-span steel arch bridge with a 550 m-long central span under construction in Shanghai, China. Ultimate load carrying capacity of the bridge is investigated using three methods. Comparisons of the accuracy and reliability of the three methods are given. A parametric study is conducted to investigate the effects of various parameters on the ultimate load-carrying capacity of the bridge. The results show that the distribution pattern of live load and yield stresses of material have important effects on bridge behaviour.
A Cyclic Scheduling for Relative Timing Requirements
Authors: Sheng-Tzong Cheng, Chia-Mei Chen
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

We consider the scheduling problem for periodic tasks with relative timing requirements. Specifically, the timing constraints imposed on the consecutive executions of a task and the inter-task temporal constraints across task periods are considered. A pre-run-time timing analysis technique is applied to the set of tasks. A schedule is generated in which the length of the schedule is the least common multiple (LCM) of all periods. Experiments are conducted to evaluate the performance of the algorithm.
Modifying a Rank-revealing ULLV Decomposition
Authors: James L. Lebak, Adam W. Bojanczyk
Venue:  (1994)

The rank-revealing ULLV decomposition of two matrices is intended for use in recursive applications in signal processing. The decomposition provides a size estimate and a basis for the noise subspace associated with two matrices. In this paper, methods for modifying and maintaining the rank-revealing nature of the decomposition are presented for situations where rows are being added to the decompostion (updating) or deleted from the decomposition (downdating). Two methods for updating are included. Downdating has two steps, the expansion step and the modification step. Two expansion step methods, the method of corrected semi-normal equations (CSNE) and classical Gram-Schmidt with re-orthogonalization (CGSR) are presented, along with two methods for the modification step. Numerical tests and operation counts are presented for various combinations of methods. The results show that the noise subspace presented by the modified decomposition may not be very accurate. The CGSR downdating method appears to provide a more accurate noise subspace in some cases, but it requires more work than the CSNE downdating method because of the requirement of maintaining an additional orthogonal matrix.
Compiler Optimizations for I/O-Intensive Computations
Authors: Mahmut Kandemir, Alok Choudhary, J. Ramanujam
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

This paper describes transformation techniques for out-of-core programs (i.e., those that deal with very large quantities of data) based on exploiting locality using a combination of loop and data transformations. Writing efficient out-of-core program is an arduous task. As a result, compiler optimizations directed at improving I/O performance are becoming increasingly important. We describe how a compiler can improve the performance of the code by determining appropriate file layouts for out-of-core arrays and finding suitable loop transformations. In addition to optimizing a single loop nest, our solution can handle a sequence of loop nests. We also show how to generate code when the file layouts are optimized. Experimental results obtained on an Intel Paragon distributed-memory message-passing multiprocessor demonstrate marked improvements in performance due to the optimizations described in this paper.
Standard Cell Library Characterization for Setting Current Limits for IDDQ Testing
Authors: Steven D. Millman, John M. Acken
Venue: Proceedings of the 1996 IEEE International Workshop on IDDQ Testing (IDDQ '96) (1996)

Industry needs to move from a separate step of design for test to solving test issues as an integral part of the design process. The linking of design and test is also needed for IDDQ testing, which is required for high quality products. A key issue is how to set the IDDQ current limit to detect defective parts without rejecting defect-free parts. Increasing design efforts for accurate standard cell library characterization, especially with respect to power, provide the answer. This paper describes a method for setting the IDDQ limit based upon cell library characterization. Additionally, the method for iterating in on the final values is reviewed and contrasted with the benefits of the new method.
Adaptive holding policies for IP over ATM networks
Authors: C. Lund, S. Phillips, N. Reingold
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

Next generation wide area networks will be connection-oriented, with data-link layer connectivity being provided by asynchronous transfer mode (ATM). For the huge existing investment in current IP networks such as the Internet to remain useful, one must devise mechanisms to carry IP traffic over ATM networks. A fundamental issue is to devise holding policies for virtual circuits carrying datagrams. The authors consider two pricing schemes, the first is a likely pricing scheme of future ATM networks, while the second is based on characteristics of current networks. For each pricing scheme, the authors devise a simple holding policy that adapts to the characteristics of the IP traffic. The authors simulate their policies on actual network traffic and find that they perform significantly better than previous policies.
Critical Infrastructures You Can Trust: Where Telecommunications Fits
Authors: Fred B. Schneider, Steven M. Bellovin, Alan S. Inouye
Venue:  (1998)

This paper discusses two NISs: the public telephone network (PTN) and the Internet. Being themselves large and complex NISs, they not only merit study in their own right but can help us to understand some of the technical problems faced by the developers and operators of other NISs. In addition, the high cost of building a global communications infrastructure from the ground up implies that one or both of these two networks is likely to furnish communications services for most other NISs. Therefore, an understanding of the vulnerabilties of the PTN and Internet informs the assessment of the trustworthiness of other NISs. Ideas for improving the trustworthiness of the PTN and Internet are also proposed, both for the short-term (by improved use of existing technologies and procedures) and for the long-term (by identifying some areas where the state-of-the-art is inadequate and research is therefore needed). Finally, some observations are offered about Internet telephony and the use of the Internet for critical infrastructures.
Global Resource Director (GRD): Customer Scenarios for Large Multiprocessor Environments
Authors: Fritz Ferstl
Venue: Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing (1999)

Genias Global Resource Director (GRD) was developed to meet the demands of large multiprocessor sites with several 100s of CPUs and users. At the Army Research Laboratory (ARL) and at BMW, GRD is installed on several types of Cray and SGI machines. This paper will describe how GRD integrates such resources into one environment automatically managed by global resource utilization policies. Benefits that the sites achieved in using GRD such as avoiding over-subscription of resources, automated management and utilization monitoring will also be discussed. In addition, an overview will be provided on the groundbreaking functionality of GRD which features a ticketing system based distribution of resource shares combined with on- line control of the CPU utilization of running jobs (also known as is dynamic scheduling). The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Logic for Correct Program Development
Authors: Joseph L. Bates
Venue:  (1981)

Existing verification technology, though theoretically adequate, is not directly applicable to the construction of large software systems. This thesis explores the view that reasoning about code is not the proper paradigm for correct program development. Instead, specifications should be the objects of study and a logic should be formulated for constructively proving that specifications have acceptable implementations; from these proofs code may be extracted. Thus, constructive existence proofs become the programmer''s main concern, while executable text is seen as a valuable by-product of correct reasoning which cannot be produced from incorrect reasoning. The thesis captures this view of program development in a logic for the formal refinement of specifications. Specifications are written in an imperative notation of generalized assignment; they allow calculations in integer arithmetic and finite set theory. Classical reasoning techniques are shown inconsistent in this domain (where propositions may claim the constructive existence of programs), hence an alternative logic is developed based on intuitionistic reasoning. Proofs in this constructive refinement logic are trees, stylistically similar to those of Gerhard Gentzen''s sequent calculus. It is argued that while linear proofs are appropriate when reasoning is developed and presented on paper, hierarchical proofs are appropriate when reasoning is developed and presented with machine aid. A mechanism is described that extracts correct codes from valid proofs; its existence assures the consistency of the logic. Finally, several code optimization techniques are examined and applied to code extracted from sample proofs. The thesis concludes with a discussion of the expounded view of correct program development, suggestions for a program development system based on this view, and a look at the numerous research problems remaining in this area.
Verifying a smart design of TCAP; A synergetic experience
Authors: Thomas H.J.J. Arts, Izak A. Langevelde
Venue:  (1999)

An optimisation of the SS No.\ 7 Transport Capabilities Procedures is verified by specifying both the original and the optimised {\scriptsize \sf TCAP} in {\scriptsize \sf $\mu$CRL}, generating transition systems for both using the {\scriptsize \sf $\mu$CRL} tool set, and checking weak bisimulation equivalence of the two using the C{\ae}sar/Ald\''{e}baran tool set, these steps being part of a iterative process of specification, refinement and verification. As a result, the optimisation design is debugged, a deeper understanding of the protocol is gained, and the usability of the {\scriptsize \sf $\mu$CRL} tool set is evaluated. In conclusion, the design of an optimised {\scriptsize \sf TCAP} indeed benefitted from the verification reported here, and {\scriptsize \sf $\mu$CRL} and C{\ae}sar/Ald\''{e}baran appeared to be a largely adequate combination for the verification at hand; however, since the characteristics of {\scriptsize \sf TCAP} were not explicit from the start, and the tools used covered the functionality required not perfectly, the verification required a good deal of human ingenuity and stamina.