ppxscal/embedding_network huggingface dataset:
Synthesis of Hypermedia Using OWL and Jess
Authors: Alberto Machì, Antonino Lo Bue
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

An hypermedia is a spatio-temporal hypertext, namely a collection of media connected by synchronization and linking relations. HyperJessSyn is a tool which uses logic programming and Semantic Web technologies for synthesizing hypermedia according to descriptions of discourse structure and of presentation layout. A rule-based system in Jess applies inference rules to interpret from an OWL graph semantic and navigation relations among media instances, and production rules to turn media contents descriptions in XML/MPEG-7 format in an XMT-A/MPEG-4 hypermedia script via XSL transformations. The system has been used to produce an hyper-guide for virtual visiting a museum.
Technological Trends, Design Constraints and Design Implementation Challenges in Mobile Phone Platforms
Authors: F. Dahlgren
Venue: Proceedings of the 17th international workshop on Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation (2007)

Mobile phones has already become far more than the traditional voice centric device. A large number of capabilities are being integrated into the higher-end phones competing with dedicated devices, including camera, camcorder, music player, positioning, mobile TV, and high-speed internet access. The huge volumes push the employment of the very latest silicon and packaging technologies, with respect taken to cost and high-volume production. While at one hand, the technology allows for integration of more features and higher performance, issues such as low hardware cost requirements, power dissipation, thermal issues, and handling the software complexity are increasingly challenging.
Reconstruction of the Matrix of Causal Dependencies for the Fuzzy Inductive Reasoning Method
Authors: Guido Sangiovanni, Michèle Lavagna
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

Fuzzy Inductive Reasoning (FIR) methodology is a very powerful tool for creating a mixed qualitative-quantitative model of any dynamical system by using its input and output signals. One of the key issue of this methodology is the creation of the mask, i.e. a matrix that contains the causal dependencies among the signals of the systems for particular time steps. This paper describes the ARMS --- Automatic Reconstruction of the Mask Scheme --- methodology that gives the opportunity of creating a sub-optimal mask with very good performances without an exhaustive search in the space of all the possibilities. This methodology has been validated on a wide class of dynamical system (from LTI systems to chaotic time series) and it has been compared to other methods proposed in literature.
A posteriori error estimates for one-dimensional convection-diffussion problems
Authors: R. Vulanovi, G. Hovhannisyan
Venue: Computers Mathematics with Applications (2006)

This paper is concerned with the upwind finite-difference discretization of a quasilinear singularly perturbed boundary value problem without turning points. Kopteva's a posteriori error estimate [1] is generalized and improved.
Modelling coalitions: ATL + argumentation
Authors: Nils Bulling, Jürgen Dix, Carlos I. Chesñevar
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

In the last few years, argumentation frameworks have been successfully applied to multi agent systems. Recently, argumentation has been used to provide a framework for reasoning about coalition formation. At the same time alternating-time temporal logic has been used to reason about the behavior and abilities of coalitions of agents. However, ATL operators account only for the existence of successful strategies of coalitions. They do not consider whether coalitions can be actually formed. This paper is an attempt to combine both frameworks and to develop a logic through which we can reason at the same time (1) about abilities of coalitions of agents and (2) about the formation of coalitions. We provide a formal extension of ATL, ATLc, in which the actual computation of the coalition is modelled in terms of argumentation semantics. We show that ATLc's proof theory can be understood as a natural extension of the model checking procedure used in ATL.
A qualitative study of the electronic commerce process: an emic perspective of electronic commerce entrepreneurs
Authors: David J. Paper
Venue:  (2007)

This research provides an experiential perspective of the process used by successful electronic commerce entrepreneurs. A big picture view or model of the electronic commerce process emerged from over fifty observations, interviews, and follow-up interactions. Observations, interviews, and follow-up interactions provided a rich description of the electronic commerce process elements as well as key interrelationships of process elements. Emergent themes included (a) utilization of e-commerce process, (b) process inter-relationships, (c) fundamental knowledge, skills, and abilities, (d) opportunity assessment, (e) market research, (f) competitive assessment, (g) strategy development, (h) financial development, (i) risk assessment, (j) technical development, (k) web review, (l) technical management, (m) launch and implementation, and (n) on-going innovation. Inter-relationships between the themes were identified and explored.
Competitive buffer management for shared-memory switches
Authors: William Aiello, Alex Kesselman, Yishay Mansour
Venue: ACM Transactions on Algorithms (TALG) (2008)

