ppxscal/embedding_network huggingface dataset:
Efficient constraint evaluation in categorical sequential pattern mining for trajectory databases
Authors: Leticia I. Gomez, Alejandro A. Vaisman
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

The classic Generalized Sequential Patterns (GSP) algorithm returns all frequent sequences present in a database. However, usually a few ones are interesting from a user's point of view. Thus, post-processing tasks are required in order to discard uninteresting sequences. To avoid this drawback, languages based on regular expressions (RE) were proposed to restrict frequent sequences to the ones that satisfy user-specified constraints. In all of these languages, REs are applied over items, which limits their applicability in complex real-world situations. We propose a much powerful language, based on regular expressions, denoted RE-SPaM, where the basic elements are constraints defined over the (temporal and non-temporal) attributes of the items to be mined. Expressions in this language may include attributes, functions over attributes, and variables. We specify the syntax and semantics of RE-SPaM, and present a comprehensive set of examples to illustrate its expressive power. We study in detail how the expressions can be used to prune the resulting sequences in the mining process. In addition, we introduce techniques that allow pruning sequences in the early stages of the process, reducing the need to access the database, making use of the categorization of the attributes that compose the items, and of the automaton that accepts the language generated by the RE. Finally, we present experimental results. Although in this paper we focus on trajectory databases, our approach is general enough for being applied to other settings.
On the Stability of Web Crawling and Web Search
Authors: Reid Anderson, Christian Borgs, Jennifer Chayes, John Hopcroft, Vahab Mirrokni, Shang-Hua Teng
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

In this paper, we analyze a graph-theoretic property motivated by web crawling. We introduce a notion of stable cores, which is the set of web pages that are usually contained in the crawling buffer when the buffer size is smaller than the total number of web pages. We analyze the size of core in a random graph model based on the bounded Pareto power law distribution. We prove that a core of significant size exists for a large range of parameters 2 < &alpha;< 3 for the power law.
Smoothing Imprecise 1.5D Terrains
Authors: Chris Gray, Maarten Löffler, Rodrigo I. Silveira
Venue: Approximation and Online Algorithms: 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers (2009)

We study optimization problems in an imprecision model for polyhedral terrains. An imprecise terrain is given by a triangulated point set where the height component of the vertices is specified by an interval of possible values. We restrict ourselves to 1.5-dimensional terrains: an imprecise terrain is given by an x-monotone polyline, and the y-coordinate of each vertex is not fixed but constrained to a given interval. Motivated by applications in terrain analysis, in this paper we present two linear-time approximation algorithms, for minimizing the largest turning angle and for maximizing the smallest one. In addition, we also provide linear time exact algorithms for minimizing and maximizing the sum of the turning angles.
Numerical Modelling for Designing Tunnel Support in Heavily Jointed Rock
Authors: Keping Zhou, Ming Xia
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

This paper presents the engineering geological properties and support design of a tunnel which is heavily jointed at the Kalatongke Cu-Ni Mine. Then according to geological properties and mechanical properties of the rock, the two-dimension finite element program called Phase2, was applying to analysis the stability of the tunnel. Three models of simulations are carried out in this paper for tunnel support in heavily jointed rock to investigate the effect of (1) unsupported, (2) concrete, and (3) a combination of concrete and rock bolts. The surrounding stresses distribution, displacement and yielded elements around the tunnel were simulated and analyzed. In these analyses, since after applying a combination of concrete and rock bolts for the support system, tunnel deformation
Data Aggregation Protocol Based on Dynamic Routing in Wireless Sensor Networks
Authors: Zhang Jiao, Ren Fengyuan, He Tao, Lin Chuang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

Data aggregation has been proposed as one method for reducing energy consumption in sensor networks. One critical factor in data aggregation is routing. In this paper, we generalize the present routing schemes and find that they are all static and thus cannot change when data packets flowing to sink. To make data aggregation more efficient, we design data aggregation protocol based on dynamic routing (DABDR). The dynamic routing in DABDR is based on two potential field: Depth potential field is to make packets flowing to sink and DA queue length potential field is to make packets more concentrated in spate and thus data aggregation will be more efficient. Simulations in network show that DABDR is 10 times better than protocol without data aggregation and 2 times better than data aggregation protocols based on shortest past tree in terms of energy consumption.
Context restoration in multi-tasking dialogue
Authors: Fan Yang, Peter A. Heeman
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

