ppxscal/embedding_network huggingface dataset:
A fuzzy multi-criteria decision making approach for solving a bi-objective personnel assignment problem
Authors: Deng Kui Huang, Huan Neng Chiu, Ruey Huei Yeh, Jen Huei Chang
Venue: Computers and Industrial Engineering (2009)

Effective personnel assignment is one of the most crucial tasks performed by the decision makers of a company. This paper proposes a systematic approach with a feedback mechanism in which the interdependences among positions and the differences among the selected employees are considered simultaneously. Unfortunately, the two combined considerations have rarely been discussed in the literature. The purpose of this approach is to obtain the best matching of candidates and positions in order to organize a collaboratively cross-functional team. In a fuzzy environment and, then, in the proposed approach, a bi-objective binary integer programming (BOBIP) model is formulated. Based on the weighted composite scores determined in the third step of the proposed procedure, the BOBIP model is transformed into a fuzzy bi-objective goal programming (FBOGP) model. An elaborately designed heuristic algorithm is developed to determine the appropriate values of several important parameters in the FBOGP model, which is solved using LINDO 8.0. An application example is illustrated, and two additional examples are tested. The results indicate that the proposed approach achieves the acceptable satisfaction level and requires less computation time than the brute force enumerative method.
Modelling Divergence in Relational Concurrent Refinement
Authors: Eerke Boiten, John Derrick
Venue: Proceedings of the 7th International Conference on Integrated Formal Methods (2009)

An integration of state-based and behavioural formalisms can be obtained by imposing a concurrency semantics on a relational formalism. The data refinement theory for relational languages then provides a method for verifying the concurrent refinement relation. In this paper we investigate how divergence can be modelled relationally, and in particular show how differing process algebraic interpretations of divergence can be embedded in a relational framework. In doing so we derive relational simulation conditions for process algebraic refinement incorporating divergence.
On the support size of stable strategies in random games
Authors: Spyros C. Kontogiannis, Paul G. Spirakis
Venue: Theoretical Computer Science (2009)

In this paper we study the support sizes of evolutionary stable strategies (ESS) in random evolutionary games. We prove that, when the elements of the payoff matrix behave either as uniform, or normally distributed random variables, almost all ESS have support sizes o(n), where n is the number of possible types for a player. Our arguments are based exclusively on a stability property that the payoff submatrix indicated by the support of an ESS must satisfy. We then combine this result with a recent result of McLennan and Berg [A. McLennan, J. Berg, The asymptotic expected number of nash equilibria of two player normal form games, Games and Economic Behavior 51 (2005) 264-295], concerning the expected number of Nash Equilibria in normal-random bimatrix games, to show that the expected number of ESS is significantly smaller than the expected number of symmetric Nash equilibria of the underlying symmetric bimatrix game.
Client-based cohesion metrics for Java programs
Authors: Sami Mäkelä, Ville Leppänen
Venue: Science of Computer Programming (2009)

One purpose of software metrics is to measure the quality of programs. The results can be for example used to predict maintenance costs or improve code quality. An emerging view is that if software metrics are going to be used to improve quality, they must help in finding code that should be refactored. Often refactoring or applying a design pattern is related to the role of the class to be refactored. In client-based metrics, a project gives the class a context. These metrics measure how a class is used by other classes in the context. We present a new client-based metric LCIC (Lack of Coherence in Clients), which analyses if the class being measured has a coherent set of roles in the program. Interfaces represent the roles of classes. If a class does not have a coherent set of roles, it should be refactored, or a new interface should be defined for the class. We have implemented a tool for measuring the metric LCIC for Java projects in the Eclipse environment. We calculated LCIC values for classes of several open source projects. We compare these results with results of other related metrics, and inspect the measured classes to find out what kind of refactorings are needed. We also analyse the relation of different design patterns and refactorings to our metric. Our experiments reveal the usefulness of client-based metrics to improve the quality of code.
A study of statistical techniques and performance measures for genetics-based machine learning: accuracy and interpretability
Authors: S. Garc&#x00ed;a, A. Fern&#x00e1;ndez, J. Luengo, F. Herrera
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2009)

