ppxscal/embedding_network huggingface dataset:
ST-Tool: A CASE Tool for Security Requirements Engineering
Authors: Paolo Giorgini, Fabio Massacci, John Mylopoulos, Nicola Zannone
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Security Requirements Engineering is emerging as a branch of Software Engineering, spurred by the realization that security must be dealt with early on during the requirements phase. We propose ST-Tool, a CASE tool developed for modeling and analyzing functional and security requirements.
Trusted Computing: Providing Security for Peer-to-Peer Networks
Authors: Shane Balfe, Amit D. Lakhani, Kenneth G. Paterson
Venue: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (2005)

In this paper, we demonstrate the application of Trusted Computing to securing Peer-to-Peer (P2P) networks. We identify a central challenge in providing many of the security services within these networks, namely the absence of stable verifiable peer identities. We employ the functionalities provided by Trusted Computing technology to establish a pseudonymous authentication scheme for peers and extend this scheme to build secure channels between peers for future communications. In support of our work, we illustrate how commands from the Trusted Computing Group (TCG) specifications can be used to implement our approach in P2P networks.
Performance analysis of computational biology applications on hierarchical Grid systems
Authors: Chunxi Chen, B. Schmidt
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

The paper studies the performance of computational biology applications on a hierarchical Grid system. These applications are computationally intensive and range from regular patterns (such as database searching applications) to irregular structured patterns (such as building phylogenetic trees). Grid systems are characterized by resources with different computational power and by networks' with widely varying bandwidth. This makes the development or adaptation of computational biology applications on Grid systems challenging. In this paper, we demonstrate how to develop or adapt computational biology applications for hierarchical Grid systems in order to achieve good performance. In addition, we investigate how different bandwidths between computational resources in Grid systems influence the applications' performance.
Automated publications production system
Authors: Tom Bergeron
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1981)

Ever since the Wang Word Processing link to IBM for review on TSO and/or printing by 3800 TILT came to be, people have been clamoring for more. They can see that with just a few minor changes, the two week average time for a master copy to go through Print Services can be cut down to about 20 minutes of 3800 printing time. Let's make those changes. 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
An Alternative Real-Time Filter Scheme to Block Buffering
Authors: Yen-Jen Chang
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

This paper presents a real-time filter scheme to facilitate the block buffering to reduce the power consumption without delay penalty. Our scheme consists of a new register design, called content-change-aware (CCA) register. By embedding the detection logic in the register, the CCA register is able to sense out the difference between the coming value and the current stored value. This property can be used to accurately filter out all the redundant accesses to the large storage in real-time. Applying the proposed CCA register to the TLB/cache with a single block buffer, the experimental results show that our design can dramatically reduce the average power consumption per TLB/cache access as achieved by using the block buffering, but without compromise of system performance.
Will GENI Be a Magic Lamp or a Dim Bulb?
Authors: Greg Goth
Venue: IEEE Internet Computing (2005)

Without much fanfare, a sweeping new networking research initiative was announced at the ACM Special Interest Group on Data Communications (SIGCOMM) conference at the end of August.
A measurement-driven approach to designing peer-to-peer systems
Authors: Kunwadee Sripanidkulchai
Venue:  (2005)

Peer-to-peer architectures have the potential to provide a massive amount of resources and enable quick deployment of services on the Internet. However, the lack of dependence on any supporting infrastructure raises questions about the feasibility of peer-to-peer architectures in supporting large-scale applications. It is critical to understand peer characteristics, such as their resource constraints and dynamic participation, and application requirements in order to devise high-performance peer-to-peer solutions. In this dissertation, we take a measurement-driven approach to designing peer-to-peer systems. We extract and expose inherent properties of peers using extensive measurements. We then design distributed algorithms that efficiently exploit those properties to scale peer-to-peer applications. For file-sharing systems, we identify and exploit two types of locality to improve scalability. By caching query results to exploit temporal locality, we can provide immediate responses to popular queries and greatly reduce the amount of query and reply traffic. We exploit a second type of locality, interest-based locality, which posits that if a peer has a particular piece of content that one is interested in, it is likely that the peer will have other items that one is interested in as well. We use simple heuristics that exploit interest-based locality to find popular and unpopular content. We evaluate the performance of our solutions using several real-world traces of peer-to-peer file-sharing applications. In overlay multicast, we provide a detailed characterization of the common features of live streaming workloads on the Internet. We identify three key requirements for evaluating the feasibility of peer-to-peer architectures for large scale live streaming: (i) there must be enough resources to construct an overlay, (ii) a stable and connected overlay must be maintained despite the presence of group dynamics, and (iii) the structure of the overlay must be efficient. If these requirements are not satisfied, there is little chance that a peer-to-peer architecture is feasible. We show that in most of the common application scenarios all three requirements are satisfied. Overall, our findings argue for the feasibility of peer-to-peer architectures in supporting two classes of large-scale applications by exposing inherent properties of peer-to-peer systems and exploiting such properties to improve scalability and performance.
Bidirectional segmented-memory recurrent neural network for protein secondary structure prediction
Authors: J. Chen, N. S. Chaudhari
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2006)

