ppxscal/embedding_network huggingface dataset:
Large-scale IP traceback in high-speed internet: practical techniques and information-theoretic foundation
Authors: Minho Sung, Jun Xu, Jun Li, Li Li
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

Tracing attack packets to their sources, known as IP traceback, is an important step to counter distributed denial-of-service (DDoS) attacks. In this paper, we propose a novel packet logging based (i.e., hash-based) traceback scheme that requires an order of magnitude smaller processing and storage cost than the hash-based scheme proposed by Snoeren et al. [1], thereby being able to scalable to much higher link speed (e.g., OC-768). The base-line idea of our approach is to sample and log a small percentage (e.g., 3.3%) of packets. The challenge of this low sampling rate is that much more sophisticated techniques need to be used for traceback. Our solution is to construct the attack tree using the correlation between the attack packets sampled by neighboring routers. The scheme using naive independent random sampling does not perform well due to the low correlation between the packets sampled by neighboring routers. We invent a sampling scheme that improves this correlation and the overall efficiency significantly. Another major contribution of this work is that we introduce a novel information-theoretic framework for our traceback scheme to answer important questions on system parameter tuning and the fundamental tradeoff between the resource used for traceback and the traceback accuracy. Simulation results based on real-world network topologies (e.g., Skitter) match very well with results from the information-theoretic analysis. The simulation results also demonstrate that our traceback scheme can achieve high accuracy, and scale very well to a large number of attackers (e.g., 5000+).
The Booze Cruise: Impaired Driving in Virtual Spaces
Authors: James R. Parker, Nathan Sorenson, Nooshin Esmaeili, Ronan Sicre, Phillipa Gil, Vishal Kochlar, Lori Shyba, John Heerema
Venue: IEEE Computer Graphics and Applications (2009)

Canada's first course in serious game development was a joint course of the Fine Arts and Computer Science departments. For the course project, students designed the Booze Cruise, a game that shows how difficult it is to drive while impaired. The authors summarize the design process and public response.
Towards Suspicious Behavior Discovery in Video Surveillance System
Authors: Yingjie Li, Yixin Yin
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Video surveillance systems are becoming common in commercial, industrial, and residential environments. The systems in used are constructed mainly by hard devices with no or very few soft intelligence. It is difficult for human to recognize important events as they happening and to control over unwilling situations by staring at the screens all the time. Soft intelligence to identify human behaviors in the surveillance systems is expected. A system’s architecture for this goal is presented in this paper. Bottom-up processing methods and top-down design schemes are integrated in the architecture. The integration may increase the accuracy of relevance algorithms and reduce the computing cost. The feasibility of the system is assured.
Exploring similarities and differences between online and offline friendships: The role of attachment style
Authors: Vanessa M. Buote, Eileen Wood, Michael Pratt
Venue: Computers in Human Behavior (2009)

The present study merges the fields of attachment and friendships and compares these in online and offline environments. Although currently we know a great deal about the importance of friendships and attachments for healthy development, there is no research to guide our understanding of how attachment style and friendship characteristics are evidenced in online contexts. Participants completed surveys to assess attachment style, friendships (online and offline), as well as interactions with friends and friendship quality. The extent to which individuals sought out online friends did not differ as a function of attachment style. Friendship quality differed as function of attachment style, while differences among attachment styles for other friendship characteristics resulted only when context (online versus offline) was simultaneously considered.
Discrete stochastic optimization using linear interpolation
Authors: Honggang Wang, Bruce W. Schmeiser
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

We consider discrete stochastic optimization problems where the objective function can only be estimated by a simulation oracle; the oracle is defined only at the discrete points. We propose a method using continuous search with simplex interpolation to solve a wide class of problems. A retrospective framework provides a sequence of deterministic approximating problems that can be solved using continuous optimization techniques that guarantee desirable convergence properties. Numerical experiments show that our method finds the optimal solutions for discrete stochastic optimization problems orders of magnitude faster than existing random search algorithms.
Evaluation of the Syntactic Annotation in EPEC, the Reference Corpus for the Processing of Basque
Authors: Larraitz Uria, Ainara Estarrona, Izaskun Aldezabal, Maria Jesús Aranzabe, Arantza Díaz De Ilarraza, Mikel Iruskieta
Venue: Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing (2009)

The aim of this work is to evaluate the dependency-based annotation of EPEC (the Reference Corpus for the Processing of Basque) by means of an experiment: two annotators have syntactically tagged a sample of the mentioned corpus in order to evaluate the agreement-rate between them and to identify those issues that have to be improved in the syntactic annotation process. In this article we present the quantitative and qualitative results of this evaluation.
Success criteria for the next generation of space based multimedia systems[1]This paper was presented at the 49th IAF Congress in Melbourne, Australia, September 1998.
Authors: E. Elizondo, K. Savatiel, E. Ashford
Venue: Space Communications (1998)

