ppxscal/embedding_network huggingface dataset:
A cooperative CDMA-based multi-channel MAC protocol for mobile ad hoc networks
Authors: Yuhan Moon, Violet R. Syrotiuk
Venue: Computer Communications (2009)

In this paper, we present CCM-MAC, a cooperative CDMA-based multi-channel medium access control (MAC) protocol for mobile ad hoc networks (MANETs) in which each node has one half-duplex transceiver. The protocol mitigates the multi-channel hidden and exposed terminal problems by using information about channel usage gleaned from overhearing (cooperating) neighbours. By accounting for the multiple access interference, CCM-MAC also addresses the near-far problem of CDMA in MANETs enabling concurrent transmissions on each channel. We provide an analysis of the maximum throughput of CCM-MAC and validate it through simulation in Matlab. We also compare the throughput it achieves to IEEE 802.11, a multi-channel MAC protocol, and a CDMA-based MAC protocol.
A fuzzy approach to hierarchical multiobjective programming problems and its application to an industrial pollution control problem
Authors: H. Yano, M. Sakawa
Venue: Fuzzy Sets and Systems (2009)

In this paper, we focus on hierarchical multiobjective programming problems where multiple decision makers in a hierarchical organization have their own multiple objective functions, and propose an interactive algorithm based on the dual decomposition method to obtain the satisfactory solution which reflects not only the hierarchical relationships between multiple decision makers but also their own preferences for their objective functions. In the proposed algorithm, assuming that each of the decision makers has fuzzy goals for his/her objective functions, corresponding membership functions are elicited from the decision makers in their subjective manner. In order to deal with hierarchical multiobjective programming problems, a new kind of Pareto optimality concept in membership spaces is defined and the concept of decision powers of multiple decision makers in a hierarchical decision structure is introduced. The proposed algorithm is applied to the industrial pollution control problem in Osaka City in Japan in order to show the efficiency of the proposed method.
Role-Based and Service-Oriented Security Management in the E-Government Environment
Authors: Chien-Chih Yu
Venue: Proceedings of the 8th International Conference on Electronic Government (2009)

This paper proposes a role-based and service-oriented security management framework suitable for the e-government operating environment. Based on user roles and functional classes of e-government services, security threats and vulnerabilities related to e-government systems and applications are identified. In the mean time, security requirements as well as appropriate mechanisms for preventing, detecting and recovering from security attacks are specified. Also provided are suggestions and guidelines for planning and controlling e-government security policies.
A cluster-based approach to XML similarity joins
Authors: Leonardo A. Ribeiro, Theo Härder, Fernanda S. Pimenta
Venue: Proceedings of the 2009 International Database Engineering & Applications Symposium (2009)

A natural consequence of the widespread adoption of XML as standard for information representation and exchange is the redundant storage of large amounts of persistent XML documents. Compared to relational data tables, data represented in XML format can potentially be even more sensitive to data quality issues because structure, besides textual information, may cause variations in XML documents representing the same information entity. Therefore, correlating XML documents, which are similar in content an structure, is a fundamental operation. In this paper, we present an effective, flexible, and high-performance XML-based similarity join framework. We exploit structural summaries and clustering concepts to produce compact and high-quality XML document representations: our approach outperforms previous work both in terms of performance and accuracy. In this context, we explore different ways to weigh and combine evidence from textual and structural XML representations. Furthermore, we address user interaction, when the similarity framework is configured for a specific domain, and updatability of clustering information, when new documents enter datasets under consideration. We present a thorough experimental evaluation to validate our techniques in the context of a native XML DBMS.
Improving the Security of Quantum Protocols via Commit-and-Open
Authors: Ivan Damgård, Serge Fehr, Carolin Lunemann, Louis Salvail, Christian Schaffner
Venue: Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology (2009)

We consider two-party quantum protocols starting with a transmission of some random BB84 qubits followed by classical messages. We show a general "compiler" improving the security of such protocols: if the original protocol is secure against an "almost honest" adversary, then the compiled protocol is secure against an arbitrary computationally bounded (quantum) adversary. The compilation preserves the number of qubits sent and the number of rounds up to a constant factor. The compiler also preserves security in the bounded-quantum-storage model (BQSM), so if the original protocol was BQSM-secure, the compiled protocol can only be broken by an adversary who has large quantum memory and large computing power. This is in contrast to known BQSM-secure protocols, where security breaks down completely if the adversary has larger quantum memory than expected. We show how our technique can be applied to quantum identification and oblivious transfer protocols.
Non cooperative fuzzy games in normal form: A survey
Authors: Moussa Larbani
Venue: Fuzzy Sets and Systems (2009)

