ppxscal/embedding_network huggingface dataset:
A Supporting Method of the Evolution of State Diagrams with Scenarios
Authors: Takuya Kadota, Atsushi Ohnishi
Venue: Proceedings of the Eighth International Workshop on Principles of Software Evolution (2005)

State diagram is one of the primary documents in software development. In software maintenance phase, system behaviors often change. In accordance with these changes, state diagrams should be correctly modified. However, it may be difficult to modify the state diagrams accurately. We propose a supporting method of state-diagram evolution using scenarios. The reason of focusing on scenarios is that scenarios are familiar and comprehensible to stakeholders. Our method is illustrated with an example.
Lustructu: A Tool for the Automatic Coverage Assessment of Lustre Programs
Authors: Abdesselam Lakehal, Ioannis Parissis
Venue: Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering (2005)

We present Lustructu, a tool measuring the structural coverage of LUSTRE programs. LUSTRE is a synchronous data-flow declarative language widely used for safety-critical applications (avionics, energy, transport ...). Many coverage criteria are defined for sequential languages and are widely used in the software industry (for instance, statement or branch coverage). They are defined on the program control-flow graph and, hence, do not apply to Lustre programs , represented by data-flow diagrams. We have defined several criteria to measure the coverage achieved after the execution of a test set, based on symbolic computation of path activation conditions. These criteria, implemented in Lustructu, provide the user with meaningful automatically computed measures of the thoroughness of a given test set.
(CBR) Intelligent knowledge-based systems: knowledge-based systems
Authors: Cornelius T. Leondes
Venue:  (1995)

Knowledge-Based Systems, addresses the basic question of how accumulated data and staff expertise from business operations can be abstracted into useful knowledge, and how such knowledge can be applied to ongoing operations. The wide range of areas represented includes product innovation and design, intelligent database exploitation, and business model analysis.
Re-envisioning reality: reflectance field acquisition of actors, objects, and environments
Authors: Paul Debevec
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

In this talk I will present new techniques for digitizing the geometry and reflectance of real people, objects, and environments, allowing these elements to be recombined and reinterpreted in the service of new creative visions. On the topic of environments, I will present a technique employed to digitize and reunite the Parthenon and its sculptures, long separated between Athens and London. This work used 3D scanning, illumination capture, and environmental reflectometry to create a detailed and relightable model of the Greek temple. For digitizing objects, I will present new a new dual light stage process for capturing how an objects reflects light that reverses the direction that light is typically generated and sensed, allowing detailed specular and diffuse behavior to be captured for real-world objects. Finally, I will present a new technique for filming an actor's performance in such a way that the lighting on the actor can be designed and modified in postproduction: moving the key, adding a rim, gelling the fill, or matching the lighting to a background plate can all be accomplished photorealistically. The technique works by lighting the actor with time-multiplexed basis lighting conditions and filming with a high-speed video camera so that many lighting conditions are recorded in the span of a traditional frame of film.
MAAY: A Decentralized Personalized Search System
Authors: Frederic Dang Ngoc, Joaquin Keller, Gwendal Simon
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

This paper focuses on decentralized personalized search engines. It is composed of three parts. Firstly, we formulate the problem and we propose a graph-based measure of quality of a document given a user and a word. This quality gives a formal measure to test the personalized relevance of answers provided by search engines. Secondly, we present a decentralized system namely Maay which aims to provide personalized results to its users. Users can share, search and retrieve documents from others. Nodes locally learn others' profilefrom previous interactions and use feedbacks to raise words characterizing a document. By querying preferentially nodes with similar profile and by ranking documents according to the requester profile, nodes may find documents which are relevant for them. Finally, we propose a framework for experimental studies of such system. Then, we use it to show that the main principles of Maay could benefits to users.
An Approach to Tracking Data Derivation in Information Systems
Authors: Jianhua Shao, Yahya Ibrahim, Suzanne M. Embury
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Modern enterprises are becoming increasingly dependent upon the data produced from information systems to support their operations. So the knowledge of how such data are derived is vitally important to them. Unfortunately, as the systems evolve, their functionality tends to become more complex and associated documentation less reliable. Consequently, accurate knowledge of data derivation cannot always be assumed. In this paper, we propose an approach to tracking this valuable knowledge automatically by analysing the information systems themselves. Our approach is centred around two key technologies: symbolic execution for abstracting data derivation and query inversion for determining data sources, and allows the user to track data derivation as and when it is needed.
Wish Branches: Combining Conditional Branching and Predication for Adaptive Predicated Execution
Authors: Hyesoon Kim, Onur Mutlu, Jared Stark, Yale N. Patt
Venue: Proceedings of the 38th annual IEEE/ACM International Symposium on Microarchitecture (2005)

