ppxscal/embedding_network huggingface dataset:
A WIMAX MIMO Network Architecture Exploiting Spatial Diversity of Multiple Antenna Sites
Authors: Geili T. A. El Sanousi
Venue: Proceedings of the 2009 Second International Conference on Advances in Mesh Networks (2009)

This paper presents a framework to exploit the Multi Input Multi Output (MIMO) technique in the Worldwide Interoperability for Microwave Access (WIMAX) physical layer. MIMO is an established standard in the WIMAX family, however practical literature on the exploitation of MIMO in WIMAX networks focused on treating the paradoxical situation of demand for Line Of Sight (LOS) in microwave communications against the essential MIMO prerequisite, i.e., the Non LOS (NLOS) and multi fade paths. This framework proposes a novel approach to exploit potentials of MIMO in WIMAX networks. This is achieved by exploiting spatial diversity of Multiple Antenna Sites (MAS) to create artificial NLOS environment, whereby, MAS(s) are encapsulated as antennas in a large scale frame. This presents a significant enhancement of the existing schemes, which highlighted the exploitation of the combination of Time Division Duplexing (TDD), Orthogonal Frequency Division Multiplexing (OFDM), and MIMO for Multiple Access Points (MAP(s)) in a Single Frequency Network (SFN). In this paper, the network is divided into layers and the above exploitation of MIMO is realised between these layers in a network-to-network communication scenario. The resulting network is characterized by high capacities at distribution access points and ease of design by virtue of combination of SFN and spatial techniques.
Reliable and Efficient Concurrent Synchronization for Embedded Real-Time Software
Authors: Damian Dechev, Bjarne Stroustrup
Venue: Proceedings of the Third IEEE International Conference on Space Mission Challenges for Information Technology (2009)

The high degree of autonomy and increased complexity of future robotic spacecraft pose significant challenges in assuring their reliability and efficiency. To achieve fast and safe concurrent interactions in mission critical code, we survey the practical state-of-the-art nonblocking programming techniques. We study in detail two nonblocking approaches: (1) CAS-based algorithms and (2) Software Transactional Memory. We evaluate the strengths and weaknesses of each approach by applying each methodology for engineering the design and implementation of a nonblocking shared vector. Our study investigates how the application of nonblocking synchronization can help eliminate the problems of deadlock, livelock, and priority inversion and at the same time deliver a performance improvement in embedded real-time software.
C++ Programming for the Absolute Beginner, 2nd edition
Authors: Mark Lee
Venue:  (2009)

If you are new to programming with C++ and are looking for a solid introduction, this is the book for you. Developed by computer science instructors, books in the "For the Absolute Beginner" series teach the principles of programming through simple game creation. You will acquire the skills that you need for more practical C++ programming applications and will learn how these skills can be put to use in real-world scenarios. Throughout the chapters, you will find code samples that illustrate concepts presented. At the end of each chapter, you will find a complete game that demonstrates the key ideas in the chapter, a summary of the chapter, and a set of challenges that tests your newfound knowledge. By the time you finish this book, youll be well versed in C++ and be able to apply the basic programming principles youve learned to the next programming language you tackle. 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
Discovering multivariate motifs using subsequence density estimation and greedy mixture learning
Authors: David Minnen, Charles L. Isbell, Irfan Essa, Thad Starner
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

The problem of locating motifs in real-valued, multivariate time series data involves the discovery of sets of recurring patterns embedded in the time series. Each set is composed of several non-overlapping subsequences and constitutes a motif because all of the included subsequences are similar. The ability to automatically discover such motifs allows intelligent systems to form endogenously meaningful representations of their environment through unsupervised sensor analysis. In this paper, we formulate a unifying view of motif discovery as a problem of locating regions of high density in the space of all time series subsequences. Our approach is efficient (sub-quadratic in the length of the data), requires fewer user-specified parameters than previous methods, and naturally allows variable length motif occurrences and non-linear temporal warping. We evaluate the performance of our approach using four data sets from different domains including on-body inertial sensors and speech.
The Worst Of The It Skeptic: From The Notorious Blog
Authors: Rob England
Venue:  (2009)

The IT Skeptic is a commentator on IT's sillier moments, especially those related to ITSM in general and ITIL in particular. If you are reading this you have probably already seen the blog, the IT Skeptic, but in case you haven't, it is at www.itskeptic.org. It is a notorious blog. It has attracted unflattering descriptions of the IT Skeptic; strained (but I hope not broken) a few friendships; annoyed one or two people that I am happy to have annoyed; and killed the conversation at parties. This book is a collection of extracts from the blog, some of them direct quotes and others merged, revised and edited. We had to draw the line somewhere so we drew it at the end of 2008. A few other pieces come from the blog's newsletter The Skeptical Informer, articles by the author , and the author's other books Introduction to Real ITSM and Owning ITIL(r). 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
Secure Transaction Protocol for CEPS Compliant EPS in Limited Connectivity Environment
Authors: Satish Devane, Deepak Phatak
Venue: Proceedings of the 10th International Conference on E-Commerce and Web Technologies (2009)

