ppxscal/embedding_network huggingface dataset:
Data Systems in Support of Research in Managed Care
Authors: William A. Rush, Patrick J. O'connor, Paul E. Johnson
Venue: Information Systems Frontiers (2003)

The data systems supporting managed care are not structured to facilitate scientific research. We discuss the different types of research typically done within a managed care setting and the strategies successfully used by an affiliated research foundation to develop a data infrastructure to support a multi-investigator research mission. We describe our path from (1) diverse data systems supporting membership, claims, laboratory and pharmacy functions (2) the development of a corporate data warehouse for reporting and (3) the progression to a research data mart designed specifically to support research. We review the technical and resource issues encountered and how the evolution of the data systems for research paralleled and interacted with the research directions of the foundation.
On stage ordering in staged computation
Authors: Zhenghao Wang, Richard R. Muntz
Venue: Proceedings of the 2nd international conference on Generative programming and component engineering (2003)

A staged computation is a computation organized in a cascade of stages: each stage produces code for its successive stage; the final stage produces the desired output. An off-line procedure called binding time analysis (BTA) is often used to pre-convert unstaged code into staged code, i.e., code annotated with stage labels, which can guide online staged computation. For dynamic re-optimization purposes, it is advantageous for the order of stages in the cascade to change during runtime; however, the staged code may not support all permutations of stage sequences. Thus, it is both a and practical question to efficiently decide whether a specific stage sequence is valid for a staged code.Our approach is to encode the set of valid stage sequences for a staged code off-line in a <i>stage ordering language</i> (SOL) to facilitate fast online decision. Contrary to the intuition that we only need a single generic SOL (such as the language of posets of stage labels) to sufficiently and efficiently encode the set of valid stage sequences for any staged code in any staged language, we may need different SOLs for different staged languages. We analyze several staged languages and then present a metatheory on validating a SOL for a given staged language. Our result reveals the relationship between SOLs and semantic properties of staged languages, and can influence the design of staged languages and BTA.
Migration of non-decomposable software systems to the Web using screen proxies
Authors: Thierry Bodhuin, Enrico Guardabascio, Maria Tortorella
Venue: Proceedings of the 10th Working Conference on Reverse Engineering (2003)

The adoption of the Internet technologies favors thediffusion of Web-based applications. However, thedevelopment of new applications exploiting the moderninterfaces and distribution channels have to face theproblems connected with the integration of existing softwaresystems. This aspect often requires the migration of legacysystems toward the Web technologies. They encapsulate agreat deal of knowledge and expertise about the applicationdomain and cannot be simply discarded.Many of the migration strategies proposed in theliterature assume that the underlying software system is(semi)decomposable where the interface component isseparated from the business logic and the data modelcomponents. In this case, the interface component can be re-implemented,while the other ones are encapsulated intosoftware wrappers. Unfortunately, legacy systems are veryoften non-decomposable and alternative solutions areneeded. This paper proposes an approach for migrating anon-decomposable software system. The approach consistsof redirecting the request of input/output operations to thelegacy system by using screen and database proxies. Theapproach has been applied successfully to Cobol softwaresystems with a character-based user interface.
Infinite intersection types
Authors: Marcello M. Bonsangue, Joost N. Kok
Venue: Information and Computation (2003)

A type theory with infinitary intersection and union types for an extension of the λ-calculus is introduced. Types are viewed as upper closed subsets of a Scott domain and intersection and union type constructors are interpreted as the set-theoretic intersection and union, respectively, even when they are not finite. The assignment of types to λ-terms extends naturally the basic type assignment system. We prove soundness and completeness using a generalization of Abramsky's finitary logic of domains. Finally we apply the framework to applicative transition systems, obtaining a sound a complete infinitary intersection type assignment system for the lazy λ-calculus.
Are you a technical guru or an enlightened friend?
Venue: Ubiquity (2003)

In order to get the information security budget you need, you must be able to communicate comfortably with non-technies, says security expert Thomas J. Parenty.
A study of the method of providing secure network channel among secure OSs
Authors: Jae-Deok Lim, Joon-Suk Yu, Jeong-Nyeo Kim
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Many studies have been done on secure operating system using secure kernel that has various access control policies for system security. Secure kernel can protect user or system data from unauthorized and/or illegal accesses by applying various access control policies like DAC, MAC, RBAC, and so on. But, even if secure operating system is running under various access control policies, network traffic among these secure operating systems can be captured and exposed easily by network monitoring tools like packet sniffer if there is no protection policy for network traffic among secure operating systems. For this reason, protection for data within network traffic is as important as protection for data within local system. In this paper, we propose a secure operating system trusted channel, SOSTC, as a prototype of a simple secure network protocol that can protect network traffic among secure operating systems and can transfer security information of the subject. It is significant that SOSTC can be used to extend a security range of secure operating system to the network environment.
An event-driven transient simulation algorithm for MOS and bipolar circuits
Authors: D. Patrick, C. Lyden
Venue: Proceedings of the conference on European design automation (1990)

