ppxscal/embedding_network huggingface dataset:
Schema integration framed in modal logic
Authors: Veselka Boeva
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

In this paper standard modal logic is suggested as a formal framework for modelling and analysing different aspects of schema integration. Schemata are represented by sets of modal first-order formulae and interpreted in terms of standard models of modal logic. An approach based on correspondence assertions, i.e. expressing relationships between different constructs in the schemata, is used. It is demonstrated that freeness of conflicts is a condition ensuring that the schemata can be meaningfully integrated. In other words, then the schemata can be merged into an integrated schema that represents as much information as the original ones. In view of this, we first show how the model determining the schema that is a combination of the original ones can be restricted to a model representing the schema integrating the individual ones together with the correspondence assertions. Then the latter schema is proven to be dominating with respect to original ones.
Modeling teaching and learning environments
Authors: Irina Zheliazkova, Rumen Kolev
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

At the present the choice of an integrated teaching and learning environment is a national resposible task for creation of the new information society of the 21 centure. During tle last decade a lot of learning and teaching environments have been developed. In the first ones the learner plays an active role, and in the second ones the teacher creates an individual plan for each learner. In this paper three block models of computer-based teaching systems and a lattice of teaching processors are remained. Three kinds of models, namely graph, block and relational are proposed as a theoretical background of an integrated teaching and learning environment.
Leveraging Social Networks to Fight Spam
Authors: P. Oscar Boykin, Vwani P. Roychowdhury
Venue: Computer (2005)

Social networks are useful for judging the trustworthiness of outsiders. An automated antispam tool exploits the properties of social networks to distinguish between unsolicited commercial e-mail¿spam¿and messages associated with people the user knows.
Illumination-Invariant Tracking via Graph Cuts
Authors: Daniel Freedman, Matthew W. Turek
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Illumination changes are a ubiquitous problem in computer vision. They present a challenge in many applications, including tracking: for example, an object may move in and out of a shadow. We present a new tracking algorithm which is insensitive to illumination changes, while at the same time using all of the available photometric information. The algorithm is based on computing an illumination-invariant optical flow field; the computation is made robust by using a graph cuts formulation. Experimentally, the new technique is shown to quite reliable in both synthetic and real sequences, dealing with a variety of illumination changes that cause problems for density based trackers.
Before and After Graphics for Business
Authors: John McWade
Venue:  (2005)

As the founder of the very first desktop publishing company (PageLab) and the publisher of Before and After magazine, John McWade knows graphics. He also knows businessï¾and the depth of that knowledge comes through in every page of this handsome primer on creating effective business graphics! In these pages, a master of the medium shows you how to use today's tools to create business graphics that communicate your business's identity in a variety of forms. From creating charts, graphs, calendars, and maps to designing newsletters, creating various types of stationery, coming up with an identity, using photos to convey a message, and creating gift certificates, Yellow Pages ads, coupons, forms, and more, this elegantly designed volume shows you how to present your business to the world graphically. Best of all, you'll discover how to think visuallyï¾ensuring that your perceptions of your business are the world's perception of your business through the effective use of business graphics.
Off-Line Scheduling of Divisible Requests on an Heterogeneous Collection of Databanks
Authors: Arnaud Legrand, Alan Su, Frederic Vivien
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02 (2005)

In this paper, we consider the problem of scheduling comparisons of motifs against biological databanks. We experimentally show that this problem lies in the divisible load framework with negligible communication costs. In this framework, we propose a polynomial-time algorithm to optimally solve the maximum weighted flow offline scheduling problem on unrelated machines. We also show how to optimally solve the maximum weighted flow off-line scheduling problem with preemption on unrelated machines.
PERCEPTUAL-MOTOR CONTROL IN HUMAN-COMPUTER INTERACTION
Authors: Erik Nilsen
Venue: ACM SIGCHI Bulletin (1991)

Information-oriented jobs are particularly well suited for persons with disabilities, requiring far less physical capability than many other jobs. However, computers themselves may present barriers to workers with physical limitations through poorly designed features and poorly selected adaptive aids. Current methods of input device selection for users with disabilities are unsystematic and rarely result in the selection of a device which allows maximum productivity of the user.
Creating histories
Authors: Paul Brown, Phil Husbands, Margaret A. Boden, Catherine Mason, Alan Sutcliffe
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

This panel invites four speakers to discuss the history of creativity and cognition. Phil Husbands talks about the pioneering group that played an important role in the emergence of cybernetics in the UK - The Ratio Club; Margaret Boden describes the history of creativity research in AI; Catherine Mason presents her research into the role that institutions played in the development of the computer arts in the UK and; Alan Sutcliffe describes his experiences as a co-founder of the influential Computer Arts Society.
Trade-offs on the location of the core node in a network
Venue: Networks (2004)

