ppxscal/embedding_network huggingface dataset:
An Efficient MA-Based Materialized Views Selection Algorithm
Authors: Qingzhou Zhang, Xia Sun, Ziqiang Wang
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

Materialized view selection is one of the most crucial techniques to design data warehouse in an optimal manner. To efficiently deal with materialized view selection problem, an efficient materialized view selection algorithm based on memtic algorithm(MA) is presented in this paper. Experimental results show that the proposed algorithm achieves much better performance than other related algorithms.
The Application of BP Neural Network Model of DNA-Based Genetic Algorithm to Monitor Cutting Tool Wear
Authors: Shu-zhi Nie, Bang-yan Ye
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

This paper proposes a method of applying BP neural network model of DNA-based genetic algorithm to monitor and forecast cutting tool wear. Through the optimization- by training, that is adopts DNA genetic algorithm to optimize the initial figure of BP neural networks and increases the speed of convergence and avoid local minimum, the BP neural network model can effectively extract the characteristic parameters that affect the tool wear characteristics , monitor and forecast of the tool wear, as well as get higher forecast accuracy.
Hierarchical search for parsing
Authors: Adam Pauls, Dan Klein
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics (2009)

Both coarse-to-fine and A* parsing use simple grammars to guide search in complex ones. We compare the two approaches in a common, agenda-based framework, demonstrating the tradeoffs and relative strengths of each method. Overall, coarse-to-fine is much faster for moderate levels of search errors, but below a certain threshold A* is superior. In addition, we present the first experiments on hierarchical A* parsing, in which computation of heuristics is itself guided by meta-heuristics. Multi-level hierarchies are helpful in both approaches, but are more effective in the coarse-to-fine case because of accumulated slack in A* heuristics.
Policy-Gradient Based Actor-Critic Algorithms
Authors: Yogesh P. Awate
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

We consider the framework of a set of recently proposed two-timescale actor-critic algorithms for reinforcement-learning using the long-run average-reward criterion and linear feature-based value-function approximation. The actor update is based on the stochastic policy-gradient ascent rule. We derive a stochastic-gradient-based novel critic update to minimize the variance of the policy-gradient estimator used in the actor update. We propose a novel baseline structure for variance minimization of an estimator and derive an optimal baseline which makes the covariance matrix a zero matrix – the best achievable. We derive a novel actor update based on the optimal baseline deduced for an existing algorithm. We derive another novel actor update using the optimal baseline for an unbiased policy-gradient estimator which we deduce from the Policy-Gradient Theorem with Function Approximation. The computational results demonstrate that the proposed algorithms outperform the state-of-the-art on Garnet problems.
Mobile Living Labs 09: Methods and Tools for Evaluation in the Wild: http://mll09.novay.nl
Authors: Henri ter Hofte, Kasper Løvborg Jensen, Petteri Nurmi, Jon Froehlich
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

In a Mobile Living Lab, mobile devices are used to evaluate concepts and prototypes in real-life settings. In other words, the lab is brought to the people. This workshop provides a forum for researchers and practitioners to share experiences and issues with methods and tools for Mobile Living Labs. In particular, we seek to bring together people who have applied methods for Mobile Living Labs and people who build tools for those methods. The aim of the workshop is twofold. First, to make an up-to-date overview of current methods and tools for conducting user studies in Mobile Living Labs -- highlighting their individual strengths and weaknesses. Second, to uncover challenges that are not adequately addressed by current methods and tools and to come up with ideas and requirements that could fill this gap thus serving as beacons for further research and development in this area.
Development and Application of GIS-Based Analysis System for Studying Water Resources Carrying Capacity in the Shule River Basin
Authors: Zhiming Liu, Cheng Wang, Shanzhen Yi
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

Sustainable Water Resources Carrying Capacity is widely discussed now. The area of Shule River Basin is in the north-east of China, for avoiding excessive development, its sustainable water resources carrying capacity should be studied. This paper presents a GIS-Based WRCC assessment System. This system is composed of index system of WRCC assessment, data collection module, data preprocessing module, data integration module etc. Hydrological data, meteorological phenomena, water level, social economy, subsoil water, land use zone, water environment etc. can all be input and processed in this system. Based on the classification and regionalization of the ecosystem, multiple ecological management objectives and the spatial variability of the environmental flow requirements of the Shule River Basin can be analyzed in this system. An Index system of water resources carrying capacity assessment was constructed in this system, with the help of the dynamic data collection system, this system can provide a real-time assessment result supporting manager’s management decision.
Application of Active Service Component in Intelligent Investigation System of Specialty Provision
Authors: Liu Yousheng, Wang Yuxian, Xiao Huazhi
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

