ppxscal/embedding_network huggingface dataset:
SVGrid: a secure virtual environment for untrusted grid applications
Authors: Xin Zhao, Kevin Borders, Atul Prakash
Venue: Proceedings of the 3rd international workshop on Middleware for grid computing (2005)

Most grid security researches focus on user authentication and secure communication, the protection of grid computers is left to the underlying operating system. Unfortunately, most OS level protection mechanisms can be turned off after an attacker manages to exploit a vulnerability to gain privileged access.This paper proposes SVGrid, a Secure Virtual Grid computing environment, to protect grid computers' filesystem and network from malicious grid applications. SVGrid works by isolating grid applications in one or more grid virtual machines whose filesystem and network service are moved into a dedicated monitor virtual machine. All file and network access requests are then forced to go through the monitor virtual machine, where security policies can be enforced. The resource compartment guarantees that appropriate security policy enforcement cannot be bypassed or disabled, even if a grid virtual machine is compromised. We tested SVGrid against attacks on grid virtual machine using rootkit and internet worm, SVGrid was able to prevent both of them from maliciously accessing filesystem and network. We also evaluated the performance of SVGrid system and only found that performance cost was reasonable considering the security benefits of SVGrid.
Evolutionary algorithms and de novo peptide design
Authors: I. Belda, X. Llor&#x00e0;, E. Giralt
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2006)

One of the goals of computational chemistry is the automated de novo design of bioactive molecules. Despite significant progress in computational approaches to ligand design and efficient evaluation of binding energy, novel procedures for ligand design are required. Evolutionary computation provides a new approach to this design issue. This paper presents an automated methodology for computer-aided peptide design based on evolutionary algorithms. It provides an automatic tool for peptide de novo design, based on protein surface patches defined by user. Regarding the restrictive constrains of this problem a special emphasis has been made on the design of the evolutionary algorithms implemented.
Supporting Configurable Congestion Control in Data Transport Services
Authors: Yunhong Gu, Robert L. Grossman
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

As wide area high-speed networks rapidly increase, new applications emerge and require new control mechanisms in data transport services to support them. In this paper, we present UDT/CCC, a data transport library that allows users to make use of a new control algorithm through simple configurations. We aim to provide a tool for fast implementation and deployment, as well as easy evaluation, of new congestion control algorithms. UDT/CCC uses an objected-oriented design. We show that our UDT/CCC library can be used to easily implement a large variety of control algorithms and can simulate the behavior of their native implementations as well. The UDT/CCC library is at the application level and it does not need root privilege to be installed. Meanwhile, it was specially developed to require very few changes to the existing applications. This paper describes its design, implementation, and evaluation.
The expert assistance system: one approach towards people-oriented systems
Authors: Shirley Ward Watkins
Venue: ACM SIGSOC Bulletin (1979)

The Network Access Machine, developed at the National Bureau of Standards, is directed towards the objective of people-oriented systems. I will begin by providing some background information concerning what stimulated our work, highlight very briefly some of the capabilities of the Network Access Machine, and then review the current extension to this Network Access Machine which in effect reflects our continuing interest in people-oriented systems.
Pixel Behaviour Metrics for Dynamic Background Modelling with the Projected Difference Pattern Method
Authors: Peter Pakulski, Karl Sammut, Fangpo He, Matthew Naylor
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

This paper presents a new algorithm for modelling the behaviour of dynamic video. The PDP (Projected Difference Pattern) is designed to perform simple spatiotemporal processing with a strong focus on efficiency of real-time implementation. In its simplest implementation, the algorithm is shown to be suitable for generating dynamic background models, motion characterisation, and motion detection. Sample analyses of test video are presented to support this work.
A model for glioma growth
Authors: Evgeniy Khain, Leonard M. Sander, Andrew M. Stein
Venue: Complexity (2005)

Glioblastoma Multiforme (GBM) is the most invasive form of primary brain tumor. We propose a mathematical model that describes such tumor growth and allows us to describe two different mechanisms of cell invasion: diffusion (random motion) and chemotaxis (directed motion along the gradient of the chemoattractant concentration). The results are in a quantitative agreement with recent in vitro experiments. It was observed in experiments that the outer invasive zone grows faster than the inner proliferative region. We argue that this feature indicates transient behavior, and that the growth velocities tend to the same constant value for larger times. A longer-time experiment is needed to verify this hypothesis and to choose between the two basic mechanisms for tumor growth. &copy; 2005 Wiley Periodicals, Inc. Complexity 11: 53&ndash;57, 2005This paper was submitted as an invited paper resulting from &ldquo;Understanding Complex Systems&rdquo; conference held at University of Illinois-Urbana Champaign, May 2005
Reading Out of the "Idiot Box": Same-Language Subtitling on Television in India
Authors: Brij Kothari, Avinash Pandey, Amita R. Chudgar
Venue: Information Technologies and International Development (2004)

