ppxscal/embedding_network huggingface dataset:
Cluster sampling and its applications to segmentation, stereo and motion
Authors: Song-Chun Zhu
Venue:  (2005)

Many computer vision problems can be formulated as graph partition problems that minimize energy functions. Generally applicable algorithms like the Gibbs sampler can perform the minimization task, but they are very slow to converge, especially since the graphs in vision tasks are large (105&ndash;10 6 nodes). On the other hand, computationally effective algorithms like Graph Cuts and Belief Propagation are specialized to particular forms of energy functions, and they cannot be applied for complex statistical models using generative models and high-order priors. In this thesis, a new stochastic algorithm capable of sampling arbitrary energy functions defined on graph partitions is presented. To increase efficiency, the algorithm uses the image information to make informed jumps in the search space. The image information is given in the form of edge weights and represents an empirical probability that the nodes connected by the edge belong to the same object. At each step, the algorithm creates clusters of nodes by turning on/off the edges randomly according to their weights, and changes the label of all nodes in one cluster (connected component) in a single move. Each move is accepted or rejected according to an acceptance probability given by a simple and explicit equation. The algorithm is applied to 4 important problems in computer vision: image segmentation, perceptual organization, stereo matching and motion segmentation. To address different computational or representational issues, multi-grid, multi-level and multi-cue variants of the algorithm are presented. In image segmentation, the algorithm's performance is compared to the Gibbs sampler, while in stereo matching, it is compared to Graph Cuts and Belief Propagation.
Modelling by finite element of the part-tool flexible technological system deformations at superfinishing process
Authors: Constantin Buzatu, Adriana Fota, Badea Lepadatescu, Simona Duicu
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

In the case of final machining of workpieces by superfinishing, the macrogeometric accuracy is influenced by the elastic deformations of the technological system part-tool. The paper presents the possibility of modelling of the elastic deformations by finite element assisted by computer, to optimize the constructive design of the tool system to minimize the influence of the elastic deformations on the machining accuracy.
Single Channel Polyphonic Music Transcription
Authors: Angelo Ciaramella
Venue: Proceeding of the 2009 conference on New Directions in Neural Networks: 18th Italian Workshop on Neural Networks: WIRN 2008 (2009)

This work aims to propose a novel model to perform automatic music transcription of polyphonic audio sounds. The notes of different musical instruments are extracted from a single channel recording by using a non-linear Principal Component Analysis Neural Network. The estimated components (waveforms) are classified by using a dictionary (i.e. database). The dictionary contains the features of the notes for several musical instruments (i.e. probability densities). A Kullback-Leibler divergence is used to recognize the extract waveforms as belonging to one instrument in the database. Moreover, considering the weights of the Neural Network a MUSIC frequency estimator is used to obtain the frequencies of the musical notes. Several results are proposed to show the performance of this technique for the transcription of mixtures of different musical instruments, real songs and recordings obtained in a real environment.
Managing publications and bookmarks with BibSonomy
Authors: Dominik Benz, Folke Eisterlehner, Andreas Hotho, Robert Jäschke, Beate Krause, Gerd Stumme
Venue: Proceedings of the 20th ACM conference on Hypertext and hypermedia (2009)

In this demo we present BibSonomy, a social bookmark and publication sharing system.
Automatic instantiation of abstract tests on specific configurations for large critical control systems
Authors: Francesco Flammini, Nicola Mazzocca, Antonio Orazzo
Venue: Software Testing, Verification Reliability (2009)

Computer-based control systems have grown in size, complexity, distribution and criticality. In this paper a methodology is presented to perform an &lsquo;abstract testing&rsquo; of such large control systems in an efficient way: an abstract test is specified directly from system functional requirements and has to be instantiated in more test runs to cover a specific configuration, comprising any number of control entities (sensors, actuators and logic processes). Such a process is usually performed by hand for each installation of the control system, requiring a considerable time effort and being an error-prone verification activity. To automate a safe passage from abstract tests, related to the so-called generic software application, to any specific installation, an algorithm is provided, starting from a reference architecture and a state-based behavioural model of the control software. The presented approach has been applied to a railway interlocking system, demonstrating its feasibility and effectiveness in several years of testing experience. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Minimal split completions
Authors: Pinar Heggernes, Federico Mancini
Venue: Discrete Applied Mathematics (2009)

