ppxscal/embedding_network huggingface dataset:
A quantitative man-machine model for cyber security efficiency analysis
Authors: Jyh-Charn Liu, Hoh Peter In
Venue:  (2005)

The analysis of security defense processes is of utmost importance in the management of various cyber-security attacks, which are increasing in scope and rapidity. Organizations need to optimize their resources based on a sound understanding of the level of their security defense processes' efficiency and the impact of their investment. Modeling and characterization of the dynamics of cyber security management are essential to risk prediction, damage assessment, and resource allocations. This dissertation addresses the interactions between human factors and information systems. On the basis of the spiral life cycle model of software development processes, we develop a realistic, holistic security attack-defense model---Man-Machine Model (M3), which combines human factors and information systems' (i.e., machine) states under an integrated analytical framework. M 3 incorporates man and machine components. The man component is comprised of several variables such as Skill Knowledge (SKKN) and Teamwork Quality (TWQ). The machine component is composed of variables such as traffic volume and the amount of downtime. M3 enables the analysis of intrusion detection and incident response process efficiency, i.e., security defense team performance. With data analysis, we formulate and test four major research hypotheses based on the data collected during security experiments. Through hypothesis testing, we evaluate regression models to estimate the security defense team performance (i.e. efficiency) at different levels of human intelligence (e.g., skill and knowledge) and teamwork (e.g., teamwork quality). We assess the fitness and significance of the regression models, and verify their assumptions. Based on these results, organizations can hire those who have an appropriate level of skill and knowledge when it concerns investments to increase the level of skill and knowledge of security personnel. They also can attempt to increase the level of skill and knowledge of security personnel.
Segment pre-selection in decision-tree based speech synthesis systems
Authors: R. E. Donovan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

Corpus based approaches to unit selection for concatenative speech synthesis have become popular in recent years due to their improved sensitivity to unit context over their more simple predecessors. These systems usually make use of large speech databases and employ sophisticated search algorithms to determine the optimal unit sequence to use to synthesise each sentence. For many applications it is not possible to have the entire database, which may be as large as several hundred megabytes, available to the synthesiser at runtime. What is required is some form of off-line pre-selection algorithm to determine which subset of the database enables the highest quality speech synthesis to be performed for a given runtime system size. This paper describes a pre-selection algorithm developed at IBM for use with decision-tree-based concatenative speech synthesisers.
Web Application Scanners: Definitions and Functions
Authors: Elizabeth Fong, Vadim Okun
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

There are many commercial software security assurance tools that claim to detect and prevent vulnerabilities in application software. However, a closer look at the tools often leaves one wondering which tools find what vulnerabilities. This paper identifies a taxonomy of software security assurance tools and defines one type of tool: web application scanner, i.e., an automated program that examines web applications for security vulnerabilities. We describe the types of functions that are generally found in a web application scanner and how to test it.
On Sweep-plane Analysis of Laguerre Voronoi Diagram
Authors: Marina Gavrilova, Jon Rokne
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

We discuss application of the sweep-plane technique for the construction of weighted Voronoi diagram in Laguerre geometry (or Laguerre Voronoi diagram). It is shown that the attempt to construct Laguerre Voronoi diagram utilizing the sweep-plane approach transforms the original problem for a given set of weighted sites to the problem of constructing Laguerre diagram for a different set of sites. It follows that the weighted Voronoi diagram in Laguerre geometry is an invariant of a family of all input sets of sites.
A Multipurpose Code Coverage Tool for Java
Authors: Raghu Lingampally, Atul Gupta, Pankaj Jalote
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Most test coverage analyzers help in evaluating the effectiveness of testing by providing data on statement and branch coverage achieved during testing. If made available, the coverage information can be very useful for many other related activities, like, regression testing, test case prioritization, test-suite augmentation, test-suite minimization, etc. In this paper, we present a Java-based tool JavaCodeCoverage for test coverage reporting. It supports testing and related activities by recording the test coverage for various code-elements and updating the coverage information when the code being tested is modified. The tool maintains the test coverage information for a set of test cases on individual as well as test suite basis and provides effective visualization for the same. Open source database support of the tool makes it very useful for software testing research.
Fault Tolerant Planning for Critical Robots
Authors: Benjamin Lussier, Matthieu Gallien, Jeremie Guiochet, Felix Ingrand, Marc-Olivier Killijian, David Powell
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Autonomous robots offer alluring perspectives in numerous application domains: space rovers, satellites, medical assistants, tour guides, etc. However, a severe lack of trust in their dependability greatly reduces their possible usage. In particular, autonomous systems make extensive use of decisional mechanisms that are able to take complex and adaptative decisions, but are very hard to validate. This paper proposes a fault tolerance approach for decisional planning components, which are almost mandatory in complex autonomous systems. The proposed mechanisms focus on development faults in planning models and heuristics, through the use of diversification. The paper presents an implementation of these mechanisms on an existing autonomous robot architecture, and evaluates their impact on performance and reliability through the use of fault injection.
A Distributed ePedigree Architecture
Authors: Dijiang Huang, Mayank Verma, Archana Ramachandran, Zhibin Zhou
Venue: Proceedings of the 11th IEEE International Workshop on Future Trends of Distributed Computing Systems (2007)

