ppxscal/embedding_network huggingface dataset:
T-Clipse: an integrated development environment for two-level grammar
Authors: Beum-Seuk Lee, Xiaoqing Wu, Fei Cao, Shih-hsi Liu, Wei Zhao, Chunmin Yang, Barrett R. Bryant, Jeffrey G. Gray
Venue: Proceedings of the 2003 OOPSLA workshop on eclipse technology eXchange (2003)

T-Clipse is an Integrated Development Environment (IDE) using Eclipse developed for Two-Level Grammar (TLG), a high-level formal specification language. In our research, given a programming language, TLG is used to specify the syntax and semantics of the language to generate an interpreter for that language. This IDE provides a user-friendly environment for editing and navigation of TLG source codes, as well as parsing and error tracing at the source code level and interpreter generation for programming languages. To build this IDE, we leveraged the extension power of plug-ins in Eclipse as well as a TLG parser prebuilt from an existing lexical analyzer generator and parser generator.
Perception and haptics: towards more accessible computers for motion-impaired users
Authors: Faustina Hwang, Simeon Keates, Patrick Langdon, P. John Clarkson, Peter Robinson
Venue: Proceedings of the 2001 workshop on Perceptive user interfaces (2001)

For people with motion impairments, access to and independent control of a computer can be essential. Symptoms such as tremor and spasm, however, can make the typical keyboard and mouse arrangement for computer interaction difficult or even impossible to use. This paper describes three approaches to improving computer input effectivness for people with motion impairments. The three approaches are: (1) to increase the number of interaction channels, (2) to enhance commonly existing interaction channels, and (3) to make more effective use of all the available information in an existing input channel. Experiments in multimodal input, haptic feedback, user modelling, and cursor control are discussed in the context of the three approaches. A haptically enhanced keyboard emulator with perceptive capability is proposed, combining approaches in a way that improves computer access for motion impaired users.
FAST: Frequency-Aware Static Timing Analysis
Authors: Kiran Seth, Aravindh Anantaraman, Frank Mueller, Eric Rotenberg
Venue: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)

Power is a valuable resource in embedded systems asthe lifetime of many such systems is constrained by theirbattery capacity. Recent advances in processor design haveadded support for dynamic frequency/voltage scaling (DVS)for saving power. Recent work on real-time scheduling focuseson saving power in static as well as dynamic schedulingenvironments by exploiting idle and slack due to earlytask completion for DVS of subsequent tasks. These schedulingalgorithms rely on a prioriknowledge of worst-case executiontimes (WCET) for each task. They assume that DVShas no effect on the worst-case execution cycles (WCEC)of a task and scale the WCET according to the processorfrequency. However, for systems with memory hierarchies,the WCEC typically does change under DVS due tofrequency modulation. Hence, current assumptions used byDVS schemes result in a highly exaggerated WCET.This paper contributes novel techniques for tight andflexible static timing analysis particularly well-suited fordynamic scheduling schemes. The technical contributionsare as follows: (1) We assess the problem of changing executioncycles due to scaling techniques. (2) We proposea parametric approach towards bounding the WCET staticallywith respect to the frequency. Using a parametricmodel, we can capture the effect of changes in frequencyon the WCEC and, thus, accurately model the WCET overany frequency range. (3) We discuss design and implementationof the frequency-aware static timing analysis (FAST)tool based on our prior experience with static timing analysis.(4) We demonstrate in experiments that our FAST toolprovides safe upper bounds on the WCET, which are tight.The FAST tool allows us to capture the WCET of six benchmarksusing equations that overestimate the WCET by lessthan 1%. FAST equations can also be used to improve existingDVS scheduling schemes to ensure that the effect of frequencyscaling on WCET is considered and that the WCETused is not exaggerated. (5) We leverage three DVS schedulingschemes by incorporating FAST into them and by showingthat the power consumption further decreases. To thebest of our knowledge, this study of DVS effects on timinganalysis is unprecedented.
Issues in the specification and design of parallel programs
Authors: Robert G. Babb
Venue: Proceedings of the 6th international workshop on Software specification and design (1991)

