ppxscal/embedding_network huggingface dataset:
Bayesian Optimization Algorithm for the Non-unique Oligonucleotide Probe Selection Problem
Authors: Laleh Soltan Ghoraie, Robin Gras, Lili Wang, Alioune Ngom
Venue: Proceedings of the 4th IAPR International Conference on Pattern Recognition in Bioinformatics (2009)

DNA microarrays are used in order to recognize the presence or absence of different biological components (targets) in a sample. Therefore, the design of the microarrays which includes selecting short Oligonucleotide sequences (probes) to be affixed on the surface of the microarray becomes a major issue. This paper focuses on the problem of computing the minimal set of probes which is able to identify each target of a sample, referred to as Non-unique Oligonucleotide Probe Selection. We present the application of an Estimation of Distribution Algorithm (EDA) named Bayesian Optimization Algorithm (BOA) to this problem, for the first time. The presented approach considers integration of BOA and state-of-the-art heuristics introduced for the non-unique probe selection problem. This approach provides results that compare favorably with the state-of-the-art methods. It is also able to provide biologists with more information about the dependencies between the probe sequences of each dataset.
Automated Targeting for the MER Rovers
Authors: Tara Estlin, Rebecca Castano, Benjamin Bornstein, Daniel Gaines, Robert C. Anderson, Charles de Granville, David Thompson, Michael Burl, Michele Judd, Steve Chien
Venue: Proceedings of the Third IEEE International Conference on Space Mission Challenges for Information Technology (2009)

The Autonomous Exploration for Gathering Increased Science System (AEGIS) will soon provide automated targeting for remote sensing instruments on the Mars Exploration Rover (MER) mission, which currently has two rovers exploring the surface of Mars. Targets for rover remote-sensing instruments, especially narrow field-of-view instruments (such as the MER Mini-TES spectrometer or the 2011 Mars Science Laboratory (MSL) Mission ChemCam Spectrometer), are typically selected manually based on imagery already on the ground with the operations team. AEGIS enables the rover flight software to analyze imagery onboard in order to autonomously select and sequence targeted remote-sensing observations in an opportunistic fashionIn this paper, we first provide background information on the larger autonomous science framework in which AEGIS was developed. We then describe how AEGIS was specifically developed and tested on the JPL FIDO rover. Finally we discuss how AEGIS will be uploaded and used on the Mars Exploration Rover (MER) mission in mid 2009.
Cellular-Automaton Simulation of a Cumulative Jet Formation
Authors: Yu. Medvedev
Venue: Proceedings of the 10th International Conference on Parallel Computing Technologies (2009)

A new cellular-automaton FHP-GWC model is proposed. Computing experiments have been carried out with this model; they demonstrate a correlation of the new model with the physical laws.
Evaluating Gaze and Touch Interaction and Two Feedback Techniques on a Large Display in a Shopping Environment
Authors: Angelique Kessels, Evert Loenen, Tatiana Lashina
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

At Philips Research, an Intelligent Shop Window (ISW) was developed. With the ISW, a unique combination is made between a transparent display that is embedded in the window glass, and physical products presented in the shop window. In this paper, touch and gaze interaction with the large display in the ISW are investigated and evaluated. For sensing interfaces it is known that especially with gaze interaction, it is a challenge to communicate to the user that the system is ready and attending to the user, but also which part of the system the user can address. Therefore, two suitable feedback mechanisms for this interaction were designed and evaluated with users. The first was the 'polite products' concept, where products were placed on a turntable. When the user selects the product with either touch or gaze interaction, the product on the turntable turns towards the user. The second feedback method was a transparent light tile behind the products, which changed color when the product was selected. The evaluation results showed that the polite product concept was rated better than the light tile on almost every item related to hedonic values such as enjoyability and fun. Next to that it became clear that participants felt more in control when using touch interaction and that touch worked faster and more efficient than gaze interaction. However, gaze interaction was a fairly new and exotic interaction method for participants and they said they liked using gaze interaction. Especially the combination of gaze interaction with the polite products feedback method was very strong.
Underdetermined Sparse Blind Source Separation by Clustering on Hyperplanes
Authors: Beihai Tan, Zhao Min
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

In the underdetermined blind source separation and sparse component analysis, we get sensor signals. The mixed matrix and source signals aren’t known, where the number of sensor signals less than that of source signals, but we can know source signals are sparse, so we use the information to recover source signals by estimating the mixed matrix. This paper gives an algorithm for estimating mixed matrix based on sparse sources information in underdetermined blind separation by clustering on hyperplanes’ normal lines, and the good performance is shown by the last example.
Internationalizing Mainframe Applications through Screen Scraping
Authors: Chris Durand
Venue: Proceedings of the 3rd International Conference on Internationalization, Design and Global Development: Held as Part of HCI International 2009 (2009)

