ppxscal/embedding_network huggingface dataset:
The Ecological Control Method of the Highway Construction A Case Study
Authors: Huang Leichang, Gu Xun, Cao Fucun, Ye Shuhong, Wang Haiyan, Song Shufan, Huang Chunyan, He Yunxin
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

With the fast development of Chinese economy, expressway, as the most important portion of the highway networks, had been developed at an astonishing fast speed, which brought on increasingly severe ecological environmental problems in the mean time such as soil and water loss, damage of vegetation ecosystem, geological environment and water environment etc. As a result, the ecological environmental control of highway construction presents great strategic sense in realizing the coordination between the highway construction and the social, economic, environmental benefit.Based on the electric-map of land use of Chongming Island in 1:10000 and aided by the software of ARC GIS9.1, This paper, took the Chong-Qi Highway crossing Chongming Island as an example, selected the main ecological factors of water, farm, mudflat, forest wood and building areas, and carried on the risk assessment of them by an eco-control model of ecological node. As a result, the key ecological nodes of this case were selected the corresponding methods were put forward according to the life cycle of the highway.
A study on multidisciplinary collaborative optimisation based on an improved PSO
Authors: Xiang-wei Zheng, Hong Liu
Venue: International Journal of Computer Applications in Technology (2009)

The design of large scale engineering systems becomes more and more complex, therefore collaborative optimisation (CO), one of the multidisciplinary design optimisation (MDO) methods, is often employed to produce optimal solutions. However, CO has disadvantages as increased computational time, slow convergence and unexpected non-linearity of compatibility constraints. In this paper, a CO method based on MLPSO, which is an improved particle swarm optimiser, is proposed to handle above difficulties and is formulated in detail. In the CO framework, MLPSO is served as optimiser both system level and discipline (or subspace) level, which can deal with various objective functions and constraints, some of which cannot be solved by traditional gradient-based optimisation algorithm. An example demonstrates the proposed method and the results show its feasibility and effectiveness.
Incorporating Shape Features in an Appearance-Based Object Detection System
Authors: Gurman Gill, Martin Levine
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

Most object detection techniques discussed in the literature are based solely on texture-based features that capture the global or local appearance of an object. While results indicate their ability to effectively represent an object class, these features can be detected repeatably only in the object interior, and so cannot effectively exploit the powerful recognition cue of contour. Since generic object classes can be characterized by shape and appearance, this paper has formulated a method to combine these attributes to enhance the object model. We present an approach for incorporating the recently introduced shape-based features called k-Adjacent-Segments (kAS) in our appearance-based framework based on dense SIFT features. Class-specific kAS features are detected in an arbitrary image to form a shape map that is then employed in two novel ways to augment the appearance-based technique. This is shown to improve the detection performance for all classes in the challenging 3D dataset by 3-18% and the PASCAL VOC 2006 by 5%. 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
Bid evaluation in combinatorial auctions: optimization and learning
Authors: Michela Milano, Alessio Guerri
Venue: Software&mdash;Practice Experience (2009)

In combinatorial auctions bidders can post bids on groups of items. The problem of selecting the winning bids, called Winner Determination Problem, is NP-hard. In this paper, we consider an interesting variant of this problem, called Bid Evaluation Problem (BEP), where items are services and are subject to precedence constraints and temporal windows. The BEP has many practical applications, such as, for instance, in transportation routes auctions and in take off and landing time slot allocation problems. We have developed a number of optimization algorithms based on Constraint Programming, on Integer Programming and on the combination of the two techniques. We first show that all algorithms proposed outperform the only commercial system for solving BEP instances called Multi AGent Negotiation Testbed, a more general tool for agent negotiation. Then, we evaluate the developed algorithms and use the decision tree machine learning technique for finding a relation between the instance structure and the solving algorithm and providing an automatic algorithm selection procedure. We show that we can achieve an accuracy of 90&percnt; in predicting the best algorithm given the instance to be solved with a significant time saving w.r.t. a single solving technique or a costless, but less accurate, prediction technique. Copyright &copy; 2009 John Wiley & Sons, Ltd.
Widening the Evaluation Net
Authors: Brian Mac Namee, Mark Dunne
Venue: Proceedings of the 9th International Conference on Intelligent Virtual Agents (2009)