Same Language Subtitling (SLS) is the idea of subtitling the lyrics of song-based television programs (e.g., music videos), in the same language as the audio. Situated in a literature review of subtitling, this article describes the first-ever implementation of SLS on a TV program of film songs, specifically for first-language literacy. Chitrageet, a weekly 30-minute TV program of Gujarati film songs, was telecast across Gujarat state in India, with the lyrics subtitled in Gujarati. We discuss the results of the pilot study to test the effectiveness of SLS of film songs on the reading skills of out-of-school people. With limited exposure to SLS within a telecast period of 6 months, SLS was found to make an incremental but measurable contribution to decoding skills, across the group that generally saw the subtitled TV program (as compared to those who did not). Viewer testimonies further strengthen the case for SLS beyond quantifiable improvement, as a simple and economical idea for infusing everyday television entertainment with reading and writing (or scriptacy) transactions. The potential of SLS in India and other countries is enormous. The idea is especially powerful in popular culture for scriptacy skill improvement, motivation of non-scriptates, increasing viewers' exposure and interaction with print from early childhood, and increasing media access among the deaf.
VSched: Mixing Batch And Interactive Virtual Machines Using Periodic Real-time Scheduling
Authors: Bin Lin, Peter A. Dinda
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

We are developing Virtuoso, u system ,for distributed computing using virtual machines (VMs). Virtuoso must be uble to mix batch und interactive VMs on the same physical hardwure, while satisfiing constraint on re- sponsiveness und compute rates for each workload. VSched is the component of Virtuoso that provides this capability. VSched is an entirely user-level tool that interacts with the stock Linux kernel running below any type-11 virtual machine monitor to schedule VMs (indeed, any process) using a periodic real-time scheduling model. This abstraction allows compute rate and responsivness constraints to be straightforwardly described using a period und a slice within the period, and it allows,for just and simple admission control. This paper makes the case,for periodic real-time scheduling for VM-based computing environments, and then describes and evaluate.s VSched. It also applies VSched to scheduling parallel worklouds, showing that it can help a BSP application maintain a fixed stable performance despite externally caused loud imbalance.
Modular Software Design with Crosscutting Interfaces
Authors: William G. Griswold, Kevin Sullivan, Yuanyuan Song, Macneil Shonle, Nishit Tewari, Yuanfang Cai, Hridesh Rajan
Venue: IEEE Software (2006)

Aspect-oriented programming languages such as AspectJ offer new mechanisms for decomposing systems into modules and composing modules into systems. Common ways of using these mechanisms couple aspects to complex, changeable implementation details, which can compromise modularity. The crosscut programming interface (XPI) can significantly improve modularity in the design of programs employing AspectJ-style AOP. The use of XPIs doesn't limit the use of existing AOP mechanisms or require new ones, and the approach appears to generalize to other languages.This article is part of a special issue on aspect-oriented programming.
Scientific workflow management: between generality and applicability
Authors: Zhiming Zhao, Adam Belloum, Adianto Wibisono, Frank Terpstra, Piter T. de Boer, Peter Sloot, Bob Hertzberger
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

In a Problem Solving Environment (PSE), a Scientific Workflow Management System (SWMS) provides a meta environment for managing activities and data in scientific experiments, for prototyping experimental computing systems and for orchestrating the runtime system behaviour. The realisation of a SWMS is often driven by domain specific applications and thus is at application level. Investigating the common characteristics in domain specific SWMSs and encapsulating them in a generic framework improve the reusability of the SWMS components and reduce the costs for introducing an e-Science framework in a new science domain. In this position paper, we present our research in an ongoing project: Virtual Laboratory for e-Science (VLe). In the VL-e project, we are building a generic e-Science framework which will support scientists from different domains to share their knowledge and to perform specific experiments. We summarise the lessons we have learned from a previous VL-e implementation, and discuss the plan for improving the quality of the SWMS support in the VL-e framework.
Analyzing the Impact of Components Replication in High Available J2EE Clusters
Authors: Davide Rossi, Elisa Turrini
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

