ppxscal/embedding_network huggingface dataset:
A network service curve approach for the stochastic analysis of networks
Authors: Florin Ciucu, Almut Burchard, Jörg Liebeherr
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

The stochastic network calculus is an evolving new methodology for backlog and delay analysis of networks that can account for statistical multiplexing gain. This paper advances the stochastic network calculus by deriving a network service curve, which expresses the service given to a flow by the network as a whole in terms of a probabilistic bound. The presented network service curve permits the calculation of statistical end-to-end delay and backlog bounds for broad classes of arrival and service distributions. The benefits of the derived service curve are illustrated for the exponentially bounded burstiness (EBB) traffic model. It is shown that end-to-end performance measures computed with a network service curve are bounded by O(Hlog H), where H is the number of nodes traversed by a flow. Using currently available techniques that compute end-to-end bounds by adding single node results, the corresponding performance measures are bounded by O(H3).
Optimization of total traffic in a slotted ALOHA based access network considering the capture and retransmission effects: Research Articles
Authors: Mohammad Muntaseer Mahfuz, Md. Farhad Hossain, Rashed Hossain Bhuiyan, Naiemul Haq, Mohammed Nazrul Islam
Venue: Wireless Communications Mobile Computing (2005)

The combined effect of capture ratio and number of transmission on the performance of a slotted ALOHA based wireless access network is analyzed. The network quality parameters are evaluated to investigate the effect of lowering the capture ratio and increasing the number of transmission. It is found that the slotted ALOHA based access network shows its stable operation in low capture environment even if the retransmission cut-off is increased. As a result the success rate of accessing the core network is improved. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Function minimization on special computers
Authors: J. C. Nash
Venue: ACM SIGNUM Newsletter (1981)

Rather than presenting new material, this paper is very much a reassessment of old ideas in the context of new needs or possibilities. Much of what is included lies in the realm of opinion, hopefully well-informed opinion. However, the practice of function minimization -- now becoming a mature science on large, general purpose computers -- remains a sort of witchcraft on special computers.
Resource Space Grid: model, method and platform: Research Articles
Authors: Hai Zhuge
Venue: Concurrency and Computation: Practice Experience (2004)

A Resource Space Grid is a virtual Grid that aims at effectively sharing, using and managing versatile resources across the Internet. The kernel of the Resource Space Grid includes a Resource Space Model (RSM) and a uniform Resource Using Mechanism (RUM). This paper presents the Resource Space Grid's core scientific issues and methodology, architecture, model and theory, design criteria and method, and practice. A normal form theory is proposed to normalize the resource space&mdash;a coordinate system for uniformly specifying and organizing resources. The RUM provides not only the end-users with an operable resource browser to operate resources using the built-in Resource Operation Language (ROL), but also the application developers with the ROL-based programming environment. The prototype platform based on the proposed model and method has been implemented and used for sharing and managing resources in distributed research teams. Operations on Resource Spaces can constitute the virtual communities of Resource Space Grids&mdash;a platform independent resource sharing environment. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Circular shifted transmit diversity: Research Articles
Authors: Gang Wu, Shixin Cheng
Venue: Wireless Communications Mobile Computing (2004)

Three design requirements of space-time block code, full diversity order, full data rate and orthogonality, cannot be achieved simultaneously when the number of transmit antenna is more than two. In this paper, we propose a transmit diversity scheme&mdash;circular shifted transmit diversity (CSTD). CSTD can always achieve the full data rate and has very low decoding complexity. Through the performance analysis and simulation comparison in the case of same spectrum efficiency between CSTD and other well-known proposed schemes, it can be proved that CSTD always significantly outperforms the other transmit diversity schemes with full data rate. Additionally, compared with the transmit diversity schemes with full diversity order, CSTD has lower complexity and approximately the same performance when channel coding is concatenated. Copyright &copy; 2004 John Wiley & Sons, Ltd.This work was done in National Mobile Communications Research Laboratory, Southeast University.
A method-level comparison of the Java Grande and SPEC JVM98 benchmark suites: Research Articles
Authors: David Gregg, James Power, John Waldron
Venue: Concurrency and Computation: Practice Experience (2005)