Predicated execution has been used to reduce the number of branch mispredictions by eliminating hard-to-predict branches. However, the additional instruction overhead and additional data dependencies due to predicated execution sometimes offset the performance advantage of having fewer mispredictions. We propose a mechanism in which the compiler generates code that can be executed either as predicated code or non-predicated code (i.e., code with normal conditional branches). The hardware decides whether the predicated code or the non-predicated code is executed based on a run-time confidence estimation of the branch¿s prediction. The code generated by the compiler is the same as predicated code, except the predicated conditional branches are NOT removed - they are left intact in the program code. These conditional branches are called wish branches. The goal of wish branches is to use predicated execution for hard-to-predict dynamic branches and branch prediction for easy-to-predict dynamic branches, thereby obtaining the best of both worlds. We also introduce a class of wish branches, called wish loops, which utilize predication to reduce the misprediction penalty for hard-to-predict backward (loop) branches. We describe the semantics, types, and operation of wish branches along with the software and hardware support required to generate and utilize them. Our results show that wish branches decrease the average execution time of a subset of SPEC INT 2000 benchmarks by 14.2% compared to traditional conditional branches and by 13.3% compared to the best-performing predicated code binary.
Visualizing Similarity between Program Executions
Authors: David Leon, Andy Podgurski, William Dickinson
Venue: Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering (2005)

Multidimensional scaling (MDS) is a technique for visualizing multidimensional data points as a 2D scatter plot. It can be applied to execution profiles of software to reveal how similar executions are to one another. This is useful for certain software engineering applications, which require accurate representation of small dissimilarities and nearest neighbor relationships.. However, the high-dimensionality of profiles can cause MDS techniques to represent small dissimilarities poorly. We evaluate several variants of MDS on large sets of profiles, to see which techniques produce the most accurate displays. These include four previously proposed techniques — classical scaling followed by iterative majorization, energy minimization, ordinal MDS, and cluster differences scaling — and two techniques of our invention — hierarchical MDS and sparse region scaling. The results suggest that each technique except ordinal MDS can significantly improve the representation of small dissimilarities between program executions and that hierarchical MDS and sparse region scaling perform best overall.
On Modelling Access Policies: Relating Roles to their Organisational Context
Authors: Robert Crook, Darrel Ince, Bashar Nuseibeh
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

The restriction of access is a mechanism by which organisations protect their information assets. Requirements models use actor definitions to describe users and to specify their access policies. Actors normally represent roles that users adopt, while roles can represent different things, such as a position in an organisation or the assignment of a task. Current requirements modelling approaches do not provide a systematic way of defining roles for incorporation into access policies. We address this issue by proposing a framework that facilitates the derivation of role definitions from their wider organisational context. We illustrate how our framework can be used to extend a formal version of i - to define and verify access policies definitions - and demonstrate its applicability via a case study.
Indicators of Structural Stability of Object-Oriented Designs: A Case Study
Authors: Mahmoud O. Elish, David Rine
Venue: Proceedings of the 29th Annual IEEE/NASA on Software Engineering Workshop (2005)

The structural stability of an object-oriented design (OOD) refers to the extent to which the structure of the design is preserved throughout the evolution of the software from one release to the next. This paper empirically investigates potential indicators of measures of structural stability of OODs. Both product-related and process-related indicators are considered. These indicators were evaluated through a case study that involves 13 successive releases of Apache Ant. The results showed that each one of the stability metrics is significantly correlated with at least one of the investigated indicators. To make early predictions of the values of each one of the stability metrics, statistically significant regression models were constructed from subsets of the investigated indicators.
Toward an ontology-driven architectural framework for B2B
Authors: Ejub Kajan, Leonid Stoimenov
Venue: Communications of the ACM (2005)

