ppxscal/embedding_network huggingface dataset:
Evaluating Feature Selection Techniques in Simulated Soccer Multi Agents System
Authors: Fahimeh Farahnakian, Nasser Mozayani
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Since the quality of data affects the success rate ofdata mining and learning algorithms, it is always attempted to identify and remove the irrelevant and redundant information in a dataset. Robotic soccer is a multi-agent system in which agents play in real-time, dynamic, complex and noisy environment. Many parameters affect the result of shooting toward the goal and agents must response to variations in soccer field rapidly. Therefore it is impossible to use all features in scoring behavior. This paper selects dataset for effective features of scoring behavior simulated soccer agents, then compares the size of the trees and accuracy produced by each feature selection scheme against the size of the trees and accuracy produced by C4.5 with no feature selection method. Experimental results have shown that dimensionality reductions lead to operate faster and more effective learning algorithm in real-time simulated soccer agent.
Guaranteed Bandwidth Requirement Mechanism for Multimedia Multicast Traffic in MANETs
Authors: Chia-Cheng Hu, Der-Jiunn Deng, Lih-Gwo Jeng
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

The emergence of nomadic multimedia applications has recently generated much interest in a mobile ad hoc network (MANET) to support diverse Quality-of-Service (QoS). In the existing MANET QoS routing and multicasting protocols, the methods of bandwidth calculation and allocation were proposed to determine routes with bandwidth guaranteed for QoS applications. As our observations, two bandwidth-violation problems will be incurred in the above protocols. In this paper, a heuristic algorithm is proposed to avoid the two problems and determine a feasible bandwidth-satisfied multicast tree. Then, we integrate the algorithm with the existing multicast protocol ODMRP for supporting MANET bandwidth-requirement multicast services. To evaluate the performance of the proposed algorithm, the minimizing problem is formulated as a 0/1 integer linear programming (ILP) for the theoretical studies.
Modeling and Predicting the Helpfulness of Online Reviews
Authors: Yang Liu, Xiangji Huang, Aijun An, Xiaohui Yu
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Online reviews provide a valuable resource for potential customers to make purchase decisions. However, the sheer volume of available reviews as well as the large variations in the review quality present a big impediment to the effective use of the reviews, as the most helpful reviews may be buried in the large amount of low quality reviews. The goal of this paper is to develop models and algorithms for predicting the helpfulness of reviews, which provides the basis for discovering the most helpful reviews for given products. We first show that the helpfulness of a review depends on three important factors: the reviewer’s expertise, the writing style of the review, and the timeliness of the review. Based on the analysis of those factors, we present a nonlinear regression model for helpfulness prediction. Our empirical study on the IMDB movie reviews dataset demonstrates that the proposed approach is highly effective.
An Efficient Bilingual Optical Character Recognition (English-Oriya) System for Printed Documents
Authors: Sanghamitra Mohanty, Himadri Nandini Dasbebartta, Tarun Kumar Behera
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

Recognition of documents containing multiscripts is really a challenging task, which needs more effort of the OCR (Optical Character Recognition) designers for improving the accuracy rate. Previously OCR was developed for documents with single scripts only mainly for English and regional languages. Old documents of not only uniscripts but also multiscripts is needed to be preserved for future use. This paper describes the character recognition process for printed documents containing English and Oriya texts. Though the languages in India are different but still we can find some common features among them. In consideration to our paper we need to distinguish between the Roman Script and the Oriya Script. Most of the English that is. Roman Script are linear as well as circular in nature and the Oriya characters are circular in nature. So we need to separate these scripts by taking into consideration of their features paragraph wise or line wise.
Soft vector processors vs FPGA custom hardware: measuring and reducing the gap
Authors: Peter Yiannacouras, J. Gregory Steffan, Jonathan Rose
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

