ppxscal/embedding_network huggingface dataset:
The assessment of intramural stress alignment on the beating heart in situ using micro-ergometry: functional implications
Authors: P. P. Lunkenheimer, K. Redmann, K.-H. Dietl, N. Stroh, K.-D. Richter, P. Niederer, C. Cryer
Venue: Technology and Health Care (1997)

The main local stress transmission pathways in the left ventricular base, midportion and apex in up to seven layers have been assessed in normal dog and porcine hearts, in hypertrophied dog hearts, and in three pig hearts having undergone a temporary left ventricular outflow stricture. The rotational sensitivity of needle force probes was used to determine the focal surface-parallel direction of the myocardial tension vector. In all places investigated the orientation of the force transmission pathways differs slightly from the morphologically determined fibre alignment. Vector rotation upon an axis normal to the epicardial surface is definitely tempered as compared to fibre rotation. Alterations in the force transmission pathways assessed in hypertrophied dog hearts by micro-ergometry qualitatively confirm structural remodelling in so far as an irregularity in the transmural rotation of the main stress vector was found. The measured disparities between the alignment of the myocardial fibre weave and the direction of stress transmission both in the normal and the diseased heart is widely individual, and hence, scattering of the data is marked. However, it must also be called into consideration that the measured orientation of force vectors is that at the moment of highest developed force, only. Further investigations will elucidate if discrepancies between that force vector and morphology are less pronounced when the vector is averaged over the entire heart cycle.
Reliable Resource Allocation Betvveen Unreliable Processes
Authors: S. Kumar Shrivastava
Venue: IEEE Transactions on Software Engineering (1978)

Basic error recovery problems between interacting processes are first discussed and the desirability of having separate recovery mechanisms for cooperation and competition is demonstrated. The paper then concentrates on recovery mechanisms for processes competing for the use of the shared resources of a computer system. Appropriate programming language features are developed based on the class and inner features of SIMULA, and on the structuring concepts of recovery blocks and monitors.
Notes on Shuffle/Exchange-Type Switching Networks
Authors: D. S. ,  Jr. Parker
Venue: IEEE Transactions on Computers (1980)

In this paper a number of properties of Shuffle/Exchange networks are analyzed. A set of algebraic tools is developed and is used to prove that Lawrie's inverse Omega network, Pease's indirect binary n-cube array, and a network related to the 3-stage rearrangeable switching network studied by Clos and Bene have identical switching capabilities. The approach used leads to a number of insights on the structure of the fast Fourier transform (FFT) algorithm. The inherent permuting power, or "universality," of the networks when used iteratively is then probed, leading to some nonintuitive results which have implications on the optimal control of Shuffle/Exchange-type networks for realizing permutations and broadcast connections.
Convergence of supermemory gradient method
Authors: Zhen-Jun Shi, Jie Shen
Venue: Journal of Applied Mathematics and Computing (2007)

In this paper we consider the global convergence of a new supermemory gradient method for unconstrained optimization problems. New trust region radius is proposed to make the new method converge stably and averagely, and it will be suitable to solve large scale minimization problems. Some global convergence results are obtained under some mild conditions. Numerical results show that this new method is effective and stable in practical computation.
Countermeasures Against Branch Target Buffer Attacks
Authors: Giovanni Agosta, Luca Breveglieri, Gerardo Pelosi, Israel Koren
Venue: Proceedings of the Workshop on Fault Diagnosis and Tolerance in Cryptography (2007)

Branch Prediction Analysis has been recently proposed as an attack method to extract the key from software im- plementations of the RSA public key cryptographic algo- rithm. In this paper, we describe several solutions to protect against such an attack and analyze their impact on the exe- cution time of the cryptographic algorithm. We show that the code transformations required for protection against branch target buffer attacks can be automated and impose only a negligible performance penalty.
Using Hilbert-Huang Transform to Characterize Intrusions in Computer Networks
Authors: Weihong Wang, Kai Pei, Xiaogang Jin
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

As there is a rapid rampancy of malicious intrusion, people pay more attentions to the network security. This paper presents a new method based on Hilbert-Huang Transform(HHT) to characterize intrusions that can detect many kinds of intrusion according to the number of packets. This paper demonstrates the usefulness of such a method to differentiate abnormal data from normal data. Experiments are performed using intrusion detection data sets and tested for validation. Some results are reported along with analysis and concluding remarks.
An Illustration of Current Ideas on the Derivation of Correctness Proofs and Correct Programs
Authors: D. Gries
Venue: IEEE Transactions on Software Engineering (1976)

The ideas behind correctness proofs for programs are outlined, and conventional definitions of assignment, etc., are given. The main part of this paper is the idealized development of a nontrivial program in a disciplined fashion. The use of Dijkstra's "calculus" for the formal development of programs as a guide to structuring program development is discussed in relation to the example presented.
Extending the Condor distributed systems for mobile clients
Authors: Song-Yi Yi, Miron Livny
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (1999)