In this paper, we present a review of most of the approaches for solving non-cooperative fuzzy games in normal form. Applications of these games are reviewed as well. We also present a new class of fuzzy games in normal form: the class of non-cooperative games involving fuzzy parameters. Finally, some potential directions of research are provided throughout the paper and in the conclusion.
Metadata Sets for e-Government Resources: The Extended e-Government Metadata Schema (eGMS+)
Authors: Yannis Charalabidis, Fenareti Lampathaki, Dimitris Askounis
Venue: Proceedings of the 8th International Conference on Electronic Government (2009)

In the dawn of the Semantic Web era, metadata appear as a key enabler that assists management of the e-Government resources related to the provision of personalized, efficient and proactive services oriented towards the real citizens' needs. As different authorities typically use different terms to describe their resources and publish them in various e-Government Registries that may enhance the access to and delivery of governmental knowledge, but also need to communicate seamlessly at a national and pan-European level, the need for a unified e-Government metadata standard emerges. This paper presents the creation of an ontology-based extended metadata set for e-Government Resources that embraces services, documents, XML Schemas, code lists, public bodies and information systems. Such a metadata set formalizes the exchange of information between portals and registries and assists the service transformation and simplification efforts, while it can be further taken into consideration when applying Web 2.0 techniques in e-Government.
Study on Optimization of System Reliability Redundancy Based on Hybrid Intelligent Algorithm
Authors: Dongjing Pan
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

The design of system reliability redundancy is an important method to improve system reliability. It is a difficult point to determine the redundancy numbers of each unit in the system in order to guarantee to satisfy the request of design reliability and the constraint of system cost. This paper discusses the strategical method of system reliability redundancy, and designs a kind of optimization model of system reliability redundancy, uses hybrid intelligent algorithm to solving the model. This method can make the system achieve the biggest lifetime at a certain probability under the certain expense constraint and gives a new way to solving the redundancy numbers of each unit, the experiment has proven that this method had a stronger suitability and solving ability.
Automatic recognition of personality in conversation
Authors: François Mairesse, Marilyn Walker
Venue: Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume: Short Papers on XX (2006)

The identification of personality by automatic analysis of conversation has many applications in natural language processing, from leader identification in meetings to partner matching on dating websites. We automatically train models of the main five personality dimensions, on a corpus of conversation extracts and personality ratings. Results show that the models perform better than the baseline, and their analysis confirms previous findings linking language and personality, while revealing many new linguistic and prosodic markers.
Evaluation of Pointing Efficiency on Small Screen Touch User Interfaces
Authors: Ryosuke Fujioka, Takayuki Akiba, Hidehiko Okada
Venue: Proceedings of the Symposium on Human Interface 2009 on Human Interface and the Management of Information. Information and Interaction. Part II: Held as part of HCI International 2009 (2009)

Researchers have been investigating screen designs for small screen touch user interfaces (UIs), but further research is still required for smaller-screen devices including current smart phones. This paper reports on our evaluation of pointing efficiency on devices with touch-by-stylus small screen UIs. User performances were measured by experiments with three devices: a mobile phone, a PDA and a tablet PC. The size of pointing targets was designed so that the target index of difficulty (ID) by Fitts' law ranged in a consistent interval among the three devices. Users' pointing speed and accuracy were compared in terms of throughput and error rate respectively. It is found that the throughput and the error rate for the mobile phone were significantly smaller than those for the PDA and the tablet PC. It is also found that the error rate was not significantly larger in the case where users performed tasks with the mobile phone held by their hands than in the case where they did with the mobile phone put on desktop, although it was in the case of the PDA.
Semantic Role Labeling of NomBank: a maximum entropy approach
Authors: Zheng Ping Jiang, Hwee Tou Ng
Venue: Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (2006)

This paper describes our attempt at NomBank-based automatic Semantic Role Labeling (SRL). NomBank is a project at New York University to annotate the argument structures for common nouns in the Penn Treebank II corpus. We treat the NomBank SRL task as a classification problem and explore the possibility of adapting features previously shown useful in PropBank-based SRL systems. Various NomBank-specific features are explored. On test section 23, our best system achieves F1 score of 72.73 (69.14) when correct (automatic) syntactic parse trees are used. To our knowledge, this is the first reported automatic NomBank SRL system.
Parallel and interacting Markov chain Monte Carlo algorithm
Authors: Fabien Campillo, Rivo Rakotozafy, Vivien Rossi
Venue: Mathematics and Computers in Simulation (2009)

In many situations it is important to be able to propose N independent realizations of a given distribution law. We propose a strategy for making N parallel Monte Carlo Markov chains (MCMC) interact in order to get an approximation of an independent N-sample of a given target law. In this method each individual chain proposes candidates for all other chains. We prove that the set of interacting chains is itself a MCMC method for the product of N target measures. Compared to independent parallel chains this method is more time consuming, but we show through examples that it possesses many advantages. This approach is applied to a biomass evolution model.
Multi-agent Based Automatic Matching System for Enterprise and Practice Base
Authors: Xu Min, Fang Meiqi
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

