ppxscal/embedding_network huggingface dataset:
Discrete Pulse Transform of Images
Authors: Roumen Anguelov, Inger Fabris-Rotelli
Venue: Proceedings of the 3rd international conference on Image and Signal Processing (2008)

The Discrete Pulse Transform (DPT) of images is defined by using a new class of LULU operators on multidimensional arrays. This transform generalizes the DPT of sequences and replicates its essential properties, e.g. total variation preservation. Furthermore, the discrete pulses in the transform capture the contrast in the original image on the boundary of their supports. Since images are perceived via the contrast between neighbour pixels, the DPT may be a convenient new tool for image analysis.
Gem #10: limited types in Ada 2005: extended return statements
Authors: Bob Duff
Venue: ACM SIGAda Ada Letters (2008)

Ada Gem #10 -- An extended_return_statement may be used to give a name to the result object being created by a function.
Building Accessible Flash Applications: An XML-Based Toolkit
Authors: Paloma Cantón, Ángel L. González, Gonzalo Mariscal, Carlos Ruiz
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

The use of Flash as a web-based multimedia development tool has spread lately. Although a big effort has gone into improving its accessibility, there are still accessibility gaps requiring programming or purchase from another supplier. This makes building an accessible Flash application an ad hoc, complex and time-consuming task. With the aim of lightening the accessibility-related workload, we have implemented a toolkit that helps to create accessible multimedia Flash resources. This toolkit specifies the accessibility features as XML configuration files. It includes a library that works like a wrapper abstracting the logic layer of the different events and iterations from the physical layer. This way, new functionalities can easily be added. Additionally, it has been successfully used to build teaching and teaching support systems.
An Interactive and Dynamic Fusion-Based Image Retrieval Approach by CINDI
Authors: M. M. Rahman, B. C. Desai, P. Bhattacharya
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

This paper presents the image retrieval technique and the analysis of different runs of ImageCLEF 2007 submitted by the CINDI group. An interactive fusion-based search technique is investigated in both context and content-based feature spaces. For a context-based image search, keywords from associated annotation files are extracted and indexed based on the vector space model of information retrieval. For a content-based image search, various global and region-specific local image features are extracted to represent images at different levels of abstraction. Based on a user's relevance feedback information, multiple textual and visual query refinements are performed and weights are adjusted dynamically in a similarity fusion scheme. Finally, top ranked images are obtained by performing both sequential and simultaneous search processes in the multi-modal (context and content) feature space.
Online Service Management Algorithm for Cellular/WALN Multimedia Networks
Authors: Sungwook Kim, Sungchun Kim
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

Efficient network management system is necessary in order to provide QoS sensitive multimedia services while enhancing network performance. In this paper, we propose a new online network management algorithm based on adaptive online control strategy. Simulation results indicate the superior performance of our proposed algorithm under widely varying diverse traffic loads.
Impact of Software Bypassing on Instruction Level Parallelism and Register File Traffic
Authors: Vladimír Guzma, Pekka Jääskeläinen, Pertti Kellomäki, Jarmo Takala
Venue: Proceedings of the 8th international workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2008)

Software bypassing is a technique that allows programmer-controlled direct transfer of results of computations to the operands of data dependent operations, possibly removing the need to store some values in general purpose registers, while reducing the number of reads from the register file. Software bypassing also improves instruction level parallelism by reducing the number of false dependencies between operations caused by the reuse of registers. In this work we show how software bypassing affects cycle count and reduces register file reads and writes. We analyze previous register file bypassing methods and compare them with our improved software bypassing implementation. In addition, we propose heuristics when not to apply software bypassing to retain scheduling freedom when selecting function units for operations. The results show that we get at best 27% improvement to cycle count, as well as up to 48% less register reads and 45% less register writes with the use of bypassing.
Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
Authors: Miroslaw Dynia, Miroslaw Korzeniowski, Jarosław Kutyłowski
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequence of edge weight changes and has to choose a minimum spanning tree after each such change in the graph. The task of the algorithm is to perform as few changes in its minimum spanning tree as possible.We compare the number of changes in the minimum spanning tree produced by an online algorithm and that produced by an optimal offline algorithm. The number of changes is counted in the number of edges changed between spanning trees in consecutive rounds.For any graph with n vertices we provide a deterministic algorithm achieving a competitive ratio of $\mathcal{O}(n^2)$. We show that this result is optimal up to a constant. Furthermore we give a lower bound for randomized algorithms of ¿(logn). We show a randomized algorithm achieving a competitive ratio of $\mathcal{O}(n\log n)$ for general graphs and $\mathcal{O}(\log n)$ for planar graphs.
A note on Class A Bézier curves
Authors: Juan Cao, Guozhao Wang
Venue: Computer Aided Geometric Design (2008)

