ppxscal/embedding_network huggingface dataset:
Media, Politics and the Semantic Web
Authors: Wouter Atteveldt, Stefan Schlobach, Frank Harmelen
Venue: Proceedings of the 4th European conference on The Semantic Web: Research and Applications (2007)

The media play an important role in the functioning of our society. This role is extensively studied by Communication Scientists, requiring a systematic analysis of media content. The methods developed in this field utilize complex data models and background knowledge. This data is generally represented ad hoc, making it difficult to analyze, combine and share data sets.In this paper we present our work on formalizing this representation using RDF(S). We discuss the requirements for a good representation, highlighting a number of non-trivial modeling decisions. We conclude with a description of the resulting system and the benefits for a recent investigation of the 2006 Dutch parliamentary campaign. This case study shows concrete improvements for annotating, querying, and analyzing data, but also indicates a number of aspects that were more difficult to model in RDF(S), contributing to the discussion on modeling with and improving RDF(S) and associated tools.
An Approach for Developing Service Oriented Product Lines
Authors: Jaejoon Lee, Dirk Muthig, Matthias Naab
Venue: Proceedings of the 2008 12th International Software Product Line Conference (2008)

Service Orientation (SO) is a relevant promising candidate for accommodating rapidly changing user needs and expectations. Adopting SO in practice for real software and system development, however, has uncovered several chal-lenging issues, such as how to identify services, determining configurations of services that are relevant to users' current context, and maintaining system integrity after configuration changes. In this paper, we propose a method that addresses these issues by adapting a feature-oriented product line engineering approach. Our method is based on the feature analysis technique that enables us to identify services of a service oriented system. The method is notable in that it guides developers to identify services at the right level of granularity, to map users' context to relevant ser-vice configuration, and to maintain system integrity in terms of invariants and pre/post conditions of services. We also propose a heterogeneous style based architecture model for developing such systems.
Mitigating cmp memory wall by accurate data prefetching and on-chip storage optimization
Authors: Jih-Kwon Peir
Venue:  (2007)

Chip-Multiprocessors (CMPs) are becoming ubiquitous. With the processor feature size continuing to decrease, the number of cores in CMPs increases dramatically. To sustain the increasing chip-level power in many-core CMPs, tremendous pressures will be put on the memory hierarchy to supply instructions and data in a timely fashion. The dissertation develops several techniques to address the critical issues in bridging the CPU memory performance gap in CMPs. An accurate, low-overhead data prefetching on CMPs has been proposed based on a unique observation of coterminous groups, highly repeated close-by off-chip memory accesses with equal reuse distances. The reuse distance of a memory reference is defined to be the number of distinct memory blocks between this memory reference and the previous reference to the same block. When a member in the coterminous group is accessed, the other members will likely be accessed in the near future. Coterminous groups are captured in a small table for accurate data prefetching. Performance evaluation demonstrates 10% IPC improvement for a wide variety of SPEC2000 workload mixes. It is appealing for future many-core CMPs due to its high accuracy and low overhead. Optimizing limited on-chip cache space is essential for improving memory hierarchy performance. Accurate simulation of cache optimization for many-core CMPs is a challenge due to its complexity and simulation time. An analytical model is developed for fast estimating the performance of data replication in CMP caches. We also develop a single-pass global stack simulation for more detailed study of the tradeoff between the capacity and access latency in CMP caches. A wide-spectrum of the cache design space can be explored in a single simulation pass with high accuracy. Maintaining cache coherence in future many-core CMPs presents difficult design challenges. The snooping-bus-based method and traditional directory protocols are not suitable for many-core CMPs. We investigate a new set-associative CMP coherence with small associativity, augmented with a Directory Lookaside Table (DLT) that allows blocks to be displaced from their primary sets for alleviating hot-set conflicts that cause unwanted block invalidations. Performance shows 6%-10% IPC improvement for both multiprogrammed and multithreaded workloads.
On topology creation for an indoor wireless grid
Authors: Gautam D. Bhanage, Yanyong Zhang, Ivan Seskar
Venue: Proceedings of the third ACM international workshop on Wireless network testbeds, experimental evaluation and characterization (2008)

Most space constrained indoor wireless testbeds have majority of the nodes under a single collision domain. Emulation of multi-hop topologies on such testbeds is usually achieved either through the use of additional hardware like external noise injection or software techniques such as MAC frame filtering. We show that while these two techniques are able to create simple scenarios, creating large-scale, realistic topologies remains a challenge. In this paper, we propose and implement a Bursty PER filtering mechanism, which can filter packets on a link according to preset PER in the software domain. We first show that this new method can provide a better support for fine-grained link PER and localized link control. Further, we show that it is possible to create large scale topologies (of the order of 100nodes). We substantiate our claims by empirical evaluation on the ORBIT indoor wireless testbed.
Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement
Authors: Zhi-Zhong Chen, Ruka Tanahashi
Venue: Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management (2008)

