ppxscal/embedding_network huggingface dataset:
Splitting information securely with entanglement
Authors: Takashi Mihara
Venue: Information and Computation (2003)

Although many quantum security tools have been proposed, many of them are quantum secret key distribution protocols. However, we naturally wish to construct quantum cryptosystems different from the conventional cryptosystems. In this paper, first, we show simple methods with prior entanglement in order to split a party's message among some parties securely. Moreover, as an application, we also show that by using our splitting methods, we can construct not only quantum secret key distribution protocols but also quantum cryptosystems. Some of our quantum cryptosystems are different from the conventional cryptosystems because they are executed interactively.
Shadow removal from a real picture
Authors: Masashi Baba, Naoki Asada
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

Since shadows in a real picture imply the geometric constraint between lights, objects and viewpoint, the augmented reality using the picture should include the consistent shadows with the real situation. This paper proposes a method to remove shadows from a real picture based on the RGB color space analysis and shows experimental results of actual shadow removal and virtual shadow addition.
Computers and social power
Authors: Rob Kling
Venue: ACM SIGCAS Computers and Society (1974)

The following essay is an early draft of a major now in progress. The author would appreciate comments and criticism. In addition, the editors of <u>Computers and Society</u> welcome your correspondence on this article and will publish such public commentary in forthcoming issues.
"Good enough" software reliability estimation plug-in for Eclipse
Authors: Nachiappan Nagappan, Laurie Williams, Mladen Vouk
Venue: Proceedings of the 2003 OOPSLA workshop on eclipse technology eXchange (2003)

Programmers who use the test-driven development practice of the Extreme Programming methodology write extensive automated unit and acceptance tests. This paper describes an Eclipse plug-in that utilizes the results of this automated testing, and in combination with a suite of internal product metrics, provides an early assessment of product reliability. We discuss the correlation between the metrics we use and the reliability of the developed software, as well as the general functional characteristics of the alpha version of our Eclipse plug-in.
Improved algorithm for geometry optimisation using damped molecular dynamics
Authors: M. I. J. Probert
Venue: Journal of Computational Physics (2003)

We present a new algorithm for optimising the configuration of a system of particles using damped molecular dynamics. This new algorithm has a much faster rate of convergence to the ground-state structure than other MD-based schemes. We also show how it is possible to use this algorithm to select dynamically the optimum time step or to precondition the masses for the modified dynamics, so as to produce additional significant efficiency gains especially as convergence is approached. The performance of the new algorithm is illustrated with several model systems and also by relaxing a defect in bulk silicon. The defect calculation was also relaxed using a standard BFGS algorithm and the performance was found to be comparable.
Local transformations of graphs preserving independence number
Authors: V. E. Alekseev, V. V. Lozin
Venue: Discrete Applied Mathematics (2004)

An attempt of introducing a general notion of local transformation of a graph is made. The investigated notion is applied to the independent set problem.
A Computational Model for Quantum Measurement
Authors: R. Srikanth
Venue: Quantum Information Processing (2003)

Is the dynamical evolution of physical systems objectively a manifestation of information processing by the universe? We find that an affirmative answer has important consequences for the measurement problem. In particular, we calculate the amount of quantum information processing involved in the evolution of physical systems, assuming a finite degree of fine-graining of Hilbert space. This assumption is shown to imply that there is a finite capacity to sustain the immense entanglement that measurement entails. When this capacity is overwhelmed, the system&rsquo;s unitary evolution becomes computationally unstable and the system suffers an information transition (&ldquo;collapse&rdquo;). Classical behavior arises from the rapid cycles of unitary evolution and information transition. Thus, the fine-graining of Hilbert space determines the location of the &ldquo;Heisenberg cut&rdquo;, the mesoscopic threshold separating the microscopic, quantum system from the macroscopic, classical environment. The model can be viewed as a probablistic complement to decoherence, that completes the measurement process by turning decohered improper mixtures of states into proper mixtures. It is shown to provide a natural resolution to the measurement problem and the basis problem.PACS: 03.65.Ta; 03.67.-a; 03.67.Lx; 03.67.Mn
Evaluating adaptive user profiles for news classification
Authors: Ricardo Carreira, Jaime M. Crato, Daniel Gonçalves, Joaquim A. Jorge
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

