ppxscal/embedding_network huggingface dataset:
K-Ranked Covariance Based Missing Values Estimation for Microarray Data Classification
Authors: Muhammad Shoaib B. Sehgal, Iqbal Gondal, Laurence Dooley
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

Microarray data often contains multiple missing genetic expression values that degrade the performance of statistical and machine learning algorithms. This paper presents a K ranked diagonal covariance-based missing value estimation algorithm (KRCOV) that hasdemonstrated significantly superior performance compared to the more commonly used K-nearest neighbour (KNN) imputation algorithm when it is applied to estimate missing valuesof BRCA1, BRCA2 and Sporadic genetic mutation samples present in ovarian cancer. Experimental results confirm KRCOV outperformed both KNN and zero imputation techniques in terms of their classification accuracies when used to impute randomly missing values from 1% to 5%. The classifier used for this purpose was the Generalized Regression Neural Network. The paper also provides a hypothesis for why KRCOV performs better than KNN not only for bioinformatics data but also for other data types having strong correlated values.
Inequalities for the curvature of curves and surfaces
Authors: David Cohen-Steiner, Herbert Edelsbrunner
Venue: Proceedings of the twenty-first annual symposium on Computational geometry (2005)

In this paper, we bound the difference between the total mean curvatures of two closed surfaces in R3 in terms of their total absolute curvatures and the Fréchet distance between the volumes they enclose. The proof relies on a combination of methods from algebraic topology and integral geometry. We also bound the difference between the lengths of two curves using the same methods.
Adaptive surface-deformable model with shape-preserving spring: Research Articles
Authors: Yoo-Joo Choi, Min Hong, Min-Hyung Choi, Myoung-Hee Kim
Venue: Computer Animation and Virtual Worlds (2005)

This paper presents a multi-resolutional surface deformable model with physical property adjustment scheme and shape-preserving springs to represent surface-deformable objects efficiently and robustly. In order to reduce the computational complexity while ensuring the same global volumetric behaviour for the deformable object, we introduce a multi-resolutional mass-spring model that is locally refined using the modified-butterfly subdivision scheme. For robust deformation, a shape-preserving spring, which helps to restore the model to the original shape, is proposed to reduce the animation instability. Volume and shape preservation is indirectly achieved by restoring the model to the original shape without computing the actual volume and associated forces at every iteration. Most existing methods concentrate on visual realism of multi-resolutional deformation and often neglect to maintain the dynamic behavioural integrity between detail levels. In order to preserve overall physical behaviour, we present a new scheme for adjusting physical properties between different levels of details. During the animation of deformable objects, the part of the object under external forces beyond a threshold or with large surface curvature variations is refined with a higher level of detail. The physical properties of nodes and springs in the locally refined area are adjusted in order to preserve the total mass and global behaviour of the object. The adequacy of the proposed scheme was analysed with tests using practical mesh examples. Experimental results demonstrate improved efficiency in object deformation and preservation of overall behaviour between different levels. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Activity detection for information access to oral communication
Authors: Klaus Ries, Alex Waibel
Venue: Proceedings of the first international conference on Human language technology research (2001)

Oral communication is ubiquitous and carries important information yet it is also time consuming to document. Given the development of storage media and networks one could just record and store a conversation for documentation. The question is, however, how an interesting information piece would be found in a large database. Traditional information retrieval techniques use a histogram of keywords as the document representation but oral communication may offer additional indices such as the time and place of the rejoinder and the attendance. An alternative index could be the activity such as discussing, planning, informing, story-telling, etc. This paper addresses the problem of the automatic detection of those activities in meeting situation and everyday rejoinders. Several extensions of this basic idea are being discussed and/or evaluated: Similar to activities one can define subsets of larger database and detect those automatically which is shown on a large database of TV shows. Emotions and other indices such as the dominance distribution of speakers might be available on the surface and could be used directly. Despite the small size of the databases used some results about the effectiveness of these indices can be obtained.
Linear reachability problems and minimal solutions to linear Diophantine equation systems
Authors: Gaoyan Xie, Cheng Li, Zhe Dang
Venue: Theoretical Computer Science (2004)

The linear reachability problem for finite state transition systems is to decide whether there is an execution path in a given finite state transition system such that the counts of labels on the path satisfy a given linear constraint. Using some known results on minimal solutions (in nonnegative integers) for linear Diophantine equation systems, we present new time complexity bounds for the problem. In contrast to the previously known results, the bounds obtained in this paper are polynomial in the size of the transition system in consideration, when the linear constraint is fixed. The bounds are also used to establish a worst-case time complexity result for the linear reachability problem for timed automata.
Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
Authors: Dario A. Bini, Luca Gemignani, Victor Y. Pan
Venue: Numerische Mathematik (2005)

