ppxscal/embedding_network huggingface dataset:
Collaboration Engineering For Incident Response Planning: Process Development and Validation
Authors: Mehruz Kamal, Alanah J. Davis, Josephine Nabukenya, Terrance V. Schoonover, Leah R. Pietron, Gert-Jan de Vreede
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Many organizations have plans for incident response strategies. Despite Incident Response Planning (IRP) being an essential ingredient in conjuring security planning procedures in organizations, extensive literature reviews have revealed that there are no collaborative processes in place for such a crucial activity. This study proposes a design for a facilitated incident response planning process using technology such as GSS. Three sessions were conducted and an analysis of the sessions revealed that the facilitated IRP process design held up strongly in terms of efficiency, goal attainment, and session participant satisfaction. Future research implications entail devising an all-encompassing integrative general approach that would be applicable to any form of corporate security development planning process.
Genesis of an undergraduate research experience
Authors: R. A. Madler
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

This paper discusses the genesis and evolution of the undergraduate research experience at the Prescott campus of Embry-Riddle Aeronautical University (ERAU). ERAU-Prescott is an undergraduate campus with a strong aerospace engineering program. The faculty generally have very high teaching loads (12 hours) which makes it difficult to perform cutting edge research during the school year. Most faculty do the bulk of their research during the summer. The undergraduate research opportunity helps both the students and the faculty. The students get valuable research experience, apart-time job related to their field of study, and the opportunity to publish papers. The faculty gains in that they are able to get more research done. This paper briefly discussed the types of projects their undergraduate students have been involved in, the benefits for faculty, students and campus and also the process of creating this program. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Tcl commands as media in a distributed multimedia toolkit
Authors: Jonathan L. Herlocker, Joseph A. Konstan
Venue: Proceedings of the 3rd Annual USENIX Workshop on Tcl/Tk - Volume 3 (1995)

This paper discusses the design and implementation of a command stream based on Tcl. A command stream is a series of arbitrary commands that can be tightly synchronized with other media in a distributed multimedia presentation. In TclStream, we represent an arbitrary command as a collection of fragments of Tcl code. The command stream medium supports the standard manipulation functions of multimedia environments: reverse, fast-forward, random access, and variable speed. The ability to specify arbitrary actions, combined with fine playback control, make TclStream an extremely flexible and powerful presentation medium.
Automatic on-line failure diagnosis at the end-user site
Authors: Joseph Tucek, Shan Lu, Chengdu Huang, Spiros Xanthos, Yuanyuan Zhou
Venue: Proceedings of the 2nd conference on Hot Topics in System Dependability - Volume 2 (2006)

Production run software failures cause endless grief to end-users, and endless challenges to programmers as they commonly have incomplete information about the bug, facing great hurdles to reproduce it. Users are often unable or unwilling to provide diagnostic information due to technical challenges and privacy concerns; even if the information is available, failure analysis is time-consuming. We propose performing initial diagnosis automatically and at the end user's site. The moment of failure is a valuable commodity programmers strive to reproduce-- leveraging it directly reduces diagnosis effort while simultaneously addressing privacy concerns. Additionally, we propose a failure diagnosis protocol. So far as we know, this is the first such automatic protocol proposed for on-line diagnosis. By mimicking the steps a human programmer follows dissecting a failure, we deduce important failure information. Beyond on-line use, this can also reduce the effort of in-house testing. We implement some of these ideas. Using lightweight checkpoint and rollback techniques and dynamic, run-time software analysis tools, we initiate the automatic diagnosis of several bugs. Our preliminary results show that automatic diagnosis can efficiently and accurately find likely root causes and fault propagation chains. Further, normal execution overhead is only 2%.
The rectangular Pisarenko method
Authors: J. Fuchs
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

Most high-resolution (HR) direction of arrival estimation schemes require the extraction of a low dimensional subspace, a task generally accomplished via a standard eigen-decomposition (ED) that requires at least O(N/sup 3/) flops for an order N matrix. Different techniques have been proposed to reduce this computational load to O(N/sup 2/P) flops where P is the number of sources. The method we propose is a HR technique that requires O(P/sup 3/) flops. The price to be paid for this drastic computational saving is an increase of the variance of the direction estimates which is of the order T/sup -1/N/sup -2/ for the proposed procedure while it is of order T/sup -1/N/sup -3/ (T the number of snapshots) for efficient procedures. The idea behind the method is to apply a Pisarenko (1973) like method to a rectangular matrix extracted from the Toeplitz estimated covariance matrix.
Tutorial T2: Organic Electronics: Technology, Devices, Circuits, and Applications
Authors: S. Sundar Kumar Iyer, Vivek Subramanian
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

