ppxscal/embedding_network huggingface dataset:
Development of an Agent Based Specialized Web Browser for Visually Handicapped Tamils
Authors: R. Ponnusamy, T. Chitralekha, V. Prasanna Venkatesan, S. Kuppswami
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Part III: Applications and Services (2009)

In the modern age every one needs the access to the Internet; the regional language and visually handicapped are not an exception for that. SPECS (SPEcialized Computer System) is a system developed for this purpose to give an access to the visually handicapped people of Tamil language. It has a Braille shell, from where the user can enter his request to the browser through a regional language Braille and then the output generated by the browser is given out as voice. The effectiveness of this system is measured through requests access speed and precision of this system and compared with other normal browser.
Java SOA Cookbook
Authors: Eben Hewitt
Venue:  (2009)

Java SOA Cookbook offers practical solutions and advice to programmers charged with implementing a service-oriented architecture (SOA) in their organization. Instead of providing another conceptual, high-level view of SOA, this cookbook shows you how to make SOA work. It's full of Java and XML code you can insert directly into your applications and recipes you can apply right away. The book focuses primarily on the use of free and open source Java Web Services technologies -- including Java SE 6 and Java EE 5 tools -- but you'll find tips for using commercially available tools as well. Java SOA Cookbook will help you: Construct XML vocabularies and data models appropriate to SOA applications Build real-world web services using the latest Java standards, including JAX-WS 2.1 and JAX-RS 1.0 for RESTful web services Integrate applications from popular service providers using SOAP, POX, and Atom Create service orchestrations with complete coverage of the WS-BPEL (Business Process Execution Language) 2.0 standard Improve the reliability of SOAP-based services with specifications such as WS-Reliable Messaging Deal with governance, interoperability, and quality-of-service issues The recipes in Java SOA Cookbook will equip you with the knowledge you need to approach SOA as an integration challenge, not an obstacle. 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
Bifurcation Dynamics of a Worm Model with Impulsive Control
Authors: Tao Li, Yuanmei Wang, Guangyue Lu, Yalin Xiang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

There has been a constant barrage of worms over the internet during the recent past. To develop appropriate tools for thwarting quick spread of worms, researchers are trying to understand the behavior of the worm propagation with the aid of epidemiological models. In this study, the bifurcation dynamics of a worm propagation model with impulsive control is analyzed. Numerical simulations confirmed our theoretical results.
Intellectual Property Management and Integrated Innovation: From Perspective of China's Indigenous Innovation
Authors: Zhang Jihong, Luo Yuzhong, Du Ding
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

Integrated innovation is an important mechanism to realize China’s indigenous innovation. In this paper, from perspective of China’s indigenous innovation, we define integrated innovation from multiple dimensions. In each dimension, intellectual property management and policy have different emphasis. We analyze intellectual property management at the firm and industry levels, propose the concept of the integrated innovation capacity of a country based on China’s intellectual property strategic plan, and study how to develop the integrated innovation capacity of a nation. We believe that intellectual property management is essential for the evolution of the integrated innovation at the firm, industry, and country levels.
P2PMOBILE - A Framework for Remote Execution in Mobile Environment
Authors: Baohe Zuo, Gongbo Li
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

In the last decade, the popularity of mobile devices (such as smart-phones, personal digital assistance PDAs, laptops), together with the development of wireless connection technology has been making mobile computing highly discussed and studied by researchers. In this paper, we introduce P2PMOBILE, a new framework for utilizing distributed resources in heterogeneous network environment. P2PMOBILE is designed for allowing mobile users to fetch services and resources located in peer-to-peer nodes through their mobile devices. In our framework the peer lies in wired network and communicates with other peers through peer-to-peer protocol. They advertise their services and resources so that other peers can easily get access to these services and resources. Besides, P2PMOBILE enables mobile terminals to get access to these distributed resources and thus makes it possible to utilize these resources for remote execution of various tasks. The load of system is taken into consideration, and a novel approach to route the result of execution back to mobile users is presented in P2PMOBILE. We use image process as an example to test our framework in the end.
Improving similarity measures for short segments of text
Authors: Wen-Tau Yih, Christopher Meek
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