We present an overview of the main specification and design issues for parallel systems of programs from a software engineering perspective. A parallel system design approach based on the Large-Grain Data Flow 2 (LGDF2) computation model is outlined. An assessment of LGDF2 as the basis for unified specification, design, and implementation of parallel programs is given, along with a brief assessment of its potential impact on parallel software development and software project management.
Secure and Manageable Virtual Private Networks for End-users
Authors: Kenichi Kourai, Toshio Hirotsu, Koji Sato, Osamu Akashi, Kensuke Fukuda, Toshiharu Sugawara, Shigeru Chiba
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

This paper presents personal networks, which integrate aVPN and the per-VPN execution environments of the hostsincluded in the VPN. The key point is that each executionenvironment called a portspace is bound to only one VPN,i.e., single-homed. Using this feature of portspaces, personalnetworks address several problems at multi-homedhosts that use multiple VPNs. Information flow is separatedby personal networks so that it is not mixed at multi-homedhosts. IP addressing in a personal network is independentof the other personal networks, even the base network,and therefore does not conflict with those of other networksat multi-homed hosts. In addition, personal networksprovide facilities for easy bootstrapping so that the end-userscan construct such isolated networks easily. Inheritanceof portspaces supports the creation of new portspacesbased on existing portspaces. Self-construction of personalnetworks enables end-users to construct personal networkswithout help from the base network.
The use of smart devices in eHealth
Authors: John Fulcher
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Results from a field trial involving the use of USB iKeys as a secure access mechanism for remote access of patient medical records from a central server are reported. These are discussed within the context of eHealth generally, where technological considerations can easily be outweighed by concerns of patient privacy, security and confidentiality.
Barrier studies on porous silk semiconductor dielectric
Authors: Zs. Tőkei, F. Iacopi, O. Richard, J. Waeterloos, S. Rozeveld, E. Beach, B. Mebarki, T. Mandrekar, S. Guggilla, K. Maex
Venue: Microelectronic Engineering (2003)

Barrier integrity of Ta-films deposited using the enhanced coverage by re-sputtering (EnCoRe) barrier was investigated on untreated surfaces of blanket porous SiLK semiconductor dielectric (developmental version 7, hereinafter v7). Barrier integrity of a bi-layer EnCoRe Ta(N)/Ta film was studied on single damascene lines using v7 and porous SiLK semiconductor dielectric (developmental version 9, hereinafter v9). On blanket wafers more than 30 nm barrier thickness is necessary to achieve complete pore sealing. Analysis of the sheet resistance showed that when tantalum is deposited, a low resistivity α-phase is nucleated on the low-k surface. When deposited onto single damascene structures, EnCoRe Ta(N)/Ta is successful in providing a continuous metallic barrier layer over v7 and v9 semiconductor dielectric lines.
The state of teledensity diffusion in least developed countries: a review of the literature
Authors: Victor W. A. Mbarika
Venue: Advanced topics in global information management (2003)

This chapter reviews research from academic and major international organizational literature to examine and synthesize the current understanding of teledensity development in Least Developed Countries (LDCs). The obstacles to the growth of teledensity are discussed, and the importance and opportunities for growth of teledensity to solve priority problems and to realize sustainable development in LDCs are examined. The literature findings suggest that various policy, economical, financial managerial, organizational technological political, and geographical factors are important determinants for growth of teledensity in LDCs. A variety of strategies to advance teledensity in LDCs are suggested.
Modifying the Overlay Network of Freenet-Style Peer-to-Peer Systems after Successful Request Queries
Authors: Jens Mache, David Ely, Melanie Gilbert, Jason Gimba, Thierry Lopez, Matthew Wilkinson
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