Current ePedigree creation and discovery services rely on a centralized framework, i.e., EPCglobal network. The centralized system has several restrictions to prevent it from being widely adopted. For example, it is un-scalable when ePedigree service requests are increased dramatically due to the item-level product tracking; it has little privacy protection since the product historical information can be easily derived from the Object Name Service (ONS) provided by the centralized EPCglobal network; it is cumbersome since the ePedigree information will be amplified in the local databases along with the product transportation stops; and so on. To overcome the above mentioned problems, we propose a distributed EPC Information Service (EPC-IS), which makes the ePedigree creation and discovery more robust, scaleable, and secure. Using our approach, the ePedigree historical records of a product is created and stored in the ePedigree creating parties' EPC-IS servers; in addition, each EPC-IS server maintains a look up table that stores the EPC-IS providers' one-hop up/down stream information. In this way, the ePedigree service creation and discovery are processed following a chain of processes with a distributed manner. The distributed ePedigree architecture and a set of EPC-IS service protocols are described in this paper.
An efficient algorithm for superresolution in medium field imaging
Authors: Andy C. Yau, N. K. Bose, Michael K. Ng
Venue: Multidimensional Systems and Signal Processing (2007)

In this paper, we study the problem of reconstruction of a high-resolution (HR) image from several blurred low-resolution (LR) image frames in medium field. The image frames consist of blurred, decimated, and noisy versions of a HR image. The HR image is modeled as a Markov random field (MRF), and a maximum a posteriori (MAP) estimation technique is used for the restoration. We show that with the periodic boundary condition, a HR image can be restored efficiently by using fast Fourier transforms. We also apply the preconditioned conjugate gradient method to restore HR images in the aperiodic boundary condition. Computer simulations are given to illustrate the effectiveness of the proposed approach.
Accurate ARMA models with Durbin's second method
Authors: P. M. T. Broersen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

Long intermediate AR models are used in Durbin's (1959) algorithms for ARMA estimation. The order of that long AR model is infinite in the asymptotical theory, but very high AR orders are known to give inaccurate ARMA models in practice. A theoretical derivation is given for two different finite AR orders, as a function of the sample size. The first is the AR order optimal for prediction with a purely autoregressive model. The second theoretical AR order is higher and applies if the previously estimated AR parameters are used for estimating the MA parameters in Durbin's (1960) second, iterative, ARMA method. A sliding window (SW) algorithm is presented that selects good long AR orders for data of unknown processes. With a proper choice of the AR order, the accuracy of Durbin's second method approaches the Cramer-Rao bound for the integrated spectrum and the quality remains excellent if less observations are available.
How should inclusivity influence teaching of ict design?
Authors: David Sloan, Barbara Nelson, Martin Sloan
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

Accessibility and inclusive design is an important aspect of ICT education. This involves not only developing technical skills required to create accessible technology, but also fostering an awareness of the diversity amongst ICT users in terms of their capabilities and access environment. This session explores how CS learners can achieve not only skills in inclusive design but also acquire a more in-depth understanding of diversity and this influences the design of the ICT they produce.
Cryptographic relational algebra for databases using the field authenticator
Authors: Chien-Yuan Chen, Cheng-Yuan Ku, David C. Yen
Venue: Computers Mathematics with Applications (2007)