The experimental analysis on the performance of a proposed method is a crucial and necessary task to carry out in a research. This paper is focused on the statistical analysis of the results in the field of genetics-based machine Learning. It presents a study involving a set of techniques which can be used for doing a rigorous comparison among algorithms, in terms of obtaining successful classification models. Two accuracy measures for multi-class problems have been employed: classification rate and Cohen&#x2019;s kappa. Furthermore, two interpretability measures have been employed: size of the rule set and number of antecedents. We have studied whether the samples of results obtained by genetics-based classifiers, using the performance measures cited above, check the necessary conditions for being analysed by means of parametrical tests. The results obtained state that the fulfillment of these conditions are problem-dependent and indefinite, which supports the use of non-parametric statistics in the experimental analysis. In addition, non-parametric tests can be satisfactorily employed for comparing generic classifiers over various data-sets considering any performance measure. According to these facts, we propose the use of the most powerful non-parametric statistical tests to carry out multiple comparisons. However, the statistical analysis conducted on interpretability must be carefully considered.
The assignment of computational tasks among processors in a distributed system
Authors: Camille C. Price
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

The flexibility afforded by multiprocessor systems opens the question of how to assign computer program modules among functionally similar processors in a distributed computer network. In the model under consideration, the modules of a program are to be assigned among processors in such a way as to minimize interprocessor communication while taking advantage of affinities of certain modules to particular processors. The problem is formalized as a zero-one quadratic programming problem, and a solution is sought through an iterative technique that performs a series of transformations on an assignment matrix. Convergence to a locally optimum assignment is guaranteed, and an easily testable condition is given for which this local optimum is also a global optimum. An illustration of this algorithm is provided, results of performance experiments are reported, and suggestions are made for further study.
A fuzzy constraint satisfaction approach for signal abstraction
Authors: A. Otero, P. Félix, S. Barro
Venue: International Journal of Approximate Reasoning (2009)

We present the Multivariable Fuzzy Temporal Profile model (MFTP), a formal model which allows us to represent signal patterns and identify their occurrences over the temporal evolution of a set of physical parameters. The pattern comprises a set of findings, each one of which may, in turn, be a pattern, so that its recognition is organized into a hierarchy of abstraction levels, and ultimately they are associated with the appearance of certain distinctive morphologies - profiles - over each parameter. The patterns definition is obtained directly from humans experts, either with the help of a formal language or with a visual tool developed for this purpose. The model is based, on the one hand, on Fuzzy Set Theory, which allows the vagueness and imprecision which are characteristic of human knowledge to be modelled; and on the other hand, on the formalism of Constraint Satisfaction Problems (CSP), in order to obtain a representation capable of explicitly capturing the hierarchy of abstraction levels into which the recognition task is organized. We supply algorithms for analyzing the consistency of the information defined by the MFTP, and for the recognition of patterns over signal recordings.
Approximation BFGS methods for nonlinear image restoration
Authors: Lin-Zhang Lu, Michael K. Ng, Fu-Rong Lin
Venue: Journal of Computational and Applied Mathematics (2009)

We consider the iterative solution of unconstrained minimization problems arising from nonlinear image restoration. Our approach is based on a novel generalized BFGS method for such large-scale image restoration minimization problems. The complexity per step of the method is of O(nlogn) operations and only O(n) memory allocations are required, where n is the number of image pixels. Based on the results given in [Carmine Di Fiore, Stefano Fanelli, Filomena Lepore, Paolo Zellini, Matrix algebras in quasi-Newton methods for unconstrained minimization, Numer. Math. 94 (2003) 479-500], we show that the method is globally convergent for our nonlinear image restoration problems. Experimental results are presented to illustrate the effectiveness of the proposed method.
System for capturing, streaming and sharing video files
Authors: David Malaník, Zdenek Drbálek, Tomáš Dulík, Miroslav Červenka
Venue: Proceedings of the 8th WSEAS international conference on Distance learning and web engineering (2008)

This paper describes a modular system, which provides capability for capturing videos and screen casts from lectures and presentations in any academic or commercial environment. The system uses client-server architecture. Client node sends streams from available multimedia devices to local area network. The server provides functions for capturing video from streams and for distributing the captured video files using torrent. For protecting the video files, the web-based user interface provides authentication and authorization similar to the traditional Unix file permissions system.
The implementation of clean production
Authors: Valeriu Lupu, Catalin Lupu, Nicolae Morariu
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

In this article we present: the implementation of "clean production" which means production based on careful evaluation of the product since its design phase to ensure that both the product and processes related to it at all stages of its life cycle (ranging the extraction of raw materials, manufacturing, packaging, consumer/ use, waste collection and treatment) promotes the interests of the community, in particular as regards the environment. Clean production has four main elements: - Caution, which involves taking measures insurers even in the case of yet unconfirmed suspicions concerning a potential nocivitate to human health or the environment; - Prevention, as expression of conscience that is cheaper and more efficient to prevent environmental degradation than to provide remedies; - Democratic participation in decision-making of all stakeholders - An integrated and holistic approach.
Active Contour Tracking of Moving Objects Using Edge Flows and Ant Colony Optimization in Video Sequences
Authors: Dong-Xian Lai, Yuan-Hsiang Chang, Zhi-He Zhong
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

