ppxscal/embedding_network huggingface dataset:
Timed and Hybrid Automata in SAL
Authors: P. Vijay Suman, Paritosh K. Pandya
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

Various methodologies to model and analyze timed and hybrid systems using SAL are reported. We assume that the system is specified as a network of timed/hybrid automata with synchronized transitions and urgency. We show how to translate the system into a SAL model with the time domain being either discrete or dense, and the clocks being either saturated or unsaturated. Depending on these choices, various tools provided by SAL to model check reachability properties over the system are used to establish safety properties of timed systems. We profile the performance of these tools with a comparative study.
Prime Implicates and Reduced Implicate Tries
Authors: Neil V. Murray, Erik Rosenthal
Venue: Proceedings of the 18th International Symposium on Foundations of Intelligent Systems (2009)

The reduced implicate trie (ri-trie) is a data structure that was introduced as a target language for knowledge compilation. It has the property that, even when large, it guarantees fast response to queries. It also has the property that each prime implicate of the formula it represents corresponds to a branch. In this paper, those prime branches are characterized, and a technique is developed for marking nodes to identify branches that correspond to non-prime implicates. This marking technique is enhanced to allow discovery of prime implicate subsets of queries that are answered affirmatively.
A hybrid evolution strategy for the open vehicle routing problem
Authors: P. P. Repoussis, C. D. Tarantilis, O. Bräysy, G. Ioannou
Venue: Computers and Operations Research (2010)

This paper presents a hybrid evolution strategy (ES) for solving the open vehicle routing problem (OVRP), which is a well-known combinatorial optimization problem that addresses the service of a set of customers using a homogeneous fleet of non-depot returning capacitated vehicles. The objective is to minimize the fleet size and the distance traveled. The proposed solution method manipulates a population of @m individuals using a (@m+@l)-ES; at each generation, a new intermediate population of @l offspring is produced via mutation, using arcs extracted from parent individuals. The selection and combination of arcs is dictated by a vector of strategy parameters. A multi-parent recombination operator enables the self-adaptation of the mutation rates based on the frequency of appearance of each arc and the diversity of the population. Finally, each new offspring is further improved via a memory-based trajectory local search algorithm, while an elitist scheme guides the selection of survivors. Experimental results on well-known benchmark data sets demonstrate the competitiveness of the proposed population-based hybrid metaheuristic algorithm.
Efficient Suboptimal Graph Isomorphism
Authors: Kaspar Riesen, Stefan Fankhauser, Horst Bunke, Peter Dickinson
Venue: Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition (2009)

In the field of structural pattern recognition, graphs provide us with a common and powerful way to represent objects. Yet, one of the main drawbacks of graph representation is that the computation of standard graph similarity measures is exponential in the number of involved nodes. Hence, such computations are feasible for small graphs only. The present paper considers the problem of graph isomorphism, i.e. checking two graphs for identity. A novel approach for the efficient computation of graph isomorphism is presented. The proposed algorithm is based on bipartite graph matching by means of Munkres' algorithm. The algorithmic framework is suboptimal in the sense of possibly rejecting pairs of graphs without making a decision. As an advantage, however, it offers polynomial runtime. In experiments on two TC-15 graph sets we demonstrate substantial speedups of our proposed method over several standard procedures for graph isomorphism, such as Ullmann's method, the VF2 algorithm, and Nauty. Furthermore, although the computational framework for isomorphism is suboptimal, we show that the proposed algorithm rejects only very few pairs of graphs.
Evaluation of AR Model Order Selection Approaches
Authors: Du Xiao-dan, Du Yu-Ming, Yan Tao, Liu Rong
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

Model order selection approaches are usually evaluated in simulations by comparing the resulting model orders to the true model order. In this paper, the mean Kullback-Leibler divergence (MKD) between the selected model and the true model is proposed as an objective measure for evaluating different model order selection approaches in simulations. For Gaussian linear model order selection problems the Kullback-Leibler divergence are reduced to simple forms and the MKD can be easily computed. Simulation results show that the MKD is a reasonable measure to evaluate different AR model order selection approaches, in terms of signal processing.
Color Stereo Matching Cost Applied to CFA Images
Authors: Hachem Halawana, Ludovic Macaire, François Cabestaing
Venue: Computational Color Imaging: Second International Workshop, CCIW 2009, Saint-Etienne, France, March 26-27, 2009. Revised Selected Papers (2009)

