ppxscal/embedding_network huggingface dataset:
Challenges for semi-automatic trace recovery in the automotive domain
Authors: Jorg Leuser
Venue: Proceedings of the 2009 ICSE Workshop on Traceability in Emerging Forms of Software Engineering (2009)

This position paper describes the challenges of semi-automatically recovering traceability information in specifications of the automotive domain using information retrieval techniques. Recovering traceability information itself is not an easy task and a combination of factors make this task even harder in the automotive domain. For example: There are huge specifications compared to specifications evaluated in research. The specifications are written in German instead of the English generally reported, which makes it even more complicated. Improving the applied algorithms is one way of tackling these obstacles, better guidance on how and when to employ the semi-automatic recovery methods also play an important role. An approach to tackle these obstacles as well as preliminary findings are described.
Public information strategies: Making government information available to citizens
Authors: Albert Meijer, Marcel Thaens
Venue: Information Polity (2009)

New technological opportunities and increasing demands make it imperative for government agencies to make the information they gather available to citizens. How should they go about this? This paper presents a conceptual framework for analyzing the strategic options open to agencies which have information that could be relevant to citizens. The conceptual framework is constructed on the basis of the literature and tested in a case study. The Directorate-General for Public Works and Water Management in the Netherlands gathers traffic information which is useful for citizens when they want to avoid traffic jams. Presently, the agency sells information to intermediaries. The agency wanted to release the information through its own website but this was prohibited by a court ruling. This paper reviews other strategies and proposes that an 'Intel inside' strategy may be a viable option in view of the consequences for effectiveness, manageability, cost-effectiveness, equity and legitimacy. The paper concludes that the conceptual framework proves useful for analyzing the strategic options open to agencies for making government information available to citizens.
Limit knowledge of rationality
Authors: Christian W. Bach, Jérémie Cabessa
Venue: Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (2009)

Epistemic game theory scrutinizes the relationship between knowledge, belief and choice of rational players. Here, the relationship between common knowledge and the limit of higher-order mutual knowledge is studied from a topological point of view. More precisely, the new epistemic operator limit knowledge defined as the topological limit of higher-order mutual knowledge is introduced. We then show that limit knowledge of the specific event rationality can be used for epistemic-topological characterizations of solution concepts in games. As a first step towards this scheme, we construct a game where limit knowledge of rationality appears to be a cogent strict refinement of common knowledge of rationality in terms of solution concepts. More generally, it is shown that for any given game and epistemic model of it satisfying some specific condition, every possible epistemic hypothesis as well as as every solution concept can be characterized by limit knowledge of rationality for some appropriate topology.
Personalized and On-Demand Retrieval of Parliamentary Proceedings with Social Feedback on Elected Representatives
Authors: Elena Sánchez-Nielsen, Francisco Chávez-Gutiérrez
Venue: Proceeding of the 2008 conference on Legal Knowledge and Information Systems: JURIX 2008: The Twenty-First Annual Conference (2008)

In order to be part of a modern society, Parliaments must open up to the public in the process of making new laws. The approach presented in this paper is conceptualized as a social system where information and communication technologies can change: (i) the way people interact with their elected representatives in Parliaments, (ii) the way people access to parliamentary proceedings and (iii) the way people subscribe to new parliamentary contents. In this paper, we explore the use of multimedia content delivery technologies, semantic technologies, personalized retrieval of multimedia contents and social feedback in order to present a smart information system for parliamentary proceedings. Currently, this approach is being developed for plenary sessions of the Parliament of the Canary Islands.
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
Authors: Ke Yi
Venue: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2009)

The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answered in O(logB NoverM + KoverB) I/Os, where B is the disk block size, K the output size, and M the size of the main memory buffer. When keys are inserted or deleted, the B-tree is updated in O(logB N) I/Os, if we require the resulting changes to be committed to disk right away. Otherwise, the memory buffer can be used to buffer the recent updates, and changes can be written to disk in batches, which significantly lowers the amortized update cost. A systematic way of batching up updates is to use the logarithmic method, combined with fractional cascading, resulting in a dynamic B-tree that supports insertions in O(1overB log NoverM) I/Os and queries in O(log NoverM + KoverB) I/Os. Such bounds have also been matched by several known dynamic B-tree variants in the database literature. Note that, however, the query cost of these dynamic B-trees is substantially worse than the O(logB NoverM + KoverB) bound of the static B-tree by a factor of ?(log B). In this paper, we prove that for any dynamic one dimensional range query index structure with query cost O(q + KoverB) and amortized insertion cost O(u/B), the tradeoff q · log(u/q) = ©(log B) must hold if q = O(log B). For most reasonable values of the parameters, we have NoverM = BO(1), in which case our query-insertion tradeoff implies that the bounds mentioned above are already optimal. We also prove a lower bound of u · log q = ©(log B), which is relevant for larger values of q. Our lower bounds hold in a dynamic version of the indexability model, which is of independent interests. Dynamic indexability is a clean yet powerful model for studying dynamic indexing problems, and can potentially lead to more interesting complexity results.
Global optimization of non-linear systems of equations by simulating the flight of a projectile in the conformational space
Authors: Nicholas Harkiolakis
Venue: Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems (2008)

