ppxscal/embedding_network huggingface dataset:
Multistrategic data mining in a clinical meningoencephalitis database
Authors: Shusaku Tsumoto
Venue: ACM SIGBIO Newsletter (1998)

This project aims at inducing as much information as possible from clinical databases. Until now, the following six methods are applied to a clinical database (meningoencephalitis):1. association rule induction,2. decision trees with genetic algorithm based feature selection,3. decision tree induction with random sampling,4. rough set based rule induction,5. logit analysis6. linear discriminant analysis.Experimental results show that knowledge which medical experts did not expect was extracted by different methods. The research will be extended to other methods and databases.
Triage of Acute Abdominal Pain in Childhood: Clinical Use of a Palm Handheld in a Pediatric Emergency Department
Authors: Wojtek Michalowski, Steven Rubin, Roman Slowinski, Szymon Wilk
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

The paper describes design and implementation of a mobile clinical triage support system for the evaluation of acute appendicitis in childhood.The MET (Mobile Emergency Triage) system was developed according to the general principles of client-server architecture, with mobile clients running on Palm handhelds. Decision model implemented in MET follows the principles of evidence-based medicine based on retrospective data. We applied a hybrid methodological approach involving fuzzy measures and rough set theory to develop this model. In a randomized retrospective trial, the triage recommendation of the MET system had a sensitivity of 86.7% and a specificity of 85.7%.MET is a fully functional mobile clinical triage support system that provides triage recommendation at the point of care, irrespective of the completeness of the clinical information. It also allows for data capture and interaction with the hospital's information system.Given mobility of MET and its easy-to-use features, we are proposing a system that can both support evidence-based emergency room patient care, and at the same time, streamline the bedside triage of a child with abdominal pain.
Mass production of individual feedback
Authors: David Heaney, Charlie Daly
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

The recent downturn in IT has meant a large drop in the number of students wishing to study Computer Science, with a corresponding drop in entry qualifications and increase in drop-out rates[2]. In recent years, we have been using peer tutoring with some success to reduce failure rates on our introductory programming course[1]. In this current academic year, we introduced TutorBoard, a web based system that allows undergraduate tutors to provide fast and detailed feedback on student assignments. The system is very popular with the students and has resulted in an improvement in the results of the at-risk low-points students.
On Recent Cheeger-Type Bounds for Nonmaximal Eigenvalues Applied to Positive Matrices
Authors: Stephen G. Walker
Venue: SIAM Journal on Matrix Analysis and Applications (2003)

This paper is concerned with Cheeger-type bounds for nonmaximal eigenvalues of nonnegative irreducible matrices. It is shown that recent upper bounds found by Nabben can be strictly improved when the matrices are positive, stochastic, and reversible, indicating the Nabben bounds are never sharp in this case.
Public policy on privacy
Authors: David Brandin
Venue: ACM SIGCAS Computers and Society (1976)

The following article is excerpted from testimony presented by Dr. Brandin, Gene P. Altshuler, Peter D. Miller, and Donn B. Parker before the Privacy Protection Study Commission, September 8, 1975 on behalf of Stanford Research Institute. Since the testimony comments on privacy as an issue for public it is included in this issue of <u>Computers & Society</u>.
On Handling QoS Traffic in Wireless Sensor Networks
Authors: Mohamed Younis, Kemal Akkaya, Mohamed Eltoweissy, Ashraf Wadaa
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

Many new routing and MAC layer protocols have been proposed for wireless sensor networks tackling the issues raised by the resource constrained unattended sensor nodes in large-scaledeployments. The majority of these protocols considered energy efficiency as the main objective and assumed data traffic with unconstrained delivery requirements. However, the growing interest in applications that demand certain end-to-end performance guarantees and the introduction of imaging and video sensors have posed additional challenges. Transmission of data in such cases requires both energy and QoS aware network management in order to ensure efficient usage of the sensor resources and effective access to the gathered measurements. In this paper, we highlight the architectural and operational challenges of handling of QoS traffic in sensor networks. We report on progress make to-date and outline open research problems.
Experimental Trac language primitive to allow user control of the scan algorithm
Authors: Claude A. R. Kagan
Venue: ACM SIGPLAN Notices (1970)

The Trac language as defined by Calvin Mooers lacks provisions to permit the creation of user-defined functions having the attributes of primitives of the language.
NASA's Mission Reliable
Authors: Patrick Regan, Scott Hamilton
Venue: Computer (2004)