We study the problem of adding an inclusion minimal set of edges to a given arbitrary graph so that the resulting graph is a split graph, called a minimal split completion of the input graph. Minimal completions of arbitrary graphs into chordal and interval graphs have been studied previously, and new results have been added recently. We extend these previous results to split graphs by giving a linear-time algorithm for computing minimal split completions. We also give two characterizations of minimal split completions, which lead to a linear time algorithm for extracting a minimal split completion from any given split completion. We prove new properties of split graph that are both useful for our algorithms and interesting on their own. First, we present a new way of partitioning the vertices of a split graph uniquely into three subsets. Second, we prove that split graphs have the following property: given two split graphs on the same vertex set where one is a subgraph of the other, there is a sequence of edges that can be removed from the larger to obtain the smaller such that after each edge removal the modified graph is split.
Development and Analysis of a Problem Domain Knowledge Base Oriented to PLA Specifications
Authors: Henrikas Pranevicius, Germanas Budnikas
Venue: Proceeding of the 2006 conference on Knowledge-Based Software Engineering: Proceedings of the Seventh Joint Conference on Knowledge-Based Software Engineering (2006)

The paper presents a technique that applies knowledge engineering techniques for development and analysis of PLA specifications. Problem domain knowledge base (KB) is created using the knowledge acquisition technique joined with a piece-linear aggregate (PLA) model. The production rules of the KB are represented by decision tables, and static properties of the KB are checked in Prologa system. Further, the KB is combined with the defined KB of validated properties and validation method, and KB dynamic properties are checked in the expert system in CLIPS. Analysed KB is used defining a framework of PLA specification using Praxis editor and supplementing Praxis generated framework with the application functional description. The technique is illustrated with an example of a hard disk drive cache.
Economic Models with Chaotic Money Exchange
Authors: Carmen Pellicer-Lostao, Ricardo López-Ruiz
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

This paper presents a novel study on gas-like models for economic systems. The interacting agents and the amount of exchanged money at each trade are selected with different levels of randomness, from a purely random way to a more chaotic one. Depending on the interaction rules, these statistical models can present different asymptotic distributions of money in a community of individuals with a closed economy.
Sub-Carrier and Band Hopped Orthogonal Frequency Division Multiple Access (OFDMA) Systems
Authors: Muhammad Imadur Rahman, Ragnar Reynisson, Daniel Figueiredo, Ramjee Prasad
Venue: Wireless Personal Communications: An International Journal (2009)

This article proposes a novel way of grouping users in an orthogonal frequency division multiplexing (OFDM) communication link based on predefined criteria. The total available spectrum is divided into a number of bands equal to the number of groups. For efficient time-frequency resource allocation, sub-carrier and band hopping are used simultaneously. Under some constraints, sub-carriers can also be assigned to different users based on known channel characteristics using dynamic sub-carrier allocation. Sub-carrier and band hopping are used for mitigating the frequency selectivity of the wireless channel and for minimizing and avoiding interference in the system. The proposed scheme is equally applicable to both downlink and uplink.
Studying the impact of ERP on collaborative decision making --a case study
Authors: Fergal Carton, Frederic Adam
Venue: Proceeding of the 2008 conference on Collaborative Decision Making: Perspectives and Challenges (2008)

ERP applications have been proposed as solution to many current operational problems. For instance, ERP support decision makers by making key data visible in a timely fashion. The price of this visibility is extensive standardisation of business processes. Multinationals in particular need to impose a common way of working throughout their different sites in order to better control performance. ERP systems provide a common language, using a shared data store and integrated business processes. At the same time, organisations are subject to constant evolution, where shareholder expectations, customer demands or organic growth may result in standard processes no longer “fitting” with reality. This paper reports on a mature ERP implementation, focusing on an element of operational decision making that is becoming increasingly collaborative: sales order fulfilment. Growing complexity in the products on offer have resulted in a fragmented supply chain, including the use of “cross docks” to combine third party products with in-house elements on the same sales order. Commit date decisions for customer shipments, increasingly involve a high degree of collaboration between managers from the different plants. The study indicates that collaborative processes supported by highly integrated information systems do not always lead to more collaborative behaviour because the loss of flexibility imposed by the standardised processes constrains what organisational actors can or cannot do.
FlexRecs: expressing and combining flexible recommendations
Authors: Georgia Koutrika, Benjamin Bercovitz, Hector Garcia-Molina
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

