ppxscal/embedding_network huggingface dataset:
Podcasting by synchronising PowerPoint and voice: What are the pedagogical benefits?
Authors: Darren K. Griffin, David Mitchell, Simon J. Thompson
Venue: Computers Education (2009)

The purpose of this study was to investigate the efficacy of audio-visual synchrony in podcasting and its possible pedagogical benefits. 'Synchrony' in this study refers to the simultaneous playback of audio and video data streams, so that the transitions between presentation slides occur at ''lecturer chosen'' points in the audio commentary. Manufacturers of lecture recording software (e.g. ProfCast) would have us believe that the synchrony of image and audio should improve the learning experience. We have yet to see in the literature any empirical evidence to support this hypothesis. In our study, 90 participants in two groups undertook two electronic lectures (e-lectures) on two separate topics, the subject matter of neither was familiar to them beforehand. Each group experienced one ''synchronous'' presentation (e-lecture) of one of the topics, and one ''separate'' presentation (i.e. PowerPoint and audio files separately presented) of the other topic. Each group therefore experienced both ''synchronous'' and ''separate'' delivery and they were then given an MCQ test that assessed five levels of Bloom's taxonomy. Results show no differences in innate ability between the two groups but the evidence supported our primary hypothesis in that statistically significantly higher test scores were seen when participants viewed a synchronous e-lecture; these scores were accounted for by subjects' performance at three of the five levels of Bloom's taxonomy. Qualitative 'attitude' survey results also displayed participant preference towards the synchronous over the asynchronous mode of delivery, and in spite of general acceptance of the proposed benefits of electronic proceedings, a majority preference towards traditional rather than electronic lectures. Despite this conservatism, this paper explores in more detail the potential benefits of podcasting via synchronous PowerPoint and voice.
CMOS Multichannel Single-Chip Receivers for Multi-Gigabit Optical Data Communications, 1st edition
Authors: Paul Muller, Yusuf Leblebici
Venue: Analog Circuits And Signal Processing (2007)

While the throughput of microprocessor systems tends to increase as a result of ongoing technology scaling and the advent of multi-core systems, the off-chip I/O communication bandwidth emerges as one of the potential bottlenecks that limit overall performance. In order to alleviate the communication speed constraints, optical data communication interfaces move ever closer to the processor core. It is widely expected that future generation digital systems will increasingly rely on chip-to-chip and board-to-board optical data communications for higher bandwidth and better noise immunity. This book focuses on optical communications for short and very short distance applications and discusses the monolithic integration of optical receivers with processing elements in standard CMOS technologies. CMOS Multi-Channel Single-Chip Receivers for Multi-Gigabit Optical Data Communications provides the reader with the necessary background knowledge to fully understand the trade-offs in short-distance communication receiver design and presents the key issues to be addressed in the development of such receivers in CMOS technologies. Moreover, novel design approaches are presented. A system-level design methodology allows for the impact analysis of different block specifications and system-wide design optimization. Statistical models are used for design space exploration in the scope of jitter tolerance analysis of clock recovery circuits. CMOS Multi-Channel Single-Chip Receivers for Multi-Gigabit Optical Data Communications is required reading for practicing engineers and researchers in the field of short-distance optical communications and optical CMOS receiver design.
Is there a case for domestic inflation target?
Authors: Jose Angelo Divino
Venue: Mathematics and Computers in Simulation (2009)

This paper evaluates the consequences of a central bank stabilizing alternative measures of inflation in a model with several exchange rate channels of transmission for the monetary policy. The real exchange rate affects the equilibrium conditions and the utility-based welfare objective places higher weight on output gap stabilization. There is an endogenous stabilization trade-off and policy rules derived from private agents' optimizing behavior perform better than alternative monetary policy arrangements. The optimal policy is PPI inflation target, under which the exchange rate follows a controlled floating. Contrary to central bank practices, CPI target should be considered only by highly open economies.
Computing representations for radicals of finitely generated differential ideals
Authors: Fran&#x00e7;ois Boulier, Daniel Lazard, Fran&#x00e7;ois Ollivier, Michel Petitot
Venue: Applicable Algebra in Engineering, Communication and Computing (2009)

This paper deals with systems of polynomial differential equations, ordinary or with partial derivatives. The embedding theory is the differential algebra of Ritt and Kolchin. We describe an algorithm, named Rosenfeld–Gröbner, which computes a representation for the radical of the differential ideal generated by any such system Σ. The computed representation constitutes a normal simplifier for the equivalence relation modulo (it permits to test membership in ). It permits also to compute Taylor expansions of solutions of Σ. The algorithm is implemented within a package (the package (diffalg) is available in MAPLE standard library since MAPLE VR5) in MAPLE.
A class of alternating group finite difference method for solving convection-diffusion equation
Authors: Bin Zheng, Qinghua Feng
Venue: Proceedings of the 15th american conference on Applied mathematics (2009)

