ppxscal/embedding_network huggingface dataset:
An Integrated Workflow Management Solution for Heritage Information Mashups
Authors: Abdullah Al-Barakati, W. Zhang, M. Z. Patoli, M. Gkion, N. Beloff, P. Newbury, M. White
Venue: Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining (2009)

This paper outlines the process of developing and deploying an integrated workflow management solution for our system that uniquely integrates heritage data mashups whose digital content is derived from social network repositories and a specific museum digital collections repository and presentation system called ARCO. This workflow solution accommodates a number of integration techniques, based on social networking with user defined content, and using virtual and augmented reality in a Web 2.0 mashup to dynamically present digital heritage content. Other technologies exploited in this scenario include a web service based Grid solution for generating 3D virtual reconstruction animations. The implementation of the workflow solution is based on the Windows Workflow Foundation while the adoption of the multi-tiered human workflow architecture leads to a fully integrated workflow management engine.
On timing and modality choice with local danger warnings for drivers
Authors: Yujia Cao, Sandro Castronovo, Angela Mahr, Christian Müller
Venue: Proceedings of the 1st International Conference on Automotive User Interfaces and Interactive Vehicular Applications (2009)

We present an experimental study on the effectiveness of five modality variants (speech, text-only, icon-only, two combinations of text and icons) for presenting local danger warnings for drivers. Hereby, we focus on sudden appearing road obstacles within a maximum up-to-date scenario as it is envisaged in Car2Car communication research. The effectiveness is measured by the minimum time necessary for fully interpreting the content. Results show that text-only requires the most time while icon only is perceived the fastest. The two combined versions lie in between. The minimum length for speech is determined by the duration of the utterance, which is longer than perception time of text-only in this case. However, speech could be decoded reliably by nearly all subjects. Results indicate further that a blinking visual cue provided through the periphery visual channel is able to enhance the saliency of visual modalities. Subjective judgements by the subjects furthermore suggest a combined use of visual and auditory modalities.
Relational Frequent Patterns Mining for Novelty Detection from Data Streams
Authors: Michelangelo Ceci, Annalisa Appice, Corrado Loglisci, Costantina Caruso, Fabio Fumarola, Carmine Valente, Donato Malerba
Venue: Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition (2009)

We face the problem of novelty detection from stream data, that is, the identification of new or unknown situations in an ordered sequence of objects which arrive on-line, at consecutive time points. We extend previous solutions by considering the case of objects modeled by multiple database relations. Frequent relational patterns are efficiently extracted at each time point, and a time window is used to filter out novelty patterns. An application of the proposed algorithm to the problem of detecting anomalies in network traffic is described and quantitative and qualitative results obtained by analyzing real stream of data collected from the firewall logs are reported.
Spatially-Variant Anisotropic Morphological Filters Driven by Gradient Fields
Authors: Rafael Verdú-Monedero, Jesús Angulo, Jean Serra
Venue: Proceedings of the 9th International Symposium on Mathematical Morphology and Its Application to Signal and Image Processing (2009)

This paper deals with the theory and applications of spatially-variant mathematical morphology. We formalize the definition of spatially variant dilation/erosion and opening/closing for gray-level images using exclusively the structuring function, without resorting to complement. This sound theoretical framework allows to build morphological operators whose structuring elements can locally adapt their orientation across the dominant direction of image structures. The orientation at each pixel is extracted by means of a diffusion process of the average square gradient field, which regularizes and extends the orientation information from the edges of the objects to the homogeneous areas of the image. The proposed filters are used for enhancement of anisotropic images features such as coherent, flow-like structures.
Study on Cooperation Model in Virtual Enterprise
Authors: Yibo Yang, Tao Ji
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

The virtual enterprise organizes the enterprises that are geographically and organizationally. Through the effective cooperation among enterprises, the enterprises will fulfill the goal as “win-win”. The present study are mainly focused on the virtual enterprise partner selection in the field of virtual enterprise cooperation, and the research of virtual enterprises' cooperative mode is so few. A new cooperation model of virtual enterprise based on agent theory and multi-phase cooperation process are presented. It analyses the optimal incentive mechanism in virtual enterprise.
Factored neural language models
Authors: Andrei Alexandrescu, Katrin Kirchhoff
Venue: Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume: Short Papers on XX (2006)

We present a new type of neural probabilistic language model that learns a mapping from both words and explicit word features into a continuous space that is then used for word prediction. Additionally, we investigate several ways of deriving continuous word representations for unknown words from those of known words. The resulting model significantly reduces perplexity on sparse-data tasks when compared to standard backoff models, standard neural language models, and factored language models.
An electromyographic investigation of asymmetric lifting and moving of a load: III. Models for determining muscle activity based on anthropometric characteristics
Authors: Biman Das, Godfrey Mabaleka
Venue: Human Factors in Ergonomics Manufacturing (2009)

