ppxscal/embedding_network huggingface dataset:
RETHER: a software-only real-time ethernet for PLC networks
Authors: Tzi-cker Chiueh
Venue: Proceedings of the Workshop on Embedded Systems on Workshop on Embedded Systems (1999)

The networking technologies used in industrial automation are required to support real-time performance guarantees to ensure that sensor/command data reach target nodes within a delay bound. With the continuing popularity and thus the accompanied price drop of the Ethernet technology, replacing the typically closed and proprietary automation networks with Ethernet is emerging as a very attractive solution, because of the cost-effectiveness and its compatibility with the trend of moving industrial control systems to PC-based hardware. Due to its contention-based media access control protocol, Ethernet theoretically can not bound the network access delay without additional traffic control mechanisms. In this work, we present the design, implementation, and programming interface of a software-based traffic control protocol called RETHER, which turns off-the-shelf Ethernets into real-time networks without any hardware modifications. RETHER works both in a single-segment as well as a multi-segment environment. This paper reports the performance measurements and implementation experiences with the RETHER prototype, which has been fully operational for over 12 months.
A simulation of evolved autotrophic reproduction
Authors: Correy A. Kowall, Brian J. Krent
Venue: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation (2007)

In this experiment we evolve reproductive behaviors for a simulated vehicle. Future work will employ the resulting behaviors to populate a simulated ecosystem.
Color plates
Venue: Proceedings of the Computer Graphics International 2005 (2005)

Some applications require scenes mixing polygonal and volumetric objects and shadows make the scenes more realistic. This paper describes a shadow algorithm for mixed polygonal and volumetric data, including the generation of soft shadows for area light sources. Our volume shader leverages advanced graphics GPU for an accelerated and feasible solution. The shadow and soft shadow algorithm applies to all combinations of volumes and polygons, without any restriction on the geometric positioning and overlap of the volumes and polygons. For realistic rendering where we have a high albedo participating media, multiple scattering is significant. We extend our algorithm to handle both multiple forward scattering and back scattering with light attenuation. This constitutes a complete system for shadow generation and light propagation. 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
An Experimental Approach to Integrating NetFlow Flow-level Records and NLANR Packet-level Traces
Authors: Chi Zhang, Bin Liu, Xun Su, Heidi Alvarez, Julio Ibarra
Venue: Proceedings of the Second International Conference on Internet Monitoring and Protection (2007)

In this paper, we investigate the integration of flow-level records (exemplified by Cisco NetFlow) and packet-level traces (exemplified by NLANR PMA), in order to facilitate cross-validation and complementary utility. However, identifying the correspondences between the two is non-trivial, due to the heterogeneity in data collection. We have adopted a top-down approach to limit the search space, and reduce the matching errors step by step.
Computational Diagnostics: A Novel Approach to Viewing Medical Data
Authors: Ketan K. Mane, Katy Borner
Venue: Proceedings of the Fifth International Conference on Coordinated and Multiple Views in Exploratory Visualization (2007)

A transition from traditional paper-based medical records to electronic health records is underway. The resulting massive amounts of electronic patient records offer tremendous potential to personalize patient diagnosis and treatment. In this paper, we discuss a computational diagnostics tool that uses digital medical records to help physicians gain better insight about a patient's medical condition. The paper details different interactive features of the tool and discusses the tool's potential in the practice of evidence-based medicine and for advancing patient diagnosis practices.
Tracerouting peer-to-peer networks
Authors: Wenli Liu, R. Boutaba
Venue: Proceedings of the End-to-End Monitoring Techniques and Services on 2005. Workshop (2005)

As peer-to-peer (P2P) networks are being developed and deployed on the Internet at a fast pace, the need for a traceroute like mechanism at the application layer surfaces. Such mechanism, once implemented and deployed, will significantly reduce the complexity involved in developing, researching and evolving P2P networks. It will also help users understand how their queries are handled in P2P networks and mitigate their frustration when their queries return nothing. In this paper, we propose and describe AppTraceroute, which is analogous to traditional traceroute but determines the application layer hops and hosts that a query has visited. Meanwhile, we studied the bandwidth consumptions involved when introducing AppTraceroute into pure P2P networks, hybrid P2P networks and structured P2P networks. We have implemented and experimented the concept of AppTraceroute on a structured P2P network, and the results are promising.
Towards a VMM-based usage control framework for OS kernel integrity protection
Authors: Min Xu, Xuxian Jiang, Ravi Sandhu, Xinwen Zhang
Venue: Proceedings of the 12th ACM symposium on Access control models and technologies (2007)