We introduce a class ** of n&#x00d7;n structured matrices which includes three well-known classes of generalized companion matrices: tridiagonal plus rank-one matrices (comrade matrices), diagonal plus rank-one matrices and arrowhead matrices. Relying on the structure properties of **, we show that if A &#x2208; ** then A&#x2032;=RQ &#x2208; **, where A=QR is the QR decomposition of A. This allows one to implement the QR iteration for computing the eigenvalues and the eigenvectors of any A &#x2208; ** with O(n) arithmetic operations per iteration and with O(n) memory storage. This iteration, applied to generalized companion matrices, provides new O(n2) flops algorithms for computing polynomial zeros and for solving the associated (rational) secular equations. Numerical experiments confirm the effectiveness and the robustness of our approach.
book review: Using Wordstar, 3rd Ed. by Steve Ditlea (Que Corporation, 1990)
Venue: ACM SIGSMALL/PC Notes (1991)

This book is intended for users of all levels and is divided into three sections based on user level. The first section is written in tutorial style; the other two sections are written in reference style. Mr. Ditlea frequently uses figures and tables for clarity and easy reference. 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
Submitting for Hewlett-Packard Company
Authors: Barry Mathis
Venue: ACM SIGCHI Bulletin (1992)

The video "1995" is a vision of computing a few years out. It shows how integrated information technology can make significant changes in the way professionals accomplish their tasks. A variety of technologies are projected to suggest their potential for empowering people, while remaining realistic regarding technological evolution. 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
QoS Provisioning Framework for an OSD-Based Storage System
Authors: Yingping Lu, David H. C. Du, Tom Ruwart
Venue: Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (2005)

Quality of Service (QoS) is crucial for certain applications such as multimedia. As the Object-based Storage Device (OSD) protocol emerges as the next generation storage technology, QoS provisioning for OSD-based systems has also received a great deal of attention. In this paper, we propose a QoS framework for OSD-based storage system that integrates both the network QoS and storage QoS. We examine the existing OSD specification and analyze the QoS requirements for applications on OSD clients. Based on the QoS requirements analysis, we propose a three-level QoS specification. We further elaborate on extensions to the existing OSD and iSCSI protocol to support our QoS specification. These extensions are then incorporated with the current OSD reference implementation. Finally, we discuss both the implementation structure and issues encountered as part of this study.
Getting to the point: developing IT for the sharp end of healthcare
Authors: C. Nemeth, M. Nunnally, M. O'Connor, P. A. Klock, R. Cook
Venue: Journal of Biomedical Informatics (2005)

Healthcare demonstrates the same properties of risk, complexity, uncertainty, dynamic change, and time-pressure as other high hazard sectors including aviation, nuclear power generation, the military, and transportation. Unlike those sectors, healthcare has particular traits that make it unique such as wide variability, ad hoc configuration, evanescence, resource constraints, and governmental and professional regulation. While healthcare's blunt (management) end is more easily understood, the sharp (operator) end is more difficult to research the closer one gets to the sharp end's point. Understanding sharp end practice and cognitive work can improve computer-based systems resilience, which is the ability to perform despite change and challenges. Research into actual practice at the sharp end of healthcare will provide the basis to understand how IT can support clinical practice. That understanding can be used to develop computer-based systems that will act as team players, able to support both individual and distributed cognitive work at healthcare's sharp end.
Computational aesthetics as a tool for creativity
Authors: Gary R. Greenfield
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

We consider the problem of designing software tools that automatically evaluate the aesthetic content of images. Our purpose is to enhance the creative potential of generative art systems. We propose a number of meta-rules for enhancing creativity.
HAM-RPM (Hamburger Redepartnermodell): U. of Hamburg, FRG
Authors: Walther von Hahn, Wolfgang Hoeppner, Anthony Jameson, Wolfgang Wahlster
Venue: Issue 79 (January 1982) (1982)

The Natural Language system HAM-RPM simulates a dialogue partner conversing about one of several interchangeable scenes in colloquial German. The overall goals of the research have been twofold: simulating natural language dialogue behaviour by means of a computer is a promising and reliable method for establishing and testing theoretical models of language which beyond systematic properties try to integrate communicative and cognitive aspects. Second, in a variety of applications the accessability of other nonlinguistic computer systems can be enhanced by using natural language as a means of communication.
JRipples: A Tool for Program Comprehension during Incremental Change
Authors: Jonathan Buckner, Joseph Buchta, Maksym Petrenko, Vaclav Rajlich
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