In this paper we improve previous work on measuring the similarity of short segments of text in two ways. First, we introduce a Web-relevance similarity measure and demonstrate its effectiveness. This measure extends the Web-kernel similarity function introduced by Sahami and Heilman (2006) by using relevance weighted inner-product of term occurrences rather than TF×IDF. Second, we show that one can further improve the accuracy of similarity measures by using a machine learning approach. Our methods outperform other state-of-the-art methods in a general query suggestion task for multiple evaluation metrics.
Investigating the Utility of Eye-Tracking Information on Affect and Reasoning for User Modeling
Authors: Kasia Muldner, Robert Christopherson, Robert Atkinson, Winslow Burleson
Venue: Proceedings of the 17th International Conference on User Modeling, Adaptation, and Personalization: formerly UM and AH (2009)

We investigate the utility of an eye tracker for providing information on users' affect and reasoning. To do so, we conducted a user study, results from which show that users' pupillary responses differ significantly between positive and negative affective states. As far as reasoning is concerned, while our analysis shows that larger pupil size is associated with more constructive reasoning events, it also suggests that to disambiguate between different kinds of reasoning, additional information may be needed. Our results show that pupillary response is a promising non-invasive avenue for increasing user model bandwidth.
iPiccer: automatically retrieving and inferring tagged location information from web repositories
Authors: Benjamin Proß, Johannes Schöning, Antonio Krüger
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

We present iPiccer, a system that allows mobile camera phones users to interact with meta-tagged image material available from web repositories, such as flickr in two novel ways. Users of the system are able to infer photo tags from their location and orientation, but are also able to infer their location and orientation from their spatial photo tags. An implementation of iPiccerTaker is outlined, and the potential of this new form of interaction with web repository data is discussed.
Dynamically improving explanations: a revision-based approach to explanation generation
Authors: Charles B. Callaway, James C. Lester
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

Recent years have witnessed rapid progress in explanation generation. Despite these advances, the quality of prose produced by explanation generators warrants significant improvement. Revision-based explanation generation offers a promising means for improving explanations at runtime. In contrast to singledraft explanation generation architectures, a revision-based generator could dynamically create, evaluate, and refine multiple drafts of explanations. However, because of the inherent complexity of revision, previous multisentential revision-based approaches have not scaled up. We have developed a scalable revision-based model of explanation generation that dynamically improves multi-sentential explanations. By operating on abstract discourse plans encoded in a minimalist representation, it combats both the conceptual complexities and the efficiency problems posed by revision. This approach has been implemented in REVISOR, a unification-based revision system. Evaluations of REVISOR'S performance in generating a corpus of extended multi-sentential scientific explanations yielded encouraging results.
A Recursive Embedding Approach to Median Graph Computation
Authors: M. Ferrer, D. Karatzas, E. Valveny, H. Bunke
Venue: Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition (2009)

The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Nevertheless, its computation is extremely complex. Several approaches have been presented up to now based on different strategies. In this paper we present a new approximate recursive algorithm for median graph computation based on graph embedding into vector spaces. Preliminary experiments on three databases show that this new approach is able to obtain better medians than the previous existing approaches.
Is the Writing on the Wall for Tabletops?
Authors: Nadia Pantidi, Yvonne Rogers, Hugh Robinson
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

We describe an ethnographic study that explores how low tech and new tech surfaces support participation and collaboration during a workshop breakout session. The low tech surfaces were post-it notes and large sheets of paper. The new tech surfaces were writeable walls and a multi-touch tabletop. Four groups used the different surfaces during three phases: i) brief presentation of position papers and discussion of themes, ii) the creation of a group presentation and iii) a report back session. Participation and collaboration varied depending on the physical, technological and social factors at play when using the different surfaces. We discuss why this is the case, noting how new shareable surfaces may need to be constrained to invite participation in ways that are simply taken for granted because of their familiarity when using low tech materials.
Uncertainty in the Semantic Web
Authors: Thomas Lukasiewicz
Venue: Proceedings of the 3rd International Conference on Scalable Uncertainty Management (2009)

