ppxscal/embedding_network huggingface dataset:
Integrating active networking and commercial-grade routing platforms
Authors: R. Jaeger, S. Bhattacharjee, J. K. Hollingsworth, R. Duncan, T. Lavian, F. Travostino
Venue: Proceedings of the Workshop on Intelligence at the Network Edge (2000)

Current network nodes enable connectivity between end-systems by supporting a static and well-defined set of protocols. The forwarding service provided by these network nodes is fixed, simple, and increasingly being implemented in hardware. Active network nodes, on the other hand, enable the unattended, dynamic instantiation of custom programs into the network node, allowing for the introduction of new protocols and services at runtime. Current prototype implementations of active network nodes achieve this flexibility by injecting a significant amount of software into the forwarding path. This paper describes an Active Network platform that is ideally suited for integration into modern, commercial-grade network nodes, such as router and switches with silicon-based forwarding paths. This Active Network platform supports the dynamic introduction of application services that can alter packet processing; it comprises the Oplet Runtime Environment (ORE) and the Java Forwarding (JFWD) API. The ORE is the substrate that provides for the secure downloading, installation, and safe execution of network services. The JFWD API is a uniform, platform-independent portal through which software services can control the forwarding path of heterogeneous network nodes. We describe how existing active networking environments can be ported onto this Active Network platform and present performance results for dynamically loaded network services on the Accelar Gigabit Ethernet Routing Switch product.
On a rule-based interpretation of default conditionals
Authors: James P. Delgrande
Venue: Annals of Mathematics and Artificial Intelligence (2006)

In nonmonotonic reasoning, a default conditional ¿¿β has most often been informally interpreted as a defeasible version of a classical conditional, usually the material conditional. There is however an alternative interpretation, in which a default is regarded essentially as a rule, leading from premises to conclusion. In this paper, we present a family of logics, based on this alternative interpretation. A general semantic framework under this rule-based interpretation is developed, and associated proof theories for a family of weak conditional logics is specified. Nonmonotonic inference is easily defined in these logics. Interestingly, the logics presented here are weaker than the commonly-accepted base conditional approach for defeasible reasoning. However, this approach resolves problems that have been associated with previous approaches.
State Transition Model for Test Sequence Generation of MANET Clustering Protocols
Authors: Hideharu Kojima, Tomoyuki Ohta, Yoshiaki Kakuda
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

Conformance test is test to confirm whether an implemented software satisfies the designed specification or not. In order to execute conformance test, test sequences need to be generated from the state transition diagram, which represents the specification of the implemented software. There are some different behaviors of nodes between wireless mobile ad hoc networks and wired fixed networks. Since nodes move around in the ad hoc networks, any node in the ad hoc networks receives packets from an unexpected number of neighbor nodes during a specified period. So the length of test sequences generated from the state transition diagram is affected by the number of such neighbor nodes. In order to reduce the length of test sequences, this paper proposes conditions to redefine transitions to receive packets from neighbor nodes as a set of transitions in the state transition diagram. Then this paper shows how many number of test sequence can be reduced using the redefined transitions.
Interpreting Rosen
Authors: Olaf Wolkenhauer
Venue: Artificial Life (2007)

Some reflections on Robert Rosen, Chu and Ho, and Louie.
Bounding Peer-to-Peer Upload Traffic in Client Networks
Authors: Chun-Ying Huang, Chin-Laung Lei
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Peer-to-peer technique has now become one of the major techniques to exchange digital content between peers of the same interest. However, as the amount of peer-to-peer traffic increases, a network administrator would like to control the network resources consumed by peer-to--peer applications. Due to the use of random ports and protocol encryption, it is hard to identify and apply proper control policies to peer-to-peer traffic. How do we properly bound the peer-to-peer traffic and prevent it from consuming all the available network resources? In this paper, we propose an algorithm that tries to approximately bound the network resources consumed by peer-to-peer traffic without examining packet payloads. Our methodology especially focuses on upload traffic for that the upload bandwidth for an ISP are usually more precious than download bandwidth. The method is constructed in two stages. First, we observe several traffic characteristics of peer-to-peer applications and traditional clientserver based Internet services. We also observe the generic traffic properties in a client network. Then, based on the symmetry of network traffic in both temporal and spatial domains, we propose to use a bitmap filter to bound the network resources consumed by peer-to-peer applications. The proposed algorithm takes only constant storage and computation time. The evaluation also shows that with a small amount of memory, the peer-to-peer traffic can be properly bounded close to a predefined amount.
Discovering and Summarising Regions of Correlated Spatio-Temporal Change in Evolving Graphs
Authors: Jeffrey Chan, James Bailey, Christopher Leckie
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Graphs are adept at describing relational data, hence their popularity in fields including network management, webpage analysis and sociology. However, most of the current graph mining work regards graphs as static and unchanging, even though many graphs are dynamic. In this paper, we introduce a new pattern to discover from evolving graphs, namely regions of the graph that are evolving in a correlated manner. These regions of correlated spatio-temporal change group together graph changes that are topologically near (spatial) and evolve similarly (temporal) to each other. The regions can be used to summarise changes, particularly for graphs that have many simultaneous changes. We have developed an algorithm called cSTAG to summarise changes in dynamic graphs. This new algorithm discovers these regions of correlated change and identifies events that caused these changes. As a demonstration of the effectiveness of our algorithm, we applied cSTAG to summarise the changes to the Border Gateway Protocol connectivity graph during the 2005 Hurricane Katrina Disaster. cSTAG was able to identify the reported failures in Louisiana, as well as other simultaneous events.
Empirical Software Engineering in Industry Short Courses
Authors: David S. Janzen, Clark S. Turner, Hossein Saiedian
Venue: Proceedings of the 20th Conference on Software Engineering Education & Training (2007)

