ppxscal/embedding_network huggingface dataset:
Conversation-and-Control
Authors: Andreas Loehr
Venue:  (2007)

Controlling graphical user interfaces (GUI) by speech is slow, but proves useful for disabled persons with limitations in operating mouse and keyboard. This book presents a new approach, which promises to achieve shorter task completion times than prior art. The author first introduces speech-controlled GUI research by giving an overview of currently available technology. Then he analyzes the properties of different technological approaches for which he derives a common theoretical model. Motivated by the results, he then develops Conversation-and-Control, a new approach, which facilitates direct manipulation of graphical objects by spoken commands. The approach employs mixed-initiative dialogs based on heuristics for inferring the meaning of speech recognition results. The model also includes the ability for the system to ask clarification questions, thus, avoids the rejection of recognition errors where possible. The author describes the internal algorithms of Conversation-and-Control and discusses a user study which indicates a significant reduction of task completion time over prior art. The book is directed to researches and practitioners in speechcontrolled GUI research. 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
Completing the Virtual Analogy of Real Institutions via iObjects
Authors: Inmaculada Rodríguez, Maria Salamó, Maite López-Sánchez, Jesús Cerquides, Anna Puig, Carles Sierra
Venue: Proceeding of the 2007 conference on Artificial Intelligence Research and Development (2007)

Electronic Institutions are regulated environments populated by autonomous software agents that perform tasks on behalf of users. 3D Electronic Institutions extend EI with 3D Virtual Worlds, which provide an inmersive user interface so that humans can observe their agents' behaviors. In this manner, they represent a virtual analogy to real institutions. We propose to gain on realism on this analogy by adding intelligent objects to these institutions. Intelligent institutional objects (iObjects) exhibit autonomous and reactive behaviors. Furthermore, they present a limited level of proactivity such as self-configuration. Their inclusion has the advantage of improving the 3D Electronic Institutions architecture and both agent and user interactions within the institution.
On the ability of the 802.11p MAC method and STDMA to support real-time vehicle-to-vehicle communication
Authors: Katrin Bilstrup, Elisabeth Uhlemann, Erik G. Ström, Urban Bilstrup
Venue: EURASIP Journal on Wireless Communications and Networking (2009)

Traffic safety applications using vehicle-to-vehicle (V2V) communication is an emerging and promising area within the intelligent transportation systems (ITS) sphere. Many of these new applications require real-time communication with high reliability, meaning that packets must be successfully delivered before a certain deadline. Applications with early deadlines are expected to require direct V2V communications, and the only standard currently supporting this is the upcoming IEEE 802.11p, included in the wireless access in vehicular environment (WAVE) stack. To meet a real-time deadline, timely and predictable access to the channel is paramount. However, the medium access method used in 802.11p, carrier sense multiple access with collision avoidance (CSMA/CA), does not guarantee channel access before a finite deadline. In this paper, we analyze the communication requirements introduced by traffic safety applications, namely, low delay, reliable, real-time communications. We show by simulation of a simple, but realistic, highway scenario, that vehicles using CSMA/CA can experience unacceptable channel access delays and, therefore, 802.11p does not support real-time communications. In addition, we present a potential remedy for this problem, namely, the use of self-organizing time division multiple access (STDMA). The real-time properties of STDMA are investigated by means of the same highway simulation scenario, with promising results.
Towards optimal MAC without message passing in wireless networks
Authors: Yung Yi, Jinsung Lee, Song Chong, Mung Chiang, Alexandre Proutière
Venue: Proceedings of the 4th International Conference on Future Internet Technologies (2009)

One of the key messages in significant research on cross-layer design of wireless networks over the past 15 years is that extensive message passing may be necessary to achieve optimal performance. Heavy message passing is obviously an undesirable feature for practical implementation due to its reduced actual throughput and security issues. In this paper, we first summarize our preliminary work that does not need message passing, yet achieves near-optimality. Then, we present our recent efforts to realize such an algorithmic solution in a real network, e.g., IEEE 802.11-based systems, and discuss possible future research directions.
An Observation on Non-Malleable Witness-Indistinguishability and Non-Malleable Zero-Knowledge
Authors: Zongyang Zhang, Zhenfu Cao, Rong Ma
Venue: Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation (2009)

