ppxscal/embedding_network huggingface dataset:
Integrating Web Resources and Lexicons into a Natural Language Query System
Authors: Boris Katz, Deniz Yuret, Jimmy Lin, Sue Felshin, Rebecca Schulman, Adnan Ilik, Ali Ibrahim, Philip Osafo-Kwaako
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

The START system responds to natural language queries with answers in text, pictures, and other media. START's sentence-level natural language parsing relies on a number of mechanisms to help it process the huge, diverse resources available on the World Wide Web. Blitz, a hybrid heuristic-and corpus-based natural language preprocessor, enables START to integrate a large and ever-changing lexicon of proper names, by using heuristic rules and precompiled tables of symbols to preprocess various highly regular and fixed expressions into lexical tokens. LaMeTH, a content-based system for extracting information from HTML documents, assists START by providing a uniform method of accessing information on the Web in real time. These mechanisms have considerably improved START's ability to analyze real-world sentences and answer queries through expansion of its lexicon and integration of Web resources.
Red Hat Enterprise Linux 5: Administration Security Desktop
Authors: Richard L Petersen
Venue:  (2008)

This book is designed as an administration, security, and desktop reference for Red Hat Enterprise Linux 5. Administration tools are covered as well as the underlying configuration files and system implementations. Desktop and shell operations are also examined. Topics covered include user management, devices, kernel customization, software installs, virtualization, services, monitoring, shell configuration, encryption, authentication, SELinux, firewalls, file systems, RAID and LVM, desktop preferences, GNOME, KDE, desktop applications, shared folders, shell commands, and printers. Coverage includes Red Hat Enterprise Linux 5.1 and 5.2. Installation and setup are also covered.
EducationTeaching computing to everyone
Authors: Mark Guzdial
Venue: Communications of the ACM (2009)

Studying the lessons learned from creating high-demand computer science courses for non-computing majors.
Specifying active databases as non-Markovian theories of actions
Authors: Iluju Kiringa
Venue: Journal of Intelligent Information Systems (2009)

Over the last 15 years, database management systems (DBMSs) have been enhanced by the addition of rule-based programming to obtain active DBMSs. One of the greatest challenges in this area is to formally account for all the aspects of active behavior using a uniform formalism. In this paper, we formalize active relational databases within the framework of the situation calculus by uniformly accounting for them using theories embodying non-Markovian control in the situation calculus. We call these theories active relational theories and use them to capture the dynamics of active databases. Transaction processing and rule execution is modelled as a theorem proving task using active relational theories as background axioms. We show that the major components of an ADBMS, namely the rule sets and the execution models, may be given a clear semantics using active relational theories. More precisely: we represent the rule set as a program written in a suitable version of the situation calculus based language ConGolog; then we extend an existing situation calculus based framework for modelling advanced transaction models to one for modelling the execution models of active behaviors.
A cost-based multi-unit resource auction for service-oriented grid computing
Authors: Michael Schwind, Oliver Hinz, Roman Beck
Venue: Proceedings of the 8th IEEE/ACM International Conference on Grid Computing (2007)

The application of Grid technology is at the transition from engineering and natural science-related industrial sectors to other industries that have a high demand for computing resources. However, the diffusion of Grid technology within industrial sectors which are not naturally engineering and natural science-related is often hindered by a lack of incentives to share the computational resources. A promising way to overcome these barriers is the introduction of economically inspired mechanisms for the use of Grid-based resources. Our work introduces a iterated Cost-based Multi-unit Resource Auction (CMRA) and compares a traditional cost-based accounting approach with dedicated servers as well as a pooling approach with regard to service quality and total costs. The cost-calculus used in our model is based on costs for the delayed processing of jobs and costs for the cancellation of these jobs if the job cannot be provided at a certain time span in the worst case. The simulation results indicate that pooling of IT resources by Grid technology can produce a reduction of 20.3% in cost within this model compared to dedicated servers in the computing centers. However, with the CMRA-based allocation of computing resources, a further 1.4% of cost reduction can be achieved while the achieved Quality-of-Service (QoS) can be significantly increased. Finally we think that there must be a further cost reduction potential for Grid solutions beyond these savings that can be achieved by using economically inspired allocation methods that are combined with advanced refining and learning methods.
Implementation of scientific computing applications on the Cell Broadband Engine
Authors: Guochun Shi, Volodymyr V. Kindratenko, Ivan S. Ufimtsev, Todd J. Martinez, James C. Phillips, Steven A. Gottlieb
Venue: Scientific Programming (2009)