In this paper, a field authentication scheme, suitable for providing more efficient operations within an encrypted database, is introduced and discussed. Applying the concept of this proposed scheme, the database will be safeguarded and protected for situations such as a ciphertext search attack, a plaintext substitution attack, and/or a ciphertext substitution attack. In addition, this proposed scheme can be used to facilitate the ''projections'' operation executed in the database while also allowing the individual field value to be decrypted and authenticated. It is also important to note that the ''selection'' operation can be directly applied to the resultant database without the tediousness of going through the decryption process by using the random filters concept in the field authentication. Furthermore, the use of the aforementioned concept can eliminate exposure of some unqualified records and, as a result, speed up the process of executing the query.
Quality of service based end-to-end SiMO routing framework in differentiated services networks
Authors: Jian Zhao
Venue: Proceedings of the Performance, Computing, and Communications Conference, 2002. on 21st IEEE International (2002)

Differentiated services (DiffServ) is a proposed architecture for the Internet to support variable QoS requirements using a simple classification scheme. Unlike its counterpart model of IntServ (integrated services) plus RSVP (resource reservation protocol), the DiffServ framework does not need to maintain large state information in core routers and only carries out aggregate resource reservation at edge routers. Therefore, DiffServ calls for a very different routing framework from IntServ. We propose two new QoS-based routing algorithms under the SiMO (single service, multiple options) framework for DiffServ architectures. These are kthQoSR (kth-shortest QoS routing) and EVQoSR (maximum energy value QoS routing). We also introduce QoS extensions to OSPF (open shortest path first) and compare it to our SiMO routing protocols. Our core routing strategy in SiMO, kthQoSR, is executed at the path level and selects one or more routes from a set of computed routes according to defined selection metrics. On the other hand, EVQoSR is a link level, online distributed routing algorithm. Through extensive simulation, we show that our proposed SiMO routing framework can achieve better route qualities in terms of load balancing and network throughput.
An Intelligent Agent-Based Framework for Mobile Business
Authors: Zhiyong Weng, Thomas Tran
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

This paper proposes a mobile, intelligent agent-based framework that allows buyers and sellers to perform business at remote locations. A business participant can generate a mobile, intelligent agent via a mobile device and dispatch the agent to the Internet to do business. The proposed framework brings in several advantages: First, it provides great convenience for traders as business can be conducted anytime and anywhere. Secondly, the user is freed from the time-consuming task of finding and negotiating with appropriate traders. Thirdly, it addresses the problem of limited and expensive connection time for mobile users: A trader can disconnect her mobile device from its server after launching a mobile agent. Later on, she can reconnect and call back the agent for results, therefore minimizing the connection time. Finally, by complying with the standardization body of FIPA, this flexible framework increases the interoperability between agent systems and provides high design scalability.
Internet Technologies and Infrastructure for Asia-Wide Distance Education
Authors: Patcharee Basu, Achmad Husni Thamrin, Shoko Mikawa, Keiko Okawa, Jun Murai
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet (2007)

SOI Asia project aims at Asia-wide distance education development with its design emphasizing on new model of network technologies that provides wide-coverage high-quality network to support high-quality distance education instead of relying on the available Internet connectivity with inadequate quality. A 13- Mbps unidirectional broadcast satellite covers Asia region enabling lecture sharing among student sites. IPv6 Multicast overlay network is established by UDLR and IPv6 tunnel technologies to create a virtual network connecting lecturer-site and student-sites on top of network heterogeneity. Bandwidth optimization and scalability are achieved by IPv6 Multicast. QoS using Policy Routing and ALTQ utilizes and manages bandwidth to ensure high quality lectures. Experiment results show that SOI Asia environment delivers better quality streams with stable rate, high correlation, low data loss and jitter compared to the available Internet connectivity. These design aspects, technology model and experimental results can be the considerations of future region-wide distance education development.
Channel estimation for DS-CDMA with aperiodic spreading codes
Authors: Kemin Li
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

For high performance CDMA communications, multiuser detection is often required to suppress the multiple access interference (MAI). Most multiuser detectors rely on accurate channel information to recover the multiuser digital signals. This paper studies the blind channel estimation problem for DS-CDMA systems using aperiodic spreading codes. The maximum likelihood (ML) estimator is formulated for channel estimation. We first convert the multiuser parameter estimation problem into a set of single user optimization problems via alternating optimization, and then determine the channel parameters for each user using an iterative algorithm derived. It is shown by computer simulation that this iterative algorithm can reach global maxima almost always under medium SNR values.
Let's Get Physical! In, Out and Around the Gaming Circle of Physical Gaming at Home
Authors: Allison Sall, Rebecca E. Grinter
Venue: Computer Supported Cooperative Work (2007)

