ppxscal/embedding_network huggingface dataset:
Demo abstract: A high-fidelity sensor network simulator using accurate CC2420 model
Authors: Hyunwoo Joe, Jonghyuk Lee, Duk-Kyun Woo, Pyeongsoo Mah, Hyungshin Kim
Venue: Proceedings of the 2009 International Conference on Information Processing in Sensor Networks (2009)

In sensor networks, it is useful for developers to simulate applications before actual deployment. In this paper, we report a high-fidelity instruction-level sensor network simulator using an accurate CC2420 model. This simulator is independent of the target node's operating system and it supports MICAz motes which contain Atmega128 and CC2420. Besides its cycle-accurate processor emulation, the CC2420's internal operations are accurately modeled so that our simulator shows realistic wireless communication timing during the simulation. In addition, our simulator shows power consumption of each sensor node. Using this simulator, researchers can accurately verify the sensor network's behavior and power consumption without actual hardware deployment.
On the Composition of Public-Coin Zero-Knowledge Protocols
Authors: Rafael Pass, Wei-Lung Dustin Tseng, Douglas Wikström
Venue: Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology (2009)

We show that only languages in BPP have public-coin, black-box zero-knowledge protocols that are secure under an unbounded (polynomial) number of parallel repetitions. This result holds both in the plain model (without any set-up) and in the Bare Public-Key Model (where the prover and the verifier have registered public keys). We complement this result by showing the existence of a public-coin black-box zero-knowledge proof that remains secure under any a-priori bounded number of concurrent executions.
Knowledge extraction using dynamical updating of representation
Authors: Aldo Dragoni, Guido Tascini, Luigi Lella, William Giordano
Venue: Proceedings of the 3rd Workshop on RObust Methods in Analysis of Natural Language Data (2004)

We present a system that extracts knowledge from the textual content of documents. The acquired knowledge is represented through an associative network, that is dynamically updated by the integration of a contextualized structure representing the content of the new analysed document. Grounded on the basis of "long term working memory" theory by W. Kintsch and K. A. Ericsson, our system makes use of a scale free graph model to update the final knowledge representation. This knowledge acquisition system has been validated by first experimental results.
Integrating Novel Class Detection with Classification for Concept-Drifting Data Streams
Authors: Mohammad M. Masud, Jing Gao, Latifur Khan, Jiawei Han, Bhavani Thuraisingham
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II (2009)

In a typical data stream classification task, it is assumed that the total number of classes are fixed. This assumption may not be valid in a real streaming environment, where new classes may evolve. Traditional data stream classification techniques are not capable of recognizing novel class instances until the appearance of the novel class is manually identified, and labeled instances of that class are presented to the learning algorithm for training. The problem becomes more challenging in the presence of concept-drift, when the underlying data distribution changes over time. We propose a novel and efficient technique that can automatically detect the emergence of a novel class in the presence of concept-drift by quantifying cohesion among unlabeled test instances, and separation of the test instances from training instances. Our approach is non-parametric, meaning, it does not assume any underlying distributions of data. Comparison with the state-of-the-art stream classification techniques prove the superiority of our approach.
Critical Infrastructures as Complex Systems: A Multi-level Protection Architecture
Authors: Pierluigi Assogna, Glauco Bertocchi, Antonio Dicarlo, Franco Milicchio, Alberto Paoluzzi, Giorgio Scorzelli, Michele Vicentino, Roberto Zollo
Venue: Critical Information Infrastructure Security: Third International Workshop, CRITIS 2008, Rome, Italy, October13-15, 2008. Revised Papers (2009)

This paper describes a security platform as a complex system of holonic communities, that are hierarchically organized, but self-reconfigurable when some of them are detached or cannot otherwise operate. Furthermore, every possible subset of holons may work autonomously, while maintaining self-conscience of its own mission, action lines and goals. Each holonic unit, either elementary or composite, retains some capabilities for sensing (perception), transmissive apparatus (communication), computational processes (elaboration), authentication/authorization (information security), support for data exchange (visualization interaction), actuators (mission), ambient representation (geometric reasoning), knowledge representation (logic reasoning), situation representation and forecasting (simulation), intelligent feedback (command control). The higher the organizational level of the holonic unit, the more complex and sophisticated each of its characteristic features.
Robust Object Tracking with Adaptive Fusion of Color and Edge Strength Local Mean Features Based on Particle Filter
Authors: LI Chunxin, Wang Xiaotong, Xu Xiaogang
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Aiming at the problem of real time and robustness of visual object tracking in a clutter background, an adaptive fusion of color rectangle feature and edge strength local mean tracking algorithm based on Particle Filter is put forward. To improve the tracking speed and precision, integral image is used to quickly compute the color rectangle feature and edge strength local mean, besides fuzzy logic is applied to adaptively adjust each feature weight. The simulation results illustrate the algorithm is robust and effective.
Tracking Objects beyond Rigid Motion
Authors: Nicole Artner, Adrian Ion, Walter G. Kropatsch
Venue: Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition (2009)

