ppxscal/embedding_network huggingface dataset:
A novel measure for validating clustering results applied to road traffic
Authors: Yosr Naïja, Kaouther Blibech Sinaoui
Venue: Proceedings of the Third International Workshop on Knowledge Discovery from Sensor Data (2009)

The clustering validation and clustering interpretation are the two last steps of clustering process. The validation step permits to evaluate the goodness of clustering results using some measures. Valid results are then generally interpreted and used in cluster analysis. The validity measures are classified into three categories: unsupervised measures, supervised measures and relative measures. Several supervised measures have been proposed to perform supervised evaluation such as entropy, purity, F-measure, Jaccard coefficient and Rand statistic. Generally, these measures evaluate results according to class labels. However, they are not always able to distinguish interpretable clusters because most of them depends on the number of labels. This paper proposes a new supervised evaluation measure - called "homogeneity degree"- that permits to merge the steps of validation and interpretation. Our measure is applied to a real traffic data set and is used to interpret some traffic situations. Comparison with other evaluation measures shows the performance of our proposal.
Construction Enterprises Bidding Decision-Making Based on Linear Programming
Authors: Liu Jian-Bing
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

In present construction market situation, tender is the greatest way to win the bidding for construction enterprises. According to the rules of the tendering documents, construction enterprises must estimate basic price limitation on bidding by simulating according to the method of bidding evaluation except necessarily responding the other conditions of the bid documents, then the suitable bidding decision-making must be adopted so as to enhance the opportunity of winning the tender. The thesis is devoted to using the techniques of linear programming to formulate the bidding model which provides reference for the bidders. After analyzing a factual case, the model which can help construction enterprises to reduce the blindness of bidding of relying on experiences and winning the bidding of depending on good–luck can improve the science of bidding and the probabilities of winning the bidding, whichmakes a greatly theoretical and practical significance on guiding the bidding decision-making for construction enterprise.
Towards Extraction of Conceptual Structures from Electronic Health Records
Authors: Svetla Boytcheva, Galia Angelova
Venue: Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies (2009)

This paper presents the general framework and the current results of a project that aims to develop a system for knowledge discovery and extraction from the texts of Electronic Health Records in Bulgarian language. The proposed hybrid approach integrates language technologies and conceptual processing. The system generates conceptual graphs encoding the patient case history, which contains templates for the patient's diseases, symptoms and treatments. We describe simple inference in the generated graphs resource bank. Some experiments and their evaluation are presented in the article.
Evolving optimal inspectable strategies for spoken dialogue systems
Authors: Dave Toney, Johanna Moore, Oliver Lemon
Venue: Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume: Short Papers on XX (2006)

We report on a novel approach to generating strategies for spoken dialogue systems. We present a series of experiments that illustrate how an evolutionary reinforcement learning algorithm can produce strategies that are both optimal and easily inspectable by human developers. Our experimental strategies achieve a mean performance of 98.9% with respect to a predefined evaluation metric. Our approach also produces a dramatic reduction in strategy size when compared with conventional reinforcement learning techniques (87% in one experiment). We conclude that this algorithm can be used to evolve optimal inspectable dialogue strategies.
3D Topological Map Extraction from Oriented Boundary Graph
Authors: Fabien Baldacci, Achille Braquelaire, Guillaume Damiand
Venue: Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition (2009)

The extraction of a 3D topological map from an Oriented Boundary Graph can be needed to refine a 3D Split and Merge segmentation using topological information such as the Euler characteristic of regions. A presegmentation could thus be efficiently obtained using a light structuring model, before proceeding to the extraction of more information on some regions of interest. In this paper, we present the topological map extraction algorithm which allows to reconstruct locally a set of regions from the Oriented Boundary Graph. A comparison of the two models is also presented.
Fabrication, constructions and electrical property of Si2Sb2Te5 electrical probe storage system
Authors: Yanbo Liu, Zhitang Song, Ting Zhang, Guoxin Zhang, Jing Zhang, Weimin Zhou, Jianpin Zhang
Venue: Microsystem Technologies (2009)

A Si2Sb2Te5 (SST) memory array with density of 4&#x00a0;Gbit/in.2 was fabricated by ultraviolet-imprint lithography. The contacted area of SST with electrodes in memory cell was 0.0392&#x00a0;&#x03bc;m2. Crystal structure transformation of SST film was studied. Adhesion strength of sample interface was tested by Nano Indenter&#x00ae;. Electrical property of SST electrical probe storage (EPS) system was measured. Resistance of as-deposited SST film was about four orders of magnitude higher than that of the one annealed at 350&#x00b0;C. Resistance of EPS cell dropped about two orders from high-resistance state to low-resistance state.
Visualization of Computer Architecture Simulation Data for System-Level Design Space Exploration
Authors: Toktam Taghavi, Mark Thompson, Andy D. Pimentel
Venue: Proceedings of the 9th International Workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2009)

