ppxscal/embedding_network huggingface dataset:
Safety checking of kernel extensions
Authors: Craig Metz
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

There are many places in operating systems today where extending the running kernel with small and fast extensions is an interesting thing to do. For example, the Berkeley Packet Filter (BPF) allows code for a virtual machine to be uploaded intoa running kernel and executed at packet reception, allowing fairly arbitrary filtering of packets before they cross the expensive kernel to user interface. Whatever mechanism is used needs to provide some reasonable guarantees about the safety of the resulting code, which makes this problem complex. This paper describes a simple x86 bytecode verifier that is intended to be used to verify that a small program that is to be loaded obeys a reasonable safety policy. For program constructs that it is able to reason about, it can verify that code does not execute privileged instructions, only accesses known memory locations, and terminates. It cannot reason about arbitrary programs, but can reason about simple programs and developers that know the prover's limitations can write their code to be recognizable by the verifier. The contribution of this work is to show that a very limited prover can operate on native machine code and can efficiently reason about a small but still interesting set of programs.
Web Service = E + F + I
Authors: Emad Bataineh, Zakaria Maamar, Djamal Benslimane, Chirine Ghedira
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

This paper presents the E,F,I approach for the development of a contextual definition of a Web service. E, F, and I stand for Environment, Feature, and Interaction, respectively. By default, aWeb service resides in an environment E where it acts and reacts. In this environment E, the Web service exposes its features F to peers or other components for awareness and visibility purposes. Finally, the Web service gets engaged with peers in common activities by coordinating their interactions I. The contextual definition of a Web service is established using the components that make up each dimension of the E,F,I approach.
Classifying rotated textures using wavelet packet signatures
Authors: Moon-Chuen Lee
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

This paper proposes a novel approach to the classification of rotated texture images. The proposed classification method involves decomposing a texture image with a family of real orthonormal wavelet bases for different levels, computing the wavelet packet coefficients, and computing the energy signatures using the wavelet packet coefficients. Such energy signatures are sorted and used as a feature for texture image classification. We employ a Mahalanobis distance classifier to classify a set of twenty distinct natural textures selected from the Brodatz album. Experimental results, based on a large sample data set having different orientations, show that the proposed method outperforms other methods which may perform well in the classification of texture images having the same orientation.
An Online Community as a New Tribalism: The World of Warcraft
Authors: Thomas W. Brignall,  III, Thomas L. Van Valey
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Massive, multiplayer online role-playing games foster rich social environments. Within the game, players can interact with other players, make friends, create and cultivate new online forms of community. Using participant observation and content analysis approaches, this study examines the World of Warcraft as an online community, and investigates the degree to which it exhibits characteristics of a new tribalism.
Gait Analysis For Human Identification Through Manifold Learning and HMM
Authors: Ming-Hsu Cheng, Meng-Fen Ho, Chung-Lin Huang
Venue: Proceedings of the IEEE Workshop on Motion and Video Computing (2007)

With the increasing demands of visual surveillance systems, human identification at a distance has gained more interest. Gait is often used as an unobtrusive biometric offering the possibility to identify individuals at a distance without any interaction or co-operation with the subject. This paper presents a novel effectively method for automatic viewpoint and person identification by using only the sequence of gait silhouette. The gait silhouettes are nonlinearly transformed into low dimensional embedding and the dynamics in time-series images are modeled by HMM in the corresponding embedding space. The experimental results demonstrate that the proposed algorithm is an encouraging progress for automatic human identification.
Integration Soft Computing Approach to Network Security
Authors: Surat Srinoy
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

Computer security is defined as the protection of computing system against threats to confidentiality, integrity, and availability. Due to increasing incidents of cyber attacks, building effective intrusion detection systems are essential for protecting information systems security. It is an important issue for the security of network to detect new intrusion attack and also to increase the detection rates and reduce false positive rates in this area. Lacking a distinctive boundary definition among normal and abnormal datasets, discriminating the normal and abnormal behaviors seems too much complex. This paper proposes an integrating support vector machine and rough set for recognizing intrusion detection in computer network. Empirical results clearly show that support vector machine and rough set approach could play a major role for intrusion detection systems.
Content-based retrieval of video shot using the-improved nearest feature line method
Authors: Li Zhao
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