In most peer-to-peer systems, edge resources self-organize into overlay networks. At the core of Freenet-style peer-to-peer systems are insert and request algorithms that dynamically change the overlay network and replicate files on demand.We run simulations to test how effective these algorithms are at improving the performance of subsequent queries. Motivated by the observation that the performance of theoriginal Freenet algorithms improves less rapidly with a (more realistic) ratio of 99 requests to 1 insert than with an equal number of requests and insert, we design and test a wide range of new request algorithms that pass word of success to neighboring nodes and add additional edges to the overlay network. Our results show that performance is sensitive to (1) where to add edges and (2) how many edges to add. In comparison to the original request algorithm, our best new algorithm is able to reduce average request pathlength by up to a factor of 22.37.
Complexity and Probability of Some Boolean Formulas
Authors: Petr Savický
Venue: Combinatorics, Probability and Computing (1998)

For any Boolean function f, let L(f) be its formula size complexity in the basis {&and;, &oplus; 1}. For every n and every k&le;n&#x002F;2, we describe a probabilistic distribution on formulas in the basis {&and;, &oplus; 1} in some given set of n variables and of size at most &lscr;(k)=4k. Let pn,k(f) be the probability that the formula chosen from the distribution computes the function f. For every function f with L(f)&le;&lscr;(k)&alpha;, where &alpha;=log4(3&#x002F;2), we have pn,k(f)>0. Moreover, for every function f, if pn,k(f)>0, then***** Insert equation here *****where c>1 is an absolute constant. Although the upper and lower bounds are exponentially small in &lscr;(k), they are quasi-polynomially related whenever &lscr;(k)&ge;ln&Omega;(1)n. The construction is a step towards developing a model appropriate for investigation of the properties of a typical (random) Boolean function of some given complexity.
Multi-Class Bandwidth Allocation Policy for 3G Wireless Networks
Authors: Nidal Nasser, Hossam Hassanein
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

In this paper we develop an analytical threshold-basedbandwidth allocation policy for 3G multi-class cellularnetworks. We consider the effects of user mobility whenthe cellular network supports multiple classes ofconnections having different QoS bandwidth requirements.The policy gives priority to handoff connections over newcalls and prioritizes between different classes of handoffconnections according to their QoS constraints byassigning a maximum occupancy, i.e. a threshold, to eachconnection class. The policy can be modeled as a multi-dimensionMarkov chain, and therefore, a product formsolution is provided. The QoS metrics - new call blockingprobability, handoff call dropping probability, andprobability of unsuccessful call completion - are derived.We show numerically that this policy improves the servicequality by minimizing handoff dropping probability andmaximizing the bandwidth utilization i.e. by minimizingthe new call blocking probability.
Parallel programming in computational science: an introductory practical training course for computer science undergraduates at Aachen University
Authors: H. M. Bücker, B. Lang, C. H. Bischof
Venue: Future Generation Computer Systems (2003)

Parallel programming of high-performance computers has emerged as a key technology for the numerical solution of large-scale problems arising in computational science and engineering (CSE). The authors believe that principles and techniques of parallel programming are among the essential ingredients of any CSE as well as computer science curriculum. Today, opinions on the role and importance of parallel programming are diverse. Rather than seeing it as a marginal beneficial skill optionally taught at the graduate level, we understand parallel programming as crucial basic skill that should be taught as an integral part of the undergraduate computer science curriculum. A practical training course developed for computer science undergraduates at Aachen University is described. Its goal is to introduce young computer science students to different parallel programming paradigms for shared and distributed memory computers as well as to give a first exposition to the field of computational science by simple, yet carefully chosen sample problems.
On the performance of kernel classes
Authors: Shahar Mendelson
Venue: The Journal of Machine Learning Research (2003)

