ppxscal/embedding_network huggingface dataset:
Metro Ethernet - Deploying the extended Campus using Ethernet Technology
Authors: Frank Brockners, Norman Finn, Steve Phillips
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

Ethernet has been one of the most influential technologiesfor local area networks (LANs) and is now getting readyfor deployment in metropolitan and wide area networks.Activities in the standard bodies reflect the new role ofEthernet - often referred to as "Metro or WANEthernet". ITU, IEEE and IETF are all working onsolutions that not only expand the reach of Ethernet, butalso enable new, innovative services.Starting with a brief look at the driving forces for MetroEthernet this paper will identify four canonical servicesfor Ethernet MAN/WAN and discuss related deploymentissues of the different service options. Topics such assecurity, routing protocol effects and multicastdistribution, QoS, and Layer-2 inter-working will bediscussed in the context of point-to-point and multipointEthernet services. The paper concludes with a look atredundancy and loop avoidance for large Layer-2provider networks - including a discussion of the currentapproaches in VPLS as well as new proposals, whichlead to a generic solution for redundancy in large Layer-2provider networks.
Classroom communication media
Authors: Adele Goldberg, Bonnie Tenenbaum
Venue: ACM SIGCUE Outlook (1975)

As part of our investigations into the design and development of media for expressing and viewing dynamic processes, we have been teaching children from ages 8 to 15 the Smalltalk programming language. Our intention in this paper is to introduce a new communication medium with which young children create and explore powerful computing tools, including free-hand and programmed graphics, animation, and music synthesis. It is our objective here to offer suggestions and to specify guidelines by which teachers and learners can design, plan, and expand their programming projects.
Security framework for web content maintenance
Authors: Jamie Marie Showrank
Venue:  (2002)