Both predictable and unpredictable hazards await the spacecraft, robots, and scientific instruments that humans dispatch to explore our solar system. The toughest hazard may be the known presence of unknown bugs in even rigorously tested software.By exploring new technologies and approaches to develop provably reliable software within tough constraints, NASA has a chance to advance the state of the art, contributing to computer science aswell as software engineering. In addition, any successful spin-off that improves reliability while cutting development time and costs could, in principle, generate savings for US industry equal to the nation's budget for space exploration.
Performance analysis of a generic proxy-based client-server system for World-Wide Web services using a generalized Markov chain model
Authors: Bharadwaj Veeravalli
Venue: Journal of High Speed Networks (2003)

We investigate the performance of a network system on the World-Wide Web employing proxies that interact with a pool of servers to service a pool of client requests. We focus on modelling the interaction of a proxy with the server system and its performance in maximizing the number of requests that can be served. We formulate the problem using a discrete time Markov chain model capturing the state of the client (equivalently the state of the proxy) and quantify the performance in terms of number of requests that are successfully processed by the server system. We derive a closed-form solution to determine the percentage of requests that can be admitted by the servers, referred to as admission control factor, which is our performance metric of interest. We conduct a systematic and rigorous simulation study to demonstrate the behavior of our performance metric with respect to the number of client requests and the number of available servers in the system. We also study the effect of server response time and propose three different strategies that a proxy may adopt to tune the performance of the system. The behavior of the three strategies - Conservative, Greedy, and Incremental Tuning, with respect to our performance metric is rigorously studied under a variety of system dependent parameters, with respect to the probability of a client request, and the probability of a new request arrival. Further, we perform an asymptotic analysis to quantify the ultimate performance limits of the admission control factor with respect to the number of client requests than can be supported by the system and the number of servers in the system. In the study with respect to the number of servers, we derive an exact bound on the behavior of our performance metric and testify this finding with our rigorous simulation experiments. Several interesting features are highlighted and the model is conclusively shown to be robust and elegant in capturing the behavior of the system.
Strauss: a specification miner
Authors: Glenn Schatzman Ammons
Venue:  (2003)

Program verification tools (such as model checkers) are powerful tools for finding errors in programs. Unfortunately, these tools need lots of formal specifications of correct program behavior. Can we really expect programmers to write all of these specifications by hand? This dissertation is about Strauss, a tool I wrote to bring automation to specification-writing. By observing traces of working programs, Strauss infers many temporal specifications, each of which says how correct programs use a small part of an interface. I used Strauss to derive 17 formal specifications for the X11 windowing system (whose libraries contain over 2000 routines and over 500 data structures), and used the specifications to find bugs in several widely distributed applications.
Data webs for earth science data
Authors: Asvin Ananthanarayan, Rajiv Balachandran, Robert Grossman, Yunhong Gu, Xinwei Hong, Jorge Levera, Marco Mazzucco
Venue: Parallel Computing (2003)

We describe high performance data webs for earth science data, which are designed for interactively analyzing small to moderate size remote data sets, as well as mining distributed data sets. Achieving high performance required developing specialized high performance transport services as well as specialized high performance middleware services for merging multiple data streams. Data webs complement data grids, which are grid based infrastructures designed to support arbitrary distributed computation over distributed data using a trusted computing model.
Distributed, Self-Stabilizing Placement of Replicated Resources in Emerging Networks
Authors: Bong-Jun Ko
Venue: Proceedings of the 11th IEEE International Conference on Network Protocols (2003)

Emerging large scale distributed networking systems, such as P2P file sharing systems, sensor networks, and ad hoc wireless networks, require replication of content, functionality, or configuration to enact or optimize communication tasks. The placement of these replicated resources can significantly impact performance. We present a novel self-stabilizing, fully distributed, asynchronous, scalable protocol that can be used to place replicated resources such that each node is "close" to some copy of any object. We describe our protocol in the context of a graph with colored nodes, where a node's color indicates the replica/task thatit is assigned. Our combination of theoretical results and simulation prove stabilization of the protocol, and evaluate its performance in the context of convergence time, message transmissions, and color distance. Our results show that the protocol generates colorings that are close to the optimal under a set of metrics, making such a protocol ideal for emerging networking systems.
The basis refinement method
Authors: Peter Schroder
Venue:  (2003)

