ppxscal/embedding_network huggingface dataset:
Formal methods in security engineering: where we've been, where we are, where we need to go
Authors: John McLean
Venue: Proceedings of the 2007 ACM workshop on Formal methods in security engineering (2007)

Starting with the Trusted Computer System Evaluation Criteria (aka the "Orange Book"), the information security community within the US Department of Defense has been advocating formal methods for decades. Others have followed suit, culminating in the appearance of the Common Criteria. The advantages of formal analysis seem self-evident. First, of the three things that are subject to certification -- people, process, and product -- product seems to be the most immediately relevant. Second, if we focus on product, testing seems insufficient; as Dijkstra famously noted, testing can reveal the presence flaws, but not their absence. This is especially true of security, where flaws may be intentionally constructed not to reveal themselves during normal testing. Despite this, the acceptance of formal methods has been less than universal. In this talk I will discuss the history of formal methods, but with a focus on how that history has shaped our current situation. I'll also discuss what we need to do to make formal methods more appealing. This will involve the development of formal methods or new ways of using formal methods that will: have a more predictable, quantifiable impact on validation costs; support software engineering for nonstandard properties and multiple properties; incorporate untrusted software; and support flexible release strategies. I will also discuss a recent application of formal methods NRL undertook as part of the development of a new security device [1] and new directions formal methods must take if they are to be applicable to future systems. The focus here will be on their use in autonomous systems that incorporate nondeterministic learning algorithms.
Template-based Runtime Reconfiguration Scheduling for Partial Reconfigurable SoC
Authors: Li Chia, Chi-Sheng Shih
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

Reconfigurable hardware provides multiple functions without greatly increasing the die size of SoCs. Field Programmable Gate Array (FPGA), one type of reconfigurable hardware, is developing rapidly to handle high speed and complex applications. In particular, SRAM-based FPGA can be reconfigured during run-time to provide functionality as needed, thus reducing cost and power consumption. However, the reconfiguration delay time and limited resource on FPGA pose new challenges to many real-time scheduling applications. In order to optimize hardware usage and eliminate the impacts of reconfiguration delay, the scheduling algorithms and resource management mechanisms for reconfigurable SoC have to be re-designed. In this paper, we develop a template-based approach to reuse hardware resources without compromising the reconfiguration and performance constraint. The developed solution makes use of offline generated templates to generate near-optimal schedules during run-time.
A Parallel Downloading Algorithm for Redundant Networks
Authors: Ke Li, WanLei Zhou, Shui Yu, Bo Dai
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

In this paper, we study the downloading mechanism of BitTorrent (or BT), a P2P based popular and convenient parallel downloading software tool, point out some of its limitations, and propose an algorithm to improve its performance. In particular, we address the limitations of BT by using neighbours in P2P networks to resolve the redundant copies problem and to optimise the downloading speed. Our preliminary experiments show that the proposed enhancement algorithm works well. Keywords: Algorithm, P2P, Redundant Network
ExperienceLabs: investigating people's experiences in realistic "lab" settings
Authors: Jettie Hoonhout
Venue: Proceedings of the 2007 conference on Designing pleasurable products and interfaces (2007)

Successful product development and innovation rests on a solid understanding of consumer needs and aspirations. End-user driven innovation is seen as key to customer satisfaction and profitable product development (e.g. Hoonhout, 2007). So, understanding what it is that the customer is really looking for, by collecting their feedback at different stages in the product development process, is imperative. In this process, one looks at the experience--from utility and usability to the affective experience--that is being provided, and tests if this meets the user's needs.
CUT: Combining stochastic ordering and censoring to bound steady-state rewards and first passage time
Authors: Jean-Michel Fourneau, Nihal Pekergin, Sana Younes
Venue: Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems (2007)

We have designed a tool to partition a Markov Chain and have used the censoring technique and strong stochastic comparison to obtain bounds on rewards and the first passage time. We present the main ideas of the method, the algorithms, the tool and some numerical results.
rh_tsp_map 3.0
Authors: Alejandro A. Schäffer, Edward Stallknecht Rice, William Cook, Richa Agarwala
Venue: Bioinformatics (2007)