Condor is a distributed batch system for sharing the workload among the computers connected by a network. Condor distributed system was developed on the basis that every machine in a Condor pool is always connected by a network to run a Condor Job. Due to advances in wireless communication and mobile computing technology, conventional distributed computer systems can now include "mobile" clients as well as "fixed" clients. Moreover, mobile users want to be as low power as possible and benefit from offloading potentially power and resource consuming jobs. In this paper, we describe the design and implementation of extended Condor to support mobile clients. The main purpose of this work is to enable users on mobile computers to interact with Condor environment any time anywhere regardless of their connection to a Condor pool. The mobile Condor distributed system also aims to provide mobile users the same Condor services without making any significant changes to the existing Condor system.
Incorporating cognitive/learning styles in a general-purpose adaptive hypermedia system
Authors: Natalia Stash
Venue: ACM SIGWEB Newsletter (2007)

Natalia Stash received her PhD from the Eindhoven University of Technology (TU/e), The Netherlands. The title of her thesis is "Incorporating Cognitive/Learning Styles in a General-Purpose Adaptive Hypermedia System". She currently participates in the CHIP project (Cultural Heritage Information Personalization) located at the Rijksmuseum in Amsterdam. Her research interests include adaptive web-based systems, semantic web technologies, learning styles, e-culture applications.
Content-level Annotation of Large Collection of Printed Document Images
Authors: A. Kumar, C. V. Jawahar
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

A large annotated corpus is critical to the development of robust optical character recognizers (OCRs). However, creation of annotated corpora is a tedious task. It is la- borious, especially when the annotation is at the character level. In this paper, we propose an efficient hierarchical approach for annotation of large collection of printed doc- ument images. We align document images with indepen- dently keyed-in text. The method is model-driven and is in- tended to annotate large collection of documents, scanned in three different resolutions, at character level. We employ an XML representation for storage of the annotation infor- mation. APIs are provided for access at content level for easy use in training and evaluation of OCRs and other doc- ument understanding tasks.
Electronic Voting
Authors: Jeremy Epstein
Venue: Computer (2007)

Computer scientists have a key role to play in ensuring that election systems meet often conflicting requirements.
Window query processing for joining data streams with relations
Authors: Kristine Towne, Qiang Zhu, Calisto Zuzarte, Wen-Chi Hou
Venue: Proceedings of the 2007 conference of the center for advanced studies on Collaborative research (2007)

Query processing for data streams raises challenges that cannot be directly handled by existing database management systems (DBMS). Most related work in the literature mainly focuses on developing techniques for a dedicated data stream management system (DSMS). These systems typically either do not permit joining data streams with conventional relations or simply convert relations to streams before joining. In this paper, we present techniques to process queries that join data streams with relations, without treating relations as special streams. We focus on a typical type of such queries, called star-streaming joins. We process these queries based on the semantics of (sliding) window joins over data streams and apply a load shedding approximation when system resources are limited. A recently proposed window join approximation based on importance semantics for data streams is extended in this paper to maximize the total importance of the approximation result of a star-streaming join. Both online and offline approximation algorithms are discussed. Our experimental results demonstrate that the presented techniques are quite promising in processing star-streaming joins to achieve the maximum total importance of their approximation results.
The Role of Associative Array Processers in Data Base Machine Architecture
Authors: P. B. Berra
Venue: Computer (1979)

With content addressing and parallel processing capabilities, associative array processors are potentially useful for data base management.
Using Hidden Semi-Markov Models for Effective Online Failure Prediction
Authors: Felix Salfner, Miroslaw Malek
Venue: Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems (2007)

A proactive handling of faults requires that the risk of upcoming failures is continuously assessed. One of the promising approaches is online failure prediction, which means that the current state of the system is evaluated in order to predict the occurrence of failures in the near future. More specifically, we focus on methods that use event-driven sources such as errors. We use Hidden Semi- Markov Models (HSMMs) for this purpose and demonstrate effectiveness based on field data of a commercial telecommunication system. For comparative analysis we selected three well-known failure prediction techniques: a straightforward method that is based on a reliability model, Dispersion Frame Technique by Lin and Siewiorek and the eventset-based method introduced by Vilalta et al. We assess and compare the methods in terms of precision, recall, F-measure, false-positive rate, and computing time. The experiments suggest that our HSMM approach is very effective with respect to online failure prediction.
The application of extension neuro-network on computer-assisted lip-reading recognition for hearing impaired
Authors: Yun-Long Lay, Chung-Ho Tsai, Hui-Jen Yang, Chern-Sheng Lin, Chuan-Zhao Lai
Venue: Expert Systems with Applications: An International Journal (2008)

