ppxscal/embedding_network huggingface dataset:
Layout of (Software) Engineering Diagrams
Authors: Andrew Fish, Alexander Knapp
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

Traditionally, diagrams play an important role in many disciplines such as electrical engineering (e.g. Karnaugh-diagrams), civil and mechanical engineering (construction plans), geography (maps), etc. In Software Engineering today, diagrammatic languages like IDEF, UML or ARIS are commonplace, and with the rise of model driven development and domain specific languages, the use of such languages will become even more widespread in the future. All in all, diagrams play an important role in communication between engineers.
A Simple Approach to the Error Analysis of Division-Free Numerical Algorithms
Authors: Nai-Kuan Tsao
Venue: IEEE Transactions on Computers (1983)

A simple approach is described for the error analysis of division-free algorithms. Applications to the comparison of algorithms for extended sums, products, real polynomial evaluation, complex polynomial evaluation are also given.
An Inference-based Collaborative Filtering Approach
Authors: Jin-Min Yang, Kin Fun Li
Venue: Proceedings of the Third IEEE International Symposium on Dependable, Autonomic and Secure Computing (2007)

In memory-based collaborative filtering, the existing methods conduct a prediction based on the overall consistency of two users or items. The major problem with these methods is that it is hard to find users/items that are overall consistent with the test user/item in the system. In addition, these methods are sometimes being over optimistic, and disregard some useful information in user profiles in making a prediction. This paper exposes the drawbacks in these methods and proposes an inference-based recommendation scheme to overcome those drawbacks. This model is based on the fact that any two users may have common interest genres as well as different ones, with the capability of making full use of rating information to capture accurately the relevance between item and user. Experimental results from two popular public datasets, EachMovie and MovieLens, show that our approach improves significantly the prediction accuracy.
A generic theoretical framework for modeling gossip-based algorithms
Authors: Yaacov Fernandess, Antonio Fernández, Maxime Monod
Venue: ACM SIGOPS Operating Systems Review (2007)

During the past 30 years of the Internet revolution, the Internet has become a major force of change with an enormous effect on civilization. Consequently, computer networks have evolved into more complex system and become virtually ubiquitous. This in turn, has given raise to a growing demand for scalable and reliable computer system architectures. Thus far, there has been enormous effort by the research community to introduce decentralized, simple, and scalable distributed systems to solve a wide range of problems. In this paper we explore one promising solution, which was initially inspired by mathematical models that investigate two everyday life phenomena, epidemics and gossip, which we used interchangeably throughout the paper. During the last century, mathematicians developed models to predict the rate of diseases spread, namely epidemics, using differential equations. In addition, researches developed discrete mathematics models to predict what we already know; rumors spread fast, namely gossip. It was thus natural to harness these models in order to design distributed systems that mimic the basic behavior of such fast spreading everyday life paradigms.
Mining Sequential Constraints for Pseudo-Functional Testing
Authors: Weixin Wu, Michael S. Hsiao
Venue: Proceedings of the 16th Asian Test Symposium (2007)

Using DFT methods such as scan can improve testability and increase fault coverage. However, scan tests may scan in illegal or unreachable states during test application, which may result in incidental detection of functional untestable delay faults during the scan test. This paper presents novel mining techniques for fast top-down functional constraint extraction. The extracted functional constraints capture illegal states through internal signal relations. Imposing these relations as functional constraints to a commercial ATPG tool allows for the generation of effective pseudo-functional tests. We analyze its impact on minimizing the over-testing problem of the scanbased circuits. The experimental results on transition faults and path delay faults reveal that the proposed method produces a small fraction, yet extremely powerful functional constraints effective for constraining the state space.
EHSAT Modeling from Algorithm Description for RTL Model Checking
Authors: Xiaoqing Yang, Jinian Bian, Shujun Deng, Yanni Zhao
Venue: Proceedings of the 16th Asian Test Symposium (2007)

This paper presents a new method to translate Verilog HDL into RTL Model combining algorithm description for high level verification. The model could be used in the enhanced version of a state-of-the-art finite-domain satisfiability(SAT) solver EHSAT to check the verified properties. The enhanced version of EHSAT provides an efficient algorithm to solve the SAT problem for higher level abstraction RTL designs using a hybrid branch-and-bound strategy with conflict-driven learning. This modeling program analyses the control flow of Verilog source codes and generates corresponding statements for the enhanced version EHSAT. This method could largely reduce the scale of model checking and simplify the devices used in EHSAT. Experimental results show that this method can reduce verification problem sizes considerably while comparing with lower level methods.
A conceptual modeling and execution framework for process based scientific applications
Authors: Stefan Jablonski, Bernhard Volz, M. Abdul Rehman
Venue: Proceedings of the ACM first workshop on CyberInfrastructure: information management in eScience (2007)