The formation of protein secondary structure especially the regions of &#x03b2;-sheets involves long-range interactions between amino acids. We propose a novel recurrent neural network architecture called segmented-memory recurrent neural network (SMRNN) and present experimental results showing that SMRNN outperforms conventional recurrent neural networks on long-term dependency problems. In order to capture long-term dependencies in protein sequences for secondary structure prediction, we develop a predictor based on bidirectional segmented-memory recurrent neural network (BSMRNN), which is a noncausal generalization of SMRNN. In comparison with the existing predictor based on bidirectional recurrent neural network (BRNN), the BSMRNN predictor can improve prediction performance especially the recognition accuracy of &#x03b2;-sheets.
Small size quantum automata recognizing some regular languages
Authors: Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
Venue: Theoretical Computer Science (2005)

Given a class {pα | α ∈ I} of stochastic events induced by M-state 1-way quantum finite automata (1qfa) on alphabet Σ, we investigate the size (number of states) of 1qfa's that δ-approximate a convex linear combination of {pα | α ∈ I}, and we apply the results to the synthesis of small size 1qfa's. We obtain: • An O((Md/δ3) log2(d/δ2)) general size bound, where d is the Vapnik dimension of {pα(w) | w ∈ Σ*}. • For commutative n-periodic events p on Σ with |Σ| = H, we prove an O((H log n/δ2)) size bound for inducing a δ-approximation of ½ + ½ p whenever ||F(p)||1 ≤nH, where F(p) is the discrete Fourier transform of (the vector p associated with) p. • If the characteristic function χL of an n-periodic unary language L satisfies ||F(χL))||1 ≤ n, then L is recognized with isolated cut-point by a 1qfa with O(log n) states. Vice versa, if L is recognized with isolated cut-point by a 1qfa with O(log n) state, then ||F(χL))||1 = O(n log n).
Fair Overload Handling Using Proof-of-Work Functions
Authors: Sebastian Golze, Gero Muhl
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

Overload can reduce the overall performance of a computer system up to a point where the whole service might collapse. Thus, for example the load on a server must be controlled to achieve optimal system performance. Doing so some requests from clients must be rejected. We show that we can distinguish four different types of user profiles, why micropayments are no suitable solution and how a Proof-of-Work based system can be used to allocate the rare resources slots to those clients that generate the maximal use out of these requests. We then present the new HashCashLin function we developed in order to overcome the poor adjustment possibilities of the classic HashCash function and how such a Proof-of-Work can be augmented. We describe our Proof-of-Work auction system and finally we show the results obtained by running a simulated model of our system.
Development and evaluation of an authoring environment for a centralized knowledge repository
Authors: Roberto A. Rocha
Venue:  (2005)

A single knowledge authoring environment can accommodate the wide range of needs imposed by the authors and the knowledge engineering processes associated with a centralized knowledge repository. In this dissertation, three separate studies are presented to support this hypothesis. The studies explore various aspects of the knowledge authoring environment, (1) the software environment itself; (2) the reasons for acceptance or rejection of the authoring tools and (3) the importance of automated feedback processes integrated within the system. The first study focuses upon the requirements, design phase, and implementation of the Knowledge Authoring Tool (KAT). This research focuses upon the needs, features, and requirements in building such an application and details how closely the application meets original expectations. It details usage patterns within the first year of KAT's existence in terms of knowledge content produced, the number of clinical applications served, as well as the number of clinical domain experts currently interacting with the tool. The study defends the need for the authoring environment, as well as its distinctions from other authoring tools used in medical informatics. The second study analyzes cognitive measurements among end-users of the authoring environment to identify which aspects of the software are most important in determining overall &lsquo;acceptance&rsquo; of the application. We approached the study by using validated Likert-based survey questions to test the constructs and relationships defined by the Technology Acceptance Model. Our findings show that the model predicts users' intentions to use the software reasonably well, though usefulness is regarded as more important than ease of use in determining acceptance of the authoring tool. The third study details the development and validation of an automated feedback tool built into the knowledge authoring environment. We assessed the validity of the suggestions proposed by the system by presenting proposed changes to order set templates to clinical domain experts. Of the four types of changes proposed by the system, three were acceptable above a 50&deg;lo threshold among the clinical panel. In summary, we have created an authoring environment to support the distributed development of clinical knowledge base content within a centralized repository. The authoring environment is designed to ease some of the burdens associated with the knowledge base creation and maintenance processes.
A Family of Trusted Third Party Based Fair-Exchange Protocols
Authors: Paul D. Ezhilchelvan, Santosh K. Shrivastava
Venue: IEEE Transactions on Dependable and Secure Computing (2005)