During the recent decade, significant research activities have been directed towards the Semantic Web as future substitute of the Web. Many experts predict that the next huge step forward in Web information technology will be achieved by adding semantics to Web data. An important role in research towards the Semantic Web is played by formalisms and technologies for handling uncertainty and/or vagueness. In this paper, I give an overview of some own recent formalisms for handling uncertainty and/or vagueness in the Semantic Web.
A Case Study on Fully Asynchronous ACS Module of Low-power Viterbi Decoder for Digital Wireless Communication Applications
Authors: Xuguang Guan, Duan Zhou, Dan Wang, Yintang Yang, Zhangming Zhu
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

This paper proposes a novel low-power fully asynchronous ACS module of the Viterbi decoder to improve the shortcomings of low throughput and high power consumption in conventional synchronous ACS module. The computation quantity can be reduced byadopting pre-computation algorithm which can select the survival path ahead of time. We use Null Convention Logic to implement the fully asynchronous circuits to reach-low power and delay-insensitive. These qualities allow the module working at the maximum speed environment permits, and meanwhile avoid performance degradation in conventional synchronous design brought by critical path. Results have demonstrated that the design proposal in this paper has a throughput improvement by 36.3% and a power consumption reduced by 30.1% over the synchronous one. The novel design is suitable for low-power wireless communication applications with the characteristics of glitch immunization, delay-insensitive and speed adaptive.
Image-Based Lunar Surface Reconstruction
Authors: Stephan Wenger, Anita Sellent, Ole Schütt, Marcus Magnor
Venue: Proceedings of the 31st DAGM Symposium on Pattern Recognition (2009)

For the creation of a realistic 3 meter-sized relief globe of the Moon, a detailed height map of the entire lunar surface is required. Available height measurements of the Moon's surface are too coarse by a factor of 15 for this purpose. The only publicly available source of high-resolution information are photographic images from the Lunar Orbiter IV mission in 1967. We present a shape-from-shading approach to plausibly increase the resolution of existing low-resolution height data, based on a single high-resolution photographic mosaic image of the Moon. The presented reconstruction approach is designed to be robust with respect to frequent imperfections of the photographic imagery. Aside from the automatic reconstruction of a complete detailed lunar surface height map, we give a qualitative validation by the reconstruction of lunar surface details from close-up photographs of the Apollo 15 landing site.
On the performance of cognitive access with periodic spectrum sensing
Authors: Xin Li, Qianchuan Zhao, Xiaohong Guan, Lang Tong
Venue: Proceedings of the 2009 ACM workshop on Cognitive radio networks (2009)

The problem of cognitive access of parallel channels occupied by primary users is considered. The transmissions of primary users are modeled as independent continuous-time Markov processes. A secondary cognitive user employs a slotted transmission format and a periodic sensing strategy such that it decides if and where to transmit according to its sensing outcomes. The objective of the cognitive user is to maximize its throughput while satisfying collision constrains imposed by the primary users. Three access policies are analyzed. The optimal access policy is obtained based on a formulation of constrained Markov decision processes. A simple suboptimal memoryless policy is obtained by the use of instantaneous sensing outcome. As an upper bound of the optimal policy, a memoryless policy assuming the access of full channel states is also considered. For a symmetric system, we show that the simple memoryless policy is asymptotically optimal when the collision constraint is tight by proving that the performances of all three policies converge to the same value.
Improved Comprehensibility and Reliability of Explanations via Restricted Halfspace Discretization
Authors: Klaus Truemper
Venue: Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition (2009)

A number of two-class classification methods first discretize each attribute of two given training sets and then construct a propositional DNF formula that evaluates to True for one of the two discretized training sets and to False for the other one. The formula is not just a classification tool but constitutes a useful explanation for the differences between the two underlying populations if it can be comprehended by humans and is reliable. This paper shows that comprehensibility as well as reliability of the formulas can sometimes be improved using a discretization scheme where linear combinations of a small number of attributes are discretized.
User-Centered Evaluation Model for Medical Digital Libraries
Authors: Patty Kostkova, Gemma Madle
Venue: Knowledge Management for Health Care Procedures: ECAI 2008 Workshop, K4HelP 2008, Patras, Greece, July 21, 2008, Revised Selected Papers (2009)