Moving online business processes and practices from a static collection of data to a distributed multiprocessing framework of interoperability.
A new category of Hermitian upwind schemes for computational acoustics
Authors: G. Capdeville
Venue: Journal of Computational Physics (2005)

A new high-order upwind scheme is developed to solve linear acoustics. In order to produce a compact scheme with a high level of precision, a Hermite interpolation is used. An algorithm in three stages is built in order to optimize the procedure of discretization. In the ''reconstruction stage'', a local spatial interpolator based on an upwind stencil is defined. In the ''decomposition stage'', the calculation of a wave model adapted to the decomposition of the time-derivatives in simple wave contributions is derived; then the local spatial interpolator is used in order to calculate the wave strengths for each wave. In the ''evolution stage'', we update by means of a procedure similar to that of Cauchy-Kovaleskaya, the discrete variable and its derivatives, by using the information brought by each simple wave. Specific boundary conditions are finally established. In this way, a third-order upwind Hermitian scheme may be constructed (''@D-P3 scheme''). A one-dimensional analysis in Fourier series shows the principal properties of such a scheme. The effectiveness and the exactitude of the new compact scheme are shown by their applications to several two-dimensional problems and by comparisons to competing finite difference method for wave propagation.
Visual Correlation for Situational Awareness
Authors: Yarden Livnat, Jim Agutter, Shaun Moon, Stefano Foresti
Venue: Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization (2005)

We present a novel visual correlation paradigm for situational awareness (SA) and suggest its usage in a diverse set of applications that require a high level of SA. Our approach is based on a concise and scalable representation, which leads to a flexible visualization tool that is both clear and intuitive to use. Situational awareness is the continuous extraction of environmental information, its integration with previous knowledge to form a coherent mental picture, and the use of that picture in anticipating future events. In this paper we build on our previous work on visualization for network intrusion detection and show how that approach can be generalized to encompass a much broader class of SA systems. We first propose a generalization that is based on what we term, the w3premise, namely that each event must have have at least the What, When and Where attributes. We also present a second generalization, which increases flexibility and facilitates complex visual correlations. Finally, we demonstrate the generality of our approaches by applying our visualization paradigm in a collection of diverse SA areas.
Randomness is a simulator's syndrome
Authors: Harold Joseph Highland
Venue: ACM SIGSIM Simulation Digest (1976)

Back in mid-1973 I should have known enough to understand and follow Einstein's most basic principle, namely: &Omega = &epsilon; + &omega; + &phiv; 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
Improving the web text content by extracting significant pages into a Web Site
Authors: Sebastian A. Ryos, Juan D. Velasquez, Eduardo S. Vera, Hiroshi Yasuda, Terumasa Aoki
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

Web Systems have reached a very important role in today's business world. Every day organizations fight to keep their present clients and to gain new ones. In order to accomplish this goal it is very important to make precise changes in the web site content. However, the development of these improvements is a complex and specialized task because of the nature of the web data itself. We propose a novel approach to successfully make changes to improve the web site content using text mining. We use a Self Organizing Feature Map (SOFM)to find the most relevant text content, and then we propose a reverse clustering analysis in order to extract the most significant pages of the whole web site. The effectiveness of this method was experimentally tested in a real web site.
Efficient Deadlock-Freeness Detection in Real-time Systems
Authors: Peng Rong, Cui Jingsong, Pan Yue
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

A Time-Action-Lock (TAL) is a state of a real-time system at which neither time can progress nor an action can occur. B. Behzad and O. Kozo presented a TAL-freeness detection method based on the geometry of Timed Automata. It is realized by means of translating the problem to Rational Presburger Sentences that has its drawback of inefficiency. In this paper, we present an algebraic approach for TALfreeness detection, which can dramatically improve the performance of the method previously published. Detailed correctness proofs and performance analysis are provided.
The Stretched-Hypercube: A VLSI Efficient Network Topology
Authors: Pooya Shareghi, Hamid Sarbazi-Azad
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

