ppxscal/embedding_network huggingface dataset:
Specification and automated processing of security requirements (SAPS'05)
Authors: Carsten Rudolph, Antonio Maña
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

The first edition of SAPS (in 2004) focused on the development of tools to automate software engineering processes with support for security. Our focus in this edition will be on the tools to automate processing, validation and monitoring of security requirements, both during development and during operation of the system. Security and reliability issues are rarely considered at the initial stages of software development. The erroneous consideration of security technology as supplementary, and the lack of integration of security engineering techniques within software engineering processes have very negative consequences. Approaches integrating security issues in software engineering processes are especially relevant to SAPS. Good security measures can fail due to errors in design or implementation. Therefore, automated tools are essential for the analysis and deployment of secure systems. Comprehensive approaches, encompassing all phases of development are encouraged. Furthermore, in the near future, the increasing dynamism, heterogeneity and complexity of emerging computing paradigms and environments such as grid computing, mixed-mode systems or ambient intelligence, along with the disappearing notion of system boundaries introduced by these paradigms, will make it impossible for security engineers to foresee all possible situations that may arise during system operation, therefore increasing the need for automated support for the processing of security.
Teaching quality object-oriented programming
Authors: Yishai A. Feldman
Venue: Journal on Educational Resources in Computing (JERIC) (2005)

Computer science students need to learn how to write high-quality software. An important methodology for achieving quality is design-by-contract, in which code is developed together with its specification, which is given as class invariants and method pre- and postconditions. This paper describes practical experience in teaching design-by-contract and other principles of object-oriented programming and design by a comprehensive set of programming exercises. These are implemented in Java, augmented with a design-by-contract tool. The conceptual gap between the theoretical principles taught in the course and the capabilities of this programming environment causes pedagogical problems; these problems and some solutions are discussed in this paper.
Optimal Task Rate Selection in Fixed Priority Systems
Authors: Enrico Bini, Marco Di Natale
Venue: Proceedings of the 26th IEEE International Real-Time Systems Symposium (2005)

The design phase of any real-time system requires balancing the limited computational resources against the functional requirements and the performance of the application. The optimal design solution can be obtained by solving an optimization problem where the system performance is maximized within the schedulability constraints. In this paper, we provide a procedure that finds the task activation rates maximizing a performance function within the deadline constraints in systems scheduled by fixed priorities. First, we describe the exact feasibility region in the domain of task frequencies. Then, we introduce a procedure that starts by finding an initial solution, and incrementally improves it by using an original branch and bound search, until the global optimum is reached. Experiments show that our algorithm finds the optimal task periods for practical problems with a remarkable speedup, if compared with existing techniques. When the size of the problem makes the global search intractable, the experiments show that the algorithm can still find a high quality solution in the very early steps.
Understanding program performance using temporal vertical profiles
Authors: Matthias Hauswirth
Venue:  (2005)

Modern programming languages support a rich set of features that provide significant software engineering benefits. However, these features often degrade performance and require complex and multilayered runtime systems. These runtime systems interact with the application, making it harder to understand and tune overall system performance. Thus, understanding the performance of modern systems requires profiling information spanning all levels of the execution stack, such as the hardware, operating system, virtual machine, and application. In this work we introduce a methodology, called temporal vertical profiling, that enables this level of understanding. We illustrate the efficacy of this approach by providing deep understanding of performance problems of a number of Java applications running on a virtual machine with vertical profiling support. Even with our methodology, this task is labor intensive. To alleviate this problem, we present techniques to automate parts of the temporal vertical profiling approach. Our methodology is based on the reasoning about relationships between the temporal traces of performance metric values measured in the various subsystems on all layers of a computer system. We show how to automate important steps of our methodology: Our trace alignment technique aligns traces obtained from separate runs so that one can reason across the traces; and our correlation-based ranking and causality-based filtering techniques sift through hundreds of metrics to find ones that have a bearing on a performance anomaly of interest. We implemented these techniques in our temporal vertical profiling infrastructure and were able to significantly speed up the search for the causes of bad performance. By incorporating temporal vertical profiling into a programming environment, programmers will be able to understand how their programs interact with the underlying abstraction levels, from application server, virtual machine, and operating system, all the way down to the hardware.
Towards effective strategies for monolingual and bilingual information retrieval: Lessons learned from NTCIR-4
Authors: Yan Qu, David A. Hull, Gregory Grefenstette, David A. Evans, Motoko Ishikawa, Setsuko Nara, Toshiya Ueda, Daisuke Noda, Kousaku Arita, Yuki Funakoshi, Hiroshi Matsuda
Venue: ACM Transactions on Asian Language Information Processing (TALIP) (2005)

At the NTCIR-4 workshop, Justsystem Corporation (JSC) and Clairvoyance Corporation (CC) collaborated in the cross-language retrieval task (CLIR). Our goal was to evaluate the performance and robustness of our recently developed commercial-grade CLIR systems for English and Asian languages. The main contribution of this article is the investigation of different strategies, their interactions in both monolingual and bilingual retrieval tasks, and their respective contributions to operational retrieval systems in the context of NTCIR-4. We report results of Japanese and English monolingual retrieval and results of Japanese-to-English bilingual retrieval. In monolingual retrieval analysis, we examine two special properties of the NTCIR experimental design (two levels of relevance and identical queries in multiple languages) and explore how they interact with strategies of our retrieval system, including pseudo-relevance feedback, multi-word term down-weighting, and term weight merging strategies. Our analysis shows that the choice of language (English or Japanese) does not have a significant impact on retrieval performance. Query expansion is slightly more effective with relaxed judgments than with rigid judgments. For better retrieval performance, weights of multi-word terms should be lowered. In the bilingual retrieval analysis, we aim to identify robust strategies that are effective when used alone and when used in combination with other strategies. We examine cross-lingual specific strategies such as translation disambiguation and translation structuring, as well as general strategies such as pseudo-relevance feedback and multi-word term down-weighting. For shorter title topics, pseudo-relevance feedback is a major performance enhancer, but translation structuring affects retrieval performance negatively when used alone or in combination with other strategies. All experimented strategies improve retrieval performance for the longer description topics, with pseudo-relevance feedback and translation structuring as the major contributors.
A New Complicated-Knowledge Representation Approach Based on Knowledge Meshes
Authors: Hong-Sen Yan
Venue: IEEE Transactions on Knowledge and Data Engineering (2006)

This paper presents a new complicated-knowledge representation method for the self-reconfiguration of complex systems such as complex software systems, complex manufacturing systems, and knowledgeable manufacturing systems. Herein, new concepts of a knowledge mesh (KM) and an agent mesh (AM) are proposed along with a new KM-based approach to complicated-knowledge representation. KM is the representation of such complicated macroknowledge as an advanced manufacturing mode, focusing on knowledge about the structure, functions, and information flows of an advanced manufacturing system. The multiple set, KM, and the mapping relationships between both, are then formally defined. The union, intersection, and minus operations on the multiple sets are proposed, and their properties proved. Then, the perfectness of a KM, the redundancy set between the two KMs, and the multiple redundancy set on the redundancy set are defined. Three examples are provided to illustrate the concepts of the KM, multiple set, multiple redundancy set, and logical operations. On the basis of the above, the KM-based inference engine is presented. In logical operations on KMs, each KM is taken as an operand. A new KM obtained by operations on KM multiple sets can be mapped into an AM for automatic reconfiguration of complex software systems. Finally, the combination of two real management modes is exemplified for the effective application of the new KM-based method to the self-reconfiguration of complex systems. It is worth mentioning that KM multiple sets can also be taken as a new formal representation of software systems if their corresponding AMs are the real software systems.
Approximate factorizations of distributions and the minimum relative entropy principle
Authors: Heinz Mühlenbein, Robin Höns
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

Estimation of Distribution Algorithms (EDA) have been proposed as an extension of genetic algorithms. In this paper the major design issues of EDA's are discussed within a general interdisciplinary framework, the maximum entropy approximation. Our EDA algorithm FDA assumes that the function to be optimized is additively decomposed (ADF). The interaction graph GADF is used to create exact or approximate factorizations of the Boltzmann distribution. The relation between FDA factorizations and the MaxEnt solution is shown. We introduce a second algorithm, derived from the Bethe-Kikuchi approach developed in statistical physics. It tries to minimize the Kullback-Leibler divergence KLD(q\p&beta;) to the Boltzmann distribution p&beta; by solving a difficult constrained optimization problem. We present in detail the concave-convex minimization algorithm CCCP to solve the optimization problem. The two algorithms are compared using popular benchmark problems (2-d grid problems, 2-d Ising spin glasses, Kaufman's n &mdash; k function.) We use instances up to 900 variables.
Toward a Realistic Task Scheduling Model
Authors: Oliver Sinnen Leonel Augusto Sousa
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

