ppxscal/embedding_network huggingface dataset:
Activation of the Human Superior Temporal Gyrus during Observation of Goal Attribution by Intentional Objects
Authors: Johannes Schultz, Hiroshi Imamizu, Mitsuo Kawato, Chris D. Frith
Venue: Journal of Cognitive Neuroscience (2004)

Previous functional imaging experiments in humans showed activation increases in the posterior superior temporal gyrus and sulcus during observation of geometrical shapes whose movements appear intentional or goal-directed. We modeled a chase scenario between two objects, in which the chasing object used different strategies to reach the target object: The chaser either followed the target's path or appeared to predict its end position. Activation in the superior temporal gyrus of human observers was greater when the chaser adopted a predict rather than a follow strategy. Attending to the chaser's strategy induced slightly greater activation in the left superior temporal gyrus than attending to the outcome of the chase. These data implicate the superior temporal gyrus in the identification of objects displaying complex goal-directed motion.
Dynamic Architecture Adaptation in WS Environment
Authors: Simone Grassi, Stephen Barrett
Venue: Proceedings of the International Conference on Autonomic and Autonomous Systems (2006)

Coordination research aims to increase flexibility in software by constructing software from autonomous functional components, assembled and allowed to interact according to a separate and distinct coordination specification. Concepts of coordination and orchestration are increasingly included in standards for Web Services. Moreover, semantic WS specifications have emerged as the basis for automatic composition of services. In this paper we apply a coordination approach to the construction of web services that enables clients to specify substantial adaption of web service behavior, in order to better integrate with client requirements. We illustrate by way on a simple example how this approach can be practically applied and propose platform support for dynamic runtime adaption of web services.
Fast Summation of Radial Functions on the Sphere
Authors: J. Keiner, S. Kunis, D. Potts
Venue: Computing (2006)

Radial functions are a powerful tool in many areas of multi-dimensional approximation, especially when dealing with scattered data. We present a fast approximate algorithm for the evaluation of linear combinations of radial functions on the sphere **. The approach is based on a particular rank approximation of the corresponding Gram matrix and fast algorithms for spherical Fourier transforms. The proposed method takes ** (L) arithmetic operations for L arbitrarily distributed nodes on the sphere. In contrast to other methods, we do not require the nodes to be sorted or pre-processed in any way, thus the pre-computation effort only depends on the particular radial function and the desired accuracy. We establish explicit error bounds for a range of radial functions and provide numerical examples covering approximation quality, speed measurements, and a comparison of our particular matrix approximation with a truncated singular value decomposition.
Value-Based Dynamic Composition of Web Services
Authors: Kazuto Nakamura, Mikio Aoyama
Venue: Proceedings of the XIII Asia Pacific Software Engineering Conference (2006)

Dynamic composition of Web services encounters many challenges including selecting qualified services, composing services dynamically, and assuring quality of services. This article proposes a value model and its representation language, VSDL (Value-based Service Description Language), of Web services, and an architecture of value-added service broker of dynamically composing Web services based on the value model. The value model defines a common model of diverse quality aspects of Web services. We also propose a value metamodel representing relationships among values. The value-added service broker provides value-based service selection, composition and assurance of services. To specify service interfaces with values, the VSDL extends the service interface descriptions of WSDL with the value model. Based on the VSDL, the value-added service broker generates process of composing services and generates WS-BPEL codes for composition. We implemented a prototype of value-added service broker and demonstrated the effusiveness with a case study using three dictionary services.
Writing Questions for an Intelligent Book Using External AI
Authors: Kasim Rehman, William Billingsley, Peter Robinson
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Intelligent Books are Web-based textbooks that can adapt and improve their content and guide students through graphical example exercises that resemble the diagrams and notations a student might use on paper. The exercises use formal AI systems to analyse students' work, and different AI systems are used for different questions. This brings the issue of how a person can write questions if they are not an expert in the AI system used. We describe our experiences developing an authoring tool for electronics questions that use a specialised circuit AI with its own extensive circuit language. The tool works on the principle of exposing an appropriate visual model of the AI, while factoring out the language detail and the architecture of the book itself, and allowing the question writer to decide which parts of the AI model to expose to the student (as the desired mental model for the student).
Constructing multi-point discrete event integration schemes
Authors: James Nutaro
Venue: Proceedings of the 37th conference on Winter simulation (2005)

