ppxscal/embedding_network huggingface dataset:
A Novel Covariance Matrix Based Approach for Detecting Network Anomalies
Authors: Mahbod Tavallaee, Wei Lu, Shah Arif Iqbal, Ali A. Ghorbani
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

During the last decade, anomaly detection has attracted the attention of many researchers to overcome the weakness of signature-based IDSs in detecting novel attacks. However,having a relatively high false alarm rate, anomaly detection has not been wildly used in real networks. In this paper, we have proposed a novel anomaly detection scheme using the correlation information contained in groups of network traffic samples. Our experimental results show promising detection rates while maintaining false positives at very low rates.
Design and evaluation of a rough set-based anomaly detection scheme considering weighted feature values
Authors: Ihn-Han Bae, Hwa-Ju Lee, Kyung-Sook Lee
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2007)

The rapid proliferation of wireless networks and mobile computing applications has changed the landscape of network security. Anomaly detection is a pattern recognition task whose goal is to report the occurrence of abnormal or unknown behavior in a given system being monitored. This paper presents an efficient rough set based anomaly detection method that can effectively identify a group of especially harmful internal attackers - masqueraders in cellular mobile networks. Our scheme uses the trace data of wireless application layer by a user as feature value. Based on this, the used pattern of a mobile's user can be captured by rough sets, and the abnormal behavior of the mobile can be also detected effectively by applying a roughness membership function considering weighted feature values. The performance of our scheme is evaluated by using a simulation.
Policy-based self-adaptive architectures: a feasibility study in the robotics domain
Authors: John C. Georgas, Richard N. Taylor
Venue: Proceedings of the 2008 international workshop on Software engineering for adaptive and self-managing systems (2008)

Robotics is a challenging domain which sometimes exhibits a clear need for self-adaptive capabilities, as such functionality offers the potential for robots to account for their unstable and unpredictable deployment domains. This paper focuses on a feasibility study in applying a policy- and architecture-based approach to the development of self-adaptive robotic systems. We describe two case studies in which we construct self-adaptive Robocode and Mindstorms robots, report on our development experiences, and discuss the challenges we encountered. The paper establishes that it is feasible to apply our approach to the robotics domain, contributes a discussion of the architectural issues we encountered, and further evaluates our general-purpose approach.
Performance limitations from delay in human and mechanical motor control
Authors: Dan Beamish, Shabana Bhatti, Jianhong Wu, Zhujun Jing
Venue: Biological Cybernetics (2008)

We discuss natural limitations on motor performance caused by the time delay required for feedback signals to propagate within the human body or mechanical control systems. By considering a very simple delayed linear servomechanism model, we show there exists a best possible speed-accuracy trade-off similar to Fitts&#x2019; law that cannot be exceeded when delay is present. This is strictly a delay effect and does not occur for the ideal case of instantaneous feedback. We then examine the performance of the vector integration to endpoint (VITE) circuit as a model of human movement and show that when this circuit is generalized to include delayed feedback the performance may not exceed that of the servomechanism with an equal delay. We suggest the existence of such a limitation may be a ubiquitous consequence of delay in motor control with the implication that the index of performance in Fitts&#x2019; law cannot arbitrarily large.
Subjective objectivity: negotiating emotional meaning
Authors: Lucian Leahu, Steve Schwenk, Phoebe Sengers
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

Affective computing systems face challenges in relating objective measures with subjective human experiences. Many systems have either focused on objective measures as a substitute for subjective experience (e.g. skin conductance as a direct representation of arousal) or have abandoned objective measures to focus purely on subjective experience. In this paper, we explore how to negotiate the relationship between objective signals and subjective experiences by highlighting the role of human interpretation. Our approach is informed by a reflective analysis drawing on the arts and the humanities and by a participatory study examining the emergence of emotional meaning. We demonstrate the potential of our approach for interactive affective systems through a series of conceptual designs that embody these understandings.
Brain Cancer May Be the Least of Our Worries
Authors: Paul F. Dubois
Venue: Computing in Science and Engineering (2008)

Columnist Paul F. Dubois looks at some of the dangers of modern life, including cell phones and their ilk.
Modeling and Characterization of Capacitively Coupled Interdigital-Gated HEMT Plasma Device for Terahertz Wave Amplification
Authors: Zon Fazlila Mohd Ahir, Ahmad Zarif Zulkifli, Abdul Manaf Hashim
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

A capacitively coupled interdigital-gated HEMT structure was used to investigate the occurrence of uniformity of electric field distribution along the structure. The structure was designed and simulated using Commercial Electromagnetic Sonnet Suites software. The return loss characteristics were analyzed and evaluated. The comparison of the admittance characteristics from simulation between dc connected structure and capacitively coupled structure is carried out in order to evaluate electromagnetic wave propagation. This structure kept uniform electric field in the channel when the dc biased is applied to the interdigital gate, which modulates the potential in the channel.
Generic mobility simulation framework (GMSF)
Authors: Rainer Baumann, Franck Legendre, Philipp Sommer
Venue: Proceeding of the 1st ACM SIGMOBILE workshop on Mobility models (2008)