Tracking multiple features of a rigid or an articulated object, without considering the underlying structure, becomes ambiguous if the target model (for example color histograms) is similar to other nearby regions or to the background. Instead of tracking multiple features independently, we propose an approach that integrates the underlying structure into the tracking process using an attributed graph. The independent tracking processes are driven to a solution that satisfies the visual as well as the structural constraints. An approach for rigid objects is presented and extended to handle articulated objects consisting of rigid parts. Experimental results on real and synthetic videos show promising results in scenes with considerable amount of occlusion.
OCP: Oracle Database 11g Administrator Certified Professional Certification Kit
Authors: Biju Thomas, Robert G. Freeman, Charles A. Pack, Doug Stuns
Venue:  (2009)

To become an Oracle Certified Professional (OCP), one must be proficient in the latest update to Oracles industry-leading database product: Oracle 11gthis guide prepares you for all three exams that comprise the Oracle 11g OCP certification. Each level of certification is broken down, beginning with the prerequisite Oracle Certified Administrator certification, and concluding with the OCP certification. Youll get helpful insight for fulfilling the requirement of taking one of the approved courses offered by Oracle University.
Designing crowdsourcing community for the enterprise
Authors: Osamuyimen Stewart, Juan M. Huerta, Melissa Sader
Venue: Proceedings of the ACM SIGKDD Workshop on Human Computation (2009)

In this paper, we describe the design principles used for implementing crowdsourcing within the enterprise. This is based on our distinction between two kinds of crowdsourcing: enterprise (inside a firewall) versus the public domain. Whereas public domain crowdsourcing offers monetary rewards in exchange for participation, we show that identifying the right social objects and using these in designing the incentive model is sufficient to incent, motivate, and sustain participation levels in enterprise crowdsourcing. Finally, we show that the systematic integration of the characteristics of levels of participation into the design, e.g., the distinction between direct and indirect crowdsourcing, is sufficient for optimizing users' participation and contributions.
A Non-linear Classifier for Symbolic Interval Data Based on a Region Oriented Approach
Authors: Renata M. Souza, Diogo R. Salazar
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

This paper presents a non-linear classifier based on a region oriented approach for interval data. Each example of the learning set is described by a interval feature vector. Concerning the learning step, each class is described by a region (or a set of regions) in $\Re^{p}$ defined by hypercube of the objects belonging to this class. In the allocation step, the assignment of a new object to a class is based on a suitable L r Minkowski distance between intervals. Experiments with two synthetic interval data sets have been performed in order to show the usefulness of this classifier. The prediction accuracy (error rate) of the proposed classifier is calculated through a Monte Carlo simulation method with 100 replications.
The Generalized Wavelets Based on Meyer Wavelet
Authors: Xudong Teng, Xiao Yuan
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

Starting with investigating the Meyer scaling function, the original Meyer bases are extended to the generalized Meyer wavelet by introducing a time-shift factor into Meyer scaling coefficient functions in this paper. These new wavelets not only inherit many basic properties of the classical Meyer wavelets, such as orthonomality, time-frequency localization and so on, but also improve some performances of the Meyer wavelets. In addition, the symmetry of the generalized Meyer wavelets is also discussed in the paper, and a series of generalized scaling coefficients are given for practical applications.
Multiobjective optimization for small meander wire dipole antennas in a fixed area using ant colony system
Authors: Amir Galehdar, David V. Thiel, Andrew Lewis, Marcus Randall
Venue: International Journal of RF and Microwave Computer-Aided Engineering (2009)

Fixed area meander line antennas designed on a 5 &times; 5 rectangular grid were optimized for efficiency and resonant frequency. The Pareto front was developed using ant colony optimization and the numerical electromagnetic code. The lowest frequency antenna fits an area of 0.11&lambda;0 &times; 0.05&lambda;0 with an efficiency of 88&percnt;. &copy; 2009 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2009.
Is There Something Quantum-Like about the Human Mental Lexicon?
Authors: Peter Bruza
Venue: Proceedings of the 2nd International Conference on Theory of Information Retrieval: Advances in Information Retrieval Theory (2009)