In this paper we seek to provide a foundation for the study of the level of use of object-oriented techniques in Java programs in general, and scientific applications in particular. Specifically, we investigate the profiles of Java programs from a number of perspectives, including the use of class library methods, the size of methods called, the mode of invoke instruction used and the polymorphicity of call sites. We also present a categorization of the nature of small methods used in Java programs. We compare the Java Grande and SPEC JVM98 benchmark suites, and note a significant difference in the nature and composition of these suites, with the programs from the Java Grande suite demonstrating a less object-oriented approach. Copyright &copy; 2005 John Wiley & Sons, Ltd.
QoS Management Through Adaptive Reservations
Authors: L. Abeni, T. Cucinotta, G. Lipari, L. Marzario, L. Palopoli
Venue: Real-Time Systems (2005)

Reservation based (RB) scheduling is a class of scheduling algorithms that is well-suited for a large class of soft real-time applications. They are based on a "bandwidth" abstraction, meaning that a task is given the illusion of executing on a dedicated slower processor. In this context, a crucial design issue is deciding the bandwidth that each task should receive. The point we advocate is that, in presence of large fluctuations on the computation requirements of the tasks, it can be a beneficial choice to dynamically adapt the bandwidth based on QoS measurements and on the subsequent application of feedback control (adaptive reservations).In this paper, we present two novel contributions to this research area. First, we propose three new control algorithms inspired to the ideas of stochastic control. Second, we present a flexible and modular software architecture for adaptive reservations. An important feature of this architecture is that it is realised by means of a minimally invasive set of modifications to the Linux kernel.
Toward Open Negotiation
Authors: Steve Phelps, Valentina Tamma, Michael Wooldridge, Ian Dickinson
Venue: IEEE Internet Computing (2004)

This article describes an approach to automated negotiation that agents can use in any marketplace, regardless of the negotiation mechanism in use. Because it expresses negotiation mechanisms via shared ontologies rather than hard-coding in participating agents, this approach is particularly suitable for open and dynamic environments, such as the Internet, in which the choice of negotiation protocol is subject to change.The authors address the problem of determining which negotiation strategies to use for a given mechanism by introducing an expert system to reason about bidding strategies according to the negotiation mechanism's declarative description.
Cooperative I/O: a novel I/O semantics for energy-aware applications
Authors: Andreas Weissel, Björn Beutel, Frank Bellosa
Venue: Proceedings of the 5th symposium on Operating systems design and implementationDue to copyright restrictions we are not able to make the PDFs for this conference available for downloading (2002)

In this paper we demonstrate the benefits of application involvement in operating system power management. We present Coop-I/O, an approach to reduce the power consumption of devices while encompassing all levels of the system---from the hardware and OS to a new interface for cooperative I/O that can be used by energy-aware applications. We assume devices which can be set to low-power operation modes if they are not accessed and where switching between modes consumes additional energy, e.g. devices with rotating components or network devices consuming energy for the establishment and shutdown of network connections. In these cases frequent mode switches should be avoided.With Coop-I/O, applications can declare open, read and write operations as deferrable and even abortable by specifying a time-out and a cancel flag. This information enables the operating system to delay and batch requests so that the number of power mode switches is reduced and the device can be kept longer in a low-power mode. We have deployed our concept to the IDE hard disk driver and Ext2 file system of Linux and to typical real-life programs so that they make use of the new cooperative I/O functions. With energy savings of up to 50%, the experimental results demonstrate the benefits of the concept. We will show that Coop-I/O even outperforms the "oracle" shutdown policy which defines the lower bound in power consumption if the timing of requests can not be influenced.
The feasibility of launching and detecting jamming attacks in wireless networks
Authors: Wenyuan Xu, Wade Trappe, Yanyong Zhang, Timothy Wood
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

