ppxscal/embedding_network huggingface dataset:
Convex Recoloring Revisited: Complexity and Exact Algorithms
Authors: Iyad A. Kanj, Dieter Kratsch
Venue: Proceedings of the 15th Annual International Conference on Computing and Combinatorics (2009)

We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. This connection allows us to give a complete characterization of the complexity of all these problems in terms of the number of occurrences of each color in the input instance, and consequently, to present simpler NP-hardness proofs for them than those given earlier. For example, we show that the CLR problem on instances in which the number of leaves of each color is at most 3, is solvable in polynomial time, by reducing it to the independent set problem on chordal graphs, and becomes NP-complete on instances in which the number of leaves of each color is at most 4.This connection also allows us to develop improved exact algorithms for the problems under consideration. For instance, we show that the CPR problem on instances in which the number of vertices of each color is at most 2, denoted 2-CPR, proved to be NP-complete in the current paper, is solvable in time 2 n/4 n O(1) (n is the number of vertices on the path) by reducing it after 2 n/4 enumerations to the weighted independent set problem on interval graphs, which is solvable in polynomial time. Then, using an exponential-time reduction from CPR to 2-CPR, we show that CPR is solvable in time 24n/9 n O(1). We also present exact algorithms for CTR and CLR running in time 20.454n n O(1) and 2 n/3 n O(1), respectively.
An Integrated Methodology for Medieval Landscape Reconstruction: The Case Study of Monte Serico
Authors: Maria Danese, Marilisa Biscione, Rossella Coluzzi, Rosa Lasaponara, Beniamino Murgante, Nicola Masini
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

Landscape Archaeology, in addition to classical disciplines such as geography, history, environment and human topics, improved the use and the integration of all new technological instruments by other documentary sources. Lidar is a new Remote Sensing technique recently adopted in archaeological research. Its main application is the study of any kind of archaeological feature causing a variation in surface elevation adopting 3D mapping with very high resolution and accuracy. The aim of this paper is to contribute to landscape reconstruction for two Medieval abandoned settlements in Basilicata Region (southern Italy) with an integrated approach taken from other technologies as remote sensing, data management and development of predictive models in GIS environment.
Auction-based resource allocation for hierarchical wireless mesh networks in rural areas
Authors: Zhen Kong, Yu-Kwong Kwok
Venue: Proceedings of the 4th ACM workshop on Challenged networks (2009)

Hierarchical wireless mesh networks (WMNs), in which multiple layers of mesh routers (MRs) share one centralized gateway, are gaining importance in providing broadband Internet services in rural areas. Such WMNs are effective in that they can provide a wide coverage area in a cost effective manner. However, more often than not, such MRs are owned and operated by different autonomous entities, which might not have the incentive to comply with a central rule. Thus, in such a competitive non-cooperative environment, effective resource allocation is a notoriously difficult problem. In this paper, we propose a novel auction based framework, in which the gateway, equipped with the precious high speed Internet connection, serves as the auctioneer, while the first-level MRs (i.e., those with direct wireless connections to the gateway) act as bidders competing resources among each other. Specifically, a major novelty of our framework is that the valuation and payment functions are derived based on practical considerations and have realistic physical significance. Based on this framework, we first present the Vickrey-Clarke-Groves (VCG) based auction approaches. To further improve performance, we then propose two novel relay auction (RA) algorithms and analyze the effectiveness of their bidding strategies using the game theoretic solution concept of Nash equilibrium (NE). To realize the NE in a practical distributed computing fashion, we also design an iterative bid updating algorithm. Through simulations, we find that the proposed RA algorithms can achieve competitive performance in terms of resource allocation efficiency as the VCG ones, while giving much better connection blocking probability performance, and also having the capability to balance the efficiency and fairness by adjusting the payment function.
Monitoring heritage buildings with wireless sensor networks: The Torre Aquila deployment
Authors: Matteo Ceriotti, Luca Mottola, Gian Pietro Picco, Amy L. Murphy, Stefan Guna, Michele Corra, Matteo Pozzi, Daniele Zonta, Paolo Zanon
Venue: Proceedings of the 2009 International Conference on Information Processing in Sensor Networks (2009)