A new heuristic optimization algorithm is presented based on an analogy with the physical phenomenon of a projectile launched in a conformational space under the influence of a gravitational force. Its implementation simplicity and the option to enhance it with local search methods make it ideal for the optimization of non-linear systems of equations. The algorithm is applied to standard test cases where it successfully recovered known optima and discovered new ones. Suggestions for future development are made since the algorithm proved to be successful enough to warrant further investigation.
A Novel Classification Algorithm Based on Association Rules Mining
Authors: Bay Vo, Bac Le
Venue: Knowledge Acquisition: Approaches, Algorithms and Applications: Pacific Rim Knowledge Acquisition Workshop, PKAW 2008, Hanoi, Vietnam, December 15-16, 2008, Revised Selected Papers (2009)

The traditional methods for mining classification rules such as heuristics or greedy methods only generate the rules that are too general or overfitting to do with the given database. Thus, they introduce high error ratio. Recently, a new method of mining classification rules is proposed: classification rules mining based on association rules (CARs). It is more advantageous than the traditional methods in that it removes noise and therefore the accuracy is higher. In this paper, we propose ECR-CARM algorithm. It is based on ECR-tree to find all CARs. Besides that, it is necessary for redundant rules pruning and rules reducing to gain the smaller rules set (i.e., reducing the time of identifying the class of new cases and increasing the accuracy). We also develop property to fast prune rules.
Practical Hardware Implementation of Self-configuring Neural Networks
Authors: Josep L. Rosselló, Vincent Canals, Antoni Morro, Ivan Paúl
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

This work provides practical guidelines for an efficient hardware implementation of Neural Networks. Networks are configured using a practical self-learning architecture that iterates a basic Genetic Algorithm. The learning methodology is based on the generation of random vectors that can be extracted from chaotic signals. The proposed solution is applied to estimate the processing efficiency of Spiking Neural Networks.
A Unified Model for Multilabel Classification and Ranking
Authors: Klaus Brinker, Johannes Fürnkranz, Eyke Hüllermeier
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

Label ranking studies the problem of learning a mapping from instances to rankings over a predefined set of labels. Hitherto existing approaches to label ranking implicitly operate on an underlying (utility) scale which is not calibrated in the sense that it lacks a natural zero point. We propose a suitable extension of label ranking that incorporates the calibrated scenario and substantially extends the expressive power of these approaches. In particular, our extension suggests a conceptually novel technique for extending the common learning by pairwise comparison approach to the multilabel scenario, a setting previously not being amenable to the pairwise decomposition technique. We present empirical results in the area of text categorization and gene analysis, underscoring the merits of the calibrated model in comparison to state-of-the-art multilabel learning methods.
Data-driven haptic modeling using polynomial hypersurfaces
Authors: Paul A. Theodosis, Mark B. Colton
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

In this paper we present a method for generating accurate haptic force models to describe the feel of physical devices. The models are generated by fitting polynomial hypersurfaces to experimentally measured motion and force data obtained by actuating physical devices. The methods are demonstrated by modeling the complex force-deflection profile of a nonlinear mass-spring-damper system. Initial results indicate that polynomial hypersurfaces have the potential to accurately describe the dynamics of nonlinear devices.
Heterogeneous source consensus learning via decision propagation and negotiation
Authors: Jing Gao, Wei Fan, Yizhou Sun, Jiawei Han
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Nowadays, enormous amounts of data are continuously generated not only in massive scale, but also from different, sometimes conflicting, views. Therefore, it is important to consolidate different concepts for intelligent decision making. For example, to predict the research areas of some people, the best results are usually achieved by combining and consolidating predictions obtained from the publication network, co-authorship network and the textual content of their publications. Multiple supervised and unsupervised hypotheses can be drawn from these information sources, and negotiating their differences and consolidating decisions usually yields a much more accurate model due to the diversity and heterogeneity of these models. In this paper, we address the problem of "consensus learning" among competing hypotheses, which either rely on outside knowledge (supervised learning) or internal structure (unsupervised clustering). We argue that consensus learning is an NP-hard problem and thus propose to solve it by an efficient heuristic method. We construct a belief graph to first propagate predictions from supervised models to the unsupervised, and then negotiate and reach consensus among them. Their final decision is further consolidated by calculating each model's weight based on its degree of consistency with other models. Experiments are conducted on 20 Newsgroups data, Cora research papers, DBLP author-conference network, and Yahoo! Movies datasets, and the results show that the proposed method improves the classification accuracy and the clustering quality measure (NMI) over the best base model by up to 10%. Furthermore, it runs in time proportional to the number of instances, which is very efficient for large scale data sets.
RF Circuit Design, Second Edition, 2nd edition
Authors: Christopher Bowick, Cheryl Ajluni, John Blyler
Venue:  (2007)