In recent years, scientists are dealing more and more with data intensive and complex applications. Many scientific workflow systems emerged which adapt technology and methods stemming from the workflow management area and that should support scientists in understanding and working with their complex scenarios. However as these systems often descend from problem solving environments, many of them are missing a well structured conceptual method for process modeling and execution as a foundation. In this publication we present a comprehensive and well structured method for developing and analyzing process based scientific applications. This method is constituted by a process modeling framework, a data integration framework and a model driven approach to build up infrastructures for process modeling and execution.
A framework for real-time utilities for Ada 2005
Authors: A. J. Wellings, A. Burns
Venue: Proceedings of the 13th international workshop on Real-time Ada (2007)

Modernlarge real-time systems are becoming more complex. Whilst Ada 2005 provides a comprehensive set of programming mechanisms that allow these systems to be implemented, the abstractions are low level. This paper argues that there is a need for a standardised library of real-time utilities that address common real-time problems.
An On-board Switch Scheme Based on DiffServ
Authors: Li Song, Ai-jun Liu, Yi-fei Ma
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Two contradictory requirements of the on-board switch scheme are the Quality of Service (QoS) performance and the complexity limitation. Therefore, in order to achieve a better trade-off between the performance and the resource utilization, a new onboard switch scheme based on Differentiated Service (DiffServ) is proposed. Under the scheme, a QoS mapping module adopting the concept of the (m,k) model, which implements mapping between the terrestrial and satellite network traffic, is added to the terrestrial satellite terminal (ST). Additionally, according to the mapping results the on-board switch applying a double-Leak Bucket (LB) model controls the on-board traffic efficiently. In the end, Comparisons are made between the proposed scheme and the conventional one by simulation.
Building IPsec VPN in IPv6 Based on Openswan
Authors: LIU Lian, GAO Wen-mei
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

This paper researches and analyses feature and advantages of IPsec VPN, points out its problem and disadvantages in the IPv4. After analyzing IPv6 network and its data package in deep, this paper studies the feasibility of implementation of IPsec VPN in IPv6 network. Then it elaborates frame and modules which supports IPv6 of Openswan. Via recompiling the 2.6 kernel, adding the NETKEY module to kernel, installing Openswan and configuring it, a IPsec VPN which can runs in pure IPv6 network has been built. Finally, function and performance testing is done.
Schema Conversion from Relation to XML with Semantic Constraints
Authors: Teng Lv, Ping Yan
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

This paper studies the schema conversion from relational schemas to XML DTDs. As functional dependencies play an important role in schema conversion process, the concept of functional dependency for XML DTDs is proposed to preserve the semantics implied by functional dependencies and keys of relational schemas. A conversion method called NeT-FD (Nesting- Based Translation with Functional Dependencies) is proposed to convert relational schemas to XML DTDs in the presence of functional dependencies and keys. The method presented here can preserve the semantics implied by functional dependencies and keys of relational schemas and can convert multiple tables to XML DTDs at the same time.
The Auto-Obtaining of the Knowledge about Developing Hailstone Weather
Authors: Ping Wang, Xiaokai Dong, Zhaoqing Qiang, Huizhen Jia
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

In atmosphere circumfluence the development of hailstone is of law which will be implicated in the time series of the radar echo image if the Doppler radar is used to detected hailstone. Taking it into account that cloud is a kind of liquid, an algorithm for segmenting and getting potential hailstone cloud blocks is designed, the rules to estimate temporal relation among different clouds in different radar echo images are constructed and at last, a tracing algorithm of clouds based on their outer rectangles is given in this paper. By using these algorithms the knowledge of universality about developing hailstone weather is obtained, which is helpful to make hailstone weather forecast automatically as early as most.
Ontology-Based Query System Design and Implementation
Authors: Guan-yu LI, Sui-ming YU, Sha-sha DAI
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

In order to overcome the shortcomings arisen from the expression-only matching, the ontology-based semantic interpretation of concepts should be introduced into the retrieval process. Based on the study of ontology-based information retrieval, a query system oriented to EBM (Evidence-Based Medicine) data is designed and implemented. Meanwhile, OWL, RDF/RDFS and Jena are respectively employed as description language, semantic annotation language, and reasoning tool. Firstly, a medical ontology is established in this system. Secondly, the metadata is described and the semantic annotation for primitive data is achieved. Based on the above, the more ample semantic information is produced, the primitive data is more easily understood by computers and users. Finally, the goal prototype system and the semantic query using the semantic annotation are successfully implemented and verified. The experimental result reveals that not only the semantic pertinence of query results is improved, but also the query efficiency is promoted.
Use of a Bit-true Data Flow Analysis for Processor-Specific Source Code Optimization
Authors: H. Falk
Venue: Proceedings of the 2006 IEEE/ACM/IFIP Workshop on Embedded Systems for Real Time Multimedia (2006)

