ppxscal/embedding_network huggingface dataset:
Publish-Subscribe Grows Up: Support for Management, Visibility Control, and Heterogeneity
Authors: Ludger Fiege, Mariano Cilia, Gero Muhl, Alejandro Buchmann
Venue: IEEE Internet Computing (2006)

Message-oriented middleware is used to decouple the operation of cooperating applications. Existing approaches have concentrated mainly on scalability issues, but dynamic business processes and the integration of a wide range of data sources and applications require a middleware that is customizable. The Rebeca publish-subscribe service uses scoping to structure both middleware and applications. It thus offers advanced routing mechanisms to subsystems that need high scalability and it allows for heterogeneous message models that are transparently mapped onto each other.
A Cognitive Model for Program Comprehension
Authors: Shaochun Xu
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

This paper proposes a cognitive model to classify the level of cognition and cognitive activities in program comprehension. This model is composed of input, cognitive process and output, among which the cognitive process includes four activities (absorption, denial, reorganization and expulsion) at six Bloom learning levels. Compared with the existing models, our learning model is more complete and more detailed. It not only describes cognitive activities in detail, but can also be applied in most of the cases. Our model can also reveal the differences between experts and novices in program comprehension. It provides some useful insights on how to build a tool to aid program comprehension. We also find that the so called traditional program comprehension process involves activities not only at comprehension level of the Bloom's taxonomy, but at higher levels as well. A case study is conducted to validate this learning model.
Dynamic Taint Propagation for Java
Authors: Vivek Haldar, Deepak Chandra, Michael Franz
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

Improperly validated user input is the underlying root cause for a wide variety of attacks on web-based applications. Static approaches for detecting this problem help at the time of development, but require source code and report a number of false positives. Hence, they are of little use for securing fully deployed and rapidly evolving applications. We propose a dynamic solution that tags and tracks user input at runtime and prevents its improper use to maliciously afSect the execution of the program. Our implementation can be transparently applied to Java class files, and does not require source code. Benchmarks show that the overhead of this runtime enforcement is negligible and can prevent a number of attacks.
Real-time rendering of realistic-looking grass
Authors: Musawir A. Shah, Jaakko Kontinnen, Sumanta Pattanaik
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

The absence of accurately rendered grass in real-time applications such as games and simulation systems can be directly attributed to the massive amounts of geometry required to model grass patches. This in turn is responsible for the drastic increase in the computational complexity of light transport for global illumination. Our work attempts to fill the void by presenting an image-based algorithm for interactive rendering of realistic-looking grass. A bidirectional texture function (BTF) is constructed and employed in combination with a view-dependent depth map to synthesize a grass texture for given viewing and illumination conditions. In addition to the visual effects captured by BTFs, our method is able to produce grass silhouettes as well as account for external occluders such as rocks and other objects scattered over a grass field.
Associating synchronization constraints with data in an object-oriented language
Authors: Mandana Vaziri, Frank Tip, Julian Dolby
Venue: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2006)

Concurrency-related bugs may happen when multiple threads access shared data and interleave in ways that do not correspond to any sequential execution. Their absence is not guaranteed by the traditional notion of "data race" freedom. We present a new definition of data races in terms of 11 problematic interleaving scenarios, and prove that it is complete by showing that any execution not exhibiting these scenarios is serializable for a chosen set of locations. Our definition subsumes the traditional definition of a data race as well as high-level data races such as stale-value errors and inconsistent views. We also propose a language feature called atomic sets of locations, which lets programmers specify the existence of consistency properties between fields in objects, without specifying the properties themselves. We use static analysis to automatically infer those points in the code where synchronization is needed to avoid data races under our new definition. An important benefit of this approach is that, in general, far fewer annotations are required than is the case with existing approaches such as synchronized blocks or atomic sections. Our implementation successfully inferred the appropriate synchronization for a significant subset of Java's Standard Collections framework.
An Approach to Constructing Feature Models Based on Requirements Clustering
Authors: Kun Chen, Wei Zhang, Haiyan Zhao, Hong Mei
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Feature models have been widely adopted in software reuse to organize the requirements of a set of similar applications in a software domain/product-line. However, in most feature-oriented methods, the construction of feature models heavily depends on the domain analysts¿ personal understanding, and the work of constructing feature models from the original requirements of sample applications is often tedious and ineffective. This paper proposes a semi-automatic approach to constructing feature models based on requirements clustering, which automates the activities of feature identification, organization and variability modeling to a great extent. The underlying idea of this approach is to analyze the relationships between individual requirements and cluster tightrelated requirements into features. With the automatic support of this approach, good-quality feature models can be constructed in a more effective way. A case study is also provided to show the feasibility of this approach.
Ear Biometrics Using 2D and 3D Images
Authors: Ping Yan, KevinW. Bowyer
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