It's Back! New chapters, examples, and insights; all infused with the timeless concepts and theories that have helped RF engineers for the past 25 years!RF circuit design is now more important than ever as we find ourselves in an increasingly wireless world. Radio is the backbone of today's wireless industry with protocols such as Bluetooth, Wi-Fi, WiMax, and ZigBee. Most, if not all, mobile devices have an RF component and this book tells the reader how to design and integrate that component in a very practical fashion. This book has been updated to include today's integrated circuit (IC) and system-level design issues as well as keeping its classic "wire lead" material. Design Concepts and Tools Include.The Basics: Wires, Resistors, Capacitors, Inductors.Resonant Circuits: Resonance, Insertion Loss .Filter Design: High-pass, Bandpass, Band-rejection.Impedance Matching: The L Network, Smith Charts, Software Design Tools.Transistors: Materials, Y Parameters, S Parameters.Small Signal RF Amplifier: Transistor Biasing, Y Parameters, S Parameters.RF Power Amplifiers: Automatic Shutdown Circuitry , Broadband Transformers, Practical Winding Hints.RF Front-End: Architectures, Software-Defined Radios, ADC's Effects.RF Design Tools: Languages, Flow, ModelingCheck out this book's companion Web site at: http://books.elsevier.com/9780750685184 for full-color Smith Charts and extra content! *Completely updated but still contains its classic timeless information*Two NEW chapters on RF Front-End Design and RF Design Tools*Not overly math intensive, perfect for the working RF and digital professional that need to build analog-RF-Wireless circuits
Evaluation of the SUN UltraSparc T2+ Processor for Computational Science
Authors: Martin Sandrieser, Sabri Pllana, Siegfried Benkner
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

The Sun UltraSparc T2+ processor was designed for throughput computing and thread level parallelism. In this paper we evaluate its suitability for computational science. A set of benchmarks representing typical building blocks of scientific applications and a real-world hybrid MPI/OpenMP code for ocean simulation are used for performance evaluation. Additionally we apply micro benchmarks to evaluate the performance of certain components (such as the memory subsystem). To recognise the capabilities of the T2+ processor we compare its performance with the IBM POWER6 processor. While the UltraSparc T2+ is targeted on server workloads with high throughput requirements via low-frequency core design and massive chip multithreading capabilities, the ultra-high frequency core design of the IBM POWER6 optimised for instruction-level parallelism follows a contrary approach. The intention of this evaluation is to investigate whether the current generation of massive chip multithreading processors is capable of providing competitive performance for non-server workloads in scientific applications.
Implementation of a smart antenna base station for mobile WiMAX based on OFDMA
Authors: Seungheon Hyeon, Changhoon Lee, Chang-eui Shin, Seungwon Choi
Venue: EURASIP Journal on Wireless Communications and Networking (2009)

We present an implementation of a mobile-WiMAX (m-WiMAX) base station (BS) that supports smart antenna (SA) functionality. To implement the m-WiMAX SA BS, we must address a number of key issues in baseband signal processing related to symbol-timing acquisition, the beamforming scheme, and accurate calibration. We propose appropriate solutions and implement an m-WiMAX SA BS accordingly. Experimental tests were performed to verify the validity of the solutions. Results showed a 3.5-time (5.5 dB) link-budget enhancement on the uplink compared to a single antenna system. In addition, the experimental results were consistent with the results of the computer simulation.
Scalable service migration in general topologies
Authors: Konstantinos Oikonomou, Ioannis Stavrakakis, Alexios Xydias
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

