ppxscal/embedding_network huggingface dataset:
Clinical and financial outcomes analysis with existing hospital patient records
Authors: R. Bharat Rao, Sathyakama Sandilya, Radu Stefan Niculescu, Colin Germond, Harsha Rao
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Existing patient records are a valuable resource for automated outcomes analysis and knowledge discovery. However, key clinical data in these records is typically recorded in unstructured form as free text and images, and most structured clinical information is poorly organized. Time-consuming interpretation and analysis is required to convert these records into structured clinical data. Thus, only a tiny fraction of this resource is utilized. We present REMIND, a Bayesian Framework for Reliable Extraction and Meaningful Inference from Nonstructured Data. REMIND integrates and blends the structured and unstructured clinical data in patient records to automatically created high-quality structured clinical data. This structuring allows existing patient records to be mined for quality assurance, regulatory compliance, and to relate financial and clinical factors. We demonstrate REMIND on two medical applications: (a) Extract "recurrence", the key outcome for measuring treatment effectiveness, for colon cancer patients (ii) Extract key diagnoses and complications for acute myocardial infarction (heart attack) patients, and demonstrate the impact of these clinical factors on financial outcomes.
New results on edge-bandwidth
Authors: Tiziana Calamoneri, Annalisa Massini, Imrich Vrťo
Venue: Theoretical Computer Science (2003)

The edge-bandwidth problem is an analog of the classical bandwidth problem, in which one has to label the edges of a graph by distinct integers such that the maximum difference of labels of any two incident edges is minimized. We prove tight bounds on the edge-bandwidth of hypercube and butterfly graphs, and complete k-ary trees which extends and improves on previous known results.
Model state feedback control algorithm for uncertain nonlinear systems with input multiplicities
Authors: Coleman Brosilow
Venue:  (2003)

A nonlinear system is said to have input multiplicities when at the steady state more than one set of input values produces the same output value. Numerous real chemical processes, such as binary distillation columns, continuous stirred tank reactors (CSTR) with recycle, and fluid catalytic cracking (FCC) units, exhibit such characteristics. Research has shown that input multiplicities can severely restrict the range of operation of linear control systems and play a strong role in the selection of control structures. In this thesis, we present a control algorithm for stable, uncertain nonlinear SISO systems with input multiplicities. The algorithm is shown to have yielded a desirable result for both reachable and unreachable setpoints. We analyzed the steady state stability of the algorithm and the impact of the model selection on the steady state stability and performance. We proposed a model selection procedure for obtaining an optimal model for the steady state performance and stability. We presented tuning procedures for the control algorithm. For unreachable setpoints, we presented an outer loop setpoint adjustment algorithm so that the process output will reach a point closest to the setpoint requested. Finally, we discussed several possible extensions to the algorithm and the issues related to the extensions.
An extension to the cyclomatic measure of program complexity
Authors: Glenford J. Myers
Venue: ACM SIGPLAN Notices (1977)

A recent paper has described a graph-theoretic measure of program complexity, where a program's complexity is assumed to be only a factor of the program's decision structure. However several anomalies have been found where a higher complexity measure would be calculated for a program of lesser complexity than for a more-complex program. This paper discusses these anomalies, describes a simple extension to the measure to eliminate them, and applies the measure to several programs in the literature.
Video transmission over a GSM wireless network
Authors: Yun Gong, Tadas Marcinkevicius
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Transmitting video over bandwidth-limited and error-prone mobile wireless channels is challenging. In this paper, we investigate the transmission of H.263-based video over a GSM wireless network. A fourth order Markov model based alogrithm proposed in [1] is used to generate burst errors on the block or packet level for the GSM wireless channel. We evaluate the transmission performance of H.263 video over the channel by simulation. An Intra-coding based error resilient method and a simple generic forward error correction scheme are discussed. Since the Markov-based algorithm can be generalized to model different error statistics, e.g., different wireless channels, the performance analysis of H.263-based video over the GSM network may be applied for other wireless channels such as 3G systems.
Autonomic Service Adaptation in ICENI using Ontological Annotation
Authors: Jeffrey Hau, William Lee, Steven Newhouse
Venue: Proceedings of the 4th International Workshop on Grid Computing (2003)