In this paper, with an exponential-type transformation, a class of alternating group finite difference method(AGE-I) based on the saul'yev asymmetric schemes and the classical explicit-implicit schemes is derived for solving convection-diffusion equation. The method is suitable for parallel computation, unconditionally stable, and is of high accuracy especially when Ɛ is small. Furthermore, a class of alternating group method(AGC-N) is derived by placing the Crank-Nicolson scheme at the fit situation. In order to verify the present method, numerical experiments are given at the end of the paper.
The effect of out-of-plane flexural stiffness of boundary frame on buckling stress patterns of steel plate shear wall
Authors: P. Memarzadeh, M. Azhari, M. M. Saadatpour
Venue: Proceedings of the 15th american conference on Applied mathematics (2009)

When buckling occurs in the infill plate of Steel Plate Shear Wall (SPSW), a diagonal tension field is formed through the plate. It seems that the lateral displacements of plate due to buckling may have a role in formation of the tension field. Meanwhile revealing this role, this paper investigates the influence of out-of-plane flexural stiffness of boundary members (i.e. beams and columns) on the buckling coefficients and the tension field behaviour of SPSW associated with the symmetric and anti-symmetric buckling modes. The linear buckling equations in the sense of von-Karman have been solved in conjunction with various boundary conditions, by using the Ritz method.
The Panic Room: On Synthetic Emotions
Authors: Jordi Vallverdú, David Casacuberta
Venue: Proceeding of the 2008 conference on Current Issues in Computing and Philosophy (2008)

Emotions and feelings are basic regulators of human activity. We consider that intelligence is an emergent property of systems and that emotions play a basic role within those systems. Our main aim is to create a system (called The Panic Room) based on a bottom-up “Ambient Intelligence” context which develops a proto-emotion of fear and pleasure in order to detect a dangerous event and react to it. The system labels the signals from the sensors which describe the surroundings as either negative or positive. Either option has a specific signal that is used to change the way further perceptual signals will be processed as well as generate possible behavioural responses to a possible danger. Responses are automatic and embedded (or hardwired) in the system.
Automatic Argumentation Detection and its Role in Law and the Semantic Web
Authors: Raquel Mochales Palau, Marie-Francine Moens
Venue: Proceeding of the 2009 conference on Law, Ontologies and the Semantic Web: Channelling the Legal Information Flood (2009)

The automatic detection of arguments in text regards a relatively new area at the intersection of Natural Language Processing, Information Retrieval and Legal Information Systems. This paper presents some fundamental issues when processing texts that contain argumentation. Furthermore, our research bridges different areas, including the legal field and the Semantic Web, where argumentation detection and reconstruction could be beneficial. Finally, it analyses several methodologies to accomplish this task, providing results from different experiments done over several kinds of texts, specially legal reports.
Reasoning by structural analogy in intelligent decision support systems
Authors: A. P. Eremeev, P. R. Varshavsky
Venue: Proceeding of the 2006 conference on Knowledge-Based Software Engineering: Proceedings of the Seventh Joint Conference on Knowledge-Based Software Engineering (2006)

The problem of modeling human reasoning (common sense reasoning) and, in particular, reasoning by analogy in intelligent decision support systems is considered. Special attention is drawn to modeling reasoning by structural analogy taking the context into account. This work was supported by RFBR.
Video courseware for teaching operating systems with Windows
Authors: Seung-won Hwang
Venue: ACM SIGCSE Bulletin (2009)

Operating systems, being one of the most complex pieces of source code, are often an intimidating subject for both instructors and students. Recently, Microsoft released teaching materials on Windows for operating system curricula, to complement traditional Unix-based instructional operating systems. Such materials have been reported to boost student learning by enhancing the relevance and diversity of courses, while the lack of "hands-on" guidance materials has been reported as hindrance. To complement lacking, we created video courseware to walk students through the Windows source code and help them get ready for large-scale developments on Windows kernel.
Regular Expressions and Predicate Logic in Finite-State Language Processing
Authors: Mans Hulden
Venue: Proceeding of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008 (2009)

This paper proposes an extension to the formalism of regular expressions with a form of predicate logic where quantified propositions apply to substrings. The implementation hinges crucially on the manipulation of auxiliary symbols which has been a common, though previously unsystematized practice in finite-state language processing. We also apply the notation to give alternate compilation methods for two-level grammars and various types of replacement rules found in the literature, and show that, under a certain interpretation, two-level rules and many types of replacement rules are equivalent.
About the logical relations between cases and rules
Authors: Bart Verheij
Venue: Proceeding of the 2008 conference on Legal Knowledge and Information Systems: JURIX 2008: The Twenty-First Annual Conference (2008)

