ppxscal/embedding_network huggingface dataset:
Playing smallball: Approaches to evaluating pilot health information exchange systems
Authors: Kevin B. Johnson, Cynthia Gadd
Venue: Journal of Biomedical Informatics (2007)

Health information exchange (HIE) systems are large, multimillion dollar efforts that are implemented despite initial institutional apprehension, with largely unanticipated effects on the clinical workflow, and with a primary goal of establishing a reason to sustain the effort. Traditional evaluation methods that rely on viewing HIE as generalizable tools that can be used to demonstrate impact are challenged by the realities of how HIE systems are created and the numerous systems they impact on the road to improved care. In short, it appears to be unrealistic to develop the definitive ''home run'' evaluation of this technology. Despite the existence of traditional approaches for large-scale evaluation, a more realistic approach may be a ''smallball'' model based on established IT implementation phases, with appropriate evaluation dimensions linked to each phase.
New Products
Venue: Computer (1971)

Cogar Corporation has announced A family of DTL/TTL compatible MOS Read/Write monolithic memories. The new memories are complete subsystems that combine logic and memory functions on a single printed circuit plug-in card. Each module on the card contains up to 2048 bits of memory. Signal buffers, word drivers, sense amplifiers and latches are also included on the same card. One clock generates the required logic timing sequence. The system is based on MOS technology for the storage arrays and bipolar technology for the interface electronics. It is designed to keep the input loading low and provide line driving capability at output. 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
A New Approach to Geometrical Feature Assessment for ICP-Based Pose Measurement: Continuum Shape Constraint Analysis
Authors: D. J. McTavish, G. Okouneva
Venue: Proceedings of the International Machine Vision and Image Processing Conference (2007)

This paper presents a generalization of closest-point constraint analysis called Continuum Shape Constraint Analysis (CSCA) that can be used to asses the suitability of whole objects or object features for range data scanning and subsequent pose estimation. "Directional CSCA" (D-CSCA) is proposed to specifically address pose estimation accuracy via the ICP (Iterated Closest-Point) family of algorithms. Constraint analysis based on Noise Amplification Index (NAI) is used. In the D-CSCA formulation, the continuum nature of the underlying shape registration renders the resulting gradient matrix and NAI thereof as pure properties of the feature, dependent on viewpoint but independent of the viewing instrument.
Dynamical Model Based on Diffusive Predator-Prey System
Authors: Ren-hui Liu, Feng-yong Zhai
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

We consider the dynamical model based a diffusive predator-prey system model has been study with type-I functional response. With aid of standard operator theory, we considered the local asymptotical stability of the constant positive equilibrium solution, from which much information was said on the life cycle of the large time dynamical behavior of the two companies in the market.
Does additional information always reduce anonymity?
Authors: Claudia Diaz, Carmela Troncoso, George Danezis
Venue: Proceedings of the 2007 ACM workshop on Privacy in electronic society (2007)

We discuss information-theoretic anonymity metrics, that use entropy over the distribution of all possible recipients to quantify anonymity. We identify a common misconception: the entropy of the distribution describing the potentialreceivers does not always decrease given more information.We show the relation of these a-posteriori distributions with the Shannon conditional entropy, which is an average overall possible observations.
Establishing Chain of Trust in Reconfigurable Hardware
Authors: Thomas Eisenbarth, Tim Guneysu, Christof Paar, Ahmad-Reza Sadeghi, Marko Wolf, Russell Tessier
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

Facing ubiquitous threats like computer viruses, trojans and theft of intellectual property, Trusted Computing (TC) is an emerging technology towards building trustworthy computing platforms. A recent initiative by the Trusted Computing Group (TCG) specifies the use of Trusted Platform Modules (TPM), currently implemented as dedicated, cost-effective crypto-chips mounted on the main board of computer systems. In this paper we propose implementations for TC functionalities based on more flexible and versatile approaches for reconfigurable and embedded architectures. Our approach allows for (i) a scalable design and update of TPM functionalities in embedded systems, (ii) the integration of the TPM hardware in the chain of trust to bind applications to the underlying TPM and the reconfigurable hardware, and (iii) the design of vendor independent TPMs.
Structural join and staircase join algorithms of sibling relationship
Authors: Chang-Xuan Wan, Xi-Ping Liu
Venue: Journal of Computer Science and Technology (2007)