The Cell Broadband Engine architecture is a revolutionary processor architecture well suited for many scientific codes. This paper reports on an effort to implement several traditional high-performance scientific computing applications on the Cell Broadband Engine processor, including molecular dynamics, quantum chromodynamics and quantum chemistry codes. The paper discusses data and code restructuring strategies necessary to adapt the applications to the intrinsic properties of the Cell processor and demonstrates performance improvements achieved on the Cell architecture. It concludes with the lessons learned and provides practical recommendations on optimization techniques that are believed to be most appropriate.
Document Reading System for the Visually Disabled
Authors: Kazuhide Sugawara
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

In this paper, we present a system for reading printed documents, which can be used by the visually disabled. Our system uses speech to transmit printed information to users. To cope with the slowness of the information transmission speed caused by the one-dimensionality of speech, the logical structure of the scanned documents is extracted and used to accelerate the access to the information. A tree-traversing command is provided for navigating through the logical tree generated by the system.
Dense Stereo Correspondence with Contrast Context Histogram, Segmentation-Based Two-Pass Aggregation and Occlusion Handling
Authors: Tianliang Liu, Pinzheng Zhang, Limin Luo
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

In a local and perceptual organization framework, a novel stereo correspondence algorithm is proposed to provide dense and accurate disparity maps under point ambiguity. First, the initial matching technique is based on raw matching cost obtained from local descriptor with contrast context histogram and two-pass cost aggregation via segmentation-based adaptive support weight. Second, the disparity estimation procedure consists sequentially of two steps: namely, a narrow occlusion handling and a multi-directional weighted least square (WLS) fitting for large occlusion. The experiment results indicate that our algorithm can increase robustness against outliers, and then obtain comparable and accurate disparity than other local stereo methods effectively, and it is even better than some algorithms using advanced and offline but computationally complicated global optimization based algorithms.
On the degree of standard geometric predicates for line transversals in 3D
Authors: Hazel Everett, Sylvain Lazard, William Lenhart, Linqiao Zhang
Venue: Computational Geometry: Theory and Applications (2009)

In this paper we study various geometric predicates for determining the existence of and categorizing the configurations of lines in 3D that are transversal to lines or segments. We compute the degrees of standard procedures of evaluating these predicates. The degrees of some of these procedures are surprisingly high (up to 168), which may explain why computing line transversals with finite-precision floating-point arithmetic is prone to error. Our results suggest the need to explore alternatives to the standard methods of computing these quantities.
OCSP for Grids: Comparing Prevalidation versus Caching
Authors: Jesus Luna, Oscar Manso, Manel Medina
Venue: Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (2006)

Nowadays the computational Grid uses X.509 digital certificates for a wide variety of security-related tasks, ranging from user authentication to job execution's delegation. However to ensure a comprehensive security framework such credentials need to be validated so that revoked, suspended and any other compromised certificate will not be allowed to access Grid resources. To achieve such tasks great interest is being given to the Online Certificate Status Protocol (OCSP) in security workgroups from the Global Grid Forum. In order to better understand the special requirements related with its use in previous work we introduced the Open GRid Ocsp API (OGRO), which provides OCSP support to the Globus Toolkit 4. However that research concluded that the Grid introduces some special requisites for OCSP's performance and security. As a follow-up to that work, this paper provides a comprehensive performance comparison between the novel Prevalidation and Caching mechanisms proposed by the authors to further improve Grid-OCSP. In addition, research about security compliance of both mechanisms around the newest Proxy Revocation concept is also presented in this work.
Security in Ad Hoc Networks: A Location Based Impersonation Detection Method
Authors: Md. Mashud Rana, Khandakar Entenam Unayes Ahmed, Nazmur Rowshan Sumel, Md. Shamsul Alam, Liton Sarkar
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Ad-hoc networks have a promising future in network area. It is highly demandable for its sudden and emergency utility. Ever changing topology adorned it with high flexibility. Due to its characteristics it is vulnerable to the various attacks, which are not known in wired networks. Out of these threats, impersonation attack is the most terrific and unavoidable, that can collapse the entire network. In this paper, we proposed a location based impersonation detection model that can uniquely locate the transmitter’s position. Specifically we consider signal direction and self-positioning of the nodes to determine the transmitter’s location. We use these pieces of information with some postulates to identify the impersonation. This greatly reduces the security threats in ad hoc network.
Key Distribution Framework for a Mobile Agent Platform
Authors: Leila Ismail, Ezedin Barka
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