Wireless networks are built upon a shared medium that makes it easy for adversaries to launch jamming-style attacks. These attacks can be easily accomplished by an adversary emitting radio frequency signals that do not follow an underlying MAC protocol. Jamming attacks can severely interfere with the normal operation of wireless networks and, consequently, mechanisms are needed that can cope with jamming attacks. In this paper, we examine radio interference attacks from both sides of the issue: first, we study the problem of conducting radio interference attacks on wireless networks, and second we examine the critical issue of diagnosing the presence of jamming attacks. Specifically, we propose four different jamming attack models that can be used by an adversary to disable the operation of a wireless network, and evaluate their effectiveness in terms of how each method affects the ability of a wireless node to send and receive packets. We then discuss different measurements that serve as the basis for detecting a jamming attack, and explore scenarios where each measurement by itself is not enough to reliably classify the presence of a jamming attack. In particular, we observe that signal strength and carrier sensing time are unable to conclusively detect the presence of a jammer. Further, we observe that although by using packet delivery ratio we may differentiate between congested and jammed scenarios, we are nonetheless unable to conclude whether poor link utility is due to jamming or the mobility of nodes. The fact that no single measurement is sufficient for reliably classifying the presence of a jammer is an important observation, and necessitates the development of enhanced detection schemes that can remove ambiguity when detecting a jammer. To address this need, we propose two enhanced detection protocols that employ consistency checking. The first scheme employs signal strength measurements as a reactive consistency check for poor packet delivery ratios, while the second scheme employs location information to serve as the consistency check. Throughout our discussions, we examine the feasibility and effectiveness of jamming attacks and detection schemes using the MICA2 Mote platform.
Origins of debris and mitigation through a secondary RF plasma system for discharge-produced EUV sources
Authors: E. Vargas López, B. E. Jurczyk, M. A. Jaworski, M. J. Neumann, D. N. Ruzic
Venue: Microelectronic Engineering (2005)

RF plasma based mitigation has been studied as an improved debris mitigation scheme for extreme ultraviolet (EUV) sources. The RF plasma ionizes sputtered neutral debris and, when used in conjunction with a collimator (also known as a foil trap), inhibits that debris from reaching the collector optics. An ionization fraction of 61+/-3% has been measured. In addition, increased scattering of the ion component of the debris has led to a decrease in erosive flux reaching the diagnostics. Results from in situ high-precision quartz crystal oscillators, ex situ surface characterization (Auger, XPS), and secondary plasma characterization is presented for a series of mitigation schemes, including a foil trap in conjunction with the RF plasma.
Book review: Partiality, Truth and Persistence by Tore Langholm (Lecture Notes 15 Ctr. for the Study of Lang. and Information. University of Chicago Press)
Venue: Issue 109 (July 1989) (1989)

Partiality, Truth and Persistence is the latest in a recent series of inexpensive, softcover lecture notes which deal with various aspects of logic and language. There are several works on natural language processing in the series, but most are rather theoretical studies of logic, especially computational logic. The remainder in the sixteen-title series deal with both topics, such as Pereira and Shieber's Prolog and Natural Language Analysis (Lecture Notes 10).
New approach to WLAN security with synchronized pseudo random
Authors: Qing-Hua Zheng, David L. Pepyne, Qing Wang
Venue: Journal of Computer Science and Technology (2004)