In this paper we conduct an exploratory experiment on context restoration in multi-tasking dialogue and report our preliminary findings. We examine a corpus of human-human dialogues, in which pairs of conversants, using speech, work on an ongoing task while occasionally completing real-time tasks. We investigate whether the conversants, when returning to the ongoing task, make any effort to restore the context. First, we identify two types of actions, utterance restatement and information review, as possible restorations. Second, from a statistical analysis, we find that these actions are used more often when returning to the ongoing task, and hence seem to play a role in context restoration. Our findings will help to build a foundation for future speech interfaces that support multi-tasking dialogue.
Metalearning: Applications to Data Mining, 1 edition
Authors: Pavel Brazdil, Christophe Giraud-Carrier, Carlos Soares, Ricardo Vilalta
Venue:  (2008)

Metalearning is the study of principled methods that exploit metaknowledge to obtain efficient models and solutions by adapting machine learning and data mining processes. While the variety of machine learning and data mining techniques now available can, in principle, provide good model solutions, a methodology is still needed to guide the search for the most appropriate model in an efficient way. Metalearning provides one such methodology that allows systems to become more effective through experience. This book discusses several approaches to obtaining knowledge concerning the performance of machine learning and data mining algorithms. It shows how this knowledge can be reused to select, combine, compose and adapt both algorithms and models to yield faster, more effective solutions to data mining problems. It can thus help developers improve their algorithms and also develop learning systems that can improve themselves. The book will be of interest to researchers and graduate students in the areas of machine learning, data mining and artificial intelligence.
Time-limited next arrival heuristic for batch processing and setup reduction in a re-entrant environment
Authors: Stephen Murray, John Geraghty, Paul Young, Steve Sievwright
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This paper presents a new batch scheduling heuristic - the Time-Limited Next Arrival heuristic for batch processing and setup reduction (TLNA). This heuristic has been defined for a batch processing machine group in a re-entrant manufacturing environment where setups are sequence-dependent. When making the scheduling decision, TLNA takes into account future arrivals based on a user-defined wait time. A series of experiments is conducted on a discrete event simulation model to determine the impact of this wait time. A total cost function is used to combine two conflicting performance measures (total item queuing time and total machine running time) into one. All TLNA wait time scenarios are compared to the Next Arrival Control Heuristic for Multiple products and Multiple machines (NACHMM). The experiments presented show that there is a wait time that minimises the total operational cost. TLNA outperforms NACHMM with regard to all performance measures except total queuing time.
High performance spreadsheet simulation on a desktop grid
Authors: Juta Pichitlamken, Supasit Kajkamhaeng, Putchong Uthayopas
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

We present a proof-of-concept prototype for high performance spreadsheet simulation called S3. Our goal is to provide a user-friendly, yet computationally powerful simulation environment for end users. Our approach is to add power of parallel computing on Windows-based desktop grid into popular Excel models. We show that, by using standard Web Services and Service-Oriented Architecture (SOA), one can build a fast and efficient system on a desktop grid for simulation. The complexity of parallelism can be hidden from users through a well-defined computation template. This work also demonstrates that a massive computing power can be harvested by linking off-the-shelf office PCs into a desktop grid for simulation. The experimental results show that the prototype system is highly scalable. In the best case, the execution time can be reduced 13.6 times using 16 desktop PCs; the simulation time is dramatically reduced from 200 minutes to 14 minutes.
Invited Talk: Decoding Cyclic Codes: The Cooper Philosophy
Authors: Teo Mora, Emmanuela Orsini
Venue: Mathematical Methods in Computer Science: Essays in Memory of Thomas Beth (2008)

In 1990, Cooper [9, 10] suggested to use Gröbner basis [3, 4] computation in order to deduce error locator polynomials of cyclic codes.
IncreTable, a mixed reality tabletop game experience
Authors: Jakob Leitner, Michael Haller, Kyungdahm Yun, Woontack Woo, Maki Sugimoto, Masahiko Inami
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

IncreTable is a mixed reality tabletop game inspired by The Incredible Machine. Users can combine real and virtual game pieces in order to solve puzzles in the game. Game actions include placing virtual domino blocks with digital pens, controlling a virtual car by modifying the virtual terrain through a depth camera interface or controlling real robots to topple over real and virtual dominoes.
Optimal Mechanisms for Single Machine Scheduling
Authors: Birgit Heydenreich, Debasis Mishra, Rudolf Müller, Marc Uetz
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