Mobile Agents have been proposed as a distributed programming model for large-scale distributed systems. The model is appealing as a response to many of the challenges in today's large scale distributed environments: efficiency, heterogeneity, autonomy, etc. Electronic commerce, data mining, and network management are examples of applications domains. Though the model is very well understood by industrial and research communities, aspects still need to be investigated. In this paper, we investigate a key distribution approach suitable for mobile agents. The approach takes into account the dynamic behavior of the system: in particular the dynamic agent itinerary and the dynamic platform topology where servers can join and disjoin for/from receiving mobile agents.
An efficient cut enumeration for depth-optimum technology mapping for LUT-based FPGAs
Authors: Taiga Takata, Yusuke Matsunaga
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Recent technology mappers for LUT-based FPGAs employ cut enumeration. Although many cuts are often needed to find good network, enumerating all cuts with large size consumes run-time very much. The number of cuts exponentially increases with the size of cuts, which causes long run-time. Furthermore, an inefficiency of bottom-up merging in existing algorithms makes the run-time much longer. This paper presents a novel cut enumeration. The proposed algorithm is efficient because it enumerates cuts without bottom-up merging. Our algorithm has two modes; exhaustive enumeration and partial enumeration. Exhaustive enumeration enumerates all cuts. Partial enumeration enumerates partial cuts with a guarantee that a depth-minimum network can be constructed. The experimental results show that exhaustive enumeration runs about 3 times and 8 times faster than existing bottom-up algorithm [1] [2] for K=8, 9, respectively. The quality of network are the same. Furthermore, partial enumeration runs about 6 times and 18 times faster than bottom-up algorithm for K=8, 9, respectively. Area of network derived by the set of cuts enumerated by partial enumeration is only 4% larger than that derived by exhaustive enumeration on average, and the depth is the same.
Measuring government innovation in EU
Authors: Apostolos Vontas, Androklis Mavridis, Adamantios Koumpis, Vasiliki Moumtzi
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

An evaluative study 'Effectiveness of Information and communication technologies (ICT) research technology development (RTD) Impacts on the European Union (EU) Innovation System' was conducted to assess how effectively EU ICT RTD and deployment initiatives are being exploited in the European systems of innovation at member state and regional levels. The focus of the study was on understanding regional innovation as an ecology that converts generated knowledge and value creation into long-term competitiveness and economic growth. We elaborate the use of the PACE toolkit, as a qualitative tool for the visualization of the impact of EU research and innovation projects on ICT, by compiling an Inventory of Regional Assets, through a battery of interviews performed in the 10 selected regions. This paper elaborates on the value of increasing involvement of government organizations (like Public Administrations) in ICT research and innovation projects. It is really interesting, for example, to see that the direct value of acquisition of new ideas, approaches and knowledge by a government organization, can affect the regional policy on promoting innovation and creating a more competitive environment inside the region therefore generating the interest for external investment.
Array bounds check elimination in the context of deoptimization
Authors: Thomas Würthinger, Christian Wimmer, Hanspeter Mössenböck
Venue: Science of Computer Programming (2009)

Whenever an array element is accessed, Java virtual machines execute a compare instruction to ensure that the index value is within the valid bounds. This reduces the execution speed of Java programs. Array bounds check elimination identifies situations in which such checks are redundant and can be removed. We present an array bounds check elimination algorithm for the Java HotSpot(TM) VM based on static analysis in the just-in-time compiler. The algorithm works on an intermediate representation in static single assignment form and maintains conditions for index expressions. It fully removes bounds checks if it can be proven that they never fail. Whenever possible, it moves bounds checks out of loops. The static number of checks remains the same, but a check inside a loop is likely to be executed more often. If such a check fails, the executing program falls back to interpreted mode, avoiding the problem that an exception is thrown at the wrong place. The evaluation shows a speedup near to the theoretical maximum for the scientific SciMark benchmark suite and also significant improvements for some Java Grande benchmarks. The algorithm slightly increases the execution speed for the SPECjvm98 benchmark suite. The evaluation of the DaCapo benchmarks shows that array bounds checks do not have a significant impact on the performance of object-oriented applications.
A package for geostatistical integration of coarse and fine scale data
Authors: Yongshe Liu, André G Journel
Venue: Computers Geosciences (2009)