With the advent of web services standards and a service-orientedGrid architecture, it is foreseeable that competingas well as complimenting computational services willproliferate. Current efforts in standardising service interfacefocuses on how one can execute these services in termsof their syntactic descriptions. Their capabilities and relationswith other service types are only articulated throughnatural language in the form of documentation. In this paper,we seek to capture the capability of services by annotatingtheir programmatic interface using the Web OntologyLanguage (OWL)[2] in relation to some domain conceptsthereby allowing services to be semantically matchedbased on their ontological annotation. By inferences on thismetadata, syntactically different but semantically equivalentservice implementations may be autonomously adaptedand substituted. We will conclude by applying this independentannotation to Java RMI and WSDL[8] service interfaceto show the autonomic adaptation process over multipleservice oriented-architectures. Combining it with familiarhigh-level programming language, we demonstrate apractical service-oriented programming model.
Discursive conditions of knowledge production within cooperative design
Authors: Sisse Finken
Venue: Scandinavian Journal of Information Systems (2003)

Alongside other methodological affinities between contemporary Scandinavian information systems research and social anthropology, the modes of reflexivity that have come to characterize each differ. Reflexivity in the former concerns an 'otherness' of technology, which is related to the users and their practices, while reflexivity within social anthropology concerns the encounter between the textuality of representations of others. Although the representational practices of the discipline continue to be a matter of concern for the latter, information systems research has not come to take such a concern as a clearly legitimate object of research. Drawing on Foucault, this paper aims to contribute to the development of information systems research work in ways that fortify our capacity to render the historicity and politics of representation. Three texts written by researchers from and associated with the Arhus group in the period between 1970s-1990s are considered, with respect to the question of how particular enunciations are linked to the construction of an expert domain, to new forms of legitimacy, and to the differentiation of successive 'movements'. The paper suggests implications of such differentiations for how the object domain of information systems research has been shaped. Though legitimizing, the process of distancing effects the production of knowledge and folds technology, users, methods and research designers in a specific way. In these terms, the process of distancing works as a fixating gatekeeper that ex- and includes certain aspects of what it means to be a research designer and what kind of questions are legitimate to ask.
On minimal defining sets in AG(D, 3)
Authors: Diane Donovan, Abdollah Khodkar, Anne Penfold Street
Venue: DESIGNS 2002: Further computational and constructive design theory (2003)

Many distinct objects may exemplify a particular combinatorial structure, for example, a block design or latin square. When studying such objects with the same parameters, two questions arise naturally: • Given two such objects, where and how do they differ? • What portion of a particular object identifies it uniquely?Here we consider triple systems and latin squares. The first question leads to the ideas of a trade in a triple system and of a latin trade in a latin square. The second question leads to the ideas of a defining set, in particular a minimal defining set, in a triple system and of a uniquely completable set, in particular a critical set, in a latin square. We study the relationship between latin squares and triple systems, especially that between the trades and defining sets of the triple system and the latin trades and critical sets of the square.We apply these ideas and construct new families of minimal defining sets for triple systems associated with AG(d, 3).
Network management by delegation: the MAD approach
Authors: German Goldszmidt, Yechiam Yemini, Shaula Yemini
Venue: Proceedings of the 1991 conference of the Centre for Advanced Studies on Collaborative research (1991)

Network management systems built on a client/server model centralize responsibilities in client manager processes, with server agents playing restrictive support roles. As a result, managers must micro-manage agents through primitive steps, resulting in ineffective distribution of management responsibilities, failure-prone management bottlenecks, and limitations for real time responsiveness. We present a more flexible paradigm, the Manager-Agent Delegation (MAD) framework. It supports the ability to extend the functionality of servers (agents) at execution time, allowing flexible distribution of management responsibilities in a distributed environment. MAD can store and instantiate delegated scripts, and provides a concurrent runtime environment, where they can execute asynchronously without requiring the manager's intervention. A delegation protocol allows a manager to transfer programs, create process instances, and control their execution. We describe the delegation model, its application to network management, and the design of a prototype implementation.
On understanding compatibility of student pair programmers
Authors: Neha Katira, Laurie Williams, Eric Wiebe, Carol Miller, Suzanne Balik, Ed Gehringer
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

In recent years, educators have increasingly used pair programming in their computer science courses. Pair programming has been shown to be beneficial for both the teaching staff and the students in the courses. Occasionally, though, students are not compatible with their partners. An extensive study was done at the North Carolina State University to provide guidance on forming student pairs to improve the chances that pairs will be compatible and have a productive work relationship. We examined compatibility among freshman, advanced undergraduate, and graduate students. We have found that the students' perception of their partner's skill level has a significant influence on their compatibility. Graduate students work well with partners of similar actual skill level. Freshmen seem to work better with partners with different Myers Briggs personality type. Students' self-esteem does not appear to be a major contributor to pair compatibility.
A Supervised Visual Wrapper Generator for Web-Data Extraction
Authors: Xiaofeng Meng, Haiyan Wang, Dongdong Hu, Chen Li
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Extracting data from Web pages using wrappers is afundamental problem arising in a large variety ofapplications of vast practical interest. In this paper, wepropose a novel schema-guided approach to wrappergeneration. We provide a user-friendly interface thatallows users to define the schema of the data to beextracted, and specifies mappings from a HTML page tothe target schema. Based on the mappings, the systemcan automatically generate an extraction rule to extractdata from the page. Our approach to wrapper generationcan significantly reduce the work of human beings inthis process. And the user never have to deal with theinternal extraction rule, or even familiarity with thedetails of HTML.
The minimal number of solutions to &#x03C6;(n) = &#x03C6;(n+k)
Authors: Jeffrey J. Holt
Venue: Mathematics of Computation (2003)