It has been almost three years since the great Geostationary Earth Orbit (GEO) Ka-band filing rush concluded at the FCC. The majority of filers have gone on to register their systems with the ITU, creating the most congested new Spectrum band at system startup that the world has ever seen. However, for all the hype, none of the GEO systems are thought yet to have begun to bend metal. All appear consumed with the requirement to find partners with whom to share the business risks, costs and rewards. This paper will examine the current state of progress of Ka-band systems. Assessments will be made with respect to criteria such as: announced target markets and their appropriateness for the technology proposed; availability of desired technology to enable these systems to achieve their stated goals and a realistic assessment of when these technologies will be deployed; the availability of alternative terrestrial systems to address the same applications and their impact on the GEO Ka-band system target markets; and regulatory issues and paths to insure commercial access.
IPv6 Security Challenges
Authors: Carlos E. Caicedo, James B. D. Joshi, Summit R. Tuladhar
Venue: Computer (2009)

IPv6, the new version of the Internet Protocol, has been developed to provide new services and to support the Internet's growth. An overview of the key security issues outlines the challenges in deploying and transitioning to IPv6.
Towards a New Image-Based Spectrogram Segmentation Speech Coder Optimised for Intelligibility
Authors: Keith A. Jellyman, Nicholas W. Evans, W. M. Liu, J. S. Mason
Venue: Proceedings of the 15th International Multimedia Modeling Conference on Advances in Multimedia Modeling (2009)

Speech intelligibility is the very essence of communications. When high noise can degrade a speech signal to the threshold of intelligibility, for example in mobile and military applications, introducing further degradation by a speech coder could prove critical. This paper investigates concepts towards a new speech coder that draws upon the field of image processing in a new multimedia approach. The coder is based on a spectrogram segmentation image processing procedure. The design criterion is for minimal intelligibility loss in high noise, as opposed to the conventional quality criterion, and the bit rate must be reasonable. First phase intelligibility listening test results assessing its potential alongside six standard coders are reported. Experimental results show the robustness of the LD-CELP coder, and the potential of the new coder with particularly good results in car noise conditions below -4.0dB.
Goal-Driven Alignment of Services and Business Requirements
Authors: Andreas Gehlert, Nadine Bramsiepe, Klaus Pohl
Venue: Proceedings of the 2008 International Workshop on Service-Oriented Computing Consequences for Engineering Requirements (2008)

The independence of services in service oriented architectures allows different providers to provide different business functionalities. As services can be used independently from each other the requirements engineer is able to quickly align the requirements closely to the current service provision. The organisation, which achieves this close alignment benefits optimally from the current service provision. In this paper we propose a requirements engineering approach based on goal model comparison, which allows finding services for given requirements and which facilitates the adjustment of requirements to current service provision. The approach rests on the idea of describing requirements and services with Tropos goal models and to use model comparison techniques to find services and to adjust the requirements to fit these services.
An activity recognition system for mobile phones
Authors: Norbert Györbíró, Ákos Fábián, Gergely Hományi
Venue: Mobile Networks and Applications (2009)

We present a novel system that recognizes and records the motional activities of a person using a mobile phone. Wireless sensors measuring the intensity of motions are attached to body parts of the user. Sensory data is collected by a mobile application that recognizes prelearnt activities in real-time. For efficient motion pattern recognition of gestures and postures, feed-forward backpropagation neural networks are adopted. The design and implementation of the system are presented along with the records of our experiences. Results show high recognition rates for distinguishing among six different motion patterns. The recognized activity can be used as an additional retrieval key in an extensive mobile memory recording and sharing project. Power consumption measurements of the wireless communication and the recognition algorithm are provided to characterize the resource requirements of the system.
Bootstrapping long memory tests: Some Monte Carlo results
Authors: A. Murphy, M. Izzeldin
Venue: Computational Statistics Data Analysis (2009)

The bootstrapped size and power properties of six long memory tests-the modified R/S, KPSS, V/S, GPH, Robinson's H@^ and the recently proposed S@^"k tests-are investigated. Even in samples of size 100, the moving block bootstrap controls the empirical size of the tests in the DGPs examined. The H@^ test appears to be the most powerful. Moreover, compared with asymptotic tests, the bootstrap tests suffer little loss of power against fractionally integrated processes in samples with 250 or more observations. This is true both for distributions with heavy tails and with stochastic volatility.
Linear codes for high payload steganography
Authors: Mahdad Khatirinejad, Petr Lisonk
Venue: Discrete Applied Mathematics (2009)