This paper is a case study describing the internationalization of a mainframe application without changing mainframe code. By utilizing screen scraping techniques, the project team created Chinese and Korean versions of mainframe application screens and reports. The paper describes specific issues encountered on the project, the solutions considered, and the strengths and weaknesses of the selected solution. It also describes an algorithm used to perform efficient translation of system messages with embedded variables. 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
Distinguishable entities: definition and properties
Authors: Monique Rolbert, Pascal Préa
Venue: Proceedings of the 12th European Workshop on Natural Language Generation (2009)

Many studies in natural language processing are concerned with how to generate definite descriptions that evoke a discourse entity already introduced in the context. A solution to this problem has been initially proposed by Dale (1989) in terms of distinguishing descriptions and distinguishable entities. In this paper, we give a formal definition of the terms "distinguishable entity" in non trivial cases and we show that its properties lead us to the definition of a distance between entities. Then, we give a polynomial algorithm to compute distinguishing descriptions.
Wedjat: A Mobile Phone Based Medicine In-take Reminder and Monitor
Authors: Mei-Ying Wang, P. H. Tsai, J. W. S. Liu, John K. Zao
Venue: Proceedings of the 2009 Ninth IEEE International Conference on Bioinformatics and Bioengineering (2009)

Out-patient medication administration has been identified as the most error-prone procedure in modern health¬care. Under or over doses due to erratic in-takes, drug-drug or drug-food interactions caused by un-reconciled prescriptions and the absence of in-take enforcement and monitoring mechanisms have caused medication errors to become the common cases of all medical errors. Most medication administration errors were made when patients bought different prescribed and over-the-counter medicines from several drug stores and use them at home without little or no guidance. Elderly or chronically ill patients are particularly susceptible to these mistakes. In this paper, we introduce Wedjat, a smart phone application designed to help patients avoiding these mistakes. Wedjat can remind its users to take the correct medicines on time and record the in-take schedules for later review by healthcare professionals. Wedjat has two distinguished features: (1) it can alert the patients about potential drug-drug/drug-food interactions and plan a proper in-take schedule to avoid these interactions; (2) it can revise the in-take schedule automatically when a dose was missed. In both cases, the software always tries to produce the simplest schedule with least number of in-takes. Wedjat is equipped with user friendly interfaces to help its users to recognize the proper medicines and obtain the correct instructions of taking these drugs. It can maintain the medicine in-take records on board, synchronize them with a data¬base on a host machine or upload them onto a Personal Heath Record (PHR) system. A proof-of-concept prototype of Wedjat has been implemented on Window Mobile platform and will be migrated onto Android for Google Phones. This paper introduces the system concept and design principles of Wedjat with emphasis on its medication scheduling algorithms and the modular implementation of mobile computing application.
An Immersive Approach to Evaluating Role Play
Authors: Lynne Hall, Ruth Aylett, Ana Paiva
Venue: Proceedings of the 9th International Conference on Intelligent Virtual Agents (2009)

Games and Virtual Environments populated with virtual agents are usually tested and evaluated assessing the player's experience and flow outside the game experience. However, with player enjoyment related to their sense of immersion, there is clear potential for immersing evaluation into game play. We have developed an immersive in-role evaluation approach and applied it to ORIENT (Overcoming Refugee Integration with Empathic Novel Technology), a role-playing game designed for intercultural training for 13-14 year olds.
Coupled Extensional-Torsional Vibration Frequency of Hoisting Rope in Tower-Type Friction Drive Hoist System
Authors: Guohua Cao, Zhencai Zhi, Weihong Peng, Xingguo Shao
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

In order to avoid resonance, and to enhance safety of hoisting system and monitoring reliability, an impact mechanical model of mine hoisting rope for friction drive hoist system was built. According to Hamilton principle and considering the effect of oriented pulley and hoisting rope string, coupled extensional-torsional and extensional only mathematical models of hoisting rope were deduced. Mode shape and transcendental equation of angular frequency were obtained based on the hypothesis that the wave of vibration propagated with sine shape. With numerical calculation, results show that the frequency considering the effect of oriented pulley and hoisting rope string was slightly lower comparing with the frequency ignoring the effect at the bottom of shaft, but much different at the mouth; and there is significant difference between coupled frequency and extensional vibration only. Thereby, to make the design and monitoring of mine hoisting much more reliably, it is suggested that the extensional-torsional coupled vibration of hoisting rope, oriented pulley and hoisting rope string should be considered.
Semantics of Metamodels in UML
Authors: Lijun Shan, Hong Zhu
Venue: Proceedings of the 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering (2009)

