ppxscal/embedding_network huggingface dataset:
Proceedings of the first ACM conference on Wireless network security
Venue: Conference On Wireless Network Security (2008)

It is an honor and pleasure to welcome you to the first ACM Wireless Networks Security Conference. I hope that you will find the technical program stimulating, that our meeting venue will facilitate useful discussions, and that this conference will lead to fruitful collaborations in the future. During the past decade, it became increasingly clear to most researchers in our field that wireless communication technology would pose significant and unique security challenges. Wireless networks represent the underlying technology of what we now call ubiquitous computing. These networks are frequently deployed in environments that are vulnerable to previously unanticipated forms of adversarial attacks. Indeed, several types of wireless networks include components that operate in an unattended manner in potentially hostile settings. This fact and the typical resource constraints that many wireless networks experience has triggered a reassessment of the adversaries' capabilities and modes of attack. New security problems have arisen and along have come new opportunities for fertile research and development. Many of these opportunities are reflected in the program of this conference. This first WiSec conference is the result of discussions among several researchers who have been active participants in workshops on wireless, mobile, and ad hoc networks for the past few years. In mid' 2006 it became apparent that the three main workshops focusing on security of mobile ad-hoc and sensor networks, namely ACM Wireless Security Workshop (Wise), held in conjunction with ACM Mobicom, ACM Workshop Security in Ad Hoc and Sensor Networks (SASN), held in conjunction with ACM CCS, and the European Workshop on Security and Privacy in Ad hoc and Sensor Networks (ESAS), have outgrown their initial scope. Several members of what later became the Steering Committee of WiSec felt that bringing together participants who traditionally attended these workshops would help consolidate the previously separate efforts in areas of common interest. The Steering Committee agreed that WiSec would alternate holding its technical meetings between the US and Europe, at least for the near future. Of course, we hope that increasing participation from Asia will enable us to extend our meeting venues to include Asia as well.
Continuous Time State Space Model Identification Using Closed-Loop Data
Authors: Rosmiwati Mohd-Mokhtar, Liuping Wang
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

This paper focuses on identifying a continuous time state space model for a system operating in closed-loop, using a subspace method based on error-in-variables (EIV) models. The proposed approach in this paper extends the existing methods in the discrete-time systems to continuous-time systems where the Laguerre filters are used in the identification procedure. Furthermore, to meet the requirement for continuous time model and to remain filter causality, the choice of instrumental variable is based on the future horizon variables. Monte-Carlo simulation result is presented to verify the consistency of the estimated models. In addition, the proposed model is also demonstrated to identify the real closed-loop data of magnetic bearing systems.
Improving wireless privacy with an identifier-free link layer protocol
Authors: Ben Greenstein, Damon McCoy, Jeffrey Pang, Tadayoshi Kohno, Srinivasan Seshan, David Wetherall
Venue: Proceeding of the 6th international conference on Mobile systems, applications, and services (2008)

We present the design and evaluation of an 802.11-like wireless link layer protocol that obfuscates all transmitted bits to increase privacy. This includes explicit identifiers such as MAC addresses, the contents of management messages, and other protocol fields that the existing 802.11 protocol relies on to be sent in the clear. By obscuring these fields, we greatly increase the difficulty of identifying or profiling users from their transmissions in ways that are otherwise straightforward. Our design, called SlyFi, is nearly as efficient as existing schemes such as WPA for discovery, link setup, and data delivery despite its heightened protections; transmission requires only symmetric key encryption and reception requires a table lookup followed by symmetric key decryption. Experiments using our implementation on Atheros 802.11 drivers show that SlyFi can discover and associate with networks faster than 802.11 using WPA-PSK. The overhead SlyFi introduces in packet delivery is only slightly higher than that added by WPA-CCMP encryption (10% vs. 3% decrease in throughput).
Modified theories of laminar flow around a rigid cylinder and flow outside and inside a liquid cylinder in uniform and counterflow gaseous jets
Authors: Siavash H. Sohrab
Venue: Proceedings of the 7th WSEAS International Conference on Applied Mathematics (2005)

The scale-invariant forms of conservation equations in reactive fields are described. The modified form of the Helmholtz vorticity equation is solved to determine laminar flow outside a rigid cylinder and flow inside and outside of a cylindrical liquid body in a uniform gaseous stream or at the stagnation-point of two symmetric gaseous planar counterflow jets. For the former problem, a modified solution for flow around rigid cylinder is presented that resolves the Stokes paradox and is harmonious with the Oseen's classical solution. For the latter problem, parallel to the classical Hill spherical vortex, the solution describing two cylindrical vortex lines is presented. Also, the stream functions representing flow within two concentric immiscible liquid cylinders in uniform or planar counterflow gaseous streams are presented.
Fast parameterized matching with q-grams
Authors: Leena Salmela, Jorma Tarhio
Venue: Journal of Discrete Algorithms (2008)