Summary:rh_tsp_map is a software package for computing radiation hybrid (RH) maps and for integrating physical and genetic maps. It solves the central mapping instances by reducing them to the traveling salesman problem (TSP) and using a modification of the CONCORDE package to solve the TSP instances. We present some of the features added between the initial rh_tsp_map version 1.0 and the current version 3.0, emphasizing the automation of many steps and addition of various checks designed to find problems with the input data. Iterations of improved input data followed by fast re-computation of the maps improves the quality of the final maps. Availability:rh_tsp_map source code and documentation including a tutorial is available at ftp://ftp.ncbi.nih.gov/pub/agarwala/rhmapping/rh_tsp_map.tar.gz. CONCORDE modified for RH mapping is available in the directory http://www.isye.gatech.edu/~wcook/rh/. The QSopt library needed for CONCORDE is available at http://www2.isye.gatech.edu/~wcook/qsopt/downloads/downloads.htm Contact:richa@helix.nih.gov, FAX: 301-480-2288. (Please send email concurrently with any fax.)
A neural network approach to audio-assisted movie dialogue detection
Authors: Margarita Kotti, Emmanouil Benetos, Constantine Kotropoulos, Ioannis Pitas
Venue: Neurocomputing (2007)

A novel framework for audio-assisted dialogue detection based on indicator functions and neural networks is investigated. An indicator function defines that an actor is present at a particular time instant. The cross-correlation function of a pair of indicator functions and the magnitude of the corresponding cross-power spectral density are fed as input to neural networks for dialogue detection. Several types of artificial neural networks, including multilayer perceptrons (MLPs), voted perceptrons, radial basis function networks, support vector machines, and particle swarm optimization-based MLPs are tested. Experiments are carried out to validate the feasibility of the aforementioned approach by using ground-truth indicator functions determined by human observers on six different movies. A total of 41 dialogue instances and another 20 non-dialogue instances are employed. The average detection accuracy achieved is high, ranging between 84.78%+/-5.499% and 91.43%+/-4.239%.
Design Version Management
Authors: Randy Katz, Rajiv Bhateja, Ellis Chang, David Gedye, Vony Trijanto
Venue: IEEE Design Test (1987)

Systems for version management have been in existence for some time, yet no system provides the complete range of servicesneeded to control the versions and configurations of a complex design as it evolves over time. The authors have been developinga system, called a version server, to provide just these services. It supports an object -oriented model for organizing designdata and provides operational mechanisms for controlling the design's evolution, such as object check-in/checkout and a validationsubsystem.
A Multi-population Particle Swarm Optimizer and its Application to Blind Multichannel Estimation
Authors: Ying Gao, Zhaohui Li, Xiao Hu, Huailiang Liu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

In this paper, a multi-population particle swarm optimizer based on Lotka-Volterra competition equation is first proposed. The cooperative coevolution in the field of ecology is involved into original particle swarm optimizer, and populations size is adjusted adaptively based on multi-population Lotka-Volterra competition equation. Then, the algorithm is applied to blind multichannel estimation by optimizing an error function for the outputs of a multichannel system. The experiment results demonstrate that the proposed algorithm is superior to original particle swarm optimization algorithm, and is effective to blind multichannel estimation.
A New Immune PID Controller in Material-Level Control
Authors: Wei Wang, X. Z. Gao, Changhong Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

The material-level control of preheating cylinder in the thermofiner of the hot-grinding system is highly nonlinear, and also has a pure delay. Our paper proposes a promising fusion of immune algorithm and PID algorithm to deal with this challenging problem. The MATLAB-based simulations demonstrate that the proposed hybrid controller has the remarkable properties of quick response, good robustness, and satisfactory overshoot. It is considerably effective in improving the control performance of the hot-grinding system.
A Comprehensive Framework for Representing Semantics via Context and Ontology in the Collaborative Commerce Area
Authors: Mariela Rico, Ma. Laura Caliusco, Ma. Laura Taverna, Omar Chiotti
Venue: Proceedings of the 2007 Latin American Web Conference (2007)

Nowadays, ontologies are widely adopted to represent data semantics and to characterize different kinds of information resources. However, in certain circumstances, they are not enough to efficiently support semantic interoperability due to the lack of context-dependent techniques. This paper presents a comprehensive framework for defining the semantics of the information interchanged between autonomous entities based on the use of context and ontology. To this aim, a motivating scenario that describes a collaborative relationship is analyzed. Finally, advantages and disadvantages of this framework and future trends are discussed.
An Algorithm to Search Minimal Subtree Graphs
Authors: Jing Wang, Ying Li, Xinmei Wang
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

In this paper, we first propose an algorithm to obtain multicast routing graph. The multicast routing algorithm with network coding will consume lesser resource, and is much closer to minimum-cost multicast. A scheme to search minimal subtree graph is presented based on the chosen routing graph. Moreover, upon the minimal subtree graph obtained, we can effectively construct network coding. Then all the network coding problems can be reduced to search the minimal subtree graphs.
Toward a theory of evolution strategies: On the benefits of sex---the (μ/μ, λ) theory
Authors: Hans-Georg Beyer
Venue: Evolutionary Computation (1995)