A modelling language can be defined by a meta-model in UML class diagram. This paper defines the semantics of such metamodels through two mappings: a signature mapping from metamodels to signatures of first order languages and an axiom mapping from metamodels to sets of axioms over the signature. Valid models, i.e. instances of the metamodel, are therefore mathematical structures in the signature that satisfies the axioms. This semantics definition enables us to analyse the logical consistency and completeness of metamodels. A software tool called LAMBDES is implemented to translate metamodels into first order logic systems and analyse them by employing the theorem prover SPASS. Case studies with the tool detected inconsistency and incompleteness in the metamodel of UML 2.0 and an AspectJ profile.
Iterative Flattening Search on RCPSP/max Problems: Recent Developments
Authors: Angelo Oddi, Riccardo Rasconi
Venue: Recent Advances in Constraints: 13th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2008, Rome, Italy, June 18-20, 2008, Revised Selected Papers (2009)

This paper proposes an iterative improvement algorithm for solving instances of the Resource Constraint Project Scheduling Problem with Time-Windows (RCPSP/max). The algorithm is based on Iterative Flattening Search (ifs), an effective meta-heuristic strategy proposed over the past years for solving multi-capacity optimization scheduling problems. Given an initial solution, ifs iteratively applies two steps: (1) a subset of solving decisions are randomly retracted from a current solution (relaxation-step); (2) a new solution is incrementally recomputed (flattening-step). At the end, the best solution found is returned. To the best of our knowledge this is the first paper which proposes a version of ifs for solving RCPSP/max instances. The main contribution of this paper is threefold: (1) we succeed in improving 15 out of 90 solutions with respect to the officially published current best, thus demonstrating the general efficacy of ifs; (2) we highlight an intrisic limitation of the original ifs strategy in solving RCPSP/max, such that under certain circumstances the two-step improvement loop can get stuck in a status where no solving decision can be retracted; (3) we propose two different escaping strategies which extend the original ifs procedure. An experimental evaluation ends the paper, comparing the performances of the proposed escaping strategies against the original ifs procedure.
Within-problem learning for efficient lower bound computation in Max-SAT solving
Authors: Han Lin, Kaile Su, Chu-Min Li
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

This paper focuses on improving branch-and-bound Max-SAT solvers by speeding up the lower bound computation. We notice that the existing propagation-based computing methods and the resolution-based computing methods, which have been studied intensively, both suffer from several drawbacks. In order to overcome these drawbacks, we propose a new method with a nice property that guarantees the increment of lower bounds. The new method exploits within-problem learning techniques. More specifically, at each branch point in the search-tree, the current node is enabled to inherit inconsistencies from its parent and learn information about effectiveness of the lower bound computing procedure from previous nodes. Furthermore, after branching on a new variable, the inconsistencies may shrink by applying unit propagation to them, and such process increases the probability of getting better lower bounds. We graft the new techniques into maxsatz and the experimental results demonstrate that the new solver outperforms the best state-of-the-art solvers on a wide range of instances including random and structured ones.
Optimum Histogram Pair Based Image Lossless Data Embedding
Authors: Guorong Xuan, Yun Q. Shi, Peiqi Chai, Jianzhong Teng, Zhicheng Ni, Xuefeng Tong
Venue: Transactions on Data Hiding and Multimedia Security IV (2009)

This paper presents an optimum histogram pair based image reversible data hiding scheme using integer wavelet transform and adaptive histogram modification. This new scheme is characterized by (1) the selection of best threshold T, which leads to the highest PSNR of marked image for a given payload; (2) the adaptive histogram modification, which aims at avoiding underflow and/or overflow, is carried out only when it is necessary, and treats the left side and right side of histogram individually, seeking a minimum amount of histogram modification; and (3) the selection of most suitable embedding region, which attempts to further improve the PSNR of marked image in particular when the payload is low. Consequently, to our best knowledge, it can achieve the highest visual quality of marked image for a given payload as compared with the prior arts of image reversible data hiding. The experimental results have been presented to confirm the claimed superior performance.
A Combination Classification Algorithm Based on Outlier Detection and C4.5
Authors: Shengyi Jiang, Wen Yu
Venue: Proceedings of the 5th International Conference on Advanced Data Mining and Applications (2009)

The performance of traditional classifier skews towards the majority class for imbalanced data, resulting in high misclassification rate for minority samples. To solve this problem, a combination classification algorithm based on outlier detection and C4.5 is presented. The basic idea of the algorithm is to make the data distribution balance by grouping the whole data into rare clusters and major clusters through the outlier factor. Then C4.5 algorithm is implemented to build the decision trees on both the rare clusters and the major clusters respectively. When classifying a new object, the decision tree for evaluation will be chosen according to the type of the cluster which the new object is nearest. We use the datasets from the UCI Machine Learning Repository to perform the experiments and compare the effects with other classification algorithms; the experiments demonstrate that our algorithm performs much better for the extremely imbalanced data sets.
On the Reachability Problem for Dynamic Networks of Concurrent Pushdown Systems
Authors: Mohamed Faouzi Atig, Ahmed Bouajjani
Venue: Proceedings of the 3rd International Workshop on Reachability Problems (2009)

