ppxscal/embedding_network huggingface dataset:
Towards a Taxonomy of Vulnerabilities
Authors: Anil Bazaz, James D. Arthur
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper presents a taxonomy of vulnerabilities created as a part of an effort to develop a framework for deriving verification and validation strategies to assess software security. This taxonomy is grounded in a Process/Object Model of Computation that establishes a relationship between software vulnerabilities, an executing process, and computer system resources such as memory, input/output, or cryptographic resources. That relationship promotes the concept that a software application is vulnerable to exploits when it permits the violation of (a) constraints imposed by computer system resources and/or (b) assumptions made about the usage of those resources. The taxonomy identifies and classifies these constraints and assumptions. The Process/Object Model also serves as a basis for the classification scheme the taxonomy uses. That is, the computer system resources (or objects) identified in the Process/Object Model form the categories and refined subcategories of the taxonomy. Vulnerabilities, which are expressed in the form of constraints and assumptions, are classified within the taxonomy according to these categories and subcategories. This taxonomy of vulnerabilities is novel and distinctively different from other taxonomies found in literature.
Integration Strategy and Case Study in Financial Industry
Authors: Raymond Wu
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

According to the results of our recent research,enterpriseintegrationinacomponent-basedenvironment need validation, design and provisionstages to achieve itsbusiness goal. Ourcurrentresearch hasextendedto the servicevirtualizationwhichisthefinalstageinserviceprovisioning.Thisresearch paper reviews our previous work and useexamples in the financial industry to demonstrate howservices are derived from business components, andhow they are designed and produced in achievingService virtualization.
A Mathematical Trust Model in E-Commerce
Authors: Wang Ping, Qiu Jing
Venue: Proceedings of the 2007 International Conference on Multimedia and Ubiquitous Engineering (2007)

Trust is a fundamental issue in multi-agent systems, especially when they are applied in E-Commerce. The computational models of trust play an important role in determining who and how to interact in open and dynamic environments. To this end, a computational trust model is proposed in which agents can autonomously deal with the biased information and identify trust belief with aging factor in multi-agent systems.
A binary block matching architecture with reduced power consumption and silicon area requirement
Authors: M. M. Mizuki
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

Motion estimation is essential for reducing bit rate by exploiting the temporal redundancy existent in image sequences. MPEG, one of the current standards for video coding, specifies the use of block matching (BM) for motion estimation. Conventional block matching is based on the mean-absolute difference (MAD) distortion metric, which requires a large number of 8-bit arithmetic computations and thereby limits wider usage. This paper examines the possibility of using a binary distortion metric based on contour data to reduce the silicon area and power consumption of the block matching chip by a factor of 5 or more. Our simulation results indicate that the performance of the proposed binary system for a restricted class of sequences, such as "head-and-shoulder" images, is very close to that of conventional gray level methods. Detailed design of the binary block matching (BBM) chip is currently underway. Potential applications include low power, portable video devices and machine vision applications such as stereo matching and template matching.
Dissipativity of θ-methods for nonlinear Volterra delay-integro-differential equations
Authors: Siqing Gan
Venue: Journal of Computational and Applied Mathematics (2007)

This paper deals with the analytic and numerical dissipativity of nonlinear Volterra delay-integro-differential equations (VDIDEs). A dissipativity criteria for VDIDEs is given. We investigate the dissipativity properties of one-leg @q-methods and linear @q-methods for the underlying systems. It is shown that, for @q@?[12,1], any one-leg @q-method and linear @q-method can inherit the dissipativity of the underlying systems.
New Recommendation Techniques for Multicriteria Rating Systems
Authors: Gediminas Adomavicius, YoungOk Kwon
Venue: IEEE Intelligent Systems (2007)

Traditional single-rating recommender systems have been successful in a number of personalization applications, but the research area of multicriteria recommender systems has been largely untouched. Taking full advantage of multicriteria ratings in various applications requires new recommendation techniques. The authors propose two new approaches—a similarity-based approach and an aggregation-function-based approach—to incorporating and leveraging multicriteria rating information in recommender systems. They discuss multiple variations of each proposed approach and report empirical analysis results from a real-world dataset. Experimental results show that recommender systems can leverage multicriteria ratings and improve recommendation accuracy, as compared to traditional single-rating recommendation techniques.
Password-Based Access Control Scheme with Remote User Authentication Using Smart Cards
Authors: Chen Yang, Wenping Ma, Benxiong Huang, Xinmei Wang
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