Finite element solvers are critical in computer graphics, engineering, and medical applications. Adaptive refinement methods can tame otherwise intractable problems. Classical finite-element mesh refinement (i.e., the splitting of isolated mesh elements) is well-studied, but remains cumbersome to implement for unstructured three-dimensional meshes, among other settings, in particular because mesh compatibility must be explicitly maintained. Furthermore, mesh refinement does not apply to problems that benefit from higher-order B-spline discretizations and their more general counterparts, so-called subdivision elements. We introduce a simple alternative, adaptive basis refinement, which applies uniformly in all these settings and others. The basic principle of our approach is to refine basis functions, not elements. Our method is naturally compatible: unlike mesh refinement, basis refinement never creates incompatible meshes. Our first contribution is a minimal mathematical framework built on nested approximation spaces. By construction, the bases for these spaces consist of refinable functions. Our adaptive solver framework makes no assumptions as to (a) the dimension of the domain; (b) the tesselation of the domain, i.e., the domain elements be they triangles, quadrilaterals, tetrahedra, etc.; (c) the approximation order; and (d) the support diameter of the basis functions. Our second contribution is a small set of simple algorithms for basis refinement. Our method requires efficient data structures and algorithms to (a) keep track of interactions between basis functions and (b) manage a tesselation of the domain suitable for evaluation of the associated integrals (e.g., to determine the sparsity structure and evaluate the entries of the stiffness matrix). We specify these requirements, develop the relevant theorems and proofs, and deduce provably-correct pseudo-code. The resulting algorithms are general and simple. Our third contribution is the mapping of finite-elements, wavelets and multi-wavelets, splines and subdivision schemes onto our nested spaces framework. We demonstrate that our unifying algorithms for basis refinement encompass a very broad range of discretizations. Our fourth contribution is a set of compelling examples based on our implementation of basis refinement. Our examples span thin shells (fourth order elliptic PDE using a Loop subdivision discretization), volume-deformation and stress-analysis using linear elasticity (second order PDE using linear-tetrahedral and trilinear-hexahedral finite elements).
Usefulness of Solution Algorithms of the Traveling Salesman Problem in the Typing of Biological Sequences in a Clinical Laboratory Setting
Authors: Javier Garcés Eisele, Carolina Yolanda Castañeda Roldán, Mauricio Osorio Galindo, Ma. del Pilar Gómez Gil
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

Our concern is to solve the problem of the typing ofdeoxyribonucleic acid (DNA) sequences in alaboratory setting. Here we try to find solutionalgorithms for the classification of restriction patternswhich forms part of the above-mentioned problem, inorder to evaluate the amount of information generatedby a given restriction enzyme. A distance matrix isgenerated by comparison of each restriction patternand used to classify the patterns according to theirsimilarity. This problem can be mapped to theTraveling Salesman Problem (TSP). Several knownand new solution algorithms have been tested.Interestingly, a very simple and modified nearestneighbor analysis performed best for this kind ofproblem. However, when the distance matrix isreplaced by a "distinction matrix" (expresses directlywith the help of a threshold function the similarity (0)or dissimilarity (1) between restriction patterns) theresults of at least one local search algorithm aredramatically improved.
Words whose complexity satisfies lim p(n)/n = 1
Authors: Ali Aberkane
Venue: Theoretical Computer Science (2003)

In this paper, we study the infinite words such that limn p(n)/n = 1, by using the Rauzy graphs. We show that the infinite evolution of the graphs of these infinite words can be characterized by a rather simple condition, which ensures that the graphs with more than one right special factor appear rarely, so that makes the complexity very small.
Sensor fusion techniques for cooperative localization in robot teams
Authors: John Rogers Spletzer
Venue:  (2003)

A fundamental capability for autonomous robot operations is localization&mdash;that is, the ability of a robot to estimate its position in the environment. It is a base level capability enabling numerous other technologies including mapping, manipulation, and target tracking. Within this realm of research, there is a more recent and narrower focus on Cooperative Localization (CL) for robot teams. In this paradigm, groups of robots combine sensor measurements to improve localization performance. The focus of this dissertation is applying sensor fusion techniques to the CL problem. We are particularly interested in employing teams of robots in target tracking roles. This has motivated our own solution to CL which is capable of solving the Simultaneous Localization and Target Tracking problem. Under this paradigm, targets are merely viewed as &ldquo;passive&rdquo; team members that must be localized. The benefit of such an approach is that although the targets do not contribute measurements, they still contribute constraints to the localization process. We assume an unknown-but-bounded model for sensor noise, whereby bearing and range measurements are modeled as linear constraints on the configuration space of the robot team. Merging these constraints induces a convex polytope representing the set of all configurations consistent with sensor measurements. Estimates for the uncertainty in the absolute position of a single robot or the relative positions of two or more nodes can then be obtained by projecting this polytope onto appropriate subspaces of the configuration space. While recovering the exact projection can require exponential time, we propose a novel method for approximating these projections using linear programming techniques. We then further extend current localization methods to the problem of active target tracking. Recall that in the CL model, pose estimates are formed by combining information from multiple distributed sensors. This capability invites the following question: given that the robot platforms are mobile, how should they be deployed in order to maximize the quality of the estimates returned by the team? We present a generic theoretical framework, and practical computational approaches for tackling this problem.
Application of an evaluation framework for analyzing the architecture tradeoff analysis methodSM
Authors: Marta Lopez
Venue: Journal of Systems and Software (2003)