The Class A Bezier curves presented in Farin (2006) were constructed by so-called Class A matrix, which are special matrices satisfying two appropriate conditions. The speciality of the Class A matrix causes the Class A Bezier to possess two properties, which are sufficient conditions for the proof of the curvature and torsion monotonicity. In this paper, we discover that, in Farin (2006), the conditions Class A matrix satisfied cannot guarantee one of the two properties of the Class A Bezier curves, then the proof of the curvature and torsion monotonicity becomes incomplete. Furthermore, we modified the conditions for the Class A matrices to complete the proof.
Technology and the US Congress: Looking back and looking forward
Authors: Stephen Frantzich
Venue: Information Polity (2004)

The US Congress with its almost forty years of utilizing information and communications technology (ICT) serves as an appropriate vehicle for studying the degree to which information ICT has a revolutionary, minimalist or only potential impact on the politics and procedures of a significant political institution. As the "core technology" of political institutions, information processing stands out as a likely change facilitator. The inherent characteristics of new technologies tend to represent processes which are inconsistent with Congress' historical behavior patterns. Using historical, impressionistic and empirical data, the following analysis attempts to raise the key questions for assessing impact and determining the degree to which the inherent characteristics of the technology and patterns of usage bear out the various predictions. The generic nature of key aspects of Congress, and of the technologies in question, increase the possibility that findings from this realm will have wider applicability to other political and social institutions.
Knowledge Discovery by Network Visualization
Authors: Hong Zhou, Yingcai Wu, Ming-Yuen Chan, Huamin Qu, Zhengmao Xie, Xiaoming Li
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

Hyperlinks among webpages are very important information and are widely used for webpage clustering and webpage ranking. With the explosive growth in the number of webpages available online, the exploration of hyperlinks among webpages becomes a very challenging problem. Information visualization provides an effective way of visualizing hyperlinks and can help users gain insights into the relationships of webpages.In this paper, we present some novel computer graphics techniques to visualize the hyperlinks among webpages. We propose a visual encoding scheme for five dimensional hyperlinks data and two constrained 3D layout techniques for incoming and outgoing links of a single webpage. To reveal the hierarchical structure of webpages as well as the hyperlinks information, we extend the treemap representation. Our representations are visually appealing and can effectively reveal linkage patterns among webpages. Experimental results and a user study demonstrate the effectiveness of our system. Our system can facilitate E-learning and help students understand the complex structures and hidden patterns in network datasets.
Improving Associative Memory in a Network of Spiking Neurons
Authors: Russell Hunter, Stuart Cobb, Bruce P. Graham
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

Associative neural network models are a commonly used methodology when investigating the theory of associative memory in the brain. Comparisons between the mammalian hippocampus and neural network models of associative memory have been investigated [7]. Biologically based networks are complex systems built of neurons with a variety of properties. Here we compare and contrast associative memory function in a network of biologically-based spiking neurons [14] with previously published results for a simple artificial neural network model [6]. We investigate biologically plausible implementations of methods for improving recall under biologically realistic conditions, such as a sparsely connected network.
A New Characterization of P6-Free Graphs
Authors: Pim Hof, Daniël Paulusma
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

We study P 6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P 6-free if and only if each connected induced subgraph of G on more than one vertex contains a dominating induced cycle on six vertices or a dominating (not necessarily induced) complete bipartite subgraph. This characterization is minimal in the sense that there exists an infinite family of P 6-free graphs for which a smallest connected dominating subgraph is a (not induced) complete bipartite graph. Our characterization of P 6-free graphs strengthens results of Liu and Zhou, and of Liu, Peng and Zhao. Our proof has the extra advantage of being constructive: we present an algorithm that finds such a dominating subgraph of a connected P 6-free graph in polynomial time. This enables us to solve the Hypergraph 2-Colorability problem in polynomial time for the class of hypergraphs with P 6-free incidence graphs.
On the propagation of sound in air
Authors: Veturia Chiroiu
Venue: Proceedings of the 9th WSEAS International Conference on Acoustics & Music: Theory & Applications (2008)