Within the communication process of human beings, the speaker's facial expression and lip-shape movement contains extremely rich language information. The hearing impaired, aside from using residual listening to communicate with other people, can also use lip reading as a communication tool. As the hearing impaired learn the lip reading using a computer-assisted lip-reading system, they can freely learn lip reading without the constraints of time, place or situation. Therefore, we propose a computer-assisted lip-reading system (CALRS) for phonetic pronunciation recognition of the correct lip-shape with an image processing method, object-oriented language and neuro-network. This system can accurately compare the lip image of Mandarin phonetic pronunciation using self-organizing map neuro-network (SOMNN) and extension theory to help hearing impaired correct their pronunciation.
Recording and using provenance in a protein compressibility experiment
Authors: P. Groth, S. Miles, Weijian Fang, S. C. Wong, K.-P. Zauner, L. Moreau
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

Very large scale computations are now becoming routinely used as a methodology to undertake scientific research. In this context, 'provenance systems' are regarded as the equivalent of the scientist's logbook for in silico experimentation: provenance captures the documentation of the process that led to some result. Using a protein compressibility analysis application, we derive a set of generic use cases for a provenance system. In order to support these, we address the following fundamental questions: what is provenance? How to record it? What is the performance impact for grid execution? What is the performance of reasoning? In doing so, we define a technology-independent notion of provenance that captures interactions between components, internal component information and grouping of interactions, so as to allow us to analyze and reason about the execution of scientific processes. In order to support persistent provenance in heterogeneous applications, we introduce a separate provenance store, in which provenance documentation can be stored, archived and queried independently of the technology used to run the application. Through a series of practical tests, we evaluate the performance impact of such a provenance system. In summary, we demonstrate that provenance recording overhead of our prototype system remains under 10% of execution time, and we show that the recorded information successfully supports our use cases in a performant manner.
An Adaptive Analysis Method for Non-stationary Data_Empirical Data Decomposition
Authors: Xu Wang, Jiaxian Deng, Zicai Wang, Chengwei Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

An adaptive analysis method for non-stationary data called empirical data decomposition (EDD) is proposed in this paper. The structures and design methods for analysis filters and synthesis filters are presented. Finally, a design method for adaptive prediction filter is discussed. The analysis filter is determined automatically by the observation data, and it is not a linear filter in which the parameters are not constant. The analysis algorithm can also implement Multi-Resolution Analysis just like the wavelet transform. EDD is suitable for the decomposition of non-stationary data, and can wipe off the correlations between the observation data efficiently, so valid to describe the data with shorter symbol. Simulations are performed and the experimental results show the entropy of the coefficients produced by EDD is less than that by CDF5/3, so it is an effective analysis method for non-stationary data.
The antithrombotic effect of some EUROBIOMAT project test polymers in vivo
Authors: Maura Mhic Iomhair, S. M. Lavelle
Venue: Technology and Health Care (1996)

The antithrombotic effect of six polymers was tested by weighing the amount of thrombus formed on polymer catheters of diameters 1.45-1.7 mm inserted in rat vein for one hour, and compared to that of platinum of diameter 0.5 mm. Ten observations were made of each polymer. The order of decreasing biocompatibility in \mug thrombus/sq mm surface was polyetherurethane (14.6), polypropolene (17.9), polyvinylcloride DEHP (23.5), polyethylene (27.3), polyvinylchloride TOTM (37.8) and polymethylsiloxane (39.1). Deposit on platinum was 200 \mug/sq mm. These levels correspond to those attained by 150-333 iu heparin given intravenously, or warfarin from just inside the non-haemorrhagic (15% factor II) to the high-risk haemorrhagic range (8% factor II). Current polymer surfaces may exceed the antithrombotic biocompatibility afforded by drugs to platinum surface.
Model-based optimisation of Wastewater Treatment Plants design
Authors: A. Rivas, I. Irizar, E. Ayesa
Venue: Environmental Modelling Software (2008)

