ppxscal/embedding_network huggingface dataset:
SOON: A Scalable Self-organized Overlay Network for Distributed Information Retrieval
Authors: Juan Li, Son Vuong
Venue: Proceedings of the 19th IFIP/IEEE international workshop on Distributed Systems: Operations and Management: Managing Large-Scale Service Deployment (2008)

Locating desirable resources and information from a large-scale distributed system such as P2P system and grid is a very important issue. However, the distributed, heterogeneous, and unstructured nature of the system makes this issue very challenging. In this paper, we propose Self-Organized Overlay Network (SOON), an unstructured P2P overlay architecture, to facilitate sharing and searching semantically heterogeneous contents. In particular, we have proposed a semantics-aware topology construction method to group nodes sharing similar semantics together to create small-worlds. For this purpose, we have designed an algorithm to extract a node's ontology summary and use that summary to compute the semantic similarity between nodes. With this semantic similarity defined, nodes are grouped accordingly, forming semantic virtual domains and clusters. Resource information integration and searching can be efficiently performed on top of this topology.
Network Anomalous Attack Detection Based on Clustering and Classifier
Authors: Hongyu Yang, Feng Xie, Yi Lu
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

A new approach to detect anomalous behaviors in network traffic is presented. The network connection records were mapped into different feature spaces according to their protocols and services. Then performed clustering to group training data points into clusters, from which some clusters were selected as normal and known-attack profile. For those training data excluded from the profile, we used them to build a specific classifier. The classifier has two distinct characteristics: one is that it regards each data point in the feature space with the limited influence scope, which is served as the decisive bounds of the classifier, and the other is that it has the "default" label to recognize those novel attacks. The new method was tested on the KDD Cup 1999 data. Experimental results show that it is superior to other data mining based approaches in detection performance, especially in detection of PROBE and U2R attacks.
PDA-based Boolean Function Simplification: a Useful Educational Tool
Authors: Ledion Bitincka, George E. Antoniou
Venue: Informatica (2004)

In this paper a useful educational tool is presented for minimizing low order Boolean expressions. The algorithm follows the Karnaugh map looping approach and provides optimal results. For the implementation, C++ was used on the CodeWarrior for Palm Operating System environment. In order to make the overall implementation efficient, the object oriented approach was used. Two step-by-step examples are presented to illustrate the efficiency of the proposed algorithm. The proposed application can be used by students and professors in the fields of electrical and computer engineering and computer science.
Being a part of the crowd: towards validating VR crowds using presence
Authors: Nuria Pelechano, Catherine Stocker, Jan Allbeck, Norman Badler
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

Crowd simulation models are currently lacking a commonly accepted validation method. In this paper, we propose level of presence achieved by a human in a virtual environment (VE) as a metric for virtual crowd behavior. Using experimental evidence from the presence literature and the results of a pilot experiment that we ran, we explore the egocentric features that a crowd simulation model should have in order to achieve high levels of presence and thus be used as a framework for validation of simulated crowd behavior. We implemented four crowd models for our pilot experiment: social forces, rule based, cellular automata and HiDAC. Participants interacted with the crowd members of each model in an immersive virtual environment for the purpose of studying presence in virtual crowds, with the goal of establishing the basis for a future validation method.
QoS differentiation for IEEE 802.16 WiMAX mesh networking
Authors: Yan Zhang, Honglin Hu, Hsiao-Hwa Chen
Venue: Mobile Networks and Applications (2008)

Recently IEEE 802.16 WiMAX has attracted a lot of attention in wireless networking research and applications. To enable a flexible and cost-effective deployment, mesh networking mode is defined in WiMAX standard. In this paper, we introduce a system model of WiMAX mesh networking with the focus on entry process, frame structure, centralized and distributed scheduling. The state-of-the-art WiMAX mesh networking research is reviewed. In addition, we propose an effective QoS differentiation scheme for the IEEE 802.16 WiMAX mesh networks. Both collocated scenario and general topology are theoretically analyzed and compared. Illustrative numerical examples are presented to demonstrate the effectiveness of the proposed strategy. The impact of key parameters on the performance is discussed for differentiating multiple classes of services. Several open issues are summarized as a guideline for future topics in WiMAX mesh networking research.
Use of Ontologies in Practical NL Query Interpretation
Authors: Leonardo Lesmo, Livio Robaldo
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

