ppxscal/embedding_network huggingface dataset:
Concept analysis via rough set and AFS algebra
Authors: Lidong Wang, Xiaodong Liu
Venue: Information Sciences: an International Journal (2008)

Formal concept analysis (FCA) was originally proposed by Wille (1982), which is an important theory for data analysis and knowledge discovery. AFS (axiomatic fuzzy set) algebra was proposed by Liu [X. Liu, The fuzzy theory based on AFS algebras and AFS structure, Journal of Mathematical Analysis and Applications 217 (1998) 459-478; X. Liu, The topology on AFS algebra and AFS structure, Journal of Mathematical Analysis and Applications 217 (1998) 479-489], which is a semantic methodology relating to the fuzzy theory. Combining above two theories, we propose AFS formal concept, which can be viewed as the generalization and development of monotone concept proposed by Deogun and Saquer (2003). Moreover, we show that the set of all AFS formal concepts forms a complete lattice. AFS formal concept can be applied to represent the logic operations of queries in information retrieval. Furthermore, we give an approach to find the AFS formal concepts whose intents (extents) approximate any element of AFS algebra by virtue of rough set theory.
Towards Describing Multi-fractality of Traffic Using Local Hurst Function
Authors: Ming Li, S. C. Lim, Bai-Jiong Hu, Huamin Feng
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

Long-range dependence and self-similarity are two basic properties of network traffic time series. Fractional Brownian motion (fBm) and its increment process fractional Gaussian noise (fGn) are commonly used to model network traffic with the Hurst index H that determines both the regularity of the sample paths and the long memory property of traffic. However, it appears too restrictive for traffic modeling since it can only model sample paths with the same smoothness for all time parameterized by a constant H. A natural extension of fBm is multifractional Brownian motion (mBm), which is indexed by a time-dependent Hurst index H(t). The main objective of this paper is to model multi-fractality of traffic using H(t), i.e., mBm, on a point-by-point basis instead of an interval-by-interval basis as traditionally done in computer networks. The numerical results for H(t) of real traffic, which are demonstrated in this paper, show that H(t) of traffic is time-dependent, which not only provide an alternative evidence of the multifractal phenomena of traffic but also reveal an challenging issue in traffic modeling: multi-fractality modeling of traffic.
Aspects and Formal Methods
Authors: Shmuel Katz
Venue: Proceedings of the 15th international symposium on Formal Methods (2008)

Aspects are now commonly used to add functionality that otherwise would cut across the structure of object systems. In this survey, both directions in the connection between aspects and formal methods are examined. On the one hand, the use of aspects to facilitate (general) software verification, and especially model checking, is demonstrated. On the other hand, the new challenges to formal specification and verification posed by aspects are defined, and several existing solutions are described.
Joint Source-Channel Decoding ASIP Architecture for Sensor Networks
Authors: Pablo Ituero, Gorka Landaburu, Javier Ser, Marisa López-Vallejo, Pedro M. Crespo, Vicente Atxa, Jon Altuna
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

In a sensor network, exploiting the correlation among different sources allows a significant reduction of the transmitted energy at the cost of a complex decoder scheme. This paper introduces the first hardware implementation for joint source-channel decoding of correlated sources. Specifically, a dual-clustered VLIW processor with a highly optimized datapath is presented.
Partnership Selection of Agile Virtual Enterprise Based on Grey Ant Colony Algorithm
Authors: Y. D. Fang, L. H. Du, H. Chen, B. Sun, Y. L. He
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

The paper analyzes the art of partner selection, and enumerates the advantage of partnership selection based on grey relation theory and ant colony algorithm. Furthermore, evaluation framework of agile virtual enterprise (AVE) partner pre-election is analyzed and designed based on the characteristics of AVE. According to grey relation theory, considerable candidate enterprises are selected to reduce the size of problem. Lastly, cooperative enterprise selecting path is decided by making use of ant colony algorithm in terms of transportation cost.
Switching dynamics of multi-agent learning
Authors: Peter Vrancx, Karl Tuyls, Ronald Westra
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

