ppxscal/embedding_network huggingface dataset:
A dynamic programming approach for finding shortest chains in a fuzzy network
Authors: Iraj Mahdavi, Rahele Nourifar, Armaghan Heidarzade, Nezam Mahdavi Amiri
Venue: Applied Soft Computing (2009)

Graph theory has numerous applications to problems in systems analysis, operations research, transportation, and economics. In many cases, however, some aspects of a graph-theoretic problem may be uncertain. For example, the vehicle travel time or vehicle capacity on a road network may not be known exactly. In such cases, it is natural to make use of fuzzy set theory to deal with the uncertainty. Here, we are concerned with finding shortest chains in a graph with fuzzy distance for every edge. We propose a dynamic programming approach to solve the fuzzy shortest chain problem using a suitable ranking method. By using MATLAB, two illustrative examples are worked out to demonstrate the proposed algorithm.
Heterogeneous Labour Markets in a Microsimulation---AGE Model: Application to Welfare Reform in Germany
Authors: Stefan Boeters, Michael Feil
Venue: Computational Economics (2009)

Labour market reforms that are designed to stimulate labour supply at the lower end of the wage distribution can never be precisely restricted to the target group. Spillovers to and feedback from other segments of the labour market are unavoidable and may counteract the direct effects of the reform. An adequate representation of heterogeneous labour markets becomes therefore an important issue for the assessment of reforms. We analyse the possible interactions between labour market segments in a combined, consistent microsimulation---AGE model with a flexible representation of substitution possibilities and different mechanisms of wage determination. We look at a stylised reform and find labour-demand cross-price elasticities between the low and medium skilled to be the main drivers of the results. Interaction with the high-skilled segment is less pronounced.
Unweaving the impact of aspect changes in AspectJ
Authors: Luca Cavallaro, Mattia Monga
Venue: Proceedings of the 2009 workshop on Foundations of aspect-oriented languages (2009)

Aspect-oriented programming (AOP) fosters the coding of tangled concerns in separated units that are then woven together in the executable system. Unfortunately, the oblivious nature of the weaving process makes difficult to figure out the augmented system behavior. It is difficult, for example, to understand the effect of a change just by reading the source code. In this paper, we focus on detecting the run time impact of the editing actions on a given set of test cases. Our approach considers two versions of an AspectJ program and a test case. Our tool, implemented on top of the abc weaver and the AJANA framework is able to map semantics changes to the atomic editing changes in the source code.
Use of genetic algorithm in generation of feasible test data
Authors: Praveen Ranjan Srivastava, Priyanka Gupta, Yogita Arrawatia, Suman Yadav
Venue: ACM SIGSOFT Software Engineering Notes (2009)

In recent years researchers have applied the concept of Genetic Algorithm in generation of test data for effective software testing. Several attempts have been made to develop a system to generate test data automatically. The existing such systems do not guarantee to generate test data in only feasible paths. This paper proposes a method to generate feasible test data, using Genetic Algorithm.
What life? What cycle?
Authors: Nicholas Zvegintzov
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

The traditional system life cycle model does not portray the life of a system, nor is it a cycle. An alternative model is described that portrays the modification cycle of the system and the detailed activities of making a change. Implications are drawn for maintenance, development, and the education of software engineers.
Weak Signal Detection Based on Chaotic Prediction
Authors: Junyang Pan, Jinyan Du, Shie Yang
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

In this paper, a weak signal detection method based on radial basis function (RBF) neural networks is discussed. The principle of weak signal detection with a background noise predictor is that the predictor trained by chaotic time series has a small prediction error, and the prediction error becomes relative large when the input contains a source or target. By exploiting the short-term predictability of the input signal, a one-step-ahead prediction model is proposed as the basis of designing an RBF neural network. To enhance the detection performance in noisy background, the extended Kalman filter (EKF) is applied to perform the training and better parameter estimates can be acquired compared to the conventional RBF network training method. The performance of detection for low signal-to-noise ratio (SNR) is analyzed. Computer simulations show that the proposed method is effective for weak signal detection.
An enhanced algorithm for knee joint sound classification using feature extraction based on time-frequency analysis
Authors: Keo Sik Kim, Jeong Hwan Seo, Jin U. Kang, Chul Gyu Song
Venue: Computer Methods and Programs in Biomedicine (2009)

