ppxscal/embedding_network huggingface dataset:
Experiences evaluating personal metasearch
Authors: Paul Thomas, David Hawking
Venue: Proceedings of the second international symposium on Information interaction in context (2008)

Many current evaluation techniques for information retrieval, such as test collections and simulations, are difficult to apply in situations where queries and preferred results are context-dependent. This is particularly true in personal metasearch applications, which provide a person with unified search access to all their usual online sources. A recently-proposed technique, based on presenting two or more search results sets in a single comparison interface, offers an alternative. We have embedded this technique in a working personal metasearch tool which we have distributed to volunteers. Initial experiments with server selection suggest that the technique is accepted by users, can operate over diverse and unarticulated contexts, and that the data it provides can provide a useful comparison to that from test collections. Further experimentation with the technique is continuing.
Visualizing communities and centralities from encounter traces
Authors: Eiko Yoneki
Venue: Proceedings of the third ACM workshop on Challenged networks (2008)

We have previously demonstrated that information about social relationships can yield improved performance when it is used to control epidemic forwarding. We believe that extensive work to model human connectivity -- incorporating notions of community and interaction 'weight' -- is required if we are to understand this phenomenon and build networks that capitalize on it. This paper describes a visualization of detected community structures uncovered by different methods from human encounter traces. We focus on extracting information related to levels of clustering, network transitivity, and strong community structure. The position change of hub nodes within the network is also visualized.
Structurization of Learning/Instructional Design Knowledge for Theory-Aware Authoring Systems
Authors: Yusuke Hayashi, Jacqueline Bourdeau, Riichiro Mizoguchi
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

Currently, there are little guidelines on building quality standard-compliant learning courses. Although educational theories can be guidelines, there are difficulties in the practical use. An approach to the problem is to build a theory-aware and standard-compliant authoring system based on an ontology that establishes a multi-paradigm conceptual basis for learning/instructional theories. This paper discusses the feasibility of building such an ontology, as well as the functionality of a theory-aware authoring tool based on it.
An opportunity for engagement in cyberspace: Political youth Web sites during the 2004 European Parliament election campaign
Authors: Janelle Ward
Venue: Information Polity (2005)

The Internet is playing an increasing role in the political arena. Online election campaigns work to generate voter interest by providing more varied information and encouraging citizen participation in the electoral process. However, research has infrequently focused on how political websites particularly address young people. While youth are much more active online in many realms, including politics, than the average citizen, they are also becoming progressively more disconnected from traditional governmental and party politics. Some argue that such disengagement leads to increased apathy and even alienation. Political detachment, coupled with the younger generations' noteworthy online use and presence, points to a considerable Internet potential for reversing such indifference. Based on quantitative content analysis, this article examines the possibilities for online participation available to youth in the context of the 2004 European Parliament election campaign. Specifically, it evaluates the websites of youth branches of political parties and youth organisations in Britain and Ireland (n=46), to determine the amount and nature of information provided and engagement opportunities offered. This article provides an exploratory examination as to how the EP election was presented to youth and how youth are addressed online.
Goal-Oriented Autonomic Process Modeling and Execution for Next Generation Networks
Authors: Monique Calisti, Dominic Greenwood
Venue: Proceedings of the 3rd IEEE international workshop on Modelling Autonomic Communications Environments (2008)

The effective modeling, execution and maintenance of business and operations processes, such as those described by the eTOM process framework, is of utmost importance to Telecom organizations, especially those transitioning toward NGN infrastructure. Many Business Process Management Systems, BPMS, available today however are significantly restricted in their support for intuitive and expressive process models, run-time process agility and rapid process adaptation to cope with changing business and operational conditions. This paper discusses a means of mitigating these limitations with a highly expressive goal-oriented process management language, GO-BPMN, and innovative autonomic BPMS called LS/ABPM. Together, GO-BPMN and LS/ABPM offer an intuitive, business-driven path to creating directly executable goal-oriented process models whose structure encodes multiple degrees of freedom through the potential for late decision-making. Executing models can be structurally modified in real-time in response to autonomic feedback from underlying systems they are managing.
Efficient Parallel Tree Reductions on Distributed Memory Environments
Authors: Kazuhiko Kakehi, Kiminori Matsuzaki, Kento Emoto
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