This paper describes how a domain ontology has been used in practical system of query interpretation. It presents a general methodology for building a semantic and language-independent representation of the meaning of the query on the basis of the contents of the ontology. The basic idea is to look for paths on the ontology connecting concepts related to words appearing in the NL query. The final result is what has been called Ontological Query, i.e. a semantic description of the user's target. Since the domain is restricted, the problem of semantic ambiguity is not as relevant as in unrestricted applications, but some hints about how to obtain unambiguous representation will be given.
π-ADL.NET: a high level architecture description language compiler for the .NET platform
Authors: Zawar Qayyum
Venue: Proceedings of the 7th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems (2008)

This paper describes some of the results and algorithms from the development of a compiler utility for an Architecture Description Language π-ADL, for the .NET platform. Architecture Description Languages or ADLs, are special purpose high level languages especially construed to define software architectures. π-ADL, a recent addition to this class of languages, is formally based on the π-Calculus, a process oriented formal method. The compiler for π-ADL, named π-ADL .NET, is designed with the view of bringing the architecture driven software design approach to the .NET platform. The process oriented nature and a robust set of parallelism constructs of π-ADL make the π-ADL.NET project a novel application of compiler techniques in the context of the .NET platform, with many valuable lessons learnt. This paper presents the π-ADL.NET effort from a compiler design perspective, and also documents the motivation, vision and future possibilities for this line of work.
Users in Volatile Communities: Studying Active Participation and Community Evolution
Authors: Tanja Falkowski, Myra Spiliopoulou
Venue: Proceedings of the 11th international conference on User Modeling (2007)

Active participation of a person in a community is a powerful indicator of the person's interests, preferences, beliefs and (often) social and demographic context. Community membership is part of a user's model and can contribute to tasks like personalized services, assistance and recommendations. However, a community member can be active or inactive. To what extend is a community still representative of the interests of an inactive participant? To gain insights to this question, we observe a community as an evolving social structure and study the effects of member fluctuation. We define a community as a high-level temporal structure composed of "community instances" that are defined conventionally through observable active participation and are captured at distinct timepoints. Thus, we capture community volatility, as evolution and discontinuation. This delivers us clues about the role of the community for its members, both for active and inactive ones. We have applied our model on a community exhibiting large fluctuation of members and acquired insights on the community-member interplay.
An Improved Hybrid Projection Function for Eye Precision Location
Authors: Yi Li, Peng-Fei Zhao, Bai-Kun Wan, Dong Ming
Venue: Medical Imaging and Informatics: 2nd International Conference, MIMI 2007, Beijing, China, August 14-16, 2007 Revised Selected Papers (2008)

An improved hybrid projection function (IHPF) for precise eye location is presented in this paper. This algorithm combined the advantage of variance projection function (VPF) and hybrid projection function (HPF) by optimizing their weights in the traditional integral projection function (IPF). Two different face databases, BioID face database downloaded from the internet and PSFace database established by our laboratory, were used to test the influence of different projection functions on correctness and relative mean-error of eye locations. The results show that IHPF with optimized proportion factors has a high eye location correctness of 96~100% and the lowest relative error with better face feature location capability.
Description and simulation of dynamic mobility networks
Authors: A. Scherrer, P. Borgnat, E. Fleury, J. -L. Guillaume, C. Robardet
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

During the last decade, the study of large scale complex networks has attracted a substantial amount of attention and works from several domains: sociology, biology, computer science, epidemiology. Most of such complex networks are inherently dynamic, with new vertices and links appearing while some old ones disappear. Until recently, the dynamics of these networks was less studied and there is a strong need for dynamic network models in order to sustain protocol performance evaluations and fundamental analyzes in all the research domains listed above. We propose in this paper a novel framework for the study of dynamic mobility networks. We address the characterization of dynamics by proposing an in-depth description and analysis of two real-world data sets. We show in particular that links creation and deletion processes are independent of other graph properties and that such networks exhibit a large number of possible configurations, from sparse to dense. From those observations, we propose simple yet very accurate models that allow generate random mobility graphs with similar temporal behavior as the one observed in experimental data.
Unsupervised Genetic Algorithm Deployed for Intrusion Detection
Authors: Zorana Banković, Slobodan Bojanić, Octavio Nieto, Atta Badii
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