The processing of XML queries can result in evaluation of various structural relationships. Efficient algorithms for evaluating ancestor-descendant and parent-child relationships have been proposed. Whereas the problems of evaluating preceding-sibling-following-sibling and preceding-following relationships are still open. In this paper, we studied the structural join and staircase join for sibling relationship. First, the idea of how to filter out and minimize unnecessary reads of elements using parent's structural information is introduced, which can be used to accelerate structural joins of parent-child and preceding-sibling-following-sibling relationships. Second, two efficient structural join algorithms of sibling relationship are proposed. These algorithms lead to optimal join performance: nodes that do not participate in the join can be judged beforehand and then skipped using B+-tree index. Besides, each element list joined is scanned sequentially once at most. Furthermore, output of join results is sorted in document order. We also discussed the staircase join algorithm for sibling axes. Studies show that, staircase join for sibling axes is close to the structural join for sibling axes and shares the same characteristic of high efficiency. Our experimental results not only demonstrate the effectiveness of our optimizing techniques for sibling axes, but also validate the efficiency of our algorithms. As far as we know, this is the first work addressing this problem specially.
Clisp: Conversational Lisp
Authors: W. Teitelman
Venue: IEEE Transactions on Computers (1976)

Clisp is an attempt to make Lisp programs easier to read and write by extending the syntax of Lisp to include infix operators, IF-THEN statements, FOR-DO-WHILE statements, and similar Algol-like constructs, without changing the structure or representation of the language. Clisp is implemented through Lisp's error handling machinery, rather than by modifying the interpreter. When an expression is encountered whose evaluation causes an error, the expression is scanned for possible Clisp constructs, which are then converted to the equivalent Lisp expressions. Thus, users can freely intermix Lisp and Clisp without ut having to distinguish which is which. Emphasis in the design and development of Clisp has been on the system aspects of such a facility, with the goal of producing a useful tool, not just another language. To this end, Clisp includes interactive error correction and many "do-what-I-mean" features.
Fast Electrical Correction Using Resizing and Buffering
Authors: S. K. Karandikar
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Current design methodologies are geared towards meeting different design criteria, such as delay, area or power. However, in order to correctly identify the critical parts of a circuit for optimization, the circuit has to be electrically clean - i.e., slews on each pin have to be within certain limits, a gate cannot drive more than a certain amount of capacitance, etc. Thus far, this requirement has largely been ignored in the literature. Instead, existing methods which optimize delay are used to fix electrical violations. This leads to solutions that are unnecessarily expensive, and still leave violations that remain unfixed. There is therefore a need for an area-efficient strategy that targets the electrical state of a circuit and fixes all violations quickly. This paper explicitly defines "electrical violations" and presents a flexible approach (called EVE, the electrical violation eliminator) for fixing these. Experimental results validate our approach.
The Display of Engineering and Scientific Data
Authors: J. E. George
Venue: IEEE Computer Graphics and Applications (1981)

Computer graphics has been used to display engineering and scientific data for a number of years. Early uses included graphing of simple functions or experimental data as an aid to understanding complex models. Significant improvements in graphics system capability have occurred since such early uses. Here, we will follow a typical engineering problem and analyze a number of graphical "solutions" to it, in order to show how state-of-the art computer graphics can aid engineers, scientists, and problem solvers. We will also examine some features that may become available in the future.
Observing Software Testing Practice from the Viewpoint of Organizations and Knowledge Management
Authors: Ossi Taipale, Katja Karhu, Kari Smolander
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

The objective of this qualitative study was to understand the complex practice of software testing, and based on this understanding, to develop hypotheses on testing organizations and knowledge management. The population of the study consisted of organizational units (OUs) that develop and test technical software for automation or telecommunication domains. First, a survey of testing practices was conducted and 26 OUs were interviewed. From this sample, five OUs were further selected for an in-depth case study. The study used grounded theory as its research method and the data was collected from 41 theme-based interviews. The analysis yielded hypotheses that included that the business orientation of an OU affects testing organization, knowledge management strategy, and outsourcing of testing. Further, identifying and avoiding barriers and using enablers improve knowledge transfer between development and testing. The results of this study can be used in developing the testing organization and the knowledge management strategy of an OU.
Scheduling of water distribution system rehabilitation using structured messy genetic algorithms
Authors: Driss Halhal, Godfrey A. Walters, Dragan A. Savic, Driss Ouazar
Venue: Evolutionary Computation (1999)