In 1958, A. Schinzel showed that for each fixed k ≤ 8.1047 there are at least two solutions to φ(n) = φ(n + k). Using the same method and a computer search, Schinzel and A. Wakulicz extended the bound to all k ≤ 2 ċ 1058. Here we show that Schinzel's method can be used to further extend the bound when k is even, but not when k is odd.
On scalable and locality-aware web document sharing
Authors: Li Xiao, Xin Chen, Xiaodong Zhang, Yunhao Liu
Venue: Journal of Parallel and Distributed Computing (2003)

We propose a scalable Web document sharing infrastructure model called Browsers-Aware Proxy Server. In this design, a proxy server connecting to a group of networked clients maintains an index file of data objects of all clients' browser caches. If a user request misses in its local browser cache and the proxy cache, the browsers-aware proxy server will search the index file attempting to find it in another client's browser cache before sending the request to an upper level proxy or the Web server. If such a request does hit in a remote client, this client will directly forward the data object to the requesting client; or the proxy server fetches the data object from this client and then forwards it to the requesting client. The contributions of this caching model are twofold. First, we show that the amount of sharable data in browser caches is significant and can be utilized for document sharing among clients to improve Web caching performance and scalability. Second, the browsers-aware model can effectively and further improve Web prefetching performance. The browsers-aware model and its supported prefetching technique build a strong locality-aware Internet environment to make Web accesses fast with low communication costs. Conducting trace-driven simulations, we show the effectiveness of the browsers-aware model, and its unique advantages to facilitate prefetching.
The automatic diagnosis of faults in analogue and mixed-signal circuits
Authors: Alice McKeon, Antony Wakeling
Venue: Proceedings of the conference on European design automation (1991)

This paper describes a method of detecting and locating faults automatically in analogue and mixed-signal circuits; the circuit representation used allows the tolerance of all component parameters to be considered simultaneously. Fault detection is accomplished by checking whether the measurements are consistent with a model of the circuit. Automatic fault diagnosis is accomplished by tracing the source of the inconsistency.
Software and systems engineering: conflict and consensus
Authors: Rick Gibson
Venue: Practicing software engineering in the 21st century (2003)

This chapter will identify the key aspects of software engineering and systems engineering in an effort to highlight areas of consensus and conflict to support current efforts by practitioners and academics in both disciplines in redefining their professions and bodies of knowledge.By using the Software Engineering Institute's Capability Maturity Model - Integrated (CMMISM) project, which combines best practices from the systems and software engineering disciplines it can be shown that significant point of agreement and consensus are evident. Nevertheless, valid objections to such integration remain as areas of conflict. This chapter will provide an opportunity for these two communities to resolve unnecessary differences in terminology and methodologies that are reflected in their different perspectives and entrenched in their organizational cultures.
Ghostwriter: a narrative virtual environment for children
Authors: Judy Robertson, Judith Good
Venue: Proceedings of the 2003 conference on Interaction design and children (2003)

Children find computer games extremely motivating and are often prepared to devote large amounts of leisure time to playing them. UK educational policy makers and practitioners have recently started to explore the educational potential of computer games and to consider how their motivational features can be harnessed within the curriculum. This paper describes a fully implemented virtual role-playing environment, Ghostwriter, designed for educational drama development and writing instruction. Ghostwriter was developed using the commercial game engine Unreal and therefore has the same high quality graphics and audio which children are accustomed to playing with at home. Two separate field studies with Ghostwriter have shown the educational value of the system and have confirmed that children are extremely motivated by it
Adaptive energy conservation protocols for wireless ad hoc routing
Authors: John Heidemann, Deborah Estrin
Venue:  (2002)