Vehicular ad-hoc networks with inter-vehicular communications are a prospective technology which contributes to safer and more efficient roads and offers information and entertainment services to mobile users. Since large real-world testbeds are not feasible, research on vehicular ad-hoc networks depends mainly on simulations. Therefore, it is crucial that realistic mobility models are employed. We propose a generic and modular mobility simulation framework (GMSF). GMSF simplifies the design of new mobility models and their evaluation. Besides, new functionalities can be easily added. GMSF also propose new vehicular mobility models, GIS-based mobility models. These models are based on highly detailed road maps from a geographic information system (GIS) and realistic microscopic behaviors (car-following and traffic lights management). We perform an extensive comparison of our new GIS-based mobility models with popular mobility models (Random Waypoint, Manhattan) and realistic vehicular traces from a proprietary traffic simulator. Our findings leverages important issues the networking community still has to address.
Optimal Resource Discovery Paths of Gnutella2
Authors: Mikko Vapa, Annemari Auvinen, Yevgeniy Ivanchenko, Niko Kotilainen, Jarkko Vuori
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal query paths for the peer-to-peer resource discovery problem. Global knowledge of the topology and the resources from the peer-to-peer network are required as an input to the algorithm. The algorithm provides an objective measure for defining how good local search algorithms are. The performance is evaluated in simulated peer-to-peer scenarios and in the measured Gnutella2 P2P network topology with four local search algorithms: breadth-first search, self-avoiding random walker, highest degree search and Dynamic Query Protocol.
A forwarding model for Voronoi-based Overlay Network
Authors: Jui-Fa Chen, Wei-Chuan Lin, Tsu-Han Chen, Shun-Yun Hu
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

An approach to build highly scalable and robust networked virtual environments (NVEs) is using the peer-to-peer overlay networks. Voronoi-based Overlay Network (VON) has been proposed to maintain a highly overlay topology consistency in a bandwidth-efficient manner. However, the related research requires all nodes to connect directly with their relevant neighbors. This limits the number of neighbors should appear within the area of interest (AOI) of a given node. A new forwarding model for VON is proposed to solve this problem by connecting only with the nearest neighbors that is called the enclosing neighbors (EN), and propagating the position updates information to other nodes by message forwarding. In this way, the AOI of a given node may be more flexibly expanded and different bandwidth capacities may be more efficiently utilized.
Explaining failures of program analyses
Authors: Daniel von Dincklage, Amer Diwan
Venue: Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation (2008)

With programs getting larger and often more complex with each new release, programmers need all the help they can get in understanding and transforming programs. Fortunately, modern development environments, such as Eclipse, incorporate tools for understanding, navigating, and transforming programs. These tools typically use program analyses to extract relevant properties of programs. These tools are often invaluable to developers; for example, many programmers use refactoring tools regularly. However, poor results by the underlying analyses can compromise a tool's usefulness. For example, a bug finding tool may produce too many false positives if the underlying analysis is overly conservative, and thus overwhelm the user with too many possible errors in the program. In such cases it would be invaluable for the tool to explain to the user why it believes that each bug exists. Armed with this knowledge, the user can decide which bugs are worth pursing and which are false positives. The contributions of this paper are as follows: (i) We describe requirements on the structure of an analysis so that we can produce reasons when the analysis fails; the user of the analysis determines whether or not an analysis's results constitute failure. We also describe a simple language that enforces these requirements; (ii) We describe how to produce necessary and sufficient reasons for analysis failure; (iii) We evaluate our system with respect to a number of analyses and programs and find that most reasons are small (and thus usable) and that our system is fast enough for interactive use.
Reusability of nanostencils for the patterning of Aluminum nanostructures by selective wet etching
Authors: O. Vázquez-Mena, G. Villanueva, M. A. F. van den Boogaart, V. Savu, J. Brugger
Venue: Microelectronic Engineering (2008)

One of the major advantages of stencil lithography is the possibility to use stencils many times. However, when stencils contain nanoapertures, the clogging of the membranes limits the useful life time of the stencils. The clogging is due to the accumulation of material deposited inside the apertures of the stencil. Here, we report a study on the effect of the clogging on the life time of stencils after Al depositions through the stencils. Then we present a method to clean the stencils based on Al wet etching to eliminate the clogging. We show that this method allows the reusability of stencils for the repeatable depositions of Al nanostructures.
Test Compaction for Mixed-Signal Circuits Using Pass-Fail Test Data
Authors: Sounil Biswas, R. D. (Shawn) Blanton
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