On the basis of the analysis to the problems existing in the present Web application development, it is put forward that Web application and service can be framed with active service component. Both the system architecture and the work flow are described, and the component used to realize active service is designed. The active service and the component are applied to the investigation system of specialty provision, and the results of system testing show that it is featured in more extendibility, flexible use and convenient maintenance to frame Web application programs with active service component, and in this way, it can perceive user’s service demands actively. By using this investigation system, it is easy to realize individualization and special services.
Static Timing Analysis for Nanometer Designs: A Practical Approach, 1st edition
Authors: J. Bhasker, Rakesh Chadha
Venue:  (2009)

The book covers topics such as cell timing and power modeling; interconnect modeling and analysis, delay calculation, crosstalk, noise and the chip timing verification using static timing analysis. For each of these topics, the book provides a theoretical background as well as detailed examples to elaborate the concepts. The static timing analysis topics covered start from verification of simple blocks useful for a beginner to this field. The topics then extend to complex nanometer designs with in-depth treatment of concepts such as modeling of on-chip variation, clock gating, half-cycle paths, as well as timing of source-synchronous interfaces such as DDR. The impact of crosstalk on timing and noise is covered as is the usage of hierarchical design methodology. This book addresses CMOS logic gates, cell library, timing arcs, waveform slew, cell capacitance, timing modeling, interconnect parasitics and coupling, pre- and post-layout interconnect modeling, delay calculation, specification of timing constraints for analysis of internal paths as well as IO interfaces. Advanced modeling and analysis concepts such as controlled current source timing and noise models for nanometer technologies, power modeling including active and leakage power, crosstalk timing and crosstalk glitch calculation, verification of half-cycle and multi-cycle paths, false paths, synchronous interfaces are also covered.
A large-scale inheritance-based morphological lexicon for Russian
Authors: R. Evans, C. Tiberius, D. Brown, G. G. Corbett
Venue: Proceedings of the 2003 EACL Workshop on Morphological Processing of Slavic Languages (2003)

In this paper we describe the mapping of Zaliznjak's (1977) morphological classes into the lexical representation language DATR (Evans and Gazdar 1996). On the basis of the resulting DATR theory a set of fully inflected forms together with their associated morphosyntax can automatically be generated from the electronic version of Zaliznjak's dictionary (Ilola and Mustajoki 1989). From this data we plan to develop a wide-coverage morphosyntactic lemma-tizer and tagger for Russian.
Landslide Susceptibility Mapping: A Comparison of Information and Weights-of-Evidence Methods in Three Gorges Area
Authors: Chuanhua Zhu, Xueping Wang
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

Statistical assessment of landslide susceptibility has become a major topic of research in the last decade. In this study, the information and weights-of-evidence methods have been used with GIS to prepare a landslide susceptibility map in a selected area of the Shunxi segment of Zhongwu gas pipeline in Zhong County. For this purpose, causative factors including landslide inventory, engineering geological petrofabric, slope, slope structure, distance to river and distance to road were used. In this study area, all of landslides occurred in J3p formation. Distance to roads, slope structure and distance to rivers were found to be important factors in the study area. To confirm the practicality of the results, the two susceptibility maps were compared with a landslide inventory map containing 5 landslides zones. The outcome was that the known landslide zones do not completely fit into the high and very high susceptibility classes. But 93.2% of these landslide zones fall into high and very high susceptibility zones of the information method while this is 92.2% fall into high susceptibility zones in the case of weights-of-evidence method, which is similarity. Finally, the ratio of landslide density of the susceptibility class and the landslide density of the study area was compared, which showed that the weights-of-evidence method reasonable picture of the actual distribution of landslide susceptibility, than the information method.
Knowledge management in biomedical libraries: A semantic web approach
Authors: Damaris Fuentes-Lorenzo, Jorge Morato, Juan Miguel Gómez
Venue: Information Systems Frontiers (2009)