Fair exchange protocols play an important role in application areas such as e-commerce where protocol participants require mutual guarantees that a transaction involving exchange of items has taken place in a specific manner. A protocol is fair if no protocol participant can gain any advantage over an honest participant by misbehaving. In addition, such a protocol is fault-tolerant if the protocol can ensure that an honest participant does not suffer any loss of fairness despite any failures of the participant's node. This paper presents a family of fair exchange protocols for two participants which make use of the presence of a trusted third party, under a variety of assumptions concerning participant misbehavior, message delays, and node reliability. The development is systematic, beginning with the strongest set of the assumptions and gradually weakening the assumptions to the weakest set. The resulting protocol family exposes the impact of a given set of assumptions on solving the problem of fair exchange. Specifically, it highlights the relationships that exist between fairness and assumptions on the nature of participant misbehavior, communication delays, and node crashes. The paper also shows that the restrictions assumed on a dishonest participant's misbehavior can be realized through the use of smartcards and smartcard-based protocols.
Exploring web-based case use in literacy teacher preparation: realities, complexities, possibilities
Authors: Ruby Sanny
Venue:  (2005)

Multiple theoretical perspectives were applied to investigate what happened as four teacher educators used web-based video case technology in their pre-service literacy methods courses. In particular, this study examined the impact of the cases on the teacher educators' course curriculum and instruction and the impact of the teacher educators on the video cases as a technology for pre-service literacy education. Interviews, and observations were conducted and syllabi were collected over one academic year. Analyses were conducted using four theoretical perspectives&mdash;Transformational, Transactional, Deictic, and Critical&mdash;to reveal the powerful influence teacher educators have on the preparation of literacy teachers and the impact of context and surrounding factors on the teacher educators' curriculum and pedagogical practices. This study is particularly informative in four areas: (1) Literacy Methods Course: Findings reveal that the use of the web based video cases changed the curriculum and pedagogy of the all the teacher educators' methods courses, but the resulting changes were not uniform across the four teacher educators studied. (2) Teacher Educators: Results indicated that the teacher makes a difference in pre-service development and that contextual factors for each teacher educator also make a difference. (3) Technology, Literacy, and Teacher Education: It was found that a new literacies perspective was not necessarily taken up in any of these literacy methods classes even though the teacher educators and their students used new technologies. Specific education and support for teacher educators appears to be required for such a perspective to be adopted. (4) Theory for Research in Literacy Teacher Education: Findings revealed that the multiple theoretical perspectives taken in this study were necessary to understand the realities, complexities, and possibilities of the implementation of web-based video cases in pre-service literacy methods courses. No single perspective captured the impact of the use of the video cases. Implications are drawn for future research in literacy teacher preparation, curriculum and practice in pre-service literacy programs and courses; use of technology in the preparation of literacy teachers; and the role of university context and literacy leaders in the development of pre-service literacy teachers and well qualified literacy teacher educators.
Rules for preparing manuscript
Authors: Harold Joseph Highland
Venue: ACM SIGSIM Simulation Digest (1976)

Most outstanding research conducted in the field of modeling and simulation of urban systems since Plato.
Prioritize Code for Testing to Improve Code Coverage of Complex Software
Authors: J. Jenny Li
Venue: Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering (2005)