This contribution is planned to provide the application of the soliton theory to understand the sound propagation in the open air. The equations of nonlinear acoustics, derived from the molecular point of view, can evaluate the sound attenuation, by using the experimental data and a genetic algorithm.
Explicit Dynamic User Profiles for a Collaborative Filtering Recommender System
Authors: M. Ilic, J. Leite, M. Slota
Venue: Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence (2008)

User modelling and personalisation are the key aspects of recommender systems in terms of recommendation quality. While being very efficient and designed to work with huge amounts of data, present recommender systems often lack the facility of user integration when it comes to feedback and direct user modelling. In this paper we describe ERASP, an add-on to existing recommender systems which uses dynamic logic programming --- an extension of answer set programming --- as a means for users to specify and update their models, with the purpose of enhancing recommendations. We present promising experimental results.
A SPARQL Engine for Streaming RDF Data
Authors: Sven Groppe, Jinghua Groppe, Dirk Kukulenz, Volker Linnemann
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

The basic data format of the Semantic Web isRDF. SPARQL, which has been developed by the W3C, is the upcoming standard for RDF query languages. Typical engines for processing SPARQL queries on RDF data first read all RDF data, may build indices of the complete read data and afterwards evaluate SPARQL queries. Such engines cannot operate on streaming RDF data. Streaming query engines operating on streams of data can (a) discard irrelevant input as early as possible, and thus save processing costs and space costs, (b) build indices only on those parts of the data, which are needed for the evaluation of the query, and (c) determine partial results of a query as early as possible, and thus evaluate queries more efficiently. We propose such a streaming SPARQL engine, which is the first streaming SPARQL engine to the best of our knowledge.
Flying Low: Simple Leases with Workspace Pilot
Authors: Timothy Freeman, Katarzyna Keahey
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

As the use of virtual machines (VMs) for scientific applications becomes more common, we encounter the need to integrate VM provisioning models into the existing resource management infrastructure as seamlessly as possible. To address such requirements, we describe an approach to VM management that uses multi-level scheduling to integrate VM provisioning into batch schedulers such as PBS. We then evaluate our approach on the TeraPort cluster at the University of Chicago.
Automated Secondary Storage Management
Authors: F. B. MacKENZIE
Venue: IEEE Annals of the History of Computing (1987)

During the past several years, the idea has been advanced that the management of secondary storage should be handled automatically by the computing system. Basic trends in computing design dictate that automatic management must be provided if the design objectives are to be practically realized. These trends are well noted elsewhere.(1965).
Joint Equilibrium Policy Search for Multi-Agent Scheduling Problems
Authors: Thomas Gabel, Martin Riedmiller
Venue: Proceedings of the 6th German conference on Multiagent System Technologies (2008)

We propose joint equilibrium policy search as a multi-agent learning algorithm for decentralized Markov decision processes with changing action sets. In its basic form, it relies on stochastic agent-specific policies parameterized by probability distributions defined for every state as well as on a heuristic that tells whether a joint equilibrium could be obtained. We also suggest an extended version where each agent employs a global policy parameterization which renders the approach applicable to larger-scale problems. Joint-equilibrium policy search is well suited for production planning, traffic control, and other application problems. In support of this, we apply our algorithms to a number of challenging scheduling benchmark problems, finding that solutions of very high quality can be obtained.
Error-Tolerant Combiners for Oblivious Primitives
Authors: Bartosz Przydatek, Jürg Wullschleger
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

A robust combiner is a construction that combines several implementations of a primitive based on different assumptions, and yields an implementation guaranteed to be secure if at least some assumptions (i.e. sufficiently many but not necessarily all) are valid.In this paper we generalize this concept by introducing error-tolerant combiners, which in addition to protection against insecure implementations provide tolerance to functionality failures: an error-tolerant combiner guarantees a secure and correct implementation of the output primitive even if some of the candidates are insecure or faulty. We present simple constructions of error-tolerant robust combiners for oblivious linear function evaluation. The proposed combiners are also interesting in the regular (not error-tolerant) case, as the construction is much more efficient than the combiners known for oblivious transfer.
An Experience with Augmenting a Mirror as a Personal Ambient Display
Authors: Kaori Fujinami, Fahim Kawsar
Venue: Proceedings of the 8th Asia-Pacific conference on Computer-Human Interaction (2008)