It remains unclear whether the recent explosion of medical Internet Digital Libraries (DLs), enabled by substantial investments into eHealth by national governments and international agencies, has brought the desired improvements. As ultimately life-critical applications, medical DLs play a crucial role in delivering evidence to professionals and empowering patients. However, little attention has been given to impact evaluation with domain experts in real settings to assess whether they actually make a difference to clinical practice.In this paper we describe a novel evaluation framework --- Impact-ED --- developed at CeRC to fill the gap in impact evaluation research taking into account the community, content, services and technology dimensions of DLs. We present an account of Impact-ED's application in assessing the impact of the National Resource for Infection Control in the UK (NRIC www.nric.org.uk) --- a real-world medical DL used by over 40 000 professionals monthly.
Automatic Image Annotation Based on Improved Relevance Model
Authors: Haiyu Song, Xiongfei Li, Pengjie Wang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

Automatic image annotation is an important and promising solution to narrow the semantic gap between low-level visual feature and high-level semantic concept. Here we propose an improved relevance model to solve image annotation problem. Unlike the classical approaches including classification, and translation model, the improved model is capable of discovering the correlation between blobs (segmented regions) and textual keywords so as to automatically generate keywords for un-annotated image according to joint probabilities. Moreover, it has the ability to detect and remove false keyword(s) by considering the co-occurrence of keywords through machine learning. Experiments demonstrate that the proposed approach outperforms the previous algorithms for image annotation.
A Fast Feature-Based Method to Detect Unusual Patterns in Multidimensional Datasets
Authors: Minh Quoc Nguyen, Edward Omiecinski, Leo Mark
Venue: Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery (2009)

We introduce a feature-based method to detect unusual patterns. The property of normality allows us to devise a framework to quickly prune the normal observations. Observations that can not be combined into any significant pattern are considered unusual. Rules that are learned from the dataset are used to construct the patterns for which we compute a score function to measure the interestingness of the unusual patterns. Experiments using the KDD Cup 99 dataset show that our approach can discover most of the attack patterns. Those attacks are in the top set of unusual patterns and have a higher score than the patterns of normal connections. The experiments also show that the algorithm can run very fast.
Expressiveness and Closure Properties for Quantitative Languages
Authors: Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger
Venue: Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science (2009)

Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In the case of infinite words, the value of a run is naturally computed as the maximum, limsup, liminf, limit average, or discounted sum of the transition weights. We study expressiveness and closure questions about these quantitative languages. We first show that the set of words with value greater than a threshold can be non-omega-regular for deterministic limit-average and discounted-sum automata, while this set is always omega-regular when the threshold is isolated (i.e., some neighborhood around the threshold contains no word). In the latter case, we prove that the omega-regular language is robust against small perturbations of the transition weights. We next consider automata with transition weights 0 or 1 and show that they are as expressive as general weighted automata in the limit-average case, but not in the discounted-sum case. Third, for quantitative languages L1 and L2, we consider the operations max(L1, L2), min(L1, L2), and 1-L1, which generalize the boolean operations on languages, as well as the sum L1 + L2. We establish the closure properties of all classes of quantitative languages with respect to these four operations.
Approximating Transitive Reductions for Directed Networks
Authors: Piotr Berman, Bhaskar Dasgupta, Marek Karpinski
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological and social network applications. We provide $\frac{3}{2}$-approximation algorithms for all the minimization problems and 2-approximation algorithms for all the maximization problems using appropriate primal-dual polytopes. We also show lower bounds on the integrality gap of the polytope to provide some intuition on the final limit of such approaches. Furthermore, we provide APX-hardness result for all those problems even if the length of all simple cycles is bounded by 5.
The Equivalence between Biology and Computation
Authors: John K. Heath
Venue: Proceedings of the 7th International Conference on Computational Methods in Systems Biology (2009)

A major challenge in computational systems biology is the articulation of a biological process in a form which can be understood by the biologist yet is amenable to computational execution. Process calculi have proved to especially powerful computational tools for modelling and reasoning about biological processes and we have previously described, and implemented, a Narrative approach to describing biological models which is a biologically intuitive high level language that can be translated into executable process calculus programs. Here we discuss an extension to the narrative approach which attempts to directly link biological data with Narrative primitives by suggesting an equivalence relationship between a string (the amino acid sequence) and a process. We outline future challenges in applying this approach more generally.