This paper represents the first step in an on-going work for designing an unsupervised method based on genetic algorithm for intrusion detection. Its main role in a broader system is to notify of an unusual traffic and in that way provide the possibility of detecting unknown attacks. Most of the machine-learning techniques deployed for intrusion detection are supervised as these techniques are generally more accurate, but this implies the need of labeling the data for training and testing which is time-consuming and error-prone. Hence, our goal is to devise an anomaly detector which would be unsupervised, but at the same time robust and accurate. Genetic algorithms are robust and able to avoid getting stuck in local optima, unlike the rest of clustering techniques. The model is verified on KDD99 benchmark dataset, generating a solution competitive with the solutions of the state-of-the-art which demonstrates high possibilities of the proposed method.
On a Class of Permutation Polynomials over $\mathbb{F}_{2^n}$
Authors: Pascale Charpin, Gohar M. Kyureghyan
Venue: Proceedings of the 5th international conference on Sequences and Their Applications (2008)

We study permutation polynomials of the shape F(X) = G(X) + ¿ Tr(H(X)) over $\mathbb{F}_{2^n}$ . We prove that if the polynomial G(X) is a permutation polynomial or a linearized polynomial, then the considered problem can be reduced to finding Boolean functions with linear structures. Using this observation we describe six classes of such permutation polynomials.
Adding Diversity in Ensembles of Neural Networks by Reordering the Training Set
Authors: Joaquín Torres-Sospedra, Carlos Hernández-Espinosa, Mercedes Fernández-Redondo
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

When an ensemble of neural networks is designed, it is necessary to provide enough diversity to the different networks in the ensemble. We propose in this paper one new method of providing diversity which consists on reordering the training set patterns during the training. In this paper three different algorithms are applied in the process of building ensembles with Simple Ensemble and Cross-Validation. The first method consists in using the original training set, in the second one the training set is reordered before the training algorithm is applied and the third one consists in reordering the training set at the beginning of each iteration of BackPropagation. With the experiments proposed we want to empirically demonstrate that reordering patterns during the training is a valid source to provide diversity to the networks of an ensemble. The results show that the performance of the original ensemble methods can be improved by reordering the patterns during the training. Moreover, this new source of diversity can be extended to more complex ensemble methods.
Capture-recapture in software unit testing: a case study
Authors: Hanna Scott, Claes Wohlin
Venue: Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement (2008)

Quantitative failure estimates for software systems are traditionally made at end of testing using software reliability growth modeling. A persistent problem with most kinds of failure estimation methods and models is the dependency on historical data. This paper presents a method for estimating the total amount of failures possible to provoke from a unit, without historical data dependency. The method combines the results from having several developers testing the same unit with capture-recapture models to create an estimate of 'remaining' number of failures. The evaluation of the approach consists of two steps: first a pre-study where the tools and methods are tested in a large open source project, followed by an add-on to a project at a medium sized software company. The evaluation was a success. An estimate was created, and it can be used both as a quality gatekeeper for units and input to functional and system testing.
Enabling Smart Spaces with OSGi
Authors: Choonhwa Lee, David Nordstedt, Sumi Helal
Venue: IEEE Pervasive Computing (2003)

Originated in 1999 to deliver WAN services to home environments, the Open Services Gateway Initiative today presents a unique opportunity to pervasive computing as a potential framework for achieving interoperability and extensibility. Through two major enhancements over the last few years, the specification has evolved to include numerous new services and features that support various usage models. Here, the authors present the OSGi technology and examine several OSGi development toolkits and products. They also share their experience in using OSGi to build an open, assistive environment that supports independent living for elders.
Synthesizing FPGA Circuits from Parallel Programs
Authors: Satnam Singh, David Greaves
Venue: Proceedings of the 4th international workshop on Reconfigurable Computing: Architectures, Tools and Applications (2008)

In this presentation we describe recent experiments to represent circuit descriptions as explicit parallel programs written in regular programming languages rather than hardware description languages. Although there has been much work on compiling sequential C-like programs to hardware by automatically "discovering" parallelism we work by exploiting the parallel architecture communicated by the designer through the choice of parallel and concurrent programming language constructs. Specially, we describe a system that takes .NET assembly language with suitable custom attributes as input and produces Verilog output which is mapped to FPGAs. We can then choose to apply analysis and verification techniques to either the high level representation in C# or other .NET languages or to the generated RTL netlisits.
Power System Fault Detection Based on Stationary Wavelet Packet Transform and Hilbert Transform
Authors: Yi-Hua Liu, Guang-Zhou Zhao
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

