ppxscal/embedding_network huggingface dataset:
The Using of Knowledge Visualization Tools in E-science Environment Take Concept Maps for Example
Authors: Xiao-yue Wang, Yan Mu
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

In e-Science environment, people pay more attention to the scientific visualization and data visualization. Visualization about information exchange and knowledge sharing is rare to be mentioned. Knowledge sharing is an important part in e-Science environment. The knowledge visualization tools can facilitate thinking together and the collective wisdom, it also can promote the knowledge sharing and the creation of the new knowledge. If the concept maps, a visualization tool, are used to help members in e-Science environment to describe their structure of knowledge in communication, it can promote the knowledge discovery in a clearer way. In this paper, we discuss the application of concept maps and we promote an application model in e-Science environment.
Approximate Equal Frequency Discretization Method
Authors: Sheng-yi Jiang, Xia Li, Qi Zheng, Lian-xi Wang
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

Many algorithms for data mining and machine learning can only process discrete attributes. In order to use these algorithms when some attributes are numeric, the numeric attributes must be discretized. Because of the prevalent of normal distribution, an approximate equal frequency discretization method based on normal distribution is presented. The method is simple to implement. Computing complexity of this method is nearly linear with the size of dataset and can be applied to large size dataset. We compare this method with some other discretization methods on the UCI datasets. The experiment result shows that this unsupervised discretization method is effective and practicable
Introduction to Mobile Trajectory Based Services: A New Direction in Mobile Location Based Services
Authors: Sarfraz Khokhar, Arne A. Nilsson
Venue: Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications (2009)

The mandate of E911 gave birth to the idea of Location Based Services (LBS) capitalizing on the knowledge of the mobile location. The underlying estimated location is a feasible area. There is yet another class of mobile services that could be based on the mobility profiling of a mobile user. The mobility profile of a mobile user is a set of the routine trajectories of his or her travel paths. We called such services as Mobile Trajectory Based Services (MTBS). This paper introduces MTBS and functional architecture of an MTBS system. Suitability of different location estimation technologies for MTBS has been discussed and supported with simulation results.
Application of Topology Optimization to Commercial Vehicle Cab Design
Authors: Deng-feng Wang, Bin Zhang, Jing Chen, Shan-po Wang, Shen-qiang Liu
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

A topology optimization approach based on FEM is presented in this paper, which can be used to simplify the topological structure of an “optimum” structure obtained from the topology optimization process, and thus significantly improves the manufacturability of the final design. The design of commercial vehicle cab body topologic structure is presented using this approach. The existing model is made modifications according to the results of the optimization, and compared with original design. The results show that by optimizing the topology of the structure, the material can be distributed in a more efficient manner thus giving equal or better structural performance at a lower mass. Finite element analysis with optimization process has proven very useful in virtual manufacturing world.
Research on Active Defence Technology with Virus Based on K-Nearest Neighbor Algorithm of Kernel
Authors: Xuedou Yu
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

In this paper, the active defence technology against virus, the detection technology of known variants of virus and the active defence technology against virus based on K-NN are introduced. Their disadvantages are analyzed. A solution which is based on k-nearest neighbor algorithm of kernel and the active defence technology against virus is proposed. The solution can distinguish safe process from the unknown viruses process efficiently, and can detect unknown viruses more accurately.
Zero-Day Reconciliation of BitTorrent Users with Their ISPs
Authors: Marco Slot, Paolo Costa, Guillaume Pierre, Vivek Rai
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

BitTorrent users and consumer ISPs are often pictured as having opposite interests, with end-users aggressively trying to improve their download times, while ISPs throttle this traffic to reduce their costs. However, inefficiencies in both download time and quantity of long-distance traffic originate in BitTorrent randomly selecting peers to interact with. We show that biasing the link selection allows one to reduce both median download times by up to 32% and long-distance traffic by up to 16%. This optimization can be deployed by modifying only the BitTorrent trackers. No external infrastructure nor specialized client-side software deployment is necessary, thereby facilitating the adoption of our technique.
A multi-dimensional trust model for heterogeneous contract observations
Authors: Steven Reece, Stephen Roberts, Alex Rogers, Nicholas R. Jennings
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

