ppxscal/embedding_network huggingface dataset:
Controlling the complexity in comparing search user interfaces via user studies
Authors: Mika Käki, Anne Aula
Venue: Information Processing and Management: an International Journal (2008)

Over time, researchers have acknowledged the importance of understanding the users' strategies in the design of search systems. However, when involving users in the comparison of search systems, methodological challenges still exist as researchers are pondering on how to handle the variability that human participants bring to the comparisons. This paper present methods for controlling the complexity of user-centered evaluations of search user interfaces through within-subjects designs, balanced task sets, time limitations, pre-formulated queries, cached result pages, and through limiting the users' access to result documents. Additionally, we will present our experiences in using three measures - search speed, qualified search speed, and immediate accuracy - to facilitate the comparison of different search systems over studies.
Mother nature knows best: A survey of recent results on wireless networks based on analogies with physics
Authors: S. Toumpis
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

We survey recent results on wireless networks that are based on analogies with various branches of Physics. We address, among others, the problems of optimally arranging the flow of traffic in wireless sensor networks, finding minimum-cost routes, performing load balancing, optimizing and analyzing cooperative transmissions, calculating the capacity, finding routes that avoid bottlenecks, and developing distributed anycasting protocols. The results are based on establishing analogies between wireless networks and settings from various branches of Physics, such as Electrostatics, Optics, Percolation theory, Diffusion, and others. Many of the results we present hinge on the assumption that the network is massive, i.e., it consists of so many nodes that it can be described in terms of a novel macroscopic view. The macroscopic view is not as detailed as the standard microscopic one, but nevertheless contains enough details to permit a meaningful optimization.
An aspect-oriented weaving mechanism based on component and connector architecture
Authors: Naoyasu Ubayashi, Akihiro Sakai, Tetsuo Tamai
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Aspect-oriented programming (AOP) separates crosscutting concerns from primary concerns. These concerns are woven together by a weaver. Although AOP provides an effective module mechanism, it is not necessarily easy for a programmer to understand the overall behavior of a woven program. To deal with this problem, we propose a new kind of information hiding mechanism called a weaving-interface that encapsulates weaving in class-based AOP in which all kinds of concerns are described according to classes. Weaving-interfaces are completely separated from concerns described in terms of classes. A programmer who designs how to compose concerns does not have to know the details of class definitions, but has only to be aware of weaving-interfaces. A programmer who designs each concern does not have to know how the concern is composed, but has only to be aware of weaving-interfaces. Adopting the weaving-interface mechanism, AO weaving can be realized by the component-and-connector software architecture. This weaving-interface mechanism is effective for software modularity, evolution, and reuse
Robust intelligent tracking control with PID-type learning algorithm
Authors: Chun-Fei Hsu, Guan-Ming Chen, Tsu-Tian Lee
Venue: Neurocomputing (2007)

This paper proposes a robust intelligent tracking controller (RITC) for a class of unknown nonlinear systems. The proposed RITC system is comprised of a neural controller and a robust controller. The neural controller is designed to approximate an ideal controller using a proportional-integral-derivative (PID)-type learning algorithm in the sense of Lyapunov function, and the robust controller is designed to achieve L^2 tracking performance with desired attenuation level. Finally, to investigate the effectiveness of the RITC system, the proposed design methodology is applied to control two chaotic dynamical systems. The simulation results verify that the proposed RITC system using PID-type learning algorithm can achieve faster convergence of the tracking error and controller parameters than that using I-type learning algorithm.
Tools for support of automata-based programming
Authors: V. S. Gurov, M. A. Mazin, A. S. Narvsky, A. A. Shalyto
Venue: Programming and Computing Software (2007)

A method for designing and implementing reactive object-oriented programs with explicit emphasis of states is suggested. The method relies on the automata-based programming (SWITCH-technology) and the UML notation. The UniMod tool based on this method, which is a plug-in module for the Eclipse platform, is described.
The bivariate gamma exponential distribution with application to drought data
Authors: Saralees Nadarajah
Venue: Journal of Applied Mathematics and Computing (2007)

The exponential and the gamma distributions have been the traditional models for drought duration and drought intensity data, respectively. However, it is often assumed that the drought duration and drought intensity are independent, which is not true in practice. In this paper, an application of the bivariate gamma exponential distribution is provided to drought data from Nebraska. The exact distributions of R = X + Y, P = XY and W = X/(X + Y) and the corresponding moment properties are derived when X and Y follow this bivariate distribution.
3D Atlas Building in the Context of Head and Neck Radiotherapy Based on Dense Deformation Fields
Authors: Adriane Parraga, Altamiro Susin, Johanna Pettersson, Benoit Macq, Mathieu De Craene
Venue: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (2007)