Wireless sensor networks are untethered infrastructures that are easy to deploy and have limited visual impact—a key asset in monitoring heritage buildings of artistic interest. This paper describes one such system deployed in Torre Aquila, a medieval tower in Trento (Italy). Our contributions range from the hardware to the graphical front-end. Customized hardware deals efficiently with high-volume vibration data, and specially-designed sensors acquire the building's deformation. Dedicated software services provide: i) data collection, to efficiently reconcile the diverse data rates and reliability needs of heterogeneous sensors; ii) data dissemination, to spread configuration changes and enable remote tasking; iii) time synchronization, with low memory demands. Unlike most deployments, built directly on the operating system, our entire software layer sits atop our TeenyLIME middleware. Based on 4 months of operation, we show that our system is an effective tool for assessing the tower's stability, as it delivers data reliably (with loss ratios ≪0.01%) and has an estimated lifetime beyond one year.
Word pronunciation disambiguation using the web
Authors: Eiichiro Sumita, Fumiaki Sugaya
Venue: Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume: Short Papers on XX (2006)

This paper proposes an automatic method of reading proper names with multiple pronunciations. First, the method obtains Web pages that include both the proper name and its pronunciation. Second, the method feeds them to the learner for classification. The current accuracy is around 90% for open data.
Rational compacts and exposed quadratic irrationalities
Authors: S. Khrushchev
Venue: Journal of Approximation Theory (2009)

If {e"i}"i"="1^g^+^1 are non-intersecting closed arcs on the unit circle T then their union E is called rational if all harmonic measures @n"E(e"j) at ~ are rational. It is known that the essential support supp"e"s"s(@s) of a periodic measure @s (i.e. the Verblunsky parameters of @s are periodic) is rational and any rational E is a rotation of supp"e"s"s(@s) for a periodic @s. Elementary proofs of these facts are given. The Schur function f of a periodic @s satisfies zA^*f^2+(B-zB^*)f-A=0, where the pair (A,B) of polynomials in z is called a Wall pair for @s. Then supp"e"s"s(@s)={t@?T:|b"+(t)|^2==0.5@?m"b@?deg(b). The inequality is precise. A complete description of essential supports of periodic measures is also given in terms of the phases of Akhiezer's multi-valued analytic function as well as separable monic polynomials related to it with roots on T.
Multiscale Classification Likelihood Estimation of Weak Boundary through WDHMT Model
Authors: Yinhui Zhang, Yunsheng Zhang, Zifen He
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

This paper presents a novel multiscale classification likelihood(MCL) estimation method using hierarchical wavelet-domain hidden Markov tree(WDHMT) model. The key idea is that with inter-scale communication and intra-scale interaction of the WDHMT model, we can capture hierarchical classification information of the pixels at the vicinity of the weak boundary. Our framework consists of the following steps. Each frame extracted from the image sequence is transformed through discrete wavelet transform to obtain a compressive representation of the original one. Then the wavelet coefficients at each scale are represented by a tree-structured probabilistic graph, namely, hidden Markov tree. After the model parameters are learned through up-down iterated expectation maximization (EM) algorithm, we deduced the classification likelihood information at each scale. Finally, we tested the performance of this algorithm by using a sequence of tobacco leaf images, in which the objects are shaded and the boundaries are relatively weak, with encouraging results.
Uniform query processing in a federation of RDFS and relational resources
Authors: Merja Karjalainen, Graham J. L. Kemp
Venue: Proceedings of the 2009 International Database Engineering & Applications Symposium (2009)

New knowledge can be gained by combining data from various existing autonomous data collections that are held in heterogeneous formats. Relational databases and RDF data are currently two of the most widely used formats for structured data collections supporting user queries. While data from heterogeneous sources could be restructured and imported into a central system for querying this carries a substantial overhead, particularly if the data sources are updated frequently. Therefore, providing support for queries that require access both to existing relational databases and to RDF data collections, without importing large quantities of data, is the problem addressed in this work. To address this problem, we have implemented a federated system in which queries are expressed in a high-level query language against a federated schema that is described using a semantic data model. During processing, a query may be split into several sub-queries that require access to underlying RDFS and relational data resources, and each sub-query is translated to either SPARQL or SQL for execution, thus taking advantage of existing search capabilities and indexes used by those resources, and avoiding the need to import large quantities of data into a central system in order to answer queries. Query splitting and result integration is done in a uniform way that is independent of what kinds of data resources are being accessed. This uniformity simplifies the system's implementation and facilitates modularity in its design.
Graph Regularisation Using Gaussian Curvature
Authors: Hewayda Elghawalby, Edwin R. Hancock
Venue: Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition (2009)

