ppxscal/embedding_network huggingface dataset:
WSC-06: The Web Service Challenge
Authors: M. Brian Blake, William Cheung, Michael C. Jaeger, Andreas Wombacher
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

In today's businesses, there is a trend that serviceoriented architecture (SOA) is evolving into a popular architectural paradigm for IT infrastructure. SOA allows companies' software systems to be shared as networkenabled electronic services with their commonly specified interfaces. Service discovery and composition are two emerging ones which are both fundamental and important to SOA. Service discovery occurs when software modules identify suitable services that meet pre-established requirements based on the service descriptions. Service composition takes one step further to chain up the discovered services as execution plans. To motivate and promote the research in the areas, the Web Services Challenge 2006 (WSC-06) is organized and will take place at the joint 2006 CEC/EEE conferences. Building upon the success of the first two Web Services Challenges held at EEE-05 and ICEBE-05, WSC-06 contains new challenges that consider not only exact match, but also subsumption relations between input and output types, thus simulating semantic search. The competition solicits academic and industry researchers to develop software systems for discovering Web services and also composing them to create higher-level capabilities.
Using zero configuration technology for IP addressing in optical networks
Authors: Freek Dijkstra, Jeroen J. van der Ham, Cees T. A. M. de Laat
Venue: Future Generation Computer Systems (2006)

Host configuration in optical networks is usually done by hand. In this paper we propose to use zero configuration techniques, including self-assigned IP addresses and multicast DNS to do this automatically. The proposed technology is designed for small networks without central control, and can be applied to optical private networks as long as there is no router in between the end-hosts.
An Information Hiding Scheme for OFDM Wireless Networks
Authors: Chuang Lin, Jeng-Shyang Pan, Chin-Shiuh Shieh, Peng Shi
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

The traditional information hiding schemes embed the information into the image, audio and video etc, for the purposes of copyright protection, authentication, and authorized access control etc. In this paper, we propose to embed the data into the physical layer of the baseband Orthogonal Frequency Division Multiplexing (OFDM) wireless networks. We test the information hiding scheme in an additive white Gaussian noise (AWGN) channel. The experimental results indicate that when the number of carriers is limited and the channel SNR is high enough, the proposed information hiding scheme can work effectively, while the OFDM system can also work well as it used to be.
Noise Estimation from a Single Image
Authors: Ce Liu, William T. Freeman, Richard Szeliski, Sing Bing Kang
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

In order to work well, many computer vision algorithms require that their parameters be adjusted according to the image noise level, making it an important quantity to estimate. We show how to estimate an upper bound on the noise level from a single image based on a piecewise smooth image prior model and measured CCD camera response functions. We also learn the space of noise level functions how noise level changes with respect to brightness and use Bayesian MAP inference to infer the noise level function from a single image. We illustrate the utility of this noise estimation for two algorithms: edge detection and featurepreserving smoothing through bilateral filtering. For a variety of different noise levels, we obtain good results for both these algorithms with no user-specified inputs.
Parietal Representation of Symbolic and Nonsymbolic Magnitude
Authors: Wim Fias, Jan Lammertyn, Bert Reynvoet, Patrick Dupont, Guy A. Orban
Venue: Journal of Cognitive Neuroscience (2003)

The close behavioral parallels between the processing of quantitative information conveyed by symbolic and nonsymbolic stimuli led to the hypothesis that there exists a common cerebral representation of quantity (Dehaene, Dehaene-Lambertz, & Cohen, 1998). The neural basis underlying the encoding of number magnitude has been localized to regions in and around the intraparietal sulcus (IPS) by brain-imaging studies. However, it has never been demonstrated that these same regions are also involved in the quantitative processing of nonsymbolic stimuli. Using functional brain imaging, we explicitly tested the hypothesis of a common substrate. Angles, lines, and two-digit numbers were presented pairwise, one to the left and one to the right of the fixation point. In the three comparison tasks, participants (n = 18) pressed the key on the side of the largest quantity. In the three control tasks, they indicated the side on which dimming occurred. A conjunction analysis between the three subtractions (comparison task-control task) revealed a site in left IPS that is specifically responsive when two stimuli have to be compared quantitatively, irrespective of stimulus format. The results confirm the hypothesis that quantity is represented by a common mechanism for both symbolic and nonsymbolic stimuli in IPS. In addition, the interaction between task and type of stimulus identified a region anterior to the conjunction site, not specific for quantitative processing, but reflecting general processes loaded by number processing.
Pulse Contour Variability Before and After Exercise
Authors: L. S. Xu, K. Q. Wang, L. Wang, Naimin Li
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