A new approach for fast parallel reductions on trees over distributed memory environments is proposed. By employing serialized trees as the data representation, our algorithm has a communication-efficient BSP implementation regardless of the shapes of inputs. The prototype implementation supports its real efficacy.
Group discussion on technical applications
Authors: G. W. Petrie
Venue: Papers and discussions presented at the Dec. 8-10, 1953, eastern joint AIEE-IRE computer conference: information processing systems---reliability and requirements (1953)

The group discussion involved about 60 individuals representing both manufacturers and users of computing equipment. 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
Automated Context-Sensitive Dialog Synthesis for Enterprise Workflows Using Templatized Model Transformations
Authors: Amogh Kavimandan, Reinhard Klemm, Aniruddha Gokhale
Venue: Proceedings of the 2008 12th International IEEE Enterprise Distributed Object Computing Conference (2008)

In modern enterprises, workflows are essential to automating business processes. During their execution, workflows need to interact with users using a mechanism called dialogs to deliver information and collect input that is required for further decision-making in the workflows. Information delivery and input collection by enterprise workflows is often a time-sensitive matter. Thus, dialogs have to be communicated to users in a timely fashion, which necessitates sending dialogs to user communication endpoints that permit the recipients to quickly, effectively, and conveniently view the information and provide the requested feedback. The proliferation of communication devices and clients among enterprise users implies that the content and rendering of dialogs has to be tailored to a large number of endpoints and preferably by middleware. This customization poses several challenges to developing and maintaining a manageable, extensible, and flexible middleware mechanism for synthesizing dialogs from specific decision points in enterprise workflows.In this paper, we first describe the challenges associated with context-sensitive dialog synthesis. We discuss how we applied templatized model transformation techniques to automatically synthesize dialogs in enterprise workflows. We show how our templatized transformation approach supports the evolution of communication endpoints and system requirements with a minimum of downtime and invasive design changes. We demonstrate our approach in the context of a representative enterprise case study.
KLAPER: An Intermediate Language for Model-Driven Predictive Analysis of Performance and Reliability
Authors: Vincenzo Grassi, Raffaela Mirandola, Enrico Randazzo, Antonino Sabetta
Venue: The Common Component Modeling Example: Comparing Software Component Models (2007)

Automatic prediction tools play a key role in enabling the application of non-functional analysis to the selection and the assembly of components for component-based systems, without requiring extensive knowledge of analysis methodologies to the application designer. A key idea to achieve this goal is to define a model transformation that takes as input some "design-oriented" model of the component assembly and produces as a result an "analysis-oriented" model that lends itself to the application of some analysis methodology. For this purpose, we define a model-driven transformation framework, centered around a kernel language whose aim is to capture the relevant information for the analysis of non-functional attributes of component-based systems, with a focus on performance and reliability. Using this kernel language as a bridge between design-oriented and analysis-oriented notations we reduce the burden of defining a variety of direct transformations from the former to the latter to the less complex problem of defining transformations to/from the kernel language. The proposed kernel language is defined within the MOF (Meta-Object Facility) framework, to allow the exploitation of existing model transformation facilities. In this chapter, we present the key concepts of our methodology and we show its application to the CoCoME case study.
Colonial Competitive Algorithm as a Tool for Nash Equilibrium Point Achievement
Authors: Ramin Rajabioun, Esmaeil Atashpaz-Gargari, Caro Lucas
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

This paper presents an application of Colonial Competitive Algorithm (CCA) in game theory and multi-objective optimization problems. The recently introduced CCA has proven its excellent capabilities, such as faster convergence and better global optimum achievement. In this paper CCA is used to find Nash Equilibrium points of nonlinear non-cooperative games. The proposed method can also be used as an alternative approach to solve multi-objective optimization problems. The effectiveness of the proposed method, in comparison to Genetic Algorithm, is proven through several static and dynamic example games and also multi-objective problems.
Expression of Emotions in Virtual Humans Using Lights, Shadows, Composition and Filters
Authors: Celso Melo, Ana Paiva
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

Artists use words, lines, shapes, color, sound and their bodies to express emotions. Virtual humans use postures, gestures, face and voice to express emotions. Why are they limiting themselves to the body? The digital medium affords the expression of emotions using lights, camera, sound and the pixels in the screen itself. Thus, leveraging on accumulated knowledge from the arts, this work proposes a model for the expression of emotions in virtual humans which goes beyond embodiment and explores lights, shadows, composition and filters to convey emotions. First, the model integrates the OCC emotion model for emotion synthesis. Second, the model defines a pixel-based lighting model which supports extensive expressive control of lights and shadows. Third, the model explores the visual arts techniques of composition in layers and filtering to manipulate the virtual human pixels themselves. Finally, the model introduces a markup language to define mappings between emotional states and multimodal expression.
On the relation of graph grammars and graph automata
Authors: John Mylopoulos
Venue: Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972) (1972)