In this paper, a bilinear mapping based password-based access control scheme with remote user authentication scheme using smart cards is presented. The proposed scheme enables one user to choose his password freely in the registration phase and easily change it as needed. We take the novel technique of binding one user's private key to his identity, which enables the AS (authentication server) to be unnecessary to maintain a password table to verify the login request and thus enhances the practicality and reliability of the system. Additionally, based on the difficulty of Elliptic Curve Discrete Logarithm (ECDL) problem, the proposed scheme can efficiently withstand replaying attacks, forgery attacks, Masquerade attacks, guessing and stolen verifier attacks and insider attacks.
The Erlangen Slot Machine: A Dynamically Reconfigurable FPGA-based Computer
Authors: Mateusz Majer, Jürgen Teich, Ali Ahmadinia, Christophe Bobda
Venue: Journal of VLSI Signal Processing Systems (2007)

Computer architects have been studying the dynamically reconfigurable computer (Schaumont, Verbauwhede, Keutzer, and Sarrafzadeh, "A Quick Safari through the Reconfiguration Jungle," in Proc. of the 38th Design Automation Conference, Las Vegas, pp. 127---177, 2001) for a number of years. New capabilities such as on-demand computing power, self-adaptiveness and self-optimization capabilities by restructuring the hardware on the fly at run-time is seen as a driving technology factor for current research initiatives such as autonomic (Kephart and Chess, Computer, 36:41---52, 2003; IBM Autonomic Computing Initiative, (http://www.research.ibm.com/autonomic/)) and organic computing (Müller-Schloer, von der Malsburg, and Würtz, Inform.-Spektrum, 27:332---336, 2004; The Organic Computing Page, (http://www.organic-computing.org)). Much research work is currently devoted to models for partial hardware module relocation (SPP1148 Reconfigurable Computing Priority Program, (http://www12.informatik.uni-erlangen.de/spprr/)) and dynamically reconfigurable hardware reconfiguration on e.g., FPGA-based platforms. However, there are many physical restrictions and technical problems limiting the scope or applicability of these approaches. This led us to the development of a new FPGA-based reconfigurable computer called the Erlangen Slot Machine. The architecture overcomes many architectural constraints of existing platforms and allows a user to partially reconfigure hardware modules arranged in so-called slots. The uniqueness of this computer stems from (a) a new slot-oriented hardware architecture, (b) a set of novel inter-module communication paradigms, and (c) concepts for dynamic and partial reconfiguration management.
Demodulators for AM-FM models of speech signals: a comparison
Authors: Shan Lu, P. C. Doerschuk
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

We compare two approaches, DESA-1 based on Teager's (1980) energy operator and MBDA based on statistical nonlinear filtering, for extracting the modulating signals from jointly amplitude (AM) and frequency (FM) modulated waveforms. Both demonstrate the structure within a pitch period of a speech signal. The DESA-1 estimates tend to be smoother while the MBDA estimates tend to perform better in the presence of noise.
uSense: A Unified Asymmetric Sensing Coverage Architecture for Wireless Sensor Networks
Authors: Yu Gu, Joengmin Hwang, Tian He, David Hung-Chang Du
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

As a key approach to achieve energy efficiency in sensor networks, sensing coverage has been studied extensively. Researchers have designed many coverage protocols to provide various kinds of service guarantees on the network lifetime, coverage ratio and detection delay. While these protocols are effective, they are not flexible enough to meet multiple design goals simultaneously. In this paper, we propose a Unified Sensing Coverage Architecture, called uSense, which features three novel ideas: Asymmetric Architecture, Generic Switching and Global Scheduling. We propose asymmetric architecture based on the conceptual separation of switching from scheduling. Switching is efficiently supported in sensor nodes, while scheduling is done in a separated computational entity, where multiple scheduling algorithms are supported. As an instance, we propose a two-level global coverage algorithm, called uScan. At the first level, coverage is scheduled to activate different portions of an area. We propose an optimal scheduling algorithm to minimize area breach. At the second level, sets of nodes are selected to cover active portions. Importantly, we show the feasibility to obtain optimal set-cover results in linear time if the layout of areas satisfies certain conditions. We evaluate our architecture with a network of 30 MicaZ motes, an extensive simulation with 10,000 nodes, as well as theoretical analysis. The results indicate that uSense is a promising architecture to support flexible and efficient coverage in sensor networks.
Suppression of atmospheric turbulence in video using an adaptive control grid interpolation approach
Authors: D. H. Frakes
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

Atmospheric turbulence is a naturally occurring phenomenon that can severely limit the resolution of long distance optical and infrared sensors. Because atmospheric turbulence can degrade the appearance of video captured by these sensors, many of which are already deployed in the field, there is much interest in employing enhancement/restoration processing to improve data quality after acquisition. This paper presents a signal processing approach to suppressing atmospheric turbulence effects in sensor video using an adaptive control grid interpolation method. In this method, a dense dynamic motion vector field is derived from the characteristics of the atmospheric turbulence as seen in the data. The vector field is used in turn as part of the distortion compensation process, while preserving naturally occurring motion, such as that associated with the movement of objects within the stationary scene. The resulting algorithm is shown to produce enhanced video with quality significantly higher than that of the original.
Splitting interfaces: making trust between applications and operating systems configurable
Authors: Richard Ta-Min, Lionel Litty, David Lie
Venue: Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7 (2006)

In current commodity systems, applications have no way of limiting their trust in the underlying operating system (OS), leaving them at the complete mercy of an attacker who gains control over the OS. In this work, we describe the design and implementation of Proxos, a system that allows applications to configure their trust in the OS by partitioning the system call interface into trusted and untrusted components. System call routing rules that indicate which system calls are to be handled by the untrusted commodity OS, and which are to be handled by a trusted private OS, are specified by the application developer. We find that rather than defining a new system call interface, routing system calls of an existing interface allows applications currently targeted towards commodity operating systems to isolate their most sensitive components from the commodity OS with only minor source code modifications. We have built a prototype of our system on top of the Xen Virtual Machine Monitor with Linux as the commodity OS. In practice, we find that the system call routing rules are short and simple - on the order of 10's of lines of code. In addition, applications in Proxos incur only modest performance overhead, with most of the cost resulting from inter-VM context switches.
A tree of median pyramidal decompositions with an application to signal denoising
Authors: V. Melnik
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

We propose to generate a library of median pyramidal decompositions organized as a tree. It is shown that the best decomposition on this tree can be chosen using the techniques developed in wavelet theory. Based on the tree of decompositions, a denoising algorithm is introduced. Numerical simulations have shown that the proposed algorithm is more effective for signal denoising than the method based on the traditional median pyramidal transform.
Optimizations and Performance Study of the Dynamic Source Routing Protocol
Authors: Mohamed Aissani, Mustapha Reda Senouci, Walid Demigna, Abdelhamid Mellouk
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

We have conducted a performance study of the DSR protocol, in particular, for scenarios where it presents poor performance compared to that of AODV protocol. We have also carried out two optimizations on DSR, namely: generalized salvaging mechanism and cache update of the intermediate nodes with source routes discovered during the route request packets propagation. Our routing protocol, called GSM-DSR (Generalized Salvaging Mechanism for DSR), is compared with AODV and DSR, and performance results are presented in this paper. We show, through simulations, that the salvaging optimization and the cache update do lead to an improvement of DSR performance, particularly, in large scale networks with high mobility and heavy load.
Real-Time 3D Ladar Imaging
Authors: Peter Cho, Hyrum Anderson, Robert Hatch, Prem Ramaswami
Venue: Proceedings of the 35th Applied Imagery and Pattern Recognition Workshop (2006)

A prototype image processing system has recently been developed which generates, displays and analyzes three-dimensional ladar data in real time. It is based upon a suite of novel algorithms that transform raw ladar data into cleaned 3D images. These algorithms perform noise reduction, ground plane identification, detector response deconvolution and illumination pattern renormalization. The system also discriminates static from dynamic objects in a scene. In order to achieve real-time throughput, we have parallelized these algorithms on a Linux cluster. We demonstrate that multiprocessor software plus Blade hardware result in a compact, real-time imagery generation adjunct to an operating ladar.
A Simulation Study of Data Partitioning Algorithms for Multiple Clusters
Authors: Chen Yu, Dan C. Marinescu, Howard Jay Siegel, John P. Morrison
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Recently we proposed algorithms for concurrent execution on multiple clusters [11]. In this case, data partitioning is done at two levels; first, the data is distributed to a collection of heterogeneous parallel systems with different resources and startup time, then, on each system the data is evenly partitioned to the available nodes. In this paper, we report on a simulation study of the algorithms.
Secure delegation for distributed object environments
Authors: Nataraj Nagaratnam, Doug Lea
Venue: Proceedings of the 4th conference on USENIX Conference on Object-Oriented Technologies and Systems - Volume 4 (1998)

SDM is a Secure Delegation Model for Java-based distributed object environments. SDM extends current Java security features to support secure remote method invocations that may involve chains of delegated calls across distributed objects. The framework supports a control API for application developers to specify mechanisms and security policies surrounding simple or cascaded delegation. Delegation may also be disabled and optionally revoked. These policies may be controlled explicitly in application code, or implicitly via administrative tools.
Resource Measurements for Water Detection Algorithm in MedioGrid Architecture
Authors: Victor Bacu, Dorian Gorgan
Venue: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing (2007)

The paper presents a case study for water detection computation in Grid architecture. The research concerns on the measurement and the evaluation of the processing performance of satellite images over the appropriate resources in MedioGrid. The paper analyses the relationship among virtual and physical computation time, image dimensions, number of running jobs and number of workstations involved in water detection processing.
Provenance semirings
Authors: Todd J. Green, Grigoris Karvounarakis, Val Tannen
Venue: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2007)

We show that relational algebra calculations for incomplete databases, probabilistic databases, bag semantics and why-provenance are particular cases of the same general algorithms involving semirings. This further suggests a comprehensive provenance representation that uses semirings of polynomials. We extend these considerations to datalog and semirings of formal power series. We give algorithms for datalog provenance calculation as well as datalog evaluation for incomplete and probabilistic databases. Finally, we show that for some semirings containment of conjunctive queries is the same as for standard set semantics.
Structure Matching for Enhancing UDDI Queries Results
Authors: Giancarlo Tretola, Eugenio Zimeo
Venue: Proceedings of the IEEE International Conference on Service-Oriented Computing and Applications (2007)

To enhance UDDI query capability, typically based on taxonomic classification, semantic matching is assuming a key role. Even if we recognize the great importance of semantics in the discovery process, structure-based matching can be very useful in many situations where semantic annotations are not provided at publish time or ontologies are not yet well defined. Moreover, structure matching has a potential application in dynamic binding and invocation to perform correct parameter passing based on syntactic elements obtained from the mapping returned by the structure matching algorithm. The paper discusses the problem of similarity structure matching and proposes and compares different implementations of the algorithm introduced by Wang-Stroulia with the aim of obtaining better performance. We integrated the algorithm in a matchmaking framework based on multiple cascade filters that are able to combine several matchmaking techniques in order to improve precision and recall in a flexible and effective way.
A Group-Based Architecture for Wireless Sensor Networks
Authors: Jaime Lloret, Miguel Garcia, Jesus Tomas
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

Many routing protocols for ad-hoc networks and sensor networks have been designed, but none of them are based on groups. We propose to divide the network into several groups of sensors. When a sensor send data to other groups, the data has to arrive just to one sensor from each group, then they propagate it to the rest of sensors in their groups. We have simulated our proposal for different types of sensor topologies to know which type of topology is the best depending on the number of sensors in the whole network or depending on the number of interior sensors. We have also simulated how much time is needed to propagate information between groups. The application areas for our proposal could be rural and agricultural environments to detect plagues and to propagate it to neighbouring areas, or for military purposes to propagate information between neighbouring squads.
A proof of correctness for the construction of property monitors
Authors: K. Morin-Allory, D. Borrione
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.
NNMF-Based Factorization Techniques for High-Accuracy Privacy Protection on Non-negative-valued Datasets
Authors: Jie Wang, Weijun Zhong, Jun Zhang
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

The challenge in preserving data privacy is how to protect attribute values without jeopardizing the similarity between data objects under analysis. In this paper, we further our previous work on applying matrix techniques to protect privacy and present a novel algebraic technique based on iterative methods for non-negative-valued data distortion. As an unsupervised learning method for uncovering latent features in high-dimensional data, a low rank nonnegative matrix factorization (NNMF) is used to preserve natural data non-negativity and avoid subtractive basis vector and encoding interactions present in techniques such as principal component analysis. It is the first in privacy preserving data mining in our paper that combining non-negative matrix decomposition with distortion processing. Two iterative methods to solve bound-constrained optimization problem in NMF are compared by experiments on Wisconsin Breast Cancer Dataset. The overall performance of NMF on distortion level and data utility is compared to our previously-proposed SVD-based distortion strategies and other existing popular data perturbation methods. Data utility is examined by cross validation of a binary classification using the support vector machine. Our experimental results on data mining benchmark datasets indicate that, in comparison with standard data distortion techniques, the proposed NMF-based method are very efficient in balancing data privacy and data utility, and it affords a feasible solution with a good promise on high-accuracy privacy preserving data mining.