ppxscal/embedding_network huggingface dataset:
Preliminary Instrumentation for the Efficient Use of Web-Based Electronic Health Records
Authors: Sydney Henrard
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

NIST has devised preliminary elements (technical "hooks") of a convenient logging methodfor Web-based electronic health record (EHR) dialogues. These can identify fields, recordtimes spent at each (by whomever), and log a sequence of visits. The next step will be to refine this promising start, to begin building upon it a more polished and user-friendly system. We present our results to gain impressions from users of the worth of simple, open tools for tuning and improving e-record flows and their corresponding with practice workflows.
Requirements for Workflow Modeling in P2P-Workflows Derived from Collaboration Establishment
Authors: Andreas Wombacher, Karl Aberer
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Web services advocate loosely coupled systems, although current applications are limited to centrally controlled structures. The reason for this limitation is the lack of a method for deciding collaboration consistency, that is deadlock freeness and boundedness, in a decentralized way. In particular, an intuitive approach classifies collaborations incorrectly being inconsistent due to the loss of information introduced by the decentralization. In this paper we identify loss of message ordering and message parameter value constraints caused by the decentralization to be the reasons for incorrect decision results. The proposed approach to overcome this issue is to explicate these constraints, which cannot represented in common work-flow models.
Hypergraph matching complexes and Quillen complexes of symmetric groups
Authors: John Shareshian
Venue: Journal of Combinatorial Theory Series A (2004)

We investigate Quillen complexes of symmetric groups using hypergraph matching complexes and p-cycle complexes. We determine the homotopy type of the Quillen complex of S3p at the prime p. We show that there is torsion in the homology of the Quillen complex of S13 the prime 3, thereby providing the first example of a Quillen complex of a finite group whose homology is not free.
Neural Learning from Unbalanced Data
Authors: Yi L. Murphey, Hong Guo, Lee A. Feldkamp
Venue: Applied Intelligence (2004)

This paper describes the result of our study on neural learning to solve the classification problems in which data is unbalanced and noisy. We conducted the study on three different neural network architectures, multi-layered Back Propagation, Radial Basis Function, and Fuzzy ARTMAP using three different training methods, duplicating minority class examples, Snowball technique and multidimensional Gaussian modeling of data noise. Three major issues are addressed: neural learning from unbalanced data examples, neural learning from noisy data, and making intentional biased decisions. We argue that by properly generated extra training data examples around the noise densities, we can train a neural network that has a stronger capability of generalization and better control of the classification error of the trained neural network. In particular, we focus on problems that require a neural network to make favorable classification to a particular class such as classifying normal(pass)/abnormal(fail) vehicles in an assembly plant. In addition, we present three methods that quantitatively measure the noise level of a given data set. All experiments were conducted using data examples downloaded directly from test sites of an automobile assembly plant. The experimental results showed that the proposed multidimensional Gaussian noise modeling algorithm was very effective in generating extra data examples that can be used to train a neural network to make favorable decisions for the minority class and to have increased generalization capability.
Two functional equations
Authors: Maohua Le
Venue: Smarandache Notions Journal (2004)

In this paper we solve two problems concerning the pseqdo Smarandache function.
The superstructure toward open bioinformatics grid
Authors: Akihiko Konagaya, Fumikazu Konishi, Mariko Hatakeyama, Kenji Satou
Venue: New Generation Computing (2004)

The grid design strongly depends on not only a network infrastructure but also a superstructure, that is, a social structure of virtual organizations where people trust each other, share resources and work together. Open Bioinformatics Grid (OBIGrid) is a grid aimed at building a cooperative bioinformatics environment for computer sicentists and biologists. In October 2003, OBIGrid consisted of 293 nodes with 492 CPUs provided by 27 sites at universities, laboratories and other enterprises, connected by a virtual private network over the Internet. So many organizations have participated because OBIGrid has been conscious of constructing a superstructure on a grid as well as a grid infrastructure. For the benefit of OBIGrid participants, we have developed a series of life science application services: an open bioinformatics environment (OBIEnv), a scalable genome database (OBISgd), a genome annotation system (OBITco), a biochemical network simulator (OBIYagns), and to name a few.
Security Concern of Legally Sensitive Web Portals
Authors: Hannakaisa Isomaki, Sonja Hof
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

In contemporary information society the use of fundamental rights is increasingly focused on the use of web information systems (IS). Therefore, legal aspects regulating users' rights and commitments should be given more attention in the development of IS. Mainly the section data protection and securing the integrity of IS systems should mainly be considered. The purpose of this paper is to present research in progress and to add some security related observations. As a result this paper gives some different viewpoints for the design and implementation of legally sensitive web portals and builds up a concept to improve such systems.
A finite element approach and experiments to assess the effectiveness of hip protectors
Authors: K.-U. Schmitt, A. B. Spierings, S. Derler
Venue: Technology and Health Care (2004)