Clustering is a well known technique that allows scalability and fault tolerance in distributed systems. In the J2EE framework, clustering can be used to improve the performance and the availability of an application. In this context, however, great care has to be taken with respect to the replication of stateful components; specifically, stateful components replication can adversely affect the performance of the system and can introduce unexpected modifications in the semantics of the application. In this paper, exploiting our experience in this area, we analyze and discuss these issues, and propose possible solutions. We also describe how component replication is implemented in a number of (open source and commercial) J2EE compliant application servers. The aim of this paper is to provide the insight to better evaluate the software solutions and the related costs/benefits trade-off issues that a software architect has to address when designing a critical, high available, system.
Scalable Enterprise Level Workflow Manager for the Grid
Authors: Dheepak RA, Shakeb Ali, Ira Gupta, Hardik Dave, Adarsh Kailash Upadhyay, Lech D. Alves, Anish Damodaran, Anirban Chakrabarti, Anirban Ghosh
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

A Grid is described as a distributed network which comprises of heterogeneous and non-dedicated elements. The heterogeneity of a grid is not only defined in terms of computing elements and operating systems but also in terms of implementation of policies, policy decisions and the environment. In this paper we have described in detail the architecture of the scalable workflow manager on Grid called Grid Workflow Manager (GridWorM) which works with different existing schedulers. The workflow solution is scalable and is able to integrate the business requirements with the underlying grid infrastructure.
SIGACT news logic column 14
Authors: Riccardo Pucella
Venue: ACM SIGACT News (2005)

For this issue, James Cheney describes nominal logic, an approach to solve the problems involved with reasoning about bindings in formal languages that has been gaining in popularity in recent years, and surveys its major application areas.
SmallWiki: a meta-described collaborative content management system
Authors: Stéphane Ducasse, Lukas Renggli, Roel Wuyts
Venue: Proceedings of the 2005 international symposium on Wikis (2005)

Wikis are often implemented using string-based approaches to parse and generate their pages. While such approaches work well for simple wikis, they hamper the customization and adaptability of wikis to the variety of end-users when more sophisticated needs are required (i.e., different output formats, user-interfaces, wiki management, security policies,...). In this paper we present SmallWiki, the second version of a fully object-oriented implementation of a wiki. SmallWiki is implemented with objects from the top to the bottom and it can be customized easily to accommodate new needs. In addition, SmallWiki is based on a powerful meta-description called Magritte that allows one to create user-interface elements declaratively.
Generation of Positive and Negative Tests for Parsers
Authors: S. V. Zelenov, S. A. Zelenova
Venue: Programming and Computing Software (2005)

A methodology for automatic positive and negative test set generation for testing parsers is described. Coverage criteria for such test sets based on the model approach to testing are proposed. Methods for the generation of test sets satisfying these criteria are discussed. Results of the application of the proposed methodology for testing parsers for various languages including C and Java are presented.
Omnibus Verification Policies: A flexible, configurable approach to assertion-based software verification
Authors: Thomas Wilson, Savi Maharaj, Robert G. Clark
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

The three main assertion-based verification approaches are: Design by Contract (DBC), Extended Static Checking (ESC) and Verified Design by Contract (VDBC). Each approach offers a different balance between rigour and ease of use making them appropriate in different situations. Our goal is to explore the use of these approaches together in a flexible way, enabling an application to be broken down into sections with different reliability requirements and different verification approaches used in each section. We explain the benefits of using the approaches together, present a set of guidelines to avoid potential conflicts and give an overview of how the Omnibus IDE provides support for the full range of assertion-based verification approaches within a single tool.
Models of the departure process of a BMAP/MAP/1 queue
Authors: Qi Zhang, Armin Heindl, Evgenia Smirni
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

