ppxscal/embedding_network huggingface dataset:
Dynamically Detecting Faults via Integrity Constraints
Authors: Ian J. Hayes
Venue: Methods, Models and Tools for Fault Tolerance (2009)

Control programs for safety-critical systems are required to tolerate faults in the devices they control. In this paper we examine a systematic approach to devising code to detect faulty devices at runtime. The approach is centred around the use of integrity constraints, which are invariants on the state of a system's variables, including its inputs and outputs. Under normal operation integrity constraints should always hold, but they are designed to fail to hold if there is a fault. By adding variables to capture the previous state of variables or the time of significant events, additional integrity constraints can be devised to check for faults in state transitions or faults with the rate of progress of the system. We discuss techniques for devising integrity constraints as well as efficiently evaluating the constraints. When an error is detected via the failure of an integrity constraint, the integrity constraint(s) that failed can help diagnose the likely fault. The techniques are presented by way of a simple case study of controller software written in the action system style, but the approach is equally applicable to other state machine approaches such as Event-B and TLA.
ARForce
Authors: Kensei Jo, Yasuaki Kakehi, Kouta Minamizawa, Hideaki Nii, Naoki Kawakami, Susumu Tachi
Venue: ACM SIGGRAPH ASIA 2008 artgallery: emerging technologies (2008)

A novel marker-based system for augmented reality that measures not only the 3D positions and IDs of markers, but also the distribution of force vectors applied to the markers. Users can observe overlaid virtual images and control them with their fingers.
Evaluating the ICRA 2008 HRI challenge
Authors: Astrid Weiss, Thomas Scherndl, Manfred Tscheligi, Aude Billard
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

This paper reports on the evaluation of the ICRA 2008 Human-Robot Interaction (HRI) Challenge. Five research groups demonstrated state-of-the-art work on HRI with a special focus on social and learning abilities. The demonstrations were rated by expert evaluators, in charge of awarding the prize, and 269 participants, i.e. 20 percent of the conference attendees through a standardized questionnaire (semantic differential). The data was analyzed with respect to six independent variables: expert evaluators vs. attendees, nationality of participants, origin region of the demo, age, gender and knowledge level of the attendees. Conference attendees tended to give higher scores for Social Skills, General Impression, and Overall Score than the expert evaluators. Irrespectively of the level of knowledge, age, and gender, conference attendees rated all demos relatively homogeneously. However, a comparative analysis of the conference attendees's ratings nationality-wise showed that demonstrations were rated differently depending on the region of origin. Conference attendees for the USA and Asian countries tended to rate demos from the same country of origin more frequently and more positively.
A parameter-tuned genetic algorithm for the resource investment problem with discounted cash flows and generalized precedence relations
Authors: Amir Abbas Najafi, Seyed Taghi Akhavan Niaki, Moslem Shahsavar
Venue: Computers and Operations Research (2009)

A resource investment problem with discounted cash flows (RIPDCF) is a project-scheduling problem in which (a) the availability levels of the resources are considered decision variables and (b) the goal is to find a schedule such that the net present value of the project cash flows optimizes. In this paper, the RIPDCF in which the activities are subject to generalized precedence relations is first modeled. Then, a genetic algorithm (GA) is proposed to solve this model. In addition, design of experiments and response surface methodology are employed to both tune the GA parameters and to evaluate the performance of the proposed method in 240 test problems. The results of the performance analysis show that the efficiency of the proposed GA method is relatively well.
On feedback stabilization of the tokamak plasma vertical instability
Authors: M. L. Walker, D. A. Humphreys
Venue: Automatica (Journal of IFAC) (2009)

For more than a decade the instability intrinsic to vertically elongated tokamak plasmas has been relatively well understood. Controllers that stabilize this instability have been in routine use at experimental devices since the 1980's. However, most analysis of this instability has used low order approximations, often just one state, from which understanding of the much higher order system is extrapolated. We expand on [Walker & Humphreys (2006a). A multivariable analysis of the plasma vertical instability in tokamaks. In Proceedings of the 45th IEEE conference on decision & control (pp. 2213)] using a full multivariable model to provide a rigorous treatment of this problem, including the case in which some control coils are superconducting. The results are consistent with the physics knowledge routinely used by specialists in designing vertical stabilization. We examine two models of the tokamak-and-plasma system, one assuming the plasma has mass, the other assuming zero mass. Although the with-mass model is more correct, the massless model is most often used in control analyses. We examine multiple systems distinguished by whether there are superconducting control coils, the magnitude of the instability, and how strongly conductors are coupled. PD feedback is used as the prototype controller to study these models. Answers to stability questions depend critically on whether the plasma is assumed to have mass, but undergo only minor changes with the presence of superconducting coils. Examples show analyses using a massless plasma model can reach erroneous conclusions. Since the problem is unfamiliar to the general control community, tutorial information provides insight into the origin of the problem.
A Novel WiMAX Structure with Mesh Network
Authors: Jie Zeng, Xiaofeng Zhong
Venue: Proceedings of the 10th IFIP/IEEE International Conference on Management of Multimedia and Mobile Networks and Services: Real-Time Mobile Multimedia Services (2008)