SUGAR is a program for fast transient simulation of MOS circuits [1]. This paper describes the extension to the algorithm to handle bipolar and BiCMOS circuits. The authors believe that SUGAR is the first event driven circuit simulator which successfully simulates bipolar circuits. The algorithm uses both dynamic and static circuit partitioning to identify closely coupled nodes, and performs simultaneous equation solution on the coupled nodes. A number of other extensions have been made to the algorithm to facilitate BJT simulations.
Personalized Web Search For Improving Retrieval Effectiveness
Authors: Fang Liu, Clement Yu, Weiyi Meng
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

Abstract--Current Web search engines are built to serve all users, independent of the special needs of any individual user. Personalization of Web search is to carry out retrieval for each user incorporating his/her interests. We propose a novel technique to learn user profiles from users' search histories. The user profiles are then used to improve retrieval effectiveness in Web search. A user profile and a general profile are learned from the user's search history and a category hierarchy, respectively. These two profiles are combined to map a user query into a set of categories which represent the user's search intention and serve as a context to disambiguate the words in the user's query. Web search is conducted based on both the user query and the set of categories. Several profile learning and category mapping algorithms and a fusion algorithm are provided and evaluated. Experimental results indicate that our technique to personalize Web search is both effective and efficient.
A logical reconstruction of SPKI
Authors: Joseph Y. Halpern, Ron van der Meyden
Venue: Journal of Computer Security (2003)

SPKI/SDSI is a proposed public key infrastructure standard that incorporates the SDSI public key infrastructure. SDSI's key innovation was the use of local names. We previously introduced a Logic of Local Name Containment that has a clear semantics and was shown to completely characterize SDSI name resolution. Here we show how our earlier approach can be extended to deal with a number of key features of SPKI, including revocation, expiry dates, and tuple reduction. We show that these extensions add relatively little complexity to the logic. In particular, we do not need a nonmonotonic logic to capture revocation. We then use our semantics to examine SPKI's tuple reduction rules. Our analysis highlights places where SPKI's informal description of tuple reduction is somewhat vague, and shows that extra reduction rules are necessary in order to capture general information about binding and authorization.
A model synapse that incorporates the properties of short-and long-term synaptic plasticity
Authors: Armen R. Sargsyan, Albert A. Melkonyan, Costas Papatheodoropoulos, Hovhannes H. Mkrtchian, George K. Kostopoulos
Venue: Neural Networks (2003)

We propose a general computer model of a synapse, which incorporates mechanisms responsible for the realization of both short- and long-term synaptic plasticity--the two forms of experimentally observed plasticity that seem to be very significant for the performance of neuronal networks. The model consists of a presynaptic part based on the earlier 'double barrier synapse' model, and a postsynaptic compartment which is connected to the presynaptic terminal via a feedback, the sign and magnitude of which depend on postsynaptic Ca2+ concentration. The feedback increases or decreases the amount of neurotransmitter which is in a ready for release state. The model adequately reproduced the phenomena of short- and long-term plasticity observed experimentally in hippocampal slices for CA3-CA1 synapses. The proposed model may be used in the investigation of certain real synapses to estimate their physiological parameters, and in the construction of realistic neuronal networks.
Tamper Resistance Mechanisms for Secure, Embedded Systems
Authors: Srivaths Ravi, Anand Raghunathan, Srimat Chakradhar
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

To secure digital assets, a tasteful integration of a variety of technologiesand processes is necessary. Tamper-resistance is being increasinglyused as an important piece of a more comprehensive securitysystem. It provides an effective barrier to entry and protectsdigital assets in the embedded systems from most people and mostattacks. Embedded systems pose unique security challenges becausethey are largely used in relationships where one party wantsto put a secure, embedded device, in the hands of another, withthe assurance that the second party cannot modify/hack the device.First, we outline the major attacks that threaten the security of anembedded system. The vulnerability landscape of an embeddedsystem is a vast expanse of attacks. A good understanding of thethreats is necessary so that countermeasures can be devised to protectagainst threats that pose the greatest risk. Second, we presentcountermeasures and discuss their effectiveness in protecting thecrown jewels of an embedded system: boot code, operating systemsoftware and embedded hardware. A clear understanding of attacksand countermeasures enables a system architect to make rationalinvestment decisions in designing a secure, embedded system.
Pre-placement of VLSI blocks through learning neural networks
Authors: D. D. Caviglia, G. M. Bisio, F. Curatelli, L. Giovannacci, L. Raffo
Venue: Proceedings of the conference on European design automation (1990)

