ppxscal/embedding_network huggingface dataset:
Sliding window-based frequent pattern mining over data streams
Authors: Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong, Young-Koo Lee
Venue: Information Sciences: an International Journal (2009)

Finding frequent patterns in a continuous stream of transactions is critical for many applications such as retail market data analysis, network monitoring, web usage mining, and stock market prediction. Even though numerous frequent pattern mining algorithms have been developed over the past decade, new solutions for handling stream data are still required due to the continuous, unbounded, and ordered sequence of data elements generated at a rapid rate in a data stream. Therefore, extracting frequent patterns from more recent data can enhance the analysis of stream data. In this paper, we propose an efficient technique to discover the complete set of recent frequent patterns from a high-speed data stream over a sliding window. We develop a Compact Pattern Stream tree (CPS-tree) to capture the recent stream data content and efficiently remove the obsolete, old stream data content. We also introduce the concept of dynamic tree restructuring in our CPS-tree to produce a highly compact frequency-descending tree structure at runtime. The complete set of recent frequent patterns is obtained from the CPS-tree of the current window using an FP-growth mining technique. Extensive experimental analyses show that our CPS-tree is highly efficient in terms of memory and time complexity when finding recent frequent patterns from a high-speed data stream.
Reentrant Readers-Writers: A Case Study Combining Model Checking with Theorem Proving
Authors: Bernard Gastel, Leonard Lensink, Sjaak Smetsers, Marko Eekelen
Venue: Formal Methods for Industrial Critical Systems: 13th International Workshop, FMICS 2008, L'Aquila, Italy, September 15-16, 2008, Revised Selected Papers (2009)

The classic readers-writers problem has been extensively studied. This holds to a lesser degree for the reentrant version, where it is allowed to nest locking actions. Such nesting is useful when a library is created with various procedures that each start and end with a lock. Allowing nesting makes it possible for these procedures to call each other. We considered an existing widely used industrial implementation of the reentrant readers-writers problem. We modeled it using a model checker revealing a serious error: a possible deadlock situation. The model was improved and checked satisfactorily for a fixed number of processes. To achieve a correctness result for an arbitrary number of processes the model was converted to a theorem prover with which it was proven.
Fuzzy Comprehensive Evaluation on Digital Libraries Based on Membership Degree Transformation New Algorithm-M(1,2,3)
Authors: Hua Jiang
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

In the evaluation process of digital libraries, there are many aspects needing to consider, with a lot of uncertainty and ambiguity, so it is reasonable and scientific to apply fuzzy comprehensive evaluation method for digital library fuzzy evaluation. The core of fuzzy evaluation is membership degree transformation. But the existing transformation methods should be questioned, because redundant data in index membership degree is also used to compute object membership degree, which is not useful for object classification. The new algorithm is: using data mining technology based on entropy to mine knowledge information about object classification hidden in every index, affirm the relationship of object classification and index membership, eliminate the redundant data in index membership for object classification by defining distinguishable weight and extract valid values to compute object membership. The new algorithm of membership degree transformation includes three calculation steps which can be summarized as "effective, comparison and composition", which is denoted as M(1,2,3). The paper applied the new algorithm in the fuzzy evaluation of digital libraries.
GCSim: A GPU-Based Trace-Driven Simulator for Multi-level Cache
Authors: Han Wan, Xiaopeng Gao, Xiang Long, Zhiqiang Wang
Venue: Proceedings of the 8th International Symposium on Advanced Parallel Processing Technologies (2009)

We describe the design of parallel trace-driven cache simulation for the purposes of evaluating different cache structures. As the research goes deeper, traditional simulation methods, which can only execute simulation operations in sequence, are no longer practical due to their long simulation cycles. An obvious way to achieve fast parallel simulation is to simulate the independent sets of a cache concurrently on different compute resources. We considered the use of generic GPU to accelerate cache simulation which exploits set-partitioning as the main source of parallelism. But we show this technique is not efficient in the case that just simulating one cache configuration, since a high correlation of the activity between different sets. Trace-sort and multi-configuration simulation in one single pass techniques are developed, taking advantage of the full programmability offered by the Compute Unified Device Architecture (CUDA) on the GPU. Our experimental results demonstrate that the cache simulator based on GPU-CPU platform gains 2.44x performance improvement compared to traditional sequential algorithm.
A Wireless Multimedia Sensor Network Based Intelligent Safety and Security System (IS³)
Authors: Nassar Ikram, Shakeel Durranii, Hasan Sajid, Husnain Saeed
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