Incremental software change adds new functionality to software. It is the foundation of software evolution, maintenance, iterative development, agile development, and other software processes. Highly interactive tool JRipples provides the programmer with the organizational support that makes the incremental change process easier and more systematic. JRipples supports impact analysis and change propagation, the two most difficult activities of the incremental change.
Basic concepts of quantum systems versus classical networks: Research Articles
Authors: Pier Paolo Civalleri, Marco Gilli, Michele Bonnin
Venue: International Journal of Circuit Theory and Applications (2004)

The paper is intended to establish a conceptual bridge between Classical Network Theory and Quantum Mechanics. The concept of time-reversal symmetry is extended from Quantum Mechanics to Network Theory (in the state equations description), while concepts of passivity and losslessness are extended from Network Theory to Quantum Mechanics. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Applications of Algebraic Multigrid to Large-Scale Finite Element Analysis of Whole Bone Micro-Mechanics on the IBM SP
Authors: Mark F. Adams, Harun H. Bayraktar, Tony M. Keaveny, Panayiotis Papdopoulos
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

Accurate micro-finite element analyses of whole bones require the solution of large sets of algebraic equations. Multigrid has proven to be an effective approach to the design of highly scalable linear solvers for solid mechanics problems. We present some of the first applications of scalable linear solvers, on massively parallel computers, to whole vertebral body structural analysis. We analyze the performance of our algebraic multigrid (AMG) methods on problems with over 237 million degrees of freedom on IBM SP parallel computers. We demonstrate excellent parallel scalability, both in the algorithms and the implementations, and analyze the nodal performance of the important AMG kernels on the IBM Power3 and Power4 architectures.
Appearance Modeling for Tracking in Multiple Non-Overlapping Cameras
Authors: Omar Javed, Khurram Shafique, Mubarak Shah
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

When viewed from a system of multiple cameras with non-overlapping fields of view, the appearance of an object in one camera view is usually very different from its appearance in another camera view due to the differences in illumination, pose and camera parameters. In order to handle the change in observed colors of an object as it moves from one camera to another, we show that all brightness transfer functions from a given camera to another camera lie in a low dimensional subspace and demonstrate that this subspace can be used to compute appearance similarity. In the proposed approach, the system learns the subspace of inter-camera brightness transfer functions in a training phase during which object correspondences are assumed to be known. Once the training is complete, correspondences are assigned using the maximum a posteriori (MAP) estimation framework using both location and appearance cues. We evaluate the proposed method under several real world scenarios obtaining encouraging results.
VLEI Code: An Efficient Labeling Method for Handling XML Documents in an RDB
Authors: Kazuhito Kobayashi, Wenxin Wenxin, Dai Kobayashi, Akitsugu Watanabe, Haruo Yokota
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

A number of XML labeling methods have been proposed to store XML documents in relational databases. However, they have a vulnerable point, in insertion operations. We propose the Variable Length Endless Insertable (VLEI) code and apply it to XML labeling to reduce the cost of insertion operations. Results of our experiments indicate that a combination of the VLEI code and Dewey order is effective for handling skewed insertions.
Personal Firewall for Pocket PC 2003: Design & Implementation
Authors: Willy Susilo, Russell James Ang, Cameron Allen George McDonald, Jianyong Huang
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Personal Digital Assistants (PDAs) are widely used and becoming indispensable tools of everyday life. Wired or wireless connection enables PDA users to connect to the Internet from any place, making security an extremely important issue in a pervasive computing environment. This paper investigates how to build a personal firewall for PDAs running Pocket PC 2003. This personal firewall allows the PDA user to perform access control based on a user-defined policy, and hence provides a security perimeter between the public network and the PDA. We provide a complete technical detail on how thefirewall can be built in a Pocket PC 2003 device. To the best of our knowledge, this is the first design and implementation personal firewalls for Pocket PC 2003 device which is explicit, open source and successfullyimplemented in any Pocket PC 2003 compatible devices, including HP iPaq H5550 and XDA2.0 2 smartphone.
Energy efficient communication in ad hoc networks from user's and designer's perspective
Authors: Alex Kesselman, Dariusz Kowalski, Michael Segal
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2005)