Wireless transmission is becoming increasing ubiquitous, but there is a big black hole in the security of this kind of network. Although IEEE 802.11 provides an optional Wired Equivalent Privacy (WEP) to implement the authentication and confidentiality, it leaves a lot of vulnerabilities and threats. This paper proposes a protocol called SPRNG for wireless data-link layer security. SPRNG is based on the sender and receiver who generate in a synchronized way a pseudo-random number sequence. In each transmission, the sender and receiver use a pair of random numbers, one for data frame authentication, and the other for encryption key. The random numbers are used as "one-time passwords" for sender authentication and as fresh encryption keys for each frame. SPRNG is designed to be compatible with the existing 802.11 products. Like WEP, the current 802.11 security protocol, SPRNG uses a symmetric key as its seed. SPRNG has already been simulated and tested in experiment, it shows that SPRNG has stronger security than WEP because it reveals little information for attackers. The key problem of SPRNG, synchronization loss problem, is also presented. Though motivated by wireless security, SPRNG is generic for many other applications, especially in the point to point communication.
Radio resource metric estimation for a TDD-CDMA system supporting wireless internet traffic: Research Articles
Authors: Yeonwoo Lee, Steve McLaughlin
Venue: Wireless Communications Mobile Computing (2004)

In this paper, the effect of wireless internet traffic on the functionality of a radio resource metric estimation (RME) applicable to a TDD-CDMA system which incorporates a multirate transmission scheme (such as multicode and multislot) with simple call admission control algorithm is investigated. A solution for efficient inter-working between the physical layer and the higher layers is proposed, a resource metric mapping function (RMMF) that can deliver information about the state of the current channel load condition by the monitoring of signal-to-interference ratio (SIR) bursts and also the availability of a code pool by estimating the mean and the standard deviation of SIR bursts. This function is defined and demonstrated by means of an average raw BER mapping diagram as a function of the mean and the standard deviation of SIR bursts according to the multirate transmission method. By using this kind of mapping function combined with throughput estimation, the radio resource allocation algorithm can successfully reflect the current interference and mobile radio channel characteristics. Copyright &copy; 2004 John Wiley & Sons, Ltd.The work reported in this contribution has formed part of the WA3 area of the Core2 Research Programme of the Virtual Centre of Excellence in Mobile and Personal Communications, Mobile VCE, www.mobilevce.com, whose funding support, including that of EPSRC, is gratefully acknowledged. Fully detailed technical reports on this research are available to Industrial Members of Mobile VCE.
An embedded system for an eye-detection sensor
Authors: Arnon Amir, Lior Zimet, Alberto Sangiovanni-Vincentelli, Sean Kao
Venue: Computer Vision and Image Understanding (2005)

Real-time eye detection is important for many HCI applications, including eye-gaze tracking, autostereoscopic displays, video conferencing, face detection, and recognition. Current commercial and research systems use software implementation and require a dedicated computer for the image-processing task--a large, expensive, and complicated-to-use solution. In order to make eye-gaze tracking ubiquitous, the system complexity, size, and price must be substantially reduced. This paper presents a hardware-based embedded system for eye detection, implemented using simple logic gates, with no CPU and no addressable frame buffers. The image-processing algorithm was redesigned to enable highly parallel, single-pass image-processing implementation. A prototype system uses a CMOS digital imaging sensor and an FPGA for the image processing. It processes 640 × 480 progressive scan frames at a 60 fps rate, and outputs a compact list of sub-pixel accurate (x,y) eyes coordinates via USB communication. Experimentation with detection of human eyes and synthetic targets are reported. This new logic design, operating at the sensor's pixel clock, is suitable for single-chip eye detection and eye-gaze tracking sensors, thus making an important step towards mass production, low cost systems.
Checking of models built using a graphically based formal modelling language
Authors: Robert John Walters
Venue: Journal of Systems and Software (2005)

RDT is a graphical formal modelling language in which the modeller works by constructing diagrams of the processes in their model which they then join together to form complete systems. Aside from the benefits which accrue as a side effect of building a formal model of a proposed system, these diagrammatic models can be useful as a means of communication between the development team and the users. However one of the greatest benefits of a formal model is that it can be subjected to rigorous examination to ensure that it satisfies properties required of the system.This paper describes the RDT language and a transformation from RDT into Promela code (the input language of the SPIN model-checker) which can be performed automatically and illustrates the use of the technique with an example.
A fuzzy reasoning scheme for context sharing decision making
Authors: A. Ali Eldin, J. van den Berg, R. Wagenaar
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