In this paper, we describe a case study on augmenting a daily object, mirror, for a personalized ambient display. The mirror displays information relevant to a person in front of it on the periphery of his/her sights. The interaction methods with the mirror were evaluated by a Wizard-of-Oz method and an in-situ experiment. The subjects preferred more controllability over the proactive functionalities and the understandability of information than the passive and the reflective nature of a mirror.
Characterizing Programming Systems Allowing Program Self-reference
Authors: John Case, Samuel E. Moeliusiii
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

The interest is in characterizing insightfully the power of program self-reference in effective programming systems (epses), the computability-theoretic analogs of programming languages. In an eps in which the constructive form of Kleene's Recursion Theorem (KRT) holds, it is possible to construct, algorithmically, from an arbitrary algorithmic task, a self-referential program that, in a sense, creates a self-copy and then performs that task on the self-copy. In an eps in which the not-necessarily-constructive form of Kleene's Recursion Theorem (krt) holds, such self-referential programs exist, but cannot, in general, be found algorithmically.In an earlier effort, Royer proved that there is no collection of recursive denotational control structures whose implementability characterizes the epses in which KRT holds. One main result herein, proven by a finite injury priority argument, is that the epses in which krt holds are, similarly, not characterized by the implementability of some collection of recursive denotational control structures.On the positive side, however, a characterization of such epses of a rather different sort is shown herein. Though, perhaps not the insightful characterization sought after, this surprising result reveals that a hidden and inherent constructivity is always present in krt.Know thyself.--- Greek proverb
Automatic Detection of Fiducial Marker Center Based on Shape Index and Curvedness
Authors: Manning Wang, Zhijian Song
Venue: Proceedings of the 4th international workshop on Medical Imaging and Augmented Reality (2008)

Fiducial marker is widely used for registration in image guided neurosurgery. In this paper we propose a novel automatic approach of localizing the center of these markers in CT volume. We first segment the volume into three parts according to shape index and curvedness of each voxel. Part1 includes some voxels on top of the markers, part2 includes some voxels at the bottom of the markers, and part3 is the background. Then we cluster voxels in part1 and part2 separately. The result groups in part1 are candidates for the top of markers, and the groups in part2 are candidates for bottom. For each group in part2, if there is a group in part1 that is close to it, this pair is regarded as a marker and the centroid of the group from part2 is the marker center. Experiments show that the marker center can be localized with sub millimeter accuracy.
Standardizing Web Services: Overcoming 'Design by Committee'
Authors: Sandeep Purao, John Bagby, Karthikeyan Umapathy
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

Web service standards, like several other IT standards, are anticipatory, i.e., they are designed and codified in anticipation of actual adoption and use. As a result, the setting of web service standards takes on properties that resemble the designing of software artifacts. In contrast, the traditional perspective on standards views them as law-like systems that legislate modes of behavior, product structures or specifications. The two perspectives – ‘design’ and ‘legislation’ – can sometimes be at odds. In the software engineering community, the phrase ‘design by committee’ has come to symbolize designs that are not effective, not elegant and not addressing issues that are core to the original intentions. Current efforts and recent outcomes in web services standards appear to have overcome this taboo. We demonstrate, with the help of an empirical study, how the participants interact, and the roles they take on to produce web service standards.
Plenary lecture V: measurement and reproduction of spatialization in room acoustics
Authors: Lamberto Tronchin
Venue: Proceedings of the 9th WSEAS International Conference on Acoustics & Music: Theory & Applications (2008)

The definition and measurement of sound spatialisation have been strongly enhanced in last years, as nowadays spatialisation is considered quite important during design of auditoria and virtual audio reproduction of sound quality in dedicated listening rooms for 3D reproduction purposes. Even though international standards like ISO 3382 require measuring some spatial parameters (i.e. LE, LF, IACC), usually only binaural measurements are performed, by means of a dummy head, and rarely 3D impulse responses are measured and utilised for sound reproduction. In this paper, after an overview on the most common techniques utilised for 3D auralization, an innovative procedure of measuring and reproducing spatial sound characteristics is presented. The application of this new technique in virtual 3D sound reconstruction is presented. Furthermore, the methodology is compared with other techniques of 3D sound reproduction. Moreover, the results of a wide campaign of measurements of spatial parameters among different auditoria all over the world, ranging from Italy to Japan and Australia, and conducted with the novel methodology, are compared with the results of standard binaural and 3D measurements. The possibility to enhance the spatial reproduction of sound quality in real spaces and the comprehensibility of spatial parameters is finally considered and presented in different cases.