In this paper, Multi-Agent technology is discussed. Enterprises have a great deal of projects need to be outsourced, practice bases own lots of persons with high quality who are able to provide good service. So, both enterprises and practice bases need a platform to find appropriate partner. This paper proposes a multi-agent based automatic matching system to solve the problem for them. The system is based on multi-agent technology which includes enterprise agent, practice base agent and matching agent. Matching agent recommends the best partners to enterprise and practice base by the matching algorithm. Enterprise and practice base choose to accept or reject the recommendation. Accordingly, the matching rules in rule base can be updated by their response real time.
A Distributed Scheme for Value-Based Bandwidth Reconfiguration
Authors: Åke Arvidsson, Johannes Göbel, Anthony Krzesinski, Peter Taylor
Venue: Traffic Management and Traffic Engineering for the Future Internet: First Euro-NF Workshop, FITraMEn 2008, Porto, Portugal, December 11-12, Revised Selected Papers (2009)

This paper presents a scheme for reallocating bandwidth in path-oriented transport networks. At random time points, bandwidth is allocated to those paths that (possibly temporarily) value it most highly. The scheme acts according to local rules and without centralised control. The proposed scheme is thus distributed and scalable. Previous studies have shown that bandwidth reallocation, together with the provision of appropriate amounts of spare capacity on certain links, can be used to rapidly deploy and capacitate equivalent recovery routes in the event of network equipment failure. The purpose of this study is to determine if the same reallocation mechanism can also deal effectively with repeated, small scale random traffic fluctuations and with time varying traffics. We present a simulation model of a 30-node 46-link network which we use to evaluate the efficacy of the bandwidth reallocation scheme. The simulation study shows that bandwidth reconfiguration can substantially reduce the connection loss probabilities.
Improving Automatic Video Retrieval with Semantic Concept Detection
Authors: Markus Koskela, Mats Sjöberg, Jorma Laaksonen
Venue: Proceedings of the 16th Scandinavian Conference on Image Analysis (2009)

We study the usefulness of intermediate semantic concepts in bridging the semantic gap in automatic video retrieval. The results of a series of large-scale retrieval experiments, which combine text-based search, content-based retrieval, and concept-based retrieval, is presented. The experiments use the common video data and sets of queries from three successive TRECVID evaluations. By including concept detectors, we observe a consistent improvement on the search performance, despite the fact that the performance of the individual detectors is still often quite modest.
A Static Method for Detection of Information Theft Malware
Authors: JiaJing Li, Jian Mao, Tao Wei, Wei Zou
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

Existing techniques based on behavior semantics for informationtheft malware detection have the main shortcomings of low pathcoverage and disability of finding hidden malicious behaviors. Inthis paper we propose a static method for the detection ofinformation theft malware to overcome these shortcomings. It isparticularly efficienct for inter-procedure taint analysis, and itis suitable for complicated malware detection, such as Trojan andBot. Its static style makes it able to find hidden maliciousbehaviors. We also present an implementation of our method thatworks on x86 executables and a set of experimental studies validateits good efficiency and effectiveness.
Bilingually motivated domain-adapted word segmentation for statistical machine translation
Authors: Yanjun Ma, Andy Way
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

We introduce a word segmentation approach to languages where word boundaries are not orthographically marked, with application to Phrase-Based Statistical Machine Translation (PB-SMT). Instead of using manually segmented monolingual domain-specific corpora to train segmenters, we make use of bilingual corpora and statistical word alignment techniques. First of all, our approach is adapted for the specific translation task at hand by taking the corresponding source (target) language into account. Secondly, this approach does not rely on manually segmented training data so that it can be automatically adapted for different domains. We evaluate the performance of our segmentation approach on PB-SMT tasks from two domains and demonstrate that our approach scores consistently among the best results across different data conditions.
Protein Secondary Structure Prediction Using Large Margin Methods
Authors: Tang Buzhou, Wang Xuan, Wang Xiaolong
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Protein secondary structure prediction is an important step to understanding protein tertiary structure. Recent studies indicate that the correlation between neighboring secondary structures are beneficial to improve prediction performance. In this paper, we propose a new large margin approach for protein secondary structure prediction, which consider the problem as a sequence labeling problem like probabilistic graphical models. It doesn’t only make full use of the correlation between neighboring secondary structures like graphical chain models, but also shares the key advantages of other SVM-based methods, i.e. learning non-linear discriminate via kernel functions. The experimental results on datasets: CB513 and RS126 show that our algorithm outperforms other state-of-the-art methods.
Curvelet based face recognition via dimension reduction
Authors: Tanaya Mandal, Q. M. Jonathan Wu, Yuan Yuan
Venue: Signal Processing (2009)

