ppxscal/embedding_network huggingface dataset:
Applying Noise Handling Techniques to Genomic Data: A Case Study
Authors: Choh Man Teng
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Osteogenesis Imperfecta (OI) is a genetic collagenousdisease associated with mutations in one or both of thegenes COLIA1 and COLIA2. There are at least four knownphenotypes of OI, of which type II is the severest and oftenlethal. We identified three approaches to noise handling,namely, robust algorithms, filtering, and polishing,and evaluated their effectiveness when applied to the problemof classifying the disease OI based on a data set ofamino acid sequences and associated information of pointmutations of COLIA1. Preliminary results suggest that eachnoise handling mechanism can be useful under different circumstances.Filtering is stable across all cases. Pruningwith robust c4.5 increased the classification accuracy insome cases, and polishing gave rise to some additional improvementin classifying the lethal OI phenotype.
An augmenting graph approach to the stable set problem in P5-free graphs
Authors: Rodica Boliac, Vadim V. Lozin
Venue: Discrete Applied Mathematics (2003)

The complexity status of the stable set problem in the class of P5-free graphs is unknown. In the present paper we study an approach to the problem based on finding augmenting graphs. The main result is that the stable set problem in the class of P5-free graphs is polynomially equivalent to the problem of finding augmenting graphs containing a P4. We apply this result to detect a new infinite family of graph classes where the problem has a polynomial time solution. The new family generalizes several previously known results.
A bijection between directed column-convex polyominoes and ordered trees of height at most three
Authors: Emeric Deutsch, Helmut Prodinger
Venue: Theoretical Computer Science (2003)

A bijection is given between the set of directed column-convex polyominoes of area n and the set of ordered trees of height at most three and having n edges. Additional bijections with less well known combinatorial objects are sketched.
Robust Multicasting Using An Underlying Link State Unicast Protocol
Authors: Gretchen H. Lynn, Taieb F. Znati
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

In order for mobile ad-hoc networks (manets) to be a viable alternative to infrastructured wired and wireless networks, efficient reliable multicast protocols need to be established. In this paper, we propose a Robust Multicast Routing algorithm (RoMR), for ad-hoc networks.In order to increase reliability, RoMR builds multiple trees from a sender to each of the receivers in the multicast group. A novel technique to predict the likelihood that a link will continue to exist into the next time span is based on successive power levels of the receivedsignal from neighboring nodes. These predictions are used during the creation of the multicast trees. Another unique aspect of RoMR is that links that are predicted to be less prone to failure than other links may be shared among several trees. Forward error correcting codingtechniques reduce the total number of extra packets added to the original data packets from the source into the network increasing the ef.ciency of protocol.
Hybrid organic-inorganic light-emitting diodes
Authors: O. N. Ermakov, M. G. Kaplunov, O. N. Efimov, I. K. Yakushchenko, M. Yu. Belov, M. F. Budyka
Venue: Microelectronic Engineering (2003)

We demonstrate the hybrid organic-inorganic LEDs based on GaN and InGaN blue emitters with some organic luminophores providing blue, green, red and white emission colors with high luminous efficiency. The color of the emitted light from the GaN-based LED can be changed by varying the current through the device due to change in the relation between the UV and visible components of GaN electroluminescence.
Knowledge-Based Exception Handling in Securities Transactions
Authors: Minhong Wang, Huaiqing Wang, Kwok Kit Wan, Dongming Xu
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

With rising trading volumes and increasing risks in securities transactions, the securities industry is making an effort to achieve straight through processing to shorten the trade lifecycle and minimize transaction risk. While attempting to shorten the settlement cycle, the trade information must be passed within the trade lifecycle in a timely and accurate fashion. Exception handling is critical to make sure trades that give rise to exceptions or trades containing errors need to be detected and reconciled in compressed timescales. In order for aknowledge level solution for exception handling, the technology of intelligent agents is applied in this research. Intelligent agents with their knowledge base and properties of autonomy, activity and proactivity are well suited for business exception handling. Based on analysis on exceptions occurred in securities transactions and process of exception reconciliation, several types of intelligent agents are proposed and a multi-agent framework is presented for exception handling in securities trading. Furthermore, business knowledge such as businessrules and strategies are extracted from securities trading and settlement practice, and applied to the design of individual agents to make them act autonomously and collaboratively to fulfil the goal of exception reconciliation. By separating business logic from business model, such business rules approach can enhance the flexibility and adaptability of our agent-based exception handling system.
Interactive Distributed Guided Tours of Historical Sites
Authors: Dorin-MirceaI Popovici, Serge Morvan, Eric Maisel, Jacques Tisseau
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