Common Electronic Purse Specification (CEPS) used by European countries, elaborately defines the transaction between customer's CEP card and merchant's point of sales (POS) terminal. However it merely defines the specification to transfer the transactions between the Merchant and Merchant Acquirer (MA). This paper proposes a novel approach by introducing an entity, mobile merchant acquirer (MMA) which is a trusted agent of MA and principally works on man in middle concept, but facilitates remote two fold mutual authentication and secure transaction transfer between Merchant and MA through MMA. This approach removes the bottle-neck of connectivity issues between Merchant and MA in limited connectivity environment. The proposed protocol ensures the confidentiality, integrity and money atomicity of transaction batch. The proposed protocol has been verified for correctness by Spin, a model checker and security properties of the protocol have been verified by avispa.
Finite-State Methods and Natural Language Processing - Post-proceedings of the 7th International Workshop FSMNLP 2008 - Volume 191 Frontiers in Artificial Intelligence and Applications
Authors: J. Piskorski, B. Watson, A. Yli-Jyra
Venue:  (2009)

These proceedings contain the final versions of the papers presented at the 7th International Workshop on Finite-State Methods and Natural Language Processing (FSMNLP), held in Ispra, Italy, on September 1112, 2008. The aim of the FSMNLP workshops is to bring together members of the research and industrial community working on finite-state based models in language technology, computational linguistics, web mining, linguistics and cognitive science on one hand, and on related theory and methods in fields such as computer science and mathematics on the other. Thus, the workshop series is a forum for researchers and practitioners working on applications as well as theoretical and implementation aspects. The special theme of FSMNLP 2008 was high performance finite-state devices in large-scale natural language text processing systems and applications. The papers in this publication cover a range of interesting NLP applications, including machine learning and translation, logic, computational phonology, morphology and semantics, data mining, information extraction and disambiguation, as well as programming, optimization and compression of finite-state networks. The applied methods include weighted algorithms, kernels and tree automata. In addition, relevant aspects of software engineering, standardization and European funding programs are discussed.IOS Press is an international science, technical and medical publisher of high-quality books for academics, scientists, and professionals in all fields. Some of the areas we publish in: -Biomedicine -Oncology -Artificial intelligence -Databases and information systems -Maritime engineering -Nanotechnology -Geoengineering -All aspects of physics -E-governance -E-commerce -The knowledge economy -Urban studies -Arms control -Understanding and responding to terrorism -Medical informatics -Computer Sciences
Transactional pointcuts: designation reification and advice of interrelated join points
Authors: Hossein Sadat-Mohtasham, H. James Hoover
Venue: Proceedings of the eighth international conference on Generative programming and component engineering (2009)

Aspect-oriented mechanisms are characterized by their join point models. A join point model has three components: join points, which are elements of language semantics; "a means of identifying join points"; and "a means of affecting the behaviour at those join points." A pointcut-advice model is a dynamic join point model in which join points are points in program execution. Pointcuts select a set of join points, and advice affects the behaviour of the selected join points. In this model, join points are typically selected and advised independently of each other. That is, the relationships between join points are not taken into account in join point selection and advice. In practice, join points are often not independent. Instead, they form part of a higher-level operation that implements the intent of the developer (e.g. managing a resource). There are natural situations in which join points should be selected only if they play a specific role in that operation. We propose a new join point model that takes join point interrelationships into account and allows the designation of more complex computations as join points. Based on the new model, we have designed an aspect-oriented construct called a transactional pointcut (transcut). Transcuts select sets of interrelated join points and reify them into higher-level join points that can be advised. They share much of the machinery and intuition of pointcuts, and can be viewed as their natural extension. We have implemented a transcuts prototype as an extension to the AspectJ language and integrated it into the abc compiler. We present an example where a transcut is applied to implement recommended resource handling practices in the presence of exceptions within method boundaries.
Advances in Electrical Engineering and Computational Science, 1st edition
Authors: Sio-Iong Ao, Len Gelman
Venue:  (2009)

