ppxscal/embedding_network huggingface dataset:
Data Structures with Local Update Operations
Authors: Yakov Nekrich
Venue: Proceedings of the 11th Scandinavian workshop on Algorithm Theory (2008)

In this paper we describe dynamic data structures with restrictions on update operations. In the first part of the paper we consider data structures that support operations insert Δ (x,y) or insert Δ (x) instead of general insertions, where insert Δ (x,y) (insert Δ (x)) inserts a new element x, such that |x ¿ y| ≤ Δ for some element y already stored in the data structure. We present a data structure that supports predecessor queries in a universe of size U in O(loglogU) time, uses O(n) words of space, and supports operations insert Δ (x,y), and in O(1) amortized time, where $\Delta=2^{2^{O(\sqrt{\log \log U})}}$. We present the dictionary data structure that supports membership queries in O(loglogn) time and insert Δ (x,y) and delete (x) in O(1) amortized time, where $\Delta=2^{2^{O(\sqrt{\log \log n})}}$ We also present a priority queue that supports , and in O(1) time and in O(loglogn) time, where Δ = log O(1) U. All above data structures also support incrementation and decrementation of element values by the corresponding parameter Δ.In the second part of this paper, we consider the data structure for dominance emptiness queries in the case when an update changes the relative order of two points or increments/decrements coordinates of a point by a small parameter. We show that in this case dominance emptiness queries can be answered faster than the lower bound for the fully dynamic data structure.
Location-Aware Signaling Protocol for WWAN and WLAN Interworking
Authors: Sunghoon Seo, Sukyoung Lee, Jooseok Song
Venue: Proceedings of the 5th international conference on Wired/Wireless Internet Communications (2007)

With the rapid improvement of wireless networking technologies, current mobile devices can be potentially equipped with multiple interfaces to access different kinds of wireless networks. Thus, there have been many efforts to provide a seamless roaming between heterogeneous networks. However, most previous studies do not address how to select the best possible interface in terms of energy consumption. Therefore, in this paper, we propose to take advantage of accurate location positioning via WWAN interface, so that Mobile Nodes (MNs) obtain the information of hotspot range and completely turn off WLAN interface during idle state, leading to save energy consumption. Simulation results show that our mechanism outperforms existing approaches in terms of energy consumption and signaling overhead.
Calculating with Automata
Authors: Jos C. Baeten
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

Some elements are presented of a forthcoming textbook on automata theory and formal languages, that puts more emphasis on equational reasoning. Some advantages of such an approach are discussed. This paper is dedicated to Ugo Montanari, who has contributed such a lot to concurrency theory and the theory of computational models.
Anonymity and k-Choice Identities
Authors: Jacek Cichoń, Mirosław Kutyłowski
Venue: Information Security and Cryptology: Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers (2007)

We consider pervasive systems and identifiers for objects in these systems. Using unique global identifiers for these objects increases the size of the ID's and requires some global coordination. However, severe privacy threats are the key issues here.On the other hand, for performing the goals of a pervasive system the identifiers are normally used in small local environments, and we need uniqueness limited to these environments only. This yields an opportunity to re-use the ID's and in this way anonymize the objects. The problem is that we cannot predict assignment of the objects to local environment or set it in advance, while on the other hand in many application scenarios we cannot change an ID already assigned to an object. Random predistribution of ID's is a technique that partially solves this problem, but has drawbacks due to the birthday paradox.We propose a solution in which each object holds k preinstalled ID's (where k is a small parameter like k = 2,3,...). While entering a local environment, one of its ID's not used so far in this local environment is chosen for the object. We analyze probability of a conflict, i.e. of the event that no identity can be chosen for this object. We show that the size of ID's may be significantly reduced compared to random predistribution without increasing conflict probability. Apart from implementation advantages it contributes to privacy protection: since globally a large number of objects holds the same ID, privacy threats are reduced.
Hierarchical Bayesian Inference of Brain Activity
Authors: Masa-Aki Sato, Taku Yoshioka
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

Magnetoencephalography (MEG) can measure brain activity with millisecond-order temporal resolution, but its spatial resolution is poor, due to the ill-posed nature of the inverse problem, for estimating source currents from the electromagnetic measurement. Therefore, prior information on the source currents is essential to solve the inverse problem.We have proposed a new hierarchical Bayesian method to combine several sources of information. In our method, the variance of the source current at each source location is considered an unknown parameter and estimated from the observed MEG data and prior information by using variational Bayes method. The fMRI information can be imposed as prior distribution rather than the variance itself so that it gives a soft constraint on the variance.It is shown that the hierarchical Bayesian method has better accuracy and spatial resolution than conventional linear inverse methods by evaluating the resolution curve. The proposed method also demonstrated good spatial and temporal resolution for estimating current activity in early visual area evoked by a stimulus in a quadrant of the visual field.
Turning a Page and Learning Something Useful
Authors: Norman Chonacky
Venue: Computing in Science and Engineering (2008)

