ppxscal/embedding_network huggingface dataset:
Data Mining in Market Segmentation and Tariff Policy Design: A Telecommunication Case
Authors: Xu Hong, Qian Gangyi
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

A method for data mining by using K-means clustering analysis is employed to group consumers into segments by collecting historical data accumulated in business support systems of a telecommunication company. The study led to the identification of seven segments, each with a diverse combination of the segmentation variables. Findings provide implications for strategic choices to telecom operators. Validation of tariff policy, which is designed according to the target customer group, proves that successful marketing policy relies heavily on the accurate assignment of segment membership.
Secure Multiparty Computation Goes Live
Authors: Peter Bogetoft, Dan Lund Christensen, Ivan Damgård, Martin Geisler, Thomas Jakobsen, Mikkel Krøigaard, Janus Dam Nielsen, Jesper Buus Nielsen, Kurt Nielsen, Jakob Pagter, Michael Schwartzbach, Tomas Toft
Venue: Financial Cryptography and Data Security: 13th International Conference, FC 2009, Accra Beach, Barbados, February 23-26, 2009. Revised Selected Papers (2009)

In this note, we report on the first large-scale and practical application of secure multiparty computation, which took place in January 2008. We also report on the novel cryptographic protocols that were used.
Playful Urban Spaces
Authors: Adriana De Souza E Silva, Larissa Hjorth
Venue: Simulation and Gaming (2009)

This article provides a historical overview of the development of urban, location-based, and hybrid-reality mobile games. It investigates the extent to which urban spaces have been used as playful spaces prior to the advent of mobile technologies to show how the concept of play has been enacted in urban spaces through three historical tropes of urbanity: first, the transformation of Baudelaireâs flÃ¢neur into what Robert Luke (2006) calls the âphoneurâ; second, the idea of dÃ©rive as used by situationist Guy DÃ©bord; and last, the wall subculture called parkour. The authors present a classification of the major types of mobile games to date, addressing how they reenact this older meaning of play apparent within these former tropes of urbanity. With this approach, they hope to address two weaknesses in the current scholarshipânamely, differentiating among a range of types of games mediated by mobile technologies and assessing the important effects of playful activities.
Efficient and secure authenticated key exchange using weak passwords
Authors: Jonathan Katz, Rafail Ostrovsky, Moti Yung
Venue: Journal of the ACM (JACM) (2009)

Mutual authentication and authenticated key exchange are fundamental techniques for enabling secure communication over public, insecure networks. It is well known how to design secure protocols for achieving these goals when parties share high-entropy cryptographic keys in advance of the authentication stage. Unfortunately, it is much more common for users to share weak, low-entropy passwords which furthermore may be chosen from a known space of possibilities (say, a dictionary of English words). In this case, the problem becomes much more difficult as one must ensure that protocols are immune to off-line dictionary attacks in which an adversary exhaustively enumerates all possible passwords in an attempt to determine the correct one. We propose a 3-round protocol for password-only authenticated key exchange, and provide a rigorous proof of security for our protocol based on the decisional Diffie-Hellman assumption. The protocol assumes only public parameters&mdash;specifically, a &ldquo;common reference string&rdquo;&mdash;which can be &ldquo;hard-coded&rdquo; into an implementation of the protocol; in particular, and in contrast to some previous work, our protocol does not require either party to pre-share a public key. The protocol is also remarkably efficient, requiring computation only (roughly) 4 times greater than &ldquo;classical&rdquo; Diffie-Hellman key exchange that provides no authentication at all. Ours is the first protocol for password-only authentication that is both practical and provably-secure using standard cryptographic assumptions.
Classification and Design of Islamic Geometric Patterns Using Computer Graphics
Authors: Ahmad M. Aljamali
Venue: Proceedings of the 2009 Second International Conference in Visualisation (2009)

This paper presents an innovative method to classify and design Islamic Geometric Patterns IGPs using computer software. The researcher traced the existing systems associated with the classification of Islamic Geometric Patterns i.e. 7-frieze patterns and 17-wallpaper patterns theories. Also researcher traced the conventional design methodologies that are based on principles of classical gridding systems, which are hierarchical in nature. The researcher found out to distinguish between classification of a pattern (collection of unit designs) and classification of a design (collection of geometry and grids). Classification of a pattern involves repeating the unit-design by isometry formulas (translation, mirroring, rotation and glide reflections) to generate a pattern that can be classified as 7-freize patterns or the 17-wallpaper patterns. Classification of a design involves the normalization of their geometries and grids. In this paper the researcher presented an argument those pattern theories are purely base models. A refined classification with specific focus on the girding system of the star/rosette of IGPs was required. The task of presenting a new method of classification rightly demanded a geometrically and scientifically validated method. Researcher has been successful in developing such a method and presenting it in user-friendly software. Researcher generated software that draws the geometries and grids of any particular star/rosette design and displays its classification instantly. This approach resulted in a measurable method of classification for any given Islamic geometric designs. The software is facilitated to identify the star/rosette sub-motif-grid from its griding system of classification which will allow the user to explore a verity of designs on the sub-motif- grid generating the sub-motif-design, motif-design, unit-design and finally the pattern-design in x-y direction.
Drift-Aware Ensemble Regression
Authors: Frank Rosenthal, Peter Benjamin Volk, Martin Hahmann, Dirk Habich, Wolfgang Lehner
Venue: Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition (2009)