A methodology is presented for the optimal design and scheduling of investment for the rehabilitation of water distribution networks. Based on the evolutionary programming technique known as Structured Messy Genetic Algorithms, the methodology utilizes a multi-objective formulation which improves the evolutionary process and provides non-dominated optimal solutions over a range of costs and benefits. The model is applied to an example---a small artificial network of fifteen pipes. The effects on the optimal solutions of varying parameters such as interest rate and inflation rate are also investigated.
ICT in higher education: a case study of mediated blended-learning at the university of Aveiro
Authors: Isabel Huet, José Tavares, Nilza Costa, Fernando Ramos, Helder Caixinha, Bryn Holmes
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

Teaching in on-line and collaborative situations requires a variety of responses including changes in pedagogy as instructors taking the role of facilitators of information while guiding students toward solutions. In order for online learning to be successful, therefore, teachers as well as learners will need to explore new roles in the teaching-learning relationship. In this paper, the authors propose to examine how educators can mediate instruction by first designing their course goals and objectives and then consider how the on-line environment can best serve the instructional objectives and plan appropriate activities and assessment. We seek to explore the use of online environments as the bridge between real world and reflective knowledge.
ARMS Collaborator -- intelligent agents using markets to organise resourcing in modern enterprises
Authors: B. Virginas, C. Voudouris, G. Owusu, G. Anim-Ansah
Venue: BT Technology Journal (2007)

An efficient deployment of the BT workforce in response to the dynamic nature of customer requests for services is crucial to BT's ability to compete in the ever-competitive telecommunications markets. The Automated Resource Management System (ARMS) is being developed to tackle this challenging problem. Its aim is to efficiently utilise the BT workforce by intelligently assigning engineers in line with forecast and real jobs. ARMS has three major functional components -- Forecasting and Job Generation (FJG), Dynamic Planner (DP) and Collaborator.This paper is based on Collaborator -- a computer system responsible for monitoring and supporting resource redistribution decision-making in BT's operational resource management units. Collaborator enhances the deployment process by allowing dynamic redistribution of engineers among a group of customer service teams (CSTs) so that resource utilisation is improved. Collaborator focuses on balancing the workforce across multiple patches. Collaborator is formulated as a multi-agent coordination problem. Various software agents support the manager's decision-making process. BT aims to further optimise resource deployment by using this novel approach, and ultimately to substantially reduce its operational costs.
Curvature-based shading of translucent materials, such as human skin
Authors: Konstantin Kolchin
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

The paper introduces a new approximate method for rendering translucent materials. We represent the surface around a point to be rendered in Monge's form using principal curvatures. The subsurface reflectance equation in the dipole diffusion approximation [Jensen et al. 2001] is then integrated over the surface. The outgoing radiance at the point is expressed as a function of principal curvatures and light vector components along the principal directions. This function can be precomputed as a 2D lookup table, which can be stored as a texture image. The paper presents preliminary results of our work on implementation of the model described.
Interview with Chris Kyriakakis: (August 10, 2007)
Authors: Newton Lee
Venue: Computers in Entertainment (CIE) (2007)

Chris Kyriakakis is Associate Professor of Audio Signal Processing at the University of Southern California's Viterbi School of Engineering, and he is Deputy Director of the Integrated Media Systems Center (IMSC), a National Science Foundation Engineering Research Center. He is also Chief Technology Officer/Founder of Audyssey Laboratories, Inc. a cutting-edge audio company that delivers algorithms for improving sound in homes, theaters, portable devices, and automobiles. He is the recipient of a 2006 World Technology Award. In the video interview, you will hear his answers to the following questions: 1. You have conducted research on the impact of music on perceived emotion of film. Can you tell us what it is about? 2. You are the co-founder of the Immersive Audio Laboratory at the USC Integrated Media Systems Center. What are some of the cutting-edge research projects at your Lab? 3. You have co-founded Audyssey Laboratories to commercialize your research projects. What is the biggest challenge in transforming research ideas into commercial products? 4. You won the 2006 World Technology Award last year. Congratulations! How do you envision changing the world for the better by means of new technologies? 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
Software Effort Estimation using Machine Learning Techniques with Robust Confidence Intervals
Authors: Petronio L. Braga, Adriano L. I. Oliveira, Silvio R. L. Meira
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