Protecting kernel integrity is one of the fundamental security objectives in building a trustworthy operating system (OS). For this end, a variety of approaches and systems have been proposed and developed. However, access control models used in most of these systems are not expressive enough to capture important security requirements such as continuous policy enforcement and mutable process and object attributes. Even worse, most existing protection mechanisms in these systems reside in the same space as the running OS, which unfortunately can be disabled or subverted after an attacker successfully exploits kernel-level vulnerabilities (or features) to compromise the OS kernel. The increasing number of kernel-level root kit attacks clearly demonstrates this threat. In this paper we present a simple but effective usage control model UCONKI with unique properties of decision continuity and attribute mutability for OS kernel integrity protection. Further, to enforce UCONKI security policies, we propose a virtual machine monitor (VMM) based architecture that is isolated and protected from other untrusted processes inside a virtual machine (VM). We have implemented a proof-of-concept prototype in Linux to demonstrate the feasibility of our approach. Our experiments with 18 real-world kernel rootkits show that our approach is able to successfully detect and prevent all kernel integrity violations from them. Beyond kernel integrity protection, we also explore additional opportunities for general OS security, such as the confinement of process activities as well as the protection of system utility programs at the VMM level.
Using a kernel: based approach to visualize integrated chronic fatigue syndrome datasets
Authors: Ahmad Al-Oqaily, Paul J. Kennedy
Venue: Proceedings of the fifth Australasian conference on Data mining and analystics - Volume 61 (2006)

We describe the use of a kernel-based approach using the Laplacian matrix to visualize an integrated Chronic Fatigue Syndrome dataset comprising symptom and fatigue questionnaire and patient classification data, complete blood evaluation data and patient gene expression profiles. We present visualizations of the individual and integrated datasets with the linear and Gaussian kernel functions. An efficient approach inspired by computational linguistics for constructing a linear kernel matrix for the gene expression data is described. Visualizations of the questionnaire data show a cluster of non-fatigued individuals distinct from those suffering from Chronic Fatigue Syndrome that supports the fact that diagnosis is generally made using this kind of data. Clusters unrelated to patient classes were found in the gene expression data. Structure from the gene expression dataset dominated visualizations of integrated datasets that included gene expression data.
Approximate minimum norm subspace projection of least squares weights without an SVD
Authors: M. J. Smith
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

A QR based technique is presented for estimating the approximate numerical rank and corresponding signal subspace of a matrix together with the subspace projection of the least squares weights. Theoretical difficulties associated with conventional QR factorisation are overcome by applying the technique of row-zeroing QR to the covariance matrix. Thresholding is simplified compared with the use of the data matrix as the diagonal value spectrum is sharpened and the subspace estimate is improved. An approximation to the minimum norm solution for the projection of the least squares weight onto the signal subspace of the data is obtained simply, without performing an SVD.
HICI: An Approach for Identifying Trust Elements The case of technological trust perspective in VBEs
Authors: Simon Samwel Msanjila, Hamideh Afsarmanesh
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

The stability of a virtual organization breeding environment (VBE) requires the right balance of trust level among its members. Particularly for industrybased large-size VBEs and considering the global economy, organizations are now faced with the growing: value of information, uncertainties, and risks surrounding most businesses. As a result, creating a virtual organization (VO) within the VBE environment is becoming challenging and difficult. Establishing trust relationships among organizations in the VBE is now a promising facilitator for fluid VO creations. A priori to establishing trust relationships among member organizations however, trust levels of involved organizations must be properly assessed. In order to properly assess trust level of organizations in VBEs, trust elements and trust relationships must be thoroughly characterized. This paper presents a threestage approach for identifying and analyzing trust elements. It also presents the general trust elements for three main trust objectives in VBEs, namely for creating trust: among VBE members, of the member to the VBE administration, and of the external stakeholder (e.g. a customer) to the VBE.
Chairs' welcome message
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2005. on Tenth IEEE International (2005)

We prove the correctness of an original method for generating components that capture the occurrence of events, and monitor logical and temporal properties of hardware/software embedded systems. The properties are written in PSL, under the form of assertions in declarative form. The method is based on a library of primitive digital components for the PSL temporal operators. These building blocks are interconnected to construct complex properties, resulting in a synthesizable digital module that can be properly linked to the digital system under scrutiny. The proof reported in this paper applies to the weak version of all "foundation language" operators. 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
A constraint to improve the reliability of stereo matching using the rank transform
Authors: J. Banks
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