We present results of the largest experimental investigation of ear biometrics to date. Approaches considered include a PCA ("eigen-ear") approach with 2D intensity images, achieving 63.8% rank-one recognition; a PCA approach with range images, achieving 55.3% Hausdorff matching of edge images from range images, achieving 67.5%, and ICP matching of the 3D data, achieving 84.1%. ICP based matching not only achieves the best performance, but also shows good scalability with size of dataset. The data set used represents over 300 persons, each with images acquired on at least two different dates.
A Hybrid Image-Based and Model-Based Telepresence System Using Two-Pass Video Projection onto a 3D Scene Model
Authors: Takefumi Ogawa, Kiyoshi Kiyokawa, Haruo Takemura
Venue: Proceedings of the 4th IEEE/ACM International Symposium on Mixed and Augmented Reality (2005)

A telepresence system is presented that has the advantage of both model-based and image-based approaches, namely, free viewpoint control and real-time color update with live video. A remote place is presented as a virtual environment by using live video projection captured by a head-worn camera onto the static 3D geometry. The observer can then observe the remote place in cooperation with the remote camera man, and give him a set of 3D instructions by a mouse.
Tradeoff and Sensitivity Analysis in Software Architecture Evaluation Using Analytic Hierarchy Process
Authors: Liming Zhu, Aybüke Aurum, Ian Gorton, Ross Jeffery
Venue: Software Quality Control (2005)

Software architecture evaluation involves evaluating different architecture design alternatives against multiple quality-attributes. These attributes typically have intrinsic conflicts and must be considered simultaneously in order to reach a final design decision. AHP (Analytic Hierarchy Process), an important decision making technique, has been leveraged to resolve such conflicts. AHP can help provide an overall ranking of design alternatives. However it lacks the capability to explicitly identify the exact tradeoffs being made and the relative size of these tradeoffs. Moreover, the ranking produced can be sensitive such that the smallest change in intermediate priority weights can alter the final order of design alternatives. In this paper, we propose several in-depth analysis techniques applicable to AHP to identify critical tradeoffs and sensitive points in the decision process. We apply our method to an example of a real-world distributed architecture presented in the literature. The results are promising in that they make important decision consequences explicit in terms of key design tradeoffs and the architecture's capability to handle future quality attribute changes. These expose critical decisions which are otherwise too subtle to be detected in standard AHP results.
A FAMULUS post-processor
Authors: Kenneth Conrow
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1977)

The FAMULUS documentation system is a very capable system for preparing and manipulating a set of records which constitutes a bibliography, a teaching aids list, or any other list of items with relatively static descriptors. The system was developed in 1969 by the Pacific Southwest Forest and Range Experiment Station, Berkeley, California and refined in 1972 at University College London. FAMULUS consists of a number of separate programs which can be used to create, edit, sort, index, and search a file of records. Each record can have up to ten fields and a total length of up to 4000 characters.
A FPGA Based Design of a Multiplierless and Fully Pipelined JPEG Compressor
Authors: Luciano Volcan Agostini, Roger Carvalho Porto, Sergio Bampi, Ivan Saraiva Silva
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

This paper presents the design and implementation of a multiplierless JPEG compressor for gray scale images. The modules of this architecture were fully pipelined and targeted to FPGA device implementation. The designed architectures are detailed in this paper and they were described in VHDL, simulated and physically mapped to Altera Flex10KE FPGAs. The JPEG compressor pipeline has a minimum latency of 238 clock cycles, given the full modular pipeline depth. The minimum compressor period is 26.6ns and the compressor is able to process 37.6 millions of pixels per second. For example, the compressor can process a 640x480 pixels still image in 8.2ms, reaching a maximum processing rate of 122.4 frames per second.
Asynchronous Communication in Java over Infiniband and DECK
Authors: Rodrigo Da Rosa Righi, Philippe O. A. Navaux, Marcia Cristina Cera, Marcelo Pasin
Venue: Proceedings of the 17th International Symposium on Computer Architecture on High Performance Computing (2005)