Editor-in-chief Norman Chonacky ponders the year ahead for CiSE magazine and describes how far we've come in the past 12 months. Editorial board member Jack Dongarra also supplies a short tribute to Gene Golub about the recently deceased pioneer's contributions to the CS field.
A New Approach for the Construction of Multiway Decision Graphs
Authors: Y. Mokhtari, Sa'Ed Abed, O. Ait Mohamed, S. Tahar, X. Song
Venue: Proceedings of the 5th international colloquium on Theoretical Aspects of Computing (2008)

Multiway Decision Graphs (MDGs) are a canonical representation of a subset of many-sorted first-order logic. It generalizes classical BDDs with abstract data and uninterpreted functions. In this paper, we describe a new MDG construction based on the Generalized-If-Then-Else (GITE) operator. Consequently, we review the main algorithms used for verification techniques i.e. relational product and pruning by subsumption. Unlike an earlier version of the MDG package, basic MDG algorithms are defined uniformly through this single GITE operator which will lead to a more efficient implementation. The new tool, called NuMDG, accepts an extended SMV language, supporting abstract data sorts.
Research on Spatial Clustering Acetabuliform Model and Algorithm Based on Mathematical Morphology
Authors: Lichao Chen, Lihu Pan, Yingjun Zhang
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

In this paper, a new spatial data analysis model is brought forward for the aid of analyzing to spatial terrain, which uses mathematical morphology method to carry through the research of 3-D spatial clustering analysis. The model algorithm is designed and implemented in this paper. Simulation results show that the model really solves the 3-D spatial clustering problems with high efficiency and practical features.
Learning to Trade with Incremental Support Vector Regression Experts
Authors: Giovanni Montana, Francesco Parrella
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

Support vector regression (SVR) is an established non-linear regression technique that has been applied successfully to a variety of predictive problems arising in computational finance, such as forecasting asset returns and volatilities. In real-time applications with streaming data two major issues that need particular care are the inefficiency of batch-mode learning, and the arduous task of training the learning machine in presence of non-stationary behavior. We tackle these issues in the context of algorithmic trading, where sequential decisions need to be made quickly as new data points arrive, and where the data generating process may change continuously with time. We propose a master algorithm that evolves a pool of on-line SVR experts and learns to trade by dynamically weighting the experts' opinions. We report on risk-adjusted returns generated by the hybrid algorithm for two large exchange-traded funds, the iShare S P 500 and Dow Jones EuroStoxx 50.
Improved Randomized Results for That Interval Selection Problem
Authors: Leah Epstein, Asaf Levin
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with it. The goal is to select a non-overlapping set of intervals with maximal total weight and run them to completion. The decision regarding a possible selection of an arriving interval must be done immediately upon its arrival. The interval may be preempted later in favor of selecting an arriving overlapping interval, in which case the weight of the preempted interval is lost. We follow Woeginger [10] and study the same models. The type of instances we consider are C-benevolent instances, where the weight of an interval in a monotonically increasing (convex) function of the length, and D-benevolent instances, where the weight of an interval in a monotonically decreasing function of the length. Some of our results can be extended to the case of unit length intervals with arbitrary costs. We significantly improve the previously known bounds on the performance of online randomized algorithms for the problem, namely, we introduce a new algorithm for the D-benevolent case and for unit intervals, which uses a parameter ¿ and has competitive ratio of at most $\frac{\theta^2\ln\theta}{(\theta-1)^2}$. This value is equal to approximately 2.4554 for ¿ ≈ 3.513 being the solution of the equation x ¿ 1 = 2ln x. We further design a lower bound of 1 + ln 2 ≈ 1.693 on the competitive ratio of any randomized algorithm. The lower bound is valid for any C-benevolent instance, some D-benevolent functions and for unit intervals. We further show a lower bound of $\frac 32$ for a wider class of D-benevolent instances. This improves over previously known lower bounds. We also design a barely random online algorithm for the D-benevolent case and the case of unit intervals, which uses a single random bit, and has a competitive ratio of 3.22745.
View-Based Reverse Engineering Approach for Enhancing Model Interoperability and Reusability in Process-Driven SOAs
Authors: Huy Tran, Uwe Zdun, Schahram Dustdar
Venue: Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems (2008)