We consider the problem of checking safety properties for concurrent programs. We assume that programs may have (potentially recursive) procedure calls as well as (unbounded) dynamic creation of parallel threads. Each procedure can have a finite number of local variables, and there is a finite number of global variables that can be accessed by all parallel threads. We assume that these variables range over a finite data domain (e.g., booleans).
Network Scanning on Multi Function Device
Authors: Dong-Hoon Lee, Sung-Gi Min
Venue: Proceedings of the 2009 First International Conference on Advances in Multimedia (2009)

Network print devices have evolved to support additional multifunction services, in particular a Scan Service. When network Scanners are installed in local office or enterprise networks, they need remote service, device, and job management capabilities so that administrators, operators, and End Users can monitor their health and status. Twain is an industry standard or protocol for applications that interface with scanning devices. It offers many advantages. TWAIN driver was designed to initiate a scanning session from hosts using the local interface (USB or IEEE1284). Thus, the addition of a network scanning component is necessary to support a network scanning system. A network scanning system offers the quality and convenience necessary to provide electronic document capture for internal operations and customer service. This document proposed the network scanning method using the TWAIN driver. This method of implementing electronic document capture and distribution, known as network scanning, into the TWAIN driver architecture is described. Network Scanning converts the scanned document image into TIFF, PDF or JPEG and formats delivers to user defined destinations utilizing SNMP and TCP protocols. The integration of network scanning into Samsung’s Digital Imager printer/scanner architecture is presented.
Learning to solve QBF
Authors: Horst Samulowitz, Roland Memisevic
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

We present a novel approach to solving Quantified Boolean Formulas (QBF) that combines a search-based QBF solver with marhine learning techniques. We show how classification methods can be used to predict run-times and to choose optimal heuristics both within a portfolio-based, and within a dynamic, online approach. In the dynamic method variables are set to a truth value according to a scheme that tries to maximize the probability of successfully solving the remaining sub-problem efficiently. Since each variable assignment can drastically change the problem-structure, new heuristics are chosen dynamically, and a classifier is used online to predict the usefulness of each heuristic. Experimental results on a large corpus of example problems show the usefulness of our approach in terms of run-time as well as the ability to solve previously unsolved problem instances.
Research on Adaptive Control Modeling of a Manure Spreader for Precision Agriculture
Authors: Zidong Yang, Ruicheng Du
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

This paper describes a general modeling and control approach for automating various agricultural machines for precision farming applications. An adaptive numerical modeling approach for describing the system input–output dynamics is proposed, and an optimal control that accounts for the control hardware limits is developed. Field tests have demonstrated the effectiveness of the theoretical development.
Experiences of participatory sensing in the wild
Authors: Mark Paxton, Steve Benford
Venue: Proceedings of the 11th international conference on Ubiquitous computing (2009)

We present two studies of participatory sensing in the wild, in which groups of young people used sensors to collect environmental data along with contextual information such as photographs and written observations. These studies reveal how participants focused their attention on key events of interest, providing detailed information over a background of less carefully gathered automatic readings. Participants responded to events in their surroundings, sudden changes in sensor data, and recorded details relevant to the process of gathering the data itself. Based on these studies a framework is described, highlighting the negotiation of five activities in the experiences; planning, testing, navigation, capture and reflection.
Pricing-based call admission control for wireless MPEG-4 traffic
Authors: Aggelos Lazaris, Polychronis Koutsakis
Venue: Computer Communications (2009)

Next generation wireless technologies will need to incorporate new sets of traffic control procedures in order to cope with the challenges related to supporting both the existing and the ever-increasing new multimedia services. The work presented in this paper focuses on traffic control for MPEG-4 videoconference over cellular networks, and is twofold. We first introduce a traffic model for medium quality MPEG-4 videoconference traffic. We then proceed to use this model, as well as a previously developed model for high quality MPEG-4 traffic, in the implementation of a new Call Admission Control (CAC) mechanism. Providers need to use efficient resource management mechanisms in order to keep existing clients satisfied and attract new customers, so that they can increase their revenue. Towards this goal, our CAC mechanism makes decisions on the acceptance/rejection of a new video call not only based on the predicted capacity that users will consume, but also on the possible revenue gained for the provider when degrading current users in order to accommodate new ones. Our mechanism is implemented with both a static and a dynamic pricing policy and is shown, via an extensive simulation study, to provide excellent Quality of Service (QoS) to wireless videoconference users.