Java is becoming an attractive and easy to use programming language. It provides two systems for distributed computing, RMI and sockets, which describe a synchronous communication over TCP/IP. These Java core features may not be the best choice for cluster computing environments, since they do not provide high performance, a critical factor in this scenario. In this paper it is presented the development of Aldeia System, a library proposal to provide asynchronous communication in Java for cluster programming. Aldeia has been deployed on SAN hardware through Infiniband and DECK high-speed substrates. This paper shows the rationale for Aldeia's creation, its structure and encouraging results in synchronous and asynchronous approaches.
Data Preprocessing by Sequential Pattern Mining for LZW
Authors: Osslan O. Vergara-Villegas, Rene A. Garcia-Hernandez, J. Ariel Carrasco-Ochoa, Raul Pinto
Venue: Proceedings of the Sixth Mexican International Conference on Computer Science (2005)

LZW is a lossless data compression algorithm which has been incorporated as the standard of the Consultative Committee on International Telegraphy and Telephony. In addition, LZW is used to create GIF, TIFF and PDF files. In this paper, we propose an improvement to LZW using ideas from Sequential Pattern Mining. The goal of this area is to find all the Maximal Frequent Sequences (MFSs) which are sequences that appear at least .. times and they are not subsequences of any other MFS. We preprocess the data using an algorithm for searching all the MFSs to manage the MFSs as part of the dictionary of LZW, according to the frequency of the MFS. This modification allows us to propose a new variant of LZW algorithm. Some experiments with text files, showing the compression rates of the proposed algorithm, were performed.
Simulating Faults of Combinational IP Core-based SOCs in a PLI Environment
Authors: Pedram A. Riahi, Zainalabedin Navabi, Fabrizio Lombardi
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

This paper presents a new test methodology which utilizes the Programming Language Interface (PLI) for performing fault simulation of combinational or full scan Intellectual Property (IP) core-based designs for System-on-Chip (SOC). Using the latest Verilog PLI, referred to as Verilog Procedural Interface (VPI), critical-path tracing and two-value deductive fault simulations are performed on a pre-compiled core basis as available in a simulator s intermediate format. By applying this VPI-based test methodology on ISCAS85 Verilog benchmarks results are presented in terms of elapsed simulation time and fault coverage for stuck-at faults and improvement over previous works is reported.
Evolving Successful Stack Overflow Attacks for Vulnerability Testing
Authors: H. Gunes Kayacyk, A. Nur Zincir-Heywood, Malcolm Heywood
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

The work presented in this paper is intended to test crucial system services against stack overflow vulnerabilities. The focus of the test is the user-accessible variables, that is to say, the inputs from the user as specified at the command line or in a configuration file. The tester is defined as a process for automatically generating a wide variety of user-accessible variables that result in malicious buffers (an exploit). In this work, the search for successful exploits is formulated as an optimization problem and solved using evolutionary computation. Moreover the resulting attacks are passed through the Snort misuse detection system to observe the detection (or not) of each exploit.
Estimating point-to-point and point-to-multipoint traffic matrices: an information-theoretic approach
Authors: Yin Zhang, Matthew Roughan, Carsten Lund, David L. Donoho
Venue: IEEE/ACM Transactions on Networking (TON) (2005)

Traffic matrices are required inputs for many IP network management tasks, such as capacity planning, traffic engineering, and network reliability analysis. However, it is difficult to measure these matrices directly in large operational IP networks, so there has been recent interest in inferring traffic matrices from link measurements and other more easily measured data. Typically, this inference problem is ill-posed, as it involves significantly more unknowns than data. Experience in many scientific and engineering fields has shown that it is essential to approach such ill-posed problems via "regularization." This paper presents a new approach to traffic matrix estimation using a regularization based on "entropy penalization." Our solution chooses the traffic matrix consistent with the measured data that is information-theoretically closest to a model in which source/destination pairs are stochastically independent. It applies to both point-to-point and point-to-multipoint traffic matrix estimation. We use fast algorithms based on modern convex optimization theory to solve for our traffic matrices. We evaluate our algorithm with real backbone traffic and routing data, and demonstrate that it is fast, accurate, robust, and flexible.
A formative evaluation of the training effectiveness of a computer game
Authors: Harry O'Neil
Venue:  (2005)