Never before have so many information sources been available. Most are accessible on-line and some exist on the Internet alone. However, this large information quantity makes interesting articles hard to find. Modern Personal Digital Assistants (PDAs), mobile phones, and the advent of ubiquitous computing will further complicate matters. Away from the desktop, the time to select important articles might be even harder to find. Strategies to select relevant information are sorely needed.One such strategy is content-based filtering, coupled with User Profiles. Our prototype uses a Bayesian classifier to select articles of interest to a specific user, according to his profile. The articles are extracted from web pages and displayed in a zoomable interface-based browser on a PDA. Interests may change over time, making it important to keep the profile up to date. The system monitors the users' reading behaviors, from which it infers their interest in particular articles and updates the profile accordingly. Results show that, from the start, most articles are correctly classified. An initial profile opposite to the user's actual interests can be reversed in less than ten days, showing the robustness of our approach. A user's interest in an article is inferred with a high degree of accuracy (over 90%).
Redundant representations in evolutionary computation
Authors: Franz Rothlauf, David E. Goldberg
Venue: Evolutionary Computation (2003)

This paper discusses how the use of redundant representations influences the performance of genetic and evolutionary algorithms. Representations are redundant if the number of genotypes exceeds the number of phenotypes. A distinction is made between synonymously and non-synonymously redundant representations. Representations are synonymously redundant if the genotypes that represent the same phenotype are very similar to each other. Non-synonymously redundant representations do not allow genetic operators to work properly and result in a lower performance of evolutionary search. When using synonymously redundant representations, the performance of selectorecombinative genetic algorithms (GAs) depends on the modification of the initial supply. We have developed theoretical models for synonymously redundant representations that show the necessary population size to solve a problem and the number of generations goes with O(2kr/r), where kr is the order of redundancy and r is the number of genotypic building blocks (BB) that represent the optimal phenotypic BB. As a result, uniformly redundant representations do not change the behavior of GAs. Only by increasing r, which means overrepresenting the optimal solution, does GA performance increase. Therefore, non-uniformly redundant representations can only be used advantageously if a-priori information exists regarding the optimal solution. The validity of the proposed theoretical concepts is illustrated for the binary trivial voting mapping and the real-valued link-biased encoding. Our empirical investigations show that the developed population sizing and time to convergence models allow an accurate prediction of the empirical results.
Aircraft and Gate Scheduling Optimization at Airports
Authors: H. Ding, A. Lim, B. Rodrigues, Y. Zhu
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

In this paper, we consider the over-constrained Airport Gate Assignment Problem where the number of flights exceeds the number of gates available, and where the objectives are to minimize the number of ungated flights and the total walking distances or connection times. We design a greedy algorithm and use a Tabu Search meta-heuristic to solve the problem. The greedy algorithm minimizes ungated flights while providing initial feasible solutions while we devise a new neighborhood search technique, the Interval Exchange Move, which allows us flexibility in seeking good solutions, especially in case when flight schedules are dense in time. Experiments conducted give good results.
A temporal data model and management system for normative texts in XML format
Authors: Fabio Grandi, Federica Mandreoli, Paolo Tiberio, Marco Bergonzini
Venue: Proceedings of the 5th ACM international workshop on Web information and data management (2003)

In this paper,we present the results of an on-going research activity concerning the temporal management of normative texts in XML format. In particular, four temporal dimensions (publication,validity,efficacy and transaction times) are used to correctly represent the evolution of norms in time and their resulting versioning. Hence, we introduce a multiversion data model based on XML schema and de?ne basic mechanisms for the management of norm texts. Finally, we describe a prototype management system which has been implemented and evaluated.
SMEs, co-opetition and knowledge sharing: the role of information systems
Authors: M. Levy, C. Loebbecke, P. Powell
Venue: European Journal of Information Systems (2003)

Co-opetition, simultaneous cooperation and competition, is a recent phenomenon. Co-opetition entails sharing knowledge that may be a key source of competitive advantage. Yet, the knowledge gained by cooperation may also be used for competition. However, there is little investigation of how this problem may be modelled and, hence, managed. A game-theoretic framework for analysing interorganisational knowledge sharing under co-opetition and guidelines for the management of explicit knowledge predicated on coordination and control theory has been proposed, but remains untested. This research empirically investigates these issues in the context of small and medium-sized enterprises (SMEs). SMEs provide an interesting setting as they are knowledge generators, but are poor at knowledge exploitation. The paper uses data from U.K. SMEs to investigate co-opetition, management of knowledge sharing and the role of IS.
Free vibration analysis of laminated composite shell structures using hybrid strain based layerwise finite elements
Authors: M. L. Liu, C. W. S. To
Venue: Finite Elements in Analysis and Design (2003)