Building numerical models in earth science requires integration of many different data. Data typically come from different sources with different volume supports: fine-scale point support and coarse-scale block support. All are valuable information and should be incorporated into the final models. In addition, prior information, such as spatial correlation and property statistics (mean, variance, etc.), should also be considered. Several approaches are proposed to build high resolution models conditioned to both point and linear average block support data and accounting for prior structural information. A 3D case study for downscaling coarse scale data conditioned to point support data is presented. The results demonstrate the applicability and limitations of the proposed algorithms and software package.
Optimal Multi-Threshold Control for Wireless Mobile Networks
Authors: Feng Wei
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

In this paper we model the traffic of new and handoff calls in a single cell of wireless mobile networks by a finite buffer queueing system with two types of service classes and a so-called hysteresis multi-threshold based control policy. We describe the behavior of the system in term of a three-dimensional continuous-time Markov process (CTMP) and derive the steady-state distribution of the CTMP by the Stochastic Complementation approach. We calculate various performance measures such as the blocking and forced termination probabilities, and based on the numerical results we discuss the optimal multi-threshold control problem.
Region-based image retrieval using color-size features of watershed regions
Authors: Cheng-Chieh Chiang, Yi-Ping Hung, Hsuan Yang, Greg C. Lee
Venue: Journal of Visual Communication and Image Representation (2009)

This paper presents a region-based image retrieval system that provides a user interface for helping to specify the watershed regions of interest within a query image. We first propose a new type of visual features, called color-size feature, which includes color-size histogram and moments, to integrate color and region-size information of watershed regions. Next, we design a scheme of region filtering that is based on color-size histogram to fast screen out some of most irrelevant regions and images for the preprocessing of the image retrieval. Our region-based image retrieval system applies the Earth Mover's Distance in the design of the similarity measure for image ranking and matching. Finally, we present some experiments for the color-size feature, region filtering, and retrieval results that demonstrate the efficiency of our proposed system.
Verification of Receipts from M-commerce Transactions on NFC Cellular Phones
Authors: Jungha Woo, Abhilasha Bhargav-Spantzel, Anna Cinzia Squicciarini, Elisa Bertino
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

A main challenge in mobile commerce is to make it possible for users to manage their transaction histories from both online e-commerce transactions and in-person transactions. Such histories are typically useful to build credit or to establish trust based on past transactions. In this paper we propose an approach to manage electronic receipts on cellular devices by assuring their secure and privacy-preserving usage. We provide a comprehensive notion of transactions history including both on-line transaction and in-person transactions. We apply cryptographic protocols, such as secret sharing and zero knowledge proofs, in a potentially vulnerable and constrained setting. Specifically, our approach supports flexible strategies based on Shamir's secret sharing to cater to different user requirements and architectural constraints. In addition, aggregate zero knowledge proofs are used to efficiently support proofs of various receipt attributes. We have implemented the system on Nokia NFC cellular phones and report in the paper performance evaluation results.
Applying an Intrusion Detection Algorithm to Wireless Sensor Networks
Authors: Qi Wang, Shu Wang, Zhonglou Meng
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Although static sensor nodes have low computation and communication capabilities, they have specific properties, and can acquire stable neighboring nodes’ information, which can be used for detection of anomalies in networking and behaviors of the neighbor nodes, thus providing security for Wireless sensor networks. In many attacks against sensor networks, the first step for an attacker is to impersonate itself as a legitimate node within the network. To make a sensor node capable of detecting an intruder, a simple dynamic statistical model of the neighboring nodes is needed to build, together with a low-complexity detection algorithm to monitor received packet power levels. A detection algorithm based on security scheme for Wireless sensor networks is introduced in this paper.
Stability analysis of switched systems under dynamical dwell time control approach
Authors: Z. R. Xiang, W. M. Xiang
Venue: International Journal of Systems Science (2009)

This article investigates the stability of a class of switched systems using dynamical dwell time approach. First, the condition for stability of switched systems whose subsystems are stable are presented with dynamical dwell time approach, which is shown to be less conservative in switching law design than dwell time approach. Then the proposed approach is extended to the switched systems with both stable and unstable subsystems. Finally, some numerical examples are given to illustrate the effectiveness of the proposed results.