The potential of hip protectors to prevent femur fracture is addressed in this study. A mechanical model of the human hip was developed and used to perform impact tests with different types of hip protectors. In addition a finite element model of the test device was established which allows simulations of the impact tests. The different principles of energy-shunting systems and energy-absorbing systems were demonstrated. Furthermore misplacement of a hip protector can be simulated. Hence the FE model was shown to be a suitable tool for future hip protector design.
Adaptive control algorithms for decentralized optimal traffic engineering in the internet
Authors: Constantino M. Lagoa, Hao Che, Bernardo A. Movsichoff
Venue: IEEE/ACM Transactions on Networking (TON) (2004)

In this paper, we address the problem of optimal decentralized traffic engineering when multiple paths are available for each call. More precisely, given a set of possible paths for each call, we aim at distributing the traffic among the available paths in order to maximize a given utility function. To solve this problem, we propose a large family of decentralized sending rate control laws having the property that each of the members of this family "steers" the traffic allocation to an optimal operation point. The approach taken relies on the control theory concept of Sliding Modes. These control laws allow each ingress node to independently adjust its traffic sending rates and/or redistribute its sending rates among multiple paths. The only nonlocal information needed is binary feedback from each congested node in the path. The control laws presented are applicable to a large class of utility functions, namely, utility functions that can be expressed as the sum of concave functions of the sending rates. We show that the technique can be applied not only to usual rate adaptive traffic with multiple paths, but also to rate adaptive traffic with minimum service requirements and/or maximum allowed sending rate and to assured service with targeted rate guarantee, all allowing for multiple paths. It is also shown that these control laws are robust with respect to failures; i.e., they automatically reroute traffic if a link failure occurs. Finally, we provide some insight on how to choose the "right" control law. In particular, we provide a way of choosing a member of the family of control laws that reduces the sending rate oscillation caused by implementation constraints like delays and quantization. An example of application of the approach delineated in this paper is also presented. This example provides some insights on the implementation aspects and illustrates the robustness of the control laws developed in this paper.
A Protocol for "Combination-Web-Shopping"
Authors: Mona Marathe, Hemalatha Diwakar
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

"Combination-Shopping" wherein individuals seek to buy matched and coordinated combinations possibly from different commercial enterprises, is a common occurrence in every day life. With e-commerce gaining ground there is a need to provide a solution to a new category of problems in E-Commerce, which addresses the need of "single buyer of multiple items from multiple sellers", or multiple Businesses transacting simultaneously with a single Customer (mB2C). "Combination-Web-Shopping" deals with the problem of purchasing a set of items, comprising a combination from a set of distinct web shops in one transaction. As a solution the Combination-Web-Shopping protocol is proposed, which is implemented as a Message-based Centralized Workflow Application residing at a mediator. The complete workflow specification is also described.
Runtime Management of Quality Specification for QoS-Aware Components
Authors: Miguel A. de Miguel, M. Teresa Higuera
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

Currently, the interface description languages in component infrastructures provides support for the description of functional properties, and structures such as deployment descriptors provide support to configure some specific extra-functional aspects (e.g. persistence, security, transactions). But the infrastructures do not provide support for the description and management of general QoS (e.g. latencies, reliability, and availability). Currently there are available some approaches to solve this problem. In this paper we propose some solutions to integrate the QoS specification of model driven approaches and infrastructures for components. The component reuses this information for QoS management purposes. In our approach, QoS-aware models and infrastructures use compatible QoS specification languages. In component infrastructures, basic structures such as containers are good candidates to integrate the QoS management tasks (e.g. negotiation, adaptation and monitoring). Management tasks access to QoS repository to get information, evaluate expressions, and test monitored values. The QoS Specification Repository handles the QoS information and provides some basic operations (e.g. evaluation of constraints and introspection for adaptation).
Split algorithms for skewsymmetric Toeplitz matrices with arbitrary rank profile
Authors: Georg Heinig, Karla Rost
Venue: Theoretical Computer Science (2004)

Split Levinson-type and Schur-type algorithms for the solutions of linear systems with a nonsingular skewsymmetric Toeplitz matrix are designed. In contrast to previous ones, the algorithms work for any nonsingular skewsymmetric Toeplitz matrix. Moreover, generalizations of ZW- and WZ-factorizations of skewsymmetric Toeplitz matrices related to the new split algorithms are presented.
Why PCs Are Fragile and What We Can Do About It: A Study of Windows Registry Problems
Authors: Archana Ganapathi, Yi-Min Wang, Ni Lao, Ji-Rong Wen
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