Task scheduling is an important aspect of parallel programming. Most of the heuristics for this NP-hard problem are based on a very simple system model of the target parallel system. Experiments revealed the inappropriateness of this classic model to obtain accurate and efficient schedules for real systems. In order to overcome this shortcoming, a new scheduling model was proposed that considers the contention for communication resources. Even though the accuracy and efficiency improved with the consideration of contention, the new contention model is still not good enough. The crucial aspect is the involvement of the processor in communication. This paper investigates the involvement of the processor in communication and its impact on task scheduling. A new system model is proposed based on the contention model that is aware of the processor involvement. The challenges for the scheduling techniques are analyzed and two scheduling algorithms are proposed. Experiments on real parallel systems show the significantly improved accuracy and efficiency of the new model and algorithms.
More optimal strokes for NPR sketching
Authors: J. P. Lewis, Nickson Fong, Xie XueXiang, Seah Hock Soon, Tian Feng
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

Sketching is a drawing style where approximations and successive refinement in the drawing process are evident. The approximation of contours in sketching involves multiple overlapping strokes that are relatively long in regions of low curvature and shorter in high-curvature areas, yet unimportant high-curvature details are omitted in the initial stages of a sketch. Rendering contours with a single long stroke does not capture the feel of a sketch, and a simple strategy of breaking strokes at curvature maxima is easily confused by unimportant details and noise. We address the contour breaking problem for sketching by clustering samples of the contour based on proximity and orientation, making use of a global clustering algorithm (normalized cuts). The strokes generated by this approach qualitatively resemble those produced by real artists, and the successive approximation effect seen in sketching can be simulated by employing our approach at a succession of scales (increasing the number of clusters).
An Approach to Execute Conditional Branches onto SIMD Multi-Context Reconfigurable Architectures
Authors: F. Rivera, M. Fernandez, N. Bagherzadeh
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