The essential objective of the investigation reported in this paper was to extend the previously developed hybrid strain based layerwise shell elements to the free vibration analysis of laminated composite plate and shell structures. The hybrid strain based layerwise shell elements are proposed as viable alternatives to the conventional solid elements for the modeling and analysis of laminated composite shell structures. Several lower order hybrid strain based triangular shell elements for the general non-linear analysis of isotropic shell structures, developed earlier by the authors, are employed as the basic building block of the layerwise elements. The latter are formed by stacking the aforementioned lower order isotropic triangular shell elements. The investigation exploits ways of transforming element matrices from a layer to the mid-surface of the shell structure. The symbolic algebraic package MAPLE V is used for the derivation of the explicit consistent element stiffness and consistent element mass matrices. Thus, no numerical matrix inversion and integration are required in the derivation of element matrices. The numerical studies examine effects of several parameters to identify the "region of satisfactory performance" of the proposed layerwise elements. Also examined is the convergence pattern of the elements.
On the Entropy of a Hidden Markov Process
Authors: Philippe Jacquet, Gadiel Seroussi, Wojciech Szpankowski
Venue: Proceedings of the Conference on Data Compression (2004)

We study the entropy rate of a binary hidden Markov process (HMP) definedby observing the output of a binary symmetric channel whose input is a first-order binaryMarkov process. Despite the simplicity of the models involved, the characterization of thisentropy is a long standing open problem. By presenting the probability of a sequence underthe model as a product of random matrices, we show that the entropy rate sought is a topLyapunov exponent of the product, which explains the difficulty in its explicit computation.We apply the same product of random matrices to derive an explicit expression for a firstorder Taylor approximation of the entropy rate with respect to the parameter of the binary symmetric channel. The accuracy of the approximation is validated against empiricalsimulation results. We also extend our results to Rényi's entropy of any order.
Digital game-based learning
Authors: Marc Prensky
Venue: Computers in Entertainment (CIE) (2003)

Research published by University of Rochester neuroscientists C. Shawn Green and Daphne Bavelier has grabbed national attention for suggesting that playing "action" video and computer games has the positive effect of enhancing student's visual selective attention. But that finding is just one small part of a more important message that all parents and educators need to hear: Video games are not the enemy, but the best opportunity we have to engage our kids in real learning.
Using eye movement parameters for evaluating human-machine interface frameworks under normal control operation and fault detection situations
Authors: Y. Lin, W. J. Zhang, L. G. Watson
Venue: International Journal of Human-Computer Studies (2003)

A human-machine interface framework provides general guidelines for what information should be put on an interface display screen. The framework is thus a first step towards the design of an effective and efficient interface. This paper reports on an experimental study of two proposed frameworks: the ecological interface design framework and the function behaviour-state framework. In order to provide an unbiased comparative evaluation for both interfaces, the same application problem is used. The interfaces, based on each of the two frameworks, are implemented with as similar look-and-feel forms as possible in the presentation of information contents. Only the normal control operation and fault detection situations are considered at this stage of the study. In addition, in this study three categories of measures are used, namely: the performance measure; the physiological measure (the eye movement measure: the eye fixation and the pupil diameter change, in particular); and the subjective (or the user-rated) measure. The major results obtained from the study includes the following: (1) the information called the abstract function in the ecological interface design framework may not positively correlate to the performance improvement yet may increase the mental workload, (2) the function-behaviour-state framework seems more agreeable with the operator's mental model, and (3) operators may perform equally well with a function-behaviour-state interface but with a reduced mental workload. It is also found that the eye fixation measure is highly consistent with the performance measure and the subjective measure. The pupil diameter measure is found not to be significantly sensitive to the mental workload information; however, it appears sensitive to the mental workload information among individual participants and shows a consistent result with the other measures used.
ICSE workshop on remote analysis and measurement of software systems (RAMSS)
Authors: Alessandro Orso, Adam Porter
Venue: ACM SIGSOFT Software Engineering Notes (2003)

