ppxscal/embedding_network huggingface dataset:
A memetic algorithm for the optimal winner determination problem
Authors: Dalila Boughaci, Bela&#x00ef;d Benhamou, Habiba Drias
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2009)

In this paper, we propose a memetic algorithm for the optimal winner determination problem in combinatorial auctions. First, we investigate a new selection strategy based on both fitness and diversity to choose individuals to participate in the reproduction phase of the memetic algorithm. The resulting algorithm is enhanced by using a stochastic local search (SLS) component combined with a specific crossover operator. This operator is used to identify promising search regions while the stochastic local search performs an intensified search of solutions around these regions. Experiments on various realistic instances of the considered problem are performed to show and compare the effectiveness of our approach.
Discussion on the general oscillation startup condition and the Barkhausen criterion
Authors: Fan He, Raymond Ribas, Cyril Lahuec, Michel Jézéquel
Venue: Analog Integrated Circuits and Signal Processing (2009)

The Barkhausen criterion has been widely used to determine the oscillation startup condition. However, we propose it is only partially correct. The general oscillation condition and the relation between the general oscillation condition and the Barkhausen criterion are reviewed in this paper. The oscillation frequency related to the general oscillation startup condition is also presented.
Integrated specification and quality assurance for large business information systems
Authors: Frank Salger, Stefan Sauer, Gregor Engels
Venue: Proceedings of the 2nd India software engineering conference (2009)

We present the "specification framework" of Capgemini sd&m. It consists of our specification method which serves as the constructive basis for creating complex software specifications, and its concerted analytical counterpart, the "specification quality gate". Since this framework is tailored to the specification of large business information systems (BIS), it allows a quick ramp-up phase for software engineering projects without the need for extensive tailoring or extension.
Discontinuous Galerkin least-squares finite element methods for singularly perturbed reaction-diffusion problems with discontinuous coefficients and boundary singularities
Authors: Runchang Lin
Venue: Numerische Mathematik (2009)