Soft processors are often used in FPGA-based systems because of their ease-of-use, but for a given computation there is a significant gap in area/performance between a C code implementation executing on a soft processor and a custom FPGA hardware implementation. Recent research has demonstrated that soft processors augmented with support for vector instructions provide significant improvements in performance and scalability for data-parallel workloads. In this work, using an FPGA platform equipped with DDR memory executing data-parallel benchmarks from the industry-standard EEMBC suite, we measure the area/performance gaps between (i) C programs executing on a scalar soft processor, (ii) hand-vectorized programs executing on a soft vector processor, and (iii) custom FPGA hardware. We demonstrate that the wall clock performance gap between scalar executed C and custom hardware can be drastically reduced using our improved soft vector processors, even though they are still clocked 3x slower than custom hardware. We identify loop overhead, data delivery, and exact resource usage as three key advantages of custom hardware that we propose to mitigate in our soft vector processor respectively by decoupling pipelines, tuning cache design, supporting prefetching, and automatically eliminating unused instructions and datapath width. We show that together these improvements increase performance by 3x and reduce the area of the fastest soft vector processor by 2x, significantly reducing the need for designers to resort to more challenging custom hardware implementations.
Knowledge Management Performance Evaluation for Chinese Shipping Enterprise Based on Innovating Assets
Authors: Dehai Liu, Zhenfeng Liu, Libo Qu
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Along with information revolution and economy globalization, innovation assets becomes the core ability for shipping enterprises that could obtain the persistence competition dominance under the complex international shipping market. The paper puts forward the knowledge management performance evaluation index system for Chinese shipping enterprises based on the innovation assets, where includes technological innovation, organizational innovation and management innovation. The paper makes the questionnaire combining the open financial data choosing six typical shipping enterprises. At last, the paper uses DEA method to make the demonstration analysis. The result of principal component analysis and DEA analysis are beautifully validating the shipping enterprises competition evaluation index system based innovation assets.
Strategy-acquisition system for video trading card game
Authors: Nobuto Fujii, Mitsuyo Hashida, Haruhiro Katayose
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

Behavior and strategy of computers(COM) have recently attracted considerable attention with regards to video games, with the development of hardware and the spread of entertainment on the Internet. Previous studies have reported strategy-acquisition schemes for board games and fighting games. However, there have been few studies dealing with the scheme applicable for video Trading Card Games (video TCG). We present an automatic strategy-acquisition system for video TCGs. The proposed strategy-acquisition system uses a sampling technique, Action predictor, and State value function for obtaining rational strategy from many unobservable variables in a large state space. Computer simulations, where our agent played against a Rule-based agent, showed that a COM with the proposed strategy-acquisition system becomes stronger and more adaptable against an opponent's strategy.
Learning weights for translation candidates in Japanese-Chinese information retrieval
Authors: Chu-Cheng Lin, Yu-Chun Wang, Chih-Hao Yeh, Wei-Chi Tsai, Richard Tzong-Han Tsai
Venue: Expert Systems with Applications: An International Journal (2009)

This paper describes our Japanese-Chinese information retrieval system. Our system takes the ''query-translation'' approach. Our system employs both a more conventional bilingual Japanese-Chinese dictionary and Wikipedia for translating query terms. We propose that Wikipedia can be used as a good NE bilingual dictionary. By exploiting the nature of Japanese writing system, we propose that query terms be processed differently based on the forms they are written in. We use an iterative method for weight-tuning and term disambiguation, which is based on the PageRank algorithm. When evaluating on the NTCIR-5 test set, our system achieves as high as 0.2217 and 0.2276 in relax MAP (mean average precision) measurement of T-runs and D-runs.
Technology that upsets the social order: a paradigm shift in assigning lots to tools in a wafer fabricator -- the transition from rules to optimization
Authors: Ken Fordyce, Robert Bixby, Richard Burda
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Historically the dominant decision technology to make dispatch decisions was "rules" which involves the following basic computational mechanisms: merge, select, sort, and if/then/else in a decision tree. Although rules do a reasonable job they fundamentally lack a robust ability to: (a) look across time, (b) look across tools at a tool set, (c) create an anticipated sequence of events at a tool set over some time horizon, (d) establish a formal metric and (f) search alternatives. However, standard wisdom was the rapid pace of change and short time interval between dispatch decisions precluded the use of optimization to build dispatch applications. Although this barrier was legitimate in the 1980s and most of the 1990s based on limitations in hardware and software (algorithms); the real barrier today is cultural; not technical. From 2004--2007, IBM and ILOG jointly worked to deploy the ILOG optimization product FPO to key tools sets in IBM's 300mm fab resulting in substantial improvements in performance and significantly reduced overhead to adapt to changing circumstances. This paper will cover the fundamentals of the paradigm shift.
Estimated Energy Based Adaptive Clustering Protocol in WSNs
Authors: Na Xia, Haowei Qian, Jian-guo Jiang, Mei Tang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