The multirecombinant (μ/μ, λ) evolution strategy (ES) is investigated for real-valued, N-dimensional parameter spaces. The analysis includes both intermediate recombination and dominant recombination, as well. These investigations are done for the spherical model first. The problem of the optimal population size depending on the parameter space dimension N is solved. A method extending the results obtained for the spherical model to nonspherical success domains is presented. The power of sexuality is discussed and it is shown that this power does not stem mainly from the “combination” of “good properties” of the mates (building block hypothesis) but rather from genetic repair diminishing the influence of harmful mutations. The dominant recombination is analyzed by introduction of surrogate mutations leading to the concept of species. Conclusions for evolutionary algorithms (EAs), including genetic algorithms (GAs), are drawn.
A Low Power Information Redundant Concurrent Error Detecting Asynchronous Processor
Authors: M. Marshall, G. Russell
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

As a result of advances in technology shrinking device dimensions, the occurrence of transient errors is increasing. This together with the concomitant reduction in supply voltages has decreased noise margins causing system reliability to be reduced, at a time when electronic systems are being used increasingly in 'safety critical' applications. Previous work has demonstrated that an information redundant Concurrent Error Detection (CED) scheme using Dong's Code can be applied efficiently to a processor using an asynchronous design style incurring area overheads of approximately 12% [1] when placed on silicon. This paper furthers the above work by extending the capabilities of the processor to include the multiplication function also guarded by a CED scheme, permitting the processor to be used in a wider range of applications; e.g. DSP. The paper also demonstrates that a reduction in power of 22% can be achieved by utilising an asynchronous design style rather than its synchronous counterpart. Furthermore, the power overhead for the asynchronous CED processor was found to be 5% less than that of the synchronous processor without CED. Asynchronous design style is also known to have the inherent benefit of not requiring difficult to design, global timing clock trees and networks.
The New Numerical Integration Algorithm Based on Neural Network
Authors: Li ying Xu, Li jun Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

The numerical integration is an important computing method in science and engineering. An algorithm of neural network based on cosine and sine basis functions is proposed. It uses the output of neural network to approximate to the integrand by training the weights a_k and b_k . The accuracy and efficiency of the algorithm presented are verified by numerical examples.
A Semantic Design Method
Authors: I. T. Hawryszkiewycz
Venue: IEEE Transactions on Software Engineering (1983)

A system design method where the computer system is adapted to user semantics is described. In the method, user semantics are defined as abstract objects using special languages. Both user data semantics and user operations are defined. A translator converts the abstract definitions into internal machine storage representation and machine instructions. Users can then include the defined operations in user programs. Execution of the user operations transforms the internal state consistently with the definition of the operations.
Asymptotic enumeration of dense 0--1 matrices with specified line sums
Authors: E. Rodney Canfield, Catherine Greenhill, Brendan D. McKay
Venue: Journal of Combinatorial Theory Series A (2008)

Let s=(s"1,s"2,...,s"m) and t=(t"1,t"2,...,t"n) be vectors of non-negative integers with @?"i"="1^ms"i=@?"j"="1^nt"j. Let B(s,t) be the number of mxn matrices over {0,1} with jth row sum equal to s"j for 1=
The zero-delay data warehouse: mobilizing heterogeneous database
Authors: Eva Kühn
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

"Now is the time... for the real-time enterprise": In spite of this assertion from Gartner Group the heterogeneity of today's IT environments and the increasing demands from mobile users are major obstacles for the creation of this vision. Yet its technical foundation is available: software architectures based on innovative middleware components that offer a level of abstraction superior to conventional middleware solutions, including distributed transactions and the seamless integration of mobile devices using open standards, crossing the borders between heterogeneous platforms and systems. Space based computing is a new middleware paradigm meeting these demands. As an example we present the real time build-up of data warehouses.
Research on XML United-Signature Technology and Its Implementation
Authors: Jiaxin Qiao
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

In thorough analysis XML signature syntax structure and types, the united signature technology is put forward, research on the processing of united signature by the sender and partial validation by the recipient. In accordance with XML signature, the XML united signature structure and XML Schema is designed, which can resolve the Authenticity, Integrity and Non-repudiation of the data in the multi-operation chain based on the XML communication.
Research note: Design and implementation scheme for deploying IPv4 over IPv6 tunnel
Authors: Tushar M. Raste, D. B. Kulkarni
Venue: Journal of Network and Computer Applications (2008)

