ppxscal/embedding_network huggingface dataset:
Molecular graphs and the inverse Wiener index problem
Authors: Stephan G. Wagner, Hua Wang, Gang Yu
Venue: Discrete Applied Mathematics (2009)

In the drug design process, one wants to construct chemical compounds with certain properties. In order to establish the mathematical basis for connections between molecular structures and physicochemical properties of chemical compounds, some so-called structure-descriptors or ''topological indices'' have been put forward. Among them, the Wiener index is one of the most important. A long standing conjecture on the Wiener index [I. Gutman, Y. Yeh, The sum of all distances in bipartite graphs, Math. Slovaca 45 (1995) 327-334; M. Lepovic, I. Gutman, A collective property of trees and chemical trees, J. Chem. Inf. Comput. Sci. 38 (1998) 823-826] states that for any positive integer n (except numbers from a given 49 element set), one can find a tree with Wiener index n. We proved this conjecture in [S. Wagner, A class of trees and its Wiener index, Acta Appl. Math. 91 (2) (2006) 119-132; H. Wang, G. Yu, All but 49 numbers are Wiener indices of trees, Acta Appl. Math. 92 (1) (2006) 15-20] However, more realistic molecular graphs are trees with degree @?3 and the so-called hexagon type graphs. In this paper, we prove that every sufficiently large integer n is the Wiener index of some caterpillar tree with degree @?3, and every sufficiently large even integer is the Wiener index of some hexagon type graph.
Quantifying the effect of content-based transport strategies for online role playing games
Authors: Chih-Ming Chen, Te-Yuan Huang, Kuan-Ta Chen, Polly Huang
Venue: Proceedings of the 7th ACM SIGCOMM Workshop on Network and System Support for Games (2008)

The QoS requirements of game messages may differ because of the latter's intrinsic characteristics. In this paper, we propose three content-based strategies for quantifying the effects of different QoS levels. The strategies assign appropriate QoS requirements for game messages based on our analysis of Angel's Love action logs. We evaluate several transport protocols, including TCP, UDP, SCTP, DCCP, and our content-based transport protocol using the action logs of Angel's Love. Through simulations, we quantify the performance of our content-based strategies. The results show that the strategies incur much lower end-to-end delay and end-to-end jitter than existing transport protocols.
Analytic Combinatorics, 1 edition
Authors: Philippe Flajolet, Robert Sedgewick
Venue:  (2009)

Analytic Combinatorics is a self-contained treatment of the mathematics underlying the analysis of discrete structures, which has emerged over the past several decades as an essential tool in the understanding of properties of computer programs and scientific models with applications in physics, biology and chemistry. Thorough treatment of a large number of classical applications is an essential aspect of the presentation. Written by the leaders in the field of analytic combinatorics, this text is certain to become the definitive reference on the topic. The text is complemented with exercises, examples, appendices and notes to aid understanding therefore, it can be used as the basis for an advanced undergraduate or a graduate course on the subject, or for self-study.
University Course Timetabling with Genetic Algorithm: A Laboratory Excercises Case Study
Authors: Zlatko Bratković, Tomislav Herman, Vjera Omrčen, Marko Čupić, Domagoj Jakobović
Venue: Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization (2009)

This paper describes the application of a hybrid genetic algorithm to a real-world instance of the university course timetabling problem. We address the timetabling of laboratory exercises in a highly constrained environment, for which a formal definition is given. Solution representation technique appropriate to the problem is defined, along with associated genetic operators and a local search algorithm. The approach presented in the paper has been successfully used for timetabling at the authors' institution and it was capable of generating timetables for complex problem instances.
Mining demand chain knowledge of life insurance market for new product development
Authors: Shu-Hsien Liao, Ya-Ning Chen, Yu-Yia Tseng
Venue: Expert Systems with Applications: An International Journal (2009)

Demand chain management (DCM) can be defined as ''extending the view of operations from a single business unit or a company to the whole chain. Essentially, demand chain management focuses not only on generating drawing power from customers to purchase merchandises on the supply chain; but also on exploring satisfaction, participation, and involvement from customers in order for enterprises to understand customer needs and wants. Thus, customers have changed their position in the demand chain to assume a leading role in bringing more benefit for enterprises. This article investigates what functionalities best fit the consumers' needs and wants for life insurance products by extracting specific knowledge patterns and rules from consumers and their demand chain. By doing so, this paper uses the a priori algorithm and clustering analysis as methodologies for data mining. Knowledge extraction from data mining results is illustrated as market segments and demand chain analysis on life insurance market in Taiwan in order to propose suggestions and solutions to the insurance firms for new product development and marketing.
Numerical Study of the Coupled Flow Field in a Double-spray Calciner
Authors: Haijian Dou, Zuobing Chen, Jiquan Huang
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