We consider the problem of selecting a core node in a network under two potentially competing criteria, one being the sum of the distances to a set of terminals, the other being the cost of connecting this core node and the terminals with a Steiner tree. We characterize the worst-case trade-off between approximation ratios for the two objectives. Our results, for example, show the existence of a core node in which both objectives are simultaneously within 1.37 times their optimum value &lpar;if we were to disregard the other objective&rpar;. We also consider the problem of minimizing a weighted sum of the two criteria and perform a worst-case analysis of a simple and fast heuristic, which does not need to enumerate possible core locations. This study was motivated by multimedia applications such as videoconferences or multiplayer games in which user-dependent information has to be sent from the users to a core node to be chosen &lpar;at a cost proportional to the sum of the distances from the core node&rpar;, and then global information has to be multicast back from the core node to all users &lpar;at a cost proportional to the Steiner tree cost&rpar;. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44&lpar;3&rpar;, 179&ndash;186 2004
Service domains
Authors: Y.-S Tan, V. Vellanki, J. Xing, B. Topol, G. Dudley
Venue: IBM Systems Journal (2004)

In this paper we introduce the concept of service domain, to be used as a major building block for implementing service-oriented architectures in large computing grids in which tens or hundreds of services are offered to customers. A service domain maps a collection of comparable or related services to a single logical service. We describe an architecture for service domains that uses a set of policy rules for managing the collection of services and that automatically dispatches the "best" service available to satisfy user requests. The architecture has built-in autonomic properties in that a service domain implementation monitors the events within its control and triggers adjustment actions in its member services, including recovery from service failure and handling of topology changes. We describe a reference Implementation of the service domain architecture that is publicly available as a development toolkit, and we discuss its application in the implementation of a large grid now in progress.
a synergy between efficient interpretation and fast selective dynamic compilation for the acceleration of embedded Java virtual machines
Authors: Mourad Debbabi, Abdelouahed Gherbi, Lamia Ketari, Chamseddine Talhi, Hamdi Yahyaoui, Sami Zhioua
Venue: Proceedings of the 3rd international symposium on Principles and practice of programming in Java (2004)

We propose, in this paper, a technique for the acceleration of embedded Java virtual machines. The technique relies on an established synergy between efficient interpretation and selective dynamic compilation. Actually, efficient interpretation is achieved by a generated threaded interpreter that is made of a pool of codelets. The latter are native code units efficiently implementing the dynamic semantics of a given bytecode. Besides, each codelet carries out the dispatch to the next bytecode eliminating therefore the need for a costly centralized traditional dispatch mechanism. The acceleration technique described in this paper advocates the use of a selective dynamic compiler to translate performance-critical methods to native code. The translation process takes advantage of the threaded interpreter by reusing most of the previously mentioned codelets. This tight collaboration between the interpreter and the dynamic compiler leads to a fast and lightweight (in terms of footprint) execution of Java class files.
Mesh-free deformations: Research Articles
Authors: Jian Chang, Jian J. Zhang
Venue: Computer Animation and Virtual Worlds (2004)

Existing physically based deformation techniques, such as the finite element method (FEM) and the mass-spring systems (MSS), require the deformed object to be properly meshed. This is arguably the most expensive manual intervention process. In this paper, we propose a mesh-free deformation technique where only unconnected points are involved. The idea is to develop an approximate analytical solution using the Kelvin solution. Due to the fact that no mesh is involved, deforming a complex shape is as straightforward as deforming a simple one. Furthermore, the trade-off between efficiency and accuracy is easy to achieve by redistributing the points concerned. Experiments show that this method is fast and offers similar accuracy to the FEM. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Parametric Orchestral Sonification of EEG in Real Time
Authors: Thilo Hinterberger, Gerold Baier
Venue: IEEE MultiMedia (2005)

We introduce a device for the parametric sonification of electro encephalographic (EEG) data. The device allows auditory feedback of multiple EEG characteristics in real time. Six frequency bands are assigned as instruments from a MIDI device. The time-dependent parameters modulate the timing, pitch, and volume of the instruments. Using this, we studied subjects' ability to perform a discrimination task with parametric sonification in real time.
1-homogeneous, pseudo-1-homogeneous, and 1-thin distance-regular graphs
Authors: Brian Curtin, Kazumasa Nomura
Venue: Journal of Combinatorial Theory Series B (2005)