In many companies, process-driven SOAs are introduced using technical process languages, such as BPEL, to orchestrate services. The process models developed using this approach are often too complex and hard to reuse because all process-related concerns are tangled in only one type of model. To make the models more understandable for non-technical stakeholders, many companies additionally introduce high-level process descriptions, e.g., specified in BPMN or EPCs, to offer a non-technical view of the processes. This divergence of process languages often leads to inconsistencies after a few evolution steps. We propose a novel approach based on architectural views that not only offers models tailored to the various stakeholders' concerns but also provides an automated integration of models at different abstraction levels. In particular, we propose an extensible reverse-engineering tool-chain to automatically populate various view models with information from existing process descriptions and generate executable code from these view models.
A distributed speaker authentication system
Authors: Adriano Petry, Sidcley Da S. Soares, Gilberto F. Marchioro, Analúcia S. M. De Franceschi
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

This work describes a prototype for user authentication in computer networks using speech. Initially, it is given a general overview of the proposed system, focusing in its client/server model. After this, the main characteristics of the system building blocks are shown, focusing on the techniques for speaker recognition, database, client/server communication and management, and user interface application. At last, the results obtained with user interaction are discussed and future works are addressed.
Passive classification of wireless NICs during active scanning
Authors: Cherita L. Corbett, Raheem A. Beyah, John A. Copeland
Venue: International Journal of Information Security (2008)

Computer networks have become increasingly ubiquitous. However, with the increase in networked applications, there has also been an increase in difficulty to manage and secure these networks. The proliferation of 802.11 wireless networks has heightened this problem by extending networks beyond physical boundaries. We present a statistical analysis and propose the use of spectral analysis to identify the type of wireless network interface card (NIC). This mechanism can be applied to support the detection of unauthorized systems that use NICs that are different from that of a legitimate system. We focus on active scanning, a vaguely specified mechanism required by the 802.11 standard that is implemented in the hardware and software of the wireless NIC. We show that the implementation of this function influences the transmission patterns of a wireless stream that are observable through traffic analysis. Our mechanism for NIC identification uses signal processing to analyze the periodicity embedded in the wireless traffic caused by active scanning. A stable spectral profile is created from the periodic components of the traffic and used for the identity of the wireless NIC. We show that we can distinguish between NICs manufactured by different vendors, with zero false positives, using the spectral profile. Finally, we infer where, in the NIC, the active scanning algorithm is implemented.
A Signal Processing Implementation for an IBM-PC-based Workstation
Authors: Neal Riedel, David McAninch, Cameron Fisher, Nahum Goldstein
Venue: IEEE Micro (1985)

This TMS32010-based, single-board system calculates fast Fourier transforms. Special software makes based calculations transparent to the Fortran user.
A Meta-ontological Framework for Multi-agent Systems Design
Authors: Marina V. Sokolova, Antonio Fernández-Caballero
Venue: Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II (2007)

The paper introduces an approach to using a meta-ontology framework for complex multi-agent systems design, and illustrates it in an application related to ecological-medical issues. The described shared ontology is pooled from private sub-ontologies, which represent a problem area ontology, an agent ontology, a task ontology, an ontology of interactions, and the multi-agent system architecture ontology.
Robust Object Recognition Using Wide Baseline Matching for RoboCup Applications
Authors: Patricio Loncomilla, Javier Ruiz-Del-Solar
Venue: RoboCup 2007: Robot Soccer World Cup XI (2008)

As the RoboCup leagues evolve, higher requirements (e.g. object recognition skills) are imposed over the robot vision systems, which cannot be fulfilled using simple mechanisms as pure color segmentation or visual sonar. In this context the main objective of this article is to propose a robust object recognition system, based on the wide-baseline matching between a reference image (object model) and a test image where the object is searched. The wide baseline matching is implemented using local interest points and invariant descriptors. The proposed object recognition system is validated in two real-world tasks, recognition of objects in the RoboCup @Home league, and detection of robots in the humanoid league.
Research on a Consultation Mechanism of Third Party E-Commerce Platform
Authors: Zheng Hua
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

This paper analyzes the structure of Java-based Agent development framework JADE. Based on the traditional consultative mechanism, give the model of consultation for single-to-many projects. In the true sense, the logic model establishment of the e-commerce consultation, and this makes the third party E-Commerce platform get higher autonomy and intelligent. 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
Cyber Biosphere for Future Embedded Systems
Authors: Franz J. Rammig
Venue: Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems (2008)