Two strings parameterize match if there is a bijection defined on the alphabet that transforms the first string character by character into the second string. The problem of finding all parameterized matches of a pattern in a text has been studied in both one and two dimensions but the research has been centered on developing algorithms with good worst-case performance. We present algorithms that solve this problem in sublinear time on average for moderately repetitive patterns.
NP trees and Carnap's modal logic
Authors: G. Gottlob
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

We consider problems and complexity classes definable by interdependent queries to an oracle in NP. How the queries depend on each other is specified by a directed graph G. We first study the class of problems where G is a general dag and show that this class coincides with /spl Delta//sub 2//sup P/. We then consider the class where G is a tree. Our main result states that this class is identical to P/sup NP/ [O(log n)], the class of problems solvable in polynomial time with a logarithmic number of queries to an oracle in NP. Using this result we show that the following problems are all P/sup NP/[O(logn)] complete: validity-checking of formulas in Carnap's modal logic, checking whether a formula is almost surely valid over finite structures in modal logics K, T, and S4, and checking whether a formula belongs to the stable set of beliefs generated by a propositional theory.
Global optimization, level set dynamics, incomplete sensitivity and regularity control
Authors: B. Mohammadi
Venue: International Journal of Computational Fluid Dynamics (2007)

We aim to optimize aerodynamic shapes using an incomplete sensitivity concept and regularization (projection) when control parameters are characteristic functions as in level set and immersed boundary approaches. The projection operator is also used to define a rotation operator over the unit sphere in the admissible space to improve sensitivity definition from the incomplete sensitivity. Hence, the direction of descent is found as a solution of a one-dimensional minimization problem. This is suitable for large dimension control spaces, avoids an adjoint formulation and is particularly interesting for sensitivity evaluation for black-box solvers. The approach is applied to various shape design in supersonic regime with level sets.
The complete root classification of a parametric polynomial on an interval
Authors: Songxin Liang, David J. Jeffrey, Marc Moreno Maza
Venue: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (2008)

Given a real parametric polynomial p(x) and an interval (a,b) ⊂ R, the Complete Root Classification (CRC) of p(x) on (a,b) is a collection of all possible cases of its root classification on (a,b), together with the conditions its coefficients must satisfy for each case. In this paper, a new algorithm is proposed for the automatic computation of the complete root classification of a parametric polynomial on an interval. As a direct application, the new algorithm is applied to some real quantifier elimination problems.
Dynamics of the difference equation xn+1=xn+pxn-kxn+q
Authors: M. Jaberi Douraki, Mehdi Dehghan, Javad Mashreghi
Venue: Computers Mathematics with Applications (2008)

We study the invariant interval, the character of semicycles, the global stability, and the boundedness of the difference equation x"n"+"1=x"n+px"n"-"kx"n+q,n>=0, where the initial conditions x"-"k,...,x"-"1,x"0 are nonnegative, and p,q>0.
Performance results for digital subscriber line precoders
Authors: Phil Whiting, Alexei Ashikhmin, Sem Borst, Jean Jennen, Gerhard Kramer, Adriaan J. de Lind van Wijngaarden, Miroslav Živković
Venue: Bell Labs Technical Journal (2008)

Performance results are presented for digital subscriber line (DSL) precoders, also known as dynamic spectrum management (DSM) level 3, in terms of improvement of signal-to-noise ratio (SNR) and achievable bit rates under the very high speed digital subscriber line 2 (VDSL2) standard. Simulations were conducted using channel coefficients obtained from both empirical models and line measurements. The performance impact of various key factors is examined, including the number of lines, line lengths, frequency range, precoder design, channel measurement accuracy, and implementation accuracy (quantization errors). The results provide estimates of the achievable rate gains and offer guidance for the design and implementation of DSL precoders. &copy; 2008 Alcatel-Lucent.
RBFNN Siding Mode Control Based on Semi-Physical Simulation Platform
Authors: Peng Yang, Pinjie Liu, Yan Zhang, Xiaolei Wang
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Based on MATLAB RTW semi-physical simulation platform, a siding mode control algorithm is presented for a kind of uncertain time-delay system. Through a particular linear transformation, the original uncertain time-delay system was first transformed into a delay-free system. Based on the transformed system, a design method of optimal sliding mode with a quadratic performance index minimized was proposed. An appropriate control law which is approached by a RBFN and the weight of the network is tuned on line using adaptive algorithm to force the system states to reach the sliding manifold in finite time. Simulation results show the efficiency and superiority of the proposed method.
Convergence of an online gradient algorithm with penalty for two-layer neural networks
Authors: Hongmei Shao, Wei Wu, Lijun Liu
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