The massive growth in Internet usage is putting pressure on organizations to migrate business operations to the web. Market drivers for Internet growth include data sharing, real-time access to business systems, and access to business systems around the clock. Some web sites change content continually, as much as several times a day for news and stock quote content. Other web sites are reference-based, and do not need frequently updated content. When web site content needs to be updated, the web application developer (technical team who creates a web site) or content owner (legal owner of a web's content) must have a way to securely copy new content to the web site. This process is called content maintenance and is the focus of this research. This research investigates the challenge of achieving effective, secured web site content maintenance in one large organization, Bayer Corporation. Because Bayer has implemented a web farm for Internet and e-business hosting, web site developers and content owners must be able to securely update web content on all servers in the web farm at the same time. The problem with content maintenance is unique, because web site content must be maintained from the public Internet and the private Intranet to the same web-hosting environment. For this research, the goals of security play an integral role in achieving effective content maintenance. The goals of security are authentication, authorization, confidentiality, data integrity, and non-repudiation. Content maintainers must be properly authenticated to Bayer's hosting environment and once authenticated, must be properly authorized only to the web sites that they maintain, and not to other web sites in the web farm. Confidentiality of private web pages on a web site is achieved through data encryption or through password protection so that search engines do not index confidential content. Data integrity is achieved through encryption of the transport between the content maintainer and the web-hosting environment and through special software installed on the web servers. Non-repudiation is achieved through digital certificates presented by the user to the web site.
Intermediate Emacs hacking
Authors: Charles Curley
Venue: Linux Journal (2004)

You don't have to be a LISP hacker to customize Emacs.
A Cut-Based Algorithm for Reliability Analysis of Terminal-Pair Network Using OBDD
Authors: Yung-Ruei Chang, Hung-Yau Lin, Ing-Yi Chen, Sy-Yen Kuo
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

In this paper,we propose an algorithm to construct theOrdered Binary Decision Diagram (OBDD) representingthe cut function of a terminal-pair network. The algorithmrecognizes isomorphic sub-problems and thus avoids redundant computations. The system reliability could be efficiently computed by the OBDD. Finally, we propose anapproach to compute the importance measures for multiplecomponents by traversing the OBDD only once. The correctness and the effectiveness of our approach are demonstrated by experiments on 30 benchmark networks. Theexperimental results on a 2-by-100 lattice network, whichhas 299paths or 10,000 cuts,show an impressive improvement compared to the previous works using the sum ofdisjoint products method that have exponential complexity.The CPU time of our method, including the calculation ofnot only the reliability but also the importance measures,for a 100-stage lattice network is only about 0.24 seconds.Thus, this approach is very helpful for the reliability andsensitivity analysis of large networks.
Fluid interaction techniques for the control and annotation of digital video
Authors: Gonzalo Ramos, Ravin Balakrishnan
Venue: Proceedings of the 16th annual ACM symposium on User interface software and technology (2003)

We explore a variety of interaction and visualization techniques for fluid navigation, segmentation, linking, and annotation of digital videos. These techniques are developed within a concept prototype called LEAN that is designed for use with pressure-sensitive digitizer tablets. These techniques include a transient position+velocity widget that allows users not only to move around a point of interest on a video, but also to rewind or fast forward at a controlled variable speed. We also present a new variation of fish-eye views called twist-lens, and incorporate this into a position control slider designed for the effective navigation and viewing of large sequences of video frames. We also explore a new style of widgets that exploit the use of the pen's pressure-sensing capability, increasing the input vocabulary available to the user. Finally, we elaborate on how annotations referring to objects that are temporal in nature, such as video, may be thought of as links, and fluidly constructed, visualized and navigated.
Human-Agent Teamwork for Distributed Team Training
Authors: Dianxiang Xu, Richard A. Volz, Michael S. Miller, Jesse Plymale
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

This paper presents an approach to human-agent mixed teams for distributed team training, demonstrated through the integration of the domain independent multiagent architecture CAST with the military command-and-control simulation software DDD (Distributed DynamicDecision-making). We extend the CAST architecture in a way such that agents can replace any number of teammates on a DDD team. To capture the overall picture of teamwork, we explore the MALLET language in CAST for the specification of team structures and processes that involve both humans and agents.
A Comparison of the AC and DC Power Flow Models for LMP Calculations
Authors: Thomas J. Overbye, Xu Cheng, Yan Sun
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 2 - Volume 2 (2004)

The paper examines the tradeoffs between using a full ac model versus the less exact, but much faster, dc power flow model for LMP-based market calculations. The paper first provides a general discussion of the approximations associated with using a dc model, with an emphasis on the impact these approximations will have on security constrained OPF (SCOPF) results and LMP values. Then, since the impact of the approximations can be quite system specific, the paper provides case studies using both a small 37 bus system and a somewhat larger 12,965 bus model of the Midwest U.S. transmission grid. Results are provided comparing both the accuracy and the computational requirements of the two models. Thegeneral conclusion is that while there is some loss of accuracy using the dc approximation, the results actually match fairly closely with the full ac solution.
Product Management in Telecom Industry - Using Requirements Management Process
Authors: Anat Grynberg, Leah Goldin
Venue: Proceedings of the IEEE International Conference on Software-Science, Technology & Engineering (2003)

As the telecom market becomes more consolidated theindustrial key players are forced to release productversions to the market at a growing pace in order to complywith customer requirements and market trends. The timebetween the initial feedback or requirement originating inthe field until the product release and the applicationsatisfying the demand is becoming more critical. Productmanagement's ability to identify the requirements andmatch them with the company's core SW resources andtechnological assets is becoming a core competence.NICE Systems is a worldwide leader of multimediadigital recording solutions. NICE products are used by65% of Fortune 100 companies in 30,000 sites includingcontact centers, financial institutions, public safety sites,ATC (air traffic control) sites, CCTV (closed circuittelevision) security installations and government markets.In this article, we will discuss the implementation of aneffective way of managing requirements and how itimproved the daily work of product managers as well astheir counter-parts in the rest of the company.
Parallel Discrete-Event Simulation Framework
Authors: Mauricio Marín, Rodrigo Miranda, Alex Alvarado
Venue: Proceedings of the XXIII International Conference of the Chilean Computer Science Society (2003)

This paper describes a software enviroment devised tosupport parallel and sequential discrete-event simulation.It provides assistance to the user in issues such as selectionof the synchronization protocol to be used in the executionof the simulation of the model. The software frameworkhas been built upon the bulk-synchronous model of parallelcomputing. The well-defined structure of this model allowedus to predict the running time cost of synchronization protocolsin accordance with the particular work-load generatedby the execution of the simulation model. We exploit thisfeature to automatically generate the simulation program.
Test Adequacy Assessment for UML Design Model Testing
Authors: Sudipto Ghosh, Robert France, Conrad Braganza, Nilesh Kawane, Anneliese Andrews, Orest Pilskalns
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

Systematic design testing, in which executable modelsof behaviors are tested using inputs that exercise scenarios,can help reveal flaws in designs before they are implementedin code. We present a testing method in whichexecutable forms of the Unified Modeling Language (UML)models are tested. The method incorporates the use of testadequacy criteria based on UML model elements in classdiagrams and interaction diagrams. Class diagram criteriaare used to determine the object configurations on whichtests are run, while interaction diagram criteria are used todetermine the sequences of messages that should be tested.The criteria can be used to define test objectives for UMLdesigns. In this paper, we describe and illustrate the use ofthe proposed test method and adequacy criteria.
Experiments with autonomous test of PLAs
Authors: Einar J. Aas, Gunnar Nystu
Venue: Proceedings of the conference on European design automation (1991)

An architecture for BIST of PLAs is presented, together with a testability analysis tool to assert test quality. The functionality of the PLA itself is utilized for stimuli generation. Experiments assert that the test patterns generated can be considered as random patterns with equal 1 and 0 probability of each input. Test quality is measured based upon computed fault detectability and estimated fault coverage at a desired confidence level. A set of 53 PLA benchmark circuits from Berkeley is used to demonstrate the features of the method. It is found that 37 of 53 PLAs are random testable to 99% fault coverage with less than 100.000 patterns.
On the a posteriori error analysis for equations of prescribed mean curvature
Authors: Francesca Fierro, Andreas Veeser
Venue: Mathematics of Computation (2003)

We present two approaches to the a posteriori error analysis for prescribed mean curvature equations. The main difference between them concerns the estimation of the residual: without or with computable weights. In the second case, the weights are related to the eigenvalues of the underlying operator and thus provide local and computable information about the conditioning. We analyze the two approaches from a theoretical viewpoint. Moreover, we investigate and compare the performance of the derived indicators in an adaptive procedure. Our theoretical and practical results show that it is advantageous to estimate the residual in a weighted way.
Convergence Analysis of Spectral Collocation Methods for a Singular Differential Equation
Authors: Weizhang Huang, Heping Ma, Weiwei Sun
Venue: SIAM Journal on Numerical Analysis (2003)

Solutions of partial differential equations with coordinate singularities often have special behavior near the singularities, which forces them to be smooth. Special treatment for these coordinate singularities is necessary in spectral approximations in order to avoid degradation of accuracy and efficiency. It has been observed numerically in the past that, for a scheme to attain high accuracy, it is unnecessary to impose all the pole conditions, the constraints representing the special solution behavior near singularities. In this paper we provide a theoretical justification for this observation. Specifically, we consider an existing approach, which uses a pole condition as the boundary condition at a singularity and solves the reformulated boundary value problem with a commonly used Gauss--Lobatto collocation scheme. Spectral convergence of the Legendre and Chebyshev collocation methods is obtained for a singular differential equation arising from polar and cylindrical geometries.
Modeling spatial-temporal data with a short observation history
Authors: Dragoljub Pokrajac, Reed L. Hoskinson, Zoran Obradovic
Venue: Knowledge and Information Systems (2003)

A novel method is proposed for forecasting spatial-temporal data with a short observation history sampled on a uniform grid. The method is based on spatial-temporal autoregressive modeling where the predictions of the response at the subsequent temporal layer are obtained using the response values from a recent history in a spatial neighborhood of each sampling point. Several modeling aspects such as covariance structure and sampling, as well as identification, model estimation and forecasting issues, are discussed. Extensive experimental evaluation is performed on synthetic and real-life data. The proposed forecasting models were shown capable of providing a near optimal prediction accuracy on simulated stationary spatial-temporal data in the presence of additive noise and a correlated model error. Results on a spatial-temporal agricultural dataset indicate that the proposed methods can provide useful prediction on complex real-life data with a short observation history.
Inverse analysis of material removal data using a multiscale CMP model
Authors: Jongwon Seok, Andrew T. Kim, Cyriaque P. Sukam, Anurag Jindal, John A. Tichy, Ronald J. Gutmann, Timothy S. Cale
Venue: Microelectronic Engineering (2003)

This paper describes a mechanical model for a representative dual axis rotational chemical mechanical planarization (CMP) tool. The model is three-dimensional, multiscale and includes sub-models for bulk pad deformation, asperity deformation, lubrication based slurry flow, carrier film deformation, wafer compliance and material removal by abrasive particles in the slurry. With the model, material removal rate (MRR) can be determined as a function of stress applied to the wafer, relative sliding speed, and material and geometric parameters of the pad and slurry. Experimental material removal rate profiles obtained from Cu polishing experiments performed on a wafer without rotation are analyzed as an inverse problem. We use MRR data to predict local CMP conditions such as fluid film thickness, fluid pressure and contact pressure. The results are consistent with available experimental and analytical information. This inverse technique offers promise as an improved method of CMP model verification.
Validating Use-Cases with the AsmL Test Tool
Authors: Mike Barnett, Wolfgang Grieskamp, Wolfram Schulte, Nikolai Tillmann, Margus Veanes
Venue: Proceedings of the Third International Conference on Quality Software (2003)

The Abstract State Machine Language supports use-caseoriented modeling in a faithful way. In this paperwe discuss how the AsmL test tool, a new component ofthe AsmL tool environment, is used to generate finitestate machines from use-case models which can be usedfor validation purposes or for testing.
Unscheduling, Unpredication, Unspeculation: Reverse Engineering Itanium Executables
Authors: Noah Snavely, Saumya Debray, Gregory Andrews
Venue: Proceedings of the 10th Working Conference on Reverse Engineering (2003)

EPIC (Explicitly Parallel Instruction Computing) architectures,exemplified by the Intel Itanium, support a numberof advanced architectural features, such as explicitinstruction-level parallelism, instruction predication, andspeculative loads from memory. However, compiler optimizationsto take advantage of such architectural featurescan profoundly restructure the program's code, makingit potentially difficult to reconstruct the original programlogic from an optimized Itanium executable. This paperdescribes techniques to undo some of the effects of suchoptimizations and thereby improve the quality of reverse engineeringsuch executables.
Exploiting bank locality in multi-bank memories
Authors: G. Chen, M. Kandemir, H. Saputra, M. J. Irwin
Venue: Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems (2003)

Bank locality can be defined as localizing the number of load/store accesses to a small set of memory banks at a given time. An optimizing compiler can modify a given input code to improve its bank locality. There are several practical advantages of enhancing bank locality, the most important of which is reduced memory energy consumption. Recent trends indicate that energy consumption is fast becoming a first-order design parameter as processor-based systems continue to become more complex and multi-functional. Off-chip memory energy consumption in particular can be a limiting factor in many embedded system designs. This paper presents a novel compiler-based strategy for maximizing the benefits of low-power operating modes available in some recent DRAM-based multi-bank memory systems. In this strategy, the compiler uses linear algebra to represent and optimize bank locality in a mathematical framework. We discuss that exploiting bank locality can be cast as loop (iteration space) and array layout (data space) transformations. We also present experimental data showing the effectiveness of our optimization strategy. Our results show that exploiting bank locality can result in large energy savings.
Design of radio frequency coils for magnetic resonance imaging applications: a computational electromagnetic approach
Authors: Robert Lee
Venue:  (2003)

The advancement of MRI as a radiological instrument has been associated with a constant drive towards higher magnetic field strengths resulting in higher operational frequencies. More powerful magnets bring the promise of enhanced signal to noise ratio, exquisite resolution, and reduced scan times. At the same time however, MRI at higher frequencies adds significant engineering complexities to the MRI experiment, most notably in designing safe, versatile, and high-performance radio frequency (RF) Coils. In this work, computational and theoretical electromagnetic analysis of several RF coils used in MRI are presented at Larmor frequencies that range between 64 and 470 MHz representing clinical imaging at 1.5:11 Tesla. The electromagnetic interactions with phantoms and anatomically detailed head models, including a developed high-resolution human head mesh, are studied at different field strengths. The computational tool of choice here was the finite difference time domain (FDTD) method. Combined with measurements using an 8 Tesla MRI system, currently the most powerful clinical magnet in the world and a 1.5 Tesla system, the FDTD method is utilized to study, analyze, and eventually design RF coils. Innovative Engineering approaches using phased array techniques are presented to improve the performance of RF head coils in terms of transverse magnetic field uniformity and reduction of specific absorption rate for operation at 4.7 and 8 Tesla. Novel analytical derivations are presented to explain the source of the MR signal. The combination of the analytical derivations, FDTD modeling, experiments, and infrared imaging gives a new prospective onto the electromagnetics associated with low and high field clinical imaging.
On M-strong fuzzy graphs
Authors: Kiran R. Bhutani, Abdella Battou
Venue: Information Sciences: an International Journal (2003)

The cartesian product and disjoint sum of graphs play a prominent role and have numerous interesting algebraic properties. In this note, we consider operations on fuzzy graphs under which M-strong property is preserved. If G1 and G2 are M-strong fuzzy graphs then we prove that G1 × G2, G1 [G2] and G1 + G2 are also M-strong but G1 ∪ G2 need not be M-strong. If G1 × G2 is M-strong then we show that at least one factor must be M-strong. We show that the product of a M-strong fuzzy graph G1 with a non-M-strong fuzzy graph G2 remains M-strong if and only if G2 satisfies special condition. For any fuzzy graph G, Gcc is the smallest M-strong fuzzy graph that contains G and G = Gcc if and only if G is M-strong. We further show that M-strong fuzzy graph G is a fuzzy tree if and only if the support(G) is a tree.
Which matrices are immune against the transportation paradox?
Authors: Vladimir G. Deǐneko, Bettina Klinz, Gerhard J. Woeginger
Venue: Discrete Applied Mathematics (2003)

We characterize the m × n cost matrices of the transportation problem for which there exist supplies and demands such that the transportation paradox arises. Our characterization is fairly simple and can be verified within O(mn) computational steps. Moreover, we discuss the corresponding question for the algebraic transportation problem.