ppxscal/embedding_network huggingface dataset:
Co-occurrence Matrixes for the Quality Assessment of Coded Images
Authors: Judith Redi, Paolo Gastaldo, Rodolfo Zunino, Ingrid Heynderickx
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

Intrinsic nonlinearity complicates the modeling of perceived quality of digital images, especially when using feature-based objective methods. The research described in this paper indicates that models from Computational Intelligence can predict quality and cope with multi-dimensional data characterized by complex perceptual relationships. A reduced-reference scheme exploits Support Vector Machines (SVMs) to assess the degradation in perceived image quality induced by three different distortion types: JPEG compression, white noise, and Gaussian blur. First, an objective description of the images is obtained by exploiting the co-occurrence matrix and its features; then, the SVM supports the nonlinear mapping between the objective description and the quality evaluation. Experimental results confirm the validity of the approach.
Auction, but don't block
Authors: Xiaowei Yang
Venue: Proceedings of the 3rd international workshop on Economics of networked systems (2008)

This paper argues that ISP's recent actions to block certain applications (e.g. BitTorrent) and attempts to differentiate traffic could be a signal of bandwidth scarcity. Bandwidth-intensive applications such as VoD could have driven the traffic demand to the capacity limit of their networks. This paper proposes to let ISPs auction their bandwidth, instead of blocking or degrading applications. A user places a bid in a packet header based on how much he values the communication. When congestion occurs, ISPs allocate bandwidth to those users that value their packets the most, and charge them the Vickrey auction price. We outline a design that addresses the technical challenges to support this auction and analyze its feasibility. Our analysis suggests that the design have reasonable overhead and could be feasible with modern hardware.
OpenMP on Multicore Architectures
Authors: Christian Terboven, Dieter Mey, Samuel Sarholz
Venue: Proceedings of the 3rd international workshop on OpenMP: A Practical Programming Model for the Multi-Core Era (2007)

Dualcore processors are already ubiquitous, quadcore processors will spread out this year, systems with a larger number of cores exist, and more are planned. Some cores even execute multiple threads. Are these processors just SMP systems on a chip? Is OpenMP ready to be used for these architectures? We take a look at the cache and memory architecture of some popular modern processors using kernel programs and some application codes which have been developed for large shared memory machines beforehand.
Interactive Surgical Planning
Authors: Linda Brewster, Sushma Trivedi, Heang Tuy, Jayaram Udupa
Venue: IEEE Computer Graphics and Applications (1984)

With this tool for visualizing and manipulating organ images in three dimensions, surgeons can plan and test their strategies before they get to the operating room.
Dynamic Binding Framework for Open Device Services
Authors: Gwyduk Yeom
Venue: Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing (2007)

We present a SOA-based, dynamic, extensible service binding framework that exports public services built on embedded systems' low-level capabilities. We have also implemented our framework on a small device equipped on a robot and demonstrated various interactions between our system and other services or devices. Our work is different from the SOA (Service Oriented Architecture)-based products many software vendors have announced in that our framework develops low-level device capabilities into public services that are readily integrated into existing high-level services. Recent proliferation of embedded systems made the motivation of this work.
A Graphical Interface to an Economist's Workstation
Authors: Thomas Williams
Venue: IEEE Computer Graphics and Applications (1984)

The artificial intelligence rapid prototyping methodology has been employed in the development of an advanced workstation for non-computer-trained professionals. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Explicit and default negation in databases and logic programs
Authors: Navin Viswanath
Venue: Proceedings of the 2nd SIGMOD PhD workshop on Innovative database research (2008)

Both relational databases and logic programs adopt some form of nonmonotonic reasoning in order to infer negative information. Relational databases adopt the Closed World Assumption (CWA) of Reiter. It can be easily seen that much greater expressivity is gained if negative information can be explicitly stated. This turns out to be especially true in the presence of uncertain or incomplete information in the database. The aim of this work is to investigate the handling of incomplete information in an open world setting. For logic programs, the class of extended logic programs has already been defined and studied. Of the programs declared contradictory by most of the semantics proposed so far, some programs may in fact have an appropriate meaning. In this paper, we present a new semantics for logic programs with explicit negation where the derivation of a literal is tied to the derivation of its complement.
An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem
Authors: Bin Fu, Zhixiang Chen, Mahdi Abdelguerfi
Venue: Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management (2007)