In this paper we present a methodology to build a computational anatomical atlas based on the analysis of dense deformation fields recovered by the Morphons non-rigid registration algorithm. The anatomical atlas construction procedure is based on the minimization of the effort required to register the whole database to a reference. The suitability of our method is demonstrated for atlas construction of the head and neck anatomy. In this application, CT is the most frequently used modality for the segmentation of organs at risk and clinical target volume. One challenge brought by the use of CT images is the presence of important artefacts caused by dental implants. Such artefacts make the use of most atlas building techniques described in the literature impracticable in this context. The results have shown that our model is faithful for representing the shape variability presented in human nature with the advantage that our anatomical atlas does not have any degree of smoothness.
The semantic web: semantics for data on the web
Authors: Stefan Decker, Vipul Kashyap
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

In our tutorial on Semantic Web (SW) technology, we explain the why, the various technology thrusts and the relationship to database technology. The motivation behind presenting this tutorial is discussed and the framework of the tutorial along with the various component technologies and research areas related to the Semantic Web is presented.
Data Mining Applied to the Instrumentation Data Analysis of a Large Dam
Authors: Rosangela Villwock, Maria Teresinha Arns Steiner, Andrea Sell Dyminski
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Itaipu Dam is one of the biggest dams in the world. There are more than 2200 instruments installed, periodically monitored since 1986. Due to the large amount of collected and stored data, as well as to the possibility of useful but hidden information, it is necessary to use techniques that may allow us to transform data into knowledge. Itaipu company just finished to apply the automatic acquisition system in approximately 210 instruments. With this work we intend to confirm the choice of the instruments that shall be automated focusing on one type of them, namely extensometers, located at the dam's section F. This task was performed by applying mathematical models based on Data Mining techniques capable of analyzing and selecting the most relevant data. Among the techniques, we applied Multivariate Data Analysis: Principal Components, Factor and Clustering Analysis, in a variety of forms. The results were satisfactory as we show.
Comments on "An Augmented Iterative Array for High Speed Division"
Authors: A. B. Gardiner
Venue: IEEE Transactions on Computers (1974)

Division is a serial operation and it is argued that parallel division arrays are unnecessary since serial circulating dividers can be designed which are almost as fast, when using the same technology, but are a fraction of the cost.
Block Encryption Using Hybrid Additive Cellular Automata
Authors: Petre Anghelescu, Silviu Ionita, Emil Sofron
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

With the ever-increasing growth of data communication, the need for security and privacy has become a strong necessity. In these conditions, the necessity of new powerful encryption techniques becomes a crucial issue. In this paper Cellular Automata (CA) are applied to construct cryptography algorithms. We present an encryption system implemented on a structure of Hybrid Additive Cellular Automata (HACA) used for securing the medical data sent over the internet. The experimental results prove the power of cellular automata encryption systems. The method supports both software and hardware implementation. In this paper we present a fully functional software application for the data encryption of multimedia medical content.
Skype4Games
Authors: Tonio Triebel, Benjamin Guthier, Wolfgang Effelsberg
Venue: Proceedings of the 6th ACM SIGCOMM workshop on Network and system support for games (2007)

We propose to take advantage of the distributed multi-user Skype system for the implementation of an interactive online game. Skype combines efficient multi-peer support with the ability to get around firewalls and network address translation; in addition, speech is available to all game participants for free. We discuss the network requirements of interactive multi-player games, in particular concerning end-to-end delay and distributed state maintenance. We then introduce the multi-user support available in Skype and conclude that it should suffice for a game implementation. We explain how our multi-player game based on the Irrlicht graphics engine was implemented over Skype, and we present very promising results of an early performance evaluation.
What Did You Say? Intercultural Expectations, Misunderstandings, and Communications
Authors: Frederick Zarndt
Venue: Proceedings of the International Conference on Global Software Engineering (2007)

What one says to compatriots in face-to-face conversations is often misunderstood; imagine the possibilities for misunderstanding with someone halfway around the world living in a very different culture and whose native language is not the one both of you are speaking! Clear communication is fundamental for the success of any project whether it is done by a small co-located group or by a globally dispersed team. And while the ubiquity of English facilitates basic communication, its use as a common language masks and disguises cultural differences and expectations. A foundation for cross-cultural communication and understanding cultural differences is not only useful but essential for any project executed by a geographically dispersed team.
A Communication Interface for Multiprocessor Signal Processing Systems
Authors: S. Saha, S. S. Bhattacharyya
Venue: Proceedings of the 2006 IEEE/ACM/IFIP Workshop on Embedded Systems for Real Time Multimedia (2006)