Software configuration problems are a major sourceof failures in computer systems. In this paper, we presenta new framework for categorizing configurationproblems. We apply this categorization to WindowsRegistry-related problems obtained from variousinternal as well as external sources. Althoughinfrequent, Registry-related problems are difficult todiagnose and repair. Consequently they frustrate theusers. We classify problems based on their manifestationand the scope of impact to gain useful insights into howproblems affect users and why PCs are fragile. We thendescribe techniques to identify and eliminate suchRegistry failures. We propose health predicatemonitoring for detecting known problems, fault injectionfor improving application robustness, and accessprotection mechanisms for preventing fragility problems.
Efficient Hierarchic Management For Reconfiguration of Networked Information Systems
Authors: Jonathan C. Rowanhill, Philip E. Varner, John C. Knight
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

The management of modern distributed systems is complicatedby scale and dynamics. Scalable, decoupled communicationestablishes flexible, loosely coupled componentrelationships, and these relationships help meet the presentdemands on management. However, traditional decoupledaddressing mechanisms tend to focus the addressing on onlyone of the parties involved in communication while, in general,a communication relationship involves a sender, communicatedcontent, and receivers. The state of all three aresimultaneously relevant to correctness of a managementrelationship and its communications. We introduce SelectiveNotification, a scalable, decoupled event disseminationarchitecture supporting simultaneous and combinedaddressing of senders, receivers, and events. We demonstrateits application to programming dynamic, scalablemanagement relationships. We then discuss its implementation,and present measurements of its effective capabilities.
The many faces of accessibility: engineers' perception of information sources
Authors: Raya Fidel, Maurice Green
Venue: Information Processing and Management: an International Journal (2004)

Numerous studies of engineers' information seeking behavior have found that accessibility was the factor that influenced most their selection of information sources. The concept of accessibility, however, is ambiguous and was given various interpretations by both researchers and engineers. Detailed interviews with 32 engineers, in which they described incidents of personal information seeking in depth, uncovered some of the specific factors that are part of the concept. Engineers selected sources because they had the right format, the right level of detail, a lot of information in one place, as well as for other reasons. When looking for human information resources, the engineers most frequently selected sources with which they were familiar, while saving time was the most frequently mentioned reason for selecting documentary sources. Future research should continue to examine the concept of accessibility through detailed empirical investigations.
Selected Spatio-Temporal Data Types and Operations for a 3D/4D Geological Information System
Authors: Jorg Siebeck, Serge Shumilov, Armin B. Cremers, Martin Breunig, Andreas Thomsen
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

The management of the evolution in time of large andcomplex 3D-models is not a trivial task and may largelysurpass the data volume and complexity of conventionalGIS. 3D objects changing in time have to be retrieved,inserted, processed and updated. It requires thedevelopment of application-specific spatio-temporal datatypes and operations. In this paper we present the designand the realisation of spatio-temporal data types andoperations to be used in a typical 3D/4D-geologicalinformation system, and we give an outlook on our furtherresearch in the field of distributed spatio-temporalgeoinformation systems.
Joint determination of machine cells and linear intercell layout
Authors: Chih-Ping Chiang, Shine-Der Lee
Venue: Computers and Operations Research (2004)

The joint problem of manufacturing cell formation and its layout assignment is addressed in this paper, where machine cells are to be located along the popular bi-directional linear layout. The objective is to minimize the intercell flow cost trader the cell size constraint, instead of the typical goal to minimize the number of intercell movements. An enhanced simulated annealing approach augmented with dynamic programming algorithm is developed, where the machine cells and their respective locations in the layout are simultaneously determined by dynamic programming. Consequently, the optimal number of machine cells is obtained by the problem structure, instead of a prior specification in most of the literature. The enhanced procedure is illustrated by an example and additional experiments, with data adapted from the literature, are performed to demonstrate the viability of the approach.
A neural simulation system based on biologically realistic electronic neurons
Authors: S. Renaud-Le Masson, G. Le Masson, L. Alvado, S. Saïghi, J. Tomas
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2004)

This paper describes an original neural simulation platform designed as a tool for computational neuroscience. The system, based on artificial electronic neurons implemented in specific integrated circuits, computes in real-time and emulates in analogue mode the electrical activity of single neurons or small neural networks. Neurons are modelled using a biologically realistic description of membrane excitability and synaptic connectivity. The characteristics of the simulator are discussed and simulation examples are presented, including the implementation of "hybrid networks", where living neurons and artificial one are interacting in real-time in a mixed neural network.
Switched LAN simulation by colored petri nets
Authors: D. A. Zaitsev
Venue: Mathematics and Computers in Simulation (2004)