We consider a game that models the creation of a wireless ad hoc network, where nodes are owned by selfish agents. We study a novel cost sharing model in which agents may pay for the transmission power of the other nodes. Each agent has to satisfy some connectivity requirement in the final network and the goal is to minimize its payment with no regard to the overall system performance. We analyze two fundamental connectivity games, namely broadcast and convergecast. We study pure Nash equilibria and quantify the degradation in the network performance called the price of anarchy resulting from selfish behavior. We derive tight bounds on the price of anarchy for these games. We also study centralized network design. One of the most important problems in wireless ad hoc networks is the minimum-energy broadcast. Recently, there appeared many new applications such as real-time multimedia, battlefield communications and rescue operations that impose stringent end-to-end latency bounds on the broadcasting time. However, the existing algorithms that minimize the broadcasting energy tend to produce solutions with high latency. In this paper we consider the problem of bounded-hop broadcast. We present approximation and heuristic algorithms for this problem.
Language Systems, Inc.: description of the DBG system as used for MUC-4
Authors: Christine A. Montgomery, Bonnie Glover Stalls, Robert E. Stumberger, Naicong Li, Robert S. Belvin, Alfredo Arnaiz, Susan B. Hirsh
Venue: Proceedings of the 4th conference on Message understanding (1992)

LSI's Data Base Generation (DBG) system is a syntax-driven natural language processing system that integrates syntax and semantics to analyze message text. The goal of the DBG system is to perform full-scale lexical, syntactic, semantic, and discourse analyses of message text and produce a system-internal knowledge representation of the text that can serve as input to a downstream system or external data structure, such as the MUC-4 templates.
Evolutionary structural optimisation of dynamically loaded components in consideration of fatigue life
Authors: M. Haiba, D. C. Barton, P. C. Brooks, M. C. Levesley
Venue: Advances in Engineering Software (2005)

This paper presents an evolutionary structural optimisation strategy based on the concept of repeatedly removing sets of finite elements with the highest fatigue life. The practical application of the proposed strategy required the development of: the most appropriate stress calculation method, a suitable fatigue life evaluation technique and code to select and remove elements with the highest fatigue life. Results obtained using code written to implement the proposed optimisation strategy appear to be very promising, compared to corresponding results obtained using other optimisation methods. The proposed technique was found to be particularly powerful in optimising dynamically loaded components starting from basic ground structures.
The Effects of Stellar Winds on the Envelope Masses of Cooling Low-Mass Dwarfs
Authors: Lorne A. Nelson, Ernest P. Dubeau
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

The determination of the true ages of binary millisecond pulsars is critical to our understanding of their spin-down evolution. The only independent way to estimate these ages is to observe the temperatures of their binary companions and to infer their ages based on the results of detailed stellar evolution computations. In this paper we present recent calculations that quantify the effects of (parameterized) stellar winds on the mass of the envelopes of the white dwarf companions. The thickness of the hydrogen-rich envelopes governs the rate at which the companions cool. By exploring a large region of parameter space our preliminary conclusion is that self-induced stellar winds are not likely to have a significant effect on the cooling rates and thus on the inferred ages of the pulsars themselves. Finally we discuss the construction of an extensive library of computational results pertaining to the evolution of binary millisecond pulsar systems. This data is currently being disseminated by a web server that is capable of filling client requests for both raw data and for animations showing the detailed evolution of these systems over their entire lifetime.
Resource Allocation for Periodic Applications in a Shipboard Environment
Authors: Vladimir Shestak, Edwin K. P. Chong, Anthony A. Maciejewski, H. J. Siegel, Lotfi Benmohamed, I-Jeng Wang, Rose Daley
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02 (2005)

Providing efficient workload management is an important issue for a large-scale heterogeneous distributed computing environment where a set of periodic applications is executed. The considered distributed system is expected to operate in an environment where the input workload is likely to change unpredictably, possibly invalidating a resource allocation that was based on the initial workload estimate. The tasks consist of multiple application strings, each made up of an ordered sequence of applications. There are quality of service (QoS) constraints that must be satisfied for each string. This work addresses the problem of finding a robust initial allocation of resources to application strings that is able to absorb some level of unknown input workload increase without rescheduling. An allocation feasibility analysis is presented followed by four heuristics for finding a near-optimal allocation of resources. The performance of the proposed heuristics is evaluated and compared using simulation. The proposed heuristics also are compared to a mathematically derived upper bound.
Blind learners programming through audio
Authors: Jaime Sánchez, Fernando Aguayo
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

The development of programming skills is a motivating issue in computer science. Most programming languages are focused on sighted users. This study introduces APL, Audio Programming Language for blind learners. APL is based on audio interfaces to assist novice blind learners to develop problem solving and algorithmic thinking skills. APL was designed by and for blind learners to construct meaning by making programs. We tested APL with novice blind programmers during and after development. They tried, analyzed, and make improvements to APL. Learners wrote programs to solve problems with increasingly complexity. Our preliminary results evidence that audio programming languages such as APL can be constructed to fit the needs and mental models of blind learners to motivate and help them to enter to the programming world.