This paper compares the radial artery pulses of 105 young graduate students. The radial artery pulses after performing progressive ergometer for five minutes are different from those at rest. All the pulses become floating and fast. The contours of pulses have three kinds of variability. The incisures of 39 subjects become especially low; sometimes the incisures are lower than the onset of pulse waveform. The tidal waves and dicrotic waves of 32 subjects become higher. The pulses of 34 subjects become smooth. Their incisures and dicrotic waves become lower. These changes can instruct the exercise and training of the young students and athletes.
A new family of channel coding schemes for real-time visual communications
Authors: S. S. Karande, H. Radha
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

In this paper, we extend our work in [Karande, S. S. and Radha, H., 2003] which employed partial Reed-Solomon (PRS) codes at coding rates near channel capacity on a binary erasure channel (BEC). We demonstrated that an appropriately designed PRS code outperforms the classical Reed-Solomon (RS) code for a performance criterion tailored for realtime applications. This paper extends this analysis for a general BEC with varying channel conditions (under/above channel capacity). We illustrate that PRS codes exhibit a graceful degradation in erasure recovery performance and, hence, are suitable for multimedia communication. Our video simulation results outline that the enhanced erasure recovery yields a profound improvement in the perceived media quality. Finally we investigate the performance of the dividend rendered by PRS codes operating above channel capacity. In particular we define a paradigm for a unique "fixed rate" adaptive FEC scheme based on PRS codes.
Incremental learning of object detectors using a visual shape alphabet
Authors: Andreas Opelt, Axel Pinz, Andrew Zisserman
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

We address the problem of multiclass object detection. Our aims are to enable models for new categories to benefit from the detectors built previously for other categories, and for the complexity of the multiclass system to grow sublinearly with the number of categories. To this end we introduce a visual alphabet representation which can be learnt incrementally, and explicitly shares boundary fragments (contours) and spatial configurations (relation to centroid) across object categories. We develop a learning algorithm with the following novel contributions: (i) AdaBoost is adapted to learn jointly, based on shape features; (ii) a new learning schedule enables incremental additions of new categories; and (iii) the algorithm learns to detect objects (instead of categorizing images). Furthermore, we show that category similarities can be predicted from the alphabet. We obtain excellent experimental results on a variety of complex categories over several visual aspects. We show that the sharing of shape features not only reduces the number of features required per category, but also often improves recognition performance, as compared to individual detectors which are trained on a per-class basis.
How to solve large scale deterministic games with mean payoff by policy iteration
Authors: Vishesh Dhingra, Stéphane Gaubert
Venue: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools (2006)

Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the orbits (cycle-time) of a min-max function, which is equivalent to computing the value of a deterministic game with mean payoff, arises in the performance analysis of discrete event systems. We present here an improved version of the policy iteration algorithm given by Gaubert and Gunawardena in 1998 to compute the cycle-time of a min-max functions. The improvement consists of a fast evaluation of the spectral projector which is adapted to the case of large sparse graphs. We present detailed numerical experiments, both on randomly generated instances, and on concrete examples, indicating that the algorithm is experimentally fast.
The B-shape and B-complex for three-dimensional spheres
Authors: Jeongyeon Seo, Youngsong Cho, Cheol-Hyung Cho, Donguk Kim, Joonghyun Ryu, Deok-Soo Kim
Venue: Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering (2006)

In recent years, there have been extensive studies on biological systems such as proteins. Being one of the most important aspects, the geometry has been more important since the morphology of a molecular system is known to determine the critical functions of the molecule. In the study of the shape and the structure of a molecule, the representation of proximity information among atoms in the molecule is the most fundamental research issue. In this paper, we present a β-shape and a β-complex for a set of atoms with arbitrary sizes for a faster response to the topological queries among atoms. These concepts are the generalizations of the well-known a-shape and a- complex (and their weighted counterparts as well). To compute a β-shape, we first compute the Voronoi diagram of atoms and then transform the Voronoi diagram to a quasitriangulation which is the topological dual of the Voronoi diagram. Then, we compute a β-complex from the quasitriangulation by analyzing the valid intervals for each simplex in the quasi-triangulation. It is shown that a β-complex can be computed in O(m) time in the worst case from the Voronoi diagram of atoms, where m is the number of simplices in the quasi-triangulation. Then, a β-shape for a particular β consisting of k simplices can be located O(logm + k) time in the worst case from the simplicies in the β-complex sorted according to the interval values.
"Innovative mobile applications of context"
Authors: Kristijan Mihalic, Manfred Tscheligi, Pertti Huuskonen
Venue: Proceedings of the 8th conference on Human-computer interaction with mobile devices and services (2006)