Online gradient algorithm has been widely used as a learning algorithm for feedforward neural networks training. Penalty is a common and popular method for improving the generalization performance of networks. In this paper, a convergence theorem is proved for the online gradient learning algorithm with penalty, a term proportional to the magnitude of the weights. The monotonicity of the error function with such a penalty term is guaranteed during the training iteration. A key point of the proofs is the boundedness of the network weights, which is also a desired rewarding of adding penalty.
Ms Pac-Man competition
Authors: Simon M. Lucas
Venue: ACM SIGEVOlution (2007)

IEEE WCCI 2008 in Hong Kong played host to the latest Ms Pac-Man competition, organised by Simon Lucas as an activity of the IEEE CIS Games Technical Committee. The competition attracted 11 entries from teams all around the world, with the winning entry by Alan Fitzgerald, Peter Kemeraitis, and Clare Bates Congdon from the University of Southern Maine (USM) achieving a high-score of 15,970.
A Statistical Approach to Characterizing and Testing Functionalized Nanowires
Authors: James Dardig, Haralampos-G Stratigopoulos, Eric Stern, Mark Reed, Yiorgos Makris
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

Unlike the top-down photolithographic CMOS VLSI process, cost-effective bulk fabrication of nano devices calls for a bottom-up approach, generally called self-assembly. Self-assembly, however, inherently lends itself to innate disparities in the structure of nominally identical nanodevices and, consequently, wide inter-device variance in their functionality. As a result, nanodevice characterization and testing calls for a slow and tedious procedure involving a large number of measurements. In this work, we discuss a statistical approach which learns measurement correlations from a small set of fully characterized nanodevices and utilizes the extracted knowledge to simplify the process for the rest of thenanodevices. More specifically, we employ various machine-learning methods which rely on a small subset of measurements to i) predict the performances of a fabricated nanodevice, ii)decide whether a nanodevice passes or fails a given set of specifications, andiii) bin a nanodevice with regards to several sets of increasingly strict specifications. The proposed methods are demonstrated and their effectiveness is assessed, within the context of nanowire-based chemical sensing, using a set of fabricated and fully characterized nanowires.
A COMPUTATIONAL MODEL OF AN INTELLIGENT NARRATOR FOR INTERACTIVE NARRATIVES
Authors: Nicolas Szilas
Venue: Applied Artificial Intelligence (2007)

One goal of interactive narrative and drama is to create an experience while utilizing the computer where the user is one main character in the story. This goal raises a set of practical and theoretical challenges to artificial intelligence. In particular, an intelligent narrator has to dynamically maintain a satisfactory storyline and adapt to the user intervention. After reviewing the existing approaches to interactive drama, an original model is described, based on several theories on narrative. This model is based on a rule-based component for the generation of meaningful narrative actions and on a model of the user for the ranking of these actions and the action selection. A simple but authorable text generation system is also described, for the display of the actions on the computer. The system is implemented on a real-size scenario and experimental results are discussed. We conclude by discussing the possibility of a wider application of our approach within the field of AI.
Adaptive p-posterior mixture-model kernels for multiple instance learning
Authors: Hua-Yan Wang, Qiang Yang, Hongbin Zha
Venue: Proceedings of the 25th international conference on Machine learning (2008)

In multiple instance learning (MIL), how the instances determine the bag-labels is an essential issue, both algorithmically and intrinsically. In this paper, we show that the mechanism of how the instances determine the bag-labels is different for different application domains, and does not necessarily obey the traditional assumptions of MIL. We therefore propose an adaptive framework for MIL that adapts to different application domains by learning the domain-specific mechanisms merely from labeled bags. Our approach is especially attractive when we are encountered with novel application domains, for which the mechanisms may be different and unknown. Specifically, we exploit mixture models to represent the composition of each bag and an adaptable kernel function to represent the relationship between the bags. We validate on synthetic MIL datasets that the kernel function automatically adapts to different mechanisms of how the instances determine the bag-labels. We also compare our approach with state-of-the-art MIL techniques on real-world benchmark datasets.
Watermarking: A New Approach
Authors: Imad Muhi El-Ddin, Hedley Morris, Mohammad Eyadat
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

In this paper, we propose a scheme in which the watermarking is carried out in the spatial domain using robust feature points to aid in its embedding and extraction. Specific feature points are not only used to embed the information, but also act as a geometrical reference. We propose here a new algorithm that uses the Scale Invariant Feature Transform (SIFT), Shape Theory, and Projective Area-Invariants. The Projective Area-Invariants Transformation allows an image with a distinguished triangle to be put in correspondence with a an affine invariant universal image. The new algorithm is based on embedding the watermark in region around robust feature points and using shape theory to remediate the effects of affine attacks
Grid computing to make viable the content based medical image retrieval through the image registration techniques
Authors: Marcelo Costa Oliveira, Walfredo Cirne, José Flávio Mendes Junior, Paulo Mazzoncini de Azevedo Marques
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