Parallelization of embedded software is often desirable for power/performance-related considerations for computation-intensive applications that frequently occur in the signal-processing domain. Although hardware support for parallel computation is increasingly available in embedded processing platforms, there is a distinct lack of effective software support. One of the most widely known efforts in support of parallel software is the message passing interface (MPI). However, MPI suffers from several drawbacks with regards to customization to specialized parallel processing contexts, and performance degradation for communication-intensive applications. In this paper, we propose a new interface, the signal passing interface (SPI), that is targeted toward signal processing applications and addresses the limitations of MPI for this important domain of embedded software by integrating relevant properties of MPI and coarse-grain dataflow modeling. SPI is much easier and more intuitive to use, and due to its careful specialization, more performance-efficient for the targeted application domain. We present our preliminary version of SPI, along with experiments using SPI on a practical face detection system that demonstrate the capabilities of SPI
How does common ground increase?
Authors: Gregorio Convertino, Helena M. Mentis, Alex Y. W. Ting, Mary Beth Rosson, John M. Carroll
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

We studied the process of sharing and managing knowledge (common ground process) in three-member teams performing emergency management planning tasks on shared maps. We built a reference task and a role-based multi-view prototype for studying this process. In this paper we empirically test the claim that common ground increases through joint experience on a task over time. We model the common ground process using a realistic task, a controlled setting, and multiple measures. We present findings from the analysis of questionnaires, communication transcripts, videos, and artifacts.
Errata- "An Implementation Guide to a Proposed Standard for Floating-Point Arithmetic"
Venue: Computer (1981)

The changes to Jerome T. Coonen's article in the Jaunary 1980 issue of Computer (pp. 68-79) are of two types. Those marker (E) correct errors, while the others, marked (U), bring the guide up to data with the most recent draft of the proposal. 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
Ix-cubes: iceberg cubes for data warehousing and olap on xml data
Authors: Fianny Ming-fei Jiang, Jian Pei, Ada Wai-chee Fu
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

With increasing amount of data being stored in XML format, OLAP queries over these data become important. OLAP queries have been well studied in the relational database systems. However, the evaluation of OLAP queries over XML data is not a trivial extension of the relational solutions, especially when a schema is not available. In this paper, we introduce the IX-cube (Iceberg XML cube) over XML data to tackle the problem. We extend OLAP operations to XML data. We also develop efficient approaches to IX-Cube computation and OLAP query evaluation using IX-cubes.
An Iterative Method for Bisymmetric Solutions and Optimal Approximation Solution of AXB=C
Authors: Ya-Xin Peng, Xi-Yan Hu, Lei Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

The bisymmetric solutions of the matrix equation AXB = C are too difficult to be obtained by applying matrices decomposition. In this paper, an iterative method is applied to solve this problem. By this, the solvability of the equation AXB = C over bisymmetric X can be determined automatically, and its solution can be obtained in finite iterative steps when it is consistent, its least-norm solution can be obtained by choosing a special kind of starting iterative matrix, furthermore, its optimal approximation solution to a given matrix can be derived by finding the leastnorm solution of a new equation A\tildeX B = \tildeC.
Exploring the interdisciplinary connections of gossip-based systems
Authors: Paolo Costa, Vincent Gramoli, Márk Jelasity, Gian Paolo Jesi, Erwan Le Merrer, Alberto Montresor, Leonardo Querzoni
Venue: ACM SIGOPS Operating Systems Review (2007)

In recent years the labels "gossip" and "gossip-based" have been applied to an increasingly general class of algorithms, including approaches to information aggregation, overlay network management and clock synchronization. These algorithms are intuitively similar, irrespective of their purpose. Their distinctive features include relying on local information, being round-based and relatively simple, and having a bounded information transmission and processing complexity in each round. Our position is that this class can and should be significantly extended to involve algorithms from other disciplines that share the same or similar distinctive features, like certain parallel numerical algorithms, routing protocols, bio-inspired algorithms and cellular automata, to name but a few. Such a broader perspective would allow us to import knowledge and tools to design and understand gossip-based distributed systems, and we could also export accumulated knowledge to re-interpret some of the problems in other disciplines, such as vehicular traffic control. In this position paper we describe a number of areas that show parallels with gossip protocols. These example areas will hopefully serve as inspiration for future research. In addition, we believe that comparisons with other fields also helps clarify the definition of gossip protocols and represents a necessary first step towards an eventual formal definition.
Underdetermined Blind Extraction of Sparse Sources Using Prior Information
Authors: Ning Xu, Qiu-Hua Lin
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