Vibroarthrographic (VAG) signals, generated by human knee movement, are non-stationary and multi-component in nature and their time-frequency distribution (TFD) provides a powerful means to analyze such signals. The objective of this paper is to improve the classification accuracy of the features, obtained from the TFD of normal and abnormal VAG signals, using segmentation by the dynamic time warping (DTW) and denoising algorithm by the singular value decomposition (SVD). VAG and knee angle signals, recorded simultaneously during one flexion and one extension of the knee, were segmented and normalized at 0.5Hz by the DTW method. Also, the noise within the TFD of the segmented VAG signals was reduced by the SVD algorithm, and a back-propagation neural network (BPNN) was used to classify the normal and abnormal VAG signals. The characteristic parameters of VAG signals consist of the energy, energy spread, frequency and frequency spread parameter extracted by the TFD. A total of 1408 segments (normal 1031, abnormal 377) were used for training and evaluating the BPNN. As a result, the average classification accuracy was 91.4 (standard deviation +/-1.7) %. The proposed method showed good potential for the non-invasive diagnosis and monitoring of joint disorders such as osteoarthritis.
Holomorphic canonical forms for holomorphic families of singular systems
Authors: M. Isabel García-Planas
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

In this paper we obtain a canonical reduced form for regularizable singular systems and we describe generic holomorphic families that permit us, to analyze the neighborhood of a given system.
The Development of Fuzzy Rough Sets with the Use of Structures and Algebras of Axiomatic Fuzzy Sets
Authors: Xiaodong Liu, Witold Pedrycz, Tianyou Chai, Mingli Song
Venue: IEEE Transactions on Knowledge and Data Engineering (2009)

The notion of a rough set was originally proposed by Pawlak underwent a number of extensions and generalizations. Dubois and Prade (1990) introduced fuzzy rough sets which involve the use of rough sets and fuzzy sets within a single framework. Radzikowska and Kerre (2002) proposed a broad family of fuzzy rough sets, referred to as ( t)-fuzzy rough sets which are determined by some implication operator (implicator), and a certain t-norm. In order to describe the linguistically represented concepts coming from data available in some information system, the concept of fuzzy rough sets are redefined and further studied in the setting of the Axiomatic Fuzzy Set (AFS) theory. Compared with the ( t)-fuzzy rough sets, the advantages of AFS fuzzy rough sets are twofold. They can be directly applied to data analysis present in any information system without resorting to the details concerning the choice of the implication, t-norm and a similarity relation S. Furthermore such rough approximations of fuzzy concepts come with a well-defined semantics and therefore offer a sound interpretation. Some examples are included to illustrate the effectiveness of the proposed construct. It is shown that the AFS fuzzy rough sets provide a far higher flexibility and effectiveness in comparison with rough sets and some of their generalizations.
Sparse implicit projection (SIP) for reduction of general many-terminal networks
Authors: Zuochang Ye, Dmitry Vasilyev, Zhenhai Zhu, Joel R. Phillips
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

This paper is concerned with model order reduction of large scale dynamic systems that have sparse matrix representations, particularly systems with large numbers of input/output "ports." We present an algorithm that combines the advantages of widely-used approaches such as PRIMA and TICER but avoids many of the drawbacks of both. The resulting algorithm is capable of highorder rational approximation, exploits network sparsity, preserves passivity, can be extended to general non-symmetric systems, and can be applied to networks with hundreds or thousands of ports. We develop a common mathematical framework that can encompass all three algorithms, show mathematical relations between them, and point out certain special cases where they are equivalent. We show examples from analysis of industrial on-chip RC/RLC networks that demonstrate performance advantages of more than three orders of magnitude.
Connectivity in a random interval graph with access points
Authors: Yilun Shang
Venue: Information Processing Letters (2009)

We derive closed analytical formulae of connectivity for random interval graphs in the presence of fixed access points. We examine the influence of positions of access points on the graph accessible connectivity. The results developed in this paper are useful in the design and engineering of random wireless access network in the future.
H&#x00f6;lder estimates for Green&#x2019;s functions on convex polyhedral domains and their applications to finite element methods
Authors: J. Guzm&#x00e1;n, D. Leykekhman, J. Rossmann, A. H. Schatz
Venue: Numerische Mathematik (2009)

A model second-order elliptic equation on a general convex polyhedral domain in three dimensions is considered. The aim of this paper is twofold: First sharp H&#x00f6;lder estimates for the corresponding Green&#x2019;s function are obtained. As an applications of these estimates to finite element methods, we show the best approximation property of the error in $${W^1_{\infty}}$$. In contrast to previously known results, $${W_p^{2}}$$regularity for p > 3, which does not hold for general convex polyhedral domains, is not required. Furthermore, the new Green&#x2019;s function estimates allow us to obtain localized error estimates at a point.
A computer-aided VLSI layout system
Authors: W. A. Dees, K. M. Parmar, A. Goyal, R. Y. Tsui, B. D. Rathi, R. J. Smith,  II
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

