OpenRaiser/Intern-Atlas huggingface dataset:
Narrative Bridging - a specification of a modelling method for game design
Venue: arXiv cs.HC 2009
Year: 2009

Very little has been explored about the narrative as a process when constructing entertainment for interactive media. Simultaneously, the interest in narrative vehicles increases while certain occupations, seeing the narrative as a structure, obscure the examination of the process of selecting, arranging and rendering story material. To correct this deficiency, a method for a narrative bridging that encourages research and design while exploring narration as a process, is proposed with the aim to not diminish the properties of the interactive media. This method focuses on the initial phase where establishing and handling the information takes place and creates a foundation that precedes its systematization and computation. The aim is to give designers a comfortable design tool that firmly aids the design without interfering with creativity, and at the same time aids the construction of interplay between narration, spatiality and interactivity. The method aided the practise of a discipline that was established through a qualitative study conducted as part of a university course in rapid prototyping. The results demonstrated that the method aided time-constrained design processes, simultaneously detecting inconsistencies that would prevent the team from making improvements. The method gave the team a shared vocabulary and outlook, allowing them to progress without interfering with the creative flow. This enabled the team to reason about the process and easily advice design stakeholders. The study also provides directions for future developments within research of narrative processes in game design.
Novel Algorithm for Sparse Solutions to Linear Inverse Problems with Multiple Measurements
Venue: arXiv cs.IT 2009
Year: 2009

In this report, a novel efficient algorithm for recovery of jointly sparse signals (sparse matrix) from multiple incomplete measurements has been presented, in particular, the NESTA-based MMV optimization method. In a nutshell, the jointly sparse recovery is obviously superior to applying standard sparse reconstruction methods to each channel individually. Moreover several efforts have been made to improve the NESTA-based MMV algorithm, in particular, (1) the NESTA-based MMV algorithm for partially known support to greatly improve the convergence rate, (2) the detection of partial (or all) locations of unknown jointly sparse signals by using so-called MUSIC algorithm; (3) the iterative NESTA-based algorithm by combing hard thresholding technique to decrease the numbers of measurements. It has been shown that by using proposed approach one can recover the unknown sparse matrix X with () Spark A -sparsity from () Spark A measurements, predicted in Ref. [1], where the measurement matrix denoted by A satisfies the so-called restricted isometry property (RIP). Under a very mild condition on the sparsity of X and characteristics of the A, the iterative hard threshold (IHT)-based MMV method has been shown to be also a very good candidate.
Memento Ludi: Information Retrieval from a Game-Theoretic Perspective
Venue: arXiv cs.IR 2009
Year: 2009