Object segmentation and tracking are important techniques in video applications. In this paper, we present a novel system for active contour tracking of moving objects in video sequences. Our method includes preprocessing to identify an initial object contour, and object contour segmentation to refine the contour of the moving object. The edge flows and ant colony optimization are incorporated to improve the efficiency during system convergence. Experimental results demonstrated that our system has achieved the automatic segmentation accuracy of < 1 pixel on average as compared with manual segmentation results. In summary, our system is particularly useful in segmenting and tracking a moving object without constructing a background model for a video scene. Ultimately, our system could be used in object-based video coding or other analysis such as behavior analysis in video surveillance systems.
A Verification Framework for Normative Multi-Agent Systems
Authors: Lăcrămioara Aştefănoaei, Mehdi Dastani, John-Jules Meyer, Frank S. Boer
Venue: Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems (2008)

This paper presents a programming language that facilitates the implementation of coordination artifacts which in turn can be used to regulate the behaviour of individual agents. The programming language provides constructs inspired by social and organisational concepts. The operational semantics of the language is prototyped in Maude, a rewrite logic software. Properties of the coordination artifacts are model-checked with the Maude LTL model-checker.
Dynamic Optimization Of Systems Of Systems Using Value Measurement
Authors: Eric C. Honour, Tyson R. Browning
Venue: Journal of Integrated Design Process Science (2007)

Many systems of systems (SoS) occur today through the collaboration of multiple stakeholders, without any clear authority or direction at the SoS level. Examples include a supply chain, an airport, and the Internet. Because of the uncontrolled interactions, such a SoS exhibits complexity behaviors such as reflexivity, emergence, self-organization, and adaptation. This paper presents underlying theory to explain a methodology for dynamic optimization of SoS, in which the stakeholders make changes based on local perceptions of the value of the SoS. Each stakeholder has a different local perception of value, measured against an objective function that may be unique to the stakeholder. As the stakeholder compares perceived value to desired value, the stakeholder attempts to optimize the SoS from its own point of view by making decisions that lead to SoS changes. These changes then affect other stakeholders, resulting in a dynamic architecture and implementation of the SoS. We present the optimizing value proposition of each stakeholder in terms of a quantifiable objective function based on the life-cycle value of the SoS to that stakeholder, and we present the dynamic interaction as a model of self-organization. An example based on supply chain management demonstrates the approach.
A tangible construction kit for exploring graph theory
Authors: Eric Schweikardt, Nwanua Elumeze, Mike Eisenberg, Mark D Gross
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

Graphs are a versatile representation of many systems in computer science, the social sciences, and mathematics, but graph theory is not taught in schools. We present our work on Graphmaster, a computationally enhanced construction kit that enables children to build graphs of their own and investigate their properties by experimenting with algorithms that operate on them. The system is distributed; microcontrollers inside each node execute an interpreted language in parallel. Graphmaster, with its magnetic connectors, illuminated edges, and capacitive sensing, encourages children to develop intuitions about connectivity long before they are introduced to the notation and formulas of graph theory.
Integration of sensing and computing in an intelligent decision support system for homeland security defense
Authors: Qishi Wu, Mengxia Zhu, Nageswara S. V. Rao
Venue: Pervasive and Mobile Computing (2009)

We propose an intelligent decision support system based on sensor and computer networks that incorporates various component techniques for sensor deployment, data routing, distributed computing, and information fusion. The integrated system is deployed in a distributed environment composed of both wireless sensor networks for data collection and wired computer networks for data processing in support of homeland security defense. We present the system framework and formulate the analytical problems and develop approximate or exact solutions for the subtasks: (i) sensor deployment strategy based on a two-dimensional genetic algorithm to achieve maximum coverage with cost constraints; (ii) data routing scheme to achieve maximum signal strength with minimum path loss, high energy efficiency, and effective fault tolerance; (iii) network mapping method to assign computing modules to network nodes for high-performance distributed data processing; and (iv) binary decision fusion rule that derive threshold bounds to improve system hit rate and false alarm rate. These component solutions are implemented and evaluated through either experiments or simulations in various application scenarios. The extensive results demonstrate that these component solutions imbue the integrated system with the desirable and useful quality of intelligence in decision making.
Webpage understanding: beyond page-level search
Authors: Zaiqing Nie, Ji-Rong Wen, Wei-Ying Ma
Venue: ACM SIGMOD Record (2009)