Code prioritization for testing promises to achieve the maximum testing coverage with the least cost. This paper presents an innovative method to provide hints on which part of code should be tested first to achieve best code coverage. This method claims two major contributions. First it takes into account a "global view" of the execution of a program being tested, by considering the impact of calling relationship among methods/functions of complex software. It then relaxes the "guaranteed" condition of traditional dominator analysis to be "at least" relationship among dominating nodes, which makes dominator calculation much simpler without losing its accuracy. It also then expands this modified dominator analysis to include global impact of code coverage, i.e. the coverage of the entire software other than just the current function. We implemented two versions of code prioritization methods, one based on original dominator analysis and the other on relaxed dominator analysis with global view. Our comparison study shows that the latter is consistently better in terms of identifying code for testing to increase code coverage.
A flexible system for creating music while interacting with the computer
Authors: Zeljko Obrenovic
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Music is a very important part of our lives. People enjoy listening to the music, and many of us find a special pleasure in creating the music. Computers further extended many aspects of our musical experience. Listening to, recording, and creating music is now easier and more accessible to various users. On the other hand, various computing applications exploit the music in order to better support the interaction with users. However, listening to music is generally a passive experience. Although we may change many parameters, the music we listen to generally does not reflect our response, or does so very roughly.In this paper we present a flexible framework that enables active creation of instrumental music based of the implicit dynamics and content of human-computer interaction. Our approach is application independent, and it provides a mapping of musical features to the abstraction of user interaction. This mapping is based on analysis of the dynamic and content of the human-computer interaction. In contrast to the most existing interactive music composition tools, which require explicit interaction with the system, we have provided a more flexible solution that implicitly maps user interaction parameters to the various musical features.
Inelastic tunneling spectra of an alkyl self-assembled monolayer using a MOS tunnel junction as a test-bed
Authors: C. Petit, G. Salace, S. Lenfant, D. Vuillaume
Venue: Microelectronic Engineering (2005)

IETS (Inelastic Electron Tunnelling Spectroscopy) technique was used in Metal-Oxide-Silicon (MOS) tunnel junctions to provide information concerning the vibrational and excitational modes. In this work, we use the IETS method to investigate electron-molecular vibration coupling in SAMs (Self Assembled Monolayer) using the MOS tunnel junctions as a test-bed.
Multi-graph enabled active learning for multimodal web image retrieval
Authors: Xin-Jing Wang, Wei-Ying Ma, Lei Zhang, Xing Li
Venue: Proceedings of the 7th ACM SIGMM international workshop on Multimedia information retrieval (2005)

In this paper, we propose a multimodal Web image retrieval technique based on multi-graph enabled active learning. The main goal is to leverage the heterogeneous data on the Web to improve retrieval precision. Three graphs are constructed on images' content features, textual annotations and hyperlinks respectively, namely Content-Graph, Text-Graph and Link-Graph, which provide complimentary information on the images. By analyzing the three graphs, a training dataset is automatically created and transductive learning is enabled. The transductive learner is a multi-graph based classifier, which simultaneously solves the learning problem and the problem of combining heterogeneous data. This proposed approach, overall, tackles the problem of unsupervised active learning on Web graph. Although the proposed approach is discussed in the context of WWW image retrieval, it can be applied to other domains. The experimental results show the effectiveness of our approach.
Using communicative acts in high-level specifications of user interfaces for their automated synthesis
Authors: Jürgen Falb, Roman Popp, Thomas Röck, Helmut Jelinek, Edin Arnautovic, Hermann Kaindl
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

User interfaces are very important for the success of many computer-based applications these days. However, their development takes time, requires experts for user-interface design as well as experienced programmers and is very expensive. This problem becomes even more severe through the ubiquitous use of a variety of devices such as PCs, mobile phones, PDAs etc., since each of these devices has its own specifics that require a special user interface.Therefore, we developed a tool-supported approach to automatically synthesize multi-device user interfaces from high-level specifications in the form of models. In contrast to previous approaches focusing on abstracting the user interface per se, we make use of communicative acts derived from speech act theory for the specification of desired user intentions in interactions. In this way, we approach a solution to the given problem, since user interfaces can be efficiently provided without experience in implementing them.
Automatically Generating an E-textbook on the Web
Authors: Jing Chen, Qing Li, Weijia Jia
Venue: World Wide Web (2005)

Nowadays, people tend to learn from the Web because it is convenient, and rich of free information. The main means of learning on the Web is by submitting a query to a search engine, and subsequently browsing through the returned results to find relevant information. Although in many cases, a search engine such as Google works quite well, the results returned are often not appropriate for the learning purpose. In this paper, we present a novel approach to automatically generate an E-textbook for a user specified topic hierarchy. Such a technology can ease the learning process to a great extent.