We consider buffer management policies for shared memory switches. We study the case of overloads resulting in packet loss, where the constraint is the limited shared memory capacity. The goal of the buffer management policy is that of maximizing the number of packets transmitted. The problem is online in nature, and thus we use competitive analysis to measure the performance of the buffer management policies. Our main result is to show that the well-known preemptive Longest Queue Drop (LQD) policy is at most 2-competitive and at least &sqrt;2-competitive. We also demonstrate a general lower bound of 4/3 on the performance of any deterministic online policy. Finally, we consider some other popular non-preemptive policies including Complete Partition, Complete Sharing, Static Threshold and Dynamic Threshold and derive almost tight bounds on their performance.
The Pk Partition Problem and Related Problems in Bipartite Graphs
Authors: Jérôme Monnot, Sophie Toulouse
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

In this paper, we continue the investigation proposed in [15] about the approximability of P k partition problems, but focusing here on their complexity. More precisely, we prove that the problem consisting of deciding if a graph of nk vertices has n vertex disjoint simple paths {P 1, ¿ ,P n } such that each path P i has k vertices is NP-complete, even in bipartite graphs of maximum degree 3. Note that this result also holds when each path P i is chordless in G[V(P i )]. Then, we prove that the optimization version of these problems, denoted by Max P 3 Packing and MaxInduced P 3 Packing, are not in PTAS in bipartite graphs of maximum degree 3. Finally, we propose a 3/2-approximation for Min3-PathPartition in general graphs within O(nm + n 2logn) time and a 1/3 (resp., 1/2)-approximation for MaxW P 3 Packing in general (resp., bipartite) graphs of maximum degree 3 within O(¿(n,3n/2)n) (resp., O(n 2logn)) time, where ¿ is the inverse Ackerman's function and n = |V|, m = |E|.
Creating Individual Based Models of the Plankton Ecosystem
Authors: Wes Hinsley, Tony Field, John Woods
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

The Virtual Ecology Workbench (VEW) is a suite of utilities for creating, executing and analysing biological models of the ocean. At its core is a mathematical language allowing individual plankters to be modelled using equations from laboratory experiments. The language uses conventional mathematical assignments and seven plankton-specific functions. A model consists of a number of different plankton species, each with different behaviour. The compiler produces Java classes which when executed perform a timestep-based, agent-based simulation. Each agent is a Lagrangian Ensemble agent [13] representing a dynamic number of individuals, (a sub-population), that follow the same trajectory. The agents are simulated in a virtual water column that can be anchored, or can drift with ocean currents. This paper shows how the language allows biological oceanographers to create models without the need of conventional programming, the benefits of this approach and some examples of the type of scientific experiments made possible.
Boundary conditions and phase transitions in neural networks. Simulation results
Authors: Jacques Demongeot, Sylvain Sené
Venue: Neural Networks (2008)

This paper gives new simulation results on the asymptotic behaviour of theoretical neural networks on Z and Z^2 following an extended Hopfield law. It specifically focuses on the influence of fixed boundary conditions on such networks. First, we will generalise the theoretical results already obtained for attractive networks in one dimension to more complicated neural networks. Then, we will focus on two-dimensional neural networks. Theoretical results have already been found for the nearest neighbours Ising model in 2D with translation-invariant local isotropic interactions. We will detail what happens for this kind of interaction in neural networks and we will also focus on more complicated interactions, i.e., interactions that are not local, neither isotropic, nor translation-invariant. For all these kinds of interactions, we will show that fixed boundary conditions have significant impacts on the asymptotic behaviour of such networks. These impacts result in the emergence of phase transitions whose geometric shape will be numerically characterised.
Mining Molecular Structure Data for the Patterns of Interactions Between Protein and RNA
Authors: Kyungsook Han, Chirag Nepal
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Mining useful information from a large amount of biological data is becoming important, but most data mining research in bioinformatics is limited to molecular sequence data. We have developed a set of algorithms for analyzing hydrogen bond and van der Waals interactions between protein and RNA. Analysis of the most representative set of protein-RNA complexes revealed several interesting observations: (1) in both hydrogen bond and van der Waals interactions, arginine has the highest interaction propensity, whereas cytosine has the lowest interaction propensity; (2) side chain contacts are more frequent than main chain contacts in amino acids, whereas backbone contacts are more frequent than base contacts in nucleotides; (3) amino acids, in which side chain contacts are dominant, reveal more diverse interaction propensities than nucleotides; and (4) valine rarely binds to any nucleotide. The interaction patterns found in this study should prove useful for determining binding sites in protein-RNA complexes.
Adapting LDA Model to Discover Author-Topic Relations for Email Analysis
Authors: Liqiang Geng, Hao Wang, Xin Wang, Larry Korba
Venue: Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery (2008)