Based on stationary wavelet packet transform and Hilbert transform, the paper proposes a fault detection algorithm, which adaptively extracts the fault characteristic component of the signal. Firstly, the algorithm uses one-level stationary wavelet packet transform to decompose the signal into low- and high-frequency sub-bands. Subsequently, Hilbert transform is used to obtain the instantaneous frequency and instantaneous amplitude of the low- or high-frequency sub-band. Based on the preset frequency and amplitude criteria, the algorithm decides whether to further decompose the sub-band or hold it. Thus the algorithm adaptively selects the path of stationary wavelet packet decomposition, making a multi-resolution spectral analysis on the signal and extracting the characteristic components for fault detection. The simulations show that the algorithm provides sufficient frequency-amplitude fault information with the less computational workloads and has better anti-noise performance.
Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours
Authors: Stefan Funke, Sören Laue, Rouven Naujoks, Zvi Lotker
Venue: Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems (2008)

A fundamental class of problems in wireless communication is concerned with the assignment of suitable transmission powers to wireless devices/stations such that the resulting communication graph satisfies certain desired properties and the overall energy consumed is minimized. Many concrete communication tasks in a wireless network like broadcast, multicast, point-to-point routing, creation of a communication backbone, etc. can be regarded as such a power assignment problem.This paper considers several problems of that kind; the first problem was studied before in [1,6] and aims to select and assign powers to k out of a total of n wireless network stations such that all stations are within reach of at least one of the selected stations. We show that the problem can be (1 + ¿) approximated by only looking at a small subset of the input, which is of size , i.e. independent of n and polynomial in k and 1/¿. Here d denotes the dimension of the space where the wireless devices are distributed, so typically d ≤ 3 and describes the relation between the Euclidean distance between two stations and the power consumption for establishing a wireless connection between them. Using this coreset we are able to improve considerably on the running time of $n^{((\alpha/\epsilon)^{O(d)})}$ for the algorithm by Bilo et al. at ESA'05 ([6]) actually obtaining a running time that is linear in n. Furthermore we sketch how outliers can be handled in our coreset construction.The second problem deals with the energy-efficient, bounded-hop multicast operation: Given a subset C out of a set of n stations and a designated source node s we want to assign powers to the stations such that every node in C is reached by a transmission from s within k hops. Again we show that a coreset of size independent of n and polynomial in k, |C|, 1/¿ exists, and use this to provide an algorithm which runs in time linear in n.The last problem deals with a variant of non-metric TSP problem where the edge costs are the squared Euclidean distances; this problem is motivated by data aggregation schemes in wireless sensor networks. We show that a good TSP tour under Euclidean edge costs can be very bad in the squared distance measure and provide a simple constant approximation algorithm, partly improving upon previous results in [5], [4].
Goto elimination in program algebra
Authors: Thuy Duong Vu
Venue: Science of Computer Programming (2008)

This paper shows that program algebra (PGA) [J.A. Bergstra, M.E. Loots, Program algebra for sequential code, J. Logic Algebraic Programm. 51 (2002) 125-156] offers a mathematical and systematic framework for reasoning about correctness and equivalence of algorithms and transformation rules for goto removal. We study correctness and equivalence for the algorithm proposed by Cooper for goto elimination with additional boolean variables. To remove goto statements without the use of additional variables, we propose a technique to get rid of head-to-head crossings and subsequently employ the results of Peterson et al. and Ramshaw. Finally, we provide formal correctness proofs in the setting of PGA for industrial transformation rules given recently by Veerman for restructuring Cobol programs in real-life applications. We hereby show that PGA can explain goto elimination with mathematical rigor to a larger public.
Indian Statistical Institute at INEX 2007 Adhoc Track: VSM Approach
Authors: Sukomal Pal, Mandar Mitra
Venue: Focused Access to XML Documents: 6th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2007 Dagstuhl Castle, Germany, December 17-19, 2007. Selected Papers (2008)

This paper describes the work that we did at Indian Statistical Institute towards XML retrieval for INEX 2007. As a continuation of our INEX 2006 work, we applied the Vector Space Model and enhanced our text retrieval system (SMART) to retrieve XML elements against the INEX Adhoc queries. Like last year, we considered Content-Only(CO) queries and submitted two runs for the FOCUSED sub-task. The baseline run does retrieval at the document level; for the second run, we submitted our first attempt at element level retrieval. This run uses a very naive approach and performs poorly, but the relative performance of the baseline run was fairly encouraging. After the official submissions, we conducted a few more experiments involving both document-level and element-level retrieval. These additional runs yield some improvements in retrieval effectiveness. We report the results of those runs in this paper. Though our document-level runs are promising, the element-level runs are still far from satisfactory. Our next step will be to explore ways to improve element-level retrieval.