Regression models are often required for controlling production processes by predicting parameter values. However, the implicit assumption of standard regression techniques that the data set used for parameter estimation comes from a stationary joint distribution may not hold in this context because manufacturing processes are subject to physical changes like wear and aging, denoted as process drift. This can cause the estimated model to deviate significantly from the current state of the modeled system. In this paper, we discuss the problem of estimating regression models from drifting processes and we present ensemble regression, an approach that maintains a set of regression models--estimated from different ranges of the data set--according to their predictive performance. We extensively evaluate our approach on synthetic and real-world data.
Lessons learned in building spoken language collaborative interface agents
Authors: Candace L. Sidner, Carolyn Boettner, Charles Rich
Venue: Proceedings of the ANLP-NAACL 2000 Workshop on Conversational Systems (2000)

This paper reports on the development of two spoken language collaborative interface agents built with the Collagen system. It presents sample dialogues with the agents working with email applications and meeting planning applications, and discusses how these applications were created. It also discusses limitations and benefits of this approach.
A New Windows Driver-Hidden Rootkit Based on Direct Kernel Object Manipulation
Authors: Woei-Jiunn Tsaur, Yuh-Chen Chen, Being-Yu Tsai
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

In 2005, Sony-BMG used a rootkit to conceal the digital right management software, which is aptly installed in consumers' computers to prevent unauthorized copying. As a result, it lets the installed rootkit computers provide malware with excellent shelters to be capable of escaping anti-virus detection easily. We can observe that more and more malware writers are taking advantage of rootkits to shield their illegal activities. In this paper, we develop a new Windows driver-hidden rootkit with five tricks based on Direct Kernel Object Manipulation (DKOM), and have verified that it can successfully avoid well-known rootkit detectors. Our research goal is to find out the weaknesses of current detectors, and expect detector developers pay much attention to them and upgrade their products in order to identify the proposed new rookit. We affirm our efforts will be useful for stimulating detector developers to improve the current techniques of detecting Windows Driver-Hidden Rootkits.
A Multiple Channel Selection and Coordination MAC Scheme
Authors: Mthulisi Velempini, Mqhele E. Dlodlo
Venue: Proceedings of the 2009 Second International Conference on Advances in Mesh Networks (2009)

The realization that single channel MAC protocols do not offer adequate end-to-end throughput have prompted researchers to explore more scalable approaches such as multi-channel MAC protocols. Current multi-channel schemes implementing a dedicated control channel lead to saturation problems. Channel selection and coordination schemes which minimize the effects of channel switching penalty and channel bottlenecks are required. The paper proposes a cyclical scheduling algorithm where data transmission is phased. A single dedicated channel with two data channels and one transceiver system is explored. The capacity of a single control channel is investigated as the number of data channels is increased from two to fourteen. Channel saturation is observed on data channels. Analytical results show that a single dedicated control channel causes no bottlenecks up to a fourteen data channels system. Its capacity is affected by the saturation of data channels.
Surface Inspection System of Steel Strip Based on Machine Vision
Authors: Bo Tang, Jian-yi Kong, Xing-dong Wang, Li Chen
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

The traditional surface quality inspection of steel strip is carried by human inspectors, which is far from satisfactory because of its low productivity, low reliability and poor economy. It is a promising way to inspect surface quality of steel strip based on machine-vision technology. In this paper, the structure of the surface automated inspection system is described. The software and image processing of steel strip surface inspection is presented and the algorithms of detect surface defects of steel strip is discussed. The system is capable of both detecting and classifying surface defects in cold rolling steel strip.
A Data Embedding Scheme Based on a Magic Matrix and Wet Paper Codes
Authors: Chin-Chen Chang, Yi-Hui Chen, Zhi-Hui Wang, Ming-Chu Li
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