Advances in Electrical Engineering and Computational Science contains sixty-one revised and extended research articles written by prominent researchers participating in the conference. Topics covered include Control Engineering, Network Management, Wireless Networks, Biotechnology, Signal Processing, Computational Intelligence, Computational Statistics, Internet Computing, High Performance Computing, and industrial applications. Advances in Electrical Engineering and Computational Science will offer the state of art of tremendous advances in electrical engineering and computational science and also serve as an excellent reference work for researchers and graduate students working with/on electrical engineering and computational science.
The Impact of Query Length and Document Length on Book Search Effectiveness
Authors: Mingfang Wu, Falk Scholer, James A. Thom
Venue: Advances in Focused Retrieval: 7th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2008, Dagstuhl Castle, Germany, December 15-18, 2008. Revised and Selected Papers (2009)

This paper describes the RMIT group's participation in the book retrieval task of the INEX booktrack in 2008. Our results suggest that for book retrieval task, using a page-based index and ranking books based on the number of pages retrieved may be more effective than directly indexing and ranking whole books.
Polynomial Interpolation of the k-th Root of the Discrete Logarithm
Authors: Gerasimos C. Meletiou
Venue: Proceedings of the 3rd International Conference on Algebraic Informatics (2009)

In the present study the problem of efficient computation of the k-th root of the Discrete Logarithm is investigated. Lower bounds on the degree of interpolation polynomials of the root of the Discrete Logarithm for subsets of given data are obtained. These results support the assumption of hardness of the k-th root of the discrete logarithm. 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
Turning Point Clouds into 3d Models: The Aqueduct of Segovia
Authors: Juan Mancera-Taboada, Pablo Rodríguez-Gonzálvez, Diego González-Aguilera
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

This article presents digital three-dimensional models that reproduce the original structure of the aqueduct of Segovia (Spain) using laserscanning approaches, as well as orthophotos, which thoroughly document dimensional and textural characteristics of this emblematic monument, declared UNESCO World Heritage Site. In addition to analyzing the accuracy and validity of laserscanning technique in the conservation and preservation of Cultural Heritage, a methodology of data capture, processing and photogrammetry representation is analysed.
Permutation Tests for Stochastic Ordering and ANOVA: Theory and Applications with R, 1st edition
Authors: Dario Basso, Fortunato Pesarin, Luigi Salmaso, Aldo Solari
Venue:  (2009)

Permutation testing for multivariate stochastic ordering and ANOVA designs is a fundamental issue in many scientific fields such as medicine, biology, pharmaceutical studies, engineering, economics, psychology, and social sciences. This book presents new advanced methods and related R codes to perform complex multivariate analyses. The prerequisites are a standard course in statistics and some background in multivariate analysis and R software.
Building test suites for UIMA components
Authors: Philip V. Ogren, Steven J. Bethard
Venue: Proceedings of the Workshop on Software Engineering, Testing, and Quality Assurance for Natural Language Processing (2009)

We summarize our experiences building a comprehensive suite of tests for a statistical natural language processing toolkit, ClearTK. We describe some of the challenges we encountered, introduce a software project that emerged from these efforts, summarize our resulting test suite, and discuss some of the lessons learned.
Using Heart Rate Monitors to Detect Mental Stress
Authors: Jongyoon Choi, Ricardo Gutierrez-Osuna
Venue: Proceedings of the 2009 Sixth International Workshop on Wearable and Implantable Body Sensor Networks (2009)

This article describes an approach to detecting mental stress using unobtrusive wearable sensors. The approach relies on estimating the state of the autonomic nervous system from an analysis of heart rate variability. Namely, we use a non-linear system identification technique known as principal dynamic modes (PDM) to predict the activation level of the two autonomic branches: sympathetic (i.e. stress-inducing) and parasympathetic (i.e. relaxation-related). We validate the method on a discrimination problem with two psychophysiological conditions, one associated with mental tasks and one induced by relaxation exercises. Our results indicate that PDM features are more stable and less subject-dependent than spectral features, though the latter provide higher classification performance within subjects. When PDM and spectral features are combined, our system discriminates stressful events with a success rate of 83% within subjects (69% between subjects).
Set Intersection and Sequence Matching
Authors: Ariel Shiftan, Ely Porat
Venue: Proceedings of the 16th International Symposium on String Processing and Information Retrieval (2009)