Regression models for six muscles, the left and right iliocostalis, the left and right erector spinae, and the left and right external oblique, were developed for asymmetry and height effects for floor and knuckle lifts. The models were based on participant anthropometric and other measures. Stepwise regression was performed for developing the prediction models. The models developed were discrete in terms of specific height and asymmetry. &copy; 2009 Wiley Periodicals, Inc.
Study on the Electronic Structure and Optical Properties for BaSi2
Authors: Zhao Feng-juan, Xie Quan, Chen Qian, Yang Chuang-hua
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

The electronic structure, densities of states and optical properties of the stable orthorhombic BaSi2 have been calculated using the first-principle density function theory pseudopotential method. The results show that BaSi2 is an indirect semiconductor with the band gap of 1.086eV, the conduction bands are mainly composed of Ba 6s, 5d as well as Si 3p, the valence bands of BaSi2 are mainly composed of Si 3p, 3s and Ba 5d. The calculated dielectric function of BaSi2 shows that it possesses anisotropic character, the biggest peak of absorption coefficient is 2.15×105cm-1.
Comparative Study of Classification Algorithms Using Molecular Descriptors in Toxicological DataBases
Authors: Max Pereira, Vítor Santos Costa, Rui Camacho, Nuno A. Fonseca, Carlos Simões, Rui M. Brito
Venue: Proceedings of the 4th Brazilian Symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology (2009)

The rational development of new drugs is a complex and expensive process, comprising several steps. Typically, it starts by screening databases of small organic molecules for chemical structures with potential of binding to a target receptor and prioritizing the most promising ones. Only a few of these will be selected for biological evaluation and further refinement through chemical synthesis. Despite the accumulated knowledge by pharmaceutical companies that continually improve the process of finding new drugs, a myriad of factors affect the activity of putative candidate molecules in vivo and the propensity for causing adverse and toxic effects is recognized as the major hurdle behind the current "target-rich, lead-poor" scenario. In this study we evaluate the use of several Machine Learning algorithms to find useful rules to the elucidation and prediction of toxicity using 1D and 2D molecular descriptors. The results indicate that: i) Machine Learning algorithms can effectively use 1D molecular descriptors to construct accurate and simple models; ii) extending the set of descriptors to include 2D descriptors improve the accuracy of the models.
Extraction of Windows in Facade Using Kernel on Graph of Contours
Authors: Jean-Emmanuel Haugeard, Sylvie Philipp-Foliguet, Frédéric Precioso, Justine Lebrun
Venue: Proceedings of the 16th Scandinavian Conference on Image Analysis (2009)

In the past few years, street-level geoviewers has become a very popular web-application. In this paper, we focus on a first urban concept which has been identified as useful for indexing then retrieving a building or a location in a city: the windows. The work can be divided into three successive processes: first, object detection, then object characterization, finally similarity function design (kernel design). Contours seem intuitively relevant to hold architecture information from building facades. We first provide a robust window detector for our unconstrained data, present some results and compare our method with the reference one. Then, we represent objects by fragments of contours and a relational graph on these contour fragments. We design a kernel similarity function for structured sets of contours which will take into account the variations of contour orientation inside the structure set as well as spatial proximity. One difficulty to evaluate the relevance of our approach is that there is no reference database available. We made, thus, our own dataset. The results are quite encouraging regarding what was expected and what provide methods the literature.
A new ant colony optimization based algorithm for data allocation problem in distributed databases
Authors: Rosa Karimi Adl, Seyed Mohammad Taghi Rouhani Rankoohi
Venue: Knowledge and Information Systems (2009)

The Performance and the efficiency of a distributed database system depend highly on the way data are allocated to the sites. The NP-completeness of the data allocation problem and the large size of its real occurrence, call for employing a fast and scalable heuristic algorithm. In this paper, we address the data allocation problem in terms of minimizing two different types of data transmission across the network, i.e., data transmissions due to site-fragment dependencies and those caused by inter-fragment dependencies. We propose a new heuristic algorithm which is based on the ant colony optimization meta-heuristic, with regards to the applied strategies for query optimization and integrity enforcement. The goal is to design an efficient data allocation scheme to minimize the total transaction response time under memory capacity constraints of the sites. Experimental tests indicate that our algorithm is capable of producing near- optimal solutions within a reasonable time. The results also reveal the flexibility and scalability of the proposed algorithm.
Scalable Lisp applications
Authors: Jans Aasman
Venue: Proceedings of the 2007 International Lisp Conference (2007)