Aiming at the coupled processes of combustion and decomposition inside a calciner, multiphase species transportation method is adopted to simulate the complex physical and chemical process. With shrink-core reaction model for raw meal, raw meal particle phase is studied by Euler-Euler method. The coupled processes inside calciner are simulated by solving the species transportation equations between different phases together with fluid dynamics equations. Finally a good consistency is achieved by comparing simulation data with test data from production line and some optimized schemes for flow field of calciner are put forward by analyzing the simulation results.
Development of a traceability system based on open source software for small and medium enterprises in Japan
Authors: Yasuo Uchida, Seigo Matsuno, Tatsuhiro Tamaki
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

Corporations are currently making progress in their efforts toward traceability, against the backdrop of practical realization of automatic identification technologies such as RF tags and 2D barcodes. In order to consistently manage and access various types of product-related history information throughout the supply chain, it is necessary to develop information networks and databases for sharing that information between firms, and EDI systems play a central role in that context. This paper proposes a distributed traceability system based on open source software which is particularly suitable for small and medium enterprises. To do this, the paper first conducts an exploratory analysis of factors involved in the adoption of traceability systems by small and medium enterprises, based on a review of previous research on traceability and questionnaire survey data. Next, it examines the current situation and problems of RF tags, 2D barcodes and EDI systems, and their linkage with in-house backend systems. Based on the above analysis, the paper proposes a model of a traceability system using open source software which is suitable for small and medium enterprises, and discusses the model's practical implications.
A model for a complex polynomial SVM kernel
Authors: Dana Simian
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

SVM models are obtained by convex optimization and are able to learn and generalize in high dimensional input spaces. The kernel method is a very powerful idea. Using an appropriate kernel, the data are projected in a space with higher dimension in which they are separable by an hyperplane. Usually simple kernels are used but the real problems require more complex kernels. The aim of this paper is to introduce and analyze a multiple kernel based only on simple polynomials kernels.
A comparative study between static and dynamic sleep signal generation techniques for leakage tolerant designs
Authors: Ahmed Youssef, Mohab Anis, Mohamed Elmasry
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

Power gating techniques are rapidly gaining popularity assisting the management of leakage power consumption for deep submicrometer microprocessors' functional units. Power gating is based on an input sleep signal to set the functional unit into a low leakage mode. However, power gating techniques in general inherently lack information about the utilization profile of the functional units they manage. This limitation is usually handled either statically by using a fixed length counter that generates the sleep signal when the functional unit is idle for a specified number of cycles or dynamically by changing the number of cycles before the sleep signal is generated depending on the previous history of operation. In this paper, a comparative study between the static and dynamic approaches regarding the power-performance tradeoff will be presented. It will be shown that the dynamic sleep signal generator is capable of tracking the operation of the functional units while achieving accuracies up to 90% compared to an average of 40%-60% for the static sleep signal generator (SSSG). Additionally it saves up to 80% more leakage versus the SSSG. This study is very important in assisting circuit designers choose between both techniques depending on the power gated circuit.
Hassle free fitness monitoring
Authors: David Jea, Jason Liu, Thomas Schmid, Mani Srivastava
Venue: Proceedings of the 2nd International Workshop on Systems and Networking Support for Health Care and Assisted Living Environments (2008)

Fitness monitoring is a fundamental service in pervasive healthcare, but finding a balance between usability and privacy is a hard challenge. To lessen users' anxieties in privacy concerns, we propose a new way of identification by only utilizing imprecise biometrics and existing information. Our solution is "hassle free" because it maintains the devices' original user interface without adding additional sensors and sacrificing user privacy. We demonstrate this idea with a fitness monitoring system for the healthy individuals in a workplace. The system uses collected physiological information (weight, blood pressure and heart rate) and context information (computer network activity) to identify a user. Our experiments show that we can achieve a correct user identification of up to 87%. We believe that our solution can serve as an easy addition to the simple interfaces of current technology by enhancing them with smart algorithms.
Multi-step perturbation solution of nonlinear differentiable equations applied to an econometric analysis of productivity
Authors: Baoline Chen, Peter A. Zadrozny
Venue: Computational Statistics Data Analysis (2009)