Intelligent Virtual Agent (IVA) systems are notoriously difficult to evaluate, particularly due to the subjectivity involved. From the various efforts to develop standard evaluation schemes for IVA systems the scheme proposed by Isbister Doyle, which evaluates systems across five categories, seems particularly appropriate. To examine how these categories are being used, the evaluations presented in the proceedings of IVA '07 and IVA '08 are summarised and the extent to which the five categories in the Isbister Doyle scheme are used is highlighted.
Prioritized goal decomposition of Markov decision processes: toward a synthesis of classical and decision theoretic planning
Authors: Craig Boutilier, Ronen I. Brafman, Christopher Geib
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

We describe an approach to goal decomposition for a certain class of Markov decision processes (MDPs). An abstraction mechanism is used to generate abstract MDPs associated with different objectives, and several methods for merging the policies for these different objectives are considered. In one technique, causal (least-commitment) structures are generated for abstract policies and plan merging techniques, exploiting the relaxation of policy commitments reflected in this structure, are used to piece the results into a single policy. Abstract value functions provide guidance if plan repair is needed. This work makes some first steps toward the synthesis of classical and decision theoretic planning methods.
A review of the IT outsourcing literature: Insights for practice
Authors: Mary C. Lacity, Shaji A. Khan, Leslie P. Willcocks
Venue: The Journal of Strategic Information Systems (2009)

This paper reviews research studies of information technology outsourcing (ITO) practice and provides substantial evidence that researchers have meaningfully and significantly addressed the call for academics to produce knowledge relevant to practitioners. Based on a review of 191 IT outsourcing articles, we extract the insights for practice on six key ITO topics relevant to practitioners. The first three topics relate to the early 1990s focus on determinants of IT outsourcing, IT outsourcing strategy, and mitigating IT outsourcing risks. A focus on best practices and client and supplier capabilities developed from the mid-1990s and is traced through to the late 2000s, while relationship management is shown to be a perennial and challenging issue throughout the nearly 20years under study. More recently studies have developed around offshore outsourcing, business process outsourcing and the rise, decline and resurrection of application service provision. The paper concludes by pointing to future challenges and developments.
Measuring the Influence of Concept Detection on Video Retrieval
Authors: Pablo Toharia, Oscar D. Robles, Alan F. Smeaton, Ángel Rodríguez
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

There is an increasing emphasis on including semantic concept detection as part of video retrieval. This represents a modality for retrieval quite different from metadata-based and keyframe similarity-based approaches. One of the premises on which the success of this is based, is that good quality detection is available in order to guarantee retrieval quality. But how good does the feature detection actually need to be? Is it possible to achieve good retrieval quality, even with poor quality concept detection and if so then what is the "tipping point" below which detection accuracy proves not to be beneficial? In this paper we explore this question using a collection of rushes video where we artificially vary the quality of detection of semantic features and we study the impact on the resulting retrieval. Our results show that the impact of improving or degrading performance of concept detectors is not directly reflected as retrieval performance and this raises interesting questions about how accurate concept detection really needs to be. 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
Semantic web support applications
Authors: Fernando Chagas, Cedric Luiz de Carvalho, João Carlos da Silva
Venue: Proceedings of the 2008 Euro American Conference on Telematics and Information Systems (2008)

Semantic Web Support Applications are used to manipulate information defined in accordance with Semantic Web technologies and to support the development of semantic applications. This work conceptualizes the Semantic Web and lists and compares applications used in Semantic Web Support.
An Improved QRD-M Detection Algorithm for MIMO Communication System
Authors: Li Liu, Jinkuan Wang, Dongmei Yan, Bin Wang
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

QR decomposition based M-algorithm (QRD-M) can provide near maximum likelihood detection (MLD) performance and low complexity for MIMO communication. The QRD-M algorithm reduces the complexity by selecting M candidates with the smallest accumulated metrics at each level of the tree search. The trade-off between performance and complexity can be adjusted only by setting the parameter M which cannot provide more valuable tradeoff options with better performance to complexity ratio. Based on the equivalent QRD-M model, a new detection scheme is proposed in this paper for MIMO system on flat fading channel. The detection scheme, named as improved QRD-M (IQRD-M) with two independent parameters, is composed of two parts. After performing QR decomposition of the channel matrix, the MLD with length P is done, the accumulated metrics are calculated and sorted, which gives an ordered set, then IQRD-M algorithm is used to search the left layers with novel termination methods. The proposed algorithm provides better tradeoff options and more near-ML performance with low complexity.
Lattice Minimum Bayes-Risk decoding for statistical machine translation
Authors: Roy W. Tromble, Shankar Kumar, Franz Och, Wolfgang Macherey
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