The methodology of switched LAN models construction in the form of colored Petri net is introduced. For the simulation and analysis of the model the Design/CPN tool is used. The tasks of estimation of LAN switch's buffer size and network response time were solved. The components of the model are switches, servers, and workstations.
Controllability Problems for Differential Gompertzian Dynamic Equations
Authors: A. G. Nakonechnyi, V. P. Martsenyuk
Venue: Cybernetics and Systems Analysis (2004)

Control problems are considered in the class of differential Gompertzian dynamics equations. Controllability conditions in the nonstationary case are formulated. A general form of a controller for a stationary system and of a scalar controller are obtained in generalized functions. Criteria for different cases of convex closed control sets are presented.
Many Valued Probability Theory
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

The apparent conflict between many valued logic andprobability theory is resolved if we treat the probabilityof a sentence as the probability that the sentence hassome specified truth value. The classical probability ofa sentence is the probability that the sentence isclassically true. In an analogous way, we develop aclass of probability theories appropriate for any finitevalued logics; the probability of a sentence isinterpreted as the probability that the sentence takessome value in a specified subset of the semantic range.We show that for any finite valued logic, there is anappropriate many valued probability theory providinga characteristic probabilistic semantics for which thelogic is both sound and complete.
Parallelization of Bayesian Network based SNPs Pattern Analysis and Performance Characterization on SMP/HT
Authors: Justin Song, Eric Li, Wei Hu, Steven Ge, Chunrong Lai, Yimin Zhang, Xuegong Zhang, Wenguang Chen, Weimin Zheng
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

Single Nucleotide Polymorphisms (SNPs) is subtle variation in a genomic DNA sequence ofindividuals of the same species. It plays a key role in the pharmaceutical industry to understand variations in drug treatment responses betweenindividuals at the molecular level. Discovering patterns around SNPs loci is very important forbetter understanding the possible origin of SNPs in evolution. Bayesian network has been applied to this problem and got promising results. Since Bayesian Network based SNPs pattern analysis demonstrates high computational complexity, weparallelized this workload on Intel Xeon SMP systems. SNPs' task level parallelism is exploited. Experiment results show that memory is bottleneck: on 8-way Xeon SMP Hyper-Threading enabled system, system memory bandwidth is fullysaturated and memory load access latency is roughly 50% longer than on single processorsystem. Another interesting result is that Intel's Hyper-Threading Technology helps improve the multi-threaded workload's performance by 1.6X speedup. Workload profiling shows that parallel SNPs' data sharing nature matches Hyper-Threading'scache sharing mechanism, and thus greatly reduces cache coherency protocol traffic onshared front side bus. Scalability analysis shows that imbalance and locks are two major factors that may limit the parallel workload speedup on more processor platforms.
BPAP: A Computational Tool for Whole Genome Analysis and Annotation
Authors: Barrett Abel, Martin Gollery
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Since the genesis of the Human Genome Project, more than 100 genomes have been sequenced, and over 1000 genomes are expected to be sequenced in the next decade. With the advent of this extensive repertoire of raw sequence information, the next major challenge for a modern researcher is to interpret this wealth of information. At the remarkable rate of progress that is being made in sequencing organisms, experimental research techniques alone cannot keep up with the influx of genomic information. As a powerful complementary approach to experimental techniques, computational sequence analysis can assist in the categorization, characterization and creation of a functional definition of protein sequences. Our efforts have produced a biological protein analysis pipeline that can characterize proteins and attempts to produce working hypothesis of the functional and characteristic nature of a protein in a high throughput, automated manner with a minimum of amount of operational complexity for the user.
{\text{\{ 2}}^{\text{n}} + 1,2^{n + k} ,2^n - 1\}: A New RNS Moduli Set Extension
Authors: Ricardo Chaves, Leonel Sousa
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

The increasing usage of Residual Number System (RNS) in signal processing applications demands the development of new and more adaptable RNS moduli sets and arithmetic units.This paper presents a new adaptable moduli set extension for the traditional moduli set {\text{\{ 2}}^{\text{n}}+ 1,2^n ,2^n- 1\}. As it will be shown, this new moduli set extension{\text{(\{ 2}}^{\text{n}}+ 1,2^{n + k} ,2^n- 1\} )allows the balancing of the binary channel ({\text{2}}^{{\text{n + k}}} ) in relation to the other two channels.Moreover, it does not require the development of new addition and multiplication units, since it is possible to reuse the already developed and well studied units for these moduli operations.