Despite computer games and simulations' potential power in instruction and training, research on their training effectiveness for adults is limited, and a framework of evaluation is lacking. In addition, according to previous studies, a computer game may be one of the most effective tools to improve problem-solving. Problem-solving is one of the most significant competences whether in job settings or in schools, and as a result, teaching and assessing problem-solving become one of the most significant educational objectives (Mayer, 2002). However, there is limited research with adults that has shown the effects of game-based learning. In addition, according to previous researchers, a media's training effect such as a game is very limited when effective instructional strategies are lacking. In this dissertation, there was a pilot and a main study. In the pilot study, the researcher conducted a formative evaluation for a computer puzzle-solving game in terms of its effectiveness of enhancing both the learners' understanding about the content of the game and the strategies they adopted to solve the puzzles in the game. In the main study, thirty college and graduate students were asked to play the computer puzzle-solving game, i.e., SafeCracker, and were assessed before and after the two times of game-playing, using the knowledge mapping system and problem-solving strategy questions of retention and transfer. The results showed that the participants' problem-solving improved; i.e., their content understanding and problem-solving strategies were significantly increased after the game-playing. However, when compared to experts, the learning was low; i.e. students only achieved 4% of the content knowledge, 15% of the retention strategies, and 12% of the transfer strategies, representative of experts. The interjudge reliability of the problem-solving strategies measure was found satisfactory. In summary, although the learning was low, as expected, one outcome of this study is a research environment with reliable and valid measures of problem solving; that is, the knowledge maps as content understanding measure the retention and transfer questions as problem solving strategies measure, and the trait self-regulation questionnaire as self-regulation measure. Explanations of the findings are proposed, and implications for future research on games are discussed.
Keynote Talk: Collaboration@work. At the crossroad of old technology and new IT trends.
Authors: Isidro Laso-Ballesteros
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

Collaboration @ work was first defined in the Collaboration @ work report 2004 as "collaboration among individuals engaged in a common task to achieve a shared objective using collaboration technologies". At that time the focus was on collaboration services providing functionalities at middleware level which could be reusable at the application level. Reflecting this focus, the Research European Union 6th Framework Programme Strategic Objective 2.5.9 "Collaborative working environments" was drafted up to achieve a common repository of collaboration services to be invoked by collaboration tools and integrated into large validating applicators. A budget of 40 Mio  is devoted to this Strategic Objective (SO) in 2005. Work to be carried out within this SO will contribute to the use of collaborative technologies with a mediating role among distributed workers and as a glue of diverse technologies (such as mixed-reality, visualisation, interfaces technologies) to support collaboration among people and other artefacts (robots, actuators, sensors).
XML and Relational Data: Towards a Common Model and Algebra
Authors: Matteo Magnani, Danilo Montesi
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

In this paper we present a model for the management of relational, XML, and mixed data. The main high-level approaches to manipulate XML, i.e., SQL/XML, XQuery, and Object/Relational XML columns, can all be based on our common model and algebra. Our query algebra, yet very simple, can represent queries not expressible by other proposals and by the current implementation of TAX. Moreover, we show that relational-like logical query rewriting can be extended to our algebraic expressions.
Neural Network-Based Technique for Detecting Catastrophic and Parametric Faults in Analog Circuits
Authors: Sergey G. Mosin
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

The approach to transient functional test of analog circuits is considered. The artificial neural network is proposed for realization of the circuit under test (CUT) response analysis. The coefficients of wavelet decomposition of CUT transient output responses reflecting the dynamical behavior of analog circuit are used for neural network training. Sensitivity analysis is applied for selecting the test frequencies and test nodes. The experimental results for analog benchmark circuits are provided.
Energy-Aware Modeling and Scheduling of Real-Time Tasks for Dynamic Voltage Scaling
Authors: Xiliang Zhong, Cheng-Zhong Xu
Venue: Proceedings of the 26th IEEE International Real-Time Systems Symposium (2005)

Dynamic voltage scaling (DVS) is a promising technique for battery-powered systems to conserve energy consumption. Most existing DVS algorithms assume information about task periodicity or a priori knowledge about the task set to be scheduled. This paper presents an analytical model of general tasks for DVS assuming job timing information is known only after a task release. It models the voltage scaling process as a transfer function-based filter system, which facilitates the design of two efficient scaling algorithms. The first is a time-invariant scaling policy based on a voltage scaling function independent of input jobs over time. It is proved to be a generalization of several existing DVS algorithms. A more energy efficient policy is a time-variant scaling algorithm. The algorithm turns out to be a water-filling process of information theory with a low time complexity. It can not only be applied to scheduling based on worst case execution times, but also to online slack distribution when jobs complete earlier. We further establish two relationships between computation capacity and deadline misses. The relationships make it possible to the provisioning of statistical real-time guarantees.