We present Minimum Bayes-Risk (MBR) decoding over translation lattices that compactly encode a huge number of translation hypotheses. We describe conditions on the loss function that will enable efficient implementation of MBR decoders on lattices. We introduce an approximation to the BLEU score (Papineni et al., 2001) that satisfies these conditions. The MBR decoding under this approximate BLEU is realized using Weighted Finite State Automata. Our experiments show that the Lattice MBR decoder yields moderate, consistent gains in translation performance over N-best MBR decoding on Arabic-to-English, Chinese-to-English and English-to-Chinese translation tasks. We conduct a range of experiments to understand why Lattice MBR improves upon N-best MBR and study the impact of various parameters on MBR performance.
Diffusion Propagator Imaging: Using Laplace's Equation and Multiple Shell Acquisitions to Reconstruct the Diffusion Propagator
Authors: Maxime Descoteaux, Rachid Deriche, Denis Bihan, Jean-François Mangin, Cyril Poupon
Venue: Proceedings of the 21st International Conference on Information Processing in Medical Imaging (2009)

Many recent single-shell high angular resolution diffusion imaging reconstruction techniques have been introduced to reconstruct orientation distribution functions (ODF) that only capture angular information contained in the diffusion process of water molecules. By also considering the radial part of the diffusion signal, the reconstruction of the ensemble average diffusion propagator (EAP) of water molecules can provide much richer information about complex tissue microstructure than the ODF. In this paper, we present diffusion propagator imaging (DPI), a novel technique to reconstruct the EAP from multiple shell acquisitions. The DPI solution is analytical and linear because it is based on a Laplace equation modeling of the diffusion signal. DPI is validated with ex vivo phantoms and also illustrated on an in vivo human brain dataset. DPI is shown to reconstruct EAP from only two b-value shells and approximately 100 diffusion measurements.
A Scalability Analysis of TDMA-Based Ad Hoc MAC Protocols
Authors: Sang-Chul Kim, Chong-Woo Woo
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

This paper proposes a novel method to perform quantitative analysis of message complexity. It applies this method to compare message complexity of TDMA-based ad hoc MAC protocols. Since the network resource of ad hoc networks is limited due to the wireless communication channel, the scalability issue is a major research topic in developing ad-hoc algorithms.Simulation demonstrates the TDMA-based MAC protocol has the lowest message complexity and Z-MAC has the highest message complexity of the TDMA-based ad-hoc MAC protocols. Based on these results, this research can be further developed to distinguish the relationship between the message exchanges and improve performance for the collision-free time schedule.
A Nonlinear Filter Based on Row and Column Operation for Positive Impulsive Noise Reduction
Authors: Shuyue Chen, Yun Qiu, Jun Feng
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

The positive impulsive noise may be caused by electron radiation in the photo-electronic imaging system. A novel nonlinear filter based on row and column filtering(RCF) was presented and its denoise and detail preservation properties were analyzed. According to the statistical behaviors of each row and column of an image, the pixel value is determined by its neighborhood. Each row is operated firstly. Then each column processing gives the final result. The given filter was compared with median filter, recursive median filter, adaptive filter and robust statistical adaptive filter through the computer simulations. It is shown that the filter is of a high performance for positive impulsive noise removal and detail preservation.
Intelligent Assistants - A Decision-Theoretic Model: Effective Decision-Theoretic Assistance Through Relational Hierarchical Models
Authors: Sriraam Natarajan
Venue:  (2009)