IEEE802.16 (WiMAX) is a wireless metropolitan area network standard with high transmission speed and great coverage. Point to multi-point (PMP) is the traditional WiMAX transmission mode. Wireless mesh network (WMN) is an attractive and useful structure which is suggested to be adopted in WiMAX. A smart WiMAX structure with mesh is proposed in our paper, which supports direct data transmission between SSs (subscribe stations) with the control of the BS if possible. This mesh model is easy to achieve, and could improve the system performance such as throughput and propagation delay. With the help of the BS, several key problems in pure wireless mesh network are satisfactorily solved, such as coexistence, interference and billing. Simulation results are presented in this article to show the enhancement gain of the system performance by the smart model. The idea of virtual cell is put forward to benefit analysis, and the performance with AMC scheme is considered too. More concrete descriptions and explanations are given in the article.
Simulating growth of the h-index
Authors: Raf Guns, Ronald Rousseau
Venue: Journal of the American Society for Information Science and Technology (2009)

Temporal growth of the h-index in a diachronous cumulative time series is predicted to be linear by Hirsch (2005), whereas other models predict a concave increase. Actual data generally yield a linear growth or S-shaped growth. We study the h-index's growth in computer simulations of the publication-citation process. In most simulations the h-index grows linearly in time. Only occasionally does an S-shape occur, while in our simulations a concave increase is very rare. The latter is often signalled by the occurrence of plateaus&mdash;periods of h-index stagnation. Several parameters and their influence on the h-index's growth are determined and discussed. &copy; 2009 Wiley Periodicals, Inc.
Are we modelling the right thing? The impact of incorrect problem specification in credit scoring
Authors: Steven Finlay
Venue: Expert Systems with Applications: An International Journal (2009)

Classification and regression models are widely used by mainstream credit granting institutions to assess the risk of customer default. In practice, the objectives used to derive model parameters and the business objectives used to assess models differ. Models parameters are determined by minimising some function or error or by maximising likelihood, but performance is assessed using global measures such as the GINI coefficient, or the misclassification rate at a specific point in the score distribution. This paper seeks to determine the impact on performance that results from having different objectives for model construction and model assessment. To do this a genetic algorithm (GA) is utilized to generate linear scoring models that directly optimise business measures of interest. The performance of the GA models is then compared to those constructed using logistic and linear regression. Empirical results show that all models perform similarly well, suggesting that modelling and business objectives are well aligned.
Dynamic visualisations and hypermedia: Beyond the "Wow" factor
Authors: Paul Chandler
Venue: Computers in Human Behavior (2009)

Dynamic visualisations and hypermedia have the potential to transform how we design instruction and can lead to highly innovative and flexible learning environments. However, their continued success largely depends on the importance placed by designers on the cognitive processes crucial to the learning process. This discussion paper examines the findings of six papers which increase our knowledge of how we can use dynamic visualisations and hypermedia to generate powerful learning solutions.
Reverse Engineering Cross-Modal User Interfaces for Ubiquitous Environments
Authors: Renata Bandelloni, Fabio Paternò, Carmen Santoro
Venue: Engineering Interactive Systems: EIS 2007 Joint Working Conferences, EHCI 2007, DSV-IS 2007, HCSE 2007, Salamanca, Spain, March 22-24, 2007. Selected Papers (2008)

Ubiquitous environments make various types of interaction platforms available to users. There is an increasing need for automatic tools able to transform user interfaces for one platform into versions suitable for a different one. To this end, it is important to have solutions able to take user interfaces for a given platform and build the corresponding logical descriptions, which can then be manipulated to obtain versions adapted to different platforms. In this paper we present a solution to this issue that is able to reverse engineer even interfaces supporting different modalities (graphical and voice).
Design for Test of Asynchronous NULL Convention Logic (NCL) Circuits
Authors: Waleed K. Al-Assadi, Sindhu Kakarla
Venue: Journal of Electronic Testing: Theory and Applications (2009)

