ppxscal/embedding_network huggingface dataset:
Triplet lexicon models for statistical machine translation
Authors: Saša Hasan, Juri Ganitkevitch, Hermann Ney, Jesús Andrés-Ferrer
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

This paper describes a lexical trigger model for statistical machine translation. We present various methods using triplets incorporating long-distance dependencies that can go beyond the local context of phrases or n-gram based language models. We evaluate the presented methods on two translation tasks in a reranking framework and compare it to the related IBM model 1. We show slightly improved translation quality in terms of BLEU and TER and address various constraints to speed up the training based on Expectation-Maximization and to lower the overall number of triplets without loss in translation performance.
A Diffusion Approximation Analysis of Multilevel Ad Hoc and Sensor Networks
Authors: Jerzy Martyna
Venue: Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks (2009)

In this paper we considered the approximation of a queueing system model of wireless ad hoc and sensor networks. In our model we admitted an arbitrary distribution for the duration of each M states that describe the source. Following the Markov Modulated Rate Process (MMRP) as a source model, we used it to introduce a diffusion approximation for the superposition of such aggregated traffic processes. We showed that the diffusion approximation of the aggregated traffic from the Markov modulated sources can illustrate the process of data harvesting by the sensors in different states. 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
A Reconfigurable Manufacturing Execution System and its Component Reuse
Authors: Li Zhaohui, Chen Yan, Chen Xiuquan
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

With reference to the idea of component design for workshop production business, This paper puts forward a Reconfigurable Manufacturing Execution System (RMES)based on workflow and Multi-Agent, establish it’s function architecture and operation control mechanism. Under the architecture of RMES, the configurable workshop production business can be handled, and the MES application system can correspondingly adjust with its change to realize the personalized production management system. By the use of software component, RMES can increase the adaptability and reconstructivity of MES effectively.
Sparse Matrix Operations on Multi-core Architectures
Authors: Carsten Trinitis, Tilman Küstner, Josef Weidendorfer, Jasmin Smajic
Venue: Proceedings of the 10th International Conference on Parallel Computing Technologies (2009)

This paper compares various contemporary multi-core based microprocessor architectures with different memory interconnects regarding performance, speedup, and parallel efficiency. Sparse matrix operations are used as a benchmark application from the area of electrical engineering. Within this context, thread to core pinnning and cache optimization are two important aspects which are investigated in more detail.
Spontaneous Detection of Infinite Loops and Livelocks in Dynamic Testing of Concurrent Programs
Authors: Che-Sheng Lin, Gwan-Hwan Hwang
Venue: Proceedings of the 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering (2009)

Concurrent programs that contain busy-waiting loops or iterative statements might not stop when they are tested dynamically due to some processes getting stuck in infinite loops or the execution of several loops forming a livelock. The traditional way of handling this problem in dynamic testing – interrupting the execution of the concurrent program when a predefined maximum execution time is exceeded. In this paper, we propose a dynamic decision scheme that spontaneously stops the execution of tested processes when they get stuck in an infinite loop or form a livelock. Since the halting problem is proven to be undecidable, we propose heuristic algorithms to cope with this. We apply the proposed scheme to a dynamic testing methodology called dynamic effective testing, which can perform state- and transition-cover testing for concurrent programs with busy-waiting loops. The implementation and experimental results demonstrate the feasibility of the proposed scheme.
Virtual Fence for a Surveillance System
Authors: Yen San Yong, Hock Woon Hon, Yasir Salih Osman, Ching Hau Chan, Siu Jing Then, Sheau Wei Chau
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

This paper presents a method for defining one or more virtual restricted zones within a surveillance area which is observed with stereo cameras. When an object enters a restricted zone, the system highlights the object shown in the monitoring screen or triggers other devices to produce a visual or auditory alarm. The proposed method works by extracting the foreground objects for both the left and the right images from their respective stereo cameras. Then it estimates the object's position in terms of depth plane using image shifting and number of overlapping pixels. Finally, it determines whether there is a collision between objects and restricted zones in order to trigger an alarm where necessary. The algorithm has been tested with a series of stereo videos, in which samples of it are presented in this paper.
Scaling laws for data-centric storage and querying in wireless sensor networks
Authors: Joon Ahn, Bhaskar Krishnamachari
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