We propose a methodology that employs boolean minimization and optimized test covering to identify redundant tests of a mixed-signal circuit from its pass-fail (binary) test data. This methodology is applied to two in-production circuits, a high-speed serializer/deserializer (HSS) and a phase-locked loop (PLL). Application of the methodology to over 38,000 failing HSS circuits demonstrate that only 0.016% of them are mispredicted when three of nine high-voltage HSS tests are eliminated. Similarly, analysis of 22,000 failing PLL circuits results in an error of 0.032% when 11 out of the 36 PLL tests are eliminated. Assuming 90% yield, these misprediction levels for the HSS and the PLL designs are equivalent to 16 and 32 DPM, respectively. The cost savings from eliminating the redundant tests in the HSS and the PLL designs at 90% yield are however estimated to be 21.9% and 30.9%, respectively.
A demonstration of Cascadia through a digital diary application
Authors: Nodira Khoussainova, Evan Welbourne, Magdalena Balazinska, Gaetano Borriello, Garrett Cole, Julie Letchner, Yang Li, Christopher Ré, Dan Suciu, Jordan Walke
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

The Cascadia system provides RFID-based pervasive computing applications with an infrastructure for specifying, extracting and managing meaningful high-level events from raw RFID data. Cascadia allows application developers and even users to specify events of interest using either a declarative query language or a graphical interface with an intuitive visual language. Cascadia then effectively extracts these events from data in spite of the unreliability of RFID technology and the inherent ambiguity in event extraction. We demonstrate Cascadia's technique through a digital diary application in the form of a calendar. Cascadia automatically populates the calendar with meaningful events for the user. We use data collected in a building-wide RFID deployment.
Multivariate Gaussian Random Number Generation Targeting Reconfigurable Hardware
Authors: David B. Thomas, Wayne Luk
Venue: ACM Transactions on Reconfigurable Technology and Systems (TRETS) (2008)

The multivariate Gaussian distribution is often used to model correlations between stochastic time-series, and can be used to explore the effect of these correlations across N time-series in Monte-Carlo simulations. However, generating random correlated vectors is an O(N2) process, and quickly becomes a computational bottleneck in software simulations. This article presents an efficient method for generating vectors in parallel hardware, using N parallel pipelined components to generate a new vector every N cycles. This method maps well to the embedded block RAMs and multipliers in contemporary FPGAs, particularly as extensive testing shows that the limited bit-width arithmetic does not reduce the statistical quality of the generated vectors. An implementation of the architecture in the Virtex-4 architecture achieves a 500MHz clock-rate, and can support vector lengths up to 512 in the largest devices. The combination of a high clock-rate and parallelism provides a significant performance advantage over conventional processors, with an xc4vsx55 device at 500MHz providing a 200 times speedup over an Opteron 2.6GHz using an AMD optimised BLAS package. In a case study in Delta-Gamma Value-at Risk, an RC2000 accelerator card using an xc4vsx55 at 400MHz is 26 times faster than a quad Opteron 2.6GHz SMP.
Knowledge-Intensive Semantic Web Services Composition
Authors: Dhavalkumar Thakker, Taha Osman, David Al-Dabass
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

With the rapid proliferation of Web services as the medium of choice to securely publish application services beyond the firewall, the importance of accurate, yet flexible matchmaking of similar services gains importance both for the human user and for dynamic composition engines. In this paper, we present a novel approach that utilizes the case based reasoning methodology for modelling dynamic Web service discovery and matchmaking, and investigate the use of case adaptation for service composition. Our framework considers Web services execution experiences in the decision making process and is highly adaptable to the service requester constraints. The framework takes knowledge-intensive approach and utilizes OWL semantic descriptions extensively for implementing both the components of the CBR engine and the matchmaking profile of the Web services.
Fast multiplication of matrices over a finitely generated semiring
Authors: Daniel Andrén, Lars Hellström, Klas Markström
Venue: Information Processing Letters (2008)