In this paper, we introduce a new class of interconnection networks for multiprocessor systems which we refer to as Stretched-Hypercubes, or shortly the Stretched-Cube networks. These networks are obtained by replacing an edge of the well-known hypercube network with an array of processors. Two interesting features of the proposed topology are its area-efficient VLSI layout and superior scalability over the traditional hypercube network. Some topological properties of the proposed network are studied. In addition, an area-efficient VLSI layout for the stretched-cube is suggested and some comparisons between the proposed network and previously studied networks such as the star and hypercube are conducted.
Simulation as a decision aide: a management perspective
Authors: John J. Marsh,  III
Venue: ACM SIGSIM Simulation Digest (1979)

The environment and growth of management problems found in a modern health care institution are briefly discussed. The techniques of computer simulation are suggested as a realistic approach to the solution of some of the complex operations problems, especially from a planning perspective. Two examples of the application of simulation analysis are cited with particular attention given to the interaction of the analysts and the diverse participants/clients of the studies which ultimately resulted in the successful solution of the problem.
An efficient deniable authentication protocol
Authors: Hui-Feng Huang, Chin-Chen Chang
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

The aim of deniable authenticated protocol allows the receiver to identity the source of a given message but not prove the identity of the sender to a third party. In this article, we propose a new non- interactive deniable authenticated protocol based on Diffie- Hellman key distribution protocol. It has lower communication costs and computational complexity than previously proposed schemes. Keywords: authentication, cryptography
Mixed Heuristic Algorithm for Intelligent String Matching for Information Retrieval
Authors: Atif Agha Hassan
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

Text searching problem has been tackled by variety of traditional string matching approaches over the years. This paper proposes an intelligent text searching technique for information retrieval using probabilistic approach, called Mix Heuristic Algorithm (MHA). In the proposed algorithm, an intelligent programming approach using logical operators has been used that makes this algorithm intelligent and user friendly. We are also presenting a short survey of well-known sequential string matching algorithms. We test MHA implementation and present experimental results for different text matching.
Combining model-based and instance-based learning for first order regression
Authors: Kurt Driessens, Sašo Džeroski
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

The introduction of relational reinforcement learning and the RRL algorithm gave rise to the development of several first order regression algorithms. So far, these algorithms have employed either a model-based approach or an instance-based approach. As a consequence, they suffer from the typical drawbacks of model-based learning such as coarse function approximation or those of lazy learning such as high computational intensity.In this paper we develop a new regression algorithm that combines the strong points of both approaches and tries to avoid the normally inherent draw-backs. By combining model-based and instance-based learning, we produce an incremental first order regression algorithm that is both computationally efficient and produces better predictions earlier in the learning experiment.
Randomized Parallel Scheduling Algorithm for Input Queued Crossbar Switches
Authors: Yanfeng Zheng, Wen Gao
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

A significant research effort has been devoted in recent years to the design of simple and efficient scheduling algorithms for input-queued packet switches. Among these algorithms, scheduling policies based on Maximum Weight Matching (MWM) were proved to achieve 100% throughput under any admissible traffic load. However, MWM is impractical for its high computational complexity O(N3). In this paper, we propose a new approximate algorithm to MWM using local search technique. Notably we observe that: (a) Local search is well suitable for parallel computation. (b) Currently each line card of high performance router has at least one processor. Based on the two important observations, a randomized parallel scheduling algorithm is proposed. It is proved to be rate stable and simulation results show that the proposed algorithm outperforms other randomized approximations to MWM.
MicroGP—An Evolutionary Assembly Program Generator
Authors: Giovanni Squillero
Venue: Genetic Programming and Evolvable Machines (2005)

This paper describes ¿GP, an evolutionary approach for generating assembly programs tuned for a specific microprocessor. The approach is based on three clearly separated blocks: an evolutionary core, an instruction library and an external evaluator. The evolutionary core conducts adaptive population-based search. The instruction library is used to map individuals to valid assembly language programs. The external evaluator simulates the assembly program, providing the necessary feedback to the evolutionary core. ¿GP has some distinctive features that allow its use in specific contexts. This paper focuses on one such context: test program generation for design validation of microprocessors. Reported results show ¿GP being used to validate a complex 5-stage pipelined microprocessor. Its induced test programs outperform an exhaustive functional test and an instruction randomizer, showing that engineers are able to automatically obtain high-quality test programs.