This paper reports on a pilot project that incorporated small empirical studies in three industry short courses. These laboratory experiments were one component of a larger leveled study on the effects of test-driven development (TDD) on internal software quality. The approach is proposed to have pedagogical value to student-developers by improving their understanding and appreciation for empirical evidence, to instructors by providing feedback through surveys and exercises, and to the community at large by reporting results of the studies. Pre-experiment surveys in the three pilot experiments revealed large differences in programmer opinions of TDD. Possible correlations to development environment and programmer experience will be proposed. Post-experiment surveys revealed improvements in programmer opinions of TDD following the experiment exercises. Crafting sufficiently small but interesting assignments proved to be challenging. Few complete solutions were submitted and some developers were unwilling to submit their partial solutions. Positive observations will be made regarding the use of experiments in short courses. For instance, participating in the study encourages analytical thinking, prompts developers to evaluate alternative approaches, and instills the value of empirical evidence. Ethical concerns regarding threats to validity are raised and addressed. The authors find that ethical considerations not only support performing such studies, but encourage it as the duty of software professionals.
Developing and deploying corporate cryptographic systems
Authors: Diane E. Coe, Judith A. Furlong
Venue: Proceedings of the 1st conference on USENIX Workshop on Electronic Commerce - Volume 1 (1995)

The MITRE Corporation has developed a number of cryptographic systems that provide security-related capabilities for its growing electronic information environment. These cryptographic systems were developed using commercial off-the-shelf products and widely accepted standards. Standards were adhered to in order to assure interoperability with emerging products such as those used to conduct electronic commerce on the Internet. However, there are many shortcomings within the marketplace and the Internet community that are limiting the extent to which interoperability can be achieved. Products are not as "open" as we need them to be, infrastructures are not in place, and standards are still evolving. This paper presents many of the issues with which we are faced and, in some cases, provides solutions. MITRE's needs are not unique. They are the needs of any enterprise wishing to provide an integrated security solution for the access and exchange of valuable electronic information. This paper first introduces The MITRE Corporation and describes its corporate cryptographic systems and information infrastructure. The paper then discusses issues associated with integrating MITRE's cryptographic systems with emerging electronic commerce products both for use within the corporation and for conducting electronic commerce externally. The paper concludes with recommendations and lends some insight into where The MITRE Corporation is headed in terms of its corporate cryptographic systems and electronic commerce.
A Placement Methodology for Robust Clocking
Authors: Ganesh Venkataraman, Jiang Hu
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

As the VLSI technology scales towards the nanometer regime, circuit performance is increasingly affected by variations. These variations need to be considered at an early stage in performance optimization. This work proposes a new placement methodology that facilitates low cost and robust clock network. It is based on the observation that bringing tightly constrained flipflops close to each other can reduce the noncommon paths between them in clock network. Such a reduction will inturn improve the tolerance of the clock network towards variations in delay/skew. Monte Carlo experiments (based on spatial correlations) indicate that our methodology can reduce the maximum skew violation due to variations by up to 62% with less than 2.7% increase in total wire length.
A second-order method for blind separation of non-stationary sources
Authors: R. Zhang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