This paper introduces a Wireless Multimedia Sensor Network (WMSN), Intelligent Safety and Security System IS³ with building safety and security as targeted application in perspective. The paper presents IS³’s smart architecture, with two objectives under focus; first to identify persons using passive infrared (PIR) sensor triggering a VGA quality CMOS camera to record and second to automate the building appliances for maintaining ambient room environment (temperature, humidity,lighting conditions etc) based on feedback from sensors. The architecture and operation is illustrated in detail showing event triggered energy efficient nature of the system offering faster data rates against simpler architecture in comparison with other existing solutions. IS³ node comprising of a processor and radio board, a sensor board (low tier) and a multimedia board (upper tier) are described in detail along with their specifications and applicability. The paper concludes with results and outcome of the system along with prospective future road map.
A measure of cross-training benefit versus job skill specialization
Authors: Kenneth A. Marentette, Alan W. Johnson, Lisa Mills
Venue: Computers and Industrial Engineering (2009)

Given ever-higher labor costs, organizations should periodically assess the match of personnel skills and quantities with required duties. Consolidating similar functional specialties can improve efficiency by increasing staffing for high-demand jobs, or by identifying areas where staff may be reduced. However, such consolidation activities are often done anecdotally, and can potentially overlook successful skill pairings. We propose a model that enables an objective, repeatable skills consolidation assessment process. Our model-a cost/benefit ratio-identifies skill pairings which are likely to merge successfully, by comparing the costs of training to the benefits of increased staffing level efficiencies for these jobs.
User-centered design of mobile wellness applications
Authors: Aino Ahtinen
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

The PhD research explores the design space of mobile wellness applications by utilizing design research methods. Several case studies are included in the research, e.g. [1],[2],[3],[4]. The main focus of the research is on the aspects, considerations and solutions related to motivational and persuasive mobile wellness applications. The research draws from the multifaceted combination of theories of human behavior, motivation and knowledge of technological possibilities, especially from the user experience perspective.
A comparison of tagging strategies for statistical information extraction
Authors: Christian Siefkes
Venue: Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume: Short Papers on XX (2006)

There are several approaches that model information extraction as a token classification task, using various tagging strategies to combine multiple tokens. We describe the tagging strategies that can be found in the literature and evaluate their relative performances. We also introduce a new strategy, called Begin/After tagging or BIA, and show that it is competitive to the best other strategies.
Rapid Prototyping of Planning & Scheduling Tools
Authors: Amedeo Cesta, Simone Fratini, Alessandro Donati, Henrique Oliveira, Nicola Policella
Venue: Proceedings of the Third IEEE International Conference on Space Mission Challenges for Information Technology (2009)

The Advanced Planning and Scheduling Initiative, or APSI, is an ESA programme to design and implement an Artificial Intelligence (AI) software infrastructure for planning and scheduling that can generically support different types and classes of space mission operations. The goal of the APSI is twofold: (1)~creating a software framework to improve the cost-effectiveness and flexibility of mission planning support tool development; (2)~bridging the gap between AI planning and scheduling technology and the world of space mission planning. A key aspect of the success of this project is the presence of a flexible timeline representation module that allows to exploit alternatives in the modeling of mission features. This paper shows an example of such a flexibility by using a real problem in the space realm - the HERSCHEL Science Long Term Planning process.
ODDUGI: Ubiquitous Mobile Agent System
Authors: Sungjin Choi, Hyunseung Choo, Maengsoon Baik, Hongsoo Kim, Eunjoung Byun
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

A mobile agent is regarded as an attractive technology when developing distributed applications in mobile and ubiquitous computing environments. In this paper, we present ODDUGI, a java-based ubiquitous mobile agent system. The ODDUGI mobile agent system provides fault tolerance, security, location management and message delivery mechanisms in a multi-region mobile agent computing environment. We describe the architecture, design concepts and main features of the ODDUGI. In addition, we present the One-Touch Campus Service application developed on the basis of ODDUGI in mobile and ubiquitous computing environments.
FEM Analysis and Optimization of Process Parameters in Precision Bar Cutting Process
Authors: ShiWen Du, YongTang Li
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