We develop a macro-model of information retrieval process using Game Theory as a mathematical theory of conflicts. We represent the participants of the Information Retrieval process as a game of two abstract players. The first player is the `intellectual crowd' of users of search engines, the second is a community of information retrieval systems. In order to apply Game Theory, we treat search log data as Nash equilibrium strategies and solve the inverse problem of finding appropriate payoff functions. For that, we suggest a particular model, which we call Alpha model. Within this model, we suggest a method, called shifting, which makes it possible to partially control the behavior of massive users. This Note is addressed to researchers in both game theory (providing a new class of real life problems) and information retrieval, for whom we present new techniques to control the IR environment.
Predictability of PV power grid performance on insular sites without weather stations: use of artificial neural networks
Venue: arXiv cs.OH 2009
Year: 2009

The official meteorological network is poor on the island of Corsica: only three sites being about 50 km apart are equipped with pyranometers which enable measurements by hourly and daily step. These sites are Ajaccio (seaside), Bastia (seaside) and Corte (average altitude of 486 meters). This lack of weather station makes difficult the predictability of PV power grid performance. This work intends to study a methodology which can predict global solar irradiation using data available from another location for daily and hourly horizon. In order to achieve this prediction, we have used Artificial Neural Network which is a popular artificial intelligence technique in the forecasting domain. A simulator has been obtained using data available for the station of Ajaccio that is the only station for which we have a lot of data: 16 years from 1972 to 1987. Then we have tested the efficiency of this simulator in two places with different geographical features: Corte, a mountainous region and Bastia, a coastal region. On daily horizon, the relocation has implied fewer errors than a naive prediction method based on the persistence (RMSE=1468 Vs 1383Wh/m2 to Bastia and 1325 Vs 1213Wh/m2 to Corte). On hourly case, the results were still satisfactory, and widely better than persistence (RMSE=138.8 Vs 109.3 Wh/m2 to Bastia and 135.1 Vs 114.7 Wh/m2 to Corte). The last experiment was to evaluate the accuracy of our simulator on a PV power grid localized at 10 km from the station of Ajaccio. We got errors very suitable (nRMSE=27.9%, RMSE=99.0 W.h) compared to those obtained with the persistence (nRMSE=42.2%, RMSE=149.7 W.h).
Lindstrom theorems for fragments of first-order logic
Venue: arXiv cs.LO 2009
Year: 2009

Lindström theorems characterize logics in terms of model-theoretic conditions such as Compactness and the Löwenheim-Skolem property. Most existing characterizations of this kind concern extensions of first-order logic. But on the other hand, many logics relevant to computer science are fragments or extensions of fragments of first-order logic, e.g., k-variable logics and various modal logics. Finding Lindström theorems for these languages can be challenging, as most known techniques rely on coding arguments that seem to require the full expressive power of first-order logic. In this paper, we provide Lindström theorems for several fragments of first-order logic, including the k-variable fragments for k>2, Tarski's relation algebra, graded modal logic, and the binary guarded fragment. We use two different proof techniques. One is a modification of the original Lindström proof. The other involves the modal concepts of bisimulation, tree unraveling, and finite depth. Our results also imply semantic preservation theorems.
Optimized Training and Feedback for MIMO Downlink Channels
Venue: arXiv cs.IT 2009
Year: 2009

We consider a MIMO fading broadcast channel where channel state information is acquired at user terminals via downlink training and channel feedback is used to provide transmitter channel state information (CSIT) to the base station. The feedback channel (the corresponding uplink) is modeled as an AWGN channel, orthogonal across users. The total bandwidth consumed is the sum of the bandwidth/resources used for downlink training, channel feedback, and data transmission. Assuming that the channel follows a block fading model and that zeroforcing beamforming is used, we optimize the net achievable rate for unquantized (analog) and quantized (digital) channel feedback. The optimal number of downlink training pilots is seen to be essentially the same for both feedback techniques, but digital feedback is shown to provide a larger net rate than analog feedback.
Trapping Set Enumerators for Repeat Multiple Accumulate Code Ensembles
Venue: arXiv cs.IT 2009
Year: 2009

The serial concatenation of a repetition code with two or more accumulators has the advantage of a simple encoder structure. Furthermore, the resulting ensemble is asymptotically good and exhibits minimum distance growing linearly with block length. However, in practice these codes cannot be decoded by a maximum likelihood decoder, and iterative decoding schemes must be employed. For low-density parity-check codes, the notion of trapping sets has been introduced to estimate the performance of these codes under iterative message passing decoding. In this paper, we present a closed form finite length ensemble trapping set enumerator for repeat multiple accumulate codes by creating a trellis representation of trapping sets. We also obtain the asymptotic expressions when the block length tends to infinity and evaluate them numerically.
Memory Retrieved from Single Neurons
Venue: arXiv cs.NE 2009
Year: 2009

The paper examines the problem of accessing a vector memory from a single neuron in a Hebbian neural network. It begins with the review of the author's earlier method, which is different from the Hopfield model in that it recruits neighboring neurons by spreading activity, making it possible for single or group of neurons to become associated with vector memories. Some open issues associated with this approach are identified. It is suggested that fragments that generate stored memories could be associated with single neurons through local spreading activity.
On the complexity of identifying Head Elementary Set Free programs
Venue: arXiv cs.LO 2009
Year: 2009

Head-elementary-set-free programs were proposed in (Gebser et al. 2007) and shown to generalize over head-cycle-free programs while retaining their nice properties. It was left as an open problem in (Gebser et al. 2007) to establish the complexity of identifying head-elementary-set-free programs. This note solves the open problem, by showing that the problem is complete for co-NP.
Normalized Web Distance and Word Similarity
Venue: arXiv cs.CL 2009
Year: 2009

There is a great deal of work in cognitive psychology, linguistics, and computer science, about using word (or phrase) frequencies in context in text corpora to develop measures for word similarity or word association, going back to at least the 1960s. The goal of this chapter is to introduce the normalizedis a general way to tap the amorphous low-grade knowledge available for free on the Internet, typed in by local users aiming at personal gratification of diverse objectives, and yet globally achieving what is effectively the largest semantic electronic database in the world. Moreover, this database is available for all by using any search engine that can return aggregate page-count estimates for a large range of search-queries. In the paper introducing the NWD it was called `normalized Google distance (NGD),' but since Google doesn't allow computer searches anymore, we opt for the more neutral and descriptive NWD. web distance (NWD) method to determine similarity between words and phrases. It
Hybrid ARQ in Multiple-Antenna Slow Fading Channels: Performance Limits and Optimal Linear Dispersion Code Design
Venue: arXiv cs.IT 2009
Year: 2009