Clustering has been proven to be an energy efficient topology for Wireless Sensor Networks. It is a key topic to rotate the role of cluster-head to balance the energy load and extend the network lifetime. This paper proposes an estimated energy based adaptive clustering protocol (EEAC), which adopts energy driven cluster-head rotation strategy, selects new cluster-head in local cluster according to the nodes' position and estimated energy which can be calculated, so that the frequent network querying for energy can be relaxed. The cluster-head rotation happens asynchronously in different cluster, and the topology construction and maintenance is localized and simplified. The results of simulation experiment show the validity of the protocol especially in heterogeneous networks.
An Adaptive Likelihood Distribution Algorithm for the Localization of Passive RFID Tags
Authors: Yuuki Ota, Toshihiro Hori, Taiki Onishi, Tomotaka Wada, Kouichi Mutsuura, Hiromi Okada
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

The RFID (Radio Frequency IDentification) tag technology is expected as a tool of localization. By the localization of RFID tags, a mobile robot which installs in RFID readers can recognize surrounding environments. In addition, RFID tags can be applied to a navigation system for walkers. In this paper, we propose an adaptive likelihood distribution scheme for the localization of RFID tags. This method adjusts the likelihood distribution depending on the signal intensity from RFID tags. We carry out the performance evaluation of estimated position error by both computer simulations and implemental experiments. We show that the proposed system is more effective than the conventional system.
Compadres: a lightweight component middleware framework for composing distributed real-time embedded systems with real-time Java
Authors: Jie Hu, Shruti Gorappa, Juan A. Colmenares, Raymond Klefstad
Venue: Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware (2007)

Component frameworks simplify development of enterprise systems and enable code reuse, but most frameworks are unpredictable and hence unsuitable for embedded or real-time systems. Similarly, Java is increasingly being used to build embedded system software because of its portability and ease of use. The Real-Time Specification for Java (RTSJ) reduces the unpredictability in Java execution times by eliminating the need for a garbage collector. However, it introduces programming complexity that makes it difficult to build non-trivial applications. To bring the advantages of Java component development to DRE systems, while simultaneously simplifying the use of RTSJ, therefore, we have developed a new lightweight component model for RTSJ called Compadres. Compadres offers the following advantages: 1) Simple component definition in Java that abstracts away RTSJ memory management complexity; 2) System assembly from components by connecting ports that communicate through strongly-typed objects; 3) The Compadres compiler that automatically generates the scoped memory architecture for components, while the component framework handles communication between the components. To validate this work, we construct a non-trivial example application using the component framework, a simple real-time CORBA implementation. We then analyze the performance and efficiency of our component example versus a non-component example, RTZen. Our measurements show that our Compadres example built with components incurs only minor time overhead as compared to a comparable hand-coded example.
A ubiquitous processor embedded with progressive cipher pipelines
Authors: Masa-aki Fukase, Atsuko Yokoyama, Tomoaki Sato
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

A ubiquitous processor developed for multimedia mobile use follows the parallelism of multicore and multiple pipelines. Cipher pipelines are dedicated for hardware cryptography that implements the progressive scheme of random number addressing achieved by directly connecting a built-in RNG (random number generator) to the address line of data cache. This makes transfer between register file and data cache microarchitectural transposition. The SIMD execution by the cipher pipeline has practical ability for ad-hoc network to keep the temporary security of multimedia data without permanent network infrastructure.
A framework for development and evaluation of a dynamic subchannel allocation scheme in an OFDMA system
Authors: Banani Roy, Michael Einhaus, Chanchal Kumar Roy
Venue: The Journal of Supercomputing (2009)

This paper presents a framework for allocating radio resources to the Access Points (APs) introducing an Access Point Controller (APC). Radio resources can be either time slots or subchannels. The APC assigns subchannels to the APs using a dynamic subchannel allocation scheme. The developed framework evaluates the dynamic subchannel allocation scheme for a downlink multicellular Orthogonal Frequency Division Multiple Access (OFDMA) system. In the considered system, each AP and the associated Mobile Terminals (MTs) are not operating on a frequency channel with fixed bandwidth, rather the channel bandwidth for each AP is dynamically adapted according to the traffic load. The subchannels assignment procedure is based on quality estimations due to the interference measurements and the current traffic load. The traffic load estimation is realized with the measurement of the utilization of the assigned radio resources. The reuse partitioning for the radio resources is done by estimating mutual Signal to Interference Ratio (SIR) of the APs. The developed dynamic subchannel allocation ensures Quality of Service (QoS), better traffic adaptability, and higher spectrum efficiency with less computational complexity.
Voice enabling mobile financial services with multimodal transformation
Authors: Shuchih Ernest Chang
Venue: International Journal of Mobile Communications (2009)