Fourth-order multi-step perturbation (MSP) is described and applied as a general method for numerically solving nonlinear, differentiable, algebraic equations which are first-order conditions of economic optimization problems. MSP is first described at a general level and is, then, applied to estimating production-function models, using annual US total manufacturing KLEMS data from 1949 to 2001. The application continues by comparing total factor productivity based on the best estimated model with standard Solow-residual productivity. The optimization problem is the classic firm problem of maximizing output for a given production function, given input prices, and a given cost of inputs. If started sufficiently closely to the correct solution, usual iterative methods, such as quasi-Newton methods, can quickly compute accurate solutions of such problems. However, finding good starting points can be difficult, especially in high-dimensional problems. By contrast, MSP automatically provides a good starting point and iterates a finite number of times over preset steps so that, unlike in usual iterative methods, convergence or divergence is not an issue. Although, as in any numerical method, MSP accuracy is limited by the problem's condition and floating-point accuracy, in practice, at least as implemented here, MSP can quickly compute solutions of nearly single-precision or higher accuracy.
Semiparametric multivariate density estimation for positive data using copulas
Authors: T. Bouezmarni, J. V. K. Rombouts
Venue: Computational Statistics Data Analysis (2009)

The estimation of density functions for positive multivariate data is discussed. The proposed approach is semiparametric. The estimator combines gamma kernels or local linear kernels, also called boundary kernels, for the estimation of the marginal densities with parametric copulas to model the dependence. This semiparametric approach is robust both to the well-known boundary bias problem and the curse of dimensionality problem. Mean integrated squared error properties, including the rate of convergence, the uniform strong consistency and the asymptotic normality are derived. A simulation study investigates the finite sample performance of the estimator. The proposed estimator performs very well, also for data without boundary bias problems. For bandwidths choice in practice, the univariate least squares cross validation method for the bandwidth of the marginal density estimators is investigated. Applications in the field of finance are provided.
On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures
Authors: Michael Lampis, Georgia Kaouri, Valia Mitsou
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

We place our focus on the gap between treewidth's success in producing fixed-parameter polynomial algorithms for hard graph problems, and specifically Hamiltonian Circuit and Max Cut, and the failure of its directed variants (directed tree-width [9], DAG-width [11] and kelly-width [8]) to replicate it in the realm of digraphs. We answer the question of why this gap exists by giving two hardness results: we show that Directed Hamiltonian Circuit is W[2]-hard when the parameter is the width of the input graph, for any of these widths, and that Max Di Cut remains NP-hard even when restricted to DAGs, which have the minimum possible width under all these definitions. Our results also apply to directed pathwidth.
Why We Twitter: An Analysis of a Microblogging Community
Authors: Akshay Java, Xiaodan Song, Tim Finin, Belle Tseng
Venue: Advances in Web Mining and Web Usage Analysis: 9th International Workshop on Knowledge Discovery on the Web, WebKDD 2007, and 1st International Workshop on Social Networks Analysis, SNA-KDD 2007, San Jose, CA, USA, August 12-15, 2007. Revised Papers (2009)

Microblogging is a new form of communication in which users describe their current status in short posts distributed by instant messages, mobile phones, email or the Web. We present our observations of the microblogging phenomena by studying the topological and geographical properties of the social network in Twitter, one of the most popular microblogging systems. We find that people use microblogging primarily to talk about their daily activities and to seek or share information. We present a taxonomy characterizing the the underlying intentions users have in making microblogging posts. By aggregating the apparent intentions of users in implicit communities extracted from the data, we show that users with similar intentions connect with each other.
A highly available job execution service in computational service market
Authors: Woochul Kang, H. Howie Huang, Andrew Grimshaw
Venue: Proceedings of the 8th IEEE/ACM International Conference on Grid Computing (2007)

One of the major challenges in managing resources of computational Grids with diverse shared resources is how to meet users’ QoS requirements and rationally distribute resources at the same time. In particular, even though less reliable desktop PCs are dominant resource providers of computational Grids, they are often underutilized because they do not exhibit qualities required by typical scientific and business applications targeting computational Grids. Economy-based markets are expected to foster the utilization of those underutilized low quality resource via supply-and-demand. However, our experiment shows that price has its limitation in controlling the supply-and-demand in computational markets. This situation necessitates Highly Available Job Execution Service (HA-JES) which fosters the balanced resource consumption by dynamically and transparently replicating jobs with underutilized and underpriced resources. In particular, the process of job replication in HA-JES occurs in market-driven efficient way; underutilized and therefore cheap resources are exploited to build a high quality resource and hence facilitate balanced resource usage. Our simulation results show that HA-JES benefits all actors in the Grid market in terms of resource utilization, market capacity, and market stability.
Free Riding in Peer-to-Peer Networks
Authors: Murat Karakaya, Ibrahim Korpeoglu, Özgür Ulusoy
Venue: IEEE Internet Computing (2009)