Most color stereovision setups include single-sensor cameras which provide Color Filter Array (CFA) images. In those, a single color component is sampled at each pixel rather than the three required ones (R,G,B). We show that standard demosaicing techniques, used to interpolate missing components, are not well adapted when the resulting color pixels are matched for estimating image disparities. In order to avoid this problem while exploiting color information, we propose a new matching cost designed for dense stereovision based on pairs of CFA images.
Distilling Support Opportunities to Improve Urban Search and Rescue Missions
Authors: Tjerk Greef, A. H. Oomes, Mark A. Neerincx
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part IV: Interacting in Various Application Domains (2009)

Current USAR missions are challenged by many factors leading to a study on how human computer interaction can provide support in this domain. Using data from a two-day observation in combination with mission reports, we applied a situated cognitive engineering design methodology to distill the operational demands, the human factors challenges, and the current and future technological design space. The operational demands result in a set of core functions that were explained in various parts of the USAR mission organization. Furthermore, an exemplary support scenario and prototype was provided in combination with claims on the envisioned effect.
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
Authors: Vadim Lyubashevsky, Daniele Micciancio
Venue: Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology (2009)

We prove the equivalence, up to a small polynomial approximation factor $\sqrt{n/\log n}$, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and GapSVP (the decision version of the Shortest Vector Problem). This resolves a long-standing open problem about the relationship between uSVP and the more standard GapSVP, as well the BDD problem commonly used in coding theory. The main cryptographic application of our work is the proof that the Ajtai-Dwork ([2]) and the Regev ([33]) cryptosystems, which were previously only known to be based on the hardness of uSVP, can be equivalently based on the hardness of worst-case GapSVP${_{O({n^{2.5}})}}$ and GapSVP${_{O(n^{2})}}$, respectively. Also, in the case of uSVP and BDD, our connection is very tight, establishing the equivalence (within a small constant approximation factor) between the two most central problems used in lattice based public key cryptography and coding theory.
Intelligent Location-Based Mobile News Service System with Automatic News Summarization
Authors: Chih-Ming Chen, Chin-Ming Hong, Shin-Chia Chen
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

Developing location-based services (LBSs) on mobile devices can convey location related information to individual users, thus helping users obtain useful and adaptive information using mobile devices with small screen. Based on the requirement, this study proposes an intelligent location-based service system which can provide local news with summarization to personal handheld PDA (Personal Digital Assistant) device based on user’s location. According to experimental results in multi-document summarization and user location identification, news summarization with satisfied quality is up to 86%, and the accuracy rate of user location awareness scheme is up to 90%. The experimental results demonstrate that the proposed system can be successfully applied in real-world applications for personalized location-based news services.
Nude Image Detection Based on SVM
Authors: Wang Xin-Lu, Li Xiao-juan, Liu Xiao-bo
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

On the Internet, the nude images caused the spread of a large number of social problems, how to identify the nude image accurately is a problem needing to be solved urgently. Therefore, we integrate both image processing method and support vector machines (SVM), this paper studies a new and enhanced approach on recognition of nude image, namely, combine a face detection model, skin color model and texture model, extract six nude image feature vectors. Additionally, some important factors of SVM are fixed by experiments, such as the training set, kernel function and the cost. The experimental results demonstrate that performing SVM-based nude image detective classification more effective in that it improves the prediction accuracies at the same time.
BEXPLORER: Computer and Communication Control Using EEG
Authors: Mina Mikhail, Marian Abdel-Shahid, Mina Guirguis, Nadine Shehad, Baher Soliman, Khaled El-Ayat
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

Humans are able to communicate in many rich and complex ways, with each other, or increasingly, with digital devices. A brain-computer interface (BCI) is a direct neural interface and a communication pathway between the human brain and an external device such as a computer or artificial limb. With such an interface, a severely handicapped person, such as an Amyotrophic Lateral Sclerosis (ALS) patient, with severe muscle disorder may still communicate and even control their environment relying solely on his brain activity. The system introduced detects EEG signals arising from various eye-blinking activities and applies the results to control various popular computer applications. Using BCI2000 as a platform, the system allows handicapped patients to communicate with a computer and initiate various computer commands, send instant messages, and even browse the web. The application also enables the user to communicate using mobile phone SMS messaging.
Web Quality of Agile Web Development
Authors: Hu Ran, Wang Zhuo, Xu Jianfeng
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

With the rapid growth of web applications, WEB-based systems become more and more large and complex. So some serious problems maybe appear during the development process of WEB system, which would lead to the crisis of WEB system. Therefore, WEB Quality Assurance is a very important part in WEB engineering. In this paper, based on the agile development, we research several technologies of Agile WEB engineering quality.
Estimating the Quality of Ontology-Based Annotations by Considering Evolutionary Changes
Authors: Anika Gross, Michael Hartung, Toralf Kirsten, Erhard Rahm
Venue: Proceedings of the 6th International Workshop on Data Integration in the Life Sciences (2009)