The focus of Franz's research and development efforts over the past few years has been storing billions of objects in AllegroCache and billions of RDF triples in AllegroGraph. In the process we had to invent and create a lot of new and interesting technology in Lisp. We implemented new types of B+trees, efficient marshalling, resourcing, new types of hash tables, efficient memory copies, new data type dependent sorts, cluster computing, and better support for memory mapped files. A number of Common Lisp function implementations were improved to be almost completely cons free. In the first part of my presentation I will discuss the scalability issues with AllegroGraph, and give an overview of the new technology and techniques that we had to add to make these products successful. In part two, I will argue that some of this technology should lead the way as part of a new standard for Common Lisp. For those interested, Duane Rettig will be holding a tutorial session that will be complimentary to my presentation detailing in-depth treatment of some of these new techniques.
Diagnosing Faulty Products in TFT-LCD Manufacturing Processes by Support Vector Machines with Principal Components Analysis
Authors: Ping-Feng Pai, Tzung-Min Wu, Kuo-Ping Lin, Shun-Ling Yang
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

Thin-Film Transistor Liquid-Crystal Display (TFT-LCD) manufacturing in Taiwan is booming; and the revenues from the TFT-LCD industry have grown significantly in recent years. One of the main problems in the TFT-LCD manufacturing process is to diagnose faulty products. This study employed support vector machines (SVM) with principal components analysis (PCA) to diagnose root causes in sputtering operations of the TFT-LCD industry. The PCA technique was used to transfer original manufacturing parameters into essential factors; and the SVM model was applied in classifying faulty products. Besides, the genetic and tabu (GA/TS) search algorithms were utilized to select SVM parameters. In terms of classification accuracy and efficiency, simulation results indicated that the SVM with PCA procedure is a feasible and promising way to diagnose faulty products in TFT-LCD manufacturing processes.
Voice Feed-Backing for Video Game Players by Real-Time Sequential Emotion Estimation from Facial Expression
Authors: Kiyhoshi Nosu, Tomoya Kurokawa, Hiroto Horita, Yoshitarou Ohhazama, Hiroki Takeda
Venue: Proceedings of the 9th International Conference on Intelligent Virtual Agents (2009)

Video game technology now enables a new set of experiences for players in addition to conventional video games. Although the intensity of the technological research in this field is shifting from graphics to AI design and characters with embodied agents [1], there have been few studies involving the assessment of real-time sequential, emotional changes of video-game players. Research of this issue and the implications may assist in preventing game addiction and decreasing one's zest for learning. This paper proposes a novel interface to provide voice feedback to video-game players using real-time sequential emotion estimation from facial expressions.
Quality of Protection with Performance Analysis in IP Multimedia Subsystem
Authors: Kai Wang, Chuang Lin, Fangqin Liu
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

IP Multimedia Subsystem (IMS) is considered as the main solution to the next generation multimedia communication.By examining potential security threats to IMS, we initiate a set of security policies for choice and consider their Quality of Protection (QoP) based on the strength of the security mechanism. In order to provide secure service to users, it is insufficient to just take the security benefits into consideration. An adequate analysis of the impact of security policies in IMS on the performance quantitatively is necessary and significant. We present a novel study of IMS performance using Queuing Petri Nets (QPN) to predict the system performance metrics, i.e., the signaling delay, server utilization, which then be used to evaluate the impacts of different security mechanism on system performance quantitatively. With the multi-view security partition introduced, multi-level security service can be provided to diverse users and applications for a best tradeoff between security requirements and system performance.
IFCRS: An Information Fusion Based Check Recognition System
Authors: Dong Wang
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

Considering that the legal amount, courtesy amount and E13B amount code on the Chinese bank checks can be recognized independently, this paper presents an information fusion based check recognition system called IFCRS. An adaptive template matching algorithm is presented to locate recognition regions for check layout analysis. We use hidden markov model to segment and recognize legal amount, and adopt artificial neural network to recognize courtesy amount and E13B code, respectively. D-S evidence theory is introduced to fuse above three recognition results for better recognition performance. Experimental results demonstrate that the system can robustly recognize checks and the information fusion based algorithm improves the recognition rate by 5~10 percent. 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
An Unscented Particle Filter Approach to Estimating Real-Time Traffic State
Authors: Yongjun Zheng, Wenjun Li, Bin Sun, Yanhua Jin
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

Estimating the real-time traffic state is important to fulfill the intelligent traffic management, it is therefore of great interest to obtain accurate estimation of the real-time traffic so that adaptive control mechanisms can be carried out accordingly. The macroscopic traffic flow is adopted as the model of freeway, it is considered as connected by same distance segments; the traffic sensors are placed at the conjunction of these segments, their numbers are much less than the traffic state to be estimated. The compression state space is adopted, the model parameters is taken as traffic state to be estimated not constant value. An unscented particle filter (UPF) method is proposed to improve the estimation accuracy of real-time traffic state. The simulation results indicate that the unscented particle filter can increase the accuracy of the estimation in terms of the root mean square error(RMSE), compared with the Extended Kalman filter (EKF).
Ontology-Based Personalization and Modulation of Computerized Cognitive Exercises
Authors: Silvana Quaglini, Silvia Panzarasa, Tiziana Giorgiani, Chiara Zucchella, Michelangelo Bartolo, Elena Sinforiani, Giorgio Sandrini
Venue: Proceedings of the 12th Conference on Artificial Intelligence in Medicine: Artificial Intelligence in Medicine (2009)