Shot-based classification and retrieval is very important for video database organization and access. We present a new approach: 'nearest feature line - NFL' used in shot retrieval. We look at key-frames in a shot as feature points to represent the shot in feature space. Lines connecting the feature points are further used to approximate the variations in the whole shot. The similarity between the query image and the shots in video database are measured by calculating the distance between the query image and the feature lines in feature space. To make it more suited to video data, we improved the original NFL method by adding constraints on the feature lines. Experimental results show that our improved NFL method is better than the traditional classification methods such as nearest neighbor (NN) and nearest center (NC).
Fast latent semantic indexing of spoken documents by using self-organizing maps
Authors: M. Kurimo
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

This paper describes a new latent semantic indexing (LSI) method for spoken audio documents. The framework is indexing broadcast news from radio and TV as a combination of large vocabulary continuous speech recognition (LVCSR), natural language processing (NLP) and information retrieval (IR). For indexing, the documents are presented as vectors of word counts, whose dimensionality is rapidly reduced by random mapping (RM). The obtained vectors are projected into the latent semantic subspace determined by SVD, where the vectors are then smoothed by a self-organizing map (SOM). The smoothing by the closest document clusters is important here, because the documents are often short and have a high word error rate (WER). As the clusters in the semantic subspace reflect the news topics, the SOMs provide an easy way to visualize the index and query results and to explore the database. Test results are reported for TREC's spoken document retrieval databases (www.idiap.ch/kurimo/thisl.html). The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Projective residual vector quantization and mapped residual pooling
Authors: R. P. Thomas
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

This paper points out two potential problems with residual vector quantization (RVQ): tree entanglement and non-projectiveness of the quantizer. The use of a boundary normalization mapping is proposed to pool all quantization residuals at a stage into identically-shaped regions, reducing or eliminating entanglement. Also, a reconstruction codebook is proposed to eliminate the non-projectiveness is proposed. Results are presented on both random and image data.
Single vehicle pickup and delivery with time windows: made to measure genetic encoding and operators
Authors: Manar I. Hosny, Christine L. Mumford
Venue: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation (2007)

To the best of our knowledge, only a few researchers have experimented with genetic algorithms (GAs) to tackle the single vehicle pickup and delivery problem with time windows, possibly due to the large number of constraints involved and the difficulty in handling them. In particular, there is the difficulty in designing an appropriate genetic representation and intelligent genetic operators that are able to transfer the ordering characteristic of the parents to the offspring, while preserving the feasibility of the solution. In this research, we will experiment with a genetic encoding and operators specially designed to deal with the problem in hand. We will present a duplicate gene encoding that guarantees the satisfaction of the the precedence constraint, between the pickup and the delivery requests, throughout the search. We aim to show that GAs, if guided by some problem-specific information, will be able to handle this hard problem and possibly other similarly highly constrained problems.
A Formal Model to Manage the InfiniBand Arbitration Tables Providing QoS
Authors: F. Alfaro, J. Sanchez, M. Menduina, J. Duato
Venue: IEEE Transactions on Computers (2007)

The InfiniBand Architecture (IBA) is an industry-standard architecture for server I/O and interprocessor communication. IBA enables Quality of Service (QoS) support with certain mechanisms. These mechanisms are basically the service levels, the virtual lanes and the table-based arbitration of those virtual lanes. In previous papers, we have examined these mechanisms and described how to apply them to the requirements requested by the applications. We have also tested our proposals showing that the applications achieve the level of QoS requested.In this paper, we present a formal model for the techniques previously proposed. According to this model each application needs a sequence of entries in the IBA arbitration tables based on its requirements. These requirements are related to the mean bandwidth needed and the maximum latency tolerated by the application. Specifically, each request requires a number of entries with a maximum separation between any consecutive pair. In order to manage the requests we propose certain algorithms and we prove some propositions and theorems showing that our method achieves a good behavior.
Business Continuity Plan Design
Authors: Richard J. Kepenach
Venue: Proceedings of the Second International Conference on Internet Monitoring and Protection (2007)