Due to the absence of a global clock and the presence of more state holding elements that synchronize the control and data paths, conventional Automatic Test Pattern Generation (ATPG) algorithms fail when applied to asynchronous circuits, leading to poor fault coverage. This paper presents a design for test (DFT) technique for a popular asynchronous design paradigm called NULL Convention Logic (NCL) aimed at making NCL designs testable using existing DFT tools with reasonable gate overhead. The proposed technique performs test points (TPs) insertion using Sandia Controllability and Observability Program (SCOAP) analysis to enhance the controllability of feedback nets and observability for fault sites that are flagged unobservable. An Automatic DFT Insertion Flow (ADIF) algorithm and a custom ATPG NCL primitive gates library are developed. The developed DFT technique has been verified on several NCL benchmark circuits
A New Bounding Technique for Handling Arbitrary Correlations in Path-Based SSTA
Authors: Walter Schneider, Manuel Schmidt, Bing Li, Ulf Schlichtmann
Venue: Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation: 18th International Workshop, PATMOS 2008, Lisbon, Portugal, September 10-12, 2008. Revised Selected Papers (2009)

Statistical static timing analysis (SSTA) has emerged as a viable technique to capture increasing process variations in 90nm technologies and beyond. To obtain realistic results from a statistical timer, careful attention to the statistical gate delays and correlations between them is required. However when using SSTA early in the design phase, no correlation information is available. This paper addresses this problem and proposes a novel path-based algorithm, which covers arbitrary correlations by computing bounds for the true path delay distribution. Our bounding method is based on the theory of copulas as well as an efficient bounding improvement technique. The efficiency and accuracy of the proposed algorithm is demonstrated on ISCAS'85 benchmark circuits. Over all testcases and all spatial correlation structures the average error of the 95 th quantile points is smaller than 7% and the run-time is drastically reduced compared to a transistor level SPICE Monte Carlo simulation.
On the topological directional entropy
Authors: Hasan Akın
Venue: Journal of Computational and Applied Mathematics (2009)

In this paper we study the topological directional entropy of Z^2-actions generated by one-dimensional linear cellular automata and the shift map @s acting on compact metric space Z"m^Z. We give a formula, which can be efficiently and rightly computed by means of the coefficients of the local rule f, for the topological directional entropy of Z^2-action generated by the pair (T"f"["-"r","r"],@s) in the direction @q (@q@?[0,@p]). We also generalize the results obtained by Akin [H. Akin, The topological entropy of invertible cellular automata, J. Comput. Appl. Math. 213 (2) (2008) 501-508] to the topological entropy of any invertible one-dimensional linear cellular automata.
Topological Morphing of Planar Graphs
Authors: Patrizio Angelini, Pier Francesco Cortese, Giuseppe Battista, Maurizio Patrignani
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

In this paper we study how two planar embeddings of the same biconnected graph can be morphed one into the other while minimizing the number of elementary changes.
An Adaptive Approach of Semi-blind Data and Channel Estimation for Meteor Burst Communications
Authors: Zan Li, Xiaofeng Lu, Jiangbo Si
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

In view of the characteristics of the meteor burst channel, the variable rate data transmission mechanism for meteor burst communication (MBC). Based on the estimation of the system parameters, the joint data and channel estimation for maximum likelihood sequence detection (MLSD) is presented, which performs the principle of per-survivor processing (PSP) and adapts to the structure of MBC data frame. An adaptive state reduction of PSP (ASRP) algorithm whose states are chosen by time-varying threshold according to the exponential decay of meteor channel is proposed, which can make good tradeoff between performance and computational complexity, and provides reliable data transmission for adaptive modulation and coding (AMC) of MBC system. Computer simulation results and complexity evaluation are also included to support our development.
Automating the loading of business process data warehouses
Authors: Malu Castellanos, Alkis Simitsis, Kevin Wilkinson, Umeshwar Dayal
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Business processes drive the operations of an enterprise. In the past, the focus was primarily on business process design, modeling, and automation. Recently, enterprises have realized that they can benefit tremendously from analyzing the behavior of their business processes with the objective of optimizing or improving them. In our research, we address the problem of warehousing business process execution data so that we can analyze their behavior using the analytic and reporting tools that are available in data warehouse environments. We build upon our previous work that described the design and implementation of a generic process data warehouse for use with any business processes. In this paper, we show how to automate the population of the generic process warehouse by tracking business events from an application environment. Typically, the source data consists of event streams that indicate changes in the business process state (i.e., progression of the process). The target schema is designed to allow querying of task and process execution data. The core of our approach for processing progression data relies on the construction of generic templates that specify the semantics of the event streams extraction and the subsequent transformations that translate the underlying IT events into business data changes. Using this extensible template mechanism, we show how to automate the construction of mappings to populate the generic process warehouse using two-levels of mappings that are applied in two-phases. Interestingly, our approach of using ETL technology for warehousing process data can be seen the other way around. An arbitrary ETL process can be modeled as a business process. Hence, we describe the benefit of modeling ETL as a business process and illustrate how to use our approach to warehouse ETL execution data, and to monitor and analyze the progress of ETL processes. Finally, we discuss implementation issues.
The Performance Analysis of an Improved Robust Beamforming Algorithm
Authors: Chun-Jing Liu, Shu Zhang, Feng Liu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