This paper focuses on studying the fundamental performance limits and linear dispersion code design for the MIMO-ARQ slow fading channel. Optimal average rate of well-known HARQ protocols is analyzed. The optimal design of space-time coding for the MIMO-ARQ channel is discussed. Information-theoretic measures are used to optimize the rate assignment and derive the optimum design criterion, which is then used to evaluate the optimality of existing space-time codes. A different design criterion, which is obtained from the error probability analysis of space-time coded MIMO-HARQ, is presented. Examples are studied to reveal the gain of ARQ feedback in space-time coded MIMO systems.
Google matrix, dynamical attractors and Ulam networks
Venue: arXiv cs.IR 2009
Year: 2009

We study the properties of the Google matrix generated by a coarse-grained Perron-Frobenius operator of the Chirikov typical map with dissipation. The finite size matrix approximant of this operator is constructed by the Ulam method. This method applied to the simple dynamical model creates the directed Ulam networks with approximate scale-free scaling and characteristics being rather similar to those of the World Wide Web. The simple dynamical attractors play here the role of popular web sites with a strong concentration of PageRank. A variation of the Google parameter $α$ or other parameters of the dynamical map can drive the PageRank of the Google matrix to a delocalized phase with a strange attractor where the Google search becomes inefficient.
Limits of Educational Soft "GeoGebra" in a Critical Constructive Review
Venue: arXiv cs.MS 2009
Year: 2009

Mathematical educational soft explore, investigating in a dynamical way, some algebraically, geometrically problems, the expected results being used to involve a lot of mathematical results. One such software soft is GeoGebra. The software is free and multi-platform dynamic mathematics software for learning and teaching, awards in Europe and the USA. This paper describes some critical but constructive investigation using the platform for graph functions and dynamic geometry.
Generic Unpacking of Self-modifying, Aggressive, Packed Binary Programs
Venue: arXiv cs.CR 2009
Year: 2009

Nowadays most of the malware applications are either packed or protected. This techniques are applied especially to evade signature based detectors and also to complicate the job of reverse engineers or security analysts. The time one must spend on unpacking or decrypting malware layers is often very long and in fact remains the most complicated task in the overall process of malware analysis. In this report author proposes MmmBop as a relatively new concept of using dynamic binary instrumentation techniques for unpacking and bypassing detection by self-modifying and highly aggressive packed binary code. MmmBop is able to deal with most of the known and unknown packing algorithms and it is also suitable to successfully bypass most of currently used anti-reversing tricks. This framework does not depend on any other 3rd party software and it is developed entirely in user mode (ring3). MmmBop supports the IA-32 architecture and it is targeted for Microsoft Windows XP, some of the further deliberations will be referring directly to this operating system.
Modélisation des facteurs influençant la performance de la chaîne logistique
Venue: arXiv cs.SE 2009
Year: 2009