In this paper we propose a new metaphor ofinformation retrieving, usable in heritage managementand publishing. Based on the net, the user is able toparticipate in virtual guided tours, sessions ofconferences-like. A human expert will be the guide for allthe connected users. He will use different media(sound/video) to communicate; the members of the guidedgroup will communicate between them through chatsessions.Each virtual tourist will be autonomous in its 3Dworld movements but he will receive audio/videoinformation or other multimedia documents or 3Dobjects, eventually autonomous entities placed in its 3Dvirtual universe, from its guide.The guide is able to suggest to its group of touristssome interesting viewpoints during the tour. More, he isable to augment the database, particularly the associatedbehaviours to the entities. It is enough to analyse theentities in a scene and to attach them some newbehaviours. For example, he can place in theenvironment some virtual guides, and the users willinteract with them. These virtual guides recognise somekeywords or intentions; i.e. if a tourist spends some timenear a specific place, the virtual guide will initiate adialog upon the place's history. The user is able to cancelthe dialog with a virtual guide and return to its group.The application is based on the ARéViJava (Atelier deRéalite Virtuelle) platform, developed in our laboratory.
A Modular Approach to Mobile QoS Signaling&mdash; Motivation, Design Implementation
Authors: Nicole Karsten-Berier, Martin Karsten, Jens Schmitt, Ralf Steinmetz
Venue: Multimedia Tools and Applications (2004)

In order to support mobile multimedia applications in next generation wireless IP-based networks, it is necessary to deliver seamless voice, video and data at high quality. Therefore, session mobility and Quality of Service (QoS) for mobile end systems are required. Within this article, the authors point out a new way to approach the problem. Instead of tightly coupling a modified QoS signaling mechanism with a certain mobility mechanism, a more generic and long-term solution is proposed and exemplified on the basis of existing IETF protocols. The connection-less IP network layer is enhanced by a lightweight and truly optional connection-oriented mobile network service, which offers the possibility to establish soft state unicast connections at the network layer. Hence, a connection-oriented network service is available within a radio access network (RAN) architecture to all end systems&mdash;mobile or fixed&mdash;independent of the application. Thereby, it is possible to integrate QoS and connectivity signaling for mobile end systems, as well as other connection-oriented services like explicit routing or load balancing.
Special functions as solutions to discrete Painlev&#x00E9; equations
Authors: K. M. Tamizhmani, A. Ramani, T. Tamizhmani, B. Grammaticos
Venue: Journal of Computational and Applied Mathematics (2003)

We present results on special solutions of discrete Painlevé equations. These solutions exist only when one constraint among the parameters of the equation is satisfied and are obtained through the solutions of linear second-order (discrete) equations. These linear equations define the discrete analogues of special functions.
Mobile computing business factors and operating systems
Authors: Julie R. Mariga
Venue: Managing e-commerce and mobile computing technologies (2003)

This chapter introduces the enormous impact of mobile computing on both companies and individuals. Companies face many issues related to mobile computing. For example: which devices will be supported by the organization? which devices will fulfill the business objectives? which form factor will win? which features and networks will future devices offer? which operating systems will they run? what will all this cost? what are the security issues involved? what are the business drivers? This chapter will discuss the major business drivers in the mobile computing field, and provide an analysis of the top two operating systems that are currently running the majority of mobile devices. These platforms are the 1) Palm operating system (OS), and 2) Microsoft Windows CE operating system. The chapter will analyze the strengths and weaknesses of each operating system and discuss market share and future growth.
Recursive solutions of the discrete time Riccati equation
Authors: N. Assimakis, S. Roulis, D. Lainiotis
Venue: Neural, Parallel Scientific Computations (2003)

In this paper recursive algorithms for solving the discrete time Riccati equation are developed for the cases where no measurement is exact or the plant noise covariance matrix is positive definite or the transition matrix is nonsingular. It is pointed out that the faster algorithm can be determined from the state and measurement vector dimensions.
Pervasive Servers: A framework for creating a society of appliances
Authors: Tatsuo Nakajima
Venue: Personal and Ubiquitous Computing (2003)

The paper proposes a framework to support spontaneous interaction among information appliances in our daily computing environments by creating a society of appliances. Our framework, that we call Pervasive Servers, embeds micro-servers called stationary pervasive servers everywhere. Also, a personal pervasive server that is carried by each person coordinates the embedded servers that are near to the person. The framework is very attractive because it is easy to personalise the coordination according to each person's policy. We also show four applications using our framework.
XSLT Template Design for Generating the Web Presentation Layer
Authors: Jung-Hwa Chae, Cheol-Jung Yoo, Yong-Sung Kim, Ok-Bae Chang
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