We use a constrained optimization framework to derive scaling laws for data-centric storage and querying in wireless sensor networks. We consider both unstructured sensor networks, which use blind sequential search for querying, and structured sensor networks, which use efficient hash-based querying. We find that the scalability of a sensor network's performance depends upon whether the increase in energy and storage resources with more nodes is outweighed by the concomitant application-specific increase in event and query loads. We derive conditions that determine: 1) whether the energy requirement per node grows without bound with the network size for a fixed-duration deployment, 2) whether there exists a maximum network size that can be operated for a specified duration on a fixed energy budget, and 3) whether the network lifetime increases or decreases with the size of the network for a fixed energy budget. An interesting finding of this work is that three-dimensional (3D) uniform deployments are inherently more scalable than two-dimensional (2D) uniform deployments, which in turn are more scalable than one-dimensional (1D) uniform deployments.
RecTOR: A New and Efficient Method for Dynamic Network Reconfiguration
Authors: Åshild Grønstad Solheim, Olav Lysne, Tor Skeie
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

Reconfiguration of an interconnection network is fundamental for the provisioning of a reliable service. Current reconfiguration methods either include deadlock-avoidance mechanisms that impose performance penalties during the reconfiguration, or are tied to the Up*/Down* routing algorithm which achieves relatively low performance. In addition, some of the methods require complex network switches, and some are limited to distributed routing systems. This paper presents a new dynamic reconfiguration method, RecTOR, which ensures deadlock-freedom during the reconfiguration without causing performance degradation such as increased latency or decreased throughput. Moreover, it is based on a simple concept, is easy to implement, is applicable for both source and distributed routing systems, and assumes Transition-Oriented Routing which achieves excellent performance. Our simulation results confirm that RecTOR supports a better network service to the applications than Overlapping Reconfiguration does.
Surfing Peer-to-Peer IPTV: Distributed Channel Switching
Authors: A. -M. Kermarrec, E. Merrer, Y. Liu, G. Simon
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

It is now common for IPTV systems attracting millions of users to be based on a peer-to-peer (P2P) architecture. In such systems, each channel is typically associated with one P2P overlay network connecting the users. This significantly enhances the user experience by relieving the source from dealing with all connections. Yet, the joining process resulting in a peer to be integrated in channel overlay usually requires a significant amount of time. As a consequence, switching from one channel to another is far to be as fast as in IPTV solutions provided by telco operators. In this paper, we tackle the issue of efficient channel switching in P2P IPTV system. This is to the best of our knowledge the first study on this topic. First, we conducted and analyzed a set of measurements of one of the most popular P2P systems (PPlive). These measurements reveal that the set of contacts that a joining peer receives from the central server are of the utmost importance in the start-up process. On those neigbors, depends the speed to acquire the first video frames to play. We then formulate the switching problem, and propose a simple distributed algorithm, as an illustration of the concept, which aims at leveraging the presence of peers in the network to fasten the switch process. The principle is that each peer maintains as neighbors peers involved in other channels, providing peers with good contacts upon channel switching. Finally, simulations show that our approach leads to substantial improvements on the channel switching time. As our algorithmic solution does not have any prerequisite on the overlays, it appears to be an appealing add-on for existing P2P IPTV systems.
Execution Control for CHR
Authors: Leslie Koninck
Venue: Proceedings of the 25th International Conference on Logic Programming (2009)

This is a summary of the PhD of the author [1], which deals with the topic of execution control for Constraint Handling Rules.
Representing Groups on Graphs
Authors: Sagarmoy Dutta, Piyush P. Kurur
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

In this paper we formulate and study the problem of representing groups on graphs. We show that with respect to polynomial time Turing reducibility, both abelian and solvable group representability are all equivalent to graph isomorphism, even when the group is presented as a permutation group via generators. On the other hand, the representability problem for general groups on trees is equivalent to checking, given a group G and n, whether a nontrivial homomorphism from G to S n exists. There does not seem to be a polynomial time algorithm for this problem, in spite of the fact that tree isomorphism has polynomial time algorithms.
An Empirical Analysis of Personal Digital Document Structures
Authors: Sarah Henderson, Ananth Srinivasan
Venue: Proceedings of the Symposium on Human Interface 2009 on ConferenceUniversal Access in Human-Computer Interaction. Part I: Held as Part of HCI International 2009 (2009)