System-level computer architecture simulations create large volumes of simulation data to explore alternative architectural solutions. Interpreting and drawing conclusions from this amount of simulation results can be extremely cumbersome. In other domains that also struggle with interpreting large volumes of data, such as scientific computing, data visualization is an invaluable tool. Such visualization is often domain specific and has not become widely studied and utilized for evaluating the results of computer architecture simulations.In this paper, we describe an interactive visual tool for exploring and analyzing alternative architectural solutions at multiple levels of abstraction. As a proof of concept, we have used this tool to create a coordinated, multiple-view visualization for our computer architecture simulation and exploration environment, called Sesame, which aims at system-level performance analysis and design space exploration of multi-core embedded systems. Our results show that our multivariate visualization support can help designers to more easily understand the reasons behind the differences in performance of different design choices, and thus gain more insight in the performance landscape of the design space.
Comparative Assessment of Fingerprint Sample Quality Measures Based on Minutiae-Based Matching Performance
Authors: Changlong Jin, Hakil Kim, Xuenan Cui, Eunsoo Park, Junchul Kim, Jinsoo Hwang, Stephen Elliott
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

This Fingerprint sample quality is one of major factors influencing the matching performance of fingerprint recognition systems. The error rates of fingerprint recognition systems can be decreased significantly by removing poor quality fingerprints. The purpose of this paper is to assess the effectiveness of individual sample quality measures on the performance of minutiae-based fingerprint recognition algorithms. Initially, the authors examined the various factors that influenced the matching performance of the minutiae-based fingerprint recognition algorithms. Then, the existing measures for fingerprint sample quality were studied and the more effective quality measures were selected and compared with two image quality software packages, (NFIQ from NIST, and QualityCheck from Aware Inc.) in terms of matching performance of a commercial fingerprint matcher (Verifinger 5.0 from Neurotechnologija). The experimental results over various Fingerprint Verification Competition (FVC) datasets show that even a single sample quality measure can enhance the matching performance effectively.
Syntactic and semantic kernels for short text pair categorization
Authors: Alessandro Moschitti
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

Automatic detection of general relations between short texts is a complex task that cannot be carried out only relying on language models and bag-of-words. Therefore, learning methods to exploit syntax and semantics are required. In this paper, we present a new kernel for the representation of shallow semantic information along with a comprehensive study on kernel methods for the exploitation of syntactic/semantic structures for short text pair categorization. Our experiments with Support Vector Machines on question/answer classification show that our kernels can be used to greatly improve system accuracy.
Matching Road Networks Extracted from Aerial Images to GIS Data
Authors: Cheng-Fei Zhu, Shu-Xiao Li, Hong-Xing Chang, Ji-Xiang Zhang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

In aerial images, road network is the most salient artificial object, and could provide lots of geographical information. Thus it is very valuable for navigation systems,e.g. cruise missile or UAV(unmanned Aerial Vehicle) navigation system. With the presence of GIS in which road network is also the most common data, the position of aerial image can be located by matching it with a model generated from GIS. There are many algorithms presented to match images with model, and mostly the computational costs of them are very expensive, which can not meet the on-line processing requirement. In this paper, we first represent the GIS data as a model(GIS model in abbreviation in the following text).Then, a method for registering the road network picked up from the aerial images with GIS model is depicted.Several aerial images are taken to test the effectiveness of our method. Experimental results demonstrated that the correctness and veracity are both satisfying, and the cost of our method is acceptable.
Reinforcement learning for vulnerability assessment in peer-to-peer networks
Authors: Scott Dejmal, Alan Fern, Thinh Nguyen
Venue: Proceedings of the 20th national conference on Innovative applications of artificial intelligence - Volume 3 (2008)

Proactive assessment of computer-network vulnerability to unknown future attacks is an important but unsolved computer security problem where AI techniques have significant impact potential. In this paper, we investigate the use of reinforcement learning (RL) for proactive security in the context of denial-of-service (DoS) attacks in peer-to-peer (P2P) networks. Such a tool would be useful for network administrators and designers to assess and compare the vulnerability of various network configurations and security measures in order to optimize those choices for maximum security. We first discuss the various dimensions of the problem and how to formulate it as RL. Next we introduce compact parametric policy representations for both single attacker and botnets and derive a policy-gradient RL algorithm. We evaluate these algorithms under a variety of network configurations that employ recent fair-use DoS security mechanisms. The results show that nur RL-based approach is able to significantly outperform a number of heuristic strategies in terms of the severity of the attacks discovered. The results also suggest some possible network design lessons for reducing the attack potential of an intelligent attacker.
Implementation of China's Export Tax Rebates in Global Financial Crisis
Authors: Fei Wang
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