The VLSI layout system is suggested as a practical approach for solving large and complex problems introduced by today's VLSI technology. Computer-based design aids are introduced which are utilized to effectively reduce design time and to increase product quality. A hierarchical description of VLSI circuits is utilized to partition the problem into manageable tasks. Each phase of the VLSI chip design cycle is discussed with special emphasis on layout techniques. The hierarchical VLSI layout system is applicable to the design of "semicustom" or master-slice VLSI circuits. The placement and placement optimization portions of the proposed system have been implemented. Routing and routing optimization techniques are currently being developed.
The effects of robot touch and proactive behaviour on perceptions of human-robot interactions.
Authors: Henriette S.M. Cramer, Nicander A. Kemper, Alia Amin, Vanessa Evers
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

Despite robots' embodiment, the effect of physical contact or touch and its interaction with robots' autonomous behaviour has been a mostly overlooked aspect of human-robot interaction. This video-based, 2x2 between-subject survey experiment (N=119) found that touch and proactiveness interacted in their effects on perceived machine-likeness and dependability. Attitude towards robots in general also interacted with the effects of touch. Results show the value of further exploring the combination of physical aspects of human-robot interaction and proactiveness.
Maximum Margin Embedding
Authors: Bin Zhao, Fei Wang, Changshui Zhang
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

We propose a new dimensionality reduction method called Maximum Margin Embedding (MME), which targets to projecting data samples into the most discriminative subspace, where clusters are most well-separated. Specifically, MME projects input patterns onto the normal of the maximum margin separating hyperplanes. As a result, MME only depends on the geometry of the optimal decision boundary and not on the distribution of those data points lying further away from this boundary. Technically, MME is formulated as an integer programming problem and we propose a cutting plane algorithm to solve it. Moreover, we prove theoretically that the computational time of MME scales linearly with the dataset size. Experimental results on both toy and real world datasets demonstrate the effectiveness of MME.
Design of Software Services for Computer-Based Infection Control and Antibiotic Management in the Intensive Care Unit
Authors: Kristof Steurbaut, Sofie Van Hoecke, Kristof Taveirne, Kristof Lamont, Filip De Turck, Kirsten Colpaert, Pieter Depuydt, Dominique Benoit, Chris Danneels, Johan Decruyenaere
Venue: Proceedings of the 2009 International Conference on eHealth, Telemedicine, and Social Medicine (2009)

The increase of nosocomial infections and antibiotic resistance at the Intensive Care Unit (ICU) requires new approaches for infection control and antibiotic management. Although large hospitals have already introduced database systems for automated collection of patients' laboratory results and monitoring data, physicians and nurses are still confronted with time-consuming manual infection control. There is a lack of integrated computerized medical services that could aid physicians in making the most optimal decision in the antibiotic therapies and infection treatment for every patient. Today, current ICU platforms are not offering an infrastructure for infection surveillance, extended data mining and modeling of critical illness. Therefore, this paper describes the design of time and data-driven software services to reduce improper use of antibiotics, prescriptions, inappropriate therapies and to offer an earlier and more accurate detection of infections and antibiotic resistance, contributing to increased efficiency of patient care.
Multimodal interfaces for automotive applications (MIAA)
Authors: Christian Müller, Gerald Friedland
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

This paper summarizes the main objectives of the IUI workshop W2 on multimodal interfaces for automotive applications.
Highly available and scalable grid services
Authors: Guillaume Pierre, Thorsten Schütt, Jörg Domaschka, Massimo Coppola
Venue: Proceedings of the Third Workshop on Dependable Distributed Data Management (2009)

Grid computing infrastructures create many new challenges related to data management. Grids are typically deployed at a large scale, and one can only expect this scale to grow even more in terms of number of machines, locations and administrative domains.
Piles across space: Breaking the real-estate barrier on small-display devices
Authors: QianYing Wang, Tony Hsieh, Andreas Paepcke
Venue: International Journal of Human-Computer Studies (2009)

We describe an implementation that has users 'flick' notes, images, audio, and video files onto virtual, imaginary piles beyond the display of small-screen devices. Multiple sets of piles can be maintained in persistent workspaces. Two user studies yielded the following: Participants developed mental schemes to remember virtual pile locations, and they successfully reinstated pile locations after several days, while situated in varying environments. Alignment of visual cues on screen with surrounding physical cues in situ accelerated a sorting task when compared to other, non-aligned visual cues. The latter, however, yielded better long-term retention.
Robust Precoding for Multi-user MIMO System with Partial Channel State Information
Authors: Qian Zhang, Xiexian Zhong, Jing-jing Wang
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

In realistic MIMO communication system, the receiver has usually perfect channel state information (CSI), while the transmitter has only partial channel state information feedback from the receiver for many reasons. This paper analyzes the partial channel state information, and introduces a method of equivalent noise to study the design of precoding with partial CSI. In this paper, based on ZF criterion, the method models feedback error to equivalent noise, and then deals with feedback error and interference together. Finally this method is simulated and analyzed on MIMO-TD-SCDMA system. And the simulation results are used to show that the precoding system suffers greatly from performance degradation with feedback error and the great performance advantage is attained by the robust optimization.
Simplified sum-product algorithm using piecewise linear function approximation for low complexity LDPC decoding
Authors: Jae Hee Han, Myung Hoon Sunwoo
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