It is shown that a strong relationship exists between sets of graphs defined by graph (walking) automata with markers available and sets defined by graph grammars. Polynomial recognition algorithms are presented for certain classes of sets and it is argued that the existence of polynomial algorithms for other classes is doubtful. Other properties of the classes of sets defined by graph automata and graph grammars are also studied. 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
The evolution of a virtualized laboratory environment
Authors: Bill Stackpole
Venue: Proceedings of the 9th ACM SIGITE conference on Information technology education (2008)

Distance learning techniques for lecture-based courses have been employed with success for quite some time. Creating a hands-on laboratory environment to serve the same remote student population has proven to be difficult. This paper addresses the evolution of a remote laboratory system designed to provide faculty and students with a functional and accessible solution that offers an experience equivalent to that of an on-site laboratory. It addresses successes and failures. The designs for each of the iterations are discussed. Future integration with additional curriculum, as well as plans for community outreach, are proposed.
A New Approach to Exact Crossing Minimization
Authors: Markus Chimani, Petra Mutzel, Immanuel Bomze
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in practically efficient algorithms to solve the problem to provable optimality. In this paper, we present a novel integer linear programming (ILP) formulation for the crossing number problem. The former formulation [4] had to transform the crossing number polytope into a higher-dimensional polytope. The key idea of our approach is to directly consider the natural crossing number polytope and cut it with multiple linear-ordering polytopes. This leads to a more compact formulation, both in terms of variables and constraints.We describe a Branch-and-Cut algorithm, together with a combinatorial column generation scheme, in order to solve the crossing number problem to provable optimality. Our experiments show that the new approach is more effective than the old one, even when considering a heavily improved version of the former formulation (also presented in this paper). For the first time, we are able to solve graphs with a crossing number of up to 37.
Focus-Plus-Context Audio Interaction Design
Authors: David Gerhard, Brett Park, Jarrod Ellis
Venue: Computer Music Modeling and Retrieval. Sense of Sounds: 4th International Symposium, CMMR 2007, Copenhagen, Denmark, August 27-31, 2007. Revised Papers (2008)

We present an audio browsing and editing paradigm that incorporates the "focus plus context" visual interaction metaphor. A traditional waveform is displayed in full, and an area of focus is dynamically re-calculated to provide maximum detail in-focus and minimum detail in-context. The interaction metaphor also simultaneously re-scales a frequency-domain display, with increased detail available in both time and frequency domains by means of sub-sampling and window overlap. Various methods for selecting focus, identifying focus, and transitioning between the focus and context display areas are presented, and advantages for typical audio interaction applications are discussed. A collection of these ideas has been implemented within an open-source audio editing environment, and a discussion of this implementation and the related issues is presented.
Performance modelling and high performance buffer design for the system with network on chip
Authors: Jose G. Delgado-Frias
Venue:  (2007)

High performance novel dynamically allocated multi-queue (DAMQ) buffer schemes for systems with network on chip (NoC) have been proposed and evaluated in this dissertation. An analytical model to predict performance of a NoC where wormhole switching technique and fully adaptive routing protocols has been developed and compared with simulations.In this dissertation, a novel analytical model for NoC which makes use of simple close form calculations is presented. This model provides accurate network performance prediction in the network stable region. The validity of this model is demonstrated by comparing analytical prediction with simulation results obtained on high-radix k-ary 2-cube networks.Three novel switch buffer schemes, DAMQall, DAMQmin and DAMQshared, for system on chip with an interconnection network are also reported. The proposed schemes are based on a DAMQ self-compacting buffer hardware design. These schemes outperform existing approaches. DAMQall have similar performance using only half of the buffer size used in traditional SAMQ implementations. DAMQmin provides an excellent approach to optimize buffer management providing a good throughput when the network has a larger load. DAMQshared scheme lets virtual channels from different physical channel share free buffer space. While providing similar performance, DAMQshared scheme uses only around sixty percent of the buffer size that is used in traditional implementation for NoCs. In addition, using same size buffers, DAMQ shared outperforms existing approaches such as SAMQ and DAMQ all by 1% to 2% in throughput. The proposed schemes also make a better utilization of the available buffer space.
Scalability Analysis of the SPEC OpenMP Benchmarks on Large-Scale Shared Memory Multiprocessors
Authors: Karl Fürlinger, Michael Gerndt, Jack Dongarra
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