Ontology-based annotations associate objects, such as genes and proteins, with well-defined ontology concepts to semantically and uniformly describe object properties. Such annotation mappings are utilized in different applications and analysis studies whose results strongly depend on the quality of the used annotations. To study the quality of annotations we propose a generic evaluation approach considering the annotation generation methods (provenance) as well as the evolution of ontologies, object sources, and annotations. Thus, it facilitates the identification of reliable annotations, e.g., for use in analysis applications. We evaluate our approach for functional protein annotations in Ensembl and Swiss-Prot using the Gene Ontology.
Estimation of Leaf Area Index Using Remote Sensing in the Groundwater-Fluctuating Belt in Lower Reaches of Heihe River, Northwest China
Authors: Yanhong Jia, Chuanyan Zhao, Li Zhou, Boying Niu
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

The leaf area index (LAI) is an important parameter to characterize the canopy evapotranspiration of regional vegetation. For studying the ecological water requirement of vegetation in the groundwater-fluctuating belt in lower reaches of Heihe River, northwest China, a maximum growing season LAI was estimated by the regression relation between the measured value (from LAI-2000) and the estimated value of some spectral vegetation indexes, such as Ratio Vegetation Index (RVI), Difference Vegetation Index (DVI), Green Vegetation Index (GVI), Normalized Difference Vegetation Index (NDVI), Soil Adjusted Vegetation Index (SAVI) and Modified Soil Adjusted Vegetation Index (MSAVI) which were from the image of Landsat TM. The conclusions show that the relationship model between GVI and LAI was the optimal model to simulate the spatial distribution of LAI with correlation coefficient 0.66 in the study area. And the LAI value is changing from 0.004 to 3.753 in this region.
User evaluation of see-through vision for mobile outdoor augmented reality
Authors: Benjamin Avery, Bruce H. Thomas, Wayne Piekarski
Venue: Proceedings of the 7th IEEE/ACM International Symposium on Mixed and Augmented Reality (2008)

We have developed a system built on our mobile AR platform that provides users with see-through vision, allowing visualization of occluded objects textured with real-time video information. We present a user study that evaluates the user’s ability to view this information and understand the appearance of an outdoor area occluded by a building while using a mobile AR computer. This understanding was compared against a second group of users who watched video footage of the same outdoor area on a regular computer monitor. The comparison found an increased accuracy in locating specific points from the scene for the outdoor AR participants. The outdoor participants also displayed more accurate results, and showed better speed improvement than the indoor group when viewing more than one video simultaneously.
Quad-ridged conical horn antenna for wideband applications
Authors: A. R. Mallahzadeh, A. A. Dastranj, S. Akhlaghi
Venue: International Journal of RF and Microwave Computer-Aided Engineering (2009)

This article presents a quad-ridged conical horn antenna with high gain and low side lobe level for broadband applications. To the best of authors' knowledge, the proposed structure presented in this article is completely new. The designed antenna introduces a low VSWR, which is lower than 2.2 for the frequency range of 8&ndash;18 GHz, and simultaneously achieves high gain as well as dual-polarizations with high isolation between the corresponding excitations. The common impedance exponential tapering is used at the flare section of the horn, and a coax to waveguide transition, namely quadruple-ridged circular waveguide, with a conical cavity is used to improve the VSWR. The proposed antenna structure is designed and simulated by two well established packages, namely the CST microwave studio and the Ansoft HFSS, showing there is a close agreement between the results obtained by the aforementioned softwares. &copy; 2009 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2009.
Unsupervised models for coreference resolution
Authors: Vincent Ng
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

We present a generative model for unsupervised coreference resolution that views coreference as an EM clustering process. For comparison purposes, we revisit Haghighi and Klein's (2007) fully-generative Bayesian model for unsupervised coreference resolution, discuss its potential weaknesses and consequently propose three modifications to their model. Experimental results on the ACE data sets show that our model outperforms their original model by a large margin and compares favorably to the modified model.
Generating Optimal Code Using Answer Set Programming
Authors: Tom Crick, Martin Brain, Marina Vos, John Fitch
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

This paper presents the Total Optimisation using Answer Set Technology (TOAST) system, which can be used to generate optimal code sequences for machine architectures via a technique known as superoptimisation. Answer set programming (ASP) is utilised as the modelling and computational framework for searching over the large, complex search spaces and for proving the functional equivalence of two code sequences. Experimental results are given showing the progress made in solver performance over the previous few years, along with an outline of future developments to the system and applications within compiler toolchains.
Informatics in Control, Automation and Robotics: Selected Papers from the International Conference on Informatics in Control, Automation and Robotics 2008, 1st edition
Authors: Juan Andrade-Cetto, Jean-Louis Ferrier, Joaquim Filipe
Venue:  (2009)