This paper proposes the simplified sum-product (SSP) decoding algorithm to improve BER performance for low-density parity-check codes (LDPC). The sum-product algorithm achieves the highest BER performance among the LDPC decoding algorithms. However, based on the hyperbolic tangent and inverse hyperbolic tangent functions for the check node updates, the sum-product (SP) algorithm requires high computational complexity. To reduce computational complexity, the proposed SSP algorithm adopts a piecewise linear approximation, the logarithmic and exponential functions, which can replace multiplications and divisions with additions and subtractions. In addition, the proposed SSP algorithm can simplify both the ln[tanh(x)] and tanh-1[exp(x)] by using two quantization tables which can reduce tremendous computational complexity. Simulation results show that the proposed SSP algorithm can improve about 0.8 dB of bit error ratio (BER) performance compared with the modified sum-product algorithm.
Fixed point analysis of single cell IEEE 802.11e WLANs: uniqueness and multistability
Authors: Venkatesh Ramaiyan, Anurag Kumar, Eitan Altman
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

We consider the vector fixed point equations arising out of the analysis of the saturation throughput of a single cell IEEE 802.11e (EDCA) wireless local area network with nodes that have different backoff parameters, including different Arbitration InterFrame Space (AIFS) values. We consider balanced and unbalanced solutions of the fixed point equations arising in homogeneous (i.e., one with the same backoff parameters) and nonhomogeneous networks. By a balanced fixed point, we mean one where all coordinates are equal. We are concerned, in particular, with 1) whether the fixed point is balanced within a class, and 2) whether the fixed point is unique. Our simulations show that when multiple unbalanced fixed points exist in a homogeneous system then the time behavior of the system demonstrates severe short term unfairness (or multistability). We provide a condition for the fixed point solution to be balanced, and also a condition for uniqueness. We then extend our general fixed point analysis to capture AIFS based differentiation and the concept of virtual collision when there are multiple queues per station; again a condition for uniqueness is established. For the case of multiple queues per node, we find that a model with as many nodes as there are queues, with one queue per node, provides an excellent approximation. Implications for the use of the fixed point formulation for performance analysis are also discussed.
Branching Markov processes and related asymptotics
Authors: S. Y. Hwang, I. V. Basawa
Venue: Journal of Multivariate Analysis (2009)

Models for Markov processes indexed by a branching process are presented. The new class of models is referred to as the branching Markov process (BMP). The law of large numbers and a central limit theorem for the BMP are established. Bifurcating autoregressive processes (BAR) are special cases of the general BMP model discussed in the paper. Applications to parameter estimation are also presented.
Services-Oriented CRM System and Enabling Technologies for Insurance Enterprises
Authors: Yongbin Huang, Jianfeng Wang
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Based on the analysis of customer relationship management(CRM) and information management requirements for insurance enterprises, this paper puts forward a service-oriented CRM framework for insurance enterprises and analysis the composition of the system, which includes resource base layer, system supporting layer, function service layer, services integration layer, business process layer and application presentation layer. Based on above research, some enabling technologies for realizing the service-oriented CRM system for insurance enterprises are deeply studied, including CRM data analysis and process technologies based on data warehouse, service-oriented system integration technologies for CRM etc, and these realization technologies and approaches are provided.
A new approach to water quality modelling and environmental decision support systems
Authors: R. M. Argent, J. -M. Perraud, J. M. Rahman, R. B. Grayson, G. M. Podger
Venue: Environmental Modelling Software (2009)

The concepts and technology of environmental decision support systems (EDSS) have developed considerably over recent decades, although core concepts such as flexibility and adaptability within a changing decision environment remain paramount. Much recent EDSS theory has focussed on model integration and re-use in decision support system (DSS) tools and for design and construction of 'DSS generators'. Many current specific DSS have architectures, tools, models and operational characteristics that are either fixed or difficult to change in the face of changing management needs. This paper reports on development and deployment of an EDSS that encompasses a new approach to DSS tools, generators and specific DSS applications. The system, named E2, is built upon a conceptualisation of terrestrial and aquatic environmental systems that has resulted in a robust and flexible system architecture. The architecture provides a set of base classes to represent fundamental concepts, and which can be instantiated and combined to form DSS generators of varying complexity. A DSS generator is described within which system users are able to select and link models, data, analysis tools and reporting tools to create specific DSS for particular problems, and for which new models and tools can be created and, through software reflection (introspection), discovered to provide expanded capability where required. This system offers a new approach within which environmental systems can be described in the form of specific DSS at a scale and level of complexity suited to the problems and needs of decision makers.