This paper presents the dynamics of multi-agent reinforcement learning in multiple state problems. We extend previous work that formally modelled the relation between reinforcement learning agents and replicator dynamics in stateless multi-agent games. More precisely, in this work we use a combination of replicator dynamics and switching dynamics to model multi-agent learning automata in multi-state games. This is the first time that the dynamics of problems with more than one state is considered with replicator equations. Previously, it was unclear how the replicator dynamics of stateless games had to be extended to account for multiple states. We use our model to visualize the basin of attraction of the learning agents and the boundaries of switching dynamics at which an agent possibly arrives in a new dynamical system. Our model allows to analyze and predict the behavior of the different learning agents in a wide variety of multi-state problems. In our experiments we illustrate this powerful method in two games with two agents and two states.
Animating Unstructured 3D Hand Models
Authors: Jituo Li, Li Bai, Yangsheng Wang
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

We present a novel approach for automatically animating unstructured hand models. Skeletons of the hand models are automatically extracted. Local frames on hand skeletons are created to skin and animate hand models. Self-intersection of hand surfaces is avoided. Our method produces realistic hand animation efficiently.
The emerging Internet governance mosaic: connecting the pieces
Authors: William H. Dutton, Malcolm Peltu
Venue: Information Polity (2007)

The report highlights key Internet governance issues raised in relation to the authors' three-tier typology. The distinctive design and governance characteristics that underpin the global Internet phenomenon are then outlined, to indicate valuable governance lessons that can be built on. The crucial need for balance in inherently political multi-stakeholder processes is then addressed. This is assisted by an analytical framework for understanding the dynamics underlying such processes, which involve outcomes from decisions taken by many actors within overlapping and interacting policy arenas. The conclusion recommends an approach to improving international coordination of Internet governance activities.
Delivery Infrastructure for Secure Scalable Coded Multimedia
Authors: Markus Dunte, Christoph Ruland
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

The fast growing progress in data communication leads to a wide variety of available access technologies that provide everything from mobile data transfer to high-speed data links using fibre optics. Due to this fact multimedia contents, which have to be transmitted, have to be adapted every time the connection parameters are changing. Fortunately, modern video coding standards are able to deliver one multimedia signal in a scalable manner where various representations can be extracted to fit a wide range of applications. Commonly known standards such as MPEG-4 and H.264 are designed to provide a nearly perfect trade-off between quality and data rates. The other side of the coin is that none of these modern video-coding algorithms is implementing any security features that will prevent unauthorised access. Therefore, this paper will first briefly examine modern coding algorithms and techniques. Having finished analysis, a communication infrastructure set-up for improved multimedia delivery will be presented along with a cryptographic concept that prevents unauthorised access and perfectly fits into the system. Finally, a conclusion will be given.
On Regularity-Preservation by String-Rewriting Systems
Authors: Peter Leupold
Venue: Language and Automata Theory and Applications: Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers (2008)

When using string-rewriting systems in the context of formal languages, one of the most common questions is whether they preserve regularity. A class of string-rewriting systems that has received attention lately are idempotency relations. They were mainly used to generate languages starting from a single word.Here we apply these relations to entire languages and investigate whether they preserve regularity. For this, it turns out to be convenient to define two more general classes of string-rewriting systems, the k-period expanding and the k-period reducing ones. We show that both preserve regularity. This implies regularity preservation for many classes of idempotency relations.
MaLARea SG1 - Machine Learner for Automated Reasoning with Semantic Guidance
Authors: Josef Urban, Geoff Sutcliffe, Petr Pudlák, Jiří Vyskočil
Venue: Proceedings of the 4th international joint conference on Automated Reasoning (2008)

This paper describes a system combining model-based and learning-based methods for automated reasoning in large theories, i.e. on a large number of problems that use many axioms, lemmas, theorems, definitions, and symbols, in a consistent fashion. The implementation is based on the existing MaLARea system, which cycles between theorem proving attempts and learning axiom relevance from successes. This system is extended by taking into account semantic relevance of axioms, in a way similar to that of the SRASS system. The resulting combined system significantly outperforms both MaLARea and SRASS on the MPTP Challenge large theory benchmark, in terms of both the number of problems solved and the time taken to find solutions. The design, implementation, and experimental testing of the system are described here.
A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort
Authors: Jun Furukawa, Frederik Armknecht, Kaoru Kurosawa
Venue: Proceedings of the 6th international conference on Security and Cryptography for Networks (2008)