We propose a family of finite approximations for the departure process of a BMAP/MAP/1 queue. The departure process approximations are derived via an exact aggregate solution technique (called ETAQA) applied to M/G/1-type Markov processes. The proposed approximations are indexed by a parameter n (n < 1), which determines the size of the output model as n + 1 block levels of the M/G/1-type process. This output approximation preserves exactly the marginal distribution of the true departure process and the lag correlations of the inter-departure times up to lag n-2. Experimental results support the applicability of the proposed approximation in traffic-based decomposition of queueing networks.
Dynamic TimeWarping Applied to Tamil Character Recognitio
Authors: Ralph Niels, Louis Vuurpij
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper describes the use of Dynamic Time Warping (DTW) for classifying handwritten Tamil characters. Since DTW can match characters of arbitrary length, it is particularly suited for this domain. We built a prototype based classifier that uses DTW both for generating prototypes and for calculating a list of nearest prototypes. Prototypes were automatically generated and selected. Two tests were performed to measure the performance of our classifier in a writer dependent, and in a writer independent setting. Furthermore, several strategies were developed for rejecting uncertain cases. Two different rejection variables were implemented and using a Monte Carlo simulation, the performance of the system was tested in various configurations. The results are promising and show that the classifier can be of use in both writer dependent and writer independent automatic recognition of handwritten Tamil characters.
Reduced Complexity Rotation Invariant Texture Classification Using a Blind Deconvolution Approach
Authors: Patrizio Campisi, Stefania Colonnese Gianpiero Panci Gaetano Scarano
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

In this paper, we present a texture classification procedure that makes use of a blind deconvolution approach. Specifically, the texture is modeled as the output of a linear system driven by a binary excitation. We show that features computed from one-dimensional slices extracted from the two-dimensional autocorrelation function (ACF) of the binary excitation allows representing the texture for rotation-invariant classification purposes. The two-dimensional classification problem is thus reconduced to a more simple one-dimensional one, which leads to a significant reduction of the classification procedure computational complexity.
Automatic diagnosis and response to memory corruption vulnerabilities
Authors: Jun Xu, Peng Ning, Chongkyung Kil, Yan Zhai, Chris Bookholt
Venue: Proceedings of the 12th ACM conference on Computer and communications security (2005)

Cyber attacks against networked computers have become relentless in recent years. The most common attack method is to exploit memory corruption vulnerabilities such as buffer overflow and format string bugs. This paper presents a technique to automatically identify both known and unknown memory corruption vulnerabilities. Based on the observation that a randomized program usually crashes upon a memory corruption attack, this technique uses the crash as a trigger to initiate an automatic diagnosis algorithm. The output of the diagnosis includes the instruction that is tricked to corrupt data, the call stack at the time of corruption, and the propagation history of corrupted data. These results provide useful information in fixing the vulnerabilities. Moreover, the diagnosis process also generates a signature of the attack using data/address values embedded in the malicious input message, and is used to block future attacks. Such a signature is further associated with the program execution state to reduce false positives without decreasing the detection rate. The proposed techniques enable the development of a decentralized self-diagnosing and self-protecting defense mechanism for networked computers. We report the implementation experience and experimental evaluation of a prototype system on Linux.
A Grid-Enabled PSE for Physical Simulation: Experiences on GridPSi
Authors: Zhou Jun, Yukio Umetani
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

As the power of computational Grids increases, there is a corresponding need for better usability in PSE community. In this paper, we describe our experiences on design of project GridPSi, a Grid-enabled PSE for physical simulation. GridPSi provides a rich suite of functions that facilitate the composition of computational scripts to automate physical simulations by design domain-specific templates for a verity of research fields. The generic functionality provided by it includes problem modeling, mesh file conversion, computational script generation, solution scheme specification and access to Grid resources. GridPSi offers a simple interface that is intuitive to users in the human-PSE interactions and ways of thinking. Furthermore, we developed higher-level graphical components named PDE wizards that build upon the core functions to guide users through problem modeling process with minimum effort. By using Unicore as Grid middleware, we are lowering the barriers to entry for users wishing to exploit Grid technologies.
A Multiphase Dynamic Labeling Model for Variational Recognition-driven Image Segmentation
Authors: Daniel Cremers, Nir Sochen, Christoph Schnörr
Venue: International Journal of Computer Vision (2006)

We propose a variational framework for the integration of multiple competing shape priors into level set based segmentation schemes. By optimizing an appropriate cost functional with respect to both a level set function and a (vector-valued) labeling function, we jointly generate a segmentation (by the level set function) and a recognition-driven partition of the image domain (by the labeling function) which indicates where to enforce certain shape priors. Our framework fundamentally extends previous work on shape priors in level set segmentation by directly addressing the central question of where to apply which prior. It allows for the seamless integration of numerous shape priors such that--while segmenting both multiple known and unknown objects--the level set process may selectively use specific shape knowledge for simultaneously enhancing segmentation and recognizing shape.