Improvement of industrial performance such as cost, lead-time, adaptability, variety and traceability is the major finality of companies. At this need corresponds the necessity to collaborate and to strengthen their coordination mechanisms. Information exchange becomes then a strategic question: what is the nature of the information that can be shared with customers and suppliers? Which impact on the performance of a company is expectable? What about the performance of the whole supply chain? It is essential for a company to identify the information whose exchange contributes to its performance and to control its information flows. This study aims to release from the literature the main tendencies of collaboration practices and information exchanges leading to the performance and to propose a model of hypothesis gathering these practices.
Iterative Methods for Systems' Solving - a C# approach
Venue: arXiv cs.MS 2009
Year: 2009

This work wishes to support various mathematical issues concerning the iterative methods with the help of new programming languages. We consider a way to show how problems in math have an answer by using different academic resources and different thoughts. Here we treat methods like Gauss-Seidel's, Cramer's and Gauss-Jordan's.
Considerations on Construction Ontologies
Venue: arXiv cs.AI 2009
Year: 2009

The paper proposes an analysis on some existent ontologies, in order to point out ways to resolve semantic heterogeneity in information systems. Authors are highlighting the tasks in a Knowledge Acquisiton System and identifying aspects related to the addition of new information to an intelligent system. A solution is proposed, as a combination of ontology reasoning services and natural languages generation. A multi-agent system will be conceived with an extractor agent, a reasoner agent and a competence management agent.
Techniques for Securing Data Exchange between a Database Server and a Client Program
Venue: arXiv cs.DB 2009
Year: 2009

The goal of the presented work is to illustrate a method by which the data exchange between a standalone computer software and a shared database server can be protected of unauthorized interceptation of the traffic in Internet network, a transport network for data managed by those two systems, interceptation by which an attacker could gain illegetimate access to the database, threatening this way the data integrity and compromising the database.
Athos - The C# GUI Generator
Venue: arXiv cs.SE 2009
Year: 2009

This application comes to help software architects and developers during the long process between user's stories, designing the application's structure and actually coding it.
Quantization Errors of fGn and fBm Signals
Venue: arXiv cs.IT 2009
Year: 2009

In this Letter, we show that under the assumption of high resolution, the quantization errors of fGn and fBm signals with uniform quantizer can be treated as uncorrelated white noises.
Informatics Issues Used in the Production Dashboard
Venue: arXiv cs.OH 2009
Year: 2009

The aim of this paper is to present some computer aspects regarding the implementation and the employing of a dashboard in relation to the production activity. The paper begins with the theoretical presentation of the managerial perspective regarding the necessity of using the dashboard. The main functions of the dashboard in the production activity and the way it is employed are presented in the second part of the paper.
Aspects Regarding Operations with Fuzzy Processes
Venue: arXiv cs.LO 2009
Year: 2009

This paper introduces the notion of fuzzy process as a formalism for the idea of fuzzy contact between a device and its environment. The notions of absolute correctness and relative correctness are defined. In order to work with concurrency it has been built an approach to manipulate the interactive processes as a single process and the resulted behavior has been observed.
Inventory competition in a multi channel distribution system: The Nash and Stackelberg game
Venue: arXiv cs.GT 2009
Year: 2009