Evaluation is a critical analytical process in all disciplines and fields and therefore also in software engineering. For developing and analyzing an evaluation method a framework of six basic components (target, evaluation criteria, yardstick, data-gathering techniques, synthesis techniques, and evaluation process) can be applied. This framework was developed based on the analysis of theoretical and methodological evaluation concepts applied in software and non-software disciplines. In particular, in this paper we present the application of the framework for analyzing the architecture tradeoff analysis methodTM (ATAMSM), developed by the Software Engineering Institute (SEI). The results of the matching of the framework with the ATAM definition facilitate the identification of each evaluation component and stress some key aspects, such as the relevant role of stakeholders and the significance of attribute-based architectural styles in an ATAM evaluation.
Improving the performance and scalability of intermittently synchronized database systems
Authors: Wai Gen Yee
Venue:  (2003)

Intermittently synchronized database systems (ISDB) are a class of database systems that allow client mobility. ISDBs allow the manipulation of local replicas of primary data while disconnected from the server. ISDBs also handle the synchronization of these replicas when a connection to the server is established. Although synchronization performance is robust with a small client population, analytical and experimental results show that it does not scale well with increasing client population. As a result, synchronization time suffers, and clients have to wait longer for updates. The source of ISDB scalability problems stems from the sharing of server and network resources by many clients. Specifically, clients are synchronized one-by-one, leading to much redundant work and poor resource utilization. On the other hand, by aggregating the synchronization processing of multiple &ldquo;similar&rdquo; clients, we can simultaneously address the data needs of multiple clients and thereby increase an ISDBs performance and ability to scale with client population. This work presents aggregation techniques that conserve resources at all levels of the ISDB architecture. It details how to generate update files that apply to multiple clients, and then efficiently broadcast them to clients. The server must do less work because it generates fewer update files. The network must do less work because the single broadcast of a file potentially satisfies all outstanding requests for it. Finally, including index metadata in the broadcast allows the client to do less work searching through the broadcast for requested data. These optimizations can be applied individually or work in concert with each other. Each has been shown to dramatically improve performance of their respective parts of the ISDB architecture.
FOOM-functional and object-oriented methodology for analysis and design of information systems
Authors: Peretz Shoval, Judith Kabeli
Venue: Advanced topics in database research vol. 1 (2003)

FOOM is an integrated methodology for analysis and design of information systems, which combines the two essential software-engineering paradigms: the functional- (or process-) oriented approach and the object-oriented (OO) approach. In FOOM, system analysis includes both functional and data modeling activities, thereby producing both a functional model and a data model. These activities can be performed either by starting with functional analysis and continuing with data modeling, or vice versa. FOOM products of the analysis phase include:a)a hierarchy of OO-DFDs (object-oriented data flow diagrams), and b) an initial object schema, which can be created directly from the user requirements specification or from an entity-relationship diagram (ERD) that is mapped to that object schema. System design is performed according to the OO approach. The products of the design phase include: a) a complete object schema, consisting of the classes and their relationships, attributes, and method interfaces; b) object classes for the menus, forms and reports; and c) a behavior schema, which consists of detailed descriptions of the methods and the application transactions, expressed in pseudo-code and message diagrams. The seamless transition from analysis to design is attributed to ADISSA methodology, which facilitates the design of the menus, forms and reports classes, and the system behavior schema, from DFDs and the application transactions.
A concept for the evaluation of e-commerce-ability
Authors: Ulrike Baumöl, Thomas Stiffel, Robert Winter
Venue: Managing e-commerce and mobile computing technologies (2003)

This chapter develops a concept to evaluate the e-commerce-ability of a corporation and applies the framework to basic roles of the e-commerce environment. The concept comprises two components. A four-dimensional framework is proposed which can be used to represent the degree of external coordination; the degree of alignment of business toward organizational and cultural rules of the networked economy; the degree of orientation toward customer needs; and the degree of systematic and integral use of information and communication technology (ICT). Based on this framework, an evaluation approach is presented that supports a maturity analysis.
Central Schemes for Multidimensional Hamilton-Jacobi Equations
Authors: Steve Bryson, Doron Levy
Venue: SIAM Journal on Scientific Computing (2003)

We present new, efficient central schemes for multidimensional Hamilton--Jacobi equations. These nonoscillatory, nonstaggered schemes are first- and second-order accurate and are designed to scale well with an increasing dimension. Efficiency is obtained by carefully choosing the location of the evolution points and by using a one-dimensional projection step. First- and second-order accuracy is verified for a variety of multidimensional, convex, and nonconvex problems.