ppxscal/embedding_network huggingface dataset:
Validation of Reactive Software from Scenario-Based Models
Authors: Oscar R. Ribeiro, Joao M. Fernandes
Venue: Proceedings of the 6th International Conference on Quality of Information and Communications Technology (2007)

This thesis proposal suggests a model-based approach to obtain, from a set of behavioural scenarios of a given reactive software system, a graphical animation for reproducing that set of scenarios for validation purposes. The approach assumes that the requirements of the system are described by a use case diagram, being the behaviour of each use case detailed by a collection of scenario descriptions. These use cases and scenarios are transformed into a Coloured Petri Net (CPN) model, which is next complemented with animation-specific elements. By executing the CPN model, it is possible to animate the scenarios in a user-friendly way and thus ensuring an effective involvement of the users in the system's validation. The CPN model is enforced to be (1) parametric, allowing an easy modification of the initial conditions of the scenarios, (2) environment-descriptive, meaning that it includes the state of the relevant elements of the environment, and (3) animation-separated, implying that the elements related to animation are clearly separated from the other ones. We validate our approach based on its application to two examples of reactive systems.
Exploiting temporal information and adaptive thresholding for fast mode decision in the H264 video coding standard
Authors: Christos Grecos, M. Y. Yang
Venue: Multidimensional Systems and Signal Processing (2007)

A new algorithm for fast mode decision in the H264 video coding standard is presented in this paper. The algorithm exploits temporal information and adaptive thresholding and can provide significant computational savings with similar or even better Rate Distortion performance as compared to accepted standard contributions and other techniques found in the literature.
I Am a Scientist, Not a Philosopher!
Authors: Sean Peisert, Matt Bishop
Venue: IEEE Security and Privacy (2007)

To evaluate anything we can't prove using pure mathematics or logical syllogism, we must test hypotheses by performing controlled experiments to generate measurable, empirical data. But today's computer security researchers often claim "proof" without following this approach. Failure to follow the scientific method rigorously can create problems. This article presents a method for scientific experimentation when others aren't appropriate or can't be readily applied. The goal is to further motivate researchers to apply science to experiments and, in concert with the authors' earlier work, offer a new technique for doing so.
Fingerprints Recognition Using Minutiae Extraction: a Fuzzy Approach.
Authors: A. Montesanto, P. Baldassarri, G. Vallesi, G. Tascini
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

The aim of this paper is to study the fingerprint verification based on local ridge discontinuities features (minutiae) only using grey scale images. We extract minutiae using two algorithms those following ridge lines and then recording ridge endings and bifurcations. Moreover we use a third algorithm able to develop a minutiae verification processing a local area using a neural network ( multilayer perceptron). Fingerprint distortion is filtered using a minutiae whole representation based on regular invariant moments. The results of the three minutiae extraction algorithms are joined during the minutiae pattern matching phase for fingerprint verification. Here we propose a new method of matching that use fuzzy operator to bypass the problem of different numbers of minutiae extracted from the algorithms. Experimental evidences show fingerprint recognition up to 95%.
A simplified derivation of timing complexity lower bounds for sorting by comparisons
Authors: Michel Schellekens, Rachit Agarwal, Emanuel Popovici, Ka Lok Man
Venue: Nordic Journal of Computing (2006)

We present a simplified derivation of the fact that the complexity-theoretic lower bound of comparison-based sorting algorithms, both for the worst-case and for the average-case time measure, is Ω(nlogn). The standard proofs typically are directly presented over decision trees. The proof for the average-case however relies on differential calculus, which presents a main hurdle in undergraduate presentations. Here we present a simplified derivation of this result based on the well-known Kraft inequality for binary trees. This inequality enables one to derive the worst-case lower bound via a very simple argument. It also yields the average-case lower bound, via a similar argument as for the worst-case and also involves an elegant and simple inequality obtained by the Danish mathematician Jensen. The Jensen inequality essentially implies that, for convex functions, the function value of a mean of numbers is bounded by the mean of the function values of these numbers. This approach removes the need to present the results based on differential calculus and makes the material easily accessible for undergraduate Computer Science students.
A Characterization of Some Asynchronous Sequential Networks and State Assignments
Authors: L. L. Kinney
Venue: IEEE Transactions on Computers (1971)