The two main types of law are legislation and precedents. Both types have a corresponding reasoning pattern determining legal consequences: legislation can be applied and precedents followed. The separate modelling of these two reasoning patterns using logical techniques has recently seen considerable progress. About the logical links between the two less is known, although progress has already been made. This document focuses on such logical relations. The main question is: to what extent can the application of legislation and precedent adherence be considered as two sides of the same logical coin? Findings from the boundaries of logic and law will serve as a starting point. This text is a translated, adapted and extended version of Verheij 2007.
Layer-TERRAIN: An Improved Algorithm of TERRAIN Based on Sequencing the Reference Nodes in UWSNs
Authors: Yue Liang, Zhong Liu
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

The Layer-Terrain algorithm is proposed in the background of underwater environment, focusing on reduction of the accumulated location error. Based on the TERRAIN algorithm, this algorithm introduces the concept of layer, sequences the reference nodes according to the information of layer and estimates the position by maximum likelihood estimation. This sequencing process not only makes use of redundant information, but also limits the amount of computing data. The simulation experiments show that the improved algorithm efficiently deals with error propagation among the network and improves the localization precision of TERRAIN algorithm.
Performance Evaluation of the Hitachi SR8000 Using OpenMP Benchmarks
Authors: Daisuke Takahashi, Mitsuhisa Sato, Taisuke Boku
Venue: Proceedings of the 4th International Symposium on High Performance Computing (2009)

This paper reports the performance of a single node of the Hitachi SR8000 when using OpenMP benchmarks. Each processing node of the SR8000 is a shared-memory parallel computer composed of eight scalar processors with pseudo-vector processing feature. We have run the all of the SPEC OMP2001 Benchmarks and three benchmarks (LU, SP and BT) of the NAS Parallel Benchmarks on the SR8000. According to the results of this performance measurement, we found that the SR8000 has good scalability continuing up to 8 processors except for a few benchmark programs. The performance results demonstrate that the SR8000 achieves high performance especially for memory-intensive applications.
Firewall Policy Queries
Authors: Alex X. Liu, Mohamed G. Gouda
Venue: IEEE Transactions on Parallel and Distributed Systems (2009)

Firewalls are crucial elements in network security, and have been widely deployed in most businesses and institutions for securing private networks. The function of a firewall is to examine each incoming and outgoing packet and decide whether to accept or to discard the packet based on its policy. Due to the lack of tools for analyzing firewall policies, most firewalls on the Internet have been plagued with policy errors. A firewall policy error either creates security holes that will allow malicious traffic to sneak into a private network or blocks legitimate traffic and disrupts normal business processes, which in turn could lead to irreparable, if not tragic, consequences. Because a firewall may have a large number of rules and the rules often conflict, understanding and analyzing the function of a firewall has been known to be notoriously difficult. An effective way to assist firewall administrators to understand and analyze the function of their firewalls is by issuing queries. An example of a firewall query is "Which computers in the private network can receive packets from a known malicious host in the outside Internet?” Two problems need to be solved in order to make firewall queries practically useful: how to describe a firewall query and how to process a firewall query. In this paper, we first introduce a simple and effective SQL-like query language, called the Structured Firewall Query Language (SFQL), for describing firewall queries. Second, we give a theorem, called the Firewall Query Theorem, as the foundation for developing firewall query processing algorithms. Third, we present an efficient firewall query processing algorithm, which uses decision diagrams as its core data structure. Fourth, we propose methods for optimizing firewall query results. Finally, we present methods for performing the union, intersect, and minus operations on firewall query results. Our experimental results show that our firewall query processing algorithm is very efficient: it takes less than 10 milliseconds to process a query over a firewall that has up to 10,000 rules.
Towards practical lattice-based cryptography
Authors: Daniele Micciancio
Venue:  (2008)