The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(logn)2(loglogn)2) deterministic time 2.8334-approximation algorithm for this problem. Previous approximation algorithms [7,3,6], when used to achieve the same approximation ratio for the disc covering problem, will have much higher time complexity than our algorithms.
Synaptic Rewiring for Topographic Map Formation
Authors: Simeon A. Bamford, Alan F. Murray, David J. Willshaw
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

A model of topographic map development is presented which combines both weight plasticity and the formation and elimination of synapses as well as both activity-dependent and -independent processes. We statistically address the question of whether an activity-dependent process can refine a mapping created by an activity-independent process. A new method of evaluating the quality of topographic projections is presented which allows independent consideration of the development of a projection's preferred locations and variance. Synapse formation and elimination embed in the network topology changes in the weight distributions of synapses due to the activity-dependent learning rule used (spike-timing-dependent plasticity). In this model, variance of a projection can be reduced by an activity dependent mechanism with or without spatially correlated inputs, but the accuracy of preferred locations will not necessarily improve when synapses are formed based on distributions with on-average perfect topography.
Automatic Generation of Fine-Grained Representations of Learner Response Semantics
Authors: Rodney D. Nielsen, Wayne Ward, James H. Martin
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

This paper presents a process for automatically extracting a fine-grained semantic representation of a learner's response to a tutor's question. The representation can be extracted using available natural language processing technologies and it allows a detailed assessment of the learner's understanding and consequently will support the evaluation of tutoring pedagogy that is dependent on such a fine-grained assessment. We describe a system to assess student answers at this fine-grained level that utilizes features extracted from the automatically generated representations. The system classifies answers to indicate the student's apparent understanding of each of the low-level facets of a known reference answer. It achieves an accuracy on these fine-grained decisions of 76% on within-domain assessment and 69% out of domain.
Double Partition: (6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs
Authors: Ding-Zhu Du
Venue: Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management (2008)

We introduce a new technique on partition, called double partition. With this new type of partition, we obtain a polynomial time (6 + ¿)-approximation (¿> 0) for the minimum weight dominating set problem in unit disk graphs, which improves a recent result of a 72-approximation given by Ambühl et al. for solving a long-standing open problem. As a corollary, we obtain a (9.875 + ¿)-approximation for the minimum weight connected dominating set problem in unit disk graphs. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Learning Meaning Before Syntax
Authors: Dana Angluin, Leonor Becerra-Bonache
Venue: Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications (2008)

We present a simple computational model that includes semantics for language learning, as motivated by readings in the literature of children's language acquisition and by a desire to incorporate a robust notion of semantics in the field of Grammatical Inference. We argue that not only is it more natural to take into account semantics, but also that semantic information can make learning easier, and can give us a better understanding of the relation between positive data and corrections. We propose a model of meaning and denotation using finite-state transducers, motivated by an example domain of geometric shapes and their properties and relations. We give an algorithm to learn a meaning function and prove that it finitely converges to a correct result under a specific set of assumptions about the transducer and examples.
Packet Forwarding in Pocket Switched Networks --- An Empirical Characterization of Human Mobility
Authors: Christophe Diot
Venue: Proceedings of the 3rd Asian conference on Internet Engineering: Sustainable Internet (2007)

Pocket switched networks (PSNs) make use of human mobility and local forwarding in order to distribute data. Information can be stored and passed, taking advantage of the device mobility, or forwarded over a wireless link when an appropriate contact is met. Such networks fall into the fields of mobile ad-hoc networking and delay-tolerant networking. PSN are totally distributed and cannot rely on central services for issues such as naming, authentication, trustatibility. The direct consequence is that forwarding in PSN is non trivial. In order to better understand the challenges associated to PSN design, we have collected human mobility data.We establish three fundamental properties of PSNs. First, the distribution of inter-contact time follows an approximate power law over a large time range in all data sets. This observation is at odds with the exponential decay expected by many currently used mobility models. Second, we establish that the diameter of PSNs is in the order of 10 hops, confirming the existence of the well know "small world" phenomenon in human mobility. Last, we show that all forwarding algorithms are equivalent from a delay and success rate standpoint due to a "path explosion" phenomenon that generally occurs a coupe of minute after the optimal path. We establish these three properties experimentally and give in each case a simple analytical model that explains our observations. We discuss the implications of these observations on forwarding algorithms in PSN. We conclude the talk by early results on the role of communities and interest in the PSN node population. These communities could be later used to optimize packet forwarding. We describe the on-going implementation of our PSN application.
Hierarchical Distance-Based Conceptual Clustering
Authors: Ana Maria Funes, Cesar Ferri, Jose Hernández-Orallo, Maria Jose Ramírez-Quintana
Venue: Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I (2008)

In this work we analyse the relation between hierarchical distance-based clustering and the concepts that can be obtained from the hierarchy by generalisation. Many inconsistencies may arise, because the distance and the conceptual generalisation operator are usually incompatible. To overcome this, we propose an algorithm which integrates distance-based and conceptual clustering. The new dendrograms can show when an element has been integrated to the cluster because it is near in the metric space or because it is covered by the concept. In this way, the new clustering can differ from the original one but the metric traceability is clear. We introduce three different levels of agreement between the clustering hierarchy obtained from the linkage distance and the new hierarchy, and we define properties these generalisation operators should satisfy in order to produce distance-consistent dendrograms.
Where's My Jetpack?
Authors: Simon Helsen, Arthur Ryman, Diomidis Spinellis
Venue: IEEE Software (2008)

Software development tools often fail to deliver on inflated promises. Rather than the predicted progression toward ever-increasing levels of abstraction, two simple trends have driven the evolution of currently available software development tools: integration at the source-code level and a focus on quality. Thus source code has become the bus that tools tap into for communicating with other tools. Also, focus has shifted from defect removal in the later phases to defect prevention in the earlier phases. In the future, tools are likely to support higher levels of abstraction, perhaps in the form of domain-specific languages communicated using XML.
Recurrent Fuzzy Neural Network Based System for Battery Charging
Authors: R. A. Aliev, R. R. Aliev, B. G. Guirimov, K. Uyar
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

Consumer demand for intelligent battery charges is increasing as portable electronic applications continue to grow. Fast charging of battery packs is a problem which is difficult, and often expensive, to solve using conventional techniques. Conventional techniques only perform a linear approximation of a nonlinear behavior of a battery packs. The battery charging is a nonlinear electrochemical dynamic process and there is no exact mathematical model of battery. Better techniques are needed when a higher degree of accuracy and minimum charging time are desired. In this paper we propose soft computing approach based on fuzzy recurrent neural networks (RFNN) training by genetic algorithms to control batteries charging process. This technique does not require mathematical model of battery packs, which are often difficult, if not impossible, to obtain. Nonlinear and uncertain dynamics of the battery pack is modeled by recurrent fuzzy neural network. On base of this FRNN model, the fuzzy control rules of the control system for battery charging is generated. Computational experiments show that the suggested approach gives least charging time and least Tend-Tstart results according to the other intelligent battery charger works.
Coordination of first responders under communication and resource constraints
Authors: Robert N. Lass, Joseph B. Kopena, Evan A. Sultanik, Duc N. Nguyen, Christopher P. Dugan, Pragnesh J. Modi, William C. Regli
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

This paper discusses the application of distributed constraint optimization to coordination in disaster management situations under sub-optimal network conditions. It presents an example system for the problem of shelter assignment and outlines some of the challenges and future research directions that must be addressed before real-world deployment of distributed constraint optimization becomes a reality.
Iterative Compression and Exact Algorithms
Authors: Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh
Venue: Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science (2008)

Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. The main purpose of this paper is to show that iterative compression can also be used in the design of exact exponential time algorithms. We exemplify our findings with algorithms for the Maximum Independent Set problem, a counting version of k-Hitting Set and the Maximum Induced Cluster Subgraph problem.
An Effective Graphic “Vocabulary”
Authors: George McCleary
Venue: IEEE Computer Graphics and Applications (1983)

The human brain responds to visual variables in predictable ways¿something many graphics display creators should take into account when they organize and symbolize data.
Multiple Evidence Combination in Web Site Search Based on Users' Access Histories
Authors: Chen Ding, Jin Zhou
Venue: Proceedings of the 11th international conference on User Modeling (2007)

Despite the success of global search engines, web site search is still problematic in its retrieval accuracy. In this study, we propose to extract terms based on users' access histories to build web page representations, and then use multiple evidence combination to combine these log-based terms with text-based and anchor-based terms. We test different combination approaches and baseline retrieval models. Our experimental results show that the server log, when used in multiple evidence combination, can improve the effectiveness of the web site search, whereas the impact on different models is different.
Signal Processing in Comparative Genomics
Authors: Matteo Ré, Giulio Pavesi
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

Comparative genomics techniques are a powerful tool for the identification of conserved functional genomic regions, but have to be coupled with methods able to assign a functional role to the regions identified. Several methods for the characterization of conserved regions have been proposed but, to our knowledge, signal processing approaches have not been applied yet in this context, despite the proven usefulness of this technique in experiments performed at single genome level. In this article we introduce the use of signal processing in comparative genomics, presenting a method for rapid classification of genomic conserved sequences as protein coding or non coding.
User Modelling for Personalized Question Answering
Authors: Silvia Quarteroni, Suresh Manandhar
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

In this paper, we address the problem of personalization in question answering (QA). We describe the personalization component of YourQA, our web-based QA system, which creates individual models of users based on their reading level and interests.First, we explain how user models are dynamically created, saved and updated to filter and re-rank the answers. Then, we focus on how the user's interests are used in YourQA. Finally, we introduce a methodology for user-centered evaluation of personalized QA. Our results show a significant improvement in the user's satisfaction when their profiles are used to personalize answers.
Flow visualization behind a streamwise oscillating cylinder and a stationary cylinder in tandem arrangement
Authors: S. J. Xu, Y. Zhou_affanb, J. Mi
Venue: Journal of Visualization (2004)

Interference is investigated between a stationary cylinder wake and that of a downstream streamwise oscillating cylinder. Experiments were carried out in a water tunnel. A laser-induced fluorescence technique was used to visualize the flow structure behind two inline circular cylinders of identical diameter d. The downstream cylinder was forced to oscillate harmonically at the amplitude of 0.5 d and the frequency ratio f$_e$/f$_s$=1.8, where f$_e$ is the oscillation frequency of the downstream cylinder and f$_s$ is the vortex shedding frequency from an isolated stationary cylinder. The investigation was conducted for the cylinder center-to-center spacing L/d=2.5<4.5. Two flow regimes have been identified, i.e. the 'single-cylinder shedding regime' at L/d > 3.5 and the 'two-cylinder shedding regime' at L/d > 3.5. At small L/d, the upstream cylinder does not appear to shed vortices; vortices are symmetrically formed behind the downstream cylinder as a result of interactions between the shear layers separated from the upstream cylinder and the oscillation of the downstream cylinder. This is drastically different from that behind two stationary cylinders at L/d > 3.5, where vortices are shed alternately from the downstream cylinder only. At L/d=4.5, both upstream and downstream cylinders shed vortices. This is true with or without the oscillation of the downstream cylinder. The flow structure is now totally different from that at L/d=3.5. The vortices are shed alternately from the upstream cylinder; a staggered spatial arrangement of vortices occurs behind the downstream cylinder.
Design of a Smart Continence Management System Based on Initial User Requirement Assessment
Authors: Jit Biswas, Aung Aung Phyo Wai, Victor Siang Foo, Chris Nugent, Maurice Mulvenna, David Craig, Peter Passmore, Daqing Zhang, Jer En Lee, Philip Lin Yap
Venue: Proceedings of the 6th international conference on Smart Homes and Health Telematics (2008)

Those with dementia need closer attention and monitoring when they develop incontinence. Incontinence can lead to medical complications such as skin breakdown, places greater demands on caregivers, and strips the patients of their dignity. We have taken a step towards building a smart continence management system (SCMS) by automating the detection of events and forwarding details of these events to caregivers. Besides reducing bedsores and concomitant ill-effects of the elderly remaining in soiled diapers for prolonged periods, SCMS also benefits caregivers, helping them improve visitation schedules and time management. In the user-requirements generation phase, a cohort of people were interviewed. Subsequently the user-requirements were translated into technical specifications, based on which, a product survey was conducted. The system was designed, implemented, deployed and is being evaluated at a nursing home in Singapore. Initial results are encouraging. A planned usability study/overall system evaluation will provide new requirements for the second version.
Efficient Algorithms for the k Smallest Cuts Enumeration
Authors: Li-Pu Yeh, Biing-Feng Wang
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

In this paper, we study the problems of enumerating cuts of a graph by non-decreasing weights. There are four problems, depending on whether the graph is directed or undirected, and on whether we consider all cuts of the graph or only s-t cuts for a given pair of vertices s, t. Efficient algorithms for these problems with ${\tilde{\mbox{O}}}(n^2m)$ delay between two successive outputs have been known since 1992, due to Vazirani and Yannakakis. In this paper, improved algorithms are presented. The delays of the presented algorithms are O(nm log(n 2/m)).