The present book includes a set of selected papers from the 5th "International Conference on Informatics in Control Automation and Robotics" (ICINCO 2008), held in Funchal-Madeira, Portugal, 11-15 May 2008. The conference was organized in three simultaneous tracks: "Intelligent Control Systems and Optimization", "Robotics and Automation" and "Systems Modeling, Signal Processing and Control". The book is based on the same structure. The purpose of this conference is to bring together researchers, engineers and practitioners interested in the application of informatics to Control, Automation and Robotics. Informatics applications are pervasive in many areas of Control, Automation and Robotics, and this conference intends to emphasize this connection, therefore, most papers highlight applications of Information Technology (IT) in these areas and present ideas on how to solve problems using IT, both in R&D and industrial applications. A diversity of papers are included in the book, ranging from papers describing advanced prototypes, systems, tools and techniques to papers presenting surveys indicating future directions.
Web Document Clustering Research Based on Granular Computing
Authors: Zheng Shangzhi, Zhao Xiaolong, Zhang Buqun, Bu Hualong
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

In this paper, a method of web document clustering based on granular computing (WDCGrc) is presented. The method computes the weight value of the words in documents by adopting the TF-IDF principle. Meanwhile, combinative ways defining documents threshold and average weight value are adopted to reduce dimensions and extract the keywords in each document. The paper establishes the transformation between the keywords in documents and the binary granules, and adopts the algorithm of association rules based on granular computing to obtain frequent item sets between documents. Bring in the set theory thought, numbers of the same word between documents as the document similarity and the clustering result is obtained. The experiment shows that the method is practical and feasible, with good quality of clustering.
A Real-Virtual Mapping Method for Mechanical Product Assembly Process Planning in Virtual Assembly Environment
Authors: Xiumin Fan, Feng Gao, Hongmin Zhu, Dianliang Wu, Qi Yin
Venue: Proceedings of the 3rd International Conference on Virtual and Mixed Reality: Held as Part of HCI International 2009 (2009)

In order to realize assembly process planning in virtual reality environment, an assembly process planning generation method based on real-virtual mapping of basic motion sequence is proposed. Based on the analysis of current assembly process content from enterprise, assembly process information is modeled; standard assembly operations and basic assembly motion are defined. The mapping matrix among standard assembly operations and basic assembly motions are set up. A method to get basic motion sequence in virtual environment during virtual assembling process by real user is put forward. A prototype system is developed based on these research results, and the system function is demonstrated through assembly process of automobile engine components. It shows that this assembly process generation method based on real-virtual mapping of motion sequence is feasible, and it also provides a new idea for the application of virtual assembly technique for product manufacturing process.
Hybrid Logic Meets IF Modal Logic
Authors: Tero Tulenheimo
Venue: Journal of Logic, Language and Information (2009)

The hybrid logic $${\mathcal{H}(@,\downarrow)}$$ and the independence friendly modal logic IFML are compared for their expressive powers. We introduce a logic IFML c having a non-standard syntax and a compositional semantics; in terms of this logic a syntactic fragment of IFML is singled out, denoted IFML c . (In the Appendix it is shown that the game-theoretic semantics of IFML c coincides with the compositional semantics of IFML c .) The hybrid logic $${\mathcal{H}(@,\downarrow)}$$ is proven to be strictly more expressive than IFML c . By contrast, $${\mathcal{H}(@,\downarrow)}$$ and the full IFML are shown to be incomparable for their expressive powers. Building on earlier research (Tulenheimo and Sevenster 2006), a PSPACE-decidable fragment of the undecidable logic $${\mathcal{H}(@,\downarrow)}$$ is disclosed. This fragment is not translatable into the hybrid logic $${\mathcal{H}(@)}$$ and has not been studied previously in connection with hybrid logics. In the Appendix IFML c is shown to lack the property of `quasi-positionality' but proven to enjoy the weaker property of `bounded quasi-positionality'. The latter fact provides from the IFML internal perspective an account of what makes the compositional semantics of IFML c possible.
Optimal metric planning with state sets in automata representation
Authors: Björn Ulrich Borowsky, Stefan Edelkamp
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

This paper proposes an optimal approach to infinite-state action planning exploiting automata theory. State sets and actions are characterized by Presburger formulas and represented using minimized finite state machines. The exploration that contributes to the planning via model checking paradigm applies symbolic images in order to compute the deterministic finite automaton for the sets of successors. A large fraction of metric planning problems can be translated into Presburger arithmetic, while derived predicates are simply compiled away. We further propose three algorithms for computing optimal plans; one for uniform action costs, one for the additive cost model, and one for linear plan metrics. Furthermore, an extension for infinite state sets is discussed.