In context aware mobile applications users' sensitive information will be available to be collected by a large number of service providers, which might threaten users privacy. In this paper, we propose the use of fuzzy logic in helping automating consent decisions done by end users. The proposed fuzzy approach has been implemented based on Mamdani fuzzy inference systems, and has been integrated in one of the services provided by a real time UMTS mobile platform known as MIES at the university campus with real users. Results obtained give the indication of possibilities of adopting this approach in practical applications.
Methods of mathematical modeling for estimation of the organism condition (radionuclide diagnostics)
Authors: O. G. Sinyakova
Venue: Automation and Remote Control (2005)

Proposed was a procedure for constructing mathematical models of the kinetics of tagged compounds in human organism for estimation of the structural and functional conditions of the vitally important organs. Efficiency and adequacy of the models was illustrated by particular examples of estimating the radionuclide examination of lungs, liver, and kidneys.
The KR-Benes Network: A Control-Optimal Rearrangeable Permutation Network
Authors: Rajgopal Kannan
Venue: IEEE Transactions on Computers (2005)

The Benes network has been used as a rearrangeable network for over 40 years, yet the uniform N(2 \log N-1) control complexity of the N \times N Benes is not optimal for many permutations. In this paper, we present a novel O(\log N) depth rearrangeable network, called KR-Benes, that is permutation-specific control-optimal. The KR-Benes routes every permutation with the minimal control complexity specific to that permutation and its worst-case complexity for arbitrary permutations is bounded by the Benes; thus, it replaces the Benes when considering control complexity/latency. We design the KR-Benes by first constructing a restricted 2 \log K +2 depth rearrangeable network called K{\hbox{-}}{\rm Benes} for routing K{\hbox{-}}{\rm bounded} permutations with control 2N \log K, 0 \leq K \leq N/4. We then show that the N \times N Benes network itself (with one additional stage) contains every K{\hbox{-}}{\rm Benes} network as a subgraph and use this property to construct the KR-Benes network. With regard to the control-optimality of the KR-Benes, we show that any optimal network for rearrangeably routing K{\hbox{-}}{\rm bounded} permutations must have depth 2 \log K + 2 and, therefore, the K{\hbox{-}}{\rm Benes} (and, hence, the KR-Benes) is optimal.
Human-like fault diagnosis using a neural network implementation of plausibility and relevance
Authors: Viorel Ariton, Vasile Palade
Venue: Neural Computing and Applications (2005)

In real systems, fault diagnosis is performed by a human diagnostician, and it encounters complex knowledge associations, both for normal and faulty behaviour of the target system. The human diagnostician relies on deep knowledge about the structure and the behaviour of the system, along with shallow knowledge on fault-to-manifestation patterns acquired from practice. This paper proposes a general approach to embed deep and shallow knowledge in neural network models for fault diagnosis by abduction, using neural sites for logical aggregation of manifestations and faults. All types of abduction problems were considered. The abduction proceeds by plausibility and relevance criteria multiply applied. The neural network implements plausibility by feed-forward links between manifestations and faults, and relevance by competition links between faults. Abduction by plausibility and relevance is also used for decision on the next best test along the diagnostic refinement. A case study on an installation in a rolling mill plant is presented.
Tighter Bounds for Graph Steiner Tree Approximation
Authors: Gabriel Robins, Alexander Zelikovsky
Venue: SIAM Journal on Discrete Mathematics (2005)

The classical Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices (terminals). We present a new polynomial-time heuristic that achieves a best-known approximation ratio of $1 + \frac{\ln 3}{2} \approx 1.55$ for general graphs and best-known approximation ratios of $\approx 1.28$ for both quasi-bipartite graphs (i.e., where no two nonterminals are adjacent) and complete graphs with edge weights 1 and 2. Our method is considerably simpler and easier to implement than previous approaches. We also prove the first known nontrivial performance bound ($1.5 \cdot$ OPT) for the iterated 1-Steiner heuristic of Kahng and Robins in quasi-bipartite graphs.