We study the design of optimal mechanisms in a setting where job-agents compete for being processed by a service provider that can handle one job at a time. Each job has a processing time and incurs a waiting cost. Jobs need to be compensated for waiting. We consider two models, one where only the waiting costs of jobs are private information (1-d), and another where both waiting costs and processing times are private (2-d). An optimal mechanism minimizes the total expected expenses to compensate all jobs, while it has to be Bayes-Nash incentive compatible. We derive closed formulae for the optimal mechanism in the 1-d case and show that it is efficient for symmetric jobs. For non-symmetric jobs, we show that efficient mechanisms perform arbitrarily bad. For the 2-d case, we prove that the optimal mechanism in general does not even satisfy IIA, the `independent of irrelevant alternatives' condition. We also show that the optimal mechanism is not even efficient for symmetric agents in the 2-d case.
SEA: Segment-enrich-annotate paradigm for adapting dialog-based content for improved accessibility
Authors: K. Selçuk Candan, Mehmet E. Dönderler, Terri Hedgpeth, Jong Wook Kim, Qing Li, Maria Luisa Sapino
Venue: ACM Transactions on Information Systems (TOIS) (2009)

While navigation within complex information spaces is a problem for all users, the problem is most evident with individuals who are blind who cannot simply locate, point, and click on a link in hypertext documents with a mouse. Users who are blind have to listen searching for the link in the document using only the keyboard and a screen reader program, which may be particularly inefficient in large documents with many links or deep hierarchies that are hard to navigate. Consequently, they are especially penalized when the information being searched is hidden under multiple layers of indirections. In this article, we introduce a segment-enrich-annotate (SEA) paradigm for adapting digital content with deep structures for improved accessibility. In particular, we instantiate and evaluate this paradigm through the iCare-Assistant, an assistive system for helping students who are blind in accessing Web and electronic course materials. Our evaluations, involving the participation of students who are blind, showed that the iCare-Assistant system, built based on the SEA paradigm, reduces the navigational overhead significantly and enables user who are blind access complex online course servers effectively.
Modeling and Analysis of Multi-agent Coordination Using Nearest Neighbor Rules
Authors: Xuesong Chen, Yimin Yang, Shuting Cai, Jianping Chen
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

In a recent IEEE Transactions on Automatic Control article, Jadbabaie et al. provides a theoretical explanation of the discrete-time model of groups of mobile autonomous agents raised by Vicsek et al. in 1995. In their paper, Jadbabaie et al. established conditions given in terms of neighbor graphs for coordination of agents and provided that these agents are periodically linked together. This paper sharpens this result by showing that coordination will be reached under a very weak condition that requires all agents are finally linked together. The theorems in this paper show that convergence will be attained if these neighbor graphs are finally linked together. This condition is also strictly weaker than the one Jadbabaie et al. desired. An example is provided that illustrates the soundness of the theorem.
Exploring feature-based approaches in PET images for predicting cancer treatment outcomes
Authors: I. El Naqa, P. W. Grigsby, A. Apte, E. Kidd, E. Donnelly, D. Khullar, S. Chaudhari, D. Yang, M. Schmitt, Richard Laforest, W. L. Thorstad, J. O. Deasy
Venue: Pattern Recognition (2009)

Accumulating evidence suggests that characteristics of pre-treatment FDG-PET could be used as prognostic factors to predict outcomes in different cancer sites. Current risk analyses are limited to visual assessment or direct uptake value measurements. We are investigating intensity-volume histogram metrics and shape and texture features extracted from PET images to predict patient's response to treatment. These approaches were demonstrated using datasets from cervix and head and neck cancers, where AUC of 0.76 and 1.0 were achieved, respectively. The preliminary results suggest that the proposed approaches could potentially provide better tools and discriminant power for utilizing functional imaging in clinical prognosis.
Improved Fine Frequency Synchronization Method for OFDM-Based DRM
Authors: Young-Hwan You, Sang-Tae Kim, Kyung-Taek Lee, Hyoung-Kyu Song
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this letter, a robust pilot-assisted synchronization scheme is proposed for estimation of residual frequency offset (RFO) in OFDM-based digital radio mondiale (DRM) system. The RFO estimator uses the gain reference pilots mainly reserved for the channel tracking in the DRM standard. To demonstrate the efficiency of the proposed RFO estimator, comparisons are made with the conventional RFO estimator using the frequency reference pilots in terms of mean square error (MSE) performance.
Adaptive Pre-Processing Algorithm to Improve Coding Performance of Seriously Degraded Video Sequences for H.264 Video Coder
Authors: Won-Seon Song, Min-Cheol Hong
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper introduces an adaptive low complexity pre-processing filter to improve the coding performance of seriously degraded video sequences that is caused by the additive noise. The additive noise leads to a decrease in coding performance due to the high frequency components. By incorporating local statistics and quantization parameter into filtering process, the spurious noise is significantly attenuated and coding efficiency is improved for given quantization step size. In order to reduce the complexity of the pre-processing filter, the simplified local statistics and quantization parameter are introduced. The simulation results show the capability of the proposed algorithm.
Recurrent neuro fuzzy control design for tracking of mobile robots via hybrid algorithm
Authors: Ching-Hung Lee, Ming-Hui Chiu
Venue: Expert Systems with Applications: An International Journal (2009)

This paper proposes a TSK-type recurrent neuro fuzzy system (TRNFS) and hybrid algorithm- GA_BPPSO to develop a direct adaptive control scheme for stable path tracking of mobile robots. The TRNFS is a modified model of the recurrent fuzzy neural network (RFNN) to obtain generalization and fast convergence. The TRNFS is designed using hybridization of genetic algorithm (GA), back-propagation (BP), and particle swarm optimization (PSO), called GA_BPPSO. For the tracking control of mobile robot, two TRNFSs are designed to generate the control inputs by direct adaptive control scheme and hybrid algorithm GA_BPPSO. Through simulation results, we demonstrate the effectiveness of our proposed controller.
Recursive Generation of 5-Regular Planar Graphs
Authors: Mahdieh Hasheminezhad, Brendan D. Mckay, Tristan Reeves
Venue: Proceedings of the 3rd International Workshop on Algorithms and Computation (2009)

We describe for the first time how the 5-regular simple planar graphs can all be obtained from an elementary family of starting graphs by repeatedly applying a few local expansion operations. The proof uses an innovative amalgam of theory and computation. By incorporating the recursion into the canonical construction path method of isomorph rejection, a generator of non-isomorphic embedded 5-regular planar graphs is obtained with time complexity O(n 2) per isomorphism class.
SSL/TLS with Quantum Cryptography
Authors: Mario Pivk, Christian Kollmitzer, Stefan Rass
Venue: Proceedings of the 2009 Third International Conference on Quantum, Nano and Micro Technologies (2009)

The current standard to exchange a secret key for ensuring secure data transmission within the SSL/TLS protocol is based on Public-Key encryption. This method is only secure as long as the computation power of a potential attacker is limited. So far, the only way to make an unconditional secure key exchange, is to use quantum key distribution (QKD). With the latest figures of sifting key rates provided by NIST, we show which authentic theoretical final key rates are possible. Furthermore we present a modified SSL/TLS protocol, which uses quantum key distribution, in different encryption variants.
Applying a novel decision rule to the sphere-structured support vector machines algorithm
Authors: Lei Gu, Hui-zhong Wu
Venue: Neural Computing and Applications (2009)

The traditional sphere-structured support vector machines algorithm is one of the learning methods. It can partition the training samples space by means of constructing the spheres with the minimum volume covering all training samples of each pattern class in high-dimensional feature space. However, the decision rule of the traditional sphere-structured support vector machines cannot assign ambiguous sample points such as some encircled by more than two spheres to valid class labels. Therefore, the traditional sphere-structured support vector machines is insufficient for obtaining the better classification performance. In this article, we propose a novel decision rule applied to the traditional sphere-structured support vector machines. This new decision rule significantly improves the performance of labeling ambiguous points. Experimental results of seven real datasets show the traditional sphere-structured support vector machines based on this new decision rule can not only acquire the better classification accuracies than the traditional sphere-structured support vector machines but also achieve the comparable performance to the classical support vector machines.
The Internet in the Arab World: Egypt and Beyond, 1st edition
Authors: Rasha A. Abdulla
Venue: Digital Formations (2007)

The Internet in the Arab World: Egypt and Beyond is the first book to offer a comprehensive and up-to-date guide to the status of the Internet and its uses and effects in Egypt and the Arab world. Tackling the issue in a systematic, scientific manner, this book also examines Islamic online communications, online censorship, and Internet use by the civic society as an alternative channel for its mostly oppressed voices. This book is a valuable addition to the libraries of students, scholars, and anyone interested in information technologies and the Arab world.
Using Distributed Mutual Exclusion for Coordinating Virtual Meeting in an Ubiquitous Chat System
Authors: Berto de Tacio Preira Gomes, Omar Andres Carmona Cortes, Rafael Fernandes Lopes
Venue: Proceedings of the 2009 International Conference on Mobile, Hybrid, and On-line Learning (2009)

The purpose of this paper is to present the application of distribute mutual exclusion for controlling the text message exchange in a ubiquitous chat named M-SynchroTalk. This chat allows tutors and students to be in contact even on the move. The main issue is to organize the entire communication when several students speak at the same time and about many subjects. All in all, the chat hold the dialog context controlling the message broadcast by means of the distributed mutual exclusion algorithms. In this context, just one student could send a message at a time. To achieve mutual exclusion in the ubiquitous chat, the centralized and the token ring algorithms have been developed. The centralized algorithm was implemented in two versions: human coordinator and computer coordinator. Preliminary results show that this solution provides a well-controlled environment suitable for M-Learning environments.