Steganography is concerned with communicating hidden messages in such a way that no one apart from the sender and the intended recipient can detect the very existence of the message. We study the syndrome coding method (sometimes also called the ''matrix embedding method''), which uses a linear code as an ingredient. Among all codes of a fixed block length and fixed dimension (and thus of a fixed information rate), an optimal code is one that makes it most difficult for an eavesdropper to detect the presence of the hidden message. We show that the average distance to code is the appropriate concept that replaces the covering radius for this particular application. We completely classify the optimal codes in the cases when the linear code used in the syndrome coding method is a one- or two-dimensional code over GF(2). In the steganography application this translates to cases when the code carries a high payload (has a high information rate).
On Superlinear PCG Methods for FDM Discretizations of Convection-Diffusion Equations
Authors: János Karátson, Tamás Kurics
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

The numerical solution of linear convection-diffusion equations is considered. Finite difference discretization leads to an algebraic system solved by a suitable preconditioned CG method, where the preconditioning approach is based on equivalent operators. Our goal is to study the superlinear convergence of the preconditioned CG iteration and to find mesh independent behaviour on a model problem. This is an analogue of previous results where FEM discretization was used.
On the properties of an additive increase rate accelerator
Authors: Ioannis Psaras, Vassilis Tsaoussidis
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

We propose AIRA, an Additive Increase Rate Accelerator. AIRA extends AIMD functionality towards adaptive increase rates, depending on the level of network contention and bandwidth availability. In this context, acceleration grows when resource availability is detected by goodput/throughput measurements and slows down when increased throughput does not translate into increased goodput as well. Thus, the gap between throughput and goodput determines the behavior of the rate accelerator. We study the properties of the extended model and propose, based on analysis and simulation, appropriate rate decrease and increase rules. Furthermore, we study conditional rules to guarantee operational success even in the presence of symptomatic, extra-ordinary events. We show that analytical rules can be derived for accelerating, either positively or negatively, the increase rate of AIMD in accordance with network dynamics. Indeed, we find that the ''blind'', fixed Additive Increase rule can become an obstacle for the performance of TCP, especially when contention increases. Instead, sophisticated, contention-aware additive increase rates may preserve system stability and reduce retransmission effort, without reducing the goodput performance of TCP.
Research and Design of Digital Synthesizer Based on MATLAB
Authors: Chunjing Mao, Yong Guan, Yongmei Liu
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

The methods of FM synthesis and sampling intervals synthesis can only focus on one of the two indexes which named Timbre and design-flexibility in the design of digital-synthesis. Therefore, it based on the theory of digital music, and to combining the advantages of both methods to try a new design method of digital-synthesis; and to realize the design by time-domain waveform envelope processing and frequency-domain modulation with the tool MATLAB. By the experimental analysis, Synthesis can sound not only better performance, but also have a certain flexibility in design and application; as small requirement in the size of Wavetable, also providing a reference to the designing of digital synthesizer for portable and small equipment.
HeDGE: Hybrid Dataflow Graph Execution in the Issue Logic
Authors: Suriya Subramanian, Kathryn S. Mckinley
Venue: Proceedings of the 4th International Conference on High Performance Embedded Architectures and Compilers (2008)

Exposing more instruction-level parallelism in out-of-order superscalar processors requires increasing the number of dynamic in-flight instructions. However, large instruction windows increase power consumption and latency in the issue logic. We propose a design called Hybrid Dataflow Graph Execution (HeDGE) for conventional Instruction Set Architectures (ISAs). HeDGE explicitly maintains dependences between instructions in the issue window by modifying the issue, register renaming, and wakeup logic. The HeDGE wakeup logic notifies only consumer instructions when data values arrive. Explicit consumer encoding naturally leads to the use of Random Access Memory (RAM) instead of Content Addressable Memory (CAM) needed for broadcast. HeDGE is distinguished from prior approaches in part because it dynamically inserts forwarding instructions. Although these additional instructions degrade performance by an average of 3 to 17% for SPEC C and Fortran benchmarks and 1.5% to 8% for DaCapo Java benchmarks, they enable energy efficient execution in large instruction windows. The HeDGE RAM-based instruction window consumes on average 98% less energy than a conventional CAM as modeled in CACTI for 70nm technology. In conventional designs, this structure contributes 7 to 20% to total energy consumption. HeDGE allows us to achieve power and energy gains by using RAMs in the issue logic while maintaining a conventional instruction set.
Semantic Foraging in Defined Contexts
Authors: Duncan Carmichael, Bonnie Swart
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