Ostrovsky et al. [1] gave the first definition of non-malleable witness-indistinguishable argument systems. A surprising result given by them showed this notion was incomparable with the notion of non-malleable zero-knowledge. However, they only discussed their relations in the interactive setting. In this paper, we make an observation on relation between the two notions in the non-interactive setting. We show the two notions are still incomparable: that is, there are non-malleable non-interactive zero-knowledge proof systems that are not non-malleable non-interactive witness-indistinguishable, and vice versa.
Piecewise parametric polynomial fuzzy sets
Authors: Doraid M. Dalalah
Venue: International Journal of Approximate Reasoning (2009)

We present a scheme for tractable parametric representation of fuzzy set membership functions based on the use of a recursive monotonic hierarchy that yields different polynomial functions with different orders. Polynomials of the first order were found to be simple bivalent sets, while the second order polynomials represent the typical saw shape triangles. Higher order polynomials present more diverse membership shapes. The approach demonstrates an enhanced method to manage and fit the profile of membership functions through the access to the polynomials order, the number and the multiplicity of anchor points as wells as the uniformity and periodicity features used in the approach. These parameters provide an interesting means to assist in fitting a fuzzy controller according to system requirements. Besides, the polynomial fuzzy sets have tractable characteristics concerning the continuity and differentiability that depend on the order of the polynomials. Higher order polynomials can be differentiated as many times as the order of the polynomial less the multiplicity of the anchor points. An algorithmic optimization approach using the steepest descent method is introduced for fuzzy controller tuning. It was shown that the controller can be optimized to model a certain output within small number of iterations and very small error margins. The mathematics generated by the approach is consistent and can be simply generalized to standard applications. The recursive propagation was noticed for its clarity and ease of calculations. Further, the degree of association between the sets is not limited to the neighbors as in traditional applications; instead, it may extend beyond. Such approach can be useful in dynamic fuzzy sets for adaptive modeling in view of the fact that the shape parameters can be easily altered to get different profiles while keeping the math unchanged. Hypothetically, any shape of membership functions under the partition of unity constraint can be produced. The significance of the mentioned characteristics of such modeling can be observed in the field of combinatorial and continuous parameter optimization, automated tuning, optimal fuzzy control, fuzzy-neural control, membership function fitting, adaptive modeling, and many other fields that require customized as well as standard fuzzy membership functions. Experimental work of different scenarios with diverse fuzzy rules and polynomial sets has been conducted to verify and validate our results.
Quantum Plasmadynamics: Unmagnetized Plasmas, 1st edition
Authors: Donald Melrose
Venue: Lecture Notes In Physics (2007)

The field of quantum plasmas has a long and diverse tradition and is becoming of increasing current interest, motivated by applications to micro-electronics and to focused high-power lasers. In this book, plasma kinetic theory is developed a covariant (4-tensor) notation, which facilitates generalizations to include all relativistic and electromagnetic effects. Relativistic quantum effects are incorporated by synthesizing the theory with quantum electrodynamics (QED), including the plasma responses in QED, and using QED to calculate the plasma response 4-tensors. 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
Digitally implemented interactive fiction: systematic development and validation of "mole, p.i", a multimedia adventure for third grade readers
Authors: James A. White
Venue:  (2008)

&ldquo;Interactive fiction&rdquo; has been used to describe many of today&rsquo;s multimedia products. In reality, there is not a universal understanding of what interactive fiction is or what it should entail. The meaning of &ldquo;interactive&rdquo; is often interpreted in different ways. Many stories are considered to be interactive because they are placed on the computer. Meanwhile, such stories may lack most of the essential qualities for good literature. Interaction fiction should be upheld to the same standards as traditional texts. Following this belief, this research covers the underlying theories of interactive fiction, examples of misleading &ldquo;interactive fiction&rdquo; studies, and guidelines for design pulled from the fields of writing, children&rsquo;s literature and instructional technology. I have used these guidelines to develop a prototype of interactive fiction, which was be tested and revised in several cycles. First, I revised the prototype based upon reviews by several groups of experts from the areas of instructional technology and childhood education. The prototype was then pilot-tested by two participants from the target market. Based upon the pilot-test results, I revised the prototype. Finally, several participants read the prototype. In this final stage, I observed the participants and conducted interviews with open-ended questions. Using the prototype that was developed according to proposed standards, I was able to gain insight into the target market&rsquo;s perception of interaction fiction. All details of the design and development of the prototype are included in effort to provide guidelines for building future interactive fiction. Additionally, several themes emerged when participants from the target market were observed and interviewed. Among the most prominent were the themes of storybook characters and identifying with those characters. Children in this study were able to identity themselves as the protagonist, making the main character&rsquo;s decisions throughout the story. Further, participants added their own elaborations of the story. In the end, the evidence of this research showed that participants were able to go beyond reading the story. The submersion into to story can be rooted in several existing literacy theories, which are discussed. Lastly, this research provides suggestions for future research, development and implementation of interactive fiction.
Plenary lecture V: why are wordnets important?
Authors: Janos Csirik
Venue: Proceedings of the 2nd conference on European computing conference (2008)