IPv4 to IPv6 transition is an inevitable process when deploying IPv6 networks within the present IPv4 Internet. The two protocols are expected to coexist for a number of years during the transition period. A number of transition techniques exist to address the various needs of different networks. One of them is tunneling mechanism. Tunneling means encapsulation of one protocol into another one so that the encapsulated protocol is send as payload on the network. In this paper, a scheme is presented for tunneling of IPv4 packets in IPv6 packets. This scheme will be useful in the future when most of the networks would be converted into IPv6 networks involving minimum IPv4 routing. This technique, coupled with the dual stack approach, enables IPv4 applications to run and interact with other IPv4 applications in both IPv4 and IPv6 network environments without any modification and recompilation, and without NAT, nor any application proxy or gateway.
Static Output Feedback Control of Uncertain Dynamic Fuzzy Systems
Authors: Xiao Guang Yang, Qing Ling Zhang, Xiao Dong Liu, Da Qing Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

This paper examines the problem of static output feedback control of a T-S fuzzy system. The existence of an uncertain static output feedback control is given in terms of the solvability of bilinear matrix inequalities (BMI). An iterative algorithm based on linear matrix inequality (LMI) is developed to compute the uncertain static output feedback gain. A numerical simulation example is used to illustrate the effectiveness and the convergence of the design methodologies.
Network-aware query processing for stream-based applications
Authors: Yanif Ahmad, Uğur Çetintemel
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

This paper investigates the benefits of network awareness when processing queries in widely-distributed environments such as the Internet. We present algorithms that leverage knowledge of network characteristics (e.g., topology, bandwidth, etc.) when deciding on the network locations where the query operators are executed. Using a detailed emulation study based on realistic network models, we analyse and experimentally evaluate the proposed approaches for distributed stream processing. Our results quantify the significant benefits of the network-aware approaches and reveal the fundamental trade-off between bandwidth efficiency and result latency that arises in networked query processing.
PLACE: a query processor for handling real-time spatio-temporal data streams
Authors: Mohamed F. Mokbel, Xiaopeng Xiong, Walid G. Aref, Susanne E. Hambrusch, Sunil Prabhakar, Moustafa A. Hammad
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

The emergence of location-aware services calls for new real-time spatio-temporal query processing algorithms that deal with large numbers of mobile objects and queries. In this demo, we present PLACE (Pervasive Location-Aware Computing Environments); a scalable location-aware database server developed at Purdue University. The PLACE server addresses scalability by adopting an incremental evaluation mechanism for answering concurrently executing continuous spatio-temporal queries. The PLACE server supports a wide variety of stationery and moving continuous spatio-temporal queries through a set of pipelined spatio-temporal operators. The large numbers of moving objects generate real-time spatio-temporal data streams.
A New Similarity Measure for Generalized Web Session Clustering
Authors: Qianwen Yang, Jisong Kou, Fuzan Chen, Minqiang Li
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

A new similarity measure for generalized web session clustering is defined on the common paths of users' navigation patterns (SMCP) in this paper. It divides the similarity of common paths between two sessions into the inner part and the outer part. The traditional k-means is employed to test the performance of similarity measure and by comparing with the visiting order Based (VOB) similarity measure and the path angles Based (PAB) similarity measure, the experiments on both real and synthetic datasets show that clustering using the proposed similarity measure SMCP can yield more than 10% higher accuracy than the VOB and PAB similarity measure in terms of Silhouette value.
Data migration on parallel disks: Algorithms and evaluation
Authors: Leana Golubchik, Samir Khuller, Yoo-Ah Kim, Svetlana Shargorodskaya, Yung-Chun (Justin) Wan
Venue: Algorithmica (2006)

Our work is motivated by the problem of managing data on storage devices, typically a set of disks. Such storage servers are used as web servers or multimedia servers, for handling high demand for data. As the system is running, to exhibit good performance, it needs to respond dynamically to changes in demand for different data items. There are known algorithms for mapping demand to a layout. When the demand changes, a new layout can be computed. In this work we study thedata migration problem, which arises when we need to change one layout to another quickly. This problem has been studied earlier where for each disk a new layout has been prescribed. However, to apply these algorithms effectively, we identify another problem that we refer to as the correspondence problem, whose solution has a significant impact on the overall solution for the data migration problem. We study algorithms for the data migration problem in more detail and identify variations of the basic algorithm that seem to improve performance in practice, even though some of the variations have poor worst-case behavior.
An Energy Efficient Query Processing Algorithm Based on Relevant Node Selection for Wireless Sensor Networks
Authors: Guilin Li, Jianzhong Li
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

In this paper a novel energy efficient algorithm based on relevant node selection is proposed to deal with a new kind of approximate query, named node number constraint query, for wireless sensor networks. The query processing algorithm is composed of three parts: relevant node selection algorithm, energy efficient query dissemination and result collection algorithm. According to the user's precision request, our algorithm selects a part of nodes to answer the user's query then sends query and collects result in an energy efficient way. Simulation results show that the query processing algorithm based on relevant node selection can not only guarantee the precision of the result but also save much more energy than other algorithms.