Let Γ denote a distance-regular graph with diameter d ≥ 2, and fix a vertex x of Γ . Γ is said to be 1-homogeneous (resp. pseudo-1-homogeneous) with respect to x whenever for all integers h and i between 0 and d, inclusive (resp. for all integers h between 0 and d - 1 and i between 0 and d, inclusive) and for all vertices y and z of Γ with ∂(x, y) = h, ∂(y, z) = i, ∂(z, x) = 1, the number of vertices w of Γ with ∂(x, w) = j, ∂(y, w) = 1, ∂(z, w) = k is independent of y and z for all j, k (0 ≤ j, k ≤ d). We characterize these properties algebraically.The Terwilliger algebra T = T(x) of Γ with respect to x is the matrix subalgebra generated by A, E*0, E*1, .....E*d,, where A is the adjacency matrix of Γ and E*i is the diagonal matrix whose nonzero entries are ones in the (y, y) positions for those vertices y such that ∂(x, y) = i. Our results concern the left. ideal. TE*1 of T generated by E*1. We show that Γ is 1-homogeneous with respect to x if and only if dim E*iTE*1 ≤ 3 (1 ≤ i ≤ d-1) and dim E*dTE*1 ≤ 2. We also show that when the intersection number a1 ≠ 0, Γ is pseudo-1-homogeneous with respect to x if and only if dim E*iTE*1 ≤ 3(1 ≤ i ≤ d). We then characterize these properties according to the structure of the summands in the decomposition of TE*1 into minimal left ideals.Finally, we use these decompositions to describe a related family of distance-regular graphs. Let L denote a minimal left ideal of T. Then L is said to be thin if dim E*iL ≤ 1 (0 ≤ i ≤ d). The endpoint of L is min {i| E*i L ≠ 0}. The graph Γ is said to be 1-thin with respect to x when every minimal left ideal of T with endpoint 1 is thin. It is known that Γ is 1-thin with respect to x with a unique minimal left ideal of endpoint 1 if and only if Γ is bipartite or almost bipartite (in either case Γ is 1-homogeneous with respect to x). We show that Γ is 1-thin with respect to x with exactly two minimal left ideals of endpoint 1 if and only if Γ is pseudo-1-homogeneous with respect to x and the intersection number a1 is nonzero.
Improving Customer Service at the ARL MSRC
Authors: Randy N. Schauer, Steven R. Thompson
Venue: Proceedings of the 2004 Users Group Conference (2004)

The ARL MSRC has conducted a major overhaul of its customer service process in order to better support our customer community. Users were asked what changes they would like to see and an outside consultant was brought in to take a fresh look at our customer service approach. A new methodology for providing customer service was designed to overcome known deficiencies in the previous system as well as incorporate the inputs from our usersand the consultant. We purchased new hardware (a Sun Fire V100) and software (Remedy 5.1 Help Desk) to implement our new customer service methodology. Our consultant advised us on how to configure and use Remedy to our best advantage. We configured Remedy with manyfeatures to allow the staff to take direct ownership of a user problem report, track recurring questions, and follow the tickets through until an acceptable solution has been found. One major change is that now the majority of the staff is using Remedy instead of just the front-line Help Desk. The consultant motivated the staff on the importance of providing quality customer service. This new approach to customer service became operational in May 2003. Since then wehave collected various statistics on the types of problem users are encountering so we can improve our center. We use this information, along with customer and staff feedback, to continue improving the system to meet our customer's requirements.
Online Selecting Discriminative Tracking Features Using Particle Filter
Authors: Jianyu Wang, Xilin Chen, Wen Gao
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

The paper proposes a method to keep the tracker robust to background clutters by online selecting discriminative features from a large feature space. Furthermore, the feature selection procedure is embedded into the particle filtering process with the aid of existed "background" particles. Feature values from background patches and object observations are sampled during tracking and Fisher discriminant is employed to rank the classification capacity of each feature based on sampled values. Top-ranked discriminative features are selected into the appearance model and simultaneously invalid features are removed out to adjust the object representation adaptively. The implemented tracker with online discriminative feature selection module embedded shows promising results on experimental video sequences.
A Very Low Bit Rate Video Coding Combined with Fast Adaptive Block Size Motion Estimation and Nonuniform Scalar Quantization Multiwavelet Transform
Authors: Jiazhong Chen, Jingli Zhou, Shengsheng Yu, Jun Xu, Ling Zhong, Junhao Zheng
Venue: Multimedia Tools and Applications (2005)