The field of organic semiconductor based electronics has seen significant and unprecedented progress in the past decade. Low-cost, less energy-intensive and high-throughput production, implementation on flexible and non-planar surfaces, novel applications, as well as the potential to move to more environmentally friendly electronics makes this technology particularly attractive. A wide range of applications of organic electronics are being currently explored, including displays, lighting, solar cells, printed RFID tags and disposable low-cost sensors. Work in some areas, such as organic light emitting diodes used in displays, have matured and have moved into production. Other fields, such as organic RFID tags and sensors are already in industrial development, and preliminary products are expected within the next few years.
On-line non-stationary ICA using mixture models
Authors: A. Ahmed
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

In this paper we address the problem of on-line source separation with sources modelled as mixtures of Gaussians which are linearly combined via a series of non-stationary mixing matrices. The online recovery of the sources from the observations is a non-linear statistical filtering problem that we address using state of the art particle filter methods. Simulations are presented and satisfactory results are obtained.
A distributed shared memory facility for FreeBSD
Authors: Pedro Souto, Eugene W. Stark
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1997)

This paper describes the design and implementation of a distributed shared memory facility we have implemented for the FreeBSD operating system (a descendant of 4.4BSD that runs on the PC architecture). Interesting aspects of the design are: (1) the consistency protocol uses unreliable datagram communication, but is robust with respect to message loss, and in the normal case requires only two datagrams to handle a read fault; (2) the facility provides a simple programming interface that does not require any socket or network programming to use; (3) the facility extends the FreeBSD VM system in a very non-intrusive way.
Automated antenna positioning algorithms for wireless fixed-access networks
Authors: Yehuda Ben-Shimol, Boaz Ben-Moshe, Yoav Ben-Yehezkel, Amit Dvir, Michael Segal
Venue: Journal of Heuristics (2007)

This article addresses a real-life problem - obtaining communication links between multiple base station sites, by positioning a minimal set of fixed-access relay antenna sites on a given terrain. Reducing the number of relay antenna sites is considered critical due to substantial installation and maintenance costs. Despite the significant cost saved by eliminating even a single antenna site, an inefficient manual approach is employed due to the computational complexity of the problem. From the theoretical point of view we show that this problem is not only NP hard, but also does not have a constant approximation. In this paper we suggest several alternative automated heuristics, relying on terrain preprocessing to find educated potential points for positioning relay stations. A large-scale computer-based experiment consisting of approximately 7,000 different scenarios was conducted. The quality of alternative solutions was compared by isolating and displaying factors that were found to affect the standard deviation of the solutions supplied by the tested heuristics. The results of the simulation based experiments show that the saving potential increases when more base stations are needed to be interconnected. The designs of a human expert were compared to the automatically generated solutions for a small subset of the experiment scenarios. Our studies indicate that for small networks (e.g., connecting up to ten base stations), the results obtained by human experts are adequate although they rarely exceed the quality of automated alternatives. However, the process of obtaining these results in comparison to automated heuristics is longer. In addition, when more base station sites need to be interconnected, the human approach is easily outperformed by our heuristics, both in terms of better results (fewer antennas) and in significant shorter calculation times.
The roles of group potency and information and communication technologies in the relationship between task conflict and team effectiveness: A longitudinal study
Authors: Eva M. Lira, Pilar Ripoll, José M. Peiró, Pilar González
Venue: Computers in Human Behavior (2007)

The effects of task conflict on group effectiveness are far from conclusive. In order to further clarify this relationship, a contingency approach has been suggested. In this context, the present study examines the roles of group potency and information and communication technologies (ICTs) in the relationship between task conflict and team effectiveness. The study involved 44 groups of 4 members each, working in two communication media. Twenty-two groups worked in a face-to-face condition, and the other 22 groups worked in a computer-mediated communication condition. The groups developed a project during four weekly sessions over a one-month period. The results showed that group potency moderated the relationship between task conflict and group effectiveness. However, the communication medium did not play a moderator role in these relationships.
Coupling of quantum angular momenta: an insight into analogic/discrete and local/global models of computation
Authors: Annalisa Marzuoli, Mario Rasetti
Venue: Natural Computing: an international journal (2007)