An asynchronous sequential network is an interconnection of several asynchronous sequential circuits. Asynchronous networks are classified according to the relative time delay of the individual circuit's feedback signals and input signals. They are also classified by the manner in which the circuits interact. In addition, another network model uses duplicate paths for the feedback signals and the input signals of a circuit where the duplicate paths have differing delays. The partition theory of Hartmanis and Stearns [5] is used for characterizing some of the network types in a manner analogous to the characterization of synchronous sequential networks. The special case where each circuit in the network has only two states is equivalent to specifying a state assignment for the overall network and this leads to a characterization of some state assignments for asynchronous circuits. In particular, any arbitrary state assignment for the network which has duplicate paths and delays is shown to be free of critical races, and another network model leads to a variation of the minimum transition-time state assignments which in certain cases may require fewer state variables.
The affix array data structure and its applications to RNA secondary structure analysis
Authors: Dirk Strothmann
Venue: Theoretical Computer Science (2007)

Efficient string-processing in large data sets like complete genomes is strongly connected to the suffix tree and similar index data structures. With respect to complex structural string analysis like the search for RNA secondary structure patterns, unidirectional suffix tree algorithms are inferior to bidirectional algorithms based on the affix tree data structure. The affix tree incorporates the suffix tree and the suffix tree of the reverse text in one tree structure but suffers from its large memory requirements. In this paper I present a new data structure, denoted affix array, which is equivalent to the affix tree with respect to its algorithmic functionality, but with smaller memory requirements and improved performance. I will show a linear time construction of the affix array without making use of the linear time construction of the affix tree. I will also show how bidirectional affix tree traversals can be transferred to the affix array and present the impressive results of large scale RNA secondary structure analysis based on the new data structure.
Feature Selection as a Preprocessing Step for Classification in Gene Expression Data
Authors: Helyane Bronoski Borges, Julio Cesar Nievola
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Many times, when studying gene expression data, unknown attributes, which can be redundant and even, in certain cases, irrelevant, are manipulated. The application of selection attributes algorithms as a preprocessing can help in the knowledge discovery database process. This paper is about applying selection attributes algorithms in two gene expression databases. The result shows that the use of these algorithms can improve the classification algorithms performance.
Using web 2.0 to locate expertise
Authors: Sandra Jean "Sacha" Chua
Venue: Proceedings of the 2007 conference of the center for advanced studies on Collaborative research (2007)

Finding experts who can help solve a problem can be difficult and time-consuming. Manually-maintained expertise profiles are often out of date. Expertise recommendations based on private data such as e-mail are difficult to verify. Intranet social computing services such as web logs (blogs), social bookmarking, and people-tagging can aid in building implicit profiles for expertise search using data captured in informal knowledge management tools. This paper introduces a meta-search tool that searches for experts based on their blogs, bookmarks, and tags. Results are visualized according to recency, organization, and geographic location. A usability study showed that users are highly satisfied with the tool, and are significantly more satisfied with the tool than with their existing techniques for finding experts.
A Computer Aided Procedure for Performing Static Loading Validation of Digital Logic Systems
Authors: F. U. Rosenberger
Venue: IEEE Transactions on Computers (1984)

A logic network is modeled with logic elements and a set of junctions formed by the interconnection of logic element pins. Electrical models for logic element pins are developed that include appropriate current and voltage parameters, and a consistent set of nomenclature for these parameters is introduced. An algorithm is then presented that can be used to determine the ability of ap element pin to force its junction to one or both of its valid logic states. The junctions may include bidirectional logic elements and wired-high and wired-low configurations. The algorithm evaluates every junction in the network and produces both error (fatal failure) and warning (possible failure) messages for each junction. This can be viewed as a "loading check" on the network. The noise margin for each junction is also computed and compared to a preselected value. Examples of the application of this algorithm on practical TTL circuits are presented.
Security policy compliance with violation management
Authors: Julien Brunel, Frédéric Cuppens, Nora Cuppens, Thierry Sans, Jean-Paul Bodeveix
Venue: Proceedings of the 2007 ACM workshop on Formal methods in security engineering (2007)

A security policy of an information system is a set of security requirements that correspond to permissions, prohibitions and obligations to execute some actions when some contextual conditions are satisfied. Traditional approaches consider that the information system enforces its associated security policy if and only if actions executed in this system are permitted by the policy (if the policy is closed) or not prohibited (if the policy is open) and every obligatory actions are actually executed in the system (no violation of obligations). In this paper, we investigate a more sophisticated approach in which an information system specification is compliant with its security policy even though some security requirements may be violated. Our proposal is to consider that this is acceptable when the security policy specifies additional requirements that apply in case of violation of other security requirements. In this case, we formally define conditions to be satisfied by an information system to comply with its security policy. We then present a proof-based approach to check if these conditions are enforced.
Organization-oriented chemical programming for the organic design of distributed computing systems
Authors: Naoki Matsumaru, Peter Dittrich
Venue: Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems (2006)