This paper identifies eight steps that a company should follow to begin the development of a business continuity plan. The plan was developed by documenting the process a large transportation company used to reinforce their continuity planning in the wake of the 2004 hurricane season. This research identifies typical questions to be asked of functional departments within the organization along with some more specific question examples for the departments. The paper identifies 13 potential projects and other recommendations found from the research.
Anomaly Detection Aiming Pro-Active Management of Computer Network Based on Digital Signature of Network Segment
Authors: Bruno Bogaz Zarpelão, Leonardo De Souza Mendes, Mario Lemes Proença,  Jr.
Venue: Journal of Network and Systems Management (2007)

Detecting anomalies accurately is fundamental to rapid diagnosis and repair of problems. This paper proposes a novel Anomaly detection system based on the comparison of real traffic and DSNS (Digital Signature of Network Segment), generated by BLGBA (Baseline for Automatic Backbone Management) model, within a hysteresis interval using the residual mean and on the correlation of the detected deviations. Extensive experimental results on real network servers confirmed that our system is able to detect anomalies on the monitored devices, avoiding the high false alarms rate.
Autonomously Reconstructable Semi-Structured P2P Networks for File Sharing
Authors: Kei Ohnishi, Satoshi Nagamatsu, Toshiya Okamura, Yuji Oie
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

We propose a semi-structured peer-to-peer (P2P) network for file sharing built from a structured P2P network as a basis for file search together with an unstructured P2P network for access load balancing. This semi-structured P2P network adopts a structured P2P network capable of providing reliable file search as its base structure. In addition, it makes lightly loaded nodes in the structured network construct unstructured P2P networks over which heavily loaded nodes can spread their access load. The semi-structured P2P network is required to dynamically reconstruct its network topology according to changes in node loadings and file search performance. We also propose an autonomic, distributed, and cooperative method for dynamically altering the network topology. In simulation experiments, we first obtain a network topology that ensures reliable file search and is optimal in terms of access load balancing. This is carried out under the (idealized) assumption that the load state of all nodes in the network can be obtained in advance. We also show that the proposed topology reconstruction method yields network topologies with almost the same performance as the optimal configuration.
Rethinking Practise
Authors: S. Gowans, R. M. Wright
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

Many architects rely upon a sense of common practise and a routine reworking of the same set of slowly evolving icons married to site, programme and available technology to generate design solutions. The paper discusses an experimental, computerassisted approach to architectural design and assesses its applicability to mainstream architectural practise. The process illustrated deals with the observation of latent, place-specific phenomena and their effects, and the reconfiguring of these through their transposition to other mediums, into underpinning rationales for architecture. We highlight the experimental use of digital technologies to reveal elaborate matrixes of hidden relationships present in the mundane and unremarkable, and discuss the fostering of unexpected non-linear connections between these, to produce design proposals defined by the subliminal effect relationships observed. The paper conjectures upon the further development of this approach in relation to current software capability and interoperability, and we consider the implications for its wider adoption by the architectural profession as a design tool and its potential impact upon traditional modes of working practise.
Downlink beamforming for TD/CDMA multipath channels
Authors: M. Schubert
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

Downlink beamforming has been proposed for high-capacity and spectrally-efficient DS-CDMA wireless systems. It mitigates the effects of multiple access interference, self interference and inter-cell interference. We propose a new direction-based downlink beamforming algorithm for frequency selective TD/CDMA multipath channels. It minimises the radiated array power while suppressing dominant interferers. By considering the directivity of the beam pattern, improved robustness and good spatial filtering properties are achieved. This approach also supports path diversity, assuming that a conventional RAKE is deployed at the mobile. Moreover, it can easily be expanded to facilitate space division multiple access (SDMA).
System support for improving software dependability during production runs
Authors: Yuanyuan Zhou
Venue:  (2006)