In this paper we develop a novel probabilistic model of computational trust that allows agents to exchange and combine reputation reports over heterogeneous, correlated multi-dimensional contracts. We consider the specific case of an agent attempting to procure a bundle of services that are subject to correlated quality of service failures (e.g. due to use of shared resources or infrastructure), and where the direct experience of other agents within the system consists of contracts over different combinations of these services. To this end, we present a formalism based on the Kalman filter that represents trust as a vector estimate of the probability that each service will be successfully delivered, and a covariance matrix that describes the uncertainty and correlations between these probabilities. We describe how the agents' direct experiences of contract outcomes can be represented and combined within this formalism and we empirically demonstrate that our formalism provides significantly better trustworthiness estimates than the alternative of using separate single-dimensional trust models for each separate service (where information regarding the correlations between each estimate is lost).
The Application Research of Pattern Recognition for Failure Detection
Authors: Shufen Li, Junli Liu
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

Considering the characteristics of the mechanical equipment and the disadvantages of the existing diagnosis method, a new failure detection method based on pattern recognition is defined. Short time signal and linear distinguish function is adopted. Alone feature is combined for deciding. The method of sensitive and efficient is provided for detecting bearing fault. From the analysis result of the actual vibration signals, the proposed method is proven to be efficient in detecting and diagnosing the rolling element bearing faults. The method is put on application on bearing diagnosis and frication diagnosis .The results indicate that it has abilities of early stage forecast fault.
KANSEI Based Clothing Fabric Image Retrieval
Authors: Yen-Wei Chen, Shota Sobue, Xinyin Huang
Venue: Computational Color Imaging: Second International Workshop, CCIW 2009, Saint-Etienne, France, March 26-27, 2009. Revised Selected Papers (2009)

KANSEI is a Japanese term which means psychological feeling or image of a product. KANSEI engineering refers to the translation of consumers' psychological feeling about a product into perceptual design elements. Recently KANSEI based image indexing or image retrieval have been done by using interactive genetic algorithms (IGA). In this paper, we propose a new technique for clothing fabric image retrieval based on KANSEI (impressions). We first learn the mapping function between the fabric image features and the KANSEI and then the images in the database are projected into the KANSEI space (psychological space). The retrieval is done in the psychological space by comparing the query impression with the projection of the images in database.
Streaming Media Information Services Based on Peer to Peer Technology
Authors: Delin Hou, Huosong Xia
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

Streaming media is data that is delivered in a continuous stream to a client and that can be used as it arrives. With the rapid development of information technology, streaming media service is one of the important ways of the information services. P2P technology has played a good supporting role in the distribution of large data flow of streaming media in information services. This article analyzes the characteristics of the streaming media information services, and discusses the operating mechanisms about steaming media information services based on peer to peer technology, and this article constructed two kinds of streaming media information service mechanisms based on the P2P technology, which are the structured P2P streaming media information services making the server as the center and the P2P streaming media information service based on the multicast service nodes.
Rough Set Theory: Ontological Systems, Entailment Relations and Approximation Operators
Authors: Marcin Wolski
Venue: Transactions on Rough Sets X (2009)

The paper exhibits some new connections between ontological information systems equipped with approximation operators and entailment relations. The study is based on the conceptual framework of information quanta [4,5], where each system is defined as a relational structure and all approximation operators are defined in terms of Galois connections. We start our investigation with Scott systems, that is sets equipped with Scott entailment relations. Following the research by Vakarelov [2,11,12,13], we shall consider Scott systems induced by property systems and provide their characterisation in terms of Galois connections. We also recall how such connections allow one to define approximation operators from rough set theory (RST) [6,7] and derivation operators from formal concept analysis (FCA) [14,15]. Since we would like to have a uniform representation for both complete and incomplete Pawlak information systems, our attention is drawn by topological property systems, which additionally allows for a natural Galois-based generalisation of approximation operators. While considering more specific Scott systems, such like Tarski systems and standard Tarski systems, we obtain stronger connections to approximation operators from RST and FCA. Eventually, on the basis of these operators one can define Scott information systems with the trivial consistency predicate.
Constructing New Aperiodic Self-simulating Tile Sets
Authors: Grégory Lafitte, Michael Weiss
Venue: Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice (2009)

Wang tiles are unit size squares with colored edges. By using a fixed-point theorem à la Kleene for tilings we give novel proofs of classical results of tilings problems' undecidability by way of diagonalization on tilings (made possible by this theorem). Then, we present a general technique to construct aperiodic tile sets, i.e., tile sets that generate only aperiodic tilings of the plane. Our last construction generalizes the notion of self-simulation and makes possible the construction of tile sets that self-simulate via self-similar tilings, showing how complex the self-simulation can be.
Approximate Rewriting of Queries Using Views
Authors: Foto Afrati, Manik Chandrachud, Rada Chirkova, Prasenjit Mitra
Venue: Proceedings of the 13th East European Conference on Advances in Databases and Information Systems (2009)