Free riding in peer-to-peer (P2P) networks poses a serious threat to their proper operation. Here, the authors present a variety of approaches developed to overcome this problem. They introduce several unique aspects of P2P networks and discuss free riding's effects on P2P services. They categorize proposed solutions and describe each category's important features and implementation issues together with some sample solutions. They also discuss open issues, including common attacks and security considerations.
Self-organized Parallel Cooperation for Solving Optimization Problems
Authors: Sanaz Mostaghim, Hartmut Schmeck
Venue: Proceedings of the 22nd International Conference on Architecture of Computing Systems (2009)

This paper is about using a set of self-organized computing resources to perform multi-objective optimization. In the proposed approach, the computing resources are presented as a unified resource to the user where in traditional parallel optimization paradigms the user has to assign tasks to the resources, collect the best available solutions and deal with failing resources. In this approach called self-organized parallel cooperation model, the user has to specify the preferences and only give the objective functions to the system. The self-organized computing resources deliver the obtained solutions after a certain time to the user. In such a system, fast resources must continue the optimization as long as the overall computing time is not over. However as the solutions of a multi-objective problem depend on each other (via the domination relation) adding a waiting time to the fast processors would affect the quality of the solutions. This has been studied on a scenario of 100 heterogeneous computing resources in the presence of failures in the system.
Design and Implementation of a Distributed Content-based Notification Broker for WS-Notification
Authors: Andres Quiroz, Manish Parashar
Venue: Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (2006)

We describe an implementation based on the WS-Notification (WSN) specification for Publish/Subscribe communication which provides a distributed, content-based notification service. The implementation is based on a distributed hashtable (DHT) built on a structured overlay of peer nodes. The entire system acts as a notification broker, so that notification producers and consumers that make use of the network can achieve loosely-coupled communication with a decentralized, scalable service. We develop and evaluate self-optimizing behavior built to reduce notification traffic within the network.
Low-Cost Supervision for Multiple-Source Attribute Extraction
Authors: Joseph Reisinger, Marius Paşca
Venue: Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing (2009)

Previous studies on extracting class attributes from unstructured text consider either Web documents or query logs as the source of textual data. Web search queries have been shown to yield attributes of higher quality. However, since many relevant attributes found in Web documents occur infrequently in query logs, Web documents remain an important source for extraction. In this paper, we introduce Bootstrapped Web Search (BWS) extraction, the first approach to extracting class attributes simultaneously from both sources. Extraction is guided by a small set of seed attributes and does not rely on further domain-specific knowledge. BWS is shown to improve extraction precision and also to improve attribute relevance across 40 test classes.
Statistical Investigations of the Effectiveness of Using 3-dB Bandwidths of Multimode Fibres to Quantify the Transmission Performance of AMOOFDM Signals
Authors: X. Q. Jin, J. M. Tang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

Statistical investigations of transmission capacities of Adaptively Modulated Optical Orthogonal Frequency Division Multiplexing (AMOOFDM) signals against various Multimode Fibre (MMF) properties, are undertaken, based on 28000 statistically constructed impulse responses of optical amplification-free, MMF links using intensity modulation and direct detection. The utilization of 3-dB optical MMF bandwidths is identified to be a simple and accurate approach for estimating, without performing complicated simulations, AMOOFDM transmission capacities over any MMF links. For a link loss- (differential mode delay)- dominant performance region, the estimated signal capacities have very low relative standard deviations of
Analysis and Design of an Access Control Model Based on Credibility
Authors: Chaowen Chang, Yuqiao Wang, Chen Liu
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

An access control model based on credibility is proposed. The Community Authorization Service (CAS) is an authentication technology which allows service providers to delegate some policy authority to the virtual organization. While in open distributed systems, provider join or leave the domain frequently, so access-control policy in the server changes quickly. To reduce the server load, threshold value of credibility and a weight factor are applied in the model, and use Analytic Hierarchy Process (AHP) to analyze the weight of every rule. Providers adjust the threshold value and weight factor instead of changing policies in the server. First the server authenticates the requestor and gives him credibility, then synthesizes the credibility and trustworthiness. If the synthesis of credibility achieves the threshold value, the server gives him a certificate. The authentication policies and trustworthiness are both used in the model, thus flexibility and robustness are the advantages of this model.