In the classical pattern matching problem, one is given a text and a pattern, both of which are sequences of letters, and is required to find all occurrences of the pattern in the text. We study two modifications of the classical problem, where each letter in the text and pattern is a set (Set Intersection Matching problem) or a sequence (Sequence Matching problem). Two "letters" are considered to be match if the intersection of the two corresponding sets is not empty, or if the two sequences have a common element in the same index. We show the first known non-trivial and efficient algorithms for these problems, for the case the maximum set/sequence size is small. The first, randomized, that takes $\Theta\left( 2^dn\ln n\log m\right)$ time, where d is the maximum set/sequence size, and can also fit, with slight modifications, for the case one is also interested in up to k mismatches. The second is deterministic and takes $\Theta\left( 4^{d}n\log m\right)$. The third algorithm, also deterministic, is able to count the number of matches at each index of the text in total running time $\Theta\left( \sum_{i=1}^{d} {|\Sigma| \choose i} n\log m \right)$.
NESTA: NASA engineering shuttle telemetry agent
Authors: Glenn S. Semmel, Steven R. Davis, Kurt W. Leucht, Dan A. Rowe, Kevin E. Smith, Ladislau Bölöni
Venue: Proceedings of the 17th conference on Innovative applications of artificial intelligence - Volume 3 (2005)

The Spaceport Processing Systems Branch at NASA Kennedy Space Center has developed and deployed an agent based tool to monitor the Space Shuttle's ground processing telemetry stream. The application. the NASA Engineering Shuttle Telemetry Agent, increases situational awareness tor system and hardware engineers during ground processing of the Shuttle's subsystems. The agent provides autonomous monitoring of the telemetry stream and automatically alerts system engineers when predefined criteria have been met. Efficiency and safety are improved through increased automation. Sandia National Labs' Java Expert System Shell is employed as the rule engine. The shell's predicate logic lends itself well to capturing the heuristics and specifying the engineering rules of this spaceport domain. The declarative paradigm of the rule-based agent yields a highly modular and scalable design spanning multiple subsystems of the Shuttle. Several hundred monitoring rules have been written thus far with corresponding notifications sent to Shuttle engineers. This paper discusses the rule-based telemetry agent used for Space Shuttle ground processing and explains the problem domam, development of the agent software, benefits of AI technology, and deployment and sustaining engineering of the product.
Accelerating fuzzy clustering
Authors: Christian Borgelt
Venue: Information Sciences: an International Journal (2009)

This paper extends earlier work [C. Borgelt, R. Kruse, Speeding up fuzzy clustering with neural network techniques, in: Proceedings of the 12th IEEE International Conference on Fuzzy Systems (FUZZ-IEEE'03, St. Louis, MO, USA), IEEE Press, Piscataway, NJ, USA, 2003] on an approach to accelerate fuzzy clustering by transferring methods that were originally developed to speed up the training process of (artificial) neural networks. The core idea is to consider the difference between two consecutive steps of the alternating optimization scheme of fuzzy clustering as providing a gradient. This ''gradient'' may then be modified in the same way as a gradient is modified in error backpropagation in order to enhance the training. Even though these modifications are, in principle, directly applicable, carefully checking and bounding the update steps can improve the performance and can make the procedure more robust. In addition, this paper provides a new and much more detailed experimental evaluation that is based on fuzzy cluster comparison measures [C. Borgelt, Resampling for fuzzy clustering, Int. J. Uncertainty, Fuzziness Knowledge-based Syst. 15 (5) (2007), 595-614], which can be used nicely to study the convergence speed.
Improved Genetic Algorithm with Infeasible Solution Disposing of Distribution Network Reconfiguration
Authors: Jianming Yu, Fan Zhang, Feng Ni, Yuanshe Ma
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

An improved genetic algorithm with infeasible solution disposing of distribution network reconfiguration is proposed in this paper. Decimal encoding is improved and size of chromosome equals to the count of tie switches. Not only the discrimination of infeasible solution but also its corrective disposition under complex loops is given. In the evolution course, the ratio of feasible solution is 1, the valuable information that reflects the evolution is preserved mostly, and the problem of low efficiency and local optimum is avoided. Make the crossover and mutual operator adjusted adaptively and nonlinearly, enhances the convergence rate. The reconfiguration results of 69 bus system shows the feasibility and validity of the proposed method.
Development, Control, and Evaluation of an Actuated Car Door
Authors: Michael Strolz, Alexander Mortl, Michael Graf, Martin Buss
Venue: IEEE Transactions on Haptics (2009)

Actuated car doors are a promising way to increase the convenience of access to cars. We propose an advanced actuation and control concept which can easily be integrated into conventional car doors. By utilizing a linear, nonbackdrivable actuator and various sensors, both automatic and manual door operations are enabled. A discrete state controller ensures a safe operation of the door, including automatic opening and closing. The realization of a supportive, high-quality haptic interaction with the car door for the manual operation is the principal part of our work. Due to the impracticality of a direct measurement of the user interaction force at a car door, we chose impedance control to render the desired dynamics. The impedance was designed to provide a convenient, intuitive, and safe manual handling of the door. We implemented and tested four different impedance control schemes, of which impedance control with actuator force feedback performed best. Two experimental evaluations with 16 and 27 participants revealed a predominant approval of the actuated car door.