Pervasive computing may provide multiple modes of interface for end users to access the internet applications at anytime from anywhere using any device. This article describes how multimodal user-interface pages for supporting various wireless devices can be implemented with multimodal transformation. It also illustrates how a Multimodal Web System (MWS) could be voice-enabled to support an interactive voice channel. This study provides insights for the design and implementation of successful business applications to catch the revolutionary opportunity and benefit of voice-enabled MWSs. In doing so, it contributes to the body of knowledge associated with the emergent pervasive computing environment.
A Model for Desertification Evolution Employing GIS with Cellular Automata
Authors: Huo-ping Ding, Jian-ping Chen, Gong-wen Wang
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

Desertification causes extensive concern of international academia for its development speed and serious calamity. Based on dynamic analysis of remote sensing data in different time and relationships between desertification and drive factors, a method how to build up desertification simulation model based on cellular automata with the help of GIS (Geographic Information System), RS(Remote Sensing) and GPS (Global Positioning System) technologies was put forward. The simulation model was developed with AML (Arc Macro Language) based on ArcGIS software. Then the model was applied to predict spatial-temporal desertification expansion in Bashang and its neighboring areas in Hebei province. Results show that the simulation and prediction of spatial-temporal evolution of desertification tally with the factual situation, which reflect the desertification development situation in the areas.
Fine-Grained Protein Mutation Extraction from Biological Literature
Authors: Rui Wang, Shirley W. I. Siu, Rainer A. Böckmann
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

Automatic extraction of experimental data on protein mutants from large volumes of biological texts can help building corresponding databases to facilitate research in relevant studies. Mutation extraction cannot be fully solved by the surface pattern matching but requires linguistic analysis of the plain text. Based on the existing regular expression method, we improved the mutation extraction by applying the dependency parsing technique from natural language processing (NLP). Furthermore, we extract valuable data about experimental measurements from the texts and relate them to the identified mutations. Our method was evaluated on MedLine abstracts. The results show great potential for future exploration.
Digital identity management and protection
Authors: Elisa Bertino
Venue: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services (2006)

Digital identity management (DIM) has emerged as a critical foundation for supporting successful interaction in today's globally interconnected society. It is crucial not only for the conduct of business and government but also for a large and growing body of electronic or online social interactions. Digital identity management is usually coupled with the notion of federation. The goal of federations is to provide users with protected environments to federate identities by the proper management of identity attributes. Federations provide a controlled method by which federation members can provide more integrated and complete services to a qualified group of individuals within certain sets of business transactions. By controlling the scope of access to participating sites, and by enabling secure, cross-domain transmission of user's personal information, federations can make the perpetration of identity frauds more difficult, as well as reduce their frequency, and their potential impact. In this talk we will first discuss basic digital identity concepts and requirements towards DIM solutions and we will overview relevant initiatives currently undergoing in academia and industry. We will then focus on the problem of identity theft and discuss an initial solution to the problem of establishing and protecting digital identity. 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
Drawing (Complete) Binary Tanglegrams
Authors: Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

A binary tanglegram is a pair &lang;S,T&rang; of binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For applications, for example in phylogenetics, it is essential that both trees are drawn without edge crossings and that the inter-tree edges have as few crossings as possible. It is known that finding a drawing with the minimum number of crossings is NP-hard and that the problem is fixed-parameter tractable with respect to that number. We prove that under the Unique Games Conjecture there is no constant-factor approximation for general binary trees. We show that the problem is hard even if both trees are complete binary trees. For this case we give an O(n 3)-time 2-approximation and a new and simple fixed-parameter algorithm. We show that the maximization version of the dual problem for general binary trees can be reduced to a version of MaxCut for which the algorithm of Goemans and Williamson yields a 0.878-approximation.
Research on Manufacturability Evaluation Methods of Aeroengine Blade
Authors: HongJun Liu, Rong Mo, QingMing Fan
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

In this paper according to the analysis of the manufacturability of aeroengine blade, the manufacturability evaluation is considered a multi-level decision problem, and manufacturability qualitative evaluation method based on production rule and manufacturability quantitative evaluation method based on AHP comprehensive evaluation are established. Due to the complexity of the latter method, the detailed solving steps of the process are present and an example is taken for explanation. Using above research methods, product design can be guided according to feedback information by evaluating the part manufacturability.