In the past few years there has been a tumultuous activity aimed at introducing novel conceptual schemes for quantum computing. The approach proposed in (Marzuoli and Rasetti, 2002, 2005a) relies on the (re)coupling theory of SU(2) angular momenta and can be viewed as a generalization to arbitrary values of the spin variables of the usual quantum-circuit model based on `qubits' and Boolean gates. Computational states belong to finite-dimensional Hilbert spaces labelled by both discrete and continuous parameters, and unitary gates may depend on quantum numbers ranging over finite sets of values as well as continuous (angular) variables. Such a framework is an ideal playground to discuss discrete (digital) and analogic computational processes, together with their relationships occurring when a consistent semiclassical limit takes place on discrete quantum gates. When working with purely discrete unitary gates, the simulator is naturally modelled as families of quantum finite states-machines which in turn represent discrete versions of topological quantum computation models. We argue that our model embodies a sort of unifying paradigm for computing inspired by Nature and, even more ambitiously, a universal setting in which suitably encoded quantum symbolic manipulations of combinatorial, topological and algebraic problems might find their `natural' computational reference model.
Explicit Safety Property Strengthening in SAT-based Induction
Authors: Vishnu C. Vimjam, Michael S. Hsiao
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Strengthening a property allows it to be falsified/verified at an earlier induction depth. In this paper, we propose new preprocessing techniques for explicitly identifying co-invariants for a given safety property which are then added to that property for faster verification. First, we employ a path-oriented decision making engine to quickly identify several states which have paths to states violating the property. Next, we generate a set of candidate co-invariants and propose an induction-based technique to learn true co-invariants among those candidates. All the learned co-invariants are minimized using resolution and added to the original property to strengthen it. Experiments show that the induction depth needed to prove many safety properties can be significantly reduced via our strengthening, thereby achieving more than an order of magnitude runtime improvements.
Second-tier cache management using write hints
Authors: Xuhui Li, Ashraf Aboulnaga, Kenneth Salem, Aamer Sachedina, Shaobo Gao
Venue: Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4 (2005)

Storage servers, as well as storage clients, typically have large memories in which they cache data blocks. This creates a two-tier cache hierarchy in which the presence of a first-tier cache (at the storage client) makes it more difficult to manage the second-tier cache (at the storage server). Many techniques have been proposed for improving the management of second-tier caches, but none of these techniques use the information that is provided by writes of data blocks from the first tier to help manage the second-tier cache. In this paper, we illustrate how the information contained in writes from the first tier can be used to improve the performance of the second-tier cache. In particular, we argue that there are very different reasons why storage clients write data blocks to storage servers (e.g., cleaning dirty blocks vs. limiting the time to recover from failure). These different types of writes can provide strong indications about the current state and future access patterns of a first-tier cache, which can help in managing the second-tier cache. We propose that storage clients inform the storage servers about the types of writes that they perform by passing write hints. These write hints can then be used by the server to manage the second-tier cache. We focus on the common and important case in which the storage client is a database system running a transactional (OLTP) workload. We describe, for this case, the different types of write hints that can be passed to the storage server, and we present several cache management policies that rely on these write hints. We demonstrate using trace driven simulations that these simple and inexpensive write hints can significantly improve the performance of the second-tier cache.
OverQos: an overlay based architecture for enhancing internet Qos
Authors: Lakshminarayanan Subramanian, Ion Stoica, Hari Balakrishnan, Randy H. Katz
Venue: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1 (2004)

This paper describes the design, implementation, and experimental evaluation of OverQoS, an overlay-based architecture for enhancing the best-effort service of today's Internet. Using a Controlled loss virtual link (CLVL) abstraction to bound the loss rate observed by a traffic aggregate, OverQoS can provide a variety of services including: (a) smoothing packet losses; (b) prioritizing packets within an aggregate; (c) statistical loss and bandwidth guarantees. We demonstrate the usefulness of OverQoS using two sample applications. First, RealServer can use OverQoS to improve the signal quality of multimedia streams by protecting more important packets at the expense of less important ones. Second, Counterstrike, a popular multiplayer game, can use OverQoS to avoid frame drops and prevent end-hosts from getting disconnected in the presence of loss rates as high as 10%. Using a wide-area overlay testbed of 19 hosts, we show that: (a) OverQoS can simultaneously provide statistical loss guarantees of 0.1% coupled with statistcal bandwidth guarantees ranging from 100 Kbps to 2 Mbps across international links and broadband end-hosts; (b) OverQoS incurs a low bandwidth overhead (typically less than 5%) to achieve the target loss rate, and (c) the increase in the end-to-end delay is bounded by the round-trip-time along the overlay path.
An energy-efficient multipath routing protocol for wireless sensor networks: Research Articles
Authors: Ye Ming Lu, Vincent W. S. Wong
Venue: International Journal of Communication Systems (2007)