This paper presents the mathematical basis and some illustrative examples of a model-based decision-making method for the automatic calculation of optimum design parameters in modern Wastewater Treatment Plants (WWTP). The starting point of the proposed methodology is the mathematical modelling of the main processes inside a plant's units. The procedure for the automatic calculation of the design parameters is then based on expressing the optimum WWTP design problem as a Mathematical Programming (Optimisation) Problem that can be solved using a non-linear optimisation algorithm (GRG2). The paper shows how the proposed methodology is able to achieve optimum WWTP design using either a steady-state or dynamic mathematical model of the plant and a set of constraints associated with the permitted operational ranges and the required water quality in the effluent. As an illustrative example to show the usefulness of the proposed methodology, the optimum design of the Step-Feed process for nitrogen removal (Alpha) has been analysed by considering two different problems: the optimum plant dimensions, estimated at critical temperature for effluent requirements (Problem 1), and the optimum selection of facultative volumes, fractions of the influent flow-rate and the values of oxygen set-points for long-term plant operation (Problem 2). The proposed decision-making method is intended to facilitate the task of the engineers involved in the design of new WWTP, especially when the complexity of the plant requires a systematic procedure for the selection of the main design parameters.
Make Highly Clustered Grid a Small World with Shorter Diameter
Authors: Shaohua Liu, Junsheng Yu, Yuan'an Liu, Jun Wei, Peng Gao, Wei Li, Jiani Ma
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Grid is becoming an interesting and challenging environment supporting both old and new services for cooperative applications, which promote individual enterprises engaged in a collaborative community. This cooperation pressure results in an increased focus on the interconnection of member enterprises within virtual organization that necessitates the new highly scalable networking technology. Accordingly, this paper proposes the small world community for collaborative enterprises through randomly exchanging neighbors in an initially fixed regular graph. We discuss the community maintenance algorithm such as member joining and leaving, and give related complexity analysis. We also show this small world community network is high clustering, short diameter and highly scalable. Finally, we empirically evaluate the algorithm by some simulation experiments.
An OASIS Simulation of the ZNET Microcomputer Network
Authors: Brian Unger, Don Bidulock, Greg Lomow, Phil Belanger, Carol Hankins, Navindra Jain
Venue: IEEE Micro (1982)

Experience with a prototyping system reveals how it can be used to model the performance of a network's hardware and operating-system kernel-before the actual hardware is configured.
Programmer as Reader
Authors: A. Goldberg
Venue: IEEE Software (1987)

Research has focused on training programmers to write readable programs. New exploratory environmetas, like Smailtalk-80, offer improvements in system support for program reading as well as writing.
Designing NFS with RDMA for Security, Performance and Scalability
Authors: Ranjit Noronha, Lei Chai, Thomas Talpey, Dhabaleswar K. Panda
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

NFS has traditionally used TCP or UDP as the underlying transport. However, the overhead of these stacks has limited both the performance and scalability of NFS. Recently, high-performance network such as InfiniBand have been deployed. These networks provide low latency of a few microseconds and high bandwidth for large messages up to 20 Gbps. Because of the unique characteristics of NFS protocols, previous designs of NFS with RDMA were unable to exploit the improved bandwidth of networks such as InfiniBand. Also, they leave the server open to attacks from malicious clients. In this paper, we discuss the design principles for implementing NFS/RDMA protocols. We propose, implement and evaluate an alternate design for NFS/RDMA on InfiniBand, which can significantly improve the security of the server, compared to the previous design. In addition, we evaluate the performance bottlenecks of using RDMA operations in NFS protocols and propose strategies and designs that tackle these overheads. With the best of these strategies and designs, we demonstrate throughput of 700 MB/s on the OpenSolaris NFS/RDMA design and 900 MB/s on the Linux design and an application level improvement in performance of up to 50%. We also evaluate the scalability of the RDMA transport in a multi-client setting, with a RAID array of disks. Our design has been integrated into the OpenSolaris kernel.
Dynamic Activity Lifecycle Management in Ubiquitous Computing Environments
Authors: Hokyum Kim, Insuk Park, Soon J. Hyun, Dongman Lee
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

It is inherently allowed that a user engages in more than one activity at the same time. The interweave of multiple activities makes an activity have more than two states, i.e. the paused state in addition to active and inactive states and move from one state to another. In this paper, we propose an activity lifecycle man- agement scheme that enables a system to adapt the services which help a user to do an activity to the state transitions of the activity. The proposed scheme detects the interruption between activities in terms of perceiv- able effects of their associated services. The state tran- sitions of an activity driven by the interruption are handled by Event-Condition-State-Action (ECSA) pol- icy, which is extended from ECA policy. It specifies how the services should be adapted to the interruption degree how much the interrupting activity interferes the current activity as well as the state transition of an activity.
Wireless Mesh Sensor Networks in Pervasive Environment: a Reliable Architecture and Routing Protocol
Authors: Feilong Tang, Minyi Guo, Minglu Li, Yanqin Yang, Daqiang Zhang, Yi Wang
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

Wireless mesh sensor network (WMSN) merges advantages of wireless mesh networks and wireless sensor networks, especially on scalability, robustness and balanced energy dissipation. Routing in WMSNs faces with more challenges than that in traditional sensor networks on account of multiple sink nodes and the mobility of nodes. This paper 1 focuses on two challenging problems. Firstly, we propose a reliable architecture of WMSNs by deploying multiple mobile mesh nodes in each sensor network to collect sensed data, which improves the scalability and performance of WMSNs. Also, we design a routing protocol characteristic to WMSNs. The routing protocol aims at maximizing the lifetime of sensor networks by reducing total energy consumption of a sensor network, as well as balancing energy usage among sensor nodes.