In this paper we introduce the webpage understanding problem which consists of three subtasks: webpage segmentation, webpage structure labeling, and webpage text segmentation and labeling. The problem is motivated by the search applications we have been working on including Microsoft Academic Search, Windows Live Product Search and Renlifang Entity Relationship Search. We believe that integrated webpage understanding will be an important direction for future research in Web mining.
On Line - affective state reporting device: a tool for evaluating affective state inference systems
Authors: Susana Zoghbi, Dana Kuliff, Elizabeth Croft, Machiel Van der Loos
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

The monitoring of human affective state is a key part of developing responsive and naturally behaving human-robot interaction systems. However, evaluation and calibration of physiologically monitored affective state data is typically done using offline questionnaires and user reports. In this paper we investigate the use of an online-device for collecting real-time user reports of affective state during interaction with a robot. These reports are compared to both previous survey reports taken after the interaction, and the affective states estimated by an inference system. The aim is to evaluate and characterize the physiological signal-based inference system and determine which factors significantly influence its performance. This analysis will be used in future work, to fine tune the affective estimations by identifying what kind of variations in physiological signals precede or accompany the variations in reported affective states.
Improved algorithms for the k simple shortest paths and the replacement paths problems
Authors: Zvi Gotthilf, Moshe Lewenstein
Venue: Information Processing Letters (2009)

Given a directed, non-negatively weighted graph G=(V,E) and s,t@?V, we consider two problems. In the k simple shortest paths problem, we want to find the k simple paths from s to t with the k smallest weights. In the replacement paths problem, we want the shortest path from s to t that avoids e, for every edge e in the original shortest path from s to t. The best known algorithm for the k simple shortest paths problem has a running of O(k(mn+n^2logn)). For the replacement paths problem the best known result is the trivial one running in time O(mn+n^2logn). In this paper we present two simple algorithms for the replacement paths problem and the k simple shortest paths problem in weighted directed graphs (using a solution of the All Pairs Shortest Paths problem). The running time of our algorithm for the replacement paths problem is O(mn+n^2loglogn). For the k simple shortest paths we will perform O(k) iterations of the second simple shortest path (each in O(mn+n^2loglogn) running time) using a useful property of Roditty and Zwick [L. Roditty, U. Zwick, Replacement paths and k simple shortest paths in unweighted directed graphs, in: Proc. of International Conference on Automata, Languages and Programming (ICALP), 2005, pp. 249-260]. These running times immediately improve the best known results for both problems over sparse graphs. Moreover, we prove that both the replacement paths and the k simple shortest paths (for constant k) problems are not harder than APSP (All Pairs Shortest Paths) in weighted directed graphs.
Trans-European access to national case law: the Caselex project
Authors: Sebastiano Faro, Roberta Nannucci
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

Starting from the description of the reasons why the transnational access to case law is important especially in the context of European legal systems, some major information systems providing access to this type of data are presented. Then, Caselex (Case Law Exchange), a project financed by the EU Commission aiming at deploying a service equipped with a variety of semantic tools facilitating the transnational and multilingual access to national case law, is highlighted. It has been developed by a strong public-private partnership and has as major targets legal professional categories as well as citizens.
Clustering of document collection - A weighting approach
Authors: Ramiz M. Aliguliyev
Venue: Expert Systems with Applications: An International Journal (2009)

Clustering algorithms are used to assess the interaction among documents by organizing documents into clusters such that document within a cluster are more similar to each other than are documents belonging to different clusters. Document clustering has been traditionally investigated as a means of improving the performance of search engines by pre-clustering the entire corpus, and a post-retrieval document browsing technique as well. It has long been studied as a post-retrieval document visualization technique. The purpose of present paper to show that assignment weight to documents improves clustering solution.
A Layout Sensitivity Model for Estimating Electromigration-vulnerable Narrow Interconnects
Authors: Rani S. Ghaida, Payman Zarkesh-Ha
Venue: Journal of Electronic Testing: Theory and Applications (2009)

During back-end manufacturing process of IC, intervention of spot defects induces extra and missing material of interconnects causing circuit failures. Interconnect narrowing occurs when spot defects induce interconnects missing material without resulting in a complete cut. The narrow sites of defective interconnects favor electromigration that makes narrow interconnects more likely to induce a chip failure than regular interconnects. In this paper, an innovative layout sensitivity model accounting for "narrow" defects is derived. The paper also pioneers estimation of the probability of narrow interconnects in the die. The layout sensitivity model for narrow interconnects is tested and compared to actual and simulated data. Our layout sensitivity model predicts the probability of narrowing with 3.1% error, on average. The model is then combined with electromigration constraints to predict mean-time-to-failure of chips manufactured in future technologies down to 32 nm node. The paper concludes with some other possible applications of the narrow interconnect predictive model.