This paper presents a new neural network approach to the pre-placement of VLSI blocks. Our innovation consists in considering the pre-placement problem as a classification problem, and in implementing a neural network learning algorithm, derived from Kohonen maps, to accomplish this task. The neural network has been simulated and the results have been compared with those obtained from a classical min-cut algorithm. The comparison shows as our technique offers comparable quality of solutions, but presents a more favourable computational complexity.
A numerical model of stress driven grain boundary diffusion
Authors: J. A. Sethian, Jon Wilkening
Venue: Journal of Computational Physics (2004)

The stress driven grain boundary diffusion problem is a continuum model of mass transport phenomena in microelectronic circuits due to high current densities (electromigration) and gradients in normal stress along grain boundaries. The model involves coupling many different equations and phenomena, and difficulties such as nonlocality, stiffness, complex geometry, and singularities in the stress tensor near corners and junctions make the problem difficult to analyze rigorously and simulate numerically. We present a new numerical approach to this problem using techniques from semigroup theory to represent the solution. The generator of this semigroup is the composition of a type of Dirichlet to Neumann map on the grain boundary network with the Laplace operator on the network. To compute the former, we solve the equations of linear elasticity several times, once for each basis function on the grain boundary. We resolve singularities in the stress field near corners and junctions by adjoining special singular basis functions to both finite element spaces (2d for elasticity, 1d for grain boundary functions). We develop data structures to handle jump discontinuities in displacement across grain boundaries, singularities in the stress field, complicated boundary conditions at junctions and interfaces, and the lack of a natural ordering for the nodes on a branching grain boundary network. The method is used to study grain boundary diffusion for several geometries.
P5-free augmenting graphs and the maximum stable set problem
Authors: Michael U. Gerber, Alain Hertz, David Schindl
Venue: Discrete Applied Mathematics (2003)

The complexity status of the maximum stable set problem in the class of P5-free graphs is unknown. In this paper, we first propose a characterization of all connected P5-free augmenting graphs. We then use this characterization to detect families of subclasses of P5-free graphs where the maximum stable set problem has a polynomial time solution. These families extend several previously studied classes.
Practical lazy scheduling in sensor networks
Authors: Ramana Rao Kompella, Alex C. Snoeren
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

Experience has shown that the power consumption of sensors and other wireless computational devices is often dominated by their communication patterns. We present a practical realization of lazy packet scheduling that attempts to minimize the total transmission energy in a broadcast network by dynamically adjusting each node's transmission power and rate on a per-packet basis. Lazy packet scheduling leverages the fact that many channel coding schemes are more efficient at lower transmission rates; that is, the energy required to send a fixed amount of data can be reduced by transmitting the data at a lower bit rate and transmission powe.The optimal per-packet transmission rate in a multi-node network is governed in practice by the available bit rates of the given transceiver(s), the nodes' delay tolerance, and the offered load at every node contending for the shared broadcast channel. We propose an extension to the traditional CSMACA MAC scheme called L-CSMACA that allows individual nodes to continually estimate the current demand for a broadcast channel and adjust their transmission schedules accordingly. Our simulation results show that L-CSMACA can provide improved energy efficiency in a single-hop, broadcast network (20--25% with more than 10 nodes, and up to 99% for four nodes with a standard power function) for both Poisson and bursty arrivals with only minor degradation the capacity of the channe.
Correct interactive transformational synthesis of DSP hardware
Authors: F. P. Burns, D. J. Kinniment, A. M. Koelmans
Venue: Proceedings of the conference on European design automation (1991)

We present a new interactive tool for the guided synthesis of digital signal processing hardware. The tool is driven from a HDL. It will suggest different ways of implementing different architectures for the same specification, maintaining the correctness of implementations during the design process. The tool will automatically generate input for the Boyer Moore theorem prover from the HDL specification in order to verify the correctness of the implementations.
The metal/organic monolayer interface in molecular electronic devices
Authors: Dominique Vuillaume, Stéphane Lenfant
Venue: Microelectronic Engineering (2003)

The metal/molecules/metal is the basic device used to measure the electronic properties of organic molecules envisioned as the key components in molecular-scale devices (molecular diode, molecular wire, molecular memory, etc.). This review paper describes the main techniques used to fabricate a metal/molecules/metal device (or more generally electrode/ molecules/electrode junctions, with electrodes made of metal or semiconductor). We discuss several problems encountered for the metallization of organic monolayers. The organic/electrode interface plays a strong role in the electronic properties of these molecular devices. We review some results on the relationships between the nature of the electrode/molecule interface (physisorbed or chemisorbed, evaporated metal electrode, mechanical contact, etc.) and the electronic transport properties of these molecular-scale devices. We also discuss the effects of symmetric versus asymmetric coupling of the two ends of the molecules with the electrodes.
Adaptive-growth-type 3D representation for configuration design
Authors: Toshiharu Taura, Ichiro Nagasaka
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1999)

