ppxscal/embedding_network huggingface dataset:
IT-Security and Virtualization: Design and Security Evaluation of a Virtualized DMZ using VMWare
Authors: Michael Leibetseder
Venue:  (2009)

The implementation and use of Virtualization offers big advantages. The virtualization technology has been proven by the use of actual products. Due to this technology and the security features, the design and the implementation of a sensitive part of the IT infrastructure, a DMZ, is displayed. This book focuses on the security aspects of virtualization. With the installation of a virtual DMZ it is possible to use all the advantages of a virtual infrastructure. The aim of this book is to develop a system to implement a DMZ within a virtual infrastructure, which is at least as secure as a physical one. In order to understand the virtualization technology the theoretical basics are described. Based on the features and functions of the virtualization products the VMWare Virtual Infrastructure 3 was chosen to implement the virtual DMZ. The security measurements and the comparison of the virtualized environment and a physical environment are discussed. Various Advantages and disadvantages of the configurations and types of a virtual DMZ are listed. Based on these insights a system has been put in place, how a DMZ can be implemented within a virtual infrastructure. 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
Regular Expressions with Counting: Weak versus Strong Determinism
Authors: Wouter Gelade, Marc Gyssens, Wim Martens
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

We study deterministic regular expressions extended with the counting operator. There exist two notions of determinism, strong and weak determinism, which almost coincide for standard regular expressions. This, however, changes dramatically in the presence of counting. In particular, we show that weakly deterministic expressions with counting are exponentially more succinct and strictly more expressive than strongly deterministic ones, even though they still do not capture all regular languages. In addition, we present a finite automaton model with counters, study its properties and investigate the natural extension of the Glushkov construction translating expressions with counting into such counting automata. This translation yields a deterministic automaton if and only if the expression is strongly deterministic. These results then also allow to derive upper bounds for decision problems for strongly deterministic expressions with counting.
The impact of deep linguistic processing on parsing technology
Authors: Timothy Baldwin, Mark Dras, Julia Hockenmaier, Tracy Holloway King, Gertjan van Noord
Venue: Proceedings of the 10th International Conference on Parsing Technologies (2007)

As the organizers of the ACL 2007 Deep Linguistic Processing workshop (Baldwin et al., 2007), we were asked to discuss our perspectives on the role of current trends in deep linguistic processing for parsing technology. We are particularly interested in the ways in which efficient, broad coverage parsing systems for linguistically expressive grammars can be built and integrated into applications which require richer syntactic structures than shallow approaches can provide. This often requires hybrid technologies which use shallow or statistical methods for pre- or post-processing, to extend coverage, or to disambiguate the output.
Optimal receiver scheduling algorithms for a multicast problem
Authors: A. A. Bertossi, M. C. Pinotti, R. Rizzi
Venue: Discrete Applied Mathematics (2009)

This paper studies a multicast problem arising in wavelength division multiplexing single-hop lightwave networks, as well as in Video-on-Demand systems. In this problem, the same message of duration @D has to be transmitted to a set of n receivers which are not all available simultaneously. The receivers can be partitioned into subsets, each served by a different transmission, with the objective of minimizing their overall waiting cost. When there is a single data channel available for transmission, a dynamic programming algorithm is devised which finds an optimal solution in O(nlogn+min{n^2,n@D^2}) time, improving over a previously known O(n^3) time algorithm. When multiple data channels are available for transmission, an optimal O(n) time algorithm is proposed which finds an optimal solution if the message has constant transmission duration, whereas an NP-completeness proof is given if the message has arbitrary transmission duration.
Just-In-Time Cache for Capsule-Based Active Networks
Authors: Tzu-Chi Huang, Ce-Kuen Shieh, Yu-Ben Miao
Venue: The Computer Journal (2009)

Active networking introduces a novel programming paradigm to applications by injecting codes into networks in order to program them. Among the approaches to injecting codes into networks, active networking attracts most research communities to explore the capsule-based active network, where the packet named the capsule can carry codes and data together to customize the processing of the packet in network devices with the codes. Because a capsule has space limitations that harm application developments in capsule-based active networks, the just-in-time cache (JITC) is proposed to alleviate capsule space limitations. The JITC is an innovative idea to introduce a cache into a capsule besides into a network device. The JITC automatically tailors codes to the need of a capsule while processing the capsule in a network device. The JITC allows a capsule merely to carry the necessary codes to traverse active networks and makes a network device download codes on behalf of the capsule on demand. The JITC allows applications to disable the cache, control the cache size, and specify the required cache placement policy in a capsule to achieve the optimal performance. Currently, the JITC supports six canonical cache placement policies. The JITC is implemented in Windows 2000 as a proof of concept. In the experiments, the JITC has trivial overheads in contrast to other common overheads in the existing solutions. The JITC outperforms the existing solutions in throughput, processing delay, resource sensitivity, and bandwidth conservation in the cache-policy-free situation. Besides, the JITC has examples for the six cache placement policies to demonstrate the performance improvement with each of them.
Dinatural Terms in System F
Authors: Joachim de Lataillade
Venue: Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science (2009)