Reconfigurable architectures have becoming very relevant in recent years. In this paper we propose a methodology dedicated to analyze interactive applications in order to execute them in a SIMD reconfigurable architecture taking into account power / performance trade-offs. This methodology starts from a kernel description of the interactive application. Kernels are conditionally executed depending on dynamic conditions like user¿s input data manipulation. The volume of data involved in this kind of applications combined with user¿s actions occurring at unexpected times strongly impact on performance. We define an execution model to deal with conditional branches accompanied by a data prefetch scheme in order to avoid reconfigurable processing unit stalls due to operands unavailability. Experimental results satisfy time constraints of interactive applications and show a power effective solution for them.
The social organization of computing: the university and the sociology department
Authors: John Sonquist, Frank Sim
Venue: ACM SIGSOC Bulletin (1975)

The following material is extracted from a paper presented at the meetings of the American Sociological Association, Montreal, August, 1974. We have concentrated on giving a survey of the positive proposals, and the discussion of problems involved in them, contained in the full paper. Parenthetic comments show where material has been deleted that is not a continuation of the preceding text. Copies of the full paper are available from the authors; it is a working draft, and they earnestly solicit reactions. The general purpose is to stimulate discussion of effective organization of computing for social and behavioral scientists in colleges and universities, and to provide some useful aids for presentation of the case for better computational support to administrative personnel. It may have some wider relevance, both for other settings and for substantive analysis.
IBM system/360 principles of operation
Authors: IBM
Venue:  (1964)

This manual is a comprehensive presentation of the eharaeteristies, functions, and features of the IBM System/ 360. The material is presented in a direct manner, assuming that the reader has a basic knowledge of IBM data processing systems and has read the IBM System/360 Systems Summary, Form A22-6810. The manual is useful for individual study, as an instruction aid, and as a machine reference manual. The manual defines System/360 operating principles, central processing unit, instructions, system control panel, branching, status switching, interruption system, and input/output operations. Descriptions of specific input/output devices used with System/360 appear in separate publications. Also, details unique to each model of the System/360 appear in separate publications.
On the Costs for Reliable Messaging in Web/Grid Service Environments
Authors: Shrideep Pallickara, Geoffrey Fox, Beytullah Yildiz, Sangmi Lee Pallickara, Sima Patel, Damodar Yemme
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