In recent years, technological advances in high-throughput techniques and efficient data gathering methods, coupled with a world-wide effort in computational biology, have resulted in an enormous amount of life science data available in repositories devoted to biomedical literature. These repositories lack the ability to attain an effective and accurate search. Using semantic technologies as the key for interoperation enables searching and processing of biomedical literature in a more efficient way. However, emerging semantic applications take for granted specific knowledge that biomedical researchers may not have. This paper presents design principles for easy-to-use biomedical semantic applications by means of ontology-based annotations and faceted search. The proposed approach is backed with a usable prototype that shows the breakthroughs of adding these principles to a biomedical digital library where identifying and searching information are critical aspects for non-semantic Web experts.
The swarm application framework
Authors: Don Miner, Marie DesJardins, Peter Hamilton
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

The Swarm Application Framework (SAF) is a tool that makes the development of swarm applications more intuitive. Traditionally, swarm applications are created by programming several low-level rules. This approach leads to several problems in designing and testing swarms, which serve as inspiration for the features of SAF. SAF encourages a new paradigm for designing swarm applications: engineers can interact with a swarm at the abstract (swarm) level instead of the individual (agent) level. In this paper, we discuss the design of the framework, how agents and rules in SAF operate, and a planned rule abstraction feature.
Clause learning can effectively P-simulate general propositional resolution
Authors: Philipp Hertel, Fahiem Bacchus, Toniann Pitassi, Allen Van Gelder
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application areas like verification, diagnosis, planning, and design. Without clause learning, however, DPLL loses most of its effectiveness on real world problems. Recently there has been some work on obtaining a deeper understanding of the technique of clause learning. In this paper we utilize the idea of effective p-simulation, which is a new way of comparing clause learning with general resolution and other proof systems. We then show that pool proofs, a previously used characterization of clause learning, can effectively p-simulate general resolution. Furthermore, this result holds even for the more restrictive class of greedy, unit propagating, pool proofs, which more accurately characterize clause learning as it is used in practice. This result is surprising and indicates that clause learning is significantly more powerful than was previously known.
Wide-Baseline Visible Features for Highly Dynamic Scene Recognition
Authors: Aram Kawewong, Sirinart Tangruamsub, Osamu Hasegawa
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

This paper describes a new visual feature to especially address the problem of highly dynamic place recognition. The feature is obtained by identifying existing local features, such as SIFT or SURF, that have wide baseline visibility within the place. These identified local features are then compressed into a single representative feature, a wide-baseline visible feature, which is computed as an average of all the features associated with it. The proposed feature is especially robust against highly dynamical changes in scene; it can be correctly matched against a number of features collected from many dynamic images. This paper also describes an approach to using these features for scene recognition. The recognition proceeds by matching individual feature to a set of features from testing images, followed by majority voting to identify a place with the highest matched features. The proposed feature is trained and tested on 2000+ outdoor omnidirectional. Despite its simplicity, wide-baseline visible feature offers two times better rate of recognition (ca. 93%) than other features. The number of features can be further reduced to speed up the time without dropping in accuracy, which makes it more suitable to long-term scene recognition and localization. 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
Little Big Difference: Gender Aspects and Gender-Based Adaptation in Educational Games
Authors: Christina M. Steiner, Michael D. Kickmeier-Rust, Dietrich Albert
Venue: Proceedings of the 4th International Conference on E-Learning and Games: Learning by Playing. Game-based Education System Design and Development (2009)

Computer games are tremendously successful and this is why the potential of using this medium for educational purposes is increasingly recognized and researched. However, as new learning technologies need to be appropriate for all students and ensure equal learning opportunities, it is important to take into account evidences on gender differences in the context of computer games. This paper reviews relevant research results on gender aspects. Aiming for the realization of gender-based adaptation in digital educational games, a model incorporating research evidences on gender aspects is elaborated and implications for adaptation are derived. Adaptation principles and game design are illustrated by means of the 80Days project.
E-Government Implementation Evaluation: Opening the Black Box
Authors: Maddalena Sorrentino, Raffaella Naggi, Pietro Luca Agostini
Venue: Proceedings of the 8th International Conference on Electronic Government (2009)