We provide in this article two characterisation results, describing exactly which terms verify the dinaturality diagram, in Church-style system F and in Curry-style system F. The proof techniques we use here are purely syntactic, giving in particular a direct construction of the two terms generated by the dinaturality diagram. But the origin of these techniques lies in fact directly on the analysis of system F through game semantics. Thus, this article provides an example of backward engineering, where powerful syntactic results can be extracted from a semantic analysis.
ZigBee-Based Wireless Sensor Networks
Authors: You Ke, Gao Runquan, Zhang Cuixia, Chang Minhui, Liu Ruiqiang, Wu Jiaxin
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

In this paper, a ZigBee-based wireless sensor network is proposed. It employs star topology. To reduce the power consumption of each sensor node and meanwhile to lengthen its life-span, we use the STOP mode, only a very low power transmitter is used to monitor the channel when the sensor node is NOT waken up and the sensor node is waken up periodically. Furthermore, the security and reliability of the system are greatly improved because of the Cyclic Redundancy Check and the encryption algorithm's application.
NLP-based scripting for CALL activities
Authors: G. Antoniadis, S. Echinard, O. Kraif, T. Lebarbé, M. Loiseau, C. Ponton
Venue: Proceedings of the Workshop on eLearning for Computational Linguistics and Computational Linguistics for eLearning (2004)

This article focuses on the development of Natural Language Processing (NLP) tools for Computer Assisted Language Learning (CALL). After identifying the inherent limitations of NLP-free tools, we describe the general framework of Mirto, an NLP-based authoring platform under construction in our laboratory, and organized into four distinct layers: functions, scripts, activities and scenarios. Through several examples, we explain how Mirto's architecture allows to implement state-of-the-art NLP functions, integrate them into easily handled scripts in order to create, without computing skills, didactic activities that could be recorded in more complex sequences or scenarios.
Kartta: extracting landmarks near personalized points-of-interest from user generated content
Authors: Arttu Perttula, Scott Carter, Laurent Denoue
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

Most mobile navigation systems focus on answering the question, "I know where I want to go, now can you show me exactly how to get there?" While this approach works well for many tasks, it is not as useful for unconstrained situations in which user goals and spatial landscapes are more fluid, such as festivals or conferences. In this paper we describe the design and iteration of the Kartta system, which we developed to answer a slightly different question: "What are the most interesting areas here and how do I find them?"
Coupling semi-supervised learning of categories and relations
Authors: Andrew Carlson, Justin Betteridge, Estevam R. Hruschka,  Jr., Tom M. Mitchell
Venue: Proceedings of the NAACL HLT 2009 Workshop on Semi-Supervised Learning for Natural Language Processing (2009)

We consider semi-supervised learning of information extraction methods, especially for extracting instances of noun categories (e.g., 'athlete', 'team') and relations (e.g., 'playsForTeam(athlete, team)'). Semi-supervised approaches using a small number of labeled examples together with many un-labeled examples are often unreliable as they frequently produce an internally consistent, but nevertheless incorrect set of extractions. We propose that this problem can be overcome by simultaneously learning classifiers for many different categories and relations in the presence of an ontology defining constraints that couple the training of these classifiers. Experimental results show that simultaneously learning a coupled collection of classifiers for 30 categories and relations results in much more accurate extractions than training classifiers individually.
An estimation model of value-at-risk portfolio under uncertainty
Authors: Yuji Yoshida
Venue: Fuzzy Sets and Systems (2009)

A value-at-risk portfolio model under uncertainty is discussed. In the proposed model, randomness and fuzziness are evaluated, respectively, by the probabilistic expectation and the mean values with evaluation weights and @l-mean functions. The means, the variances and the measurements of imprecision for fuzzy numbers/fuzzy random variables are evaluated in the possibility case and the necessity case, and the rate of return in portfolio is estimated regarding the both random factors and imprecise factors. By analytical approach, we derive a solution of the value-at-risk portfolio problem. A numerical example is given to illustrate our idea.
Networked distributed POMDPs: a synthesis of distributed constraint optimization and POMDPs
Authors: Ranjit Nair, Pradeep Varakantham, Milind Tambe, Makoto Yokoo
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 1 (2005)