In Web-based information systems, separating businessprocess logic from data and presentation logiccreates a wide range of advantages. However, this separationis not easily achieved; even the data logic may benot separated from the presentation layer. Therefore itis necessary to define an abstract model for businessprocesses, and then to map the model into a user's dynamicinterface using the logic separating strategy. Thispaper presents a stylesheet method for recognizing theprocess by extending the XSLT (Extensible StylesheetLanguage Transformations) in order to achieve logicseparation. This discussion will provide an abstractspecification of the business process and a scheme thatextracts business model factors and their interactionsusing a Petri-net notation to show the business modelfrom the process point of view. This is an attempt toseparate the user interaction from the business process,that is, the separating of the dynamic components of theinteraction Web document from the process structure ofthe Web applications. As a result, the development ofservice-oriented Web sites is made very easy and canbe changed without affecting the other modules by virtueof the modularization concept. This facilitates developmentand maintenance of Web applications inindependent manner.
Co-occurrences of antonymous adjectives and their contexts
Authors: John S. Justeson, Slava M. Katz
Venue: Computational Linguistics (1991)

Charles and Miller propose that lexical associations between antonymous adjectives are formed via their co-occurences within the same sentence (the co-occurrence hypothesis), rather than via their syntatic substitutability (the substitutability hypothesis), and that such co-occurrences must take place more often than expected by chance. This paper provides empirical support for the co-occurrence hypothesis in a corpus analysis of all high-frequency adjectives and their antonyms and of a major group of morphologically derived antonyms (e.g., impossible, un-happy). We show that very high co-occurrence rates do appear to characterize all antonymous adjective pairs, supporting the precondition for the formation of the association; and we find that the syntactic contexts of these co-occurrences raise the intrinsic associability of antonyms when they do co-occur. We show that via one of these patterns, mutual substitution within otherwise repeated phrases in a sentence, the co-occurrences hypothesis captures the generalizations that were the basis for the substitutability hypothesis for the formation of antonymic associations.
ILP Models for Energy and Transient Power Minimization During Behavioral Synthesis
Authors: Saraju P. Mohanty, N. Ranganathan, Sunil K. Chappidi
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

The reduction of peak power, peak power differential,average power and energy are equally important in thedesign of low-power battery driven portable applications.In this paper, we introduce a parameter called "cyclepower function" (CPF-DFC) that captures the above powercharacteristics in the context of multiple supply voltage(MV) and dynamic frequency clocking (DFC) based designs.Further, we present ILP formulations for the minimizationof CPF-DFC during datapath scheduling. We conductedexperiments on selected high-level synthesis benchmarksfor various resource constraints. Experimental results showthat significant reduction in power, energy, and energy delayproduct, can be obtained using the proposed method.
Black Box Debugging
Authors: James A. Whittaker, Herbert H. Thompson
Venue: Queue (2003)

Modern software development practices build applications as a collection of collaborating components. Unlike older practices that linked compiled components into a single monolithic application, modern executables are made up of any number of executable components that exist as separate binary files.
On the medium access control problem in Ad hoc networks with smart antennas
Authors: Karthikeyan Sundaresan, Raghupathy Sivakumar
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2003)

In this paper, we address the problem of medium access control in ad-hoc networks with fully adaptive array antennas, which to the best of our knowledge is one of the first efforts of its kind. We show that, unlike in the case of directional and switched beam antennas, significant performance improvement can be leveraged with just a simple extension to CSMA/CA that we refer to as CSMA/CA (k). We than provide PHY layer based insights into why a MAC scheme that is smarter than CSMA/CA (k), and can achieve significantly better performance is possible in the target environment. Finally, we propose an idealized protocol called SMART-MAC that builds on the insights.
Multi-finger and whole hand gestural interaction techniques for multi-user tabletop displays
Authors: Mike Wu, Ravin Balakrishnan
Venue: Proceedings of the 16th annual ACM symposium on User interface software and technology (2003)

Recent advances in sensing technology have enabled a new generation of tabletop displays that can sense multiple points of input from several users simultaneously. However, apart from a few demonstration techniques [17], current user interfaces do not take advantage of this increased input bandwidth. We present a variety of multifinger and whole hand gestural interaction techniques for these displays that leverage and extend the types of actions that people perform when interacting on real physical tabletops. Apart from gestural input techniques, we also explore interaction and visualization techniques for supporting shared spaces, awareness, and privacy. These techniques are demonstrated within a prototype room furniture layout application, called RoomPlanner.
A spatial logic for concurrency (part I)
Authors: Luís Caires, Luca Cardelli
Venue: Information and Computation (2003)