This paper describes a new approach for regularising triangulated graphs. We commence by embedding the graph onto a manifold using the heat-kernel embedding. Under the embedding, each first-order cycle of the graph becomes a triangle. Our aim is to use curvature information associated with the edges of the graph to effect regularisation. Using the difference in Euclidean and geodesic distances between nodes under the embedding, we compute sectional curvatures associated with the edges of the graph. Using the Gauss Bonnet Theorem we compute the Gaussian curvature associated with each node from the sectional curvatures and through the angular excess of the geodesic triangles. Using the curvature information we perform regularisation with the advantage of not requiring the solution of a partial differential equation. We experiment with the resulting regularization process, and explore its effect on both graph matching and graph clustering.
Accuracy Analysis of Generalized Pronunciation Variant Selection in ASR Systems
Authors: Václav Hanžl, Petr Pollák
Venue: Cross-Modal Analysis of Speech, Gestures, Gaze and Facial Expressions: COST Action 2102 International Conference Prague, Czech Republic, October 15-18, 2008 Revised Selected and Invited Papers (2009)

Automated speech recognition systems work typically with pronunciation dictionary for generating expected phonetic content of particular words in recognized utterance. But the pronunciation can vary in many situations. Besides the cases with more possible pronunciation variants specified manually in the dictionary there are typically many other possible changes in the pronunciation depending on word context or speaking style, very typical for our case of Czech language. In this paper we have studied the accuracy of proper selection of automatically predicted pronunciation variants in Czech HMM ASR based systems. We have analyzed correctness of pronunciation variant selection in forced alignment of known utterances used as an ASR training data. Using the proper pronunciation variant, more exact transcriptions of utterances were created for further purposes, mainly for the more accurate training of acoustic HMM models. Finally, as the target and the most important application are LVCSR systems, the accuracy of LVCSR results using different levels of automated pronunciation generation were tested.
An empirical study of the impact of firm resources on alliance governance structures
Authors: Danielle D. Dunne, Shanthi Gopalakrishnan, Joanne L. Scillitoe
Venue: Journal of Engineering and Technology Management (2009)

Alliances between smaller biotechnology firms and larger pharmaceutical firms are the backbone of new product development strategies within the pharmaceutical industry. While pharmaceutical firms seek access to new technologies and products, small biotechnology firms depend on these alliance relationships to access key resources such as financing and downstream capabilities because they typically do not have the resources needed in-house to successfully commercialize their products. In this study, we investigate the governance structure of these alliance relationships arguing that the more resource rich a biotechnology firm is, in terms of technical, commercial, and social capital, the less likely it is to give up equity to an alliance partner. Results suggest that greater biotech patent quality, cash position, and alliance credibility impact the type of governance structure that is chosen by the alliance partners and therefore the extent of control that the biotechnology firm is willing to give up in the relationship.
Estimating the Confidence of Statistical Model Based Shape Prediction
Authors: Rémi Blanc, Ekaterina Syrkina, Gábor Székely
Venue: Proceedings of the 21st International Conference on Information Processing in Medical Imaging (2009)

We propose a method for estimating confidence regions around shapes predicted from partial observations, given a statistical shape model. Our method relies on the estimation of the distribution of the prediction error, obtained non-parametrically through a bootstrap resampling of a training set. It can thus be easily adapted to different shape prediction algorithms. Individual confidence regions for each landmark are then derived, assuming a Gaussian distribution. Merging those individual confidence regions, we establish the probability that, on average, a given proportion of the predicted landmarks actually lie in their estimated regions. We also propose a method for validating the accuracy of these regions using a test set.
Accessible Network Information Environment Design from the Perspective of Visual Disability
Authors: Huang Lu
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

The visitor has visual disability, which will greatly restrict their access to Network information. This paper will discuss the factors and strategies of accessible network information environment design which can include visual disability visitors, to achieve the goal of designing the accessible network, set up a relatively fair network information environment.
The Change-of-Feature Spatio-temporal Object Relational Model and Its implement
Authors: Xiaochun Wu, Yongqi Huang, Liyan Wang, Fengyun Mou
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

Now more and more application demand to spatio-temporal database is proposed and the spatio-temporal data model is the fundamental basic to spatial-temporal database. But till today the study on spatio-temporal data model still more concerned with the theory research. The article proposes a new model-the change-of-feature based spatio-temporal object relational data model by researching and analyzing the current spatio-temporal data models. The article mainly introduces its concept model, character and implementation, finally uses the software-Postgresql to test practicality. This article is an attempt to realize the Spatio-Temporal data model using in practice.
A QoS-based service retrieval methodology for digital ecosystems
Authors: Hai Dong, Farookh Khadeer Hussain, Elizabeth Chang
Venue: International Journal of Web and Grid Services (2009)