The universal composability (UC) framework by Canetti [15] is a general-purpose framework for designing secure protocols. It ensures the security of UC-secure protocols under arbitrary compositions. As key exchange protocols (KEs) belong to the most used cryptographic mechanisms, some research has been done on UC-secure 2-party KEs. However, the only result regarding UC-secure group key exchange protocols (GKEs) is a generic method presented by Katz and Shin [35]. It allows to turn any GKE protocol that fulfills certain security requirements into a UC-secure variant. This yields GKE protocols which require at least five communication rounds in practice when no session identities are provided by external mechanisms. Up to now, no effort has been taken to design dedicated UC-secure GKE protocols with a lower communication complexity.In this paper, we propose a new UC-secure GKE which needs only two rounds. We show that two is the minimum possible number of rounds and that any 2-round UC-secure GKE requires at least as many messages as our protocol. The proof of security relies on a new assumption which is a combination of the decision bilinear Diffie-Hellman assumption and the linear Diffie-Hellman assumption.
Quantum communication complexity and nonlocality of bipartite quantum operations
Authors: Yaoyun Shi
Venue:  (2008)

This dissertation is motivated by the following fundamental questions: (a) are there any exponential gaps between quantum and classical communication complexities? (b) what is the role of entanglement in assisting quantum communications? (c) how to characterize the nonlocality of quantum operations? We study four specific problems below. The communication complexity of the Hamming Distance problem . The HAMMING DISTANCE problem is for two parties to determine whether or not the Hamming distance between two n-bit strings is more than a given threshold. We prove tighter quantum lower bounds in the general two-party, interactive communication model. We also construct an efficient classical protocol in the more restricted Simultaneous Message Passing model, improving previous results. The Log-Equivalence Conjecture. A major open problem in communication complexity is whether or not quantum protocols can be exponentially more efficient than classical ones for computing a total Boolean function in the two-party, interactive model. The answer is believed to be "No". Razborov proved this conjecture for the most general class of functions so far. We prove this conjecture for a broader class of functions that we called block-composed functions. Our proof appears to be the first demonstration of the dual approach of the polynomial method in proving new results. Classical simulations of bipartite quantum measurement. We define a new concept that measures the nonlocality of bipartite quantum operations. From this measure, we derive an upper bound that shows the limitation of entanglement in reducing communication costs. As applications, we show that (a) if the amount of communication is constant, quantum and classical communication protocols with an unlimited amount of shared entanglement or shared randomness compute the same set of functions; (b) a local hidden variable model needs only a constant amount of communication to create, within an arbitrarily small statistical distance, a distribution resulting from local measurements of an entangled quantum state, as long as the number of measurement outcomes is constant. The maximum tensor norm of bipartite superoperators. We define a maximum tensor norm to quantify the nonlocality of bipartite superoperators. We show that a bipartite physically realizable superoperator is bi-local if and only if its maximum tensor norm is 1. Furthermore, the estimation of the maximum tensor norm can also be used to prove quantum lower bounds on communication complexities.
A Unique Complexity Metric
Authors: Sanjay Misra, Ibrahim Akman
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

Metrics, in general, are defined as "a quantitative measure of the degree to which a system, component, or process possesses a given attribute". Complexity metrics are used to predict critical information about reliability and maintainability of software systems. This paper proposes complexity metric, which includes all major factors responsible for complexity. We validated our metric against the principles of measurement theory since the measurement theory has been proposed and extensively used in the literature as a means to evaluate the software engineering metrics. The scale of the metric is investigated through Extensive structure. It is found that the proposed measure is on ratio scale. The applicability of the proposed measure is tested through test cases and comparative study.
Towards Model-Driven Development of Hard Real-Time Systems
Authors: Christian Ferdinand, Reinhold Heckmann, Hans-Jörg Wolff, Christian Renz, Oleg Parshin, Reinhard Wilhelm
Venue: Model-Driven Development of Reliable Automotive Services: Second Automotive Software Workshop, ASWSD 2006, San Diego, CA, USA, March 15-17, 2006, Revised Selected Papers (2006)

Software developers in the automotive sector must achieve high quality objectives. Many design and implementation errors are avoided by synthesizing code from model-based software specifications using automatic code generators such as ETAS' ASCET. To verify non-functional properties of the implementation, model-based design processes should be complemented with static program analysis tools like AbsInt's StackAnalyzer and timing analyzer aiT. ASCET, StackAnalyzer and aiT can be integrated in a way that the aiT/StackAnalyzer analysis results for code generated by ASCET are conveniently accessible from within the ASCET development environment. This gives ASCET users a direct feedback on the effects of their design decisions on resource usage, allowing them to select more efficient designs and implementation methods. In the paper, we present the tools, the experimental integration, preliminary results and plans for further tool integration.
Automatic Decision-Oriented Mapping of Pollution Data
Authors: Mikhail Kanevski, Vadim Timonin, Alexei Pozdnoukhov
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