The precision and reliability of the estimation of the effort of software projects is very important for the competitiveness of software companies. Good estimates play a very important role in the management of software projects. Most methods proposed for effort estimation, including methods based on machine learning, provide only an estimate of the effort for a novel project. In this paper we introduce a method based on machine learning which gives the estimation of the effort together with a confidence interval for it. In our method, we propose to employ robust confidence intervals, which do not depend on the form of probability distribution of the errors in the training set. We report on a number of experiments using two datasets aimed to compare machine learning techniques for software effort estimation and to show that robust confidence intervals can be successfully built.
Improving Execution Speed of FPGA using Dynamically Reconfigurable Technique
Authors: Roel Pantonial, Md. Ashfaquzzaman Khan, Naoto Miyamoto, Koji Kotani, Shigetoshi Sugawa, Tadahiro Ohmi
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

This paper studies issues concerning dynamically reconfigurable FPGA (DRFPGA). It reports the architecture and performance of Flexible Processor III (FP3), a newly proposed DRFPGA. The FP3 employs a new shift register-type temporal interconnect to reduce operation delay. Designed and fabricated in 0.35um 2P3M CMOS technology, FP3 works correctly as a multi-context FPGA. Our experimental results show that there exist cases where the best user circuit speed was achieved when 2 contexts were in use for a benchmark circuit. This is because of the reduction of buffers in the critical path by temporal partitioning.
Virtual Machine Communication for the Implementation of Decision Support Systems
Authors: J. J. Donovan
Venue: IEEE Transactions on Software Engineering (1977)

This paper presents the use of the virtual machine concept as a software engineering tool. The focus is on techniques that allow the rapid integration and assimilation of existing data, models, analytical facilities, report generation facilities, and data base management systems. Since many of these models, programs, and facilities run under different operating systems, they often are incompatible with each other. By combining multiple virtual machines in a particular configuration, and allowing for communication among them, it has been possible to overcome these difficulties. The result is a set of software engineering tools that seem particularly useful in decision support systems. We present the application of these tools along with the software techniques used to implement them, and quantify some of their costs and benefits.
Comment on "Pattern Classification Design by Linear Programming"
Venue: IEEE Transactions on Computers (1969)

In a recent paper,1a linear programming method was proposed for finding linear discriminant functions. The dual linear program is a much smaller problem with upper bounded variables, which can be solved efficiently.
The scheme environment: dynamic variables
Authors: William Clinger
Venue: ACM SIGPLAN Lisp Pointers (1987)

Scheme variables have static scope and indefinite extent. That is, the visibility (or scope) of a Scheme variable can be determined statically by looking at the lexical structure of a program, and the lifetime (or extent) of the variable is unbounded. The reason variables have indefinite extent in Scheme is that they may be remembered by procedures created as the result of evaluating a lambda expression.
Study of Ontology-based Semantic Matching of Model Function System
Authors: Hong-mei Zhu, Yong-quan Liang, Wen-juan Lian, Qi-jia Tian, Yong Zhang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Semantic matching of the function of models is the foundation of implementing models automatic discovery and sharing in models management systems. Method of ontology-based model function's semantic matching system (OMFSMS) is proposed. By this method, distributed stored models are implemented as Web services. Models' functionality and users' requirement are described by OWL-S and registered to a model base. Decision ontology is exploited to represent the semantic of the decision models function. Based on the above, ontology-based matching mechanism is proposed, and its functionality and matching algorithm is described. We also argue that to improve the requesting efficiency the idea of precalculation is carried out and the structure of model resource annotation base is analyzed. At last, the conclusion is done of the system.
Enabling Session Mobility in Full Mesh Conferencing Model
Authors: Wajdi Elleuch, Alain C. Houle, Samuel Gunette
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

to another one while maintaining communication is a real need to maximize end-user service experience and to benefit from the capacities of each available device in the user environment. This service ubiquity can be realized by session mobility between devices. Many session transfer use-cases can be supported to enable different service modes and options within a two-party communication context. Otherwise, enabling session mobility in a multiparty conferencing, like the full mesh communication model, can be more complex. This work describes a solution to support session mobility options in the full mesh conferencing by extending existing abstract message protocol and to map them using Session Initiation Protocol (SIP). Introducing session mobility in full-mesh conferencing causes different extra message traffic depending on the used mode (Mobile Node Control Mode or Session Handoff Mode). At the end, we propose a comparative study to determine the message traffic for each mode depending on the number of participants and the events included in conferencing scenarios. Index Terms--Full mesh multiparty conference, Mobile communication, Session mobility, SIP protocol
Measuring Concavity on a Rectangular Mosaic
Authors: J. Sklansky
Venue: IEEE Transactions on Computers (1972)

A theory for describing and measuring the concavities of cellular complexes (digitized silhouettes) is developed. This theory involves the use of the minimum-perimeter polygon and its convex hull.