Recommendation systems have become very popular but most recommendation methods are `hard-wired' into the system making experimentation with and implementation of new recommendation paradigms cumbersome. In this paper, we propose FlexRecs, a framework that decouples the definition of a recommendation process from its execution and supports flexible recommendations over structured data. In FlexRecs, a recommendation approach can be defined declaratively as a high-level parameterized workflow comprising traditional relational operators and new operators that generate or combine recommendations. We describe a prototype flexible recommendation engine that realizes the proposed framework and we present example workflows and experimental results that show its potential for capturing multiple, existing or novel, recommendations easily and having a flexible recommendation system that combines extensibility with reasonable performance.
Storage desk: a virtual storage system with quality of service guarantees
Authors: Andrew S. Grimshaw
Venue:  (2008)

The demand for storage continues its inexorable increase, driven by advances in applications and sensors that generate ever more data. In this dissertation, I present Storage@desk, a virtual storage system that can aggregate a large number of distributed machines to provide storage services with quality of service guarantees. I will describe the Storage@desk architecture and core components. Because storage virtualization is the prominent goal, Storage@desk provides clients with the abstraction of a hard drive by utilizing the internet SCSI (iSCSI) protocol. In Storage@desk, individual users have their own individual needs for service, since they may demand different levels of quality of service (QoS) in terms of availability, reliability, capacity, performance, security, etc. Each QoS property imposes various constraints and performance trade-offs. I have utilized a market-based resource allocation model, in which pricing agents help resource providers adjust the prices as demand fluctuates. With derivative-following pricing, an agent requires no knowledge of competitors or consumers, which reduces communication overheads and avoids bottlenecks in the system. The simulation shows that, using this model, the system allows the consumers to achieve QoS goals under sufficient budgets and degrade in accordance with relative budget amounts. As Storage@desk serves clients and applications using shared storage resources, it is crucial to ensure predictable storage access even when the workloads are unknown a priori. To this end, I have taken a control-theoretic approach for automated performance control in Storage@desk. Given a reference value, the feedback controller is able to regulate service requests to virtual storage resources under various scenarios. Moreover, the controller can dynamically allocate the available bandwidth among the competing clients with regards to their changing reference values. I have developed a prototype of Storage@desk that implements all the core components. I have evaluated Storage@desk in two ways, benchmarks on the prototype and simulations with real-world trace data. Specifically, I used the benchmarks to measure read and write bandwidth, throughput, encryption overhead, and controller performance, and the simulations to demonstrate the feasibility of the system and the effectiveness of the market model.
Providing standard-oriented data models and interfaces to eGovernment services
Authors: Luis M. Álvarez Sabucedo, Luis E. Anido Rifón, Rubén Míguez Pérez, Juan M. Santos Gago
Venue: Computer Standards Interfaces (2009)

As eGovernment becomes a very active research area, a lot of solutions to solve citizens' needs are being deployed. These solutions, even of a high quality, suffer from some drawbacks. Most of them related to the lack of interoperability among different Public Administrations or the difficulties to locate or invoke the desired service. To deal with these issues, a semantic-based approach centered in citizens is proposed. This paper tackles the provision of a front-end solution to access services in Public Administrations. A complete software interface within a holistic model of service is deeply discussed.
Agent Based Computational Model of Trust
Authors: Alexander Gorobets, Bart Nooteboom
Venue: Proceeding of the 2005 conference on Self-Organization and Autonomic Informatics (I) (2005)

This paper employs the methodology of Agent-Based Computational Economics (ACE) to investigate under what conditions trust can be viable in markets. The emergence and breakdown of trust is modeled in a context of multiple buyers and suppliers. Agents adapt their trust in a partner, the weight they attach to trust relative to profitability, and their own trustworthiness, modeled as a threshold of defection. Adaptation occurs on the basis of realized profit. Trust turns out to be viable under fairly general conditions.
Combinatorial interpretation and positivity of Kerov's character polynomials
Authors: Valentin Féray
Venue: Journal of Algebraic Combinatorics: An International Journal (2009)

Kerov's polynomials give irreducible character values in terms of the free cumulants of the associated Young diagram. We prove in this article a positivity result on their coefficients, which extends a conjecture of S. Kerov. Our method, through decomposition of maps, gives a description of the coefficients of the k-th Kerov's polynomial using permutations in S(k). We also obtain explicit formulas or combinatorial interpretations for some coefficients. In particular, we are able to compute the subdominant term for character values on any fixed permutation (it was known for cycles).
Level Set Segmentation of Knee Bones Using Normal Profile Models
Authors: Gaetano Impoco
Venue: Proceedings of the 4th International Conference on Computer Vision/Computer Graphics CollaborationTechniques (2009)

We address the problem of segmenting bone structures from CT scans of the knee joint, in the level set framework. Our method is based on intensity profiles along the normals to the evolving contour. The evolution is guided by the similarity of image intensity profiles to profile models. The evolution stops when the intensity profiles closely match the model. The profile models are built using a manually labelled training sample.
Guaranteed cost control of switched systems with neutral delay via dynamic output feedback
Authors: Ligang Wu, Zidong Wang
Venue: International Journal of Systems Science (2009)

This article is concerned with the problem of cost-guaranteed dynamic output feedback (DOF) control for a class of continuous-time linear switched system with both discrete and neutral delays. By using the average dwell time approach and the piecewise Lyapunov function technique, a sufficient condition is first proposed, in terms of a set of linear matrix inequalities (LMIs), to guarantee the exponential stability and a certain bound for the cost function of the closed-loop system, where the decay estimate is explicitly given to quantify the convergence rate. Then, the corresponding solvability conditions for a desired DOF controller under guaranteed cost are established by using the approach of linearising variable transforms. Since these obtained conditions are not all expressed by strict LMIs, the cone complementary linearisation method is exploited to cast them into sequential minimisation problems subject to LMI constraints, which can be easily solved numerically. Finally, a numerical example is provided to illustrate the effectiveness of the proposed theory.
Empirical Evaluation of Scoring Methods
Authors: Luca Pulina
Venue: Proceeding of the 2006 conference on STAIRS 2006: Proceedings of the Third Starting AI Researchers' Symposium (2006)

The automated reasoning research community has grown accustomed to competitive events where a pool of systems is run on a pool of problem instances with the purpose of ranking the systems according to their performances. At the heart of such ranking lies the method used to score the systems, i.e., the procedure used to compute a numerical quantity that should summarize the performances of a system with respect to the other systems and to the pool of problem instances. In this paper we evaluate several scoring methods, including methods used in automated reasoning contests, as well as methods based on voting theory, and a new method that we introduce. Our research aims to establish which of the above methods maximizes the effectiveness measures that we devised to quantify desirable properties of the scoring procedures. Our method is empirical, in that we compare the scoring methods by computing the effectiveness measures using the data from the 2005 comparative evaluation of solvers for quantified Boolean formulas. The results of our experiments give useful indications about the relative strengths and weaknesses of the scoring methods, and allow us to infer also some conclusions that are independent of the specific method adopted.
Resistive non-volatile memory devices (Invited Paper)
Authors: Rainer Waser
Venue: Microelectronic Engineering (2009)

The review provides a survey of non-volatile, highly scalable memory devices which are based on redox phenomena controlling the resistance of nanoscale memory cells. The classification of the memory effects, the understanding of the underlying mechanisms, and a sketch of the integration efforts will be presented.
Extracting Relations towards Ontology Extension
Authors: Jin-Guk Jung, Kyeong-Jin Oh, Geun-Sik Jo
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

Extracting local ontology from domain-specific documents for the purpose of acquiring knowledge or semantic information to extend their ontologies is considered very important. Main components of ontology are concepts and relations between concepts. In this paper, we focus on extracting triples, in which verbs are relations and subjects/objects are concepts, from documents based on natural language. Further, we show that term frequency is the most reliable measure among tf-idf and entropy on evaluating relations extracted from documents, particularly the aircraft maintenance manual.
Effects of Anisotropy and Transmural Heterogeneity on the T-Wave Polarity of Simulated Electrograms
Authors: Piero Colli Franzone, Luca F. Pavarino, Simone Scacchi, Bruno Taccardi
Venue: Proceedings of the 5th International Conference on Functional Imaging and Modeling of the Heart (2009)

The major determinants of the T wave polarity in electrocardiograms (ECGs) are still a debated issue. The aim of this work is to investigate the effects of tissue anisotropy, cellular action potential duration (APD) heterogeneities and excitation wavefront shape on the T wave polarity in unipolar and bipolar ECGs, simulated in a conducting medium surrounding the cardiac tissue at some distance fom endo to epicardium. The study is based on three-dimensional anisotropic Monodomain simulations of the entire depolarization and repolarization phases of propagating action potentials in a parallelepipedal slab. The results show that the T wave of unipolar ECGs is positive at all sites explored and its shape and polarity are mainly determined by the anisotropy of the cardiac tissue, irrespective of cellular APD heterogeneities and shape of the excitation wavefront. On the other hand, bipolar ECGs are mainly affected by their isotropic component and their T wave turns out to be positive for single site stimulations in the presence of transmural APD heterogeneity, while it becomes always negative in case of multiple sites stimulation generating large activation wavefronts, regardless of the considered cellular APD heterogeneities.
Performance testing of wireless intelligent sensor and actuator network (WISAN) on a pre-stressed concrete bridge
Authors: M. F. M. Zain, V. Krishnamurthy, E. Sazonov, M. Jamil, I. M. Taib
Venue: Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems (2008)

With advances in sensor technology and availability of low cost integrated circuits, a wireless monitoring sensor network has been considered to be the new generation technology for structural health monitoring. Wireless Intelligent Sensor and Actuator Network (WISAN) has hence been developed as a vibration based structural monitoring network that allows extraction of mode shapes from output-only vibration data from a structure. The mode shape information can further be used in modal methods of damage detection. This network has been tested on a pre-stressed concrete bridge in Kuala Lumpur, Malaysia. The results have been compared with a similar sized steel girder bridge.