The content-based image retrieval (CBIR) has great interest of the medical community, because it is capable of retrieval similar images stored in servers that have known pathologies. However, an efficient and reliable CBIR solution has not been achieved yet, due to the complexity of the medical image and the great volume they represent. This work proposes a new methodology based on higher processing provided by Grid Computing technology to achieve the CBIR using the registration algorithms. The registration procedure use two metrics, square difference metric (SDM) and cross correlation (CC). Both metrics showed higher efficiency, SDM obtained precision average of 0.83% (breast image) and 0.94% (head image), the CC showed precision of 0.81% (breast) and 0.52% (head). The higher computational cost related to the registration algorithms was amortized by Grid Computing, that was capable of ensure data secure and represent a low cost solution to small clinics and public hospitals. Grid technologies open new opportunities to investigate the contribution on applying the registration algorithms to CBIR and new advances are expected.
RDP technique: a practice to customize xp
Authors: Mehdi Mirakhorli, Abdorrahman Khanipour Rad, Fereidoon Shams, Maryam Pazoki, Abbas Mirakhorli
Venue: Proceedings of the 2008 international workshop on Scrutinizing agile practices or shoot-out at the agile corral (2008)

Although software projects can benefit from XP practices, but all projects can not directly adopt it. Characteristics of some projects make it difficult to use XP thoroughly; therefore, we need to tailor XP to the local conditions, contexts and the size of these projects. In this article we will describe why defining XP by its practices has problem and argue why it should be defined by its rules. Then we precisely redefine rules of XP. With the belief that XP's practices do not define XP and XP is defined by its rules, we propose RDP practice which is a practical technique for tailoring XP. Finally we conducted an industrial case study. Our goal was to understand the practical feasibility of proposed practice.
Beacon Frame Spoofing Attack Detection in IEEE 802.11 Networks
Authors: Asier Martínez, Urko Zurutuza, Roberto Uribeetxeberria, Miguel Fernández, Jesus Lizarraga, Ainhoa Serna, Iñaki Vélez
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

A great variety of well-known attacks exist for the IEEE 802.11 protocol. The lack of mechanisms for management frame authentication and the complexity of the protocol itself have derived into a considerable number of denial of service and identity spoofing attacks. As most denial of service attacks are based on spoofing of MAC addresses, spoofed frame detection schemes have gained attentions. Currently the most efficient techniques to detect this kind of attacks are based on the creation of profiles for the wireless nodes and behavior based protocol anomaly detection. However, these techniques tend to generate too many of false positives. This is caused by the unstable nature of the wireless medium and also because of the difficulty to model the behaviour of the diverse implementations from different manufacturers. One way to reduce false positives is to combine different techniques to carry out the analysis. We propose a novel method that identifies the impersonation of certain management frames, which helps to reduce the number of false positives within other existing MAC spoofing detection techniques.
Visualizing the evolution of a web-based social network
Authors: Beatriz Prieto, Fernando Tricas, Juan J. Merelo, Antonio Mora, Alberto Prieto
Venue: Journal of Network and Computer Applications (2008)

Weblogs are dynamic websites updated via easy-to-use content management systems and organized as a set of chronologically ordered stories, frequently built around a link or including links to other weblogs. Since they are managed by individuals, their links tend to mirror or, in some cases, establish new types of social relations, thereby creating a social network. Studying the evolution of this network allows the discovery of emerging social structures and their growth trends. In this paper, we demonstrate the advantages of using the self-organizing maps (SOM) to visualize the evolution of a social network formed by a set of blogs, from their beginning to their current state. By observing the position a weblog is mapped to, it is easy to see what communities it belongs to nowadays, and how and when it became a part of those communities. The proposed procedure gives some insight on how communities are formed and have evolved. In this study, we apply this method to Blogalia, a blog-hosting site from which we have obtained a complete set of data and, by using SOM projections, we have drawn some conclusions on what drives the evolution of its implicit social network.
Language constrained graph problems: a microcosm of engineering research and development
Authors: Phillip G. Bradford
Venue: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications (2008)

This paper starts by discussing an algorithmic view of labeled path problems. In particular, we apply Seidel's all-pairs shortest-path algorithm for undirected and unweighted graphs to a basic problem in labeled paths. Seidel's algorithm is applied to find unlabeled paths between any pairs of nodes in a labeled graph whose associated context-free grammar G can generate the empty string ε. Our result is a corollary of Seidel's algorithm. Then we mention a number of diverse labeled path applications. Labeled path problems are then used to demonstrate some concepts and insights about research and development. We briefly discuss their place in building our intellectual infrastructure as well as their potential contributions to modern business and entrepreneurship. We attempt to give a broad perspective to research and development from their intellectual foundations to their place in modern business and entrepreneurship. It serves as a high-level sketch rather than a comprehensive discussion.