Building intelligent computer assistants has been a long-cherished goal of AI. Many intelligent assistant systems were built and fine-tuned to specific application domains. In this work, we develop a general model of assistance that combines three powerful ideas: decision theory, hierarchical task models and probabilistic relational languages. We use the principles of decision theory to model the general problem of intelligent assistance. We use a combination of hierarchical task models and probabilistic relational languages to specify prior knowledge of the computer assistant. The assistant exploits its prior knowledge to infer the user's goals and takes actions to assist the user. We evaluate the decision theoretic assistance model in three different domains including a real-world domain to demonstrate its generality. We show through experiments that both the hierarchical structure of the goals and the parameter sharing facilitated by relational models significantly improve the learning speed of the agent. Finally, we present the results of deploying our relational hierarchical model in a real-world activity recognition task.
Tips and Tools for Fostering a Creative e-Learning Class
Authors: Susan Doctoroff Landay
Venue: eLearn (2009)

Despite the effectiveness of e-learning, online learners remain notorious for losing focus, getting bored, checking email, chatting, texting, sorting through piles of neglected mail, or tuning out altogether. It's not their fault. Trainers haven't equipped online learners with an arsenal of tools and toys that will help them stay focused. Here, we will look at some popular classroom methods of addressing the kinesthetic, visual, tactile, and interactive needs of learners, and explore some low cost ways to help online learners make the most of their remote learning experience. 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
Authentication Scheme Based on Trust and Clustering Using Fuzzy Control in Wireless Ad-Hoc Networks
Authors: Seong-Soo Park, Jong-Hyouk Lee, Tai-Myoung Chung
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

In wireless ad-hoc networks, all nodes need to have functions able to authenticate each other and so it is critical to know the trustworthiness of each node in such environments. This paper proposes an authentication system for ad-hoc networks, based on a clustering and trust model. Firstly, methods of solving authentication problems, which occur in ad-hoc networks, are discussed. Next, fuzzy logic inference is introduced, which is used as a trust evaluation method for each node and provides both local and global trust values. The reputation is used in the calculation of the trust value. Using the trust value of a trustor, a more sophisticated trust value can be computed. If a node moves from one cluster to another, the trust level of the node is determined by the certificate issued by the previous introducers. In addition, it is demonstrated that the proposed model can monitor and isolate malicious nodes in order to provide enhancements to the network's overall authentication rate.
Towards an Efficient Process Placement Policy for MPI Applications in Multicore Environments
Authors: Guillaume Mercier, Jérôme Clet-Ortega
Venue: Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2009)

This paper presents a method to efficiently place MPI processes on multicore machines. Since MPI implementations often feature efficient supports for both shared-memory and network communication, an adequate placement policy is a crucial step to improve applications performance. As a case study, we show the results obtained for several NAS computing kernels and explain how the policy influences overall performance. In particular, we found out that a policy merely increasing the intranode communication ratio is not enough and that cache utilization is also an influential factor. A more sophisticated policy (eg. one taking into account the architecture's memory structure) is required to observe performance improvements.
Improving Capability of Locating Tampered Pixels of Statistical Fragile Watermarking
Authors: Kazuya Ohkita, Maki Yoshida, Itaru Kitamura, Toru Fujiwara
Venue: Proceedings of the 8th International Workshop on Digital Watermarking (2009)

A fragile watermarking scheme proposed by Zhang and Wang introduces a statistical mechanism and can accurately localize the pixels with at least one of the 5 most significant bits (MSBs) altered. However, localization of tampered 3 least significant bits (LSBs) is considered unnecessary because these bits are replaced by watermark bits. If the tampered 3 LSBs can be also localized, the pattern of tampering will be identified more correctly. This paper proposes a bit-wise scheme to localize tampered 3 LSBs using information on the tampered 5 MSBs in the statistical scheme. Experimental results show that the proposed scheme can accurately localize tampered 3 LSBs and that the combination of the previous scheme and the proposed one contributes to more exact identification of the tampering pattern. In this sense, we improve the capability of the statistical scheme.
Approximate query answering in locally closed databases
Authors: Álvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, Maurice Bruynooghe
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

The Closed-World Assumption (CWA) on databases expresses that an atom not in the database is false. A more appropriate assumption for databases that are sound but partially incomplete, is the Local Closed-World Assumption (LCWA), which is a local form of the CWA, expressing that the database is complete in a certain area, called the 'window of expertise'. Databases consisting of a standard database instance augmented with a collection of LCWA's are called locally closed databases. In this paper, we investigate the complexity of certain and possible query answering in such databases. As it tums out that these problems are intractlble, we develop efficient approximate methods to underestimate certain answers and overestimate possible answers. We prove that under certain conditions, our methods produce complete answers.