We study approximate, that is contained and containing, rewritings of queries using views. We consider conjunctive queries with arithmetic comparisons (CQACs), which capture the full expressive power of SQL select-project-join queries. For contained rewritings, we present a sound and complete algorithm for constructing, for CQAC queries and views, a maximally-contained rewriting (MCR) whose all CQAC disjuncts have up to a predetermined number of view literals. For containing rewritings, we present a sound and efficient algorithm pruned-MiCR, which computes a CQAC containing rewriting that does not contain any other CQAC containing rewriting (i.e., computes a minimally containing rewriting, MiCR) and that has the minimum possible number of relational subgoals. As a result, the MiCR rewriting produced by our algorithm may be very efficient to execute. Both algorithms have good scalability and perform well in many practical cases, due to their extensive pruning of the search space, see [1].
Implementing Parallel Google Map-Reduce in Eden
Authors: Jost Berthold, Mischa Dieterle, Rita Loogen
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

Recent publications have emphasised map-reduce as a general programming model (labelled Google map-reduce), and described existing high-performance implementations for large data sets. We present two parallel implementations for this Google map-reduce skeleton, one following earlier work, and one optimised version, in the parallel Haskell extension Eden. Eden's specific features, like lazy stream processing, dynamic reply channels, and nondeterministic stream merging, support the efficient implementation of the complex coordination structure of this skeleton. We compare the two implementations of the Google map-reduce skeleton in usage and performance, and deliver runtime analyses for example applications. Although very flexible, the Google map-reduce skeleton is often too general, and typical examples reveal a better runtime behaviour using alternative skeletons.
Dependency Tree Kernels for Relation Extraction from Natural Language Text
Authors: Frank Reichartz, Hannes Korte, Gerhard Paass
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II (2009)

The automatic extraction of relations from unstructured natural text is challenging but offers practical solutions for many problems like automatic text understanding and semantic retrieval. Relation extraction can be formulated as a classification problem using support vector machines and kernels for structured data that may include parse trees to account for syntactic structure. In this paper we present new tree kernels over dependency parse trees automatically generated from natural language text. Experiments on a public benchmark data set show that our kernels with richer structural features significantly outperform all published approaches for kernel-based relation extraction from dependency trees. In addition we optimize kernel computations to improve the actual runtime compared to previous solutions.
Leveraging Parallel Corpora and Existing Wordnets for Automatic Construction of the Slovene Wordnet
Authors: Darja Fišer
Venue: Human Language Technology. Challenges of the Information Society: Third Language and Technology Conference, LTC 2007, Poznan, Poland, October 5-7, 2007, Revised Selected Papers (2009)

The paper reports on a series of experiments conducted in order to test the feasibility of automatically generating synsets for Slovene wordnet. The resources used were the multilingual parallel corpus of George Orwell's Nineteen Eighty-Four and wordnets for several languages. First, the corpus was word-aligned to obtain multilingual lexicons and then these lexicons were compared to the wordnets in various languages in order to disambiguate the entries and attach appropriate synset ids to Slovene entries in the lexicon. Slovene lexicon entries sharing the same attached synset id were then organized into a synset. The results obtained by the different settings in the experiment are evaluated against a manually created gold standard and also checked by hand.
Research and Implementation on Vocational Career Ladder Plan of Staff in Small and Medium-sized Enterprise of China
Authors: Baining Gao
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

Vocational career management of an organization are mainly applied in the staff quality evaluation and career counseling, staff career training and the staff vocational steps plan. In China, the implementation of staff vocational career steps and ladders plan still is at the exploration stage. This paper discusses the factors and basic thinking order for the design process of the vocational career steps and ladders plan through introducing the process to guide some enterprises to set up their vocational career steps and ladders plan. The author hopes to help the localization of China's vocational career management.
Construction of Third-Party Reverse Logistics About Electronics Enterprise Based on Circular Economy
Authors: Meng Xiangru, Song Wei
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