Nowadays, key characteristics of a processor's instruction set are only exploited in high-level languages by using inline assembly or compiler intrinsics. Inserting intrinsics into the source code is up to the programmer, since only few automatic approaches exist. Additionally, these approaches base on simple code pattern matching strategies. This paper presents techniques for processor-specific code analysis and optimization at the source-level. It is shown how a bit-true dataflow analysis is made applicable for source code analysis for the TI C6x DSPs for the very first time. Based on this bit-true analysis, fully automated optimizations superior to conventional pattern matching techniques are presented which optimize saturated arithmetic, reduce bitwidths of variables and exploit SIMD data processing within source codes. The application of our implemented algorithms to complex real-life codes leads to speed-ups between 33%-48% for the optimization of saturated arithmetic, and up to 16% after SIMD optimization
Automatic detection and analysis of discontinuity geometry of rock mass from digital images
Authors: D. Deb, S. Hariharan, U. M. Rao, Chang-Ha Ryu
Venue: Computers Geosciences (2008)

The inaccessibility of rock exposures is an inherent problem in geotechnical data acquisition that compromises effective geotechnical evaluation. The digital image processing method is a tool that permits a fast, complete, and accurate acquisition of information. Using digital images in photogrammetry, the present study analyzes the discontinuity geometry of rock mass exposures. The study has demonstrated that (a) the transformation function is appropriate for images without any perspective error; (b) the developed system is versatile and can detect both lines as well as curves in multilinear form; (c) the Hough transform algorithm can provide excellent results for rock mass with multiple joint sets having considerable amount of noise; and (d) the beamlets can be classified in an automated manner. The authors recommend the digital face mapping method to characterize rock masses, as it reduces the time spent in the field, thus preserving data integrity. Furthermore, this technique allows for systematic mapping and the building of a permanent and huge database for rock mass characterization.
Elections in a Distributed Computing System
Authors: H. Garcia-Molina
Venue: IEEE Transactions on Computers (1982)

After a failure occurs in a distributed computing system, it is often necessary to reorganize the active nodes so that they can continue to perform a useful task. The first step in such a reorganization or reconfiguration is to elect a coordinator node to manage the operation. This paper discusses such elections and reorganizations. Two types of reasonable failure environments are studied. For each environment assertions which define the meaning of an election are presented. An election algorithm which satisfies the assertions is presented for each environment.
Genetic variation of serotonin function and cognitive control
Authors: Alexander Strobel, Gesine Dreisbach, Johannes Müller, Thomas Goschke, Burkhard Brocke, Klaus-Peter Lesch
Venue: Journal of Cognitive Neuroscience (2007)

Although it is widely accepted that serotonin plays a pivotal role in the modulation of anxiety-and depression-related personality traits as well as in the pathogenesis of anxiety disorders and depression, the role of serotonin in cognition is less clear. In the present study, we investigated the involvement of serotonin in cognitive behaviors by examining the impact of genetic variation in key regulators of serotonergic neurotransmission on behavioral measures in a cognitive control task. Eighty-five healthy participants performed a cued continuous performance task (the AX Continuous Performance Task [AXCPT]) and were genotyped for polymorphisms in the transcriptional control regions of the tryptophan hydroxylase 2 gene (TPH2 G-703T; rs4570625) and the serotonin transporter gene (5-HTTLPR). The core result was that individuals lacking the rare TPH2 T allele were not faster than T allele carriers, but committed fewer errors and were less variable in responding. These findings parallel those of a recent study where an enhancement of executive control in individuals without the rare TPH2 T/T genotype was observed. Together with recent evidence that individuals without the T allele exhibit higher scores in anxiety-and depression-related personality traits, our results underscore the role of the TPH2 G-703T polymorphism in the modulation of behavior and raise the intriguing possibility that genetic variants associated with higher negative emotionality may have beneficial effects on some cognitive functions.
State-based Time-Series Analysis and Prediction
Authors: Jixin Ma
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Time representation and temporal reasoning plays an important role in time-series analysis and prediction, which involve dealing with varying situations in terms of states of the world evolving with time. Generally speaking, the world in the discourse persists in a given state until some action(s) is carried out, or some event(s) occurs, to change it into another state. This paper presents a framework for prediction and analysis based on time-series of states. It takes a time theory that addresses both points and intervals as primitive time elements on an equal footing as the temporal basis. A state of the world under consideration is defined as a set of time-varying propositions that include properties, facts, actions, events, processes and anything else with Boolean truth-values that are dependent on time. A time-series of states is then defined as a list of states temporally ordered one after another. The framework supports explicit expression of both absolute and relative temporal knowledge. While a formal schema for expressing general time-series of states is given, allowing a time-series of states to be incomplete in various ways, the concept of complete time-series of states is also formally introduced. As the application of the proposed formalism in prediction and time-series analysis, illustrating examples are provided.
A web systems laboratory using portable hard drives
Authors: Michael G. Bailey
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