Hierarchies have long been used as useful structuring mechanisms for organizing and managing documents. This study looks at the problem of personal digital document management in the context of knowledge workers. We study and document strategies that users employ to manage the complexity imposed by the volume and variety of personal digital documents. Exploratory research was conducted, analyzing the file systems of 73 knowledge workers using Microsoft Windows in a university setting. The empirical results of this are presented, and compared to a previous study that examined the file systems of 11 users.
Protein Folding Classification by Committee SVM Array
Authors: Mika Takata, Yasuo Matsuyama
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

Protein folding classification is a meaningful step to improve analysis of the whole structures. We have designed committee Support Vector Machines (committee SVMs) and their array (committee SVM array) for the prediction of the folding classes. Learning and test data are amino acid sequences drawn from SCOP (Structure Classification Of Protein database). The classification category is compatible with the SCOP. SVMs and committee SVMs are designed in an one-versus-others style both for chemical data and sliding window patterns (spectrum kernels). This generates the committee SVM array. Classification performances are measured in view of the Receiver Operating Characteristic curves (ROC). Superiority of the committee SVM array to existing prediction methods is obtained through extensive experiments to compute the ROCs.
Hallucinating Faces: Global Linear Modal Based Super-Resolution and Position Based Residue Compensation
Authors: Xiang Ma, Junping Zhang, Chun Qi
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

A learning-based face hallucination method is proposed in this paper for the reconstruction of a high-resolution face image from a low-resolution observation based on a set of high- and low-resolution training image pairs. The proposed global linear modal based super-resolution estimates the optimal weights of all the low-resolution training images and a high-resolution image is obtained by applying the estimated weights to the high-resolution space. Then, we propose a position based local residue compensation algorithm to better recover subtle details of face. Experiments demonstrate that our method has advantage over some established methods.
Relation Algebra Operations on Formal Contexts
Authors: Uta Priss
Venue: Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies (2009)

This paper discusses the use of relation algebra operations on formal contexts. These operations are a generalisation of some of the context operations that are described in the standard FCA textbook (Ganter Wille, 1999). This paper extends previous research in this area with respect to applications and implementations. It also describes a software tool (FcaFlint) which in combination with FcaStone facilitates the application of relation algebra operations to contexts stored in many formats.
Intelligent Multi-agent Based Health Information System
Authors: Young Im Cho
Venue: Proceedings of the 2009 International Conference on Biometrics and Kansei Engineering (2009)

In this paper, we will discuss about the intelligent multi-agent based health information system. The multi-agent concept is varied from 2 or 3 agents to many agents. Therefore, to construct the appropriate concept which you want to implement is more important. In this paper, we will discuss about the concept of multi-agent, and discuss some application areas of fuzzy logic based multi-agent, especially in bioinformatics. And finally we will discuss about the future research areas of multi-agent in AI 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
Patterns of Interactions in Complex Social Networks Based on Coloured Motifs Analysis
Authors: Katarzyna Musial, Krzysztof Juszczyszyn, Bogdan Gabrys, Przemysław Kazienko
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

Coloured network motifs are small subgraphs that enable to discover and interpret the patterns of interaction within the complex networks. The analysis of three-nodes motifs where the colour of the node reflects its high --- white node or low --- black node centrality in the social network is presented in the paper. The importance of the vertices is assessed by utilizing two measures: degree prestige and degree centrality. The distribution of motifs in these two cases is compared to mine the interconnection patterns between nodes. The analysis is performed on the social network derived from email communication.
Combination of Research and Teaching in Software Engineering Education
Authors: Jianguo Liu
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

By analyzing the current cultivation of the software talents and the demands of market, the problems of talent cultivation in software field in universities have been revealed. A proposed mode is to combine current research with software engineering teaching, that is, to use research projects in software engineering courses. The projects can be utilized in real process development training, giving students the opportunities to accumulate actual experiences of practical software development, to get more familiar with the procedures of software development, to master the implementation and documentation techniques of software development. Moreover, the software developed during the software engineering course immediately contributed to the research project. The mode of software engineering education is very successful and will be continued. 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
Research on Reputation Field Model and Referenced Reputation Calculation Model on C2C Market
Authors: Yang Yue, Gao Jiao
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