The emergence of the World Wide Web and its influence on the fields of industry, commerce, healthcare and so on, has led to an innovative, dynamic, open, collaborative and interactive environment &ndash; the digital ecosystem. Whereas service plays an important role in digital ecosystems, there is no technology available to retrieve heterogeneous and geographically dispersed services. Additionally, no methodology has been proposed in the literature that can distinguish or rank the services based on the Quality of Services (QoS). In order to address these issues, we propose a semantic service retrieval engine which incorporates a novel semantic QoS evaluation methodology. The salient feature of this methodology that sets it apart from any other QoS evaluation methodologies is that the evaluation of the service and the subsequent quantification of QoS is a combination of subjective and objective QoS measures. Another salient feature of our proposed methodology is that it enables the domain-specific ranking of services. Finally, an online prototype is implemented to evaluate our methodology, the results of which are discussed in this paper.
Privacy Disclosure: Personal Information and Images on Social Networking Sites in Taiwan
Authors: Chia-Lung Hsieh
Venue: Proceedings of the 2009 Ninth Annual International Symposium on Applications and the Internet (2009)

Social networking sites are well developing Internet applications that provide people to extend their real world social lives to a virtual social environment in the cyberspace. Social networking site is actually a double-edged sword, while providing enhanced social values, it also pose a risk of the dissemination of private information to outsiders. In Taiwan, leading social network websites, such as Wretch.cc, has several privacy disclosures which result in damage of personal reputation or in other inconvenience. Since Taiwan might be still immature in the privacy point of view, we would like to discuss the network privacy environment in Taiwan, and try to make some suggestions to improve privacy protection.
Application of Bi-cepstrum Analysis to Gear Fault Detection and Diagnosis
Authors: Lihui Fu, Hui Li, Yaning Wang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

The bi-cepstrum technique is presented based on bi-spectrum and cepstrum analysis. This new method combines bi-spectrum technique with cepstrum analysis. Firstly, in order to eliminate the noise effects, the bi-spectrum is calculated. Then the bi-spectrum is processed by bi-cepstrum technique. The experimental results show that bi-cepstrum technique can effectively diagnosis the faults of the gear.
Generalized convex spaces, L-spaces, and FC-spaces
Authors: Sehie Park
Venue: Journal of Global Optimization (2009)

We show that FC-spaces due to Ding are particular types of L-spaces due to Ben-El-Mechaiekh et al., and hence particular types of G-convex spaces. Some counter-examples are given and related matters are also discussed.
Game Analysis of Knowledge Sharing in Virtual Enterprise
Authors: Wang Shixian, Wei Siying, Zhang Jinlong
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

Virtual enterprise is a dynamic enterprise alliance for the purpose of reacting to drastic market and improving core competence. Knowledge sharing is crucial to the virtual enterprise. The case of knowledge sharing between two member enterprises without participant of hegemony enterprise has been discussed using Prisoner Dilemma Game Model. There are many factors may affect the strategy of member enterprise like utility of monopolizing the knowledge, the lost monopolizing benefit when sharing the knowledge and the cost of the knowledge sharing. The theory of complete and perfect two-stage dynamic game of knowledge sharing based on work competition model has been applied to the analysis on knowledge sharing in virtual enterprise. The member enterprise will choose knowledge sharing level to make marginal income equal to the value of negative utility by sharing its knowledge at Nash Equilibrium. The hegemony enterprise should formulate a reasonable stimulation policy and give enough bounty to the member enterprise who has contributed more knowledge to the virtual enterprise through knowledge sharing. There is a positive correlation between stimulation level and the variance of random item probability distribution of production function.
Computer and Information Science 2009, 1st edition
Authors: Roger Lee, Gongzu Hu, Huaikou Miao
Venue:  (2009)

The purpose of the 8th IEEE/ACIS International Conference on Computer and Information Science (ICIS 2009) to be held on June 1-3, 2009 in Shanghai, China is to bring together scientist, engineers, computer users, students to share their experiences and exchange new ideas, and research results about all aspects (theory, applications and tools) of computer and information Science; and to discuss the practical challenges encountered along the way and the solutions adopted to solve them. The conference organizers selected 27 outstanding papers from ICIS 2009, all of which you will find in this volume of Springer's "Studies in Computational Intelligence".
Website Designer as an Evaluator: A Formative Evaluation Method for Website Interface Development
Authors: Chao-Yang Yang
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

Commerce plays a fundamental part in a lot of websites so that their goals may be different from conventional computer system design e.g. to increase the user base or encourage repeat visits. With limited budgets, website designers are unlikely to involve their users during the design process and not all website designers have access to an evaluator, appropriate testing facilities or evaluation knowledge to support their design. The research develops a low cost, tailorable, formative evaluation method for web designers. The method addressed both HCI and commercial website goals such as the encouragement of repeat visits. This research first investigate the contemporary evaluation method, the users' and designers' needs from websites and website evaluation methods. Finally, the method was developed as a set of guidelines and verified in the evaluation of a website. The potential usefulness, practicality and necessity of the method was then confirmed by website.