This paper investigates inventory management in a multi channel distribution system consisting of one manufacturer and an arbitrary number of retailers that face stochastic demand. Existence of the pure Nash equilibrium is proved and parameter restriction which implies uniqueness of it is derived. Also the Stackelberg game where the manufacturer plays a roll as a leader is discussed. Under specified parameter restrictions which guarantee profitability, sufficient condition for uniqueness of Stackelberg equilibrium is obtained. In addition comparison with simultaneous move game is made. The result shows that when whole prices are equal to production cost, manufacturer carries more inventory than simultaneous move game. Keywords: Inventory management, Substitution, Nash equilibrium, Stackelberg equilibrium.
Microcontroller based distributed and networked control system for public cluster
Venue: arXiv cs.DC 2009
Year: 2009

We present the architecture and application of the distributed control in public cluster, a parallel machine which is open for public access. Following the nature of public cluster, the integrated distributed control system is fully accessible through network using a user-friendly web interface. The system is intended mainly to control the power of each node in a block of parallel computers provided to certain users. This is especially important to extend the life-time of related hardwares, and to reduce the whole running and maintainance costs. The system consists of two parts : the master- and node-controllers, and both are connected each other through RS-485 interface. Each node-controller is assigned with a unique address to distinguish each of them. We also discuss briefly the implementation of the system at the LIPI Public Cluster.
Offline Algorithms for Several Network Design, Clustering and QoS Optimization Problems
Venue: arXiv cs.DS 2009
Year: 2009

In this paper we address several network design, clustering and Quality of Service (QoS) optimization problems and present novel, efficient, offline algorithms which compute optimal or near-optimal solutions. The QoS optimization problems consist of reliability improvement (by computing backup shortest paths) and network link upgrades (in order to reduce the latency on several paths). The network design problems consist of determining small diameter networks, as well as very well connected and regular network topologies. The network clustering problems consider only the restricted model of static and mobile path networks, for which we were able to develop optimal algorithms.
First results from the PARSE.Insight project: HEP survey on data preservation, re-use and (open) access
Venue: arXiv cs.DL 2009
Year: 2009

There is growing interest in the issues of preservation and re-use of the records of science, in the "digital era". The aim of the PARSE.Insight project, partly financed by the European Commission under the Seventh Framework Program, is twofold: to provide an assessment of the current activities, trends and risks in the field of digital preservation of scientific results, from primary data to published articles; to inform the design of the preservation layer of an emerging e-Infrastructure for e-Science. CERN, as a partner of the PARSE.Insight consortium, is performing an in-depth case study on data preservation, re-use and (open) access within the High-Energy Physics (HEP) community. The first results of this large-scale survey of the attitudes and concerns of HEP scientists are presented. The survey reveals the widespread opinion that data preservation is "very important" to "crucial". At the same time, it also highlights the chronic lack of resources and infrastructure to tackle this issue, as well as deeply-rooted concerns on the access to, and the understanding of, preserved data in future analyses.
Distributed elections in an Archimedean ring of processors
Venue: arXiv cs.DC 2009
Year: 2009

Unlimited asynchronism is intolerable in real physically distributed computer systems. Such systems, synchronous or not, use clocks and timeouts. Therefore the magnitudes of elapsed absolute time in the system need to satisfy the axiom of Archimedes. Under this restriction of asynchronicity logically time-independent solutions can be derived which are nonetheless better (in number of message passes) than is possible otherwise. The use of clocks by the individual processors, in elections in a ring of asynchronous processors without central control, allows a deterministic solution which requires but a linear number of message passes. To obtain the result it has to be assumed that the clocks measure finitely proportional absolute time-spans for their time units, that is, the magnitudes of elapsed time in the ring network satisfy the axiom of Archimedes. As a result, some basic subtilities associated with distributed computations are highlighted. For instance, the known nonlinear lower bound on the required number of message passes is cracked. For the synchronous case, in which the necessary assumptions hold a fortiori, the method is -asymptotically- the most efficient one yet, and of optimal order of magnitude. The deterministic algorithm is of -asymptotically- optimal bit complexity, and, in the synchronous case, also yields an optimal method to determine the ring size. All of these results improve the known ones.