Analyzing the author and topic relations in email corpus is an important issue in both social network analysis and text mining. The Author-Topic model is a statistical model that identifies the author-topic relations. However, in its inference process, it ignores the information at the document level, i.e., the co-occurrence of words within documents are not taken into account in deriving topics. This may not be suitable for email analysis. We propose to adapt the Latent Dirichlet Allocation model for analyzing email corpus. This method takes into account both the author-document relations and the document-topic relations. We use the Author-Topic model as the baseline method and propose measures to compare our method against the Author-Topic model. We did empirical analysis based on experimental results on both simulated data sets and the real Enron email data set to show that our method obtains better performance than the Author-Topic model.
Approximating Optimal Binary Decision Trees
Authors: Micah Adler, Brent Heeringa
Venue: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (2008)

We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T 1, ..., T m ) and a set of n items X = (X 1, ..., X n ). The goal is to output a binary tree where each internal node is a test, each leaf is an item and the total external path length of the tree is minimized. Total external path length is the sum of the depths of all the leaves in the tree. DT has a long history in computer science with applications ranging from medical diagnosis to experiment design. It also generalizes the problem of finding optimal average-case search strategies in partially ordered sets which includes several alphabetic tree problems. Our work decreases the previous upper bound on the approximation ratio by a constant factor. We provide a new analysis of the greedy algorithm that uses a simple accounting scheme to spread the cost of a tree among pairs of items split at a particular node. We conclude by showing that our upper bound also holds for the DT problem with weighted tests.
Spamming botnets: signatures and characteristics
Authors: Yinglian Xie, Fang Yu, Kannan Achan, Rina Panigrahy, Geoff Hulten, Ivan Osipkov
Venue: ACM SIGCOMM Computer Communication Review (2008)

In this paper, we focus on characterizing spamming botnets by leveraging both spam payload and spam server traffic properties. Towards this goal, we developed a spam signature generation framework called AutoRE to detect botnet-based spam emails and botnet membership. AutoRE does not require pre-classified training data or white lists. Moreover, it outputs high quality regular expression signatures that can detect botnet spam with a low false positive rate. Using a three-month sample of emails from Hotmail, AutoRE successfully identified 7,721 botnet-based spam campaigns together with 340,050 unique botnet host IP addresses. Our in-depth analysis of the identified botnets revealed several interesting findings regarding the degree of email obfuscation, properties of botnet IP addresses, sending patterns, and their correlation with network scanning traffic. We believe these observations are useful information in the design of botnet detection schemes.
A New Approach to Secure Logging
Authors: Di Ma, Gene Tsudik
Venue: Proceeedings of the 22nd annual IFIP WG 11.3 working conference on Data and Applications Security (2008)

The need for secure logging is well-understood by the security researchers and practitioners. The ability to efficiently verify all (or some) log entries is important to any application employing secure logging techniques. In this paper, we begin by examining the state-of-the-art in secure logging and identify some problems inherent to systems based on trusted third-party servers. We then propose a different approach based upon recently developed Forward-Secure Sequential Aggregate (FssAgg) authentication techniques. Our approach offers both space-efficiency and provable security. We illustrate two concrete schemes --- one private-verifiable and one public-verifiable --- that offer practical secure logging without any reliance on on-line trusted third parties or secure hardware. We evaluate proposed schemes and report on our experience with implementing them within a secure logging system.
Age Invaders: User Studies of Intergenerational Computer Entertainment
Authors: Eng Tat Khoo, Tim Merritt, Adrian Cheok, Mervyn Lian, Kelvin Yeo
Venue: Proceedings of the 6th international conference on Entertainment Computing (2007)

The design goal of the Age Invaders system is to make a mixed reality interaction platform that can facilitate meaningful social interaction with players, from many backgrounds and demographics, at appropriate levels of physical exertion for their age. This paper discusses a multidisciplinary approach to analyzing the user experience and reassessment of the context of use of the Age Invaders system. This paper tests the effectiveness of the system in promoting the intended design goals and the results show strong support for intergenerational interaction using digital technology. Additionally, the results of the study help to focus the refinements of the existing platform and development of further novel games and interactive applications for this mixed reality system, and provide insights into the user in complex mixed reality experiences.
On the Security of Steganographic Techniques
Authors: Junhui He, Shaohua Tang, Tingting Wu
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