Biochemical information processing found in nature is known to be robust, self-organizing, adaptive, decentralized, asynchronous, fault-tolerant, and evolvable. A couple of approaches are already using the chemical metaphor, such as, Gamma, MGS, amorphous computing, membrane computing, and reaction-diffusion processors. However, in accordance with Conrad's tradeoff principle, programming a chemical computer appears to be difficult. Therefore, in order to further exploit the mentioned properties new programming techniques are required. Here we describe how chemical organization theory can serve as a tool for chemical programming. The theory allows to predict the potential behavior of a chemical program and thus supports a programmer in the design of a chemical-like control system. The approach is demonstrated by applying it to the maximal independent set problem. We show that the desired solutions are predicted by the theory as chemical organizations. Furthermore the theory uncovers "undesirable" organizations, representing uncompleted halting computations due to insufficient amount of molecules. Finally we discuss an architecture for a "chemical virtual machine".
Detecting attribute dependencies from query feedback
Authors: Peter J. Haas, Fabian Hueske, Volker Markl
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Real-world datasets exhibit a complex dependency structure among the data attributes. Learning this structure is a key task in automatic statistics configuration for query optimizers, as well as in data mining, metadata discovery, and system management. In this paper, we provide a new method for discovering dependent attribute pairs based on query feedback. Our approach avoids the problem of searching through a combinatorially large space of candidate attribute pairs, automatically focusing system resources on those pairs of demonstrable interest to users. Unlike previous methods, our technique combines all of the pertinent feedback for a specified pair of attributes in a principled and robust manner, while being simple and fast enough to be incorporated into current commercial products. The method is similar in spirit to the CORDS algorithm, which proactively collects frequencies of data values and computes a chi-squared statistic from the resulting contingency table. In the reactive query-feedback setting, many entries of the contingency table are missing, and a key contribution of this paper is a variant of classical chi-squared theory that handles this situation. Because we typically discover a large number of dependent attribute pairs, we provide novel methods for ranking the pairs based on degree of dependency. Such ranking information, e.g., enables a database system to avoid exceeding the space budget for the system catalog by storing only the currently most important multivariate statistics. Experiments indicate that our dependency rankings are stable even in the presence of relatively few feedback records.
Automatic Generation of Digital System Schematic Diagrams
Authors: Anshul Kumar, Anjali Arya, V. V. Swaminathan, Amit Misra
Venue: IEEE Design Test (1986)

A systematic approach to the automatic generation of schematic diagrams for digital systems?diagrams described as networksof modules?provides useful CAD applications. This approach transforms guidelines. traditionally followed in manual drawingsof schematic diagrams, into quantitative objectives. In view of the complex relationship between these objectives, the schematicdesign process is broken into a lengthy sequence of steps. We will attempt to give the precise formulation for each step,along with efficient solutions, making suitable approximations where necessary. An illustrative diagram is included, generatedusing these algorithms, showing that our results compare well with hand-drawn diagrams.
A novel SoC design methodology combining adaptive software and reconfigurable hardware
Authors: Marco D. Santambrogio, Seda Ogrenci Memik, Vincenzo Rana, Umut A. Acar, Donatella Sciuto
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Reconfigurable hardware is becoming a prominent component in a large variety of SoC designs. Reconfigurability allows for efficient hardware acceleration and virtually unlimited adaptability. On the other hand, overheads associated with reconfiguration and interfaces with the software component need to be evaluated carefully during the exploration phase. The aim of this paper is to identify the best trade-off considering application-specific features in software, which can lend itself to software-based acceleration and lead to a revision of the view that certain computationally intensive tasks can only be accelerated through hardware. In order to validate the effectiveness of our proposed techniques, we built an extensive development and experimental setup, bringing together the MLTon-based programming environment and physical mapping of the software and hardware onto a real dynamically reconfigurable SoC system.
An Intelligent Knowledge Discovery System with a Novel Knowledge Acquisition Methodology
Authors: Qingzhang Chen, Chao Chen, Xiaoying Chen
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