A web systems course has long been taught as the first core IT course at Brigham Young University. Along with introducing students to a cross-section of client and server scripting environments, this course also requires students to install and administer a variety of web and database servers under both Linux and Windows. To be done well, the server administration portion of the course requires that each student has free access to his own machine, or some approximation of a dedicated machine. Various approaches to providing this environment to students have been investigated. Possibilities include providing dedicated hardware to each student, setting up virtual servers, requiring students to obtain notebook computers, and rapid workstation imaging over a SAN. An approach that is less expensive to the institution than providing individualized hardware, and less expensive to students than requiring the purchase of a notebook computer, is to require that students obtain inexpensive, portable hard drives. The laboratory portion of the web systems course has been redesigned to use student-provided hard drives. Students install Linux on these drives, and configure them so that they will externally boot when connected to any current PC. Windows XP is also installed on each drive, in a virtual machine. Students then install, configure and script applications using Apache, MySQL, Tomcat, and IIS servers. The result is a configuration that provides each student with a system that includes a windows server, a Linux server, and clients of their choosing, all on a virtual network within any PC to which the disk is connected. This paper describes the course laboratory configuration, and how portable drives help achieve the course objectives. The paper also provides recommendations for others considering similar laboratories, including student feedback concerning drive reliability, hardware interoperability, and instructional value.
Avoiding Infinite Blocking of Mobile Transactions
Authors: Sebastian Obermeier, Stefan Bottcher
Venue: Proceedings of the 11th International Database Engineering and Applications Symposium (2007)

When a transaction commit decision is lost or delayed in a mobile network, most transaction protocols cannot terminate the transaction and delay conflicting transactions. In contrast to this, we present a concept called Bi-State- Termination (BST) that allows transactions to terminate into two states: one state having the changes applied, and the other state having the transaction aborted. Conflicting transactions that work on these states are not blocked. We prove that BST guarantees atomicity and serializability, and describe a possible implementation using version numbers. Furthermore, our experimental results show that BST is feasibility for mobile networks, and that it enhances the transaction throughput whenever transactions are blocked for a long time.
Floating-Point Arithmetic Algorithms in the Symmetric Residue Number System
Authors: E. Kinoshita
Venue: IEEE Transactions on Computers (1974)

The residue number system is an integer number system and is inconvenient to represent numbers with fractional parts. In the symmetric residue system, a new representation of floating-point numbers and arithmetic algorithms for its addition, subtraction, multiplication, and division are proposed. A floating-point number is expressed as an integer multiplied by a product of the moduli. The proposed system assumes existence of necessary conversion procedures before and after the computation.
Automating service quality with TOMCAD (Tradeoff Model with Capacity and Demand)
Authors: Raihan Al-Ekram, Ric Holt, Chris Hobbs, Susan Sim
Venue: Proceedings of the 2007 workshop on Automating service quality: Held at the International Conference on Automated Software Engineering (ASE) (2007)

Large distributed networked software systems are built to provide competing qualities such as reliability, availability, security, performance and scalability to their clients. In certain situations these qualities must be traded off, sacrificing some qualities to some extent to improve others. This paper presents TOMCAD (a Tradeoff a Model with Capacity and Demand) for such tradeoffs and gives various properties and constraints that apply to such situations. With this approach, we show how to dynamically allocate system resources when demand changes with time, in a way that maintains required objectives for some service qualities. We demonstrate how this model applies to a family of distributed systems that trades off data consistency to gain availability.
Building Scalable Semantic Peer-to-Peer Data Management Systems: The SomeWhere Approach
Authors: Marie-Christine Rousset
Venue: Proceedings of the Eighth Mexican International Conference on Current Trends in Computer Science (2007)

In this talk, I present the SomeWhere approach and infrastructure for building semantic peer-to-peer data management systems based on simple personalized ontologies but which are distributed at a large scale.