Data embedding is one of the important issues for securely conveying secrets from senders to receivers without arousing any notices to attackers. Wet paper coding (WPC) is one of the data embedding schemes which embeds secrets into a subset of pixels of an image. The pixels in the subset are also called dry pixels. Inspired by wet paper coding, a novel data embedding scheme with a magicmatrix is presented in this paper. Before data embedding, pixels are randomly chosen to define which pixels are dry and wet. Later on, two pixels are treated as a group and each group is judged as embeddable if at least one pixel is a dry pixel in the group. The experimental results show that our proposed scheme can achieve not only good visual quality but also high embedding rate.
Towards a Theory of Patches
Authors: Amihood Amir, Haim Parienty
Venue: Proceedings of the 16th International Symposium on String Processing and Information Retrieval (2009)

Many applications have a need for indexing unstructured data. It turns out that a similar ad-hoc method is being used in many of them - that of considering small particles of the data.In this paper we formalize this concept as a tiling problem and consider the efficiency of dealing with this model. We present an efficient algorithm for the one dimension tiling problem, and prove the two dimension problem is hard. We then develop an approximation algorithm with an approximation ratio converging to 2. We show that the "one-and-a-half" dimensional version of the problem is also hard.
How Flexible Is Answer Set Programming? An Experiment in Formalizing Commonsense in ASP
Authors: Marcello Balduccini
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

This paper describes an exercise in the formalization of commonsense with Answer Set Programming aimed at finding the answer to an interesting riddle, whose solution is not obvious to many people. Solving the riddle requires a considerable amount of commonsense knowledge and sophisticated knowledge representation and reasoning techniques, including planning and adversarial reasoning. Most importantly, the riddle is difficult enough to make it unclear, at first analysis, whether and how Answer Set Programming or other formalisms can be used to solve it.
Forward-Secure Group Signatures from Pairings
Authors: Toru Nakanishi, Yuta Hira, Nobuo Funabiki
Venue: Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography (2009)

To reduce the damage of key exposures, forward-secure group signature schemes have been first proposed by Song. In the forward-secure schemes, a secret key of a group member is updated by a one-way function every interval and the previous secret key is erased. Thus, even if a secret key is exposed, the signatures produced by the secret keys of previous intervals remain secure. Since the previous forward-secure group signature schemes are based on the strong RSA assumption, the signatures are longer than pairing-based group signatures. In addition, the complexity of the key update or signing/verification is O(T), where T is the total number of intervals. In this paper, a forward-secure group signature scheme from pairings is proposed. The complexity of our key update and signing/verification is O(logT).
The Research of TOPMODEL Based on Subbasin
Authors: Feng Jie, Xie Hehai, Cheng Liting
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

According to hydrologic similarity, that means the grids of the same topographic index were classified into the same runoff unit, TOPMODEL calculates runoff yield. However, spatial heterogeneity of basin terrain and geomorphology information such as rainfall and topographic index statistics distributed curve etc. is not considered. This paper, trough treating basin DEM, obtains sub-basins based on water system and establishes TOPMODEL based on sub-basins. The model has taken the spatial heterogeneity of rainfall and topographic index distributed curve etc. into account. Comparing simulation results applying TOPMODEL based on sub-basin with TOPMODEL in Jiuzhou basin, it is found that TOPMODEL based on sub-basin well reflect basin actual situation and simulation result is more suitable. Also the flow process at basin outlet under the composition of different sub-basin rainfall can be predicted.
Approximate strategic reasoning through hierarchical reduction of large symmetric games
Authors: Michael P. Wellman, Daniel M. Reeves, Kevin M. Lochner, Shih-Fen Cheng, Rahul Suri
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 2 (2005)

To deal with exponential growth in the size of a game with the number of agents, we propose an approximation based on a hierarchy of reduced games. The reduced game achieves savings by restricting the number of agents playing any strategy to fixed multiples. We validate the idea through experiments on randomly generated local-effect games. An extended application to strategic reasoning about a complex trading scenario motivates the approach, and demonstrates methods for game-theoretic reasoning over incompletely-specified games at multiple levels of granularity.
Collaborative Robotic System Obtained by Combining Planning and Holonic Architecture
Authors: Doru Panescu, Carlos Pascal, Marius Sutu, Gabriela Varvara
Venue: Proceedings of the 2009 Advanced Technologies for Enhanced Quality of Life (2009)

This contribution discusses some important issues of the Holonic Manufacturing Systems. The respective approach can bring about some features requested by the present conditions in manufacturing. An appropriate planning mechanism is designed, together with the execution cycle of the agents used as the holons’ deliberative part. The proposed planning and coordination mechanism is implemented in an agent specific environment. The implementation details clarifies the way the proposed solution is to be carried out, conducting to a collaborative robotic system as the main part of an experimental manufacturing system.
"Making Concessions in Order to Gain Advantages Improved Ant Colony Optimization for Improving Job Scheduling Problems
Authors: Liu Suqin, Shuo Jun, Meng Lingfen, Lixing Sheng
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