Wordnets are lexical databases in which words are organized into clusters based on their meanings, and they are linked to each other through different semantic and lexical relations. The first wordnet called Princeton WordNet has been created for English, which has been followed by various wordnets born within the framework of EuroNet and BalkaNet projects. We focuses on the development of the Wordnets and of the Hungarian WordNet (HuWN). The process of constructing HuWn is illustrated with examples, some language-specific and language-independent problems encountered during the building process are discussed, and basic statistical data on HuWN are presented as well. Finally, two subontologies of HuWN, namely, the financial domain ontology and the legal domain ontology are also presented, with applications.
User-Centered Interaction Design Patterns for Interactive Digital Television Applications, 1st edition
Authors: Tibor Kunert
Venue:  (2009)

When a new technology such as interactive digital television is introduced to a wider audience, ease of use is often critical to success. By focusing on these usability issues with the aim of supporting user acceptance for interactive TV, Tibor Kunert provides clear guidelines for designing the user interfaces on interactive TV applications. This guidance is presented in the form of design patterns, and a new approach is proposed that helps designers and developers to explore design alternatives and to evaluate the trade-offs that need to be made in order to maximise usability. The 42 design patterns containing 185 guidelines provide comprehensive and empirically-validated guidance for designing interactive TV user interfaces. A pattern language is developed which can be used for designing specific applications, for enduring usability, and for defining corporate style guidelines and developing application templates that help streamline the process of production.
Summative Computer Programming Assessment Using Both Paper and Computer
Authors: Pari Delir Haghighi, Judy Sheard
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

Selection of an appropriate assessment method has become a crucial issue in computer programming courses as many feel the traditional paper-based examinations are not delivering the desired results for either students or educators. The poor performance of students in written exams and their lack of real-world programming skills have encouraged educators to seek assessment methods other than pen and paper. This paper presents the findings of a study of an introductory computer programming final assessment which applied a combination of paper-based and laboratory exams. Pre-exam and post-exam surveys were conducted to find out students' attitudes towards the new assessment method and to investigate factors which have been shown in other studies to impact on test performance. Relationships between test anxiety and student characteristics of gender, previous computer experience and previous experience with computer-based assessment were investigated and reported.
Secrets of the Oracle Database, 1st edition
Authors: Norbert Debes
Venue:  (2009)

Secrets of the Oracle Database is the definitive guide to undocumented and partially documented features of the Oracle database server. Covering useful but littleknown features from Oracle9i Database through Oracle Database 11g, this book will improve your efficiency as an Oracle database administrator or developer. Norbert Debes shines the light of day on features that help you master more difficult administrative, tuning, and troubleshooting tasks than you ever thought possible. Finally, in one place, you have at your fingertips knowledge that previously had to be acquired through years of experience and word of mouth through knowing the right people. What Norbert writes is accurate, welltested, wellillustrated by clear examples, and sure to improve your ability to make an impact in your daytoday work with Oracle. What youll learn Take advantage of Oracles builtin Perl DBI distribution to write applications for monitoring, benchmarking, data extraction, and more. Interpret the undocumented, extended trace file format to pinpoint performance problems that TKPROF reports overlook and obscure. Get the most out of Statspack by using undocumented report formatting options, accessing its scarcelydocumented repository, and integrating with SQL Trace. Take control of your instance through the illdocumented ORADEBUG command, enabling you to control processes, trace SQL statements, dump process state, monitor wait events and the call stack, and much more. Leverage undocumented features in Oracles builtin scheduler to better automate your workload. Take full advantage of Transparent Application Failover and Cluster Database Services in a Real Application Cluster environment. Who is this book for? Secrets of the Oracle Database is written for database administrators and developers well past the beginner level who desire to take full advantage of the power the Oracle platform has to offer. The book is by no means an introductory book. Readers should already be familiar and comfortable with SQL and PL/SQL, and should have a good grounding in Oracle database architecture.
Convex variational Bayesian inference for large scale generalized linear models
Authors: Hannes Nickisch, Matthias W. Seeger
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