Lattice-based cryptography began with the seminal work of Ajtai (Ajtai &lsquo;96) who showed that it is possible to build families of cryptographic functions in which breaking a randomly chosen element of the family is as hard as solving worst-case instances of lattice problems. This work generated great interest and resulted in constructions of many other cryptographic protocols with security based on worst-case lattice problems. An additional advantage of lattice-based primitives is that, unlike their counterparts based on factoring and discrete log, they are conjectured to be secure in the advent of quantum computing. The main disadvantage of lattice-based constructions is that they generally involve operations on, and storage of, large n &times; n matrices. This resulted in the schemes being rather inefficient and unsuitable for practical use. To cope with this inherent inefficiency, Micciancio proposed to build lattice-based primitives based on the worst-case hardness of lattices that have some additional structure. In (Micciancio &rsquo;02), he showed how to build one-way functions, computable in almost linear time, with security based on worst-case problems on such lattices. While interesting from a theoretical perspective, one-way functions are not very useful in practice. Our goal in this thesis is to present constructions of practical and efficient cryptographic protocols whose security is based on worst-case hardness of lattice problems. We first show how to build collision-resistant hash functions whose security is based on the hardness of lattice problems in all lattices with a special structure. The special structure that the lattices possess is that they are ideals of certain polynomial rings. The hash functions that we build have almost linear running time, and in practice turn out to be essentially as efficient as ad-hoc constructions that have no provable security. We also give constructions of provably-secure identification and signature schemes whose asymptotic running times are almost linear (up to poly-logarithmic factors), and so these schemes are much more efficient than comparable primitives with security based on factoring and discrete log. Thus our work implies that by considering ideal lattices, it is possible to have the best of both worlds: security based on worst-case problems and optimal efficiency.
Building practical spoken dialog systems
Authors: Antoine Raux, Brian Langner, Alan W. Black, Maxine Eskenazi
Venue: Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Tutorial Abstracts (2008)

This tutorial will give a practical description of the free software Carnegie Mellon Olympus 2 Spoken Dialog Architecture. Building real working dialog systems that are robust enough for the general public to use is difficult. Most frequently, the functionality of the conversations is severely limited - down to simple question-answer pairs. While off-the-shelf toolkits help the development of such simple systems, they do not support more advanced, natural dialogs nor do they offer the transparency and flexibility required by computational linguistic researchers. However, Olympus 2 offers a complete dialog system with automatic speech recognition (Sphinx) and synthesis (SAPI, Festival) and has been used, along with previous versions of Olympus, for teaching and research at Carnegie Mellon and elsewhere for some 5 years. Overall, a dozen dialog systems have been built using various versions of Olympus, handling tasks ranging from providing bus schedule information to guidance through maintenance procedures for complex machinery, to personal calendar management. In addition to simplifying the development of dialog systems, Olympus provides a transparent platform for teaching and conducting research on all aspects of dialog systems, including speech recognition and synthesis, natural language understanding and generation, and dialog and interaction management. The tutorial will give a brief introduction to spoken dialog systems before going into detail about how to create your own dialog system within Olympus 2, using the Let's Go bus information system as an example. Further, we will provide guidelines on how to use an actual deployed spoken dialog system such as Let's Go to validate research results in the real world. As a possible testbed for such research, we will describe Let's Go Lab, which provides access to both the Let's Go system and its genuine user population for research experiments.
Investigation of Fuzzy Adaptive Resonance Theory in Network Anomaly Intrusion Detection
Authors: Nawa Ngamwitthayanon, Naruemon Wattanapongsakorn, David W. Coit
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

The effectiveness of Fuzzy-Adaptive Resonance Theory (Fuzzy-ART or F-ART) is investigated for a Network Anomaly Intrusion Detection (NAID) application. F-ART is able to group similar data instances into clusters. Furthermore, F-ART is an online clustering algorithm that can learn and update its knowledge based on the presence of new instances to the existing clusters. We investigate a one shot fast learning option of F-ART on the network anomaly detection based on KDD CUP '99 evaluation data set and found its effectiveness and robustness to such problems along with the fast response capability that can be applied to provide a real-time detection system.
Discovery of Entailment Relations from Event Co-Occurrences
Authors: Viktor Pekar
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

Lexical entailment is knowledge that may prove very useful for a variety of applications that deal with information implicit in a text. In this paper we address the problem of automatic discovery of pairs of verbs related by entailment. A specific challenge in this task is recognition of the direction of entailment in a pair. We model entailment by a number of linguistic cues as to local coherence between clauses. We first investigate the effect of these cues on the quality of the model and then evaluate it against human judgements. Our evaluation reveals that the model is capable of correctly identifying the direction in entailment-related pairs, although their separation from bidirectional pairs proves a more difficult task.
Collaborative query coordination in community-driven data grids
Authors: Tobias Scholl, Angelika Reiser, Alfons Kemper
Venue: Proceedings of the 18th ACM international symposium on High performance distributed computing (2009)

E-science communities face huge data management challenges due to large existing data sets and expected data rates from forthcoming projects. Community-driven data grids provide a scalable, high-throughput oriented data management solution for scientific federations by employing domain-specific partitioning schemes and parallelism. In this paper, we present how community-driven data grids can adapt their query coordination strategies in the face of different typical submission scenarios. We explore the impact of submitting queries uniformly or having submission hot spots. By an extensive evaluation of five strategies on simulated and distributed setups, we show that some coordination strategies are preferable to others, regardless of submission skew. Based on our results, we can improve the usability and scalability of community-driven data grids for data-intensive applications.