We present a logic that can express properties of freshness, secrecy, structure, and behavior of concurrent systems. In addition to standard logical and temporal operators, our logic includes spatial operations corresponding to composition, local name restriction, and a primitive fresh name quantifier. Properties can also be defined by recursion; a central aim of this paper is then the combination of a logical notion of freshness with inductive and coinductive definitions of properties.
Performance Optimization of a Combined Heat Pump Cycle
Authors: Lingen Chen, Yuehong Bi, Fengrui Sun, Chih Wu
Venue: Open Systems Information Dynamics (2003)

A steady flow combined heat pump cycle model with heat resistance, heat leakage and internal irreversibility is built in this paper. The optimal performance of the model is studied. The relation between optimal heating load and coefficient of performance (COP), as well as the maximum COP and the corresponding heating load are derived.
ARCHITECT-R: a system for reconfigurable robots design
Authors: R. A. Gonçalves, P. A. Moraes, J. M. P. Cardoso, D. F. Wolf, M. M. Fernandes, R. A. F. Romero, E. Marques
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

An increasing interest in the design of mobile robots has been observed in recent years, which is mainly motivated by technological advances that may allow their application to consumer markets, in addition to industrial areas.Although sophisticated techniques have been developed, choosing the appropriate hardware-software partitioning and programming robot functions are still very complex tasks.Current approaches often involve the design and implementation of hardwired solutions, with the associated problems of a long development cycle and inflexibility.In this paper we present a framework called ARCHITECT-R, which aims to design and program specialized hardware for robots based on FPGAs. We also present the first results obtained using this framework.
Improved genetic algorithm for the permutation flowshop scheduling problem
Authors: Srikanth K. Iyer, Barkha Saxena
Venue: Computers and Operations Research (2004)

Genetic algorithms (GAs) are search heuristics used to solve global optimization problems in complex search spaces. We wish to show that the efficiency of GAs in solving a flowshop problem can be improved significantly by tailoring the various GA operators to suit the structure of the problem. The flowshop problem is one of scheduling jobs in an assembly line with the objective of minimizing the completion time or makespan. We compare the performance of CA using the standard implementation and a modified search strategy that tries to use problem specific information. We present empirical evidence via extensive simulation studies supported by statistical tests of improvement in efficiency.
Time Warp Cancellation Optimisations on High Latency Networks
Authors: K. A. Iskra, G. D. van Albada, P. M. A. Sloot
Venue: Proceedings of the Seventh IEEE International Symposium on Distributed Simulation and Real-Time Applications (2003)

We investigate the performance of the Time Warp kernel APSIS when running on various communication layers, in particular on a wide-area Grid. Several cancellation strategies are tried, among them the lazy cancellation and a little known bulk anti-messages optimisation. Our experiments with an Ising spin simulation indicate that the slowdown caused by high latency networks, while signi.cant, is not catastrophic, and that it can be significantly reduced using the lazy cancellation. Experiments suggest that further improvements can be expected if a more elaborate communication infrastructure is put in place.
Labrat LIMS: an extensible framework for developing laboratory information management, analysis, and bioinformatics solutions for microarrays
Authors: Marcus R. Breese, Matthew J. Stephens, Jeanette N. McClintick, Matthew W. Grows, Howard J. Edenberg
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

The biotechnology industry has long recognized the need for robust methods for tracking samples and data; however, it is only with the recent widespread adoption of genomic scale experiments that smaller academic facilities have also begun to appreciate the value of laboratory information management systems (LIMS) for use in tracking samples through the many procedures involved, including automated data collection and analysis. We have designed an extensible LIMS database backend collectively called Labrat LIMS. The Labrat LIMS database is an extremely flexible reference schema for implementing a generic LIMS system. Additionally, we have created two front-end implementations for the Labrat LIMS database: Labrat LIMS Web Interface and Microarray Data Portal for use in sample tracking and microarray data analysis, respectively. Although designed primarily for microarray sample tracking and analysis, we believe that the flexibility of generic data management and multiple front-end interface architecture make Labrat LIMS an extremely robust LIMS architecture. Here we present the schema and implementation of this system.
Structural ambiguity and lexical relations
Authors: Donald Hindle, Mats Rooth
Venue: Computational Linguistics (1993)

We propose that many ambiguous prepositional phrase attachments can be resolved on the basis of the relative strength of association of the preposition with verbal and nominal heads, estimated on the basis of distribution in an automatically parsed corpus. This suggests that a distributional approach can provide an approximate solution to parsing problems that, in the worst case, call for complex reasoning.