We show how variational Bayesian inference can be implemented for very large generalized linear models. Our relaxation is proven to be a convex problem for any log-concave model. We provide a generic double loop algorithm for solving this relaxation on models with arbitrary super-Gaussian potentials. By iteratively decoupling the criterion, most of the work can be done by solving large linear systems, rendering our algorithm orders of magnitude faster than previously proposed solvers for the same problem. We evaluate our method on problems of Bayesian active learning for large binary classification models, and show how to address settings with many candidates and sequential inclusion steps.
Spatial-temporal causal modeling for climate change attribution
Authors: Aurelie C. Lozano, Hongfei Li, Alexandru Niculescu-Mizil, Yan Liu, Claudia Perlich, Jonathan Hosking, Naoki Abe
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Attribution of climate change to causal factors has been based predominantly on simulations using physical climate models, which have inherent limitations in describing such a complex and chaotic system. We propose an alternative, data centric, approach that relies on actual measurements of climate observations and human and natural forcing factors. Specifically, we develop a novel method to infer causality from spatial-temporal data, as well as a procedure to incorporate extreme value modeling into our method in order to address the attribution of extreme climate events, such as heatwaves. Our experimental results on a real world dataset indicate that changes in temperature are not solely accounted for by solar radiance, but attributed more significantly to CO2 and other greenhouse gases. Combined with extreme value modeling, we also show that there has been a significant increase in the intensity of extreme temperatures, and that such changes in extreme temperature are also attributable to greenhouse gases. These preliminary results suggest that our approach can offer a useful alternative to the simulation-based approach to climate modeling and attribution, and provide valuable insights from a fresh perspective.
An Implementation Method for Semantic Document Search with Dynamic Relevance Routing by Hierarchical and Causal Relationships for Psychiatry
Authors: Yukiko Sone, Naofumi Yoshida, Yasushi Kiyoki
Venue: Proceeding of the 2007 conference on Information Modelling and Knowledge Bases XVIII (2007)

In this paper, we present an implementation method for semantic document search with dynamic relevance routing by hierarchical and causal relationships among concepts. This method makes it possible for searchers to obtain semantically related documents with various relationships of concepts, and by combining these several searches dependent on a searcher, this method realizes to obtain/discover semantically related information. We define the relevance routing as the combination of searches. The relevance routing is dynamically generated according to the searcher's objective. Our method makes it possible to retrieve documents semantically related to the relevance routing. We apply our method to the psychiatric field, and clarify the feasibility of our method.
ONTOCOM Revisited: Towards Accurate Cost Predictions for Ontology Development Projects
Authors: Elena Simperl, Igor O. Popov, Tobias Bürger
Venue: Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications (2009)

Reliable methods to assess the costs and benefits of ontologies are an important instrument to demonstrate the tangible business value of semantic technologies within enterprises, as an argument to encourage their wide-scale adoption. The economic aspects of ontologies have been investigated in previous work of ours. With ONTOCOM we proposed a cost estimation model for ontologies and ontology development projects. This paper revisits this model and presents its latest achievements. We report on a comprehensive calibration of ONTOCOM based on a considerably larger data set of 148 ontology development projects. The calibration used a combination of statistical methods, ranging from preliminary data analysis to regression and Bayes analysis, and resulted a significant improvement of the prediction quality of up to 50%. In addition, the availability of a representative data set allowed us to identify meaningful directions for customizing the generic cost model along particular types of ontologies, and ontology-like structures as those specific to the emerging Web 3.0. Last but not least, we developed a software tool that allows ontology development project managers to easily use and adapt and to systematically calibrate the model, thus facilitating its adoption in real-world projects.
Thesauri Alignment for EU eGovernment Services: a Methodological Framework
Authors: E. Francesconi, S. Faro, E. Marinai
Venue: Proceeding of the 2008 conference on Legal Knowledge and Information Systems: JURIX 2008: The Twenty-First Annual Conference (2008)

This paper presents a methodological framework for semantic mapping between thesauri as well as a specific approach within such framework on a case study aimed at mapping five thesauri of interest for European Union institutions having only schema information available.
Mobile IPTV: Approaches, Challenges, Standards, and QoS Support
Authors: Soohong Park, Seong-Ho Jeong
Venue: IEEE Internet Computing (2009)

IPTV is defined as multimedia services, such as TV, video, audio, text, graphics, and data, delivered over IP-based networks managed to support quality of service (QoS), quality of experience, security, interactivity, and reliability. Mobile IPTV extends those services to mobile networks. The authors discuss mobile IPTV standardization's status, related approaches in the field, and technical challenges to enhancing mobile IPTV services. Given the critical role of QoS in the technology's widespread adoption, the authors also propose an efficient signaling scheme to support QoS for seamless mobile IPTV services.