The rank transform is a non-parametric technique which has been previously proposed for the stereo matching problem. The motivation behind its application to the matching problem is its invariance to certain types of image distortion and noise, as well as its amenability to real-time implementation. This paper derives an analytic expression for the process of matching using the rank transform, and then goes on to derive one constraint which must be satisfied for a correct match. This has been dubbed the rank order constraint or simply the rank constraint. Experimental work has shown that this constraint is capable of resolving ambiguous matches, thereby improving matching reliability. This constraint was incorporated into a new algorithm for matching using the rank transform. This modified algorithm resulted in an increased proportion of correct matches, for all test imagery used.
Detecting Irregularities in Images and in Video
Authors: Oren Boiman, Michal Irani
Venue: International Journal of Computer Vision (2007)

We address the problem of detecting irregularities in visual data, e.g., detecting suspicious behaviors in video sequences, or identifying salient patterns in images. The term "irregular" depends on the context in which the "regular" or "valid" are defined. Yet, it is not realistic to expect explicit definition of all possible valid configurations for a given context. We pose the problem of determining the validity of visual data as a process of constructing a puzzle: We try to compose a new observed image region or a new video segment ("the query") using chunks of data ("pieces of puzzle") extracted from previous visual examples ("the database"). Regions in the observed data which can be composed using large contiguous chunks of data from the database are considered very likely, whereas regions in the observed data which cannot be composed from the database (or can be composed, but only using small fragmented pieces) are regarded as unlikely/suspicious. The problem is posed as an inference process in a probabilistic graphical model. We show applications of this approach to identifying saliency in images and video, for detecting suspicious behaviors and for automatic visual inspection for quality assurance.
Extended DACS Scheme Implementing Security Function
Authors: Kazuya Odagiri, Rihito Yaegashi, Masaharu Tadauchi, Naohiro Ishii
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

When customers with different membership and position use computers as in the university network systems, it often takes much time and efforts for them to manage a network system. This is because the requirements for the respective computer usage are different in network and security policies. In this paper, the destination addressing control system scheme (DACS Scheme) for the university network services is shown. The DACS Scheme performs network management efficiently through the communication control of a client. As the characteristic of DACS Scheme, only the setup modification is required by a system administrator, when configuration change of the network system is done. Then, the setup modification by a customer is unnecessary, which shows a merit for both the system administrator and the customer. But, there are some security problems to be solved. In this paper, secure DACS Scheme is proposed and examined. Secure DACS Scheme has functions to prevent the communication from the client which DACS Client is not installed in and to prevent information interception.
MULTOPS: a data-structure for bandwidth attack detection
Authors: Thomer M. Gil, Massimiliano Poletto
Venue: Proceedings of the 10th conference on USENIX Security Symposium - Volume 10 (2001)

A denial-of-service bandwidth attack is an attempt to disrupt an online service by generating a traffic overload that clogs links or causes routers near the victim to crash. We propose a heuristic and a data-structure that network devices (such as routers) can use to detect (and eliminate) such attacks. With our method, each network device maintains a data-structure, MULTOPS, that monitors certain traffic characteristics. MULTOPS (MUlti-Level Tree for Online Packet Statistics) is a tree of nodes that contains packet rate statistics for subnet prefixes at different aggregation levels. The tree expands and contracts within a fixed memory budget. A network device using MULTOPS detects ongoing bandwidth attacks by the significant, disproportional difference between packet rates going to and coming from the victim or the attacker. MULTOPS-equipped routing software running on an off-the-shelf 700 Mhz Pentium III PC can process up to 340,000 packets per second.
VA systemimager
Authors: Brian Elliott Finley
Venue: Proceedings of the 4th annual Linux Showcase & Conference - Volume 4 (2000)