The rapid increase of raw data improves a large number of data mining algorithms. But this trend makes it difficult to choose suited data mining algorithms to discover valid knowledge in the data repositories for users with few prior experience of data mining. In this paper, we propose a framework named Intelligent Knowledge Discovery System (IKDS) which help users to select appropriate data mining algorithms to discover useful knowledge. A novel knowledge acquisition methodology called Simplified- EMCUD (SIMCAP) is proposes in IKDS for its Expert system to elicit explicit knowledge as well as implicit knowledge. Then we represent and store the knowledge in IKDS by XML. At last we give the prototypes of SIMCAP and IKDS.
A Controlled Experiment on the Effects of Synchronicity in Remote Inspection Meetings
Authors: Fabio Calefato, Filippo Lanubile, Teresa Mallardo
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

Traditionally, software inspection has largely relied on collocated interaction of inspectors. As companies have begun to turn to distributed software development, meeting in a room has become impractical. In this paper we report on controlled experiment to assess the effect of synchronous and asynchronous communication in remote inspection meetings.
Indexing temporal XML documents
Authors: Alberto O. Mendelzon, Flavio Rizzolo, Alejandro Vaisman
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Different models have been proposed recently for representing temporal data, tracking historical information, and recovering the state of the document as of any given time, in XML documents. We address the problem of indexing temporal XML documents. In particular we show that by indexing continuous paths, i.e. paths that are valid continuously during a certain interval in a temporal XML graph, we can dramatically increase query performance. We describe in detail the indexing scheme, denoted TempIndex, and compare its performance against both a system based on a nontemporal path index, and one based on DOM.
Compatibility path based binding algorithm for interconnect reduction in high level synthesis
Authors: Taemin Kim, Xun Liu
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

This paper describes a register and functional unit (FU) binding algorithm in high level synthesis. Our algorithm targets the reduction of multiplexer inputs. Since multiplexers connect multiple inputs to FUs or registers, the multiplexer count is a good indicator of the interconnect complexity. Reducing the number of multiplexer inputs results in reducing interconnect cost. Specifically, our algorithm constructs a weighted and ordered compatibility graph, and binds operations that form a long path in the graph together. As a result, operations with many flow dependencies and common inputs are bound to same FU, leading to a small number of FU inputs. In addition, the operation variables generated by a single FU are assigned to the same register so that connections between FUs and registers are reduced. We have implemented our algorithm within a MATLAB to Verilog conversion tool, and applied it to a suite of benchmark programs. Our experimental results have shown that the proposed scheme achieves 11.8%, 43.6% and 58.8% multiplexer input count reduction on average over weighted bipartite matching algorithm, k-cofamily algorithm and left edge algorithm, respectively. To assess the impact on interconnect reduction, we have generated layouts of the circuits from our Verilog description. It is shown that our approach delivers a 10.1% reduction in total wire-length of global interconnects with minor area overhead of register and FUs in comparison to the best previously proposed scheme.
Quantitative causality
Authors: Sharon Simmons, Dennis Edwards
Venue: Neural, Parallel Scientific Computations (2007)

Events generated by the execution of a distributed system are related by causality and concurrency. While providing a means of reasoning about the relative occurrence of events, this partial order fails to represent the timeliness of occurrence. In this paper, we develop a novel means of assigning weights to events where the weights are reduced as the temporal proximity to an anchor event decreases. This weight quantifies the strength of the causal or concurrent relationship with respect to an anchor event. Those events that causally succeed the anchor are the focus of this paper with concurrency and causally preceding being part of future work plans. Three methods of computing event weights for causally succeeding events are defined. Each contains a tunable parameter to determine the rate of weight decrease. The methods are piece-wise linear, exponential, and relevant vector difference decay. A case study has been performed that applied quantitative causality to the well-known software engineering problem of feature location. A summary of the case study results is provided to illustrate the utility of quantitative causality for succeeding events.
Fuzzy universal generating functions for multi-state system reliability assessment
Authors: Yi Ding, Anatoly Lisnianski
Venue: Fuzzy Sets and Systems (2008)

The paper considers a multi-state system (MSS) where performance rates or/and corresponding state probabilities are presented as fuzzy values. In many real world MSSs it is difficult to estimate precise values of performance rates and their probabilities because of two main reasons. The first reason is inaccuracy and insufficiency of data. The second one is based on the fact that MSSs are often used as the approximation for continuous-state systems in order to simplify computational burden. To overcome these deficiencies, performance rates (levels) or/and corresponding probabilities are considered as fuzzy values in this paper. The fuzzy universal generating function (FUGF) is developed to extend the universal generating function with crisp sets. The composition operators are extended for FUGFs and introduced in more general forms. Based on this a special technique for reliability assessment of such MSSs is developed. Illustrative examples are presented to demonstrate the technique.