We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of $\frac{24}{29}=0.827586\ldots$. This improves on the previous best ratio of $\frac{468}{575}=0.813913\ldots$.
CIL3D: a content-based 3D model search engine
Authors: Panagiotis Papadakis, Ioannis Pratikakis, Stavros Perantonis, Theoharis Theoharis
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

We present a prototype 3D model search engine called CIL3D (Computational Intelligence Laboratory 3D). CIL3D provides query-by-content 3D model search, by employing a state-of-the-art method [1] for the description of a 3D model, attaining top performance. The search engine is publicly accessible through the internet at: http://emedi3.emedi.iit.demokritos.gr/cil3d/.
Proximity Scoring Using Sentence-Based Inverted Index for Practical Full-Text Search
Authors: Yukio Uematsu, Takafumi Inoue, Kengo Fujioka, Ryoji Kataoka, Hayato Ohwada
Venue: Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries (2008)

We propose a search method that uses sentence-based inverted indexes to achieve high accuracy at practical speeds. The proposed method well supports the vast majority of queries entered on the web; these queries contain single words, multiple words for proximity searches, and semantically direct phrases. The existing approach, the inverted index which holds word-level position data is not efficient, because the size of index becomes extremely large. Our solution is to drop the word position data and index only the existence of each word in each sentence. We incorporate the sentence-based inverted index into a commercial search engine and evaluate it using both Japanese and English standard IR corpuses. The experiment shows that our method offers high accuracy, while index size and search processing time are greatly reduced.
Plant Simulation Based on Fusion of L-System and IFS
Authors: Jinshu Han
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

In this paper, we present a novel plant simulation method based on fusion of L-system and iteration function system (IFS). In this method, the production rulers and parallel rewriting principle of L-system are used to simulate and control the development and topological structure of a plant, and IFS fractal graphics with controllable parameters and plenty subtle texture are employed to simulate the plant components, so that the merits of both techniques can be combined. Moreover, an improved L-system algorithm based on separating steps is used for the convenient implementation of the proposed fusing method. The simulation results show that the presented method can simulate various plants much more freely, realistically and naturally.
A Neuro-Immune Algorithm to Solve the Capacitated Vehicle Routing Problem
Authors: Thiago A. Masutti, Leandro N. Castro
Venue: Proceedings of the 7th international conference on Artificial Immune Systems (2008)

Some features of a large number of combinatorial optimization problems prevent the use of exact solution methods, thus requiring the application of heuristic techniques to find good solutions, not always the optimal ones, in a feasible amount of time. This paper describes a heuristic approach, which is a hybrid between artificial neural networks and artificial immune systems, to solve the capacitated vehicle routing problem. This algorithm is based on a competitive model, which does not use a cost or evaluation function to determine the quality of the solution proposed. Despite this apparent drawback, the set of tests conducted with the proposed approach indicates a good performance of the algorithm when compared with similar works from the literature and the known best solutions available.
A Platform for OnBoard Credentials
Authors: N. Asokan, Jan-Erik Ekberg
Venue: Financial Cryptography and Data Security: 12th International Conference, FC 2008, Cozumel, Mexico, January 28-31, 2008. Revised Selected Papers (2008)

Securely storing and using credentials for authentication is an essential part of protecting financial applications like on-line banking and other distributed applications. Existing approaches fall short: Requiring users to memorize credentials suffers from bad usability and is vulnerable to phishing. "Password managers" ease the usability problem somewhat, but are open to software attacks, like Trojans that steal passwords. At the other extreme, dedicated hardware tokens provide high levels of security, but are expensive and not very flexible. We observe that general-purpose secure hardware are becoming widely available and use them to develop a platform for "OnBoard Credentials" (ObCs) which combine the flexibility of virtual credentials with the higher levels of protection due to the use of secure hardware.
Efficient GTS Allocation Algorithm for IEEE 802.15.4
Authors: Youngmin Ji, Woojin Park, Sungjun Kim, Sunshin An
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

Recently issued standard IEEE 802.15.4 is a novel standard to achieve some critical features of wireless sensor networks. In this paper, we propose the algorithm to allocate GTSs according to the packet arrival rate from end devices and the number of devices in beacon enabled mode of IEEE 802.15.4 star topology networks. From simulation results, we show that our proposed algorithm enhances throughput comparing with the original IEEE 802.15.4 that uses only CAP duration for transmission.
Provably Correct Runtime Monitoring
Authors: Irem Aktug, Mads Dam, Dilian Gurov
Venue: Proceedings of the 15th international symposium on Formal Methods (2008)