We present a detailed investigation of the scalability characteristics of the SPEC OpenMP benchmarks on large-scale shared memory multiprocessor machines. Our study is based on a tool that quantifies four well-defined overhead classes that can limit scalability --- for each parallel region separately and for the application as a whole.
Viral System to Solve Optimization Problems: An Immune-Inspired Computational Intelligence Approach
Authors: Pablo Cortés, José M. García, Luis Onieva, Jesús Muñuzuri, José Guadix
Venue: Proceedings of the 7th international conference on Artificial Immune Systems (2008)

This paper presents Viral System as a new immune-inspired computational intelligence approach to deal with optimization problems. The effectiveness of the approach is tested on the Steiner problem in networks a well known NP-Hard problem providing great quality solutions in the order of the best known approaches or even improving them.
A Study on the Relationship between the Export Pattern and Economic Growth in Henan Province
Authors: Fei Wang, Jiangbo Huangfu
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

Based on the data collected from 1990 to 2005, this paper explores the short-term and long-term relationship between Henan's Export Pattern and economic growth by applying co-integration analysis, Granger causality test, as well as ECM. The conclusion is: There is a long-term equilibrium relationship between Henan's economic growth, primary products export and manufactured goods export; each of those three variables does Granger cause the others respectively. And in the short run, both the second-lag-phase primary products export of Henan and the fourth-lag-phase manufactured goods export of Henan give rise to the short-term fluctuation of Henan’s economic growth.
Application of PID Controller Based on BP Neural Network Using Automatic Differentiation Method
Authors: Weiwei Yang, Yong Zhao, Li Yan, Xiaoqian Chen
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

A simulation analysis of PID controller based on Back-Propagation Neural Network (BPNN) using Automatic Differentiation Method (ADM) is presented. As accurate partial differentiation can be acquired using ADM, the original meaning of learning rate is regained. By comparing with conventional PID controller, the simulation results of a simple tracking problem show that the new controller has a good adaptability for the nonlinear system, which benefits from on-line self-learning. Furthermore, experimental results are presented for an autonomous docking of the chaser simulator to the target, which validates the effectiveness and good robustness of the proposed controller.
Restoring Natural Language as a Computerised Mathematics Input Method
Authors: Fairouz Kamareddine, Robert Lamar, Manuel Maarek, J. B. Wells
Venue: Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference (2007)

Methods for computerised mathematics have found little appeal among mathematicians because they call for additional skills which are not available to the typical mathematician. We herein propose to reconcile computerised mathematics to mathematicians by restoring natural language as the primary medium for mathematical authoring. Our method associates portions of text with grammatical argumentation roles and computerises the informal mathematical style of the mathematician. Typical abbreviations like the aggregation of equations a = b > c, are not usually accepted as input to computerised languages. We propose specific annotations to explicate the morphology of such natural language style, to accept input in this style, and to expand this input in the computer to obtain the intended representation (i.e., a = b and b > c). We have named this method syntax souring in contrast to the usual syntax sugaring. All results have been implemented in a prototype editor developed on top of ${\rm\kern-.15em T\kern-.1667em\lower.7ex\hbox{E}\kern-.125emX}$ $_{{\rm {\sc MACS}}}$ as a GUI for the core grammatical aspect of MathLang, a framework developed by the ULTRA group to computerise and formalise mathematics.
A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata
Authors: Friedrich Otto, Martin Plátek
Venue: Language and Automata Theory and Applications: Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers (2008)

We study proper languages of (strongly) lexicalized FRR-automata, which are a theoretical model for the analysis by reduction that is used in structural analysis of (natural) languages. We obtain two variants of a two-dimensional hierarchy of language classes based on two types of constraints: (1) the number of rewrite operations per cycle, and (2) the number of occurrences of auxiliary symbols (categories) in the sentences (words) of the corresponding characteristic language. The former type of constraints models non-local valences (dependencies), and the latter type models the use of categories during syntactic disambiguation of the sentence being analyzed.