The traditional blind sourceseparation (BSS)usually estimates M sourcesignals from N observedmixtures andN\geqslantM. When there are less observedmixtures than source signals, i.e., N \le M, BSS becomesa challenging underdetermined problem. So far, mostof the techniques for solving the underdetermined BSSproblem focus on simultaneous separation of all sparsesources. Motivated by the fact thatBSS can extractonly a desiredsource signalby usingitspriorinformation, we present a novel method for extractinga specific sparse source by using its prior informationin this paper.According to three differentcases ofcharacteristics,themixed signals are divided intomultiple segments, which are thenprocessed(such asseparated using the traditional BSS) in different ways.The desired estimation is finally extractedbymeasuring its closenesswith a reference signalconstructed with priorinformation.The computersimulation results show theefficiencyof the proposedmethod.
UML Profiles for WS-Policy4MASC as Support for Business Value Driven Engineering and Management of Web Services and their Compositions
Authors: Vladimir Tosic, Basem Suleiman, Hanan Lutfiyya
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

WS-Policy4MASC is an XML language for specifica- tion of policies for run-time Web service management (monitoring and control) activities executed by the Man- ageable and Adaptable Services Compositions (MASC) middleware. Among its original contributions are specifi- cation of diverse business values (benefits or costs, tangi- ble or intangible, agreed or possible, absolute or relative) and specification of various control strategies maximizing different business values (e.g., only agreed intangible benefits). To facilitate development of Web service sys- tems that can be managed with WS-Policy4MASC and the MASC middleware and to improve alignment between run-time management activities and design-time models, we developed novel UML profiles for WS-Policy4MASC. Their original contributions are in improved support for: a) specification of run-time management activities and business values within design-time models, b) automatic creation of run-time management policies from design- time models, c) feedback of run-time management infor- mation values into analysis of design-time models. We validated our solutions on detailed examples.
Algorithm 870: A static geometric Medial Axis domain decomposition in 2D Euclidean space
Authors: Leonidas Linardakis, Nikos Chrisochoides
Venue: ACM Transactions on Mathematical Software (TOMS) (2008)

We present a geometric domain decomposition method and its implementation, which produces good domain decompositions in terms of three basic criteria: (1) The boundary of the subdomains create good angles, that is, angles no smaller than a given tolerance &Phi;0, where the value of &Phi;0 is determined by the application which will use the domain decomposition. (2) The size of the separator should be relatively small compared to the area of the subdomains. (3) The maximum area of the subdomains should be close to the average subdomain area. The domain decomposition method uses an approximation of a Medial Axis as an auxiliary structure for constructing the boundary of the subdomains (separators). The N-way decomposition is based on the &ldquo;divide and conquer&rdquo; algorithmic paradigm and on a smoothing procedure that eliminates the creation of any new artifacts in the subdomains. This approach produces well shaped uniform and graded domain decompositions, which are suitable for parallel mesh generation.
Exponential stability of delayed bidirectional associative memory neural networks with reaction diffusion terms
Authors: Anping Chen, Lihong Huang, Jinde Cao
Venue: International Journal of Systems Science (2007)

This article considers a class of delayed bi-directional associative memory (BAM) neural networks with reaction diffusion terms and delays. We obtain some simple criteria ensuring the existence and uniqueness of the equilibrium and its global exponential stability by applying homeomorphism mapping, constructing a new Lyapunov functional and inequality techniques. These criteria are independent of delays and posses infinitely adjustable real parameters, which improve and extend some recent results [J. Cao and M. Dong, "Exponential stability of delayed bidirectional associative memory networks", Appl. Math. Comput., 135, pp. 105-112, 2003; J. Cao and L. Wang, "Exponential stability and periodic oscillatory solution in BAM networks with delays", IEEE Trans. Neural Networ., 13, pp. 457-463, 2002; Q. Song and J. Cao, "Global exponential stability and existence of periodic solutions in BAM networks with delays and reaction-diffusion terms", Chaos Soliton. Fract., 23, pp. 421-430, 2005.] and have an important instructional significance in the designs and applications of bidirectional associative memory neural networks.
A conceptual framework for bio-inspired congestion control in communication networks
Authors: Morteza Analoui, Shahram Jamali
Venue: Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems (2006)

we propose that bio-inspired algorithms are best developed and analyzed in the context of a multidisciplinary conceptual framework that provides for sophisticated biological models and well founded analytical principles. we outline such a framework here, in the context of bio-inspired congestion control (BICC) models, and discuss mathematical techniques for analyzing the state dynamics of BICC. We finally discuss a case study, and show that the interaction of those Internet entities that involved in congestion control mechanisms is similar to predator-prey interaction. Hence, we map the predator-prey approach to the Internet congestion control mechanism. The simulation results show that using appropriately defined parameters, this model leads to a stable, fair and high-performance congestion control algorithm.