Runtime monitoring is an established technique for enforcing a wide range of program safety and security properties. We present a formalization of monitoring and monitor inlining, for the Java Virtual Machine. Monitors are security automata given in a special-purpose monitor specification language, ConSpec. The automata operate on finite or infinite strings of calls to a fixed API, allowing local dependencies on parameter values and heap content. We use a two-level class file annotation scheme to characterize two key properties: (i) that the program is correct with respect to the monitor as a constraint on allowed program behavior, and (ii) that the program has an instance of the given monitor embedded into it, which yields state changes at prescribed points according to the monitor's transition function. As our main application of these results we describe a concrete inliner, and use the annotation scheme to characterize its correctness. For this inliner, correctness of the level II annotations can be decided efficiently by a weakest precondition annotation checker, thus allowing on-device checking of inlining correctness in a proof-carrying code setting.
Real Emotion Is Dynamic and Interactive
Authors: Margaret Mcrorie, Ian Sneddon
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

This paper discusses a data driven pilot study, designed to explore the expression of emotion in a natural situation.Short sequences of natural behaviour were transformed into still photos and compared with examples of acted behaviour using a FeelTrace type analysis. Results indicate that rapid transitions are more common in natural than in acted behaviour.
If you measure it they will score: An assessment of international eGovernment benchmarking
Authors: Davy Janssen, Sabine Rotthier, Kris Snijkers
Venue: Information Polity (2004)

In this article we expound on the possible effects of eGovernment evaluation studies on countries' eGovernment policy. Performance measurement and benchmarking are two well-known tools for policy evaluation and feedback. Performance information has a supply side as well as a demand side, which do not necessarily match. In the eGovernment sphere we notice a large supply of performance information. We ask ourselves to which degree this supply meets an actual demand from governments. We discuss the results of a thorough analysis of 18 international comparative eGovernment studies and warn for an unreflective feedback of these studies' results in countries' eGovernment policies.
An Algorithm for Qualitative Simulation of Gene Regulatory Networks with Steep Sigmoidal Response Functions
Authors: Liliana Ironi, Luigi Panzeri, Erik Plahte
Venue: Proceedings of the 3rd international conference on Algebraic Biology (2008)

A specific class of odes has been shown to be adequate to describe the essential features of the complex dynamics of gene-regulatory networks (grn). But, the effective exploitation of such models to predict the dynamics of specific grns by classical numerical schemes is greatly hampered by the current lack of precise and quantitative information on regulation mechanisms and kinetic parameters. Due to the size and complexity of large grns, classical qualitative analysis could be very hard, or even impracticable, to be carried out by hand, and conventional qualitative simulation approaches rapidly lead to an exponential growth of the generated behavior tree that, besides all possible sound behaviors, may also contain spurious ones. This paper discusses the work-in-progress of a research effort aiming at the design and implementation of a computational framework for qualitative simulation of the dynamics of a class of ode models of grns. The algorithm we propose results from a set of symbolic computation algorithms that carry out the integration of qualitative reasoning techniques with singular perturbation analysis methods. The former techniques allow us to cope with uncertain and incomplete knowledge whereas the latter ones lay the mathematical groundwork for a sound and complete algorithm capable to deal with regulation processes that occur at different time scales.
A Common Basis for Agent Organisation in BDI Languages
Authors: Anthony Hepple, Louise Dennis, Michael Fisher
Venue: Languages, Methodologies and Development Tools for Multi-Agent Systems: First International Workshop, LADS 2007, Durham, UK, September 4-6, 2007. Revised Selected Papers (2008)

Programming languages based on the BDI style of agent model are now common. Within these there appears to be some, limited, agreement on the core functionality of agents. However, when we come to multi-agent organisations, not only do many BDI languages have no specific organisational structures, but those that do exist are very diverse. In this paper, we aim to provide a unifying framework for the core aspects of agent organisation, covering groups, teams and roles, as well as organisations. Thus, we describe a simple organisational mechanism, and show how several well known approaches can be embedded within it. Although the mechanism we use is derived from the MetateM programming language, we do not assume any specific BDI language. The organisational mechanism is intended to be independent of the underlying agent language and so we aim to provide a common core for future developments in agent organisation.
Temperature-Variation Fault Diagnosis of the High-Voltage Electric Equipment Based on the BP Neural Network
Authors: Zhen-Yu Wang, Yong-Wei Li, Peng Guo, Xiao-Fang Yu
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