The systematic study of discrete event numerical integration schemes can be greatly aided by an understanding of their general form. This paper describes the structure of DEVS models that can be used to construct multi-point discrete event integration methods. The structure is shown to be sufficient for describing two known methods. The utility of the structure is illustrated by the construction of a new, second order accurate, multi-point discrete event integrator.
Molecular Caches: A caching structure for dynamic creation of application-specific Heterogeneous cache regions
Authors: Keshavan Varadarajan, S. K. Nandy, Vishal Sharda, Amrutur Bharadwaj, Ravi Iyer, Srihari Makineni, Donald Newell
Venue: Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture (2006)

CMPs enable simultaneous execution of multiple applications on the same platforms that share cache resources. Diversity in the cache access patterns of these simultaneously executing applications can potentially trigger inter-application interference, leading to cache pollution. Whereas a large cache can ameliorate this problem, the issues of larger power consumption with increasing cache size, amplified at sub-100nm technologies, makes this solution prohibitive. In this paper, in order to address the issues relating to power-aware performance of caches, we propose a caching structure that addresses the following: 1. Definition of application-specific cache partitions as an aggregation of caching units (molecules). The parameters of each molecule namely size, associativity and line size are chosen so that the power consumed by it and access time are optimal for the given technology. 2. Application-Specific resizing of cache partitions with variable and adaptive associativity per cache line, way size and variable line size. 3. A replacement policy that is transparent to the partition in terms of size, heterogeneity in associativity and line size. Through simulation studies we establish the superiority of molecular cache (caches built as aggregations of molecules) that offers a 29% power advantage over that of an equivalently performing traditional cache.
Optimizing progressive query-by-example over pre-clustered large image databases
Authors: Anicet Kouomou Choupo, Laure Berti-Équille, Annie Morin
Venue: Proceedings of the 2nd international workshop on Computer vision meets databases (2005)

The typical mode for querying in an image content-based information system is query-by-example, which allows the user to provide an image as a query and to search for similar images (i.e., the nearest neighbors) based on one or a combination of low-level multidimensional features of the query example. Off-lime, this requires the time-consuming pre-computing of the whole set of visual descriptors over the image database. On-line, one major drawback is that multidimensional sequential NN-search is usually exhaustive over the whole image set face to the user who has a very limited patience. In this paper, we propose a technique for improving the performance of image query-by-example execution strategies over multiple visual features. This includes first, the pre-clustering of the large image database and then, the scheduling of the processing of the feature clusters before providing progressively the query results (i.e., intermediate results are sent continuously before the end of the exhaustive scan over the whole database). A cluster eligibility criterion and two filtering rules are proposed to select the most relevant clusters to a query-by-example. Experiments over more than 110 000 images and five MPEG-7 global features show that our approach significantly reduces the query time in two experimental cases: the query time is divided by 4.8 for 100 clusters per descriptor type and by 7 for 200 clusters per descriptor type compared to a "blind" sequential NN-search with keeping the same final query result. This constitutes a promising perspective for optimizing image query-by-example execution.
Watermark Integration to Wavelet Image Coding Scheme
Authors: A. Makhloufi, A. Ouled Zaid, R. Bouallegue, A. Bouallegue
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

With the blossoming demand for efficiently storing and transmitting digital information, image compression has been increasingly vital. On the other hand, at very low bitrates, lossy compression is supposed to be a strong attack to watermarking process. In this work, we attempt to integrate watermarking in wavelet-based image coding. In our study, we used three different wavelet-based compression techniques. The last two coders are respectively included in part I and part II of JPEG2000 standard. Taking advantage of the coding architecture, a watermark embedding is directly performed on the wavelet coefficients before the quantization phase. On the recovery stage, the hide information may be retrieved during the decoding or where ever we decompose the reconstructed image on its wavelet domain. Experimental results have shown that blind watermarking coupled with JPEG2000-based image coders exhibits a high robustness to compression attacks with respect to the quality of the reconstructed images. Moreover, its time consuming is negligible compared to coding and decoding duration.
Determination of equivalence between quantum sequential machines
Authors: Lvzhou Li, Daowen Qiu
Venue: Theoretical Computer Science (2006)