We present sharp bounds on the localized Rademacher averages of the unit ball in a reproducing kernel Hilbert space in terms of the eigenvalues of the integral operator associated with the kernel. We use this result to estimate the performance of the empirical minimization algorithm when the base class is the unit ball of the reproducing kernel Hilbert space.
Algorithms for very large spatial databases
Authors: Octavian Procopiuc
Venue:  (2002)

In this thesis, we aim at bridging the gap between theory and practice in handling very large spatial data sets by developing I/O-efficient algorithms and data structures that are both practical and robust. We prove theoretical bounds on the performance of these techniques in the standard I/O model. We also demonstrate their practical efficiency through extensive experiments, both on real-life and synthetic data. The programs were developed using TPIE, a software package that facilitates the implementation of I/O-efficient techniques. We developed a new module of TPIE that adds support for on-line data structures. In the first part of the thesis we develop a theoretically optimal algorithm for a large class of batched searching problems, including batched range searching, orthogonal segment intersection and rectangle intersection. By applying this algorithm to rectangle intersection, we obtain a new algorithm for the spatial join operation. We validate the practical performance, robustness and scalability of our algorithm by comparing it with the state-of-the-art algorithm from the database community. In the second part of the thesis we study algorithms and data structures for on-line searching problems. In particular, we concentrate on the range query, the most important query type in spatial databases. We present the Bkd-tree, a new I/O-efficient dynamic data structure for answering range queries on point data sets. We present the results of an extensive experimental study showing that the Bkd-tree maintains high space utilization and excellent query and update performance regardless of the number of updates performed on it. In addition, we present a new general I/O-efficient construction (bulk loading) technique for a large class of structures. Our approach gives considerably improved construction I/O bounds for kd-trees and other existing data structures.
Local entropy-based transition region extraction and thresholding
Authors: Chengxin Yan, Nong Sang, Tianxu Zhang
Venue: Pattern Recognition Letters (2003)

Transition region based thresholding is a newly developed approach for image segmentation in recent years. Gradient-based transition region extraction methods (G-TREM) are greatly affected by noise. Local entropy in information theory represents the variance of local region and catches the natural properties of transition regions. In this paper, we present a novel local entropy-based transition region extraction method (LE-TREM), which effectively reduces the affects of noise. Experimental results demonstrate that LE-TREM significantly outperforms the conventional G-TREM.
Generalized Parallel-Perspective Stereo Mosaics from Airborne Video
Authors: Zhigang Zhu, Allen R. Hanson, Edward M. Riseman
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--In this paper, we present a new method for automatically and efficiently generating stereoscopic mosaics by seamless registration of images collected by a video camera mounted on an airborne platform. Using a parallel-perspective representation, a pair of geometrically registered stereo mosaics can be precisely constructed under quite general motion. A novel parallel ray interpolation for stereo mosaicing (PRISM) approach is proposed to make stereo mosaics seamless in the presence of obvious motion parallax and for rather arbitrary scenes. Parallel-perspective stereo mosaics generated with the PRISM method have better depth resolution than perspective stereo due to the adaptive baseline geometry. Moreover, unlike previous results showing that parallel-perspective stereo has a constant depth error, we conclude that the depth estimation error of stereo mosaics is in fact a linear function of the absolute depths of a scene. Experimental results on long video sequences are given.
Facilitating Secure Ad hoc Service Discovery in Public Environments
Authors: Feng Zhu, Matt Mutka, Lionel Ni
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Securely accessing unfamiliar services in publicenvironments using ad hoc wireless networks ischallenging. We present a proxy-based approach thatuses other existing network channels to set up a secureand trust relationship between communication parties tofacilitate ad hoc wireless communications. Based on aservice discovery protocol, our models achieve secure,trusted, anonymous, efficient, and economicalcommunications between unfamiliar parties. Ourprotocols are formally verified using BAN logic.
Poster abstract: on the scaling laws of dense wireless sensor networks
Authors: Praveen Kumar Gopala, Hesham El Gamal
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