After many years’ research, circular economy is the best way to accomplish sustainable development. Recycling economy is based on enterprises, which is to recycle the domestic waste product. However, the reverse-logistics is one of the ways to reuse waste products. In china, the reverse logistics was paid attention. From the perspective of the society, good reverse logistics can be effective in the use of resources, protection of the environment. From the perspective of enterprises, good reverse logistics not only can accumulate product data, which provide basic data for prediction and making decisions, but also is important marketing methods to keep customer's loyalty. From the customer perspective, the good reverse logistics can make them consume at ease, it also brings value-added effect. The paper firstly present the concept of reverse logistics. After that, the paper creates current industry practices for reverse logistics, and analyze the advantages of third-party access to reverse logistics market ,and built circular economy model of reverse logistics on electronics Enterprise. Then we construct transport recycling system on third-party reverse logistics. On the basis of this, we use LINGO programming to solve the problem.
Ethical behavior issues in software use: An analysis of public and private sectors
Authors: Ibrahim Akman, Alok Mishra
Venue: Computers in Human Behavior (2009)

Ethical issues related to information systems are important to the information technology (IT) professionals. These issues are also significant for organizations and societies. Although considerable literature on IT and related ethical issues exists, a review of this literature has found little empirical research on ethical practices within the government and private sector organizations. Therefore, the objective of this paper is to draw inferences regarding such practices currently in these sectors. The research results indicate a significant correlation between the code of ethics and the attitude of professionals towards the unethical use of software in government and private sector organizations. These also indicate significant differences in government and private sectors.
Open-source compliance
Authors: Ibrahim Haddad
Venue: Linux Journal (2009)

Getting started guide and industry best practices. 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
Object Detection by Estimating and Combining High-Level Features
Authors: Geoffrey Levine, Gerald Dejong
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

Many successful object detection systems characterize object classes with a statistical profile over a large number of local features. We present an enhancement to this method that learns to assemble local features into features that capture more global properties such as body shape and color distribution. The system then learns to combine these estimated global features to improve object detection accuracy. In our approach, each candidate object detection from an off-the-shelf gradient-based detection system is transformed into a conditional random field. This CRF is used to extract a most likely object silhouette, which is then processed into features based on color and shape. Finally, we show that on the difficult Pascal VOC 2007 data set, detection rates can be improved by combining these global features with the local features from a state-of-the-art gradient based approach.
Is unlabeled data suitable for multiclass SVM-based web page classification?
Authors: Arkaitz Zubiaga, Víctor Fresno, Raquel Martínez
Venue: Proceedings of the NAACL HLT 2009 Workshop on Semi-Supervised Learning for Natural Language Processing (2009)

Support Vector Machines present an interesting and effective approach to solve automated classification tasks. Although it only handles binary and supervised problems by nature, it has been transformed into multiclass and semi-supervised approaches in several works. A previous study on supervised and semi-supervised SVM classification over binary taxonomies showed how the latter clearly outperforms the former, proving the suitability of unlabeled data for the learning phase in this kind of tasks. However, the suitability of unlabeled data for multiclass tasks using SVM has never been tested before. In this work, we present a study on whether unlabeled data could improve results for multiclass web page classification tasks using Support Vector Machines. As a conclusion, we encourage to rely only on labeled data, both for improving (or at least equaling) performance and for reducing the computational cost.
Voice-rate: a dialog system for consumer ratings
Authors: Geoffrey Zweig, Y. C. Ju, Patrick Nguyen, Dong Yu, Ye-Yi Wang, Alex Acero
Venue: Proceedings of Human Language Technologies: The Annual Conference of the North American Chapter of the Association for Computational Linguistics: Demonstrations on XX (2007)

Voice-Rate is an automated dialog system which provides access to over one million ratings of products and businesses. By calling a toll-free number, consumers can access ratings for products, national businesses such as airlines, and local businesses such as restaurants. Voice-Rate also has a facility for recording and analyzing ratings that are given over the phone. The service has been primed with ratings taken from a variety of web sources, and we are augmenting these with user ratings. Voice-Rate can be accessed by dialing 1-877-456-DATA.
Pen-Based Video Annotations: A Proposal and a Prototype for Tablet PCs
Authors: Diogo Cabral, Nuno Correia
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

Pen computing or pen-based technology can be considered one of the most natural and intuitive computer input interface for humans. The combination of digital video and pen-based technology can support a new approach for electronic paper by associating handwritten notes and drawings with video segments. This paper presents a proposal for pen-based video annotations and a prototype for Tablet PCs, implementing this concept, particularly dynamic pen-based video annotations combined with real-time video tracking.