In this paper, a discontinuous Galerkin least-squares finite element method is developed for singularly perturbed reaction-diffusion problems with discontinuous coefficients and boundary singularities by recasting the second-order elliptic equations as a system of first-order equations. In a companion paper (Lin in SIAM J Numer Anal 47:89&#x2013;108, 2008) a similar method has been developed for problems with continuous data and shown to be well-posed, uniformly convergent, and optimal in convergence rate. In this paper the method is modified to take care of conditions that arise at interfaces and boundary singularities. Coercivity and uniform error estimates for the finite element approximation are established in an appropriately scaled norm. Numerical examples confirm the theoretical results.
Frequency domain discrete fourier transform spread generalized multi-carrier system and its performance analysis
Authors: Yun Rui, Honglin Hu, Huiyue Yi, Hsiao-Hwa Chen, Yueh-Min Huang
Venue: Computer Communications (2009)

Discrete fourier transform spread generalized multi-carrier (DFT-S-GMC) scheme is a promising candidate for the uplink transmission of the new generation broadband mobile communications due to its lower peak-to-average power ratio and its robustness to the multi-user interference if compared with the conventional orthogonal frequency division multiple (OFDM)-based transmission schemes. However, the time domain DFT-S-GMC system has a relatively high implementation complexity and is difficult to analyze its signal-to-interference plus noise ratio (SINR). In addition, the existing link-to-system mapping methods for OFDM-based systems cannot be utilized in the DFT-S-GMC systems. In this paper, we first propose a novel frequency domain transceiver model for the DFT-S-GMC system, which can effectively simplify the SINR analysis. Then, we derive the closed-form SINR expressions for the link-to-system mapping of DFT-S-GMC system with Alamouti-like space-time block-coding (STBC). It is demonstrated that the theoretical SINR expressions match the simulation results very well.
Temporal similarity measures for querying clinical workflows
Authors: Carlo Combi, Matteo Gozzi, Barbara Oliboni, Jose M. Juarez, Roque Marin
Venue: Artificial Intelligence in Medicine (2009)

Objective: In this paper, we extend a preliminary proposal and discuss in a deeper and more formal way an approach to evaluate temporal similarity between clinical workflow cases (i.e., executions of clinical processes). More precisely, we focus on (i) the representation of clinical processes by using a temporal conceptual workflow model; (ii) the definition of ad hoc temporal constraint networks to formally represent clinical workflow cases; (iii) the definition of temporal similarity for clinical workflow cases based on the comparison of temporal constraint networks; (iv) the management of the similarity of clinical processes related to the Italian guideline for stroke prevention and management (SPREAD). Background: Clinical processes are composed by clinical activities to be done by given actors in a given order satisfying given temporal constraints. This description means that clinical processes can be seen as organizational processes, and modeled by workflow schemata. When a workflow schema represents a clinical process, its cases represent different instances derived from dealing with different patients in different situations. With respect to all the cases related to a workflow schema, each clinical case can be different with respect to its structure and to its temporal aspects. Clinical cases can be stored in clinical databases and information retrieval can be done evaluating the similarity between workflow cases. Methodology: We first describe a possible approach to the conceptual modeling of a clinical process, by using a temporally extended workflow model. Then, we define how a workflow case can be represented as a set of activities, and show how to express them through temporal constraint networks. Once we have built temporal constraint networks related to the cases to compare, we propose a similarity function able to evaluate the differences between the considered cases with respect to the order and duration of corresponding activities, and with respect to the presence/absence of some activities. Results: In this work, we propose an approach to evaluate temporal similarity between workflow cases. The proposed approach can be used (i) to query clinical databases storing clinical cases representing activities related to the management of different patients in different situations; (ii) to evaluate the quality of the service comparing the similarity between a (possibly synthetic) case, perceived as the good one with respect to a given clinical situation, and the other clinical cases; and (iii) to retrieve a particular class of cases similar to an interesting one.
Instructional animations can be superior to statics when learning human motor skills
Authors: Anna Wong, Nadine Marcus, Paul Ayres, Lee Smith, Graham A. Cooper, Fred Paas, John Sweller
Venue: Computers in Human Behavior (2009)

Based on the assumption of a working memory processor devoted to human movement, cognitive load theory is used to explore some conditions under which animated instructions are hypothesised to be more effective for learning than equivalent static graphics. Using paper-folding tasks dealing with human movement, results from three experiments confirmed our hypothesis, indicating a superiority of animation over static graphics. These results are discussed in terms of a working memory processor that may be facilitated by our mirror-neuron system and may explain why animated instructional animations are superior to static graphics for cognitively based tasks that involve human movement.
Organization of the TRAC processor-memory subsystem
Authors: R. N. Kapur, U. V. Premkumar, G. J. Lipovski
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

TRAC integrates a sufficient number of architecturally unique features to justify the development of microprogrammed processor and memory modules. This paper contains a discussion of the issues considered in the design and implementation of these modules.
Trailblazer: enabling blind users to blaze trails through the web
Authors: Jeffrey P. Bigham, Tessa Lau, Jeffrey Nichols
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

For blind web users, completing tasks on the web can be frustrating. Each step can require a time-consuming linear search of the current web page to find the needed interactive element or piece of information. Existing interactive help systems and the playback components of some programming-by-demonstration tools identify the needed elements of a page as they guide the user through predefined tasks, obviating the need for a linear search on each step. We introduce TrailBlazer, a system that provides an accessible, non-visual interface to guide blind users through existing how-to knowledge. A formative study indicated that participants saw the value of TrailBlazer but wanted to use it for tasks and web sites for which no existing script was available. To address this, TrailBlazer offers suggestion-based help created on-the-fly from a short, user-provided task description and an existing repository of how-to knowledge. In an evaluation on 15 tasks, the correct prediction was contained within the top 5 suggestions 75.9% of the time.
New Lanchester Theory for Requirements Prioritization
Authors: Thomas M. Fehlmann
Venue: Proceedings of the 2008 Second International Workshop on Software Product Management (2008)

New Lanchester theory links Business Objectives to market share using a quantitative model. It can be effectively used for deciding which new features to add to software products for winning a business. This paper introduces the New Lanchester Theory and explains its use for effectively prioritizing requirements. It explains the theory for requirement experts and shows how the New Lanchester Theory relates to Quality Function Deployment, the Six Sigma way of managing requirements. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Locally scheduled packet bursting for data collection in wireless sensor networks
Authors: Ren-Shiou Liu, Kai-Wei Fan, Prasun Sinha
Venue: Ad Hoc Networks (2009)

In wireless sensor networks, the many-to-one data communication pattern induces high collision losses as multiple transmissions cause contention and interference along the paths from sources to the sink. This paper proposes a low-overhead MAC layer solution to address the high contention problem to improve system throughput and reduce energy consumption. Periods of burst transmissions with reduced contention from neighboring nodes are exploited to efficiently clear up backlogged queues and improve the performance of CSMA. Through analytical modeling we characterize the expected performance improvement. Using extensive simulations on ns-2 and experiments on the 49-node sensor network testbed (Kansei) running TinyOS, we show that the proposed scheme can increase the throughput by up to a factor of four.
MILP approach to pattern generation in logical analysis of data
Authors: Hong Seo Ryoo, In-Yong Jang
Venue: Discrete Applied Mathematics (2009)

Pattern generation methods for the Logical Analysis of Data (LAD) have been term-enumerative in nature. In this paper, we present a Mixed 0-1 Integer and Linear Programming (MILP) approach that can identify LAD patterns that are optimal with respect to various previously studied and new pattern selection preferences. Via art of formulation, the MILP-based method can generate optimal patterns that also satisfy user-specified requirements on prevalence, homogeneity and complexity. Considering that MILP problems with hundreds of 0-1 variables are easily solved nowadays, the proposed method presents an efficient way of generating useful patterns for LAD. With extensive experiments on benchmark datasets, we demonstrate the utility of the MILP-based pattern generation.
Resolving ambiguity of scope in remote collaboration: a study in film scoring
Authors: Julien Phalip, David Jean, Ernest Edmonds
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

In this paper we report on a qualitative study aiming to support online and asynchronous collaboration between stakeholders of the film scoring industry. We first describe the low-fidelity prototype we designed to facilitate the establishment of a clear scope for creative discussions. We then present evaluations conducted with two composers and a filmmaker to test the prototype's design principles. Outcomes from these evaluations stressed the need for resolving the ambiguity that occurs in remote collaboration. Feedback from participants also depicted the complex nature of the composer-filmmaker relationship and confirmed the virtues of asynchronous means of communication to support that relationship.
A Novel Two-port Model for Interconnect Lines Driving Arbitrary Loads
Authors: Ruinan Chang, Wenjun Zhang
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

This paper presents an order-reduced model for the analysis of interconnects driving an arbitrary load. It is shown that this model can be used to approximate the two-port admittance matrix of a transmission line to arbitrary accuracy, bearing explicit physical senses. It is based on series expansion, and can generate a lumped passive circuit model, but is different from moment-matching, yielding a passive and thus stable circuit model. Comparison with other models shows the effectiveness and precision of the proposed model over a wide frequency range.
Artificial Neural Networks: Methods and Applications (Methods in Molecular Biology), 1 edition
Authors: David J. Livingstone
Venue:  (2008)

As an extension of artificial intelligence research, artificial neural networks (ANN) aim to simulate intelligent behavior by mimicking the way that biological neural networks function. In Artificial Neural Networks, an international panel of experts report the history of the application of ANN to chemical and biological problems, provide a guide to network architectures, training and the extraction of rules from trained networks, and cover many cutting-edge examples of the application of ANN to chemistry and biology. In the tradition of the highly successful Methods in Molecular Biology series, this volume exhibits clear, easy-to-use information with many step-by-step laboratory protocols. Comprehensive and state-of-the-art, Artificial Neural Networks is an excellent guide to this accelerating technological field of study.
Replicator Dynamics with Dynamic Payoff Reallocation Based on the Government's Payoff
Authors: Takafumi Kanazawa, Hayato Goto, Toshimitsu Ushio
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In a population which consists of a large number of players interacting with each other, the payoff of each player often conflicts with the total payoff of the population which he/she belongs to. In such a situation, a “government” which has the comprehensive perspective is needed to govern the population. Recently, to discuss the population with the government, the authors have proposed replicator dynamics with reallocation of payoffs to analyze an effect of the government. In this model, the government is willing to lead the population to a desirable target state by collecting a part of players' payoffs and reallocating them depending on the target state. The government's action is the rate of collecting payoffs from players and the rate is assumed to be constant and independent of the population state. Thus, in this paper, we suppose that the government change their intervention strategy depending on the current population state. We consider the government as a game player and define the government's payoff as a sum of a benefit and a cost of intervention. We propose a model which describes the evolution of the government's reallocation strategy and investigate stability of its equilibrium points.
On the Identifiability of Link Service Curves from End-Host Measurements
Authors: Amr Rizk, Markus Fidler
Venue: Network Control and Optimization: Second Euro-NF Workshop, NET-COOP 2008 Paris, France, September 8-10, 2008. Revised Selected Papers (2009)

We estimate service curves of network internal links from end-host measurements of probing traffic. Our approach belongs to the field of network tomography, which deals with the fundamental challenge of identifiability in a priori under-determined network equation systems. As opposed to recent methods that estimate sole quantities, such as delay and bandwidth, we characterize links using the more generic concept of service curve that comprises various derived quantities including the ones mentioned above. Key to our solution is the Legendre-Fenchel transform that achieves additivity of link service curves. Our measurement results reveal that the burstiness of cross traffic flows, which has significant impact on the shape of leftover service curves, can be attributed to individual links. Using the network calculus we show fundamental limits of certain tomography approaches regarding the identification of propagation delays as well as regarding the resolution of post-narrow links.
True color image steganography using palette and minimum spanning tree
Authors: Yung-Fu Chen, Show-Wei Chien, Hsuan-Hung Lin
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

Steganography is an application of data hiding which can attain camouflage and increase security by embedding the secret message into digital media for sending to the receiver without leaking to the third party. Several proposed methods which construct stegoimage by embedding the secret message into the color palette. The person who receives the stegoimage can extract the secret message from the palette obtained by the received image. This method, however, greatly degrades the quality of the stegoimage and tends to arouse the intention of the intruders. In this paper, we propose a method for constructing stegoimages with high quality which greatly eliminate the above problem. The advantage of the proposed method is that the image quality is highly improved by accompanying with improvement of security and camouflage of the secret message. In order to avoid the intruder to attack the generated palette when transmission, the sender does not need to send the palette to the receiver directly, but instead asking the receiver to own a copy of the original secret image or obtain one when needed for extracting the secret message. Fortunately, there are several image pools which contain a lot of images allowing to be accessed by the public. The experimental results show that our method outperforms EZ stego and the methods proposed by Fridrich and Wu et al.
A Hybrid Face Recognition Method Based on Structural and Holistic Features
Authors: Suvendu Mandal, Bibhas Chandra Dhara
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

In this paper we have proposed a novel face recognition method. This method is a hybrid of holistic and structural approaches. First, we locate the position of the nose tip and then we divide the image into eight octants with nose tip as the center. The petal projection method is employed on each octant to obtain a radial intensity profile. Then these radial intensity profiles are transformed by DCT for more compact and scale free representation. The transformed coefficient vectors are used to compute the similarity between the images. The proposed method is simple to implement and is efficient. The performance of the proposed method is evaluated on ORL database, and this offers a good trade-off between the recognition rate and the complexity of the method.
Integrating Image Matching and Classification for Multimedia Retrieval on the Web
Authors: Kyoji Hirata, Sougata Mukherjea, Wen-Syan Li, Yoshinori Hara
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

With the recent explosive growth in the volume of images on the World-Wide Web, it has become increasingly difficult to search for images of interests. The classification of images helps users to access a large image collection efficiently. Classification reduces search space by filtering unrelated images. In this paper, we present a technique for image classification based on color, shape and composition using the primary objects. Our experimental results show that this approach can maintain 73% of recall just by searching 24% of the whole data set. The classification results are also used to improve the users' interaction. The retrieval candidates are categorized based on the primary objects and presented to the users. We also show how we apply such technique to assist users in navigation.
A Statistical Model-Based Approach to NE Translation
Authors: Yu Wang
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Named Entities (NE) is widely used in various research areas such as machine translation, cross-language information retrieval, bilingual question answering, bilingual lexicon construction and so on. Although in recent years scientists have done great efforts to identify and translate NE, aligning named entities in bilingual documents is still a complex problem. In this paper, we propose a method to align bilingual named entities in parallel corpora. The results show that the proposed methodology has got good performance, and it can be applicable to a wide range of natural language processing.
Data Mining for Design and Marketing, 1 edition
Authors: Yukio Ohsawa, Katsutoshi Yada
Venue: Chapman & Hall/Crc Data Mining And Knowledge Discovery (2009)

Data Mining for Design and Marketing shows how to design and integrate data mining tools into human thinking processes in order to make better business decisions, especially in designing and marketing products and systems. The expert contributors discuss how data mining can identify valuable consumer patterns, which aid marketers and designers in detecting consumers needs. They also explore visualization tools based on the computational methods of data mining. Discourse analysis, chance discovery, knowledge discovery, formal concept analysis, and an adjacency matrix are just some of the novel approaches covered. The book explains how these methods can be applied to website design, the retrieval of scientific articles from a database, personalized e-commerce support tools, and more. Through the techniques of data mining, this book demonstrates how to effectively design business processes and develop competitive products and services. By embracing data mining tools, businesses can better understand the behavior and needs of their customers.
Brief paper: Perturbation analysis and condition numbers of symmetric algebraic Riccati equations
Authors: Liangmin Zhou, Yiqin Lin, Yimin Wei, Sanzheng Qiao
Venue: Automatica (Journal of IFAC) (2009)

This paper is devoted to the perturbation analysis of symmetric algebraic Riccati equations. Based on our perturbation analysis, the upper bounds for the normwise, mixed and componentwise condition numbers are presented. The results are demonstrated by our preliminary numerical experiments.