The paper deals with the development and application of the methodology for automatic mapping of pollution/contamination data. General Regression Neural Network (GRNN) is considered in detail and is proposed as an efficient tool to solve this problem. The automatic tuning of isotropic and an anisotropic GRNN model using cross-validation procedure is presented. Results are compared with k-nearest-neighbours interpolation algorithm using independent validation data set. Quality of mapping is controlled by the analysis of raw data and the residuals using variography. Maps of probabilities of exceeding a given decision level and "thick" isoline visualization of the uncertainties are presented as examples of decision-oriented mapping. Real case study is based on mapping of radioactively contaminated territories.
Grounded Representation Driven Robot Motion Design
Authors: Michael Trieu, Mary-Anne Williams
Venue: RoboCup 2007: Robot Soccer World Cup XI (2008)

Grounding robot representations is an important problem in Artificial Intelligence. In this paper we show how a new grounding framework guided the development of an improved locomotion engine [3] for the AIBO. The improvements stemmed from higher quality representations that were grounded better than those in the previous system [1]. Since the AIBO is more grounded under the new locomotion engine it makes better decisions and achieves its design goals more efficiently. Furthermore, a well grounded robot offers significant software engineering benefits since its behaviours can be developed, debugged and tested more effectively.
Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
Authors: Hans L. Bodlaender, Richard B. Tan, Thomas C. Dijk, Jan Leeuwen
Venue: Proceedings of the 11th Scandinavian workshop on Algorithm Theory (2008)

We study the integer maximum flow problem on wireless sensor networks with energy constraint. In this problem, sensor nodes gather data and then relay them to a base station, before they run out of battery power. Packets are considered as integral units and not splittable. The problem is to find the maximum data flow in the sensor network subject to the energy constraint of the sensors. We show that this integral version of the problem is strongly NP-complete and in fact APX-hard. It follows that the problem is unlikely to have a polynomial time approximation scheme. Even when restricted to graphs with concrete geometrically defined connectivity and transmission costs, the problem is still strongly NP-complete. We provide some interesting polynomial time algorithms that give good approximations for the general case nonetheless. For networks of bounded treewidth greater than two, we show that the problem is weakly NP-complete and provide pseudo-polynomial time algorithms. For a special case of graphs with treewidth two, we give a polynomial time algorithm.
Context Sensitive Paraphrasing with a Global Unsupervised Classifier
Authors: Michael Connor, Dan Roth
Venue: Proceedings of the 18th European conference on Machine Learning (2007)

Lexical paraphrasing is an inherently context sensitive problem because a word's meaning depends on context. Most paraphrasing work finds patterns and templates that can replace other patterns or templates in some context, but we are attempting to make decisions for a specific context. In this paper we develop a global classifier that takes a word v and its context, along with a candidate word u, and determines whether u can replace v in the given context while maintaining the original meaning.We develop an unsupervised, bootstrapped, learning approach to this problem. Key to our approach is the use of a very large amount of unlabeled data to derive a reliable supervision signal that is then used to train a supervised learning algorithm. We demonstrate that our approach performs significantly better than state-of-the-art paraphrasing approaches, and generalizes well to unseen pairs of words.
A Large Neighborhood Search Heuristic for Graph Coloring
Authors: Michael A. Trick, Hakan Yildiz
Venue: Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2007)

We propose a new local search heuristic for graph coloring that searches very large neighborhoods. The heuristic is based on solving a MAX-CUT problem at each step. While the MAX-CUT problem is formally hard, fast heuristics that give "good" cuts are available to solve this. We provide computational results on benchmark instances. The proposed approach is based on similar heuristics used in computer vision.
Proving Termination by Bounded Increase
Authors: Jürgen Giesl, René Thiemann, Stephan Swiderski, Peter Schneider-Kamp
Venue: Proceedings of the 21st international conference on Automated Deduction: Automated Deduction (2007)

Most methods for termination analysis of term rewrite systems (TRSs) essentially try to find arguments of functions that decrease in recursive calls. However, they fail if the reason for termination is that an argument is increased in recursive calls repeatedly until it reaches a bound. In this paper, we solve that problem and show how to prove innermost termination of TRSs with bounded increase automatically.