Multihop, ad hoc networking has been the focus of many recent research and development efforts. In ad hoc networks such as sensor networks, energy use maps directly to lifetime and utility, thus energy use becomes a very important metric for wireless ad hoc networks. My thesis is that energy conservation protocols can be designed and implemented for ad hoc networks to extend network lifetime while maintaining routing fidelity. Our protocols exploit the network redundancy to achieve the goal of conserving energy to extend network lifetime. Once network redundancy is identified, our protocols power off the redundant part to conserve energy while adaptively controlling the duty cycle of network nodes to maintain routing fidelity. In order to maximize performance for energy conservation, we explore different designs to develop localized, self-configuring protocols to extend network lifetime. Basic Energy-Conserving Algorithm (BECA) and Adaptive Fidelity Energy-Conserving Algorithm (AFECA) take advantage of ad hoc routing protocols to conserve energy and introduce the concept of using network density to find network redundancy. Geographic-informed Adaptive Fidelity (GAF) self-configures redundant nodes into small groups based on their location and uses localized, distributed algorithms to control node duty cycle to extend network lifetime. Cluster-based Energy Conservation (CEC) continues GAF's effort in developing adaptive, localized, distributed and self-configuring algorithms while eliminating the dependency on location systems. In order to make our protocols robust, we study the protocol sensitivity to different network dynamics factors such as mobility model, network capacity, propagation model, energy dissipation model, location error model and network density, through analysis, simulations, and implementations. We also provide guidance on how to correctly and reasonably use these models in the wireless ad hoc network research for some types of applications. The sensitivity analysis can apply to other protocol developments and studies in ad hoc network area.
Translation-invariant mixture models for curve clustering
Authors: Darya Chudova, Scott Gaffney, Eric Mjolsness, Padhraic Smyth
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

In this paper we present a family of algorithms that can simultaneously align and cluster sets of multidimensional curves defined on a discrete time grid. Our approach uses the Expectation-Maximization (EM) algorithm to recover both the mean curve shapes for each cluster, and the most likely shifts, offsets, and cluster memberships for each curve. We demonstrate how Bayesian estimation methods can improve the results for small sample sizes by enforcing smoothness in the cluster mean curves. We evaluate the methodology on two real-world data sets, time-course gene expression data and storm trajectory data. Experimental results show that models that incorporate curve alignment systematically provide improvements in predictive power and within-cluster variance on test data sets. The proposed approach provides a non-parametric, computationally efficient, and robust methodology for clustering broad classes of curve data.
Modeling the performance of interface contraction
Authors: H. Martin Bücker, Arno Rasch
Venue: ACM Transactions on Mathematical Software (TOMS) (2003)

Automatic differentiation is a technique used to transform a computer code implementing some mathematical function into another program capable of evaluating the function and its derivatives. Compared to numerical differentiation, the derivatives obtained from applying automatic differentiation are free from truncation error, and their computation often requires less time. To increase the efficiency of a black box approach of automatic differentiation, a technique called interface contraction may be used. Interface contraction exploits the local structure of a code to temporarily reduce the global number of derivatives propagated through the code. Two performance models are introduced to predict the potential improvement in the execution time of a program making use of interface contraction compared to a program generated by a black box approach of automatic differentiation. The performance models are validated by numerical experiments carried out on different computing platforms. The computer codes used in the experiments stem from the application areas of neutron scattering and biostatistics.
Connectionist models for approximate solutions of non-linear equations in one variable
Authors: Srimanta Pal, Nikhil R. Pal
Venue: Neural, Parallel Scientific Computations (2003)

In this paper, six neural network models for the computation of an approximate real root of a given non-linear equation are proposed. The models are recurrent with one or more layers. The delay and the feedbacks are automatically taken care by the network itself. The proposed networks are: (1) Bisect net for Bisection method, (2) n-sect net for n-section method, (3) RF-net for regula falsi method, (4) Δ2-net for Attkin's method, (5) NR-net for Newton-Raphson method and (6) K-net for Kizner method. Some of the neurons in the proposed networks use the given function as their activation function. For a general purpose hardware realization, it is possible to replace each such neuron by a composite network such as an MLP (multi-layer perceptron) or a RBF (radial basis function) subnetwork. Our simulation results are obtained using a trained MLP for such neuron.
Virtual Connections and a Traffic Optimization Model for an ATM Network
Authors: A. N. Nazarov
Venue: Automation and Remote Control (2003)

The number of virtual connections in the nodal space of an ATM network of arbitrary structure and topology is computed by a method based on a new concept&mdash;a covering domain having a concrete physical meaning. The method is based on a &ldquo;network information sources&mdash;boundary switches&rdquo; model developed for an &ldquo;ATM transfer network&rdquo; by the entropy approach. Computations involve the solution of systems of linear equations. The optimization model used to compute the number of virtual connections in a many-category traffic in an ATM network component is useful in estimating the resource of nodal equipment and communication channels. The variable parameters of the model are the transmission bands for different traffic categories.