We characterize the scaling laws of many-to-one dense wireless sensor networks and derive conditions governing the observability of random fields by such networks. We further extend our results to the multimodal case where the sensors observe multiple random processes simultaneously. Quite interestingly, our results show that an unbounded number of spatially bandlimited Gaussian processes can be observed simultaneously by a dense multimodal wireless sensor network.
On-line reconfiguration of virtual topologies in wavelength-routed WDM networks
Authors: N. Sreenath, C. Siva Ram Murthy
Venue: Journal of High Speed Networks (2003)

Wavelength-division multiplexed (WDM) networks employing wavelength-routing are considered to be potential candidates for the next generation wide-area backbone networks. In these networks, messages are carried in all-optical form using lightpaths. In a WDM network, the set of semi-permanent lightpaths which are set up in the network may be viewed as a virtual topology by higher layers such as SONET, ATM, and IP. The virtual topology is designed with an aim of minimizing certain objective function value. The underlying virtual topology may need to be changed in response to the changing traffic patterns in the higher layer. This process of changing the virtual topology to meet the traffic requirement is called as reconfiguration. The reconfiguration can be performed either on-line or off-line. We view the reconfiguration as an on-line process and it provides a trade-off between the objective function value and the number of changes to the virtual topology. The objective function value decides how best the topology is suited for the given traffic demand. The number of changes decides the extent of disruption of traffic in the network while making a transition to the new virtual topology. As the reconfiguration problem is computationally intractable, we propose four heuristic algorithms for reconfiguration of virtual topology, namely, Phasel, Phase2-Single, Phase2-Multi, and Two-Phase. These heuristic algorithms reconfigure the current virtual topology if traffic pattern changes from the existing one. The performance of these heuristic algorithms are compared in terms of objective function value of reconfigured topology, number of changes performed to get the reconfigured topology, and the amount of time taken by these algorithms to compute changes in the existing virtual topology.
Computing story trees
Authors: Alfred Correira
Venue: Computational Linguistics (1980)

A theory of understanding (parsing) texts as a process of collecting simple textual propositions into thematically and causally related units is described, based on the concept of macrostructures as proposed by Kintsch and van Dijk. These macrostructures are organized into tree hierarchies, and their interrelationships are described in rule-based story grammars related to the Kowalski logic based on Horn clauses. A procedure for constructing and synthesizing such trees from semantic network forms is detailed. The implementation of this procedure is capable of understanding and summarizing any story it can generate using the same basic control structure.
Structural Optimization of Large Heterogeneous Systems
Authors: B. I. Pustovit
Venue: Automation and Remote Control (2003)

The structural optimization of a large system designed from several types of base subsystems is studied. The linear cost functional of the system satisfying the operation quality requirements with a guaranteed probability is shown to be minimal for a system designed mostly from base subsystems of a single type. This result greatly aids in solving the integer optimization problem and yields the first approximation for the solution of the dual problem.
Privacy Protection of Binary Confidential Data Against Deterministic, Stochastic, and Insider Threat
Authors: Robert Garfinkel, Ram Gopal, Paulo Goes
Venue: Management Science (2002)

A practical model and an associated method are developed for providing consistent, deterministically correct responses to ad-hoc queries to a database containing a field of binary confidential data. COUNT queries, i.e., the number of selected subjects whose confidential datum is positive, are to be answered. Exact answers may allow users to determine an individual's confidential information. Instead, the proposed technique gives responses in the form of a number plus a guarantee so that the user can determine an interval that is sure to contain the exact answer. At the same time, the method is also able to provide both deterministic and stochastic protection of the confidential data to the subjects of the database. Insider threat is defined precisely and a simple option for defense against it is given. Computational results on a simulated database are very encouraging in that most queries are answered with tight intervals, and that the quality of the responses improves with the number of subjects identified by the query. Thus the results are very appropriate for the very large databases prevalent in business and governmental organizations. The technique is very efficient in terms of both time and storage requirements, and is readily scalable and implementable.