As high-voltage electric equipment has complex structure and works in harsh environment, this paper is aimed at applying Optical Fiber Sensors to a temperature-variation fault diagnosis system of high-voltage electric equipment based on the combination of neural network and expert system. Neural network has the characteristics of self-adapted, distributed storage and associative memory. Using BP neural network, we can make on-line diagnosis of temperature-variation fault of high-voltage electric equipment. All the uses above can increase the speed of diagnosis and make results be more exact.
Specifying and Verifying Web Transactions
Authors: Jing Li, Huibiao Zhu, Jifeng He
Venue: Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems (2008)

New evolving internet technologies are extending the role of the World Wide Web from a platform of information exhibition to a new environment for service interactions. While new business opportunities are brought in under this new era of internet, novel challenges are coming out at the same time. Current technologies have been found lacking efficient support for web transactions. Because transactions in the context of web services have distinct features, such as autonomous and interactive, the traditional automatic mechanisms of resource locking and rollback are proved to be inappropriate. For this reason, we suggest that web transactions are constructed through a series of compensable transactions, using the concept of compensation to ensure a relatively relaxed atomicity. This paper formally expresses the composition structures and behavioral dependencies of compensable transactions. Based on the formal description for a transaction model, we are able to further verify its transactional behavior according to the specified requirement of relaxed atomicity and more precise behavioral properties with temporal constraints.
The Small World of Pheromone Trails
Authors: Paola Pellegrini, Andrea Ellero
Venue: Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence (2008)

In this paper we consider $\cal M\!AX\!$---$\cal MI\!N\!$ Ant System and Ant Colony System. They are generally recognized to be the best performing algorithms of the Ant Colony Optimization family. They are characterized by a quite different way for dealing with the pheromone trail. We propose an experimental analysis for observing whether this difference impacts significantly on the characteristics of the pheromone distributions produced during the runs. The results obtained are analyzed by using some concepts derived by the literature on small-world networks. It comes out that ants actually build small-world pheromone graphs during their runs. This behavior is interpreted here as a sort of decomposition of the instances tackled.
CS1: Getting Started
Authors: Michael E. Caspersen, Henrik Bærbak Christensen
Venue: Reflections on the Teaching of Programming: Methods and Implementations (2008)

The Logo programming language implements a virtual drawing machine --the turtle machine. The turtle machine is well-known for giving students an intuitive understanding of fundamental, procedural programming principles. In this chapter we present our experiences with resurrecting the Logo turtle in a new object-oriented way and using it in an introductory object-oriented programming course. While, at the outset, we wanted to achieve the same qualities as the original turtle (understanding of state, control flow, instructions), we realized that the concept of turtles is well-suited for teaching a whole range of fundamental principles. We have successfully used turtles to give students an intuitive understanding of central object-oriented concepts and principles such as object, class, message passing, behaviour, object identification, inheritance, and recursion. Finally, we have used turtles to show students the use of abstraction in practice because the turtle package, at a late stage in the course, becomes a handy graphics library used in a context otherwise unrelated to the turtles.
A Particle Swarm Optimization Algorithm for Multiuser Scheduling in HSDPA
Authors: Mehmet E. Aydin, Raymon Kwan, Cyril Leung, Jie Zhang
Venue: Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence (2008)

This paper briefs the problem of optimal multiuser scheduling in HSDPA. The modulation and coding schemes (MCSs), numbers of multicodes and power levels for all users are jointly optimized at each scheduling period, given that only limited Channel Quality Indicator (CQI) information, as specified in the HSDPA standard [1], is fed back to the BS. An integer programming model is proposed in order to provide a globally optimal solution to the multiuser scheduling problem. Due to the complexity of the globally optimal method, a swarm intelligence approach, namely particle swarm optimization (PSO), is subsequently proposed. The experimentations suggest that it potentially provides a near-optimum performance with significantly reduced complexity.
Introduction to the Numerical Analysis of Incompressible Viscous Flows
Authors: William Layton
Venue:  (2008)

This book treats the numerical analysis of finite element computational fluid dynamics. Assuming minimal background, the text covers finite element methods; the derivation, behavior, analysis, and numerical analysis of Navier Stokes equations; and turbulence and turbulence models used in simulations. Each chapter on theory is followed by a numerical analysis chapter that expands on the theory. The chapters contain numerous exercises. Introduction to the Numerical Analysis of Incompressible Viscous Flows provides the foundation for understanding the interconnection of the physics, mathematics, and numerics of the incompressible case, which is essential for progressing to the more complex flows not addressed in this book (e.g., viscoelasticity, plasmas, compressible flows, coating flows, flows of mixtures of fluids, and bubbly flows). With mathematical rigor and physical clarity, the book progresses from the mathematical preliminaries of energy and stress to finite element computational fluid dynamics in a format manageable in one semester. Audience: This unified treatment of fluid mechanics, analysis, and numerical analysis is intended for graduate students in mathematics, engineering, physics, and the sciences who are interested in understanding the foundations of methods commonly used for flow simulations.