As hardware performance and dependability have dramatically improved in the past few decades, the software dependability issues are becoming increasingly important. Unfortunately, many studies show that software bugs can greatly affect software dependability during production runs. To improve software dependability during production runs, this dissertation proposes to address software bugs at multiple levels by leveraging support from the hardware, OS, and runtime. The proposed multi-level defenses address software bugs and their effects at different stages of program execution. At the first level, this dissertation proposes a low-overhead tool, called SafeMem, to detect memory leaks and memory corruption bugs by exploiting a novel usage of existing ECC memory. The experiments with seven real-world applications show that SafeMem detects all tested bugs with low overhead (only 1.6%-14.4%). Unfortunately, some bugs may still slip through the first-level defense and may be exploited by security attacks. At the second level, this dissertation proposes a low-overhead, software-only information flow tracking system, called LIFT, to detect a wide range of security attacks that exploiting software bugs. LIFT incurs low-overhead by exploiting dynamic binary translation and optimizations. The experiments show that LIFT can effectively detect a wide range of security attacks and incurs low overhead, only 6.2% for the server application, and 3.6 times on average for seven SPEC INT2000 applications. The proposed dynamic optimizations effectively reduce the overhead by a factor of 5-12 times. Without any further actions for the detected bugs or exploitations at the previous two levels of defenses, what the target system can do is to shut down itself to prevent potential damages, thus is unavailable to users. At the third-level, this dissertation proposes an innovative technique, called Rx, to quickly recover programs from many types of software bugs, both deterministic and non-deterministic. The experiments show that Rx can survive all tested software failures and provides transparent fast recovery within 0.017-0.16 seconds, 21-51 times faster than the whole system program restart approach for all but one case (CVS). In summary, it can effectively improve software dependability during production runs by addressing software bugs at multiple levels with support from the hardware, OS, and runtime.
Online Collage CAPTCHA
Authors: Mohammad Shirali-Shahreza, Sajad Shirali-Shahreza
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

In some websites it is necessary to tell apart human users from computer programs which is known as CAPTCHA (Completely Automated Public Turing test to tell Computers and Human Apart). CAPTCHA methods are mainly based on the weak points of OCR systems while using them are undesirable to human users. In this paper a method has been presented for telling the human users and computer softwares apart on the basis of choice of an object shown on the screen. In this method some objects are chosen randomly and the pictures about these topics are downloaded from Internet. Then after effecting some changes such as rotating, all of the pictures are shown on the screen. Then we ask the user to choose a specific object. If the user chooses the right object we can guess that the user has been a human being and not a computer software. The main advantage of this method is its simplicity because the user does not have to type anything.
A usability study and critique of two password managers
Authors: Sonia Chiasson, P. C. van Oorschot, Robert Biddle
Venue: Proceedings of the 15th conference on USENIX Security Symposium - Volume 15 (2006)

We present a usability study of two recent password manager proposals: PwdHash (Ross et al., 2005) and Password Multiplier (Halderman et al., 2005). Both papers considered usability issues in greater than typical detail, the former briefly reporting on a small usability study; both also provided implementations for download. Our study involving 26 users found that both proposals suffer from major usability problems. Some of these are not "simply" usability issues, but rather lead directly to security exposures. Not surprisingly, we found the most significant problems arose from users having inaccurate or incomplete mental models of the software. Our study revealed many interesting misunderstandings D for example, users reporting a task as easy even when unsuccessful at completing that task; and believing their passwords were being strengthened when in fact they had failed to engage the appropriate protection mechanism. Our findings also suggested that ordinary users would be reluctant to optin to using these managers: users were uncomfortable with "relinquishing control" of their passwords to a manager, did not feel that they needed the password managers, or that the managers provided greater security.
Fuzzy Logic-Based Event Notification in Sparse MANETs
Authors: Anna Lekova, Katrine Skjelsvik, Thomas Plagemann, Vera Goebel
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

In the Ad-Hoc InfoWare project, we develop a delay tolerant event notification service for sparse Mobile Ad-Hoc Networks for emergency and rescue operations. In most event notification solutions, subscriptions are formed with crisp values or crisp value ranges. Filtering mechanisms do not take into account more expressive subscriptions in terms of approximate predicates and complex aggregating relations among them. However, in emergency scenarios subscribers' interests often have gradual nature and subjective measure. Therefore, we design an intelligent event notification system allowing uncertainties to be modeled and complex matching semantics to be processed by fuzzy reasoning. Requiring more computational efforts, fuzzy logic introduces performance penalties in the whole network. We have developed a new subscription data structure and filtering algorithms, and evaluated and optimized it for runtime and space efficiency.