The conventional minimum variance beamformer (MVB) is known to have better resolution and much better interference rejection capability when the array steering vector is accurately known. However, the major problem of the MVB is that it lacks robustness against the unknown array steering vector errors. Therefore, diagonal loading and its extended versions have been a popular approach to improve the robustness of MVB. In this paper, we provide an improved robust MVB (RMVB) algorithm, which has been derived by enforcing a spherical uncertainty set constraint on the array steering vector. The new algorithm has reasonable computation complexity and more numerical stability. Simulation results show that the new algorithm is effective in the presence of array steering vector errors.
The antimagicness of the Cartesian product of graphs
Authors: Yuchen Zhang, Xiaoming Sun
Venue: Theoretical Computer Science (2009)

An antimagic labeling of a graph with M edges and N vertices is a bijection from the set of edges to the set {1,2,3,...,M} such that all the Nvertex-sums are pairwise distinct, where the vertex-sum of a vertex v is the sum of labels of all edges incident with v. A graph is called antimagic if it has an antimagic labeling. The antimagicness of the Cartesian product of graphs in several special cases has been studied [Tao-Ming Wang, Toroidal grids are anti-magic, in: Proc. 11th Annual International Computing and Combinatorics Conference, COOCOON'2005, in: LNCS, vol. 3595, Springer, 2005, pp. 671-679, Yongxi Cheng, A new class of antimagic cartesian product graphs, Discrete Mathematics 308 (24) (2008) 6441-6448]. In this paper, we develop new construction methods that are applied to more general cases. We prove that the Cartesian product of paths is antimagic, if one of them has at least three edges. This (almost) answers the open problems in [Yongxi Cheng, Lattice grids and prisms are antimagic, Theoretical Computer Science 374 (2007) 66-73]. We also prove that the Cartesian product of an antimagic regular graph and a connected graph is antimagic, which extends the results of the latter of the two references, where several special cases are studied.
Model Based Analysis of fMRI-Data: Applying the sSoTS Framework to the Neural Basic of Preview Search
Authors: Eirini Mavritsaki, Harriet Allen, Glyn Humphreys
Venue: Attention in Cognitive Systems: 5th International Workshop on Attention in Cognitive Systems, WAPCV 2008 Fira, Santorini, Greece, May 12, 2008 Revised Selected Papers (2009)

The current work aims to unveil the neural circuits underlying visual search over time and space by using a model-based analysis of behavioural and fMRI data. It has been suggested by Watson and Humphreys [31] that the prioritization of new stimuli presented in our visual field can be helped by the active ignoring of old items, a process they termed visual marking. Studies using fMRI link the marking process with activation in superior parietal areas and the precuneus [4,18,27,26]. Marking has been simulated previously using a neural-level account of search, the spiking Search over Time and Space (sSoTS) model, which incorporates inhibitory as well as excitatory mechanisms to guide visual selection. Here we used sSoTS to help decompose the fMRI signals found in a preview search procedure, when participants search for a new target whilst ignoring old distractors. The time course of activity linked to inhibitory and excitatory processes in the model was used as a regressor for the fMRI data. The results showed that different neural networks were correlated with top-down excitation and top-down inhibition in the model, enabling us to fractionate brain regions previously linked to visual marking. We discuss the contribution of model-based analysis for decomposing fMRI data.
A fuzzy ANP approach to shipyard location selection
Authors: A. F. Guneri, M. Cengiz, S. Seker
Venue: Expert Systems with Applications: An International Journal (2009)

It is the first duty of investors to transform financial resources into investments in the right places at the right times and earn benefits. However, where to invest and how to invest is always a risky and complicated problem. The decision which will be made under a variety of factors might result in a terrible mistake if it is not felicitous. It is necessary to utilize scientific methods when deciding to make these types of complicated investments which can cause large financial losses. Analytical network process (ANP) can show us the best alternative based on different criteria from a variety of alternatives. However, the network structure should model the actual in a very good way. Analytical network process will give us the best result in span after the correctly built network structure's comparisons are made correctly. It is important to design the structure flexibly in this work in order for it to lead to improvements. Shipyard location is selected in this work which provides reference to investors based on numerical and solid essences. At the end, the study has received a successful application with the help of expert people and the correct fuzzy analytical network process's success over the criteria which have a close relationship with each other.