This talk proceeds from the premise that IR should engage in a more substantial dialogue with cognitive science. After all, how users decide relevance, or how they chose terms to modify a query are processes rooted in human cognition. Recently, there has been a growing literature applying quantum theory (QT) to model cognitive phenomena. This talk will survey recent research, in particular, modelling interference effects in human decision making. One aspect of QT will be illustrated - how quantum entanglement can be used to model word associations in human memory. The implications of this will be briefly discussed in terms of a new approach for modelling concept combinations. Tentative links to human abductive reasoning will also be drawn. The basic theme behind this talk is QT can potentially provide a new genre of information processing models (including search) more aligned with human cognition.
Single- and Multi-Carrier MIMO Transmission for Broadband Wireless Systems
Authors: Ramjee Prasad, Muhammad Imadur Rahman, Sekhar Suvra Das
Venue:  (2009)

The main focus of "Single- and Multi-Carrier MIMO Transmission for Broadband Wireless Systems" is to provide the basic understanding of the underlying techniques related to PHY-MAC design of future wireless systems. It includes basic concepts related to single- and multi-carrier transmissions together with MIMO techniques. Discussions related to different recent standards that use single- and multi-carrier transmissions are also explained. "Single- and Multi-Carrier MIMO Transmission for Broadband Wireless Systems" provides a comprehensive and holistic approach to the variety of technical solutions. Future system design would require these different technologies to work together, and not independently. Therefore, it is very important to analyze the effects and gains when they are put together in a unified platform. This is the prime focus of this book. Moreover, the authors include recent research results which are not yet published in another form. The book is intended to be used for lectures in graduate level courses at universities. PhD level students should also find it useful as this book will outline the fundamental concepts and design methods for PHY and MAC layers of future wireless systems. This book can also be used as a reference by engineers and developers in the industry as well as by researchers in academia. For professionals, system architects and managers who play a key role in the selection of a baseline system concept for future wireless standards, such as IMT-Advanced type architecture, the authors will include discussions, analysis and guidelines to highlight overall system level perspective.
Phrase translation probabilities with ITG priors and smoothing as learning objective
Authors: Markos Mylonakis, Khalil Sima'an
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

The conditional phrase translation probabilities constitute the principal components of phrase-based machine translation systems. These probabilities are estimated using a heuristic method that does not seem to optimize any reasonable objective function of the word-aligned, parallel training corpus. Earlier efforts on devising a better understood estimator either do not scale to reasonably sized training data, or lead to deteriorating performance. In this paper we explore a new approach based on three ingredients (1) A generative model with a prior over latent segmentations derived from Inversion Transduction Grammar (ITG), (2) A phrase table containing all phrase pairs without length limit, and (3) Smoothing as learning objective using a novel Maximum-A-Posteriori version of Deleted Estimation working with Expectation-Maximization. Where others conclude that latent segmentations lead to overfitting and deteriorating performance, we show here that these three ingredients give performance equivalent to the heuristic method on reasonably sized training data.
A discriminative candidate generator for string transformations
Authors: Naoaki Okazaki, Yoshimasa Tsuruoka, Sophia Ananiadou, Jun'ichi Tsujii
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

String transformation, which maps a source string s into its desirable form t*, is related to various applications including stemming, lemmatization, and spelling correction. The essential and important step for string transformation is to generate candidates to which the given string s is likely to be transformed. This paper presents a discriminative approach for generating candidate strings. We use substring substitution rules as features and score them using an L1-regularized logistic regression model. We also propose a procedure to generate negative instances that affect the decision boundary of the model. The advantage of this approach is that candidate strings can be enumerated by an efficient algorithm because the processes of string transformation are tractable in the model. We demonstrate the remarkable performance of the proposed method in normalizing inflected words and spelling variations.
Sparse multi-scale grammars for discriminative latent variable parsing
Authors: Slav Petrov, Dan Klein
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

We present a discriminative, latent variable approach to syntactic parsing in which rules exist at multiple scales of refinement. The model is formally a latent variable CRF grammar over trees, learned by iteratively splitting grammar productions (not categories). Different regions of the grammar are refined to different degrees, yielding grammars which are three orders of magnitude smaller than the single-scale baseline and 20 times smaller than the split-and-merge grammars of Petrov et al. (2006). In addition, our discriminative approach integrally admits features beyond local tree configurations. We present a multiscale training method along with an efficient CKY-style dynamic program. On a variety of domains and languages, this method produces the best published parsing accuracies with the smallest reported grammars.
ITIL V3 Service Lifecycle Service Strategy (SS) Certification Exam Preparation Course in a Book for Passing the ITIL V3 Service Lifecycle Service Strategy ... on Your First Try Certification Study Guide
Authors: Ivanka Menken, Gerard Blokdijk
Venue:  (2009)