Physical gaming is a genre of computer games that has recently been made available for the home. But what does it mean to bring games home that were originally designed for play in the arcade? This paper describes an empirical study that looks at physical gaming and how it finds its place in the home. We discuss the findings from this study by organizing them around four topics: the adoption of the game, its unique spatial needs, the tension between visibility and availability of the game, and what it means to play among what we describe as the gaming circle, or players and non-players alike. Finally, we discuss how physical gaming in the home surfaces questions and issues for householders and researchers around adoption, gender and both space and place.
Distributed Data Gathering Scheduling in Multihop Wireless Sensor Networks for Improved Lifetime
Authors: Subhasis Bhattacharjee, Nabanita Das
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

For a multihop sensor network with n sensors, this paper presents an O(n) distributed greedy algorithm for extracting a rooted spanning tree to improve the lifetime of the overall network. It spontaneously determines a data gathering schedule from the sensors towards the base station (the root). No global knowledge about the topology is required for the computation and also each sensor does not need to access the base station directly. Simulation studies show that in terms of system lifetime, the proposed algorithm significantly outperforms the scheduling based on the Minimum Spanning Tree (MST), or the Shortest Path (SP) routing techniques. Performance comparison with PEGASIS [7] shows that the proposed algorithm performs better as more and more nodes die out.
Improving Recoverability in Multi-tier Storage Systems
Authors: Marcos K. Aguilera, Kimberly Keeton, Arif Merchant, Kiran-Kumar Muniswamy-Reddy, Mustafa Uysal
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Enterprise storage systems typically containmultiple storage tiers, each having its own performance, reliability, and recoverability. The primary motivation for this multi-tier organization is cost, as storage tier costs vary considerably. In this paper, we describe a file system called TierFS that stores files at multiple storage tiers while providing high recoverability at all tiers. To achieve this goal, TierFS uses several novel techniques that leverage coupling between multiple tiers to reduce data loss, take consistent snapshots across tiers, provide continuous data protection, and improve recovery time. We evaluate TierFS with analytical models, showing that TierFS can provide better recoverability than a conventional design of similar cost.
Dynamic purity analysis for java programs
Authors: Haiying Xu, Christopher J. F. Pickett, Clark Verbrugge
Venue: Proceedings of the 7th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering (2007)

The pure methods in a program are those that exhibit functional or side effect free behaviour, a useful property in many contexts. However, existing purity investigations present primarily staticresults. We perform a detailed examination of dynamic method purityin Java programs using a JVM-based analysis. We evaluate multiple purity definitions that range from strong to weak, consider purity forms specific to dynamic execution, and accomodate constraintsimposed by an example consumer application, memoization. We show that while dynamic method purity is actually fairly consistent between programs, examining pure invocation counts and the percentage of the byte code instruction stream contained within some pure method reveals great variation. We also show that while weakening purity definitions exposes considerable dynamic purity, consumer requirements can limitthe actual utility of this information.
Student work groups/teams: current practices in an engineering and technology curriculum compared to models found in team development literature
Authors: C. Goodwin
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

Summary form only given. This paper presents the findings of a research survey/questionnaire project conducted by the Organizational Leadership and Supervision Department at the Purdue School of Engineering and Technology at Indiana University Purdue University at Indianapolis, USA. The paper provides a model for appraising any engineering and technology school's current practices in the use of student work teams. The authors focus on "best practices" found in team development literature and provide important information to professors wishing to form student teams. The information is also immediately applicable and valuable to those desiring to improve the outcomes and performance of teams currently operating in classroom situations. The paper itself is evidence of the practicality of the outcomes that may be achieved by trained and directed student work teams.
Transparent result caching
Authors: Amin Vahdat, Thomas Anderson
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1998)

The goal of this work is to develop a general framework for transparently managing the interactions and dependencies among input files, development tools, and output files. By unobtrusively monitoring the execution of unmodified programs, we are able to track process lineage--each process's parent, children, input files, and output files, and file dependency--for each file, the sequence of operations and the set of input files used to create the file. We use this information to implement Transparent Result Caching (TREC) and describe how TREC is used to build a number of useful user utilities. Unmake allows users to query TREC for file lineage information, including the full sequence of programs executed to create a particular output file. Transparent Make uses TREC to automatically generate dependency information by observing program execution, freeing end users from the need to explicitly specify dependency information (i.e., Makefiles can be replaced by shell scripts). Dynamic Web Object Caching allows for the caching of certain dynamically generated web pages, improving server performance and client latency.