As Web Services have matured they have been substantially leveraged within the academic, research and business communities. An exemplar of this is the realignment, last year, of the dominant Grid application framework — Open Grid Services Infrastucture (OGSI) — with the emerging consensus within the Web Services community. Reliable messaging is an important component within the Web Services stack. There are two competing, and very similar, specifications within this domain viz. WS-ReliableMessaging (WSRM) and WS-Reliability (WSR); this work focuses on the WSRM specification. In this paper we provide an overview of the WSRM protocol, describe our implementation of WSRM, and present an analysis of the costs (in terms of latencies and memory utilizations) involved in the use of WSRM. Since WSRM is very similar to WS-Reliability we expect the performance of WSRM to be very similar to that of WSR. We hope that the work presented here helps researchers and systems designers gauge the suitability of Web Services based reliable messaging in their applications and also to make appropriate trade-offs, which includes inter alia interoperability, guarantees, quality of service and performance.
Educational Tool for the Demonstration of DfT Principles Based on Scan Methodologies
Authors: Josef Stmadel, Zdenek Kotasek
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

In the paper, the principles of Scan Educational Tool are presented. First, the motivation for this activity is briefly mentioned. Then, the structure of software package together with the principles of communicating and controlling the tools belonging to the system are explained. It is shown how the system can be utilized for testability analysis and design for testability demonstrations resulting in applying scan design principles in the design.
Distributed-Log-based Scheme for IP Traceback
Authors: Yi-Nan Jing, Peng Tu, Xue-Ping Wang, Gen-Du Zhang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

IP traceback is one of the most effective techniques to defeat the denial-of-service attacks and distributed denial-of-service attacks. And based on previous research, available probabilistic packet marking (PPM) schemes have more advantages than other IP traceback techniques. But the traditional schemes have too low marking packets utilization. In this paper, a new distributed-log-based scheme (DLS), which combines PPM and logging techniques, is proposed to utilize marking packets sufficiently. And, theoretical analysis and simulation results have proven that this scheme can converge more quickly than others. Based on this scheme the origin of an attack path can be traced by only several packets. Moreover, a MACenhanced hierarchical IP traceback system (HITS) is proposed to supply a gap of end-host schemes. We believe that MAC-enhanced HITS can be deployed and managed more conveniently and securely than endhost schemes. And the traceback results educed by it are more credible and authoritative.
The Development of Embodied Cognition: Six Lessons from Babies
Authors: Linda Smith, Michael Gasser
Venue: Artificial Life (2005)

The embodiment hypothesis is the idea that intelligence emerges in the interaction of an agent with an environment and as a result of sensorimotor activity. We offer six lessons for developing embodied intelligent agents suggested by research in developmental psychology. We argue that starting as a baby grounded in a physical, social, and linguistic world is crucial to the development of the flexible and inventive intelligence that characterizes humankind.
A comparison of tight generalization error bounds
Authors: Matti Kääriäinen, John Langford
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We investigate the empirical applicability of several bounds (a number of which are new) on the true error rate of learned classifiers which hold whenever the examples are chosen independently at random from a fixed distribution.The collection of tricks we use includes:1. A technique using unlabeled data for a tight derandomization of randomized bounds.2. A tight form of the progressive validation bound.3. The exact form of the test set bound.The bounds are implemented in the semibound package and are freely available.
Social acceptance of proactive mobile services: observing and anticipating cultural aspects by a sociology of user experience method
Authors: Fabrice Forest, Leena Arhippainen
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

This paper describes the method of a sociological inquiry achieved in France and Finland within the ADAMOS project. The goals of this inquiry are to understand the social factors of the acceptability for proactive mobile services and identify the cultural differences between French and Finnish users. A prospective vision of the proactive mobile services has been conceptualized and depicted in a demonstrative film. It was shown to French and Finnish people selected according to their user profiles in relation to their ICT usage: the way they conceive of ICT's in their daily lives. Individual reactions and group dynamics have been filmed and sociologically analyzed. They reveal slight differences between French and Finnish reception of the exposed concept. It suggests how the social acceptability of high-tech services could depend on archaic aspects of the user's culture.