There are shortcomings in the online reputation mechanism for the C2C market at present, the key points are how to valuate the seller’s reputation level and provide reputation evaluation service to the buyer. First, the key factors about the reputation are analyzed in this paper, which are sum and the extent of time. Then, a formula to calculate the seller’s reputation is put forward, by using field theory as reference. At last, a calculation model of reference reputation on C2C market is brought forward.
Deterring Online Advertising Fraud through Optimal Payment in Arrears
Authors: Benjamin Edelman
Venue: Financial Cryptography and Data Security: 13th International Conference, FC 2009, Accra Beach, Barbados, February 23-26, 2009. Revised Selected Papers (2009)

Online advertisers face substantial difficulty in selecting and supervising small advertising partners: Fraud can be well-hidden, and limited reputation systems reduce accountability. But partners are not paid until after their work is complete, and advertisers can extend this delay both to improve detection of improper partner practices and to punish partners who turn out to be rule-breakers. I capture these relationships in a screening model with delayed payments and probabilistic delayed observation of agents' types. I derive conditions in which an advertising principal can set its payment delay to deter rogue agents and to attract solely or primarily good-type agents. Through the savings from excluding rogue agents, the principal can increase its profits while offering increased payments to good-type agents. I estimate that a leading affiliate network could have invoked an optimal payment delay to eliminate 71% of fraud without decreasing profit.
Evaluation of Self-organization and Orderliness in M and A System
Authors: Changbing Tong, Qiusheng Zhang, Jinchuan Ke
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

Because of the existence of complexity and indetermination in the Merger Acquisition (M A), so as to achieve the ultimate objective of mergers and acquisitions, there must be a clear understanding about the self-organization and synergy of the M A system. This paper conducts a research and makes a comprehensive evaluation for the merges bargain indetermination from the angle of complexity science. In the process of studying, beginning with the M A involvers, trading environment and trading market, we analyze the uncertainty of the system, and then create a structure diagram for the uncertainty, and apply the complex theories to carry on a comprehensive evaluation.
Development of a Simulator of Abacus: Ancient Analog Calculator on a Mobile Phone as a Teaching Material
Authors: Kenta Saito, Yuki Makita, Vu Quang, Hitoshi Sasaki
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part IV: Interacting in Various Application Domains (2009)

Portable electric devices such as mobile phones and video game consoles are becoming high performance and they are becoming ubiquitous. And a lot of people are in situations that allow for use of these applications. On one hand, it is useful for students to study out of class if they can use teaching materials at school with a portable device. And Japanese people had widely been using an abacus until the electronic digital calculator appeared recently. Even today, the abacus is used to teach math in Japanese primary schools teaching. We are developing a simulator of abacus as one of the computerizations of the teaching materials in this research.
Capturing acceptable variation in distinguishing descriptions
Authors: Jette Viethen, Robert Dale
Venue: Proceedings of the Eleventh European Workshop on Natural Language Generation (2007)

Almost all existing referring expression generation algorithms aim to find one best referring expression for a given intended referent. However, human-produced data demonstrates that, for any given entity, many perfectly acceptable referring expressions exist. At the same time, it is not the case that all logically possible descriptions are acceptable; so, if we remove the requirement to produce only one best solution, how do we avoid generating undesirable descriptions? Our aim in this paper is to sketch a framework that allows us to capture constraints on referring expression generation, so that the set of logically possible descriptions can be reduced to just those that are acceptable.
Hybrid inference for sensor network localization using a mobile robot
Authors: Dimitri Marinakis, David Meger, Ioannis Rekleitis, Gregory Dudek
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

In this paper, we consider a hybrid solution to the sensor network position inference problem, which combines a real-time filtering system with information from a more expensive, global inference procedure to improve accuracy and prevent divergence. Many online solutions for this problem make use of simplifying assumptions, such as Gaussian noise models and linear system behaviour and also adopt a filtering strategy which may not use available information optimally. These assumptions allow near real-time inference, while also limiting accuracy and introducing the potential for ill-conditioning and divergence. We consider augmenting a particular real-time estimation method, the extended Kalman filter (EKF), with a more complex, but more highly accurate, inference technique based on Markov Chain Monte Carlo (MCMC) methodology. Conventional MCMC techniques applied to this problem can entail significant and time consuming computation to achieve convergence. To address this, we propose an intelligent bootstrapping process and the use of parallel, communicative chains of different temperatures, commonly referred to as parallel tempering. The combined approach is shown to provide substantial improvement in a realistic simulated mapping environment and when applied to a complex physical system involving a robotic platform moving in an office environment instrumented with a camera sensor network.