Future Embedded Systems are heading into a degree of complexity which is far beyond today`s level. As most technical artifacts will be interconnected in some sense ("Internet of Things") Embedded Systems of the future cannot be treated as isolated entities any longer. Two major tendencies to cope with this challenge can be observed. The first one takes its inspiration from the technical roots of Embedded Systems. They are looked at from their technical nature but the traditional boundaries of Embedded Systems, especially to consider them as isolated systems are overcome. This approach became well known under the name "Cyber Physical Systems (CPS)". The second approach observes the existence of highly successful and relatively stable systems in form of our biosphere. So it seems to be wise to take inspirations from the achievement of nature. This approach became rather popular under the term "Biologically Inspired Systems" or "Organic Computing". In this paper we will concentrate on the latter attempt to build the highly complex, highly sophisticated Embedded Systems of the future. Inspirations from ant colonies, from the hormone system, and from the immune system will shortly be discussed using specific examples. Some comparisons with the CPS approach will be made as well.
Wavelet based speech enhancement technique using median function thresholding
Authors: A. K. Sinha, Shikhar Kanti Dutta, Budhaditya Dev, Jaydipta Jaydipta, Ranjana Kumari
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

In modern day voice communication, reduction of noise is of great importance. The necessity of reduction of noise arises due to the interference of the external factors with the concerned signal. Hence to reduce the interference effects wavelet based time-frequency analysis of signals is performed. Time-frequency analysis is the process of determining what frequencies are present in a signal, how strong they are and how they change over time. Both Discrete Wavelet Transform (DWT) and Packet Wavelet Transform (PWT) are optimal methods for this purpose. In this work we use some real signals and process them with DWT and PWT.
Convergence of Classical Search and Semantic Technologies --- Evidences from a Practical Case in the Chemical Industry
Authors: Stefan Smolnik
Venue: Scaling Topic Maps: Third International Conference on Topic Maps Research and Applications, TMRA 2007 Leipzig, Germany, October 11-12, 2007 Revised Selected Papers (2008)

With their expanding information assets and the growing importance of the knowledge factor, organizations are increasingly challenged to efficiently support knowledge management processes with appropriate structuring and retrieval technologies. Besides traditional information retrieval approaches, the use of semantic technologies like Topic Maps is also becoming more important. This paper compares the potential value of all these approaches, technological requirements, and applications. Thereafter, appropriate recommendations are derived for the most suitable choice of technology. In addition, early experiences from a practical case in the chemical industry provide further insights into the applicability of these recommendations in practice.
Tags and image scoring for robust cooperation
Authors: Nathan Griffiths
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

Establishing and maintaining cooperation is an enduring problem in multi-agent systems and, although several solutions exist, the increased use of online trading systems, peer-to-peer networks, and ubiquitous computing environments mean that it remains an important question. Environments are emerging in which large numbers of agents are required to cooperate, but where repeat interactions between agents may be rare or non-existent. Most existing approaches to cooperation rely on reciprocity to establish notions of trust and reputation. However, where repeat interactions are rare such approaches are not always effective. In this paper we use ideas from biology and the social sciences to provide a mechanism that supports cooperation in such environments. Our mechanism combines a tag-based method to enable co-operation given a lack of reciprocity, with an adaptation of a simple image scoring reputation model to cope with cheating agents. Using a simple peer-to-peer scenario we show how cooperative behaviour is favoured, and how the influence of cheating agents can be reduced using only minimal information about an agent's neighbours.
Gem #20: using pragma shared_passive for data persistence
Authors: Pascal Obry
Venue: ACM SIGAda Ada Letters (2008)

Ada Gem #20 -- Using pragma Shared_Passive for data persistence.
The Segmental-Transmission-Line: Its Design and Prototype Evaluation
Authors: Moritoshi Yasunaga, Yoshiki Yamaguchi, Hiroshi Nakayama, Ikuo Yoshihara, Naoki Koizumi, Jung H. Kim
Venue: Proceedings of the 8th international conference on Evolvable Systems: From Biology to Hardware (2008)

In the PCB (printed circuit board) design for GHz-frequency devices, ensuring the signal integrity is one of the most important design goals. In order to obtain the goal, we have proposed a novel PCB-trace, or a transmission line called "Segmental Transmission Line (STL)" already. In the STL, a transmission line is divided into multiple segments of individual characteristic impedance. And the multiple segments are designed to achieve an idealized wave form on the line by solving a combinatorial explosion problem using genetic algorithm. In our previous papers, we have shown fundamental effectiveness of the STL on the computer simulation already. In this paper, we fabricate an STL prototype using a real PCB and demonstrate its effectiveness based on the prototype.