We describe a very low bit rate video coding framework in which motion correlation between successive video frames is exploited in the multiwavelet transform domain. Some complicated techniques, such as spatial prediction in intra coding, adaptive block size motion estimation, more than one previous frames for prediction in inter frames, and content adaptive binary arithmetic coding (CABAC) are used in H.26L standard. The testing results show that H.26L can greatly outperform MPEG-4 ASP in both PSNR and visual quality. However, the encoding of H.26L costs too much time for it is complex to use fast motion search in adaptive block size motion estimation, and CABAC needs much time to generate the code list for entropy coding. Whereas, only four types of symbol are generated after zero tree wavelet coding so that the entropy coding can cost less time than CABAC. Moreover, if we select 8× 8 sized block as a basic mode, which can be united into the large size mode if neighbored 8× 8 sized blocks have same reference frame and motion vector, then the fast motion estimation can be feasible. Accordingly, a fast motion search algorithm, multiwavelet transform, and a novel adaptive quantization schemer are applied to the proposed coding frame. Experimental results reveal 0.2--0.5 dB increase in coded PSNR at low bit rates over the state-of-the-art H.26L recommendation, and similar improvements over MPEG-4 at high bit rates, with a considerable improvement in subjective reconstruction quality, while simultaneously supporting a scalable representation.
Disseminating Information to Mobile Clients Using Publish-Subscribe
Authors: Gero Muhl, Andreas Ulbrich, Klaus Herrmann, Torben Weis
Venue: IEEE Internet Computing (2004)

Providing an up-to-date view on dynamically changing data presents difficulties. While several different data-dissemination platforms address the problem, client mobility is still a major challenge. Volatile wireless connections and resource limitations void the attempt to apply the same mechanisms that work in fixed-wired networks. The Rebeca publish¿subscribe middleware implementation introduces several concepts for accommodating client mobility in publish¿subscribe systems. The authors present experimental results that show how intelligent filtering mechanisms can save network bandwidth inside the infrastructure and at mobile clients while preserving the accuracy of client notifications.
Dynamic Load Balance in Parallel Merge Sorting over Homogeneous Clusters
Authors: Armando De Giusti, Marcelo Naiouf, Franco Chichizola, Laura De Giusti
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Sorting is one of the most usual and important operations carried out in a computer. The time required by the sequential sorting algorithms is an important problem when working with large sized sequences. As solution, we can consider parallelization and attaining a near optimal performance achieving a balance in the work to be done by processors. Notice that the work does not depend only on the amount of data but also on the sequence disordering, and on the relative computer power of processors. This paper develops a technique of redistributing dynamically the data load from the prediction of work to be carried out by each processor, balancing the load among the different processes. The method is proved to reach the theoretical optimum for the parallel algorithm performance.
Blob Segmentation Using Joint Space-Intensity Likelihood Ratio Test: Application to 3D Tumor Segmentation
Authors: Kazunori Okada, Umut Akdemir, Arun Krishnan
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We propose a novel semi-automatic figure-ground segmentation solution for blob-like objects in multi-dimensional images. The blob-like structure constitutes various objects of interest that are hard to segment in many application domains, such as tumor lesions in 3D medical data. The proposed solution is motivated towards computer-aided diagnosis medical applications, justifying our semi-automatic and figure-ground approach. The efficient segmentation is realized by combining the robust anisotropic Gaussian model fitting and the likelihood ratio test (LRT)-based non-parametric segmentation in joint space-intensity domain. The robustly fitted Gaussian is exploited to estimate the foreground and background likelihoods for both spatial and intensity variables. We demonstrate that the LRT with the bootstrapped likelihoods is assured to be the optimal Bayesian classification while automatically determining the LRT threshold. A 3D implementation of the proposed algorithm is applied to the lung nodule segmentation in CT data and validated with 1310 cases. Our efficient solution segments a target nodule in less than 3 seconds in average.
Vector Equilibrium Problems. Existence Theorems and Convexity of Solution Set
Authors: Jun-Yi Fu
Venue: Journal of Global Optimization (2005)

The natural quasi-concavity of set-valued mappings in an ordered vector space is introduced. Existence theorems for vector equilibrium problems involving set-valued monotone mappings are obtained and the convexity of the solution set is shown.
Cooperative asynchronous update of shared memory
Authors: Bogdan S. Chlebus, Dariusz R. Kowalski
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the total number of read and write operations. First abstracted by Kanellakis and Shvartsman [12], Write-All is among the standard problems in distributed computing. The model consists of $n$ asynchronous processes and n registers, where every process can read and write to any register. Processes may fail by crashing. The most efficient previously known deterministic algorithm performs O(n1+ε) reads and writes, for an arbitrary fixed constant ε>0, and is due to Anderson and Woll [4]. This paper presents a new deterministic algorithm that performs O(n polylog n) read/write operations, thus improving the best previously known upper bound from polynomial to polylogarithmic in the average number of read/write operations per process. Using an approach to store and retrieve information about progress made in auxiliary registers, the novelty of the new algorithm is in using a family of multi-partite graphs with expansion properties to structure a set of registers as a graph and then have each asynchronous process explore a part of the graph according to its pattern of traversals. An explicit instantiation of our Write-All algorithm, based on best-known polynomial-time constructions of lossless expanders and a-expanding graphs, performs n • 2O(log3 log n) reads and writes. In this explicit solution to Write-All, the processes perform asymptotically less read/write operations than the most efficient non-explicit solution known before.