Many different kinds of context aware systems have been proposed in the domain of mobile systems. So there are many application concepts available which are based some form of context parameters. However, there is additional potential available. In our belief, the truly novel systems that are using context as a major enabler are just appearing. There are now improved platforms for mobile context applications - how to use them to their full potential?The outcome of the workshop on Innovative Mobile Applications of Context (IMAC) will be a set of promising application concepts and scenarios with a solid understanding of the technical feasibility as well as requirements towards enabling context parameters.
Frequency resolution properties of the wavelet transform for detecting harmonically related narrowband signals
Authors: M. D. Ladd, G. R. Wilson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

Constant Q, narrowband, computer generated tones were applied to different wavelet transforms (WTs) (Daubechies, Morlet, and a modified Morlet). The purpose is to explore the frequency resolution properties of the transform in a narrowband tone detection context. The modified Morlet WT is matched to the bandwidth of the tones and shown to exhibit the best performance.
SIG-DDS: a Grid-based Remote Sensing Data Distribution System
Authors: ZhenChun Huang, GuoQing Li
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

Data distribution is one of the most important steps for the remote sensing applications; it depends on the Remote Sensing Data Distribution System (RS-DDS). The conventional RS-DDS such as GCMD Mapserver [1] or CEOP [2] often provides a web based user interface and supports little data types only. Although the WCS [3]/WFS [4]/WMS [5] purposed by OGC try to make it possible for applications to access heterogeneous data through a universal interface, it is still hard to be used because of the absent of data searching and difficulty of application programming. The distributed integrated applications are eager for a distributed, extensible, and co-operable RS-DDS which can distribute different types, different formats, and different goals RS-data in one system. Spatial Information Grid (shortly SIG) is a kind of application grid; it is built on the general grid and provides a perfect infrastructure for distributed spatial information applications. Based on SIG, a 3-layered remote sensing data distribution system named SIG-DDS is designed and implemented in this paper. It can be deployed in many java-based dynamic web servers such as Apache Tomcat which passes the test.
Comparison of expert-based and empirical evaluation methodologies in the case a CBL environment: the "Orestis" experience
Authors: Athanasis Karoulis, Stavros Demetriadis, Andreas Pombortsis
Venue: Computers Education (2006)

This paper compares several interface evaluation methods applied in the case of a computer based learning (CBL) environment, during a longitudinal study performed in three European countries, Greece, Germany, and Holland, and within the framework of an EC funded Leonardo da Vinci program. The paper firstly considers the particularities of the CBL environments presented in comparison to Distance Learning environments, as well as other educational pieces. Subsequently, the software under evaluation is described, as well as the underlying educational theories and the proposed instructional methodology regarding its effective application. In the case under study, a combination of expert-based and empirical (user-based) approaches are dealt with, and the "ideal" combination, for the consumption of the fewest possible resources in order to achieve the maximum outcome for the assessment of the software is investigated. A combinatory evaluation approach is argued for the provision of the best results in the case of complex environments such as educational ones. The results of this study show that both approaches, expert-based and empirical, have been found to perform adequately, although the empirical methodologies are always preferable. Therefore, this study concludes by proposing a combination of an expert-based approach during the early stages of the design cycle with an observational evaluation, performed by the instructors and/ or the designers, which has to provide the best cost/performance factor.
On Data and Visualization Models for Signaling Pathways
Authors: Nattakarn Ratprasartporn, Ali Cakmak, Gultekin Ozsoyoglu
Venue: Proceedings of the 18th International Conference on Scientific and Statistical Database Management (2006)

Signaling pathways are chains of interacting proteins, through which the cell converts a (usually) extracellular signal into a biological response. The number of known signaling pathways in the biological literature and on the web has been increasing at a very high rate, thus demanding a need for efficient ways of storing, visualizing, querying, and mining signaling pathways. In this paper, first we briefly compare the data modeling and visualization capabilities of existing signaling pathways systems. Then, we present a signaling pathway data model and its visualization that subsumes the existing models. Our model visualizes a signaling pathway (a) as a nested graph, (b) with explicit location information (e.g., cell, tissue, organelle, nucleus, etc.), and (c) in four abstraction levels, namely, the levels of molecule-tomolecule signaling steps, collapsed sub-pathways, molecule-to-pathway connections, and pathway-to-pathway connections. We model (1) the effects of specific signaling steps, (2) state changes of signaling molecules, (3) various (extensible) structural/physical changes of signaling molecules such as complex formation, dissociation, assembly, oligomerization, di-/trimerization, cleavage and degradation, (4) condensation/hydrolysis signaling steps, and (5) exchanges and translocations as signaling steps. The visualization model gracefully models incomplete information and hierarchical levels of signaling molecules. Finally, we introduce a completely new visualization dimension for pathways, namely, Gene Ontology (GO)- based functional visualizations of pathways. We believe that functional visualizations of pathways provides new opportunities in understanding, defining and comparing existing pathways, and in helping discover new ones.
Solving Symmetrical CSPs with an Asymmetrical Cost Function
Authors: Verroust Florent, Nicolas Prcovic
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