An experimental prototype system was created and used to investigate how information relevant to analyst queries, and constrained by a contextual model, can be found over a large information space. Agents employing the ant model sift through documents quickly using a transductive support machine classifier and return those meeting a classifier which is constantly refined through feedback from semantic information extraction to a knowledge base. An ontology-informed extraction is performed on returned documents; an objective function then evaluates how well each document fulfilled the queries and this information is used to create a new classifier for each query. In numerous trials on a static corpus, recall and precision of the classifiers was consistently above 92%. Semantic results have not been quantified but appear highly promising.
Eigen-domain Relighting of Face Images for Illumination-invariant Face Verification
Authors: Vinod Pathangay, Sukhendu Das
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

In this paper, we propose a method to exploit the uniqueness in the illumination variations on the face image of a subject for face verification. Using the 3D wireframe model of a face, illumination variations are synthetically generated by rendering it with texture to produce virtual face images. When these virtual and a set of real face images are transformed in eigenspace, they form two separate clusters for the virtual and real-world faces. In addition, the cluster corresponding to set of virtual faces for any subject is more compact compared to real face image cluster. Therefore, we take the virtual face cluster as the reference and find a transformation that takes real face features closer to the reference virtual face cluster. In this paper, we propose subject-specific relighting transformations that relight the real face feature in eigenspace into a more compact virtual face feature cluster. This transformation is computed and stored during training. During testing, subject-specific transformations are applied on the eigen-feature of the realface image before computing the distance from the reference cluster of the claimed subject. We report verification results on frontal face images with various lighting directions of all 68 subjects of the PIE database, and show using receiver operating characteristic (ROC) curves and equal error rates(EER) that the proposed subject-specific eigen-relighting gives significantly better face verification performance when compared with a baseline system without eigen-relighting.
Methods as Parameters: A Preprocessing Approach to Higher Order in Java
Authors: Marco Bellia, M. Eugenia Occhiuto
Venue: Fundamenta Informaticae (2008)

The paper investigates the use of preprocessing in adding higher order functionalities to Java, that is in passing methods to other methods. The approach is based on a mechanism which offers a restricted, disciplined, form of abstraction that is suitable to the integration of high order and object oriented programming. We show how this integration can be exploited in programming through the development of an example. Then, we discuss how the expressive power of the language is improved. A new syntax is introduced for formal and actual parameters, hence the paper defines a translation that, at preprocessing time, maps programs of the extended language into programs of ordinary Java.
The benefits of using a walking interface to navigate virtual environments
Authors: Roy A. Ruddle, Simon Lessels
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2009)

Navigation is the most common interactive task performed in three-dimensional virtual environments (VEs), but it is also a task that users often find difficult. We investigated how body-based information about the translational and rotational components of movement helped participants to perform a navigational search task (finding targets hidden inside boxes in a room-sized space). When participants physically walked around the VE while viewing it on a head-mounted display (HMD), they then performed 90&percnt; of trials perfectly, comparable to participants who had performed an equivalent task in the real world during a previous study. By contrast, participants performed less than 50&percnt; of trials perfectly if they used a tethered HMD (move by physically turning but pressing a button to translate) or a desktop display (no body-based information). This is the most complex navigational task in which a real-world level of performance has been achieved in a VE. Behavioral data indicates that both translational and rotational body-based information are required to accurately update one's position during navigation, and participants who walked tended to avoid obstacles, even though collision detection was not implemented and feedback not provided. A walking interface would bring immediate benefits to a number of VE applications.
Optimal nonlinear predictive visual servoing of a wheeled mobile robot
Authors: Ying-Shing Shiao, Jui-Liang Yang, Ding-Tsair Su
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

This paper develops methodologies and techniques for control architecture design, path tracking laws and posture estimation of a vision -based wheeled mobile robot (WMR). To solve the problem of position/orientation tracking control of the WMR, two kinematical optimal nonlinear predictive control laws are developed to manipulate the vehicle to asymptotically follow the desired trajectories. A Kalman filtering scheme is used to reduce the bad effect of the imagine nose, thereby improving the accuracy of pose estimation. The experimental system is composed of a wireless RS232 modem, a DSP -based controller for the wheeled mobile robot and a vision system with a host computer. A computation -effective and high-performance DSP-based controller is constructed for executing the developed sophisticated path tracking laws. Simulation and experimental results are included to illustrate the feasibility and effectiveness of the proposed control laws.