In order to protect domestic export enterprises and prevent the deterioration of foreign trade conditions, many researchers called for some incentive trade policies including export tax rebates since the global financial crisis which taken place in 2008, they believe only these measures can reduce the negative impacts on China's foreign trade and economic growth. From the perspective of economics and law, this thesis analyzed the costs and benefits of export tax rebates policy in China and offered some suggestions to improve them via the tool of cost-benefit analysis in law and economics.
The Characteristics and Source of Elemental Composition in Fine Particles during Haze Days in Autumn in Nanjing
Authors: Wei-fen Yang, Yan Yin, Kui Chen, Yu-xiang Wei
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

About 40 kinds of inorganic elements in Atmospheric fine particles (PM2.5) were determined using the ICP-MS techniques based on the observational date during the period from 7 September to 27 November 2007. The PM2.5 samples were collected by the US R&P-1400a ambient particulate monitor. Here we analyzed the characteristics of 34 kinds of principal components in haze and non-haze days. The results showed that in autumn the mass concentrations ofelements in haze days were higher than in non-haze days except Cd. In addition, enrichment factors (EF) for elements showed that elements from anthropogenic origins (Zn, Ge, Pb, Hg and Bi) were highly enriched in haze days and the degree of enrichment of Hg and Bi were especially higher than in non-haze days. The result of factor analysis demonstrated that the air fine particles may mainly originated from soil dust, metallurgic emission, the combustion of fossil material and oil and building industry emission in haze days during sampling period in Autumn, accounting for 29.30%, 22.22%, 9.47%, 9.29%, respectively. The metallurgic emission and the combustion of fossil material and oil had important influence on formation of haze weather in the Autumn.
Design and Implementation of a GSM Based Automatic Vehicle Location System
Authors: Ali Mousavi, Mohammad A. Rajabi, Mohammad Akbari
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

Recent advancements in wireless communication systems along with the growth of computational power of mobile devices have considerably reduced the difference between desktop and mobile computing environments. One of these applications is Automatic Vehicle Location System (AVLS) by which one can track vehicles in real time mode. This paper reviews the design and implementation of an AVLS with a new architecture which is a client-server one. It also discusses its software which supports GPS and runs on Windows Mobile based PDAs. While the software is a powerful one, it has a user friendly graphical interface. Different programming languages are used to develop the software. All of data are transferred back and forth between users and the server through GSM technology. The server uses GSM mobile, a relatively cheap media for communication, to provide a connection to PDAs. A toolbar for ArcGIS9.2 is developed to collect and analyze these data.
Concept Learning for Achieving Personalized Ontologies: An Active Learning Approach
Authors: Murat Şensoy, Pinar Yolum
Venue: Agents and Data Mining Interaction: 4th International Workshop, ADMI 2009, Budapest, Hungary, May 10-15,2009, Revised Selected Papers (2009)

In many multiagent approaches, it is usual to assume the existence of a common ontology among agents. However, in dynamic systems, the existence of such an ontology is unrealistic and its maintenance is cumbersome. Burden of maintaining a common ontology can be alleviated by enabling agents to evolve their ontologies personally. However, with different ontologies, agents are likely to run into communication problems since their vocabularies are different from each other. Therefore, to achieve personalized ontologies, agents must have a means to understand the concepts used by others. Consequently, this paper proposes an approach that enables agents to teach each other concepts from their ontologies using examples. Unlike other concept learning approaches, our approach enables the learner to elicit most informative examples interactively from the teacher. Hence, the learner participates to the learning process actively. We empirically compare the proposed approach with the previous concept learning approaches. Our experiments show that using the proposed approach, agents can learn new concepts successfully and with fewer examples.
Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in
Authors: Zohar S. Karnin, Amir Shpilka
Venue: Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity (2009)