Many CSPs contain a combination of symmetrical and asymmetrical constraints. We present a global approach that allows to apply any usual methods for breaking symmetries on the symmetrical part of a CSP and then to search for a global solution by integrating afterwards the asymmetrical constraints. Then, we focus on optimization problems where only the cost function is asymmetrical.
Modeling of MPEG Video Sequence Based on Mixture-Exponential
Authors: Yan Huo, Tao Jing, Yumin Feng
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

This paper presents a novel model of MPEG video sequence. In this work, the sequence is modeled using wavelet packets and mixture-exponential distribution. In order to capture LRD and SRD properties of MPEG video sequence, the method of wavelet transform is employed on the predicted model. Simulation results demonstrate that this model captures important statistical features of original sequence.
A postal system based digital network and a distance learning application
Authors: Randolph Wang
Venue:  (2006)

In this thesis, we propose the novel approach of turning storage media transported by the postal system into a general-purpose and transparent digital network, extending pervasive, high-bandwidth, and low-cost connectivity to places such as rural areas in developing countries. We call such a system the Postmanet. To fully realize its potential, however, an end user needs better support than being told to burn discs and toss them into the mail bin. We describe the systems support that we provide in order to achieve the generality, transparency, efficiency, and scalability goals of the system. The issues that we address include: managing "DVD robots" that automate mass-processing of DVDs, application-specific marshaling and unmarshaling of messages, providing best-effort reliable and secure delivery, simultaneous exploitation of conventional connectivity, and a mechanism for distributing and updating application code. Two additional support features are of particular importance. The first is a distributed object repository that makes available a single name space, on which any sites, including those that lack conventional networking access, can perform read, write, navigation, search, and other operations. This high-level abstraction makes it easier to construct distributed Postmanet applications. It also helps us realize a powerful "network effect," as spontaneous connections are established among sites that enjoy shared access to a common repository. The second is scalable routing. Simply leaving end users to directly swap discs with each other does not scale well, because as many as N2 discs may need to be exchanged at once in an N-node network. We solve this problem by multiplexing/de-multiplexing data to/from a smaller number of discs in transit. This can occur multiple times at dedicated nodes inside the network, or at peer end user nodes. We present routing topologies that can result in a good balance between simultaneously minimizing the number of discs involved and the end-to-end postal latency. We have built and deployed a real-world application, a rural distance learning system called the Digital StudyHall, on top of the Postmanet . It consists of a network of hubs and spokes, where the hubs are urban centers of excellence, which "radiate" content and methodology into poor villages and slum schools. Our experiences in rural India not only have provided us insights on the type of the systems support that we need, but also have allowed us to study mediation-based pedagogy that has proved promising in extending high-quality education to a needy population. For more information, please visit: http://dsh.cs.washington.edu.
A BDI agent architecture for dialogue modelling and coordination in a smart personal assistant
Authors: Wayne Wobcke, Van Ho, Anh Nguyen, Alfred Krzywicki
Venue: Proceedings of the 2005 NICTA-HCSNet Multimodal User Interaction Workshop - Volume 57 (2006)

In this paper, we discuss the architectural aspects of a Smart Personal Assistant (SPA) system that enables users to access a range of applications from a range of devices using multi-modal natural language dialogue. Each back-end application is a personal assistant specializing in one specific task such as e-mail or calendar management, and typically each has its own user model, enabling it to adapt to the user's changing preferences. The PDA interface to the SPA must present the system as a single unified set of back-end applications, enabling the user to conduct a dialogue in which it is easy to switch between these applications. Furthermore, the system's interaction with the user must be tailored to their current device. The SPA is implemented using an agent platform and includes a special BDI coordinator agent with plans both for coordinating the actions of the individual assistants and for encoding the system's dialogue model. The plan-based dialogue model is at a high level of abstraction, enabling the domain-independent plans in the dialogue model to be reused in different SPA systems.