Ant Colony Optimization (ACO) converges on the optimal path with pheromones cumulating and updating, adopting the mechanism of distributed parallel search. Ant colony system is well self-adoptive and dynamic with making full use of current feedback, which is similar to the dynamic performance of the grid and is proved to be an effective algorithm to solve scheduling problems. But the existing ant colony algorithm can not solve the scheduling problems liking misusing good performance resources for minor purposes. This paper presents a “making concessions in order to gain advantages” algorithm—an improved algorithm based on Ant Colony Optimization (ACO) algorithm for job scheduling problems. Experimental results show that improved ACO approach can solve the problem and outperform ACO.
Domain Hierarchies: A Basic Theoretical Framework for Integrating Software Domains
Authors: Pierre Kelsen, Qin Ma
Venue: Proceedings of the 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering (2009)

We present a new approach to executable modeling that borrows from executable UML the notion of domains and bridges and couches them in a formal abstract framework based on the novel concept of a domain hierarchy. The framework is independent of the language used for representing structure and behavior of domains and bridges. By plugging in a declarative executable modeling language with a formal semantics for representing both structure and behavior, we instantiate the abstract framework into a concrete framework that shares with executable UML the benefits of a high-level separation of the platform-independent model into domains and bridges while providing a formal and declarative description of the underlying models.
SemEval-2010 task 1: coreference resolution in multiple languages
Authors: Marta Recasens, Toni Martí, Mariona Taulé, Lluís Màrquez, Emili Sapena
Venue: Proceedings of the Workshop on Semantic Evaluations: Recent Achievements and Future Directions (2009)

This paper presents the task 'Coreference Resolution in Multiple Languages' to be run in SemEval-2010 (5th International Workshop on Semantic Evaluations). This task aims to evaluate and compare automatic coreference resolution systems for three different languages (Catalan, English, and Spanish) by means of two alternative evaluation metrics, thus providing an insight into (i) the portability of coreference resolution systems across languages, and (ii) the effect of different scoring metrics on ranking the output of the participant systems.
Proportional fault-tolerant data mining with applications to bioinformatics
Authors: Guanling Lee, Sheng-Lung Peng, Yuh-Tzu Lin
Venue: Information Systems Frontiers (2009)

The mining of frequent patterns in databases has been studied for several years, but few reports have discussed for fault-tolerant (FT) pattern mining. FT data mining is more suitable for extracting interesting information from real-world data that may be polluted by noise. In particular, the increasing amount of today's biological databases requires such a data mining technique to mine important data, e.g., motifs. In this paper, we propose the concept of proportional FT mining of frequent patterns. The number of tolerable faults in a proportional FT pattern is proportional to the length of the pattern. Two algorithms are designed for solving this problem. The first algorithm, named FT-BottomUp, applies an FT-Apriori heuristic and finds all FT patterns with any number of faults. The second algorithm, FT-LevelWise, divides all FT patterns into several groups according to the number of tolerable faults, and mines the content patterns of each group in turn. By applying our algorithm on real data, two reported epitopes of spike proteins of SARS-CoV can be found in our resulting itemset and the proportional FT data mining is better than the fixed FT data mining for this application.
A Phase-Based Approach for On-Chip Bus Architecture Optimization
Authors: Jaesung Lee, Hyuk-Jae Lee, Chanho Lee
Venue: The Computer Journal (2009)

As the integration scale of a chip increases, on-chip interconnects suffer from the increased area occupied by a large number of bus signals. To reduce the overhead for communication, this paper formulates a new concept of an on-chip communication approach, called phase-based interconnection, with an example protocol, system-on-chip network protocol (SNP). In the phase-based communication, a small number of signals called phase signals are used to distinguish the types of signals transmitted through the main communication channel. To identify transactions transmitted through the channel, the SNP protocol defines the allowed sequence of phases for each transaction. A theoretical framework provides conditions for a phase-based protocol to allow immediate decoding of transactions. Simulation results show that the bandwidth of SNP is greater than that of a de facto standard bus protocol although SNP has wires only about three-fifths of the standard bus protocol. Although the signal-toggling rate is increased because of the multiplexed transmission of various signals through a single communication channel, simulation results show that the increase is not significant for multimedia applications that frequently transmit burst transfers. The phase omission of SNP helps to reduce the transaction failure rate to 65% while the hardware implementation cost for the support of phase omission is negligible.