Linux use in corporations and research organizations has been growing at an amazing rate. It is often used on large numbers of identical systems serving as Internet server farms or high performance computing clusters. Without the help of specialized tools, the time and effort required to install and maintain large numbers of machines grows almost linearly as new systems are added. This creates the demand for a tool with the ability to automate the installation of new systems and maintain the software, configuration, and content of those systems on an ongoing basis. System administrators at large sites will often develop tools for automating the deployment and update of their own systems, but these tools are often very inflexible and are only designed to address the specific needs of one particular set of systems. Therefore these tools are often re-created by system administrators at site after site, not being able to capitalize on the work of their neighbors. The need was perceived for a tool that could provide this functionality at many different sites with different configurations. This required that the tool be easy to install, simple and straightforward to use, and that it be designed in an open and extensible manner to accommodate future changes and site specific customizations. This paper describes the resultant tool, VA SystemImager. It is Open Source software and is designed in a very modular manner. Great pains were taken to ensure that it would be flexible and could easily be modified to accommodate new hardware, software, and site specific configuration needs in future iterations. VA SystemImager is written mostly in Perl and makes use of rsync(1), syslinux(2), and pxelinux(2). It also required the creation of a customized miniature Linux distribution for the installation media. This paper will also discuss some of the differences between VA SystemImager and the KickStart network installation tool from RedHat. KickStart is the tool most often compared to VA SystemImager. Although there are a handful of other tools available, none of them offer the flexibility and ease of use of VA SystemImager.
A hybrid score measurement for HMM-based speaker verification
Authors: Yong Gu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

In speaker verification the world model based approach and the cohort model based approach have been used for better HMM score measurements for verification comparison. From theoretical analysis these two approaches represent two different paradigms for verification decision-making strategy. The two techniques could be combined for a better solution. In the paper we present a hybrid score measurement which combines the world model based technique and the cohort model based technique together. The method is evaluated with the YOHO database. The results show that the combination can lead a better score measurement which improves speaker verification performance. An experimental comparison between the world model based approach and the cohort model based approach with the YOHO database can also be found in the paper.
SNAIL: A Multiprocessor Based on the Simple Serial Synchronized Multistage Interconnection Network Architecture
Authors: Masashi Sasahara, Jun Terada, Luo Zhou, Kalidou Gaye, Jun-ichi Yamato, Satoshi Ogura, Hideharu Amano
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

Simple Serial Synchronized (SSS) Multistage Interconnection Network (MIN) is a novel MIN architecture for connecting processors and memory modules in multiprocessors. Synchronized bit-serial communication simplifies the structure/control, and also solves the pin-limitation problem. Here, design, implementation, and evaluation of a multiprocessor prototype called SNAIL with the SSS-MIN are presented. The heart of SNAIL is the prototype 1 /mu CMOS SSS-MIN gate array chip which exchanges packets from 16 inputs with 50MHz clock. The message combining is implemented only with 20% increases of the hardware. From the empirical evaluation with some application programs, it appears that the latency and synchronization overhead of the SSSMIN are tolerable, and the bandwidth of the SSS-MIN is sufficient. Although the performance improvement with the bit serial message combine is not so large (1%) when instructions are stored in the local memory, it becomes up to 400% when instructions are stored in the shared memory.
Recovering Concepts from Source Code with Automated Concept Identification
Authors: Maurice M. Carey, Gerald C. Gannod
Venue: Proceedings of the 15th IEEE International Conference on Program Comprehension (2007)

The complexity of the systems that software engineers build has continuously grown since the inception of the field. What has not changed is the engineers' mental capacity to operate on about seven distinct pieces of information at a time. Improvements like the widespread use of UML have led to more abstract software design activities, however the same cannot be said for reverse engineering activities. The well known concept assignment problem is still being solved at the line-by-line level of analyzing source code. The introduction of abstraction to the problem will allow the engineer to move farther away from the details of the system, increasing his ability to see the role that domain level concepts play in the system. In this paper we present a technique that facilitates filtering of classes from existing systems at the source level based on their relationship to the core concepts in the domain. This approach can simplify the process of reverse engineering and design recovery, as well as other activities that require a mapping to domain level concepts.
Learning Conversations in World of Warcraft
Authors: Bonnie A. Nardi, Stella Ly, Justin Harris
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

We examine learning culture in a popular online game, World of Warcraft. We analyze the way players learn this complex game through chat conversation with peers. We describe three kinds of learning: fact finding, devising tactics/strategy, and acquiring game ethos. We investigate learning in the zone of proximal development as specified in cultural-historical activity theory. We examine the emotional tenor of learning conversations, noting their drama, humor, and intimacy.
Conceptual coherence in the generation of referring expressions
Authors: Albert Gatt, Kees van Deemter
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

One of the challenges in the automatic generation of referring expressions is to identify a set of domain entities coherently, that is, from the same conceptual perspective. We describe and evaluate an algorithm that generates a conceptually coherent description of a target set. The design of the algorithm is motivated by the results of psycholinguistic experiments.