Precision bar cutting process is a typical large localized plastic deformation process. Based on its forming characteristics, a numerical model is established and an elasto-plastic simulation is performed using the finite element method (FEM). The re-meshing method is used when the severe element distortion occurs to facilitate further computation and avoid divergence. The Normalized Cockroft&Latham fracture criterion is adopted to predict and determine the time and site of crack initiation and propagation. Based on this numerical model, the distribution and developing trend of the stress and strain in the shearing zone are predicted. Furthermore, the influence of several process parameters, such as cutting-speed, cutting temperature, cutting gap etc, on the cutting quality is analyzed. The discipline is in accordance with the actual manufacture situation, which can be guidance to optimization of process parameters.
What's in an attribute? consequences for the least common subsumer
Authors: Ralf Küsters, Alex Borgida
Venue: Journal of Artificial Intelligence Research (2001)

Functional relationships between objects, called "attributes", are of considerable importance in knowledge representation languages, including Description Logics (DLs). A study of the literature indicates that papers have made, often implicitly, different assumptions about the nature of attributes: whether they are always required to have a value, or whether they can be partial functions. The work presented here is the first explicit study of this difference for subclasses of the CLASSIC DL, involving the same-as concept constructor. It is shown that although determining subsumption between concept descriptions has the same complexity (though requiring different algorithms), the story is different in the case of determining the least common subsumer (lcs). For attributes interpreted as partial functions, the lcs exists and can be computed relatively easily; even in this case our results correct and extend three previous papers about the lcs of DLs. In the case where attributes must have a value, the lcs may not exist, and even if it exists it may be of exponential size. Interestingly, it is possible to decide in polynomial time if the lcs exists.
QoS provision in wireless access networks: a routing perspective considering mobility
Authors: Konstantinos Samdanis, A. Hamid Aghvami
Venue: International Journal of Network Management (2009)

Future wireless communications are expected to provide mobile users access to the desired service with the appropriate quality at any place. The essential elements for assembling such a vision are mobility, quality of service (QoS) provision and scalability, which are expected to be merged into the design process of wireless access networks. Internet mobility support is currently entering a mature phase in which scalable solutions provide low loss or even seamless handovers in cellular and heterogeneous mobile environments. Wireless and mobile QoS architectures extend the equivalent Internet approaches in order to accommodate the requirements associated with the presence of wireless links and mobility. Nevertheless, none of the popular mobility proposals combined with wireless and mobile QoS architectures encounter QoS in the routing function, leaving the QoS provision underutilized. QoS routing (QoSR) complements existing QoS architectures, enhancing application performance especially in the case of congestion, while providing efficient resource management. However, QoSR was originally designed for fixed IP networks without taking mobility into account. This paper investigates the interaction of QoSR in wireless access networks, identifying key points for the efficient cooperation with mobility and existing QoS architectures.
A Position Paper on 'Living Laboratories': Rethinking Ecological Designs and Experimentation in Human-Computer Interaction
Authors: Ed H. Chi
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

HCI have long moved beyond the evaluation setting of a single user sitting in front of a single desktop computer, yet many of our fundamentally held viewpoints about evaluation continues to be ruled by outdated biases derived from this legacy. We need to engage with real users in 'Living Laboratories', in which researchers either adopt or create functioning systems that are used in real settings. These new experimental platforms will greatly enable researchers to conduct evaluations that span many users, places, time, location, and social factors in ways that are unimaginable before.
Contextual-Guided Bag-of-Visual-Words Model for Multi-class Object Categorization
Authors: Mehdi Mirza-Mohammadi, Sergio Escalera, Petia Radeva
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

Bag-of-words model (BOW) is inspired by the text classification problem, where a document is represented by an unsorted set of contained words. Analogously, in the object categorization problem, an image is represented by an unsorted set of discrete visual words (BOVW). In these models, relations among visual words are performed after dictionary construction. However, close object regions can have far descriptions in the feature space, being grouped as different visual words. In this paper, we present a method for considering geometrical information of visual words in the dictionary construction step. Object interest regions are obtained by means of the Harris-Affine detector and then described using the SIFT descriptor. Afterward, a contextual-space and a feature-space are defined, and a merging process is used to fuse feature words based on their proximity in the contextual-space. Moreover, we use the Error Correcting Output Codes framework to learn the new dictionary in order to perform multi-class classification. Results show significant classification improvements when spatial information is taken into account in the dictionary construction step. 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
Teaching Quality Evaluation System Design of Teachers in Higher Colleges & Universities
Authors: Xiaoyong Lu, Huizhen Xue
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