This paper perceives e-government evaluation as a research field that can produce the cognitive input to help us understand the causal nexus that should attribute the effects of an e-government programme to its implementation and transform this learning into an effective intervention tool. Drawing on contributions from Organization Theory and Policy Studies, we propose an interpretive key that assigns a dual role to e-government evaluation: valuable cognitive resource and tool of accountability for the policymakers. The reflections offered here are based on an exploratory case study of a City of Milan project and aim to provide further insights for e-government research and help better inform managerial praxis.
Simulating a Multi-domain RFID System for Replacement Part Tracking
Authors: Rainer Falk, Andreas Koepf, Hermann Seuschek, Ming-Yuh Huang, Mingyan Li
Venue: Proceedings of the 2009 Third International Conference on Emerging Security Information, Systems and Technologies (2009)

The efficient and reliable handling of replacement parts is of high importance for airlines. It can be supported by attaching an RFID tag to replacement parts that stores data identifying unambiguously the replacement part and further information about its installation and maintenance. Security is essential so that only authenticated and authorized entities can read and modify data according to the defined access permissions. Although the information is managed in a decentralized way, it has anyhow to be synchronized with the airline’s backend database finally.This paper describes data format, certificate management and access control when using these passive RFID tags in a multi-domain scenario for replacement part tracking within the avionics industry. The demonstrator architecture design is described for simulating replacement part tracking. It allows simulating use cases of the multi-domain RFID system for replacement part tracking. Both simulated and real RFID tags can be used in the simulation.
BIDE Algorithm Based on the Expansion of Position
Authors: Haitao He, Jia Zhang, Jiadong Ren
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

Pattern mining on frequent closed sequence is one of hot spots in data mining. Aimed at the set of frequent closed sequential patterns being mined more efficient, PBIDE is proposed, which is the BIDE algorithm based on the expansion of position. The position information, expansion event, and optimization strategy are defined. Firstly, the numbers of different sequences identities are calculated in the position information of each event. And frequent 1-sequence can be obtained by comparing the threshold with their numbers. Secondly, according to the idea of prefix and adjacent position expanding, for every frequent 1-sequence, the expansions of position are checked directly. The expansions of position include three directions: backward, forward and medially. That the pseudo-projection database is scanned repeatedly is avoided. The optimization strategy is applied to reduce the time and memory consumed in the process of pre-expansion and expansion. So, the set of frequent closed sequential patterns will be mind more efficient than before. The experimental results show that PBIDE has significantly lower running time costs than BIDE, especially on the intensive datasets.
Secrecy for Bounded Security Protocols without Freshness Check
Authors: Catalin V. Birjoveanu
Venue: Proceedings of the 2009 Third International Conference on Emerging Security Information, Systems and Technologies (2009)

The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. The complexity of the secrecy problem for bounded security protocols without freshness check remained open. In this paper, we prove DEXPTIME-completeness of the secrecy problem for bounded security protocols without freshness check, solving the problem left open. 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
Hybrid constraint tightening for solving hybrid scheduling problems
Authors: James C. Boerkoel, Edmund H. Durfee
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

Hybrid Scheduling Problems (HSPs) contain both temporal and finite-domain variables, as well as constraints between them. A hybrid constraint over temporal and finite-domain variables often models situations where different assignments to a subset of finite-domain variables result in different bounds on temporal constraints. The insight we examine in this paper is that some temporal constraint propagation is possible even before finite-domain variables are assigned, by giving the temporal constraint the tightest bound consistent with all (remaining) feasible finite-domain variable values. We describe a hybrid constraint-tightening algorithm that can proactively prune the search space of HSPs and is run as a preprocessing step independently of the search algorithm used. We examine the efficiency of this algorithm analytically, and give preliminary results showing that it reduces the expected runtime of search by a significant margin in the kinds of HSPs we are studying.
Study of Equivalent Circuit Model for Lead-Acid Batteries in Electric Vehicle
Authors: XueZhe Wei, XiaoPeng Zhao, YongJun Yuan
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

The accurate estimation of lead-acid batteries state of charge (SOC) is very important for electric vehicles (EVs).However electrochemical reaction is a very complex process; it is difficult to simulate its dynamic behavior. Various equivalent circuit models have been studied, but can not show a good compromise between real-time and precision. In this paper, a revised model considering temperatures, discharge rates and different conditions is proposed based on a large number of experiments. These data are obtained from ARBIN, a battery testing device, and EVs. The simulated values are in good agreement with experimental data. And the associated error has been considered acceptable from an engineering point of view. It provided a model support for high accurate SOC estimation.