In this paper we give reconstruction algorithms for depth-3 arithmetic circuits with $k$ multiplication gates (also known as $\Sigma\Pi\Sigma(k)$ circuits), where $k=O(1)$. Namely, we give an algorithm that when given a black box holding a $\Sigma\Pi\Sigma(k)$ circuit $C$ over a field $\F$ as input, makes queries to the black box (possibly over a polynomial sized extension field of $\F$) and outputs a circuit $C'$ computing the same polynomial as $C$. In particular we obtain the following results. 1) When $C$ is a multilinear $\Sigma\Pi\Sigma(k)$ circuit (i.e. each of its multiplication gates computes a multilinear polynomial) then our algorithm runs in polynomial time (when $k$ is a constant) and outputs a multilinear $\Sigma\Pi\Sigma(k)$ circuits computing the same polynomial. 2) In the general case, our algorithm runs in quasi-polynomial time and outputs a generalized depth-3 circuit (as defined in \cite{KarninShpilka08}) with $k$ multiplication gates. For example, the polynomials computed by generalized depth-3 circuits can be computed by quasi-polynomial sized depth-3 circuits. In fact, our algorithm works in the slightly more general case where the black box holds a generalized depth-3 circuits. Prior to this work there were reconstruction algorithms for several different models of bounded depth circuits: the well studied class of depth-2 arithmetic circuits (that compute sparse polynomials) and its close by model of depth-3 set-multilinear circuits. For the class of depth-3 circuits only the case of $k=2$ (i.e. $\Sigma\Pi\Sigma(2)$ circuits) was known. Our proof technique combines ideas from [Shpilka09] and [KarninShpilka08] with some new ideas. Our most notable new ideas are: We prove the existence of a unique canonical representation of depth-3 circuits. This enables us to work with a specific representation in mind. Another technical contribution is an isolation lemma for depth-3 circuits that enables us to reconstruct a single multiplication gate of the circuit.
Research on the Display Mode of Locomotive Velocity Tracing
Authors: Ye Deng, Weining Fang, Qiang Li, Lin Ding, Qingmei Hu
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

Locomotive velocity tracing interface is the very important equipment in locomotive cab. It has the great influence on the driving operation of locomotive. At present, there are three main display modes of velocity tracing, respectively curve mode, dial mode and column mode. Based on the cognitive characteristics of human being and the reliability of operation, it was analyzed these three display modes of locomotive velocity tracing in the paper. And there was a comparative research on the reliability of operation about the three display modes, according to different task levels, distance intervals and people’s experience levels. The results show that the curve mode is fluctuated slightly by the environment and with few mistakes, which is better than the dial mode and the column mode.
Personalisation of telecommunications services as combinatorial optimisation
Authors: David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Nic Wilson
Venue: Proceedings of the 20th national conference on Innovative applications of artificial intelligence - Volume 3 (2008)

Modern feature-rich telecommunications services offer significant opportunities to human users. To make these services more usable, facilitating personalisation is very important. Such personalisation enhances the users' experience considerably. The Session Initiation Protocol and Distributed Feature Composition architecture allow users to select and compose telecommunications network applications or features. In this paper we view feature composition as a configuration problem. We model feature composition using a variety of combinatorial optimisation paradigms. In particular, we present and evaluate an approach to finding optimal reconfigurations of network features when a user's preferences violate the technical constraints defined by a set of DFC rules.
Semantic negotiation in dialogue: the mechanisms of alignment
Authors: Gregory J. Mills, Patrick G. T. Healey
Venue: Proceedings of the 9th SIGdial Workshop on Discourse and Dialogue (2008)

A key problem for models of dialogue is to explain how semantic co-ordination in dialogue is achieved and sustained. This paper presents findings from a series of Maze Task experiments which are not readily explained by the primary co-ordination mechanisms of existing models. It demonstrates that alignment in dialogue is not simply an outcome of successful interaction, but a communicative resource exploited by interlocutors in converging on a semantic model. We argue this suggests mechanisms of co-ordination in dialogue which are of relevance for a general account of how semantic co-ordination is achieved.
A Backward and a Forward Simulation for Weighted Tree Automata
Authors: Andreas Maletti
Venue: Proceedings of the 3rd International Conference on Algebraic Informatics (2009)

Two types of simulations for weighted tree automata (wta) are considered. Wta process trees and assign a weight to each of them. The weights are taken from a semiring. The two types of simulations work for wta over additively idempotent, commutative semirings and can be used to reduce the size of wta while preserving their semantics. Such reductions are an important tool in automata toolkits.
Study on Intelligent Control Strategy of Battery-Electric Bus Based on the Fuzzy Comprehensive Evaluation Method
Authors: Lin Cheng, Zhou Hui, Sun Fengchun, Nan Jinrui
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

How to use the lithium-ion power battery effectively, how to improve the discharging efficiency and the cycle-life of the power battery is a hotspot of research in battery-electric vehicle(BEV) field. The fuzzy comprehensive evaluation method is used to evaluate the factors that influence the discharging efficiency and the cycle-life of the power battery.The demanded dynamic performance is judged by average value of traction pedal in a fixed period; The weighting coefficients are confirmed according to the relative importance of each parameter,and the intelligent control strategy is made according to the judging result. The intelligent control strategy is loaded to the pure vehicle controller and verified by real vehicle.The result indicates that the intelligent control strategy made by using the fuzzy comprehensive evaluation method can prevent the battery to be over currentor over discharge. The discharging efficiency of the battery is improved , and the range of vehicle is lengthened under the public traffic mode.