The goal of this one-day workshop was to bring together researchers and practitioners interested in exploring how the characteristics of today's area of computing (e.g., high connectivity, substantial computing power for the average user, higher demand for and expectation of frequent software updates) can be leveraged to improve software quality and performance.
Leveraging Web Services for Information Discovery
Authors: Doron Cohen, Michal Jacovi, Michael Herscovici, Yoelle S. Maarek, Noga Meshulam, Aya Soffer, Vladimir Soroka
Venue: Proceedings of the IEEE International Conference on Software-Science, Technology & Engineering (2003)

In this paper, we describe a novel application of the WebServices model for end-user information discovery needsrather than for the traditional business-to-businessapplications. We describe a specialization of WebServices for information providers and demonstrate,through an exemplary unified information discoveryconsole, how consumers can easily customize theirfavorite information sources, and obtain information fromthem in a passive or active but always unobtrusivemanner.
Switching Over to Paper: A New Web Channel
Authors: Moira C. Norrie, Beat Signer
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

We present a general web-based information infrastructure capable of supporting the rapid development of highly-interactive information environments that cater for widely varying requirements across application domains and all forms of fixed and mobile client devices. In particular, we describe how this infrastructure has been extended to support digitally augmented paper through a special transformation component that can map active areas of document pages to information objects so that user- and context-dependent interaction can be supported. Our infrastructure is sufficiently general and flexible to adapt to, not only emerging and even unanticipated technologies in the area of interactive paper, but also the rapidly expanding interaction sphere of hypermedia.
Developing unified messaging system apps in JAVA
Authors: Paul Healy, Declan Barber, Brian Nolan
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

Over the last decade, the widespread demand and use of the internet has changed the direction of the telecommunications industry as it was recognized that the internet could be used as an inexpensive way to handle not only data but also voice communications. This paper describes the creation of a Unified Messaging System (UMS) that unites both voice and data messaging forms and asks if Java may be the programming language of choice for developing UMS applications.
Principal typings for Java-like languages
Authors: Davide Ancona, Elena Zucca
Venue: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2004)

The contribution of the paper is twofold. First, we define a general notion of type system equipped with an entailment relation between type environments; this generalisation serves as a pattern for instantiating type systems able to support separate compilation and inter-checking of Java-like languages, and allows a formal definition of soundess and completeness of inter-checking w.r.t. global compilation. These properties are important in practice since they allow selective recompilation. In particular, we show that they are guaranteed when the type system has principal typings and provides sound and complete entailment relation between type environments.The second contribution is more specific, and is an instantiation of the notion of type system previously defined for Featherweight Java with method overloading and field hiding. The aim is to show that it is possible to define type systems for Java-like languages, which, in contrast to those used by standard compilers, have principal typings, hence can be used as a basis for selective recompilation.
Ontological Agents Model based on MAS-CommonKADS methodology
Authors: María A. Medina, Alfredo Sánchez, Nohema Castellanos
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

Ontologies have shown to be a key mechanism to dealwith a set of different systems. This paper proposes amodel of software agents in charged of informationretrieval tasks from a federation of digital libraries underOpen Archives Initiative Protocol for MetadataHarvesting. We have termed these assistants ontologicalagents because they operate with ontologies. Ontologiesare used to support two main tasks: to eliminateambiguity from a query and to enable the access to therepositories. We present their model which is based onMAS-CommonKADS methodology.
Determining the Camera Response from Images: What Is Knowable?
Authors: Michael D. Grossberg, Shree K. Nayar
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

An image acquired by a camera consists of measured intensity values which are related to scene radiance by a function called the camera response function. Knowledge of this response is necessary for computer vision algorithms which depend on scene radiance. One way the response has been determined is by establishing a mapping of intensity values between images taken with different exposures. We call this mapping the intensity mapping function. In this paper, we address two basic questions. What information from a pair of images taken at different exposures is needed to determine the intensity mapping function? Given this function, can the response of the camera and the exposures of the images be determined? We completely determine the ambiguities associated with the recovery of the response and the ratios of the exposures. We show all methods that have been used to recover the response break these ambiguities by making assumptions on the exposures or on the form of the response. We also show when the ratio of exposures can be recovered directly from the intensity mapping, without recovering the response. We show that the intensity mapping between images is determined solely by the intensity histograms of the images. We describe how this allows determination of the intensity mapping between images without registration. This makes it possible to determine the intensity mapping in sequences with some motion of both the camera and objects in the scene.