Quantum sequential machines (QSMs) that may be viewed as a quantum variant of stochastic sequential machines (SSMs) are one of the important quantum computing models. A very crucial result on SSMs is that two SSMs with n and n' states, respectively, and the same input and output alphabets are equivalent if and only if they are (n + n' - 1)-equivalent. Therefore, Gudder asked whether or not it holds for QSMs, as an open problem in this direction, since the further study is closely related to this result. Qiu demonstrated that in QSMs this result does not hold, and therefore answered in part the problem. However, as Qiu indicated, the sufficient and necessary conditions for the equivalence between two QSMs are still not discovered. In this paper, we show that if the condition of (n + n' -1)-equivalence is appropriately relaxed, then we can give a sufficient and necessary condition for justifying the equivalence between two QSMs. More precisely, we show that any two QSMs M and M' are equivalent if and only if they are (n + n')2-equivalent, where n and n' are, respectively, the numbers of states in M and M'. We therefore solve the open problem suggested by Gudder, and provide a basic result for further developing QSMs. As well, we discuss strongly factorizable QSMs and present the conditions for the equivalence between two strongly factorizable QSMs.
Dual-Role Based Access Control Framework for Grid Services
Authors: Lina Ge, Shaohua Tang, Qiao Kuang
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

In the grid environment, the resource providers should maintain the ultimate authority over their resources, including access authorization and grain scale control. Apparently, the traditional RBAC model will be inappropriate in multi-autonomous domains environment. Focusing on the autonomous, heterogeneous and dynamic features of grid computing, we propose the concept of "Resource Role". We also initiate the Dual-Role Based Access Control (DRBAC) framework, where the resource role permission mapping is defined in resource domain and user role resource role mapping is negotiated by user domain and resource domain. This framework is simple and works better than the traditional RBAC in multi domains environment.
Improved Noise Spectra Estimation and Log-spectral Regression for In-car Speech Recognition
Authors: Weifeng Li, Katunobu Itou, Kazuya Takeda, Fumitada Itakura
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

In this paper, we present a two-stage noise spectra estimation approach. After the first-stage noise estimation using the improved minima controlled recursive averaging (IMCRA) method, the second-stage noise estimation is performed by employing a maximum a posteriori (MAP) noise amplitude estimator. We also develop a regression-based speech enhance system by approximating the clean speech with the estimated noise and original noisy speech. Evaluation experiments show that the proposed two-stage noise estimation method results in lower estimation error for all test noise types. Compared to original noisy speech, the proposed regression-based approach obtains an average relative word error rate (WER) reduction of 65% in our isolated word recognition experiments conducted in 12 real car environments.
Access to Lexical Information in Language Comprehension: Semantics before Syntax
Authors: Oliver Müller, Peter Hagoort
Venue: Journal of Cognitive Neuroscience (2006)

The recognition of a word makes available its semantic and syntactic properties. Using electrophysiological recordings, we investigated whether one set of these properties is available earlier than the other set. Dutch participants saw nouns on a computer screen and performed push-button responses: In one task, grammatical gender determined response hand (left/right) and semantic category determined response execution (go/no-go). In the other task, response hand depended on semantic category, whereas response execution depended on gender. During the latter task, response preparation occurred on no-go trials, as measured by the lateralized readiness potential: Semantic information was used for response preparation before gender information inhibited this process. Furthermore, an inhibition-related N2 effect occurred earlier for inhibition by semantics than for inhibition by gender. In summary, electrophysiological measures of both response preparation and inhibition indicated that the semantic word property was available earlier than the syntactic word property when participants read single words.
Handheld-Mediated Communication to Support the Effective Sharing of Meaning in Joint Activity
Authors: Kibum Kim, Deborah Tatar, Steve Harrison
Venue: Proceedings of the Fourth IEEE International Workshop on Wireless, Mobile and Ubiquitous Technology in Education (2006)

This paper reports the results of a laboratory study of a proposed solution to the problem of coordinating entry into collaborative activity while protecting the privacy and control of individuals over small-scale devices. The particular set of design requirements we work with are abstracted away from prior work on the constraints and affordances of a middle school teaching/learning setting. We implement on handheld devices a proposed functionality, Look, intended to enable a side assistant to see what is happening in an activity without interrupting that activity. The question is whether Look is sufficient to allow effective comprehension of the situation and effective action based on that comprehension. To evaluate the success of this functionality, we draw on preexisting psycholinguistic/CSCL (computer supported collaborative learning) theory on (1) shared visual spaces and (2) overhearer comprehension. The associated experimental paradigm increases the occurrence of the interpersonal challenges we wish to study over their spontaneous rate in the classroom. Our variant of the paradigm provides preliminary evidence that our design is viable. It also extends the paradigm by casting light on which elements of the situation were responsible for results in prior experiments, and which may be further amenable to technological manipulation.
Lower bounds on the vertex-connectivity of digraphs and graphs
Authors: Angelika Hellwig, Lutz Volkmann
Venue: Information Processing Letters (2006)

Since interconnection networks are often modeled by graphs or digraphs, the connectivity of a (di-)graph is an important measurement for fault tolerance of networks.Let G be a graph of order n, minimum degree δ, and vertex-connectivity k. If G is not the complete graph, then Chartrand and Harary [G. Chartrand, F. Harary, Graphs with prescribed connectivities, in: P. Erdös, G. Katona (Eds.), Theory of Graphs, Academic Press, New York, 1968, pp. 61-63] proved in 1968 that k≥2δ+2-n.In 1993, Topp and Volkmann [J. Topp, L. Volkmann, Sufficient conditions for equality of connectivity and minimum degree of a graph, J. Graph Theory 17 (1993) 695-700] proved the following analog bound for bipartite graphs. If G is a bipartite graph with k<δ then k≥4δ-n.In this paper we present some generalizations and extensions of these inequalities for digraphs as well as for graphs.
Dimension-Based Subscription Pruning for Publish/Subscribe Systems
Authors: Sven Bittner, Annika Hinze
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

Subscription pruning has been proven as valuable routing optimization for Boolean subscriptions in publish/ subscribe systems. It aims at optimizing subscriptions independently of each other and is thus applicable for all kinds of subscriptions regardless of their individual and collective structures. The original subscription pruning approach tries to optimize the event routing process based on the expected increase in network load. However, a closer look at pruning-based routing reveals its further applicability to optimizations in respect to other dimensions. In this paper, we introduce and investigate subscription pruning based on three dimensions of optimization: network load, memory usage, and system throughput. We present the algorithms to perform prunings based on these dimensions and discuss the results of a series of practical experiments. Our analysis reveals the advantages and disadvantages of the different dimensions of optimization and allows conclusions about the suitability of dimension-based pruning for different application requirements.
Multi-Level Modeling and Distributed Agent-Based Inference: the Role of System Structure
Authors: Gregory Provan
Venue: Proceedings of the 11th IEEE International Conference on Engineering of Complex Computer Systems (2006)

We describe a framework for modeling and performing inference on complex systems, based on an Attributed Programmed Graph Grammar (APGG) meta-model. We outline this APGG framework, and how it can be used. In particular, show how we can use the underlying system structure as an organising principle for model specification and analysis. In addition, we examine the attribution we assign to the higher-level systems models, namely a constraintbased language, and how a distributed agent-based approach can regulate inference performed asynchronously on several multi-level models.
European Research Forum Panel Session Envisioning Research Challenges in Visual Analytics
Authors: Mikael Jern, Ebad Banissi, Gennady Andreinko, Wolfgang Muller, Daniel Keim
Venue: Proceedings of the conference on Information Visualization (2006)

Visual Analytics is the science of analytical reasoning supported by interactive visual interfaces. People use visual analytics tools and techniques to synthesize information; derive insight from massive, dynamic, and often conflicting data; detect the expected and discover the unexpected; provide timely, defensible, and understandable assessments; and communicate assessments effectively for action. The issues stimulating this body of research provide a grand challenge in science: turning information overload into the opportunity of the decade. Visual analytics requires interdisciplinary science beyond traditional scientific and information visualization to include statistics, data mining, knowledge and discovery technologies, cognitive science and humancomputer interaction, production and presentation, and more. An important research agenda "Illuminating the Path" provides recommendations for the next generation suite of visual analytics technologies and is available at http://nvac.pnl.gov/agenda.stm .
The challenges for computer supported collaborative learning in elementary and secondary level: Finnish perspectives
Authors: Lasse Lipponen
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

Computer supported collaborative learning (CSCL) offers promising innovations and tools for restructuring teaching-learning processes to prepare students for the emerging knowledge society. However, sufficient and reliable data have not been available concerning how the practices of CSCL fit in different school cultures, and how teachers with varying pedagogical and domain expertise and students with varying skills, attitudes and learning experiences are able to function with different network learning environments. This paper discusses the challenges of CSCL on the basis of intensive case studies conducted in Finnish elementary and secondary schools. The results of these studies indicate that in order to promote educational change and facilitate practices of collaboration at school with the new information and communication technology and CSCL, serious challenges have to be overcome. The analysis revealed challenges that can be categorized according to three dimensions: pedagogical, technical, and organizational. Focus of the article is on pedagogical challenges.
Bootstrapping techniques in the estimation of higher-order cumulants from short data records
Authors: Y. Zhang, D. Hatzinakos, A. N. Venetsanopoulos
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The authors propose to apply bootstrap based techniques to investigate and improve the estimates of higher-order cumulants obtained from short data records. Algorithms for the calculation of the standard deviation and the confidence interval of cumulant estimates have been developed. Based on the algorithms, the authors describe a method for the estimation of risk function of various sampled cumulants, with the goal of choosing the estimator with best risk properties in the bootstrapping sense. Simulation results were obtained and are shown in tables.