This self-study exam preparation guide for the ITIL V3 Service Lifecycle Service Strategy (SS) certification exam contains everything you need to test yourself and pass the Exam, including all the processes, and inputs and outputs. Exam topics are covered and insider secrets, complete explanations of all ITIL V3 subjects, test tricks and tips, numerous highly realistic sample questions, and exercises designed to strengthen understanding of ITIL V3 concepts and prepare you for exam success on the first attempt are provided. Can you imagine valuing a book so much that you send the author a "Thank You" letter? Tens of thousands of people understand why the material by The Art of Service is a worldwide best-seller. Is it their years of ITIL experience? The endless hours of ongoing research? The interviews with those who failed the exam, to identify gaps in their knowledge? Or is it the razor-sharp focus on making sure you don't waste a single minute of your time studying any more than you absolutely have to? Actually, it's all of the above. This book includes new exercises and sample questions never before in print. Offering numerous sample questions, critical time-saving tips plus information available nowhere else, this book will help you pass the ITIL V3 Service Lifecycle Service Strategy (SS) exam on your FIRST try. Done the ITIL V3 Service Lifecycle Service Strategy (SS) course, up to speed with the theory? Buy this. Read it. And Pass the ITIL V3 Service Lifecycle Service Strategy (SS) Exam.
Representing Aspects in Design
Authors: Saqib Iqbal, Gary Allen
Venue: Proceedings of the 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering (2009)

Aspect-Oriented Programming is providing a new way of handling cross-cutting concerns (also known as Aspects) in a modularized way. A number of languages, such as AspectJ, Spring, and AspectWorkz, have been developed to weave modularized Aspects with the base program. Similarly a lot of research has been conducted to improve the composition of Aspect models with the primary model. Although these suggested approaches have improved the implementation of Aspect, this paradigm is still lacking Aspect representation in the earlier phases of software development. Our proposed Aspect model addresses this problem and suggests a process-modeling approach for identifying and representing Aspects throughout the life cycle of system development.
Assessing Cognitive State with Multiple Physiological Measures: A Modular Approach
Authors: Lee W. Sciarini, Denise Nicholson
Venue: Proceedings of the 5th International Conference on Foundations of Augmented Cognition. Neuroergonomics and Operational Neuroscience: Held as Part of HCI International 2009 (2009)

The purpose of this effort is to introduce a novel approach which can be used to determine how multiple minimally intrusive physiological sensors can be used together and validly applied to areas such as Augmented Cognition and Neuroergonomics. While researchers in these fields have established the utility of many physiological measures for informing when to adapt systems, the use of such measures together remains limited. Specifically, this effort will provide a contextual explanation of cognitive state, workload, and the measurement of both; provide a brief discussion on several relatively noninvasive physiological measures; explore what a modular cognitive state gauge should consist of; and finally, propose a framework based on the previous items that can be used to determine the interactions of the various measures in relation to the change of cognitive state.
Nonlinear programming without a penalty function or a filter
Authors: N. I. M. Gould, Ph. L. Toint
Venue: Mathematical Programming: Series A and B (2009)

A new method is introduced for solving equality constrained nonlinear optimization problems. This method does not use a penalty function, nor a filter, and yet can be proved to be globally convergent to first-order stationary points. It uses different trust-regions to cope with the nonlinearities of the objective function and the constraints, and allows inexact SQP steps that do not lie exactly in the nullspace of the local Jacobian. Preliminary numerical experiments on CUTEr problems indicate that the method performs well.
Improving Graph Classification by Isomap
Authors: Kaspar Riesen, Volkmar Frinken, Horst Bunke
Venue: Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition (2009)

Isomap emerged as a powerful tool for analyzing input patterns on manifolds of the underlying space. It builds a neighborhood graph derived from the observable distance information and recomputes pairwise distances as the shortest path on the neighborhood graph. In the present paper, Isomap is applied to graph based pattern representations. For measuring pairwise graph dissimilarities, graph edit distance is used. The present paper focuses on classification and employs a support vector machine in conjunction with kernel values derived from original and Isomap graph edit distances. In an experimental evaluation on five different data sets from the IAM graph database repository, we show that in four out of five cases the graph kernel based on Isomap edit distance performs superior compared to the kernel relying on the original graph edit distances.