Service placement has typically been studied through the formulation and solution of a 1-median problem that is known to be complex and require global information. As such approaches are clearly not scalable in dynamic and large-scale environments, a more reasonable approach to service placement for large, ad hoc and autonomic environments would be through service migration. Such a migration policy has recently been proposed for tree topologies. The focus of the present paper is to devise effective service migration policies for general topologies with equal weight links. The proposed strategy - that incorporates a 2-phase polling mechanism of local scope and, consequently, induces in general a certain overhead - is shown to out-perform the previous one (i.e., getting closer to the optimal placement) for such general topologies. Finally, a hybrid migration policy (combining the present and the past ones) is considered and shown through simulations to be capable of reducing significantly the overhead effects of the afore-mentioned polling mechanism.
On Prolonging Sensornode Gateway Lifetime by Adapting Its Duty Cycle
Authors: Marcin Brzozowski, Peter Langendoerfer
Venue: Proceedings of the 7th International Conference on Wired/Wireless Internet Communications (2009)

In this paper we discuss the lifetime of an battery powered device which acts as a gateway between a wireless sensor network and a standard network. The wireless communication standards used are IEEE802.15.4 and IEEE802.11g. The two parameters which are of utmost importance but also contradicting each other are communication delay and lifetime of the gateway node. Our results clearly show that duty cycling i.e. switching off the gateway node improves its lifetime. Depending on the radio modules used the lifetime can be increased from seven hours up to 3 months using only 3 AA batteries. Our results also proove that prolonging the sleep intervals beyond a certain limit (about 10 seconds for a typical WLAN PC card) does not longer improve the lifetime but only worsens the delay.
Generalized inquisitive logic: completeness via intuitionistic Kripke models
Authors: Ivano Ciardelli, Floris Roelofsen
Venue: Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (2009)

This paper investigates a generalized version of inquisitive semantics (Groenendijk, 2008b; Mascarenhas, 2008). A complete axiomatization of the associated logic is established. The connection with intuitionistic logic is clarified and heavily exploited.
Setswana tokenisation and computational verb morphology: facing the challenge of a disjunctive orthography
Authors: Rigardt Pretorius, Ansu Berg, Laurette Pretorius, Biffie Viljoen
Venue: Proceedings of the First Workshop on Language Technologies for African Languages (2009)

Setswana, a Bantu language in the Sotho group, is one of the eleven official languages of South Africa. The language is characterised by a disjunctive orthography, mainly affecting the important word category of verbs. In particular, verbal prefixal morphemes are usually written disjunctively, while suffixal morphemes follow a conjunctive writing style. Therefore, Setswana tokenisation cannot be based solely on whitespace, as is the case in many alphabetic, segmented languages, including the conjunctively written Nguni group of South African Bantu languages. This paper shows how a combination of two tokeniser transducers and a finite-state (rule-based) morphological analyser may be combined to effectively solve the Setswana tokenisation problem. The approach has the important advantage of bringing the processing of Setswana beyond the morphological analysis level in line with what is appropriate for the Nguni languages. This means that the challenge of the disjunctive orthography is met at the tokenisation/morphological analysis level and does not in principle propagate to subsequent levels of analysis such as POS tagging and shallow parsing, etc. Indeed, the approach ensures that an aspect such as orthography does not obfuscate sound linguistics and, ultimately, proper semantic analysis, which remains the ultimate aim of linguistic analysis and therefore also computational linguistic analysis.
A survey of dynamic scheduling in manufacturing systems
Authors: Djamila Ouelhadj, Sanja Petrovic
Venue: Journal of Scheduling (2009)

In most real-world environments, scheduling is an ongoing reactive process where the presence of a variety of unexpected disruptions is usually inevitable, and continually forces reconsideration and revision of pre-established schedules. Many of the approaches developed to solve the problem of static scheduling are often impractical in real-world environments, and the near-optimal schedules with respect to the estimated data may become obsolete when they are released to the shop floor. This paper outlines the limitations of the static approaches to scheduling in the presence of real-time information and presents a number of issues that have come up in recent years on dynamic scheduling.The paper defines the problem of dynamic scheduling and provides a review of the state-of-the-art of currently developing research on dynamic scheduling. The principles of several dynamic scheduling techniques, namely, heuristics, meta-heuristics, multi-agent systems, and other artificial intelligence techniques are described in detail, followed by a discussion and comparison of their potential.
Collaborative digital library: enhancing digital collections to improve learning in educational programs
Authors: Ali Sajedi Badashian, Asghar Dehghani Firouzabadi, Iman Khalkhali, Hamidreza Afzali, Morteza Ashurzad Delcheh, Mohammad Shoja Shafiei, Mahdi Alipour
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

In this article, a universal collaborative and competitive approach is introduced for deployment of digital collections in an ideal Digital Library (DL) for future's educational system. The collaborative and open-source aspects of the system guarantee its growth and the competitive aspects guarantee the accuracy.