waashk/dblp huggingface dataset:
health level-7 compliant clinical patient records system. we present the design and implementation of a health level-7 (hl7)-compliant web-based clinical patient records system (cprs). hl7 is one of the leading standards for exchange of clinical and administrative data among healthcare information systems. since the passage of the health insurance portability and accountability act of 1996 (hipaa) by us government, the security of electronic medical clinical records systems is of paramount importance. hipaa requires that various technical, physical and administrative security measures be combined to protect the privacy, integrity, and availability of patients' clinical records. the hl7 standard for clinical documents, clinical document architecture (cda), incorporates the hipaa guidelines. our cprs data schema is derived from cda that makes it naturally in compliance with the hipaa guidelines.cprs provides a unique web based interface for the caregivers to browse and edit universal patient records (upr) of their patients. to our knowledge, cprs is one of the first applications that have implemented an hl7-compliant upr. using cprs caregivers can access and edit the clinical documents of their patients from anywhere in the world.
formal verification of replication on a distributed data space architecture. we investigate the formal verification of safety-critical systems on top of the distributed data space architecture splice. in splice each component has its own local data space which can be kept small using keys, time stamps and selective over-writing. we use two complementary formal tools: first the &micro;crl tool set for a rapid investigation of alternatives by a limited verification with state space exploration techniques; next the most promising solutions are verified in general by means of the interactive theorem prover of pvs. these formal techniques are used to investigate transparent replication of certain components on top of splice. we prove that a convenient solution can be obtained by means of a slight extension of the write primitive of splice.
effective rule induction from labeled graphs. labeled graphs provide a natural way of representing objects and the way they are connected. they have various applications in different fields, such as for example in computational chemistry. they can be represented by relational structures and thus stored in relational databases. acyclic conjunctive queries form a practically relevant fragment of database queries that can be evaluated in polynomial time. we propose a top-down induction algorithm for learning acyclic conjunctive queries from labeled graphs represented by relational structures. the algorithm allows the use of building blocks which depend on the particular application considered. to compensate for the reduced expressive power of the hypothesis language and thus the potential loss in predictive performance, we combine acyclic conjunctive queries with confidence-rated boosting. in the empirical evaluation of the method we show that it leads to excellent prediction accuracy on the domain of mutagenicity.
hierarchical nonlinear constraint satisfaction. constraint programming is a method of problem solving that allows declarative specification of relations among objects. it is important to allow preferences of constraints since it is often difficult for programmers to specify all constraints without conflicts. in this paper, we propose a numerical method for solving nonlinear constraints with hierarcical preferences (i.e., constraint hierarchies) in a least-squares manner. this method finds sufficiently precise local optimal solutions by appropriately processing hierarchical preferences of constraints. to evaluate the effectiveness of our method, we present experimental results obtained with a prototype constraint solver.
a high-dimensional approach to interactive graph visualization. graph layout is an information visualization technology for illustrating relations between objects. interactive graph layout is often important since it is difficult to statically lay out complex graphs such as general undirected graphs. in this paper, we propose a novel approach to interactive layout of general undirected graphs. the basic idea of our approach is to use static graph layouts in high-dimensional spaces to dynamically find two-dimensional layouts according to user interaction. the resulting method that we present exhibits the following two characteristics: (1) it efficiently updates two-dimensional graph layouts during user interaction; (2) it follows users' node dragging operations by actively moving other closely related nodes. our method adopts eigenvector-based multidimensional scaling to compute high-dimensional graph layouts, and performs constraint satisfaction to determine appropriate two-dimensional planes onto which the high-dimensional layouts will be projected.
solving linear and one-way constraints for web document layout. the development of information systems such as web browsers based on open standards is becoming more and more important. to clearly formalize and appropriately implement document layout methods for web browsers, researchers have proposed an approach that uses constraint programming and solving. however, it is still difficult for existing standard constraint solving techniques to handle web document layout methods. to tackle this problem, we propose a new algorithm called duplex that solves hybrid systems of linear constraints and one-way constraints.
immunity-based intrusion detection system design, vulnerability analysis, and genertia's genetic arms race. the genertia red team uses a genetic algorithm to perform vulnerability analysis in an effort to discover holes in an intrusion detection system. this paper demonstrates how a genertia blue team generates detectors to patch those holes discovered by the grt. the gbt uses a novel approach to generate detectors that have different coverage in order to reduce the amount of overlap of detectors created by random generation and negative selection.
efficient on-line identification of hot data for flash-memory management. hot-data identification for flash-memory storage systems not only imposes great impacts on flash-memory garbage collection but also strongly affects the performance of flashmemory access and its life time (due to wear-levelling). in this research, we propose a highly efficient method for online hot-data identification with limited space requirements. different from the past work, multiple independent hash functions are adopted to reduce the chance of false identification of hot data and provide predictable and excellent performance for hot-data identification. we not only propose an efficient implementation of the proposed framework but also conduct a series of experiments to verify the performance of the proposed method, in which very encouraging results are presented.
admire: an algebraic approach to system performance analysis using data mining techniques. system performance analysis is a very difficult problem. traditional tools rely on manual operations to analyze data. consequently, determining which system resources to examine is often a lengthy process, where many problems are elusive, even when using data mining tools. we address this problem by introducing the analyzer for data mining results (admire) technique as a natural and flexible means to further interpret data mining outcome. in our scheme, regression analysis is first applied to performance data to discover correlations between parameters. regression rules are defined to represent this output in a format suitable for admire. admire expressions are then used to manipulate these sets of rules, revealing information about combined, common and different features of varying configurations. this knowledge would be unavailable if regression output were considered in isolation. admire was tested with performance data collected from a tpc-c (transaction processing performance council) test on an oracle database system, under various configurations, to demonstrate the effectiveness of our technique.
overlay multicast for video on demand on the internet. patching is an attractive technique for building efficient video-on-demand systems. however, since patching assumes the existence of ip multicast, implementing patching on the current internet is a challenging task because the internet is based on ip unicast only. in this paper, we propose an overlay technique called vcast for enabling multicast services on the application layer, as a way to support the implementation of patching. unlike earlier overlay multicast schemes, vcast does not introduce any global topology for the overlay and therefore avoids control overhead to maintain it. vcast can configure itself adaptively to the changing network traffic, and is tolerant to failures prone to happen frequently in dynamic environments such as the internet. in addition, vcast provides load balancing among network nodes by employing the round-robin approach in selecting delivery paths for clients.
grid-enabled parallel divide-and-conquer: theory and practice. this paper presents a general methodology for the communication-efficient parallelization of graph algorithms using the divide-and-conquer approach. the algorithm is communication-free in the conquer stage and uses only a small amount of messages while partitioning the input. specifically, a practical parallel algorithm with full scalability, based on the bsp model, for finding hamiltonian paths in tournaments is presented.experiments have been carried out on two architecturally different systems, which stand for the possible site variety of a computational grid. these include a distributed-memory system: a solaris cluster of 32 sun ultra5 computers on myrinet network and a distributed shared-memory system: an sgi origin 2000 with 32 r10000 processors, using mpich-gm and mpt, respectively. both implementations are compatible with the grid-enabled mpi implementation, mpich-g2.
broadcast program generation for unordered queries with data replication. we study in this paper the problem of broadcasting dependent data for unordered queries. however, most prior studies on dependent data broadcasting are limited to the premise of no data replication. different from other prior studies, we investigate the effect of data replication in this paper. specifically, we first derive several theoretical properties for the average access time by analyzing the model of dependent data broadcasting. on the basis of the theoretical results, we develop a genetic algorithm to generate broadcast programs with replication. in order to compare the performance of the proposed algorithm and the prior studies, several experiments are conducted. our experimental results show that with the analytical results derived, the theoretical results derived are able to guide the search of the genetic algorithm very effectively, and lead to solution broadcast programs of higher quality than those of the prior studies.
an approximation algorithm for haplotype inference by maximum parsimony. this paper studies haplotype inference by maximum parsimony using population data. we define the optimal haplotype inference (ohi) problem as given a set of genotypes and a set of related haplotypes, find a minimum subset of haplotypes that can resolve all the genotypes. we prove that ohi is np-hard and can be formulated as an integer quadratic programming (iqp) problem. to solve the iqp problem, we propose an iterative semi-definite programming based approximation algorithm, (called sdphapinfer). we show that this algorithm finds a solution within a factor of o(logn) of the optimal solution, where n is the number of genotypes. this algorithm has been implemented and tested on a variety of simulated and biological data. in comparison with three other methods: hapar, haplotyper, and phase, the experimental results indicate that sdphapinfer and haplotyper have similar error rates. in addition, the results generated by phase have lower error rates on some data but higher error rates on others. the error rates of hapar are higher than the others on biological data. in terms of efficiency, sdphapinfer, haplotyper, and phase output a solution in a stable and consistent way, and they run much faster than hapar when the number of genotypes becomes large.
a proxy-based adaptive flow control scheme for media streaming. based on the layered video streaming technique, we proposed a proxy-based traffic flow control scheme that adjusts the presentation quality according to the currently available bandwidth, i.e., dropping/adding some video layers when the network situation gets congested/smooth. additionally, the proposed traffic flow control provides layered video stream buffering control to smoothen video playout. a re-transmission technique is also adopted to reduce the lost possibility of some important video frames. with the proposed traffic flow control scheme, the coming server-proxy-client multimedia presentation systems can have a better bandwidth utilization and presentation quality.
qos support for ieee-1394 requests. ieee-1394 is widely adopted in various commercial products for computing, communication, and entertainment. although many services with quality of service (qos) supports are now available in systems over ieee-1394, little work is done for qos-based resource allocation. in this paper, we aim at the design of a bandwidth reservation mechanism and its policy for isochronous requests, such as those from cameras. we then address the qos support issue for asynchronous requests, such as those from disks, and then an analytic framework for probability-based qos analysis. the capability of the proposed methodology and the analytic framework is evaluated by a series of experiments over a linux-based system prototype.
extending noninterference properties to the timed world. most previous work on information flow in process algebras has been based on untimed models of concurrency. it is obvious, however, that an observer might well use time to gain information about what a high-level user of the system is doing. we use the priority tock view (a discrete timed model) to extend several traditional untimed noninterference properties to the timed world. these are the determinism-based conditions of [14], [15] and [17], and forster's local noninterference properties [6], [7].
a clustering-based approach for prediction of cardiac resynchronization therapy. this paper presents a method for predicting pacing sites in the left ventricle of a heart and its result can be used to assist device programming in cardiac resynchronization therapy (crt), which is a widely adopted therapy for heart failure patients. in a traditional crt device deployment, pacing sites are selected without quantitative prediction. that runs the risk of suboptimal benefits. in this work, a surface tracking method is proposed to describe the ventricular wall motion and a hierarchical agglomerative clustering technique is applied to radial motion series to find candidate pacing sites. using clinical mri data in our experiments, we show that the proposed method performs as well as we expect. our approach can not only effectively identify suitable pacing sites, but also distinguish patients from normals perfectly to help medical diagnosis.
two-level client caching and disconnected operation of notebook computers in distributed systems. data caching in distributed file systems has been studied with regard to performance and availability [7,9,14,15]. the most common place for the cached data is the server's main memory. this type of caching is referred to as server caching, as opposed to client caching when the cached data is stored on the client (remote workstation) site. although server caching improves performance considerably since it eliminates disk transfer time for each access, it has two drawbacks: it still suffers from a network transfer delay and is very vulnerable to server's failures. server's failure renders the whole system virtually inoperable.
editorial message: special track on artificial intelligence, computational logic and image analysis. this special track on artificial intelligence, computational logic and image analysis for sac '05 is a forum for engineers, researchers and practitioners throughout the world to share technical ideas and experiences relating to implementation and application of artificial intelligence (ai). the crowning achievement of ai was evidenced in may 1997, when the program deep blue defeated mr. garry kasparov, the world chess champion. deep blues, like the majority of efforts in ai, simulate symptoms of intelligent behavior as observed in humans.
scheduling dependent items in data broadcasting environments. most of the prior research works in data broadcasting are based on the assumption that the disseminated items are independent of one another. since in many applications, a mobile user will be interested in more than one item simultaneously, we discuss in this paper the issue of dependency in generating a broadcast program. algorithm pba, standing for placement-based allocation, is proposed to generate a broadcast program with high quality and low complexity in the dependent data broadcasting environment. the experimental results show that the proposed placement-based allocation for scheduling dependent items leads to better execution efficiency and solution quality than those by prior works.
features of the concurrent programming language aldwych. this paper describes a concurrent programming language, aldwych. the language has a simple operational model where any variable has exactly one process that can write to it but any number that can read it. once a variable has been written to its value cannot be changed, but a tuple value can be written to a variable, and variables within the tuple written to later. processes consist of a set of rules which are triggered when variables are given values.we show how this underlying model can be extended using a number of derived forms so that aldwych has features of imperative, object-oriented and functional programming.
an agent based approach to site selection for wireless networks. the location of transmission infrastructure for wireless communication networks is an important engineering problem involving competing objectives. a minimal selection of locations (or sites) are required subject to providing adequate area coverage for users. in this paper we present a general model for this problem, related to circle packing and set covering. we show that the pattern matching algorithm known as stochastic diffusion search can be applied to identify suitable solutions even for large problem instances.
an empirical evaluation of communication effectiveness in autonomous reactive multiagent systems. this paper describes an experiment designed to measure the effect of collaborative communication on task performance of a multiagent system. a simulation of a multiagent environment modeled after a bee colony examined the effects of collaboration through communication for various numbers of agents and environment sizes. results show that collaboration enables a smaller number of agents to perform as well as a significantly larger number of agents without coordination. in particular, results indicate that the biologically inspired communication model of the bee is a particularly effective method of agent communication and collaboration.
the future of systematic information protection. information plays a critical role in global economics as well as our security, safety, and quality of life. there is a growing disparity between the value of information and our capability to manage and protect it. technical and policy research is needed to address this disparity. fundamentally, we can not answer the following question, "how much security is enough?" we lack the capability to quantify the value of information, particularly information that has been processed and aggregated. we also face many difficulties when attempting to measure information security, characterize threats, understand vulnerabilities, or even formulate and sustain any specific security posture. as a result, we can not measure our risk and therefore can not manage it. our efforts to address this problem can be divided into two categories, legal/policy and technical. owners of physical assets, such as cash or gold, have the legal and technical means to augment fortification protections with armed guards and lethal force. from a legal perspective, protection of information is limited to fortification, in part because we lack sufficient attribution. from a technical perspective, we have built complex mountains of computer code on top of hardware architectures that will attempt to execute any arbitrary instructions. these systems cannot be effectively analyzed for vulnerabilities so as to ensure trustworthy and secure operation. research is needed to address the systematic protection of information including information valuation, security metrics, strong attribution, trustworthy computing, sustainable security processes, and legal devices that will support comprehensive protection and risk management. 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
agent-based mobility add-in feature for object transaction service (ots). service session mobility is a new concept in the next telecom service generation. it allows users to move from one terminal in one network to another terminal in another network with service continuity. this concept requires migrating the current service execution related information, including service context, service data, etc, from one terminal to another. for services that execute within transactions, transaction context is a part of service context and must be migrated too. this paper presents our work on this problem, based on corba object transaction service. mobile agent is the enabling technology, which enhances the transaction service with mobility features.this model was initially designed for vhe architecture of vesper, a european project to design a model for virtual home environment in the next generation of telecom network. however, it can be applied to any other architecture, which require to solve the problem of service session mobility with transaction.
slide edge algorithm. the traveling salesman problem is one of the most well known problems in the class of optimization problems and is still a challenge for many computer scientists today. one approach used to attack this problem is the use of neighborhood search techniques (or improvement algorithms) that improve a solution by making a move to a neighbor if it is a better solution. neighborhood search techniques are used either independently itself or plugged in other algorithms such as iterated algorithm, local search, or evolutionary algorithm. at the same time, the running time gets slower quickly as the size of neighborhood grows exponentially. in this paper, we introduce the slide edge algorithm (sea), which is supposed not to find a move as neighborhood search techniques do but to improve the quality of a move that a neighborhood search technique finds out. while the time to find a move is exponential, the time of sea is approximately to linear. in experiment results, with the support of sea in improving a have-just-found move, neighborhood search techniques achieve a better quality of the tour in a reasonable amount of time.