Cognitive rehabilitation may benefit from computer-based approaches that, with respect to paper-based ones, allow managing big amounts of stimuli (images, sounds, written texts) and combining them to create ever-new exercises. Moreover, they allow storing and analysing patients' performance, that may vary in time, thus increasing/decreasing difficulty of the exercises accordingly. An ontological organisation of the stimuli may help to automatically generate patient-tailored exercises, accounting for patients' performance, skills and preferences.
An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates
Authors: George Karakostas, Stavros G. Kolliopoulos, Jing Wang
Venue: Proceedings of the 15th Annual International Conference on Computing and Combinatorics (2009)

Given a sequencing of jobs on a single machine, each one with a weight, processing time, and a due date, the tardiness of a job is the time needed for its completion beyond its due date. We present an FPTAS for the basic scheduling problem of minimizing the total weighted tardiness when the number of distinct due dates is fixed. Previously, an FPTAS was known only for the case where all jobs have a common due date.
A computerized dictionary: le tr&eacute;sor de la langue Fran&ccedil;aise informatis&eacute; (TLFi)
Authors: Pascale Bernard, Jacques Dendien, Jean-Marie Pierrel
Venue: Proceedings of the Workshop on Enhancing and Using Electronic Dictionaries (2004)

This paper presents one of the main computerized resources of the research Laboratory ATILF (Analyse et traitement informatique de la langue fran&ccedil;aise) available via the Web: the computerized dictionary TLFi (Tr&eacute;sor de la langue fran&ccedil;aise informatis&eacute;). Its highly detailed XML structure (over 3,6 million tags) is powered by Stella: the extended capacities and potentialities of this software allows high level queries as well as hypernavigation through and between different databases.
Architecture Development for Efficient Sensor Tag Management
Authors: Md. Kafil Uddin, Gihong Kim, Bonghee Hong
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

The possible integration of sensing information with RFID data can be accomplished by using Sensor tag instead of using RFID tag only. Although EPCglobal provides standard architecture framework for processing RFID information, the diverse RFID applications and services necessitate collection and manipulation of integrated RFID-sensing information at the same system. Systems deploying Sensor tag can achieve both ID data and sensing data simultaneously. However, it is a big system challenge to monitor sensing data and manage sensor tags using existing standards. Moreover, efficient control and management of Sensor tag moods and states is also an issue in saving tag battery power and storing necessary sensing information in sensor tag memory. To fulfill all application requirements and manipulation of RFID-sensing data require efficient management of Sensor tag. In this paper, we propose a new system architecture for efficient Sensor tag management based on EPCglobal framework.
Measurement Analysis of the Live E! Sensor Network: Spatial-Temporal Correlations and Data Aggregation
Authors: Elyes Ben Hamida, Hideya Ochiai, Hiroshi Esaki, Pierre Borgnat, Patrice Abry, Eric Fleury
Venue: Proceedings of the 2009 Ninth Annual International Symposium on Applications and the Internet (2009)

The (Japanese) Live E! project consists of a large sensor network of spatially distributed weather stations measuring different environmental quantities such as temperature, humidity, pressure, etc. Our goal is to conduct the first analysis on this huge data set of the structures of correlations both in time and space observed on data, for given quantity among stations, and for a given station, among sensors. Finally, we investigate a data aggregation algorithm, based on polynomial regression, and we show how it can reduce significatively the overall data traffic.
Supporting Worth Mapping with Sentence Completion
Authors: Gilbert Cockton, Sari Kujala, Piia Nurkka, Taneli Hölttä
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

Expectations for design and evaluation approaches are set by the development practices within which they are used. Worth-Centred Development (WCD) seeks to both shape and fit such practices. We report a study that combined two WCD approaches. Sentence completion gathered credible quantitative data on user values, which were used to identify relevant values and aversions of two player groups for an on-line gambling site. These values provided human value elements for a complementary WCD approach of worth mapping. Initial worth maps were extended in three workshops, which focused on outcomes and user experiences that could be better addressed in the current product and associated marketing materials. We describe how worth maps were prepared for, and presented in, workshops, and how product owners and associated business roles evaluated the combination of WCD approaches. Based on our experiences, we offer practical advice on this combinination.