Central task of higher colleges & universities is to cultivate qualified personnel, central link of which is teaching task. Teaching task has always been the central task of colleges & universities. The improvement of teaching quality mainly relies on teachers. Evaluation of teaching quality of teachers is the main working part of educational administration in various higher colleges & universities, therefore, it is necessary to establish a set of just and democratic teaching quality evaluation system of teachers, evaluate and create a scientific and reliable teaching quality evaluation system and method to improve the teaching quality of teachers.
Photovoltaic scavenging systems: Modeling and optimization
Authors: D. Brunelli, D. Dondi, A. Bertacchini, L. Larcher, P. Pavan, L. Benini
Venue: Microelectronics Journal (2009)

The interest in embedded portable systems and wireless sensor networks (WSNs) that scavenge energy from the environment has been increasing over the last years. Thanks to the progress in the design of low-power circuits, such devices consume less and less power and are promising candidates to perform continued operation by the use of renewable energy sources. The adoption of maximum power point tracking (MPPT) techniques in photovoltaic scavengers increases the energy harvesting efficiency and leads to several benefits such as the possibility to shrink the size of photovoltaic modules and energy reservoirs. Unfortunately, the optimization of this process under non-stationary light conditions is still a key design challenge and the development of a photovoltaic harvester has to be preceded by extensive simulations. We propose a detailed model of the solar cell that predicts the instantaneous power collected by the panel and improves the simulation of harvester systems. Furthermore, the paper focuses on a methodology for optimizing the design of MPPT solar harvesters for self-powered embedded systems and presents improvements in the circuit architecture with respect to our previous implementation. Experimental results show that the proposed design guidelines allow to increment global efficiency and to reduce the power consumption of the scavenger.
A Survey on the Privacy Preserving Algorithm of Association Rule Mining
Authors: Yongcheng Luo, Yan Zhao, Jiajin Le
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

We provide an overview of privacy preserving association rule mining, which is one of the most popular pattern-discovery methods in the new and rapidly emerging research area of privacy preserving data mining. Various proposals and algorithms have been designed for it in recent years. In this paper, we summarize them and survey current existing techniques, and analyze their advantage and disadvantage. We divide the proposals of privacy preserving association rule mining into three categories: heuristic-based techniques, reconstruction-based techniques, cryptography-based techniques. Then we give a simple review of the work accomplished. Finally, we conclude further research directions of privacy preserving algorithms of association rule mining by analyzing the existing work.
Adding more languages improves unsupervised multilingual part-of-speech tagging: a Bayesian non-parametric approach
Authors: Benjamin Snyder, Tahira Naseem, Jacob Eisenstein, Regina Barzilay
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics (2009)

We investigate the problem of unsupervised part-of-speech tagging when raw parallel data is available in a large number of languages. Patterns of ambiguity vary greatly across languages and therefore even unannotated multilingual data can serve as a learning signal. We propose a non-parametric Bayesian model that connects related tagging decisions across languages through the use of multilingual latent variables. Our experiments show that performance improves steadily as the number of languages increases.
An Improved Particle Swarm Algorithm for Search Optimization
Authors: Li Zhi-jie, Liu Xiang-dong, Duan Xiao-dong, Wang Cun-rui
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

To address the problem of space locus searching, a slowdown particle swarm optimization (SPSO) is proposed to improve the convergence performance of particle swarm from the position viewpoint. The particle swarm in SPSO is divided into many independent sub-swarms to guarantee that particles convergent to different position, since space locus has multiple optimal solutions and requires the convergence of both fitness and position of particle. Furthermore, particle velocity is updated by half according to fitness to achieve the position convergence. The simulation results show the advantage of the proposed slowdown particle swarm optimization-SPSO, which leads to an efficient position convergence.
Revenue monotonicity in combinatorial auctions
Authors: Baharak Rastegari, Anne Condon, Kevin Leyton-Brown
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

Intuitively, one might expect that a seller's revenue from an auction weakly increases as the number of bidders grows, as this increases competition. However, it is known that for combinatorial auctions that use the VCG mechanism, a seller can sometimes increase revenue by dropping bidders. In this paper we investigate the extent to which this problem can occur under other dominant-strategy combinatorial auction mechanisms. Our main result is that such failures of "revenue monotonicity" are not limited to mechanisms that achieve efficient allocations. Instead, they can occur under any dominant-strategy direct mechanism that sets prices using critical values, and that always chooses an allocation that cannot be augmented to make some bidder better off, while making none worse off.