Multiresolution ideas, notably the wavelet transform, have been proved quite useful for analyzing the information content of facial images. Numerous papers and research articles have discussed the application of wavelet transform in face recognition. However, little attention has been paid to the newly developed multiresolution tools (contourlet, curvelet, etc.) despite their improved directional elements and other promising abilities compared to traditional wavelet transform. In this article we introduce the application of digital curvelet transform in conjunction with different dimensionality reduction tools, looking particularly at the problem of facial feature extraction from 2D images. The purpose of this paper is exploratory. We do not claim that the results achieved here are the best possible. Rather, we aim at showing that curvelets can serve as an effective alternative to wavelets as a feature extraction tool. This work can be seen as a stepping stone for further research in this direction. Our methods have been evaluated on well-known databases like ORL, Essex Grimace and Yale face. Curvelet based results have been compared with that achieved using wavelets and other existing techniques to show that curvelets indeed has the potential to supersede wavelet based results.
A computer supported learning environment to support pupils with cognitive disabilities and their teachers
Authors: Andreas Lingnau, Peter Zentel
Venue: Proceedings of the 8th international conference on International conference for the learning sciences - Volume 3 (2008)

Although there is no doubt that computers are highly capable to provide pupils with cognitive disabilities in learning we observe an immense lack of professional learning software for this target group. There are few products designed by special education teachers with a high level of instructional design but at a low technical level, unflexible and not adaptable. In contrast there are loads of colorful animated commercial products, mostly designed for primary school pupil and often with absence of any instructional quality. In our project we want to overcome these problems by developing a learning platform which meets the needs of both, the pupils with cognitive disabilities and their teachers. In this interactive presentation will present an overview of this platform and give some examples of good practice as well as latest results of an ongoing study about facilitating communication between pupils with cognitive disabilities using a CSCL setting.
A Tractable Subclass of DTDs for XPath Satisfiability with Sibling Axes
Authors: Yasunori Ishihara, Takuji Morimoto, Shougo Shimizu, Kenji Hashimoto, Toru Fujiwara
Venue: Proceedings of the 12th International Symposium on Database Programming Languages (2009)

The paper presents a tractable subclass of DTDs, called DC-DTDs, for XPath satisfiability with sibling axes. A DC-DTD is a DTD such that each content model is in the form of a concatenation of single tag names and Kleene-starred regular expressions. DC-DTDs are a proper subclass of covering DTDs proposed by Montazerian et al., and a proper superclass of disjunction-free DTDs. In this paper, it is shown that tractability by covering DTDs is fragile against sibling axes. Then, tractability of XPath satisfiability with sibling axes under DC-DTDs is demonstrated. Finally, as a limitation of the tractability of DC-DTDs, it is shown that upward axes appearing in qualifiers bring intractability under even disjunction-free DTDs.
A Distributed Immunization Strategy Based on Autonomy-Oriented Computing
Authors: Jiming Liu, Chao Gao, Ning Zhong
Venue: Proceedings of the 18th International Symposium on Foundations of Intelligent Systems (2009)

In recent years, immunization strategies have been developed for stopping epidemics in complex-network-like environments. So far, it remains to be difficult for the existing strategies to deal with distributed community networks, even though they are ubiquitous in the real world. In this paper, we propose a distributed immunization strategy based on the ideas of self-organization and positive feedback from Autonomy-Oriented Computing (AOC). The AOC-based strategy can effectively be applied to handle large-scale, dynamic networks. Our experimental results have shown that the autonomous entities deployed in this strategy can collectively find and immunize most of the highly-connected nodes in a network within just a few steps.
Particle Swarm Optimization and Differential Evolution in Fuzzy Clustering
Authors: Fengqin Yang, Changhai Zhang, Tieli Sun
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

Fuzzy clustering helps to find natural vague boundaries in data. The fuzzy c-means (FCM) is one of the most popular clustering methods based on minimization of a criterion function because it works fast in most situations. However, it is sensitive to initialization and is easily trapped in local optima. Particle swarm optimization (PSO) and differential evolution (DE) are two promising algorithms for numerical optimization. Two hybrid data clustering algorithms based the two evolution algorithms and the FCM algorithm, called HPSOFCM and HDEFCM respectively, are proposed in this research. The hybrid clustering algorithms make full use of the merits of the evolutionary algorithms and the FCM algorithm. The performances of the HPSOFCM algorithm and the HDEFCM algorithm are compared with those of the FCM algorithm on six data sets. Experimental results indicate the HPSOFCM algorithm and the HDEFCM algorithm can help the FCM algorithm escape from local optima.