Steganographic technique is a means of covert communication and needs to satisfy two basic requirements--good security and high hiding capacity. The capacity of different hiding algorithms may be compared directly, but there are few methods suitable for analyzing their security. In this paper, the DC and AC DCT coefficients of an image are fitted with Gaussian density and generalized Gaussian density respectively. And a model is established to evaluate the security of steganographic techniques. Experimental results are provided as the model's application to the analysis of the security of the popular embedding techniques in both spatial and DCT domain.
A Unified Approach to Related-Key Attacks
Authors: Eli Biham, Orr Dunkelman, Nathan Keller
Venue: Fast Software Encryption: 15th International Workshop, FSE 2008, Lausanne, Switzerland, February 10-13, 2008, Revised Selected Papers (2008)

This paper introduces a new framework and a generalization of the various flavors of related-key attacks. The new framework allows for combining all the previous related-key attacks into a complex, but much more powerful attack. The new attack is independent of the number of rounds of the cipher. This property holds even when the round functions of the cipher use different subkeys.The strength of our new method is demonstrated by an attack on 4r-round IDEA, for any r. This attack is the first attack on a widely deployed block cipher which is independent of the number of rounds. The variant of the attack with r = 2 is the first known attack on 8-round IDEA.
Combining reason and authority for authorization of proof-carrying code
Authors: Martin Abadi
Venue:  (2008)

Using both reason and authority as strategies for code authorization is desirable, possible, and practical. We present BCIC, a system that combines an authorization logic based on the Binder language with CIC, a logical framework able to express semantic properties of programs. BCIC is a general system for specifying and enforcing policies that rely on both reason and authority. In particular, BCIC supports extensible software systems that employ both digitally signed code and language-based security, including proof-carrying code. We describe BCIC, establish some of its fundamental properties, and explain its use. We develop a series of examples at varying levels of detail to demonstrate our system in action and explain what types of benefits it provides. We include an example for auditing system calls, an example that includes a type system for tracking trust in the &lambda;-calculus, and an example showing a limited form of control-flow integrity for x86 machine code. To allow policy writers to extend the language of BCIC we also explain how proof-by-computation works in BCIC, and demonstrate how decision procedures for predicates can be embedded in policies. Such decision procedures work with utilitarian data structures and can also be used to perform automatic static analysis of programs within the policy. To obtain high assurance that our reference monitor is correct, we have created a certified implementation of BCIC using program extraction from our Coq proofs of decidability of BCIC. Along the way we also extract certified implementations for Datalog and Binder, useful in their own right.
Introducing Architecture-Centric Reuse into a Small Development Organization
Authors: Hans-Jörg Beyer, Dirk Hein, Clemens Schitter, Jens Knodel, Dirk Muthig, Matthias Naab
Venue: Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems (2008)

Reuse promises cost-effective development and maintenance of software systems. Profiting from reuse, however, requires an upfront investment into creating building blocks to be reused by applications. When therefore required resources are limited, creating reusable building blocks practically often means migrating existing software assets into reusable components while concurrently realizing new developments. This pragmatic approach, which is especially often found in small organizations, often frustrates the vision of successful reuse across similar products.This paper, however, presents a success story of iteratively introducing architecture-centric development at Wikon GmbH. This small German company develops remote monitoring and controlling devices with a small team of three engineers only. The presented approach for adopting systematic reuse eventually reduced effort for development and testing by more than 35% without any decline in quality.
The On-Line Encyclopedia of Integer Sequences
Authors: Neil J. Sloane
Venue: Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference (2007)

The On-Line Encyclopedia of Integer Sequences (or OEIS) is a database of some 130000 number sequences. It is freely available on the Web (http://www.research.att.com/~njas/sequences/) and is widely used.There are several ways in which it benefits research: 1It serves as a dictionary, to tell the user what is known about a particular sequence. There are hundreds of papers which thank the OEIS for assistance in this way.1The associated Sequence Fans mailing list is a worldwide network which has evolved into a powerful machine for tackling new problems.1As a direct source of new theorems, when a sequence arises in two different contexts.1As a source of new research, when one sees a sequence in the OEIS that cries out to be analyzed.The 40-year history of the OEIS recapitulates the story of modern computing, from punched cards to the internet.The talk will be illustrated with numerous examples, emphasizing new sequences that have arrived in the past few months. Many open problems will be mentioned.Because of the profusion of books and journals, volunteers play an important role in maintaining the database. If you come across an interesting number sequence in a book, journal or web site, please send it and the reference to the OEIS. (You do not need to be the author of the sequence to do this.) There is a web site for sending in "Comments" or "New sequences".Several new features have been added to the OEIS in the past year. Thanks to the work of Russ Cox, searches are now performed at high speed, and thanks to the work of Debby Swayne, there is a button which displays plots of each sequence. Finally, a "listen" button enables one to hear the sequence played on a musical instrument (try Recamáan's sequence A005132!).