In this paper we show that nxn matrices with entries from a semiring R which is generated additively by q generators can be multiplied in time O(q^2n^@w), where n^@w is the complexity for matrix multiplication over a ring (Strassen: @w
Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least k
Authors: B. Bollobás, C. Cooper, T. I. Fenner, A. M. Frieze
Venue: Journal of Graph Theory (2000)

Let Gn,m,k denote the space of simple graphs with n vertices, m edges, and minimum degree at least k, each graph G being equiprobable. Let G have property Ak, if G contains &lfloor;(k - 1)-2&rfloor; edge disjoint Hamilton cycles, and, if k is even, a further edge disjoint matching of size &lfloor;n-2&rfloor;. We prove that, for k &ge; 3, there is a constant Ck such that if 2m &ge; Ckn then Ak occurs in Gn,m,k with probability tending to 1 as n &rarr; &infin;. &copy; 2000 John Wiley & Sons, Inc. J. Graph Theory 34: 42&ndash;59, 2000
Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date
Authors: Celso S. Sakuraba, Débora P. Ronconi, Francis Sourd
Venue: Computers and Operations Research (2009)

This paper addresses the minimization of the mean absolute deviation from a common due date in a two-machine flowshop scheduling problem. We present heuristics that use an algorithm, based on proposed properties, which obtains an optimal schedule for a given job sequence. A new set of benchmark problems is presented with the purpose of evaluating the heuristics. Computational experiments show that the developed heuristics outperform results found in the literature for problems up to 500 jobs.
Innovative use of ICT in schools based on the findings in ELFE project
Authors: Ulf Fredriksson, Gunilla Jedeskog, Tjeerd Plomp
Venue: Education and Information Technologies (2008)

The European e-Learning Forum for Education (ELFE) is a project initiated by the ETUCE (European Trade Union Committee on Education). An important objective of the project has been to study good experiences with implementing the use of ICT in schools. This objective has been broken down in seven operational research questions. Three of these questions will be discussed in this article: (1) What difference does the use of ICT make in schools where ICT is intensively used for instructional/pedagogical purposes? (2) How are the students influenced by this different way of teaching as compared to the traditional classroom education, both individually and as a collective? 3) What factors influence the intensive pedagogical use of ICT? The ELFE study applied a case study approach. Three innovative schools in each of five European countries (Denmark, England, Germany, Norway and Portugal) were purposively selected. Data were collected via questionnaires, interviews, observations and school documents. The findings resulting from the ELFE schools case studies illustrate that the implementation of ICT for teaching and learning may influence the functioning of schools in a number of ways. One can also conclude that students like working with computers and that they have no `instrumental' problems. A number of factors seem to influence the successful implementation of ICT at school level such as a good infrastructure, a clear vision, policy and strategy. A crucial factor is support from national, regional and local authorities, as well as from the school leadership and parents.
Fister-Panetta Upper Bound for Cancer Growth. Some Computational Remarks
Authors: Razvan Bocu, Sabin Tabirca, Yin Jie Chen
Venue: Proceedings of the 2008 International Conference on Biocomputation, Bioinformatics, and Biomedical Technologies (2008)

Contemporary people live in a society featured by a continuously increasing complexity. As a consequence, interdisciplinary approaches represent a must for every scientist that aims to efficiently manage a certain problem. Cancer evolution and the associated proper medication strategy is an example of such a complex problem that requires an interdisciplinary approach in order to be properly addressed. The first section addresses some basic aspects regarding how cancer research could benefit from the cooperation between mathematics and biology. The second section of the paper discusses about the cancer modelling at a very basic level and describes a drug medication optimization pattern based on the very well-known model of Fister and Panetta, which is modified in order to increase its readability and predictive capacity.
Long cycles in critical graphs
Authors: Noga Alon, Michael Krivelevich, Paul Seymour
Venue: Journal of Graph Theory (2000)

It is shown that any k-critical graph with n vertices contains a cycle of length at least $2\sqrt{log(n-1)/log(k-2)}$, improving a previous estimate of Kelly and Kelly obtained in 1954. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 35: 193&ndash;196, 2000
Higher Dimensional Cost Function for Synthesis of Evolutionary Algorithms by means of Symbolic Regression
Authors: Zuzana Oplatková, Ivan Zelinka
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

This contribution deals with a new idea of how to create evolutionary algorithms by means of symbolic regression and Analytic Programming. The motivation was not only to tune some existing algorithms to their better performance, but also to find a new robust evolutionary algorithm. In this study operators of Differential Evolution (DE), SelfOrganizing Migrating Algortithm (SOMA), Hill Climbing (HC) and Simulated Annealing (SA) were used during a process of Analytic Programming. The results showed that AP was able to find successful as well as the original DE or SOMA. The cost function includes not only success in unimodal and multimodal benchmark function but also rules concerned to cost function evaluations. Results were tested on 16 benchmark functions in 2D, 20 D and 100 dimensional versions, i.e. 192 test, each was 100 times repeated and each of 100 repetitions has around 200 000 cost function evaluations. The results are presented in tabelar and graphic form.
An analysis of average search cost of the external hashing with separate chain
Authors: Ningping Sun, Ryozo Nakamura, Hongbing Zhu, Akio Tada, Wenling Sun
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

External hashing with separate chain algorithm is a well-known method to dealing with the collision problem when hashing technique is employed. The performance of external hashing with separate chain depends on the data structure of separate chain. We provide an approach to clarify the relationship between the insertion order of keys and position that key is located. Introducing the probability distribution of frequency of access to each individual key in the separate chain into the analysis of search cost, we propose a mathematical analysis to analyze and evaluate the performance of external hashing with separate chain for two cases. Some experimental results obtained from the proposed formulae are also presented.