In this paper, the design of geometrical shapes of function carriers and their layout in given space is called configuration design. The constraint satisfaction problem in configuration design may be difficult to solve due to the lack of tight constraints and the countless combinations of the layout; a diversity of solutions that satisfy the constraints should be allowed. Therefore, to allow such diversity, we directed our attention to developmental processes in biology and proposed an adaptive-growth-type 3D representation based on evolutionary algorithms. Here, the adaptive-growth-type means the shape expressed in the process, which develops through interaction with an outside environment, like shape generation of a living organism in the natural world. The usefulness of the representation was verified by applying it to the component layout problem in the early stage of satellite design.
A Proposal for Structuring the Coordination Space of Multiagent Systems
Authors: Márcia Cristina Moraes, Antônio Carlos da Rocha Costa
Venue: Proceedings of the XXIII International Conference of the Chilean Computer Science Society (2003)

Nowadays there is some confusion around the termsused to conceptualize multiagent coordinationmechanisms.We understand that the characterizations incoordination mechanisms mix two distinctive aspects ofcoordination: the result of coordination and thebehavioral mode that agents use to accomplish a givenresult of coordination.In this paper we propose a structuring of the coordination space mechanismscomposed by two dimensions: results and modes.Themode dimension, in particular, includes one kind ofbehavior, which has not been extensively explored, whichis the ability to improvise in order to achieve the aimedresults of coordination.We analyze and classify anextensive set of works on coordination, finding theirplaces in our space of coordination mechanisms.Thisclassification brings to us some very interestingconclusions, including the one that the ability toimprovise is generally represented, implicitly orexplicitly, in all kinds of agents endowed withcoordination mechanisms.
Design Considerations for Energy-Efficient Radios in Wireless Microsensor Networks
Authors: Eugene Shih, Seonghwan Cho, Fred S. Lee, Benton H. Calhoun, Anantha Chandrakasan
Venue: Journal of VLSI Signal Processing Systems (2004)

In the past few years, wireless microsensor networks have attracted a great deal of attention in the research community. This is due to the applications that will be enabled once wireless microsensor networks are in place. The design of wireless microsensor networks, however, represents a difficult challenge. Since many applications require fault-tolerant, long-term sensing, one important challenge is to design sensor networks that have long system lifetimes. Achieving long system lifetimes is difficult because sensor nodes are severely energy-constrained. In this paper, we demonstrate system-level techniques that adapt and tradeoff software and hardware parameters in response to changes in the requirements of the user, the characteristics of the underlying hardware, and the properties of the environment. By using these power-aware, system-level techniques, we are able to reduce the energy consumption of both general, adaptable systems and dedicated point systems. Moreover, given a specific set of operating conditions for a particular system, we show how energy savings of 50% can be achieved.
Education for a technology-based profession: softening the information systems curriculum
Authors: Rodney Turner, Glenn Lowry
Venue: Current issues in IT education (2003)

This chapter reports some further findings of an ongoing investigation into conceptual, academic, and "soft" skills that IS/IT practitioners regard as important in new graduates. There has long been agreement that the IS curriculum should be comprised of some combination of technical subjects and nontechnical business subjects, and that graduates also need "soft" business skills. There is far less agreement about what the mix between these should be and how best to prepare students in some areas, notably in the development of "soft" business skills. The research findings reported here present some evidence that traditional "business subjects" such as marketing, economics, or finance do not equate to the business skills that employers of IS graduates are seeking in new hires. The chapter concludes with a discussion of IS curriculum reform issues and strategies for reducing confusion, overcoming tradition and inertia, finding resources, and neutralizing vested interests.
Cybernetics and Biomedicine: The State of the Art and Problems of Development
Authors: V. I. Gritsenko, L. S. Aleev, A. B. Kotova, M. I. Vovk, S. I. Kiforenko, V. M. Belov, I. I. Ermakova, E. G. Lyabakh, L. M. Kozak, A. S. Kovalenko
Venue: Cybernetics and Systems Analysis (2003)

The cybernetics approach is extended to systems of biological nature. The contribution of biological cybernetics and medical cybernetics to the extension of capabilities of solving theoretical and applied problems of biomedicine is demonstrated by concrete examples. Telemedicine and virtual concilia are considered in the structure of a unified medical information space.