The question addressed in this paper is whether and under what conditions blind source separation is possible using only second-order statistics. It is well known that for stationary, i.i.d. sources the answer is negative due to the inherent unitary matrix ambiguity of output second-order information. It is shown in this paper however, that if the sources' power is allowed to vary with time, unique identifiability can be achieved without resorting to higher order statistics. In many applications the sources' power does change with time (e.g., speech or fading communication signals), and therefore the result has practical relevance. A novel second-order source separation method is proposed based on a generalized eigen-decomposition of appropriate correlation matrices and the identifiability conditions are investigated. Asymptotic performance results for the output SIR are developed.
Exploring grid and e-business solutions in discovering web service software applications
Authors: Serena Pastore
Venue: Proceedings of the Second International Conference on Systems (2007)

The deployment of a web application into distributed environments like grid systems and web services frameworks pose discovery challenges. Problems arise in adopting a solution that provides an effective information model and the tools needed to facilitate the dynamic identification, searching and finding of this kind of resource. Several discovery methods have been explored in the framework of a project aimed at approaching different aspects of porting in grid astrophysical applications. Grid and e-business methodologies have been tested. The paper explores different mechanisms used to provide a solution by dealing with the use cases of resources made up of web service applications. It outlines the difficulties encountered in finding such resources through the current information system. The establishment of an industry approach is lacking in its ability to integrate with the current grid system, but it may help introduce semantics to the discovery process by enhancing the registry.
The linux BIOS
Authors: Ron Minnich, James Hendricks, Dale Webster
Venue: Proceedings of the 4th annual Linux Showcase & Conference - Volume 4 (2000)

The Linux BIOS replaces the normal BIOS found on PCs, Alphas, and other machines. The BIOS boot and setup is eliminated and replaced by a very simple initialization phase, followed by a gunzip of a Linux kernel. The Linux kernel is then started and from there on the boot proceeds as normal. Current measurements on two mainboards show we can go from a machine power-off state to the "mount root" step in a under a second, depending on the type of hardware in the machine. The actual boot time is difficult to measure accurately at present because it is so small. As the name implies, the LinuxBIOS is primarily Linux. Linux needs a small number of patches to handle uninitialized hardware: about 10 lines of patches so far. Other than that it is an off-the-shelf 2.3.99-pre5 kernel. The LinuxBIOS startup code is about 500 lines of assembly and 1500 lines of C. The Linux BIOS can boot other kernels; it can use the LOBOS(ref) or bootimg(ref) tools for this purpose. Because we are using Linux the boot mechanism can be very flexible. We can boot over standard Ethernet, or over other interconnects such as Myrinet, Quadrix, or Scaleable Coherent Interface. We can use SSH connections to load the kernel, or use InterMezzo or NFS. Using a real operating system to boot another operating system provides much greater flexibility than using a simple netboot program or BIOS such as PXE. LinuxBIOS currently boots from power-off to multi-user login on two mainboards, the Intel L440GX+ and the Procomm PSBT1. We are currently working with industrial partners (Dell, Compaq, SiS, and VIA) to port the LinuxBIOS to other machines. According to one vendor, weshould be able to purchase their LinuxBIOS-based mainboards by the end of this year.
Parallel Computing Algorithms and Applications
Authors: Sudarshan Raghunathan
Venue: Computing in Science and Engineering (2007)

The author reviews a book by L.R. Scott, T. Clark, and B. Bagheri, called "Scientific Parallel Computing," Princeton Univ. Press, 2005, ISBN: 978-0691119359, 416 pages.
Evaluation of the feedforward neural network covariance matrix error
Authors: S. Abid
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

This paper presents a theoretical approach for the evaluation of a feedforward neural network covariance output error matrix. It is shown how the input signals errors and the different weights errors are linked together and spread over the neural network to form the output covariance matrix error which could may be used to determine an error bound. The formulas of the output covariance matrix error is derived arising the sensitivity of the additive weight perturbations or input perturbations. The analytical formulas is validated via simulation of a function approximation example showing that the theoretical result is in agreement with simulation result.
Minitrack Summary: Wireless Sensor Networks
Authors: Edoardo Biagioni, Stefan Olariu
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The field of wireless sensor networks (WSNs) is maturing, and this year's contributions to this minitrack reflect this growing maturity with considerable breadth in the first session and depth in the second session.
Free-Form Tactile Sensor Using 3-Dimensional Shape Capture Sheet
Authors: Takayuki Hoshi, Hiroyuki Shinoda
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