The energy consumption is a key design criterion for the routing protocols in wireless sensor networks. Some of the conventional single path routing schemes may not be optimal to maximize the network lifetime and connectivity. In this paper, we propose a distributed, scalable and localized multipath search protocol to discover multiple node-disjoint paths between the sink and source nodes. We also propose a load balancing algorithm to distribute the traffic over the multiple paths discovered. We compare our proposed scheme with the directed diffusion, directed transmission, N-to-1 multipath routing, and the energy-aware routing protocols. Simulation results show that our proposed scheme has a higher node energy efficiency, lower average delay and control overhead than those protocols. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Developing interactive multimedia Learning Objects using QuickTime
Authors: Thomas Cochrane
Venue: Computers in Human Behavior (2007)

This paper focuses upon the application of the multimedia architecture 'QuickTime' for developing pedagogically sound interactive Learning Objects to support the teaching of principles of Audio Engineering. The project used an action research methodology in the design and evaluation of four successive Learning Objects by several different groups of users. The MERLOT criteria for evaluating Learning Objects was modified and utilized in the development process and the subsequent insights gained from developing and evaluating the Learning Objects are highlighted.
You can take it with you: profile transportability
Authors: Blaise W. Liffick, Gary Zoppetti
Venue: ACM SIGCSE Bulletin (2007)

This paper describes the Personal Portable Profile (P3) system, which captures the characteristics of a user profile from one computer and copies them to a second computer. This is accomplished through an auto-run program stored on a UD-RW flash drive device. Such a system will be useful for those with disabilities by allowing them to easily set the interaction characteristics of any computer they encounter to their "home" settings.
Technology and Strategies for Realizing Service-Oriented Architectures with Web Services
Authors: William (Dave) Haseman, Marc N. Haines, Frank Armour
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Service-oriented architectures and Web services are becoming an integral part of the IT landscape. An increasing number of organizations are building service-oriented architectures, all major application vendors have incorporated Web services interfaces in their products, and Web services are becoming an important mechanism for business-to-business transactions. The technology for realizing service-oriented architectures is maturing, making initial adoption easier. However, with larger deployments of Web services in organizations, new questions related to implementation strategies, governance approaches, and broader organizational impacts need to be considered. This mini-track addresses some of these issues in its two sessions. The first session focuses on the adoption, use, and impact of SOA and Web services technology, whereas the second session focuses on the aspect of software development in the context of SOA and Web services.
Informing the Design of User Studies on Conceptual Interference Frameworks
Authors: Ricardo Morla, Nigel Davies
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

The problem of interference is likely to be commonplace in deployed ubiquitous computing systems. A conceptual framework was proposed in [1] to help researchers address this problem. Evaluating conceptual frameworks such as this is a challenging task; one approach to do so is to design and conduct user studies of how researchers address interference using such frameworks. In this paper we provide insights on the design of such user studies with the help of a formative evaluation of the framework proposed in [1]. We created a scenario in which different components are deployed and interfere with each other, and asked researchers to identify, describe, and propose solutions to interference in this scenario. We observed two groups of researchers tackling the same problem of interference, one group using the interference framework and the other not using the framework. We build on this evaluation to inform the methodology and the research challenges of future user studies of conceptual interference frameworks.
High speed transport networks and synchronization techniques
Authors: C. S. Ullas Kumar
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

High-Speed Transport mechanisms are becoming increasingly important as the demand for high bandwidth continues to grow. A number of High-Speed networks are evolved through various transport techniques like Plesiochronous Digital Hierarchy (PDH), Synchronous Digital Hierarchy (SDH), Dense Wavelength Division Multiplexing (DWDM) and Digital Wrappers. With complex architectures, synchronization of these networks becomes quite a challenging task. This paper discusses evolution of digital networks and synchronization architectures. The International Telecommunication Union (ITU) recommendation for SDH Equipment Slave Clocks (SEC) timing specification is G.813. The paper also covers implementations of SDH Equipment Slave Clocks and their timing characteristics. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player