In many real-world multiagent applications such as distributed sensor nets, a network of agents is formed based on each agent's limited interactions with a small number of neighbors. While distributed POMDPs capture the real-world uncertainty in multiagent domains, they fail to exploit such locality of interaction. Distributed constraint optimization (DCOP) captures the locality of interaction but fails to capture planning under uncertainty. This paper present a new model synthesized from distributed POMDPs and DCOPs, called Networked Distributed POMDPs (ND-POMDPs). Exploiting network structure enables us to present two novel algorithms for ND-POMDPs: a distributed policy generation algorithm that performs local search and a systematic policy search that is guaranteed to reach the global optimal.
AdMoVeo: A Robotic Platform for Teaching Creative Programming to Designers
Authors: Sjriek Alers, Jun Hu
Venue: Proceedings of the 4th International Conference on E-Learning and Games: Learning by Playing. Game-based Education System Design and Development (2009)

Designing intelligent products, systems and related services require the designers to be able to integrate technology in their designs. Among other skills, programming is the key for the designers to prototype and experiment with the intelligent behaviors. However most of the design students do not have inherent affinity towards programming and electronics. The AdMoVeo robotic platform is designed, purely for the purpose of teaching the industrial design students basic skills of programming. Moreover we aim at a platform that motivates and encourages the design students to explore their creativity with their passions in graphical and behavioral design. This paper presents the hardware and software design of the platform, and shares the experiences in using it in a programming course.
Implicitly supervised language model adaptation for meeting transcription
Authors: David Huggins-Daines, Alexander I. Rudnicky
Venue: Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Companion Volume, Short Papers on XX (2007)

We describe the use of meeting metadata, acquired using a computerized meeting organization and note-taking system, to improve automatic transcription of meetings. By applying a two-step language model adaptation process based on notes and agenda items, we were able to reduce perplexity by 9% and word error rate by 4% relative on a set of ten meetings recorded in-house. This approach can be used to leverage other types of metadata.
10 Things I've Learned About Teaching Online
Authors: Michelle Everson
Venue: eLearn (2009)

Michelle Everson has been teaching online for five years. Here, she shares the top 10 best practices she has learned about online teaching.
Parallel event processing for content-based publish/subscribe systems
Authors: Amer Farroukh, Elias Ferzli, Naweed Tajuddin, Hans-Arno Jacobsen
Venue: Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (2009)

Event processing systems are a promising technology for enterprise-scale applications. However, achieving scalability yet maintaining high performance is a challenging problem. This work introduces a parallel matching engine which leverages current chip multi-processors to increase throughput and to reduce the matching time. We present three parallelization techniques, as well as lock-based and software transactional memory-based implementations of each technique, and discuss their impact. The results show a 74% reduction of the average matching time and an improved throughput of over 1600 events/second when using eight processors.
A New Strategy Based on GRASP to Solve a Macro Mine Planning
Authors: María-Cristina Riff, Eridan Otto, Xavier Bonnaire
Venue: Proceedings of the 18th International Symposium on Foundations of Intelligent Systems (2009)

In this paper we introduce a greedy randomized adaptive search procedure(GRASP) algorithm for solving a copper mine planning problem. In the last 10 years this real-world problem has been tackled using linear integer programming and constraint programming. Our mine planning problem is a large scale problem, thus in order to find an optimal solution using complete methods, the model was simplified by relaxing many constraints. We now present a Grasp algorithm which works with the complete model and it is able to find better feasible near-optimal solutions, than the complete approach that has been used until now.
Parallelizing the Protein Threading Problem in a Hybrid Peer-to-Peer Based High Performance Computing Platform
Authors: Fei Luo, Lin Chen
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

The protein threading problem (PTP) is to determine the three-dimensional structure of a given protein sequence. Currently its serial resolutions are time-consuming and data-intensive. Nevertheless, the parallel and distributed systems offer opportunities to improve the efficiency of PTP by releasing its computational bottleneck. Therefore, a 1-level-core parallel threading algorithm is proposed and implemented in a hybrid peer-to-peer (P2P) based high performance computing (HPC) platform, P2HP-2. Through experiments and analysis, it shows that high performance can be achieved through the 1-level-core parallel algorithm in P2HP-2.
Interactive Matlab software for the analysis of seismic volcanic signals
Authors: Philippe Lesage
Venue: Computers Geosciences (2009)

The computer program presented in this note applies methods commonly used in volcano seismology to the analysis of seismic data. It is complementary to the classic seismological software packages used to process tectonic earthquake seismograms. The program's six user-friendly interfaces provide a large set of tools for reading data in many different formats, for carrying out spectral analysis, autoregressive modelling and deconvolution, for calculating time-frequency representations and Real-time Seismic Amplitude Measurement (RSAM)-type time series, and for detecting volcanic tremors and discrete events in long-duration records. A separate version of the program facilitates signal classification when preparing training databases for automatic recognition systems.
Research on Prognostic and Health Monitoring System for Large Complex Equipment
Authors: Jinyu Zhang, Xianxiang Huang, Wei Cai
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

Prognostic and health monitoring (PHM) is the latest development of large complex equipment management. An extensible distributed prognostic and health monitoring system based on hybrid wireless network techniques was studied and designed in this paper. Firstly,after a careful analysis on the structure and tasks of the equipment, the general PHM framework of large complex equipment is proposed. Then the technical program and network of system are presented. The corresponding on-line monitoring, diagnosis and management system are designed.And the fault prediction technologies are discussed. Finally,the health management and decision system is studied. Anew technical plan that skillfully combines knowledge base,model base, database, their management systems and inference engine is proposed. And the realization is introduced. The results of practical operation show that,because of the using of hybrid wireless network, embedded system, prognostic and intelligent diagnosis, the system maybe flexibly deployed, have powerful capability of monitoring,diagnosis and management, and can implement expeditious and accurate prognostic and fault diagnosis for large complex equipment system.
Using hardware methods to improve time-predictable performance in real-time Java systems
Authors: Jack Whitham, Neil Audsley, Martin Schoeberl
Venue: Proceedings of the 7th International Workshop on Java Technologies for Real-Time and Embedded Systems (2009)

This paper describes hardware methods, a lightweight and platform-independent scheme for linking real-time Java code to co-processors implemented using a hardware description language (HDL). Intended for use in embedded systems, hardware methods have similar semantics to the native methods used to interface Java code to legacy C/C++ software, but are also time-predictable, facilitating accurate worst-case execution time (WCET) analysis. By reference to several examples, the paper demonstrates the applicability of hardware methods and shows that they can (1) reduce the WCET of embedded real-time Java, and (2) improve the quality of WCET estimates in the presence of infeasible paths.
Initial Discussion on the Architecture of a New Spatial Information Network Service Model Based on the Digital Earth
Authors: Xi-rong Guo, Fang Miao, Hua-jun Wang, Gen-yuan Du
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

Under the background of the concept and framework of the Digital Earth, the paper aims to study the architecture of a new spatial information network service model--G/S model. In order to improve the efficiency of geospatial data organizing, geospatial data managing,geospatial data describing and geospatial data transferring in the internet environment, as well as achieve the target of displaying, quering, analyzing and interactive operation of spatial information in the three-dimensional (3D) scene, the authors mainly discuss : the connotation of the G/S model; the basic framework of G/S model which is consist of HGML(Hyper Geographic Markup Language), Geo-browser and spatial information server which divides into spatial information base sever group and industry application data sever group, subsequently describes the principle, characteristics and technology system of its components respectively; an application prototype system based on G/S model. G/S model provides an effective way to reduce the network complexity and computational complexity of the spatial information, and provides an extensive application space for the spatial information technology.
Approximation Algorithms for Domatic Partitions of Unit Disk Graphs
Authors: Saurav Pandit, Sriram V. Pemmaraju, Kasturi Varadarajan
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

We prove a new structural property regarding the "skyline" of uniform radius disks and use this to derive a number of new sequential and distributed approximation algorithms for well-known optimization problems on unit disk graphs (UDGs). Specifically, the paper presents new approximation algorithms for two problems: domatic partition and weighted minimum dominating set (WMDS) on UDGs, both of which are of significant interest to the distributed computing community because of applications to energy conservation in wireless networks. Using the aforementioned skyline property, we derive the first constant-factor approximation algorithm for the domatic partition problem on UDGs. Prior to our work, the best approximation factor for this problem was O(logn), obtained by simply using the approximation algorithm for general graphs. From the domatic partition algorithm, we derive a new and simpler constant-factor approximation for WMDS on UDGs. Because of "locality" properties that our algorithms possess, both algorithms have relatively simple constant-round distributed implementations in the $\mathcal{LOCAL}$ model, where there is no bound on the message size. In addition, we obtain O(log2 n)-round distributed implementations of these algorithms in the $\mathcal{CONGEST}$ model, where message sizes are bounded above by O(logn) bits per message.