We are developing a novel sensing device named "3-dimensional capture sheet (3DCS)". The cloth-like sheet measures its own 3D configuration. The sheet enables us to make a soft tactile sensor by wrapping a compressible material in it. The number, shapes, and positions of objects are obtained from the surface deformation of the material. The contact forces are also estimated. There is a lattice structure inside the sheet, and each link of the structure has a triaxial accelerometer. The roll and pitch angles of the link are derived from the gravity vector measured by the accelerometer. Furthermore, the relative yaw angle is also determined owing to the lattice structure. The posture of each link is fully described by these three angles. Then, the whole shape of the sheet is estimated by combining all of the links in computation.
Integrated, First-Year Curriculum in Science, Engineering, and Mathematics-a ten-year process
Authors: J. E. Froyd
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

The Integrated, First-Year Curriculum in Science, Engineering, and Mathematics (IFYCSEM) restructures first-year courses in calculus, mechanics (physics), engineering statics, electricity and magnetism (physics), computer science, chemistry, engineering graphics, and engineering design to create a three-course, twelve-credit-per-quarter sequence. Rose-Hulman Institute of Technology has offered IFYCSEM to a portion of the entering class since 1990. The paper traces the process through which the IFYCSEM program has been developed and identifies ways in which the development process may have been improve.
Synthesized stereo combined with acoustic echo cancellation for desktop conferencing
Authors: J. Benesty
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

One promising application in communications is desktop conferencing, which can involve several participants over a widely distributed area. Synthesized stereophonic sound will enable a listener to spatially separate one remote talker from another and thereby improve understanding. In such a scenario, we assume we are located in a hands-free environment where the composite acoustic signal is presented over loudspeakers, thus requiring acoustic echo cancellation. In this paper, we explain some of the methods that can be used to synthesize stereo sound and how such methods can be combined efficiently with stereo acoustic echo cancellation in the face of several difficult problems.
Inexact Data-Sparse Boundary Element Tearing and Interconnecting Methods
Authors: U. Langer, G. Of, O. Steinbach, W. Zulehner
Venue: SIAM Journal on Scientific Computing (2007)

The boundary element tearing and interconnecting (BETI) methods have recently been introduced as boundary element counterparts of the well-established finite element tearing and interconnecting (FETI) methods. In this paper we present inexact data-sparse versions of the BETI methods which avoid the elimination of the primal unknowns and dense matrices. However, instead of symmetric and positive definite systems, we finally have to solve twofold saddle point problems. The proposed iterative solvers and preconditioners result in almost optimal solvers whose complexity is proportional to the number of unknowns on the skeleton up to some polylogarithmical factor. Moreover, the solvers are robust with respect to large coefficient jumps.
Reflections on the IT Aspects of Writing, Designing, and Producing Law Games - Online, CD-Rom, or DVD?
Authors: Tess Li, M J. Le Brun
Venue: Proceedings of the The First IEEE International Workshop on Digital Game and Intelligent Toy Enhanced Learning (2007)

In November 2005, twenty-two high school student teams of different sizes logged on to the website of the newly established School of Law at The Chinese University of Hong Kong ("CUHK') to begin playing the interactive online game The Gold Rush: Mining the Law. In this article we describe some of the IT challenges that we faced, and we provide some tentative answers to the question: which is best - producing an educational online game or an educational game on CD-Rom/DVD?
Extended Kronecker Summation for Cluster Treatment of LTI Systems with Multiple Delays
Authors: Ali Fuat Ergenc, Nejat Olgac, Hassan Fazelinia
Venue: SIAM Journal on Control and Optimization (2007)

A new procedure is presented for determining the kernel and the offspring hypersurfaces for general linear time invariant (LTI) dynamics with multiple delays. These hypersurfaces, as they have very recently been introduced in a concept paper [R. Sipahi and N. Olgac, Automatica, 41 (2005), pp. 1413-1422], form the basis of the overriding paradigm which is called the cluster treatment of characteristic roots (CTCR). In fact, these two sets of hypersurfaces exhaustively represent the locations in the domain of the delays where the system possesses at least one pair of imaginary characteristic roots. To determine the kernel and offspring we use the extraordinary features of the &ldquo;extended Kronecker summation&rdquo; operation in this paper. The end result is that the infinite-dimensional problem reduces to a finite-dimensional one (and preferably into an eigenvalue problem). Following the procedure described in this paper, we are able to shorten the computational time considerably in determining these hypersurfaces. We demonstrate these concepts via some example case studies. One of the examples treats a 3-delay system. For this case another interesting perspective, called the &ldquo;building block,&rdquo; is also utilized to display the kernel in three-dimensional space in the domain of &ldquo;spectral delays.&rdquo;