ppxscal/embedding_network huggingface dataset:
Optimization of a WDM optical packet switch with wavelength converters
Authors: Kuo-Chun Lee, V. O. K. Li
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

This paper investigates a wavelength-division-multiplexed optical packet switch with wavelength converters which can shift optical packets to any wavelength of their destined outbound links. Wavelength conversion can reduce packet dropping probability due to wavelength contentions. However, not all the packets need conversion, and hence conversion should be optimized to reduce the number of converters and improve the quality of signals by reducing unnecessary conversion. We derive the maximum number of conversions in a packet switch with l inbound/outbound links and w wavelengths per link and develop a switch control algorithm to minimize the number of wavelength conversions while maintaining the same minimum number of dropped packets. Simulation results show that the packet dropping probability decreases significantly with wavelength conversion and that fewer converters than the maximum number of conversions are needed.
Using Software Agents to avoid Collisions among Multiple Robots
Authors: Markus Jäger
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

This paper describes a method where collaborative software agents are used to coordinate the independently planned trajectories of multiple mobile robots to avoid collisions and deadlocks among them.Whenever the distance between two robots drops below a certain value, the agents exchange information about the planned trajectories of the robots and determine whether they are in danger of a collision. If a possible collision is detected, the agents monitor the robots movements and, if necessary, insert idle times between certain segments of the trajectories in order to avoid the collision.Deadlocks among two or more robots occur if a number of robots block each other in a way such that none of them is able to continue along its trajectory without causing a collision. These deadlocks are reliably detected by the agents. After a deadlock is detected, alternative trajectories for each of the involved robots are successively planned until the deadlock is resolved.The agents use a combination of three fully distributed algorithms to reliably solve the task. They do not use any global synchronization.
A Neumann-Neumann Domain Decomposition Algorithm for Solving Plate and Shell Problems
Authors: Patrick Le Tallec, Jan Mandel, Marina Vidrascu
Venue:  (1995)

Abstract: We present a new Neumann-Neumann type preconditioner of large scale linear systems arising from plate and shell problems. The advantage of the new method is a smaller coarse space than earlier method od the authors, which improves parallel scalability. A new abstract framework for Neumann-Neumann preconditioners is used to prove optimal convergence properties of the method. The convergence estimates are independent of the number of subdomains, coefficient jumps between subdomains, and depend only polyogarithmacally on the nember of the elements per subdomain. We formulate and prove an approximate parametric variationa; principle for Reissner-Mindlin elements as the plate thickness approaches zero, which makes the results applicable to a large class of non-locking elements in everyday engineering use. The theoretical results are confirmed
Modeling Multi-Player Games Traffic
Authors: Ricky A. Bangun, E. Dutkiewicz
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

The growing popularity of delay-sensitive multi-player games over the Internet is creating a need for proper Characterization of such traffic. We are currently developing source models for game traffic, on a per-player basis, with the intended use being to scale the models to simulate scenarios involving large numbers of players, which will enable us to observe the effects of game traffic on the network. In this paper, we outline the procedure that we use, and we show that cases, relatively simple source models are able to provide sufficiently accurate results (in terms of mean delay and mean buffer occupancy).
Dot.Bomb: My Days and Nights at an Internet Goliath, Vol. 8
Authors: J. David Kuo
Venue:  (2003)

:J. David Kuo had a ringside seat at one of the biggest busts of the Internet age. Value America (NASDAQ:VUSA) was supposed to revolutionize retailing by using the Internet-no more retailers or distributors needed. Fred Smith, legendary founder of Federal Express, called it the best business model he'd ever seen and invested millions of dollars. In a few short years, the company raised and spent hundreds of millions of dollars before a spectacular crash.
The p-Competition Graphs of Symmetric Digraphs and $p$-Neighborhood Graphs
Authors: J. R Lundgren, Patricia A. McKenna, Sarah K. Merz, Craig W. Rasmussen
Venue:  (1995)

The p-competition graph G of a digraph D is a graph on the same vertex set as D, with [x,y] E(G) if and only if |Out(x) \cap Out(y)| <= p in D. In this paper we focus on the case in which D is a symmetric digraph ((a,b) is an arc in D if and only if (b,a) is an arc in D). We relate the problem to 2-step graphs, squares, and a generalization of the neighborhood graph called the p-neighborhood graph. We also identify some familiar classes of graphs as 2-competition graphs of loopless symmetric digraphs.
Evolving Ispell: A Case Study of Program Understanding for Reuse
Authors: Lerina Aversano, Gerardo Canfora, Andrea De Lucia, Silvio Stefanucci
Venue: Proceedings of the 10th International Workshop on Program Comprehension (2002)

Text processing has proven helpful in a number of software engineering tasks. We discuss how a morphological analyzer for the Italian language, and the associated linguistic resources, have been developed by reusing and evolving an existing system, ispell [16], which is an open source spell-checker. The need for developing such an analyzer derives from the need for improving the traceability link recovery process described in [2, 3]. The paper shows how the program understanding exercise was useful to develop a system in a specialized application domain in which we had a very limited background knowledge.
Performance Evaluation of Networks of Workstations with Hardware Shared Memory Model Using Execution-Driven Simulation
Authors: J. Flich, M. P. Malumbres, P. López, J. Duato
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

Networks of workstations (NOWs) are becoming increasingly popular as a cost-effective alternative to parallel computers. Typically, these networks connect processors using irregular topologies, providing the wiring flexibility, scalability, and incremental expansion capability required in this environment. Similar to the evolution of parallel computers, NOWs are also evolving from distributed memory to shared memory programming model. However, physical distances between processors are longer in NOWs than in tightly-coupled distributed shared-memory multiprocessors (DSMs), leading to higher message latency and lower network bandwidth. Therefore, the network may be a bottleneck when executing some parallel applications in a NOW supporting a shared-memory programming paradigm.In this paper we analyze whether the interconnection network is able to efficiently handle the traffic generated in a NOW with the shared memory model. In particular, we are interested in analyzing the influence of the routing mechanism in the performance of the system. We evaluate the behavior of a NOW with irregular topology by means of an execution-driven simulator using SPLASH-2 applications as the input load. The results show that the routing algorithm can considerably reduce the total execution time of applications. In particular, routing adaptivity can reduce the total execution time by 58 \% in some applications. These results confirm the behavior observed in previous works using synthetic traffic loads.
Face recognition using independent component analysis and support vector machines
Authors: O. Déniz, M. Castrillón, M. Hernández
Venue: Pattern Recognition Letters (2003)

Support vector machines (SVM) and independent component analysis (ICA) are two powerful and relatively recent techniques. SVMs are classifiers which have demonstrated high generalization capabilities in many different tasks, including the object recognition problem. ICA is a feature extraction technique which can be considered a generalization of principal component analysis (PCA). ICA has been mainly used on the problem of blind signal separation. In this paper we combine these two techniques for the face recognition problem. Experiments were made on two different face databases, achieving very high recognition rates. As the results using the combination PCA/SVM were not very far from those obtained with ICA/SVM, our experiments suggest that SVMs are relatively insensitive to the representation space. Thus as the training time for ICA is much larger than that of PCA, this result indicates that the best practical combination is PCA with SVM.
The Hash History Approach for Reconciling Mutual Inconsistency
Authors: Brent ByungHoon Kang, Robert Wilensky, John Kubiatowicz
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

We introduce the hash history mechanism for capturingdependencies among distributed replicas. Hash histories,consisting of a directed graph of version hashes, are independentof the number of active nodes but dependent onthe rate and number of modifications. We present the basichash history scheme and discuss mechanisms for trimmingthe history over time. We simulate the efficacy of hash historieson several large CVS traces. Our results highlighta useful property of the hash history: the ability to recognizewhen two different non-commutative operations producethe same output, thereby reducing false conflicts andincreasing the rate of convergence. We call these events coincidentalequalities and demonstrate that their recognitioncan greatly reduce the time to global convergence.
Dynamic Module Replacement in Distributed Protocols
Authors: Nigamanth Sridhar, Scott M. Pike, Bruce W. Weide
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Dynamic module replacement - the ability to hot swapa component's implementation at runtime - is fundamentalto supporting evolutionary change in long-lived and highly-availablesystems. Most existing solutions require special-purposemiddleware or depend on research languages withlimited support for mainstream software development. Wepresent a language-neutral technique for dynamic modulereplacement using Service Facilities (Serfs) - a pattern-baseddesign strategy for decoupling runtime dependencies.We demonstrate the sufficiency of Serfs with respect to a litmustest of criteria for module replacement. Next, we extendthe traditional scope of module replacement to encompassthe domain of modules for distributed protocols. Weconclude by applying the Serf strategy to illustrate dynamicreplacement of mutual exclusion protocols in modules fordistributed resource allocation.
Pattern Matching in High Energy Physics by Using Neural Network and Genetic Algorithm
Authors: Marcello Castellano, Giuseppe Mastronardi, Vitoantonio Bevilacqua, E. Nappi
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

In this paper, two different approaches to provide information from events by high-energy physics experiments are shown. Usually the representations produced in such experiments are spot-composed and the classical algorithms to be needed for data analysis are time consuming. For this reason the possibility to speed up pattern recognition tasks by soft computing approach with parallel algorithms has been investigated. The first scheme shown in the following is a two layer neural network with forward connections; the second one consists of an evolutionary algorithm with elitistic strategy and mutation and crossover adaptive probability. Test results of these approaches have been carried out analyzing a set of images produced by an optical Ring imaging Cherenkov (RICH) detector at CERN.
Factors Affecting False Sharing on Page-Granularity Cache-Coherent Shared-Memory Multiprocessors
Authors: Vik Khera
Venue:  (1994)

Efficiently supporting a shared memory paradigm in a large-scale multiprocessor generally involves some form of data caching. One of the drawbacks of caching shared data is the cost of keeping the multiple copies coherent. One source of unnecessary coherency overhead is caused by a problem known as {\em false sharing\/}. Unfortunately, the lack of a precise, universally accepted, definition of false sharing hinders research to detect and eliminate the problem. We articulate our intuitive notion of false sharing and address the problems encountered in previous attempts at defining false sharing. We motivate the importance of a concrete measure by demonstrating that false sharing related coherence overhead comprises a significant portion of the coherence costs in real applications, especially when page-granularity coherence is required. An architecture-independent measure of the false sharing exhibited in a reference trace for cache lines of a specified size is proposed and evaluated experimentally. The proposed measure attempts to summarize the false sharing impact by approximating some factors and discarding others. The evaluation of this formulation reveals that such summary statistics lose too much information to be of practical use in predicting performance. We use this work to motivate experiments to determine the relative importance of the various workload and architectural factors that affect coherence data traffic. The conclusion from these experiments is that the precise memory reference interleaving order is the most significant factor affecting false sharing coherence data traffic. Our methodology is to use an execution-driven simulation of specific architectures and applications to generate memory reference traces. The traces are then analyzed off-line.
Routing in Networks
Authors: Allan B. Borodin, John E. Hopcroft
Venue:  (1981)

NO SUPPLIED
Partial Clones and their Generating Sets
Authors: Lucien Haddad, Dietlinde Lau
Venue: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic (1999)

We present some of our recent results on partial clones. Let A be a non singleton finite set. For every maximal clone C on A, we find the maximal partial clone on A that contains C. We also construct families of finitely generated maximal partial clones as well as a family of not finitely generated maximal partial clones on A. Furthermore, we study the pairwise intersections of all maximal partial clones of Slupecki type on A.
No One Will Hire Me!: Avoid 15 Mistakes and Win the Job
Authors: Ron L. Krannich, Caryl Krannich
Venue:  (2002)

:The perfect job search guide for everyone, from ex-offenders and transitioning military personnel to students, job changers, and displaced executives.
Low Power Test Set Embedding Based on Phase Shifters
Authors: Maciej Bellos, Dimitri Kagaris, Dimitris Nikolos
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

A new efficient method for test set embedding based onphase shifters was recently proposed. This method suffersfrom high average and peak power consumption. In thiswork we propose a new phase shifter-based test setembedding method, which, by using interleaving and twoLFSRs that change state in a non-overlapping way,significantly reduces the average and peak powerconsumption.
Faster subtree isomorphism
Authors: R. Shamir, D. Tsur
Venue: Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97) (1997)

We study the subtree isomorphism problem: Given trees H and G, find a subtree of G which is isomorphic to H or decide that there is no such subtree. We give an O(~k/sup 1.8//log k\ n) time algorithm for this problem, where k and n are the number of vertices in H and G respectively. This improves over the O(k/sup 1.5/n) algorithms of Chung (1987) and Matula (1978). We also give a randomized (Las Vegas) O(min(k/sup 1.45/n, kn/sup 1.43/))-time algorithm for the decision problem.
An Efficient Quorum-Based Scheme for Managing Replicated Data in Distributed Systems
Authors: Ching-Min Lin, Ge-Ming Chiu, Cheng-Hong Cho
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

A new quorum-based replica control scheme for managing replicated data in distributed systems is proposed. We first introduce a concept called relaxed difference pair to establish the basics for cyclic read-write coteries. A simple and efficient model is then presented to facilitate the construction of read-write coteries. The read-write coteries generated by the model are symmetric. The proposed scheme can be applied to arbitrary number of data copies. More importantly, by introducing a parameter in the construction model, our scheme provides the exibility of adjusting the sizes of read and write quorums. Such exibility allows one to construct a read-write coterie that best suits the environment of the target system.
A Paradigm for Reliable Clock Synchronization
Authors: Fred B. Schneider
Venue:  (1986)

Existing fault-tolerant clock synchronization protocols are shown to result from refining a single clock synchronization paradigm. In that paradigm, a reliable time source periodically issues messages that cause processors to resynchronize their clocks. The reliable time source is approximated by reading all clocks in the system and using a convergence function to compute a fault-tolerant average of the values read. The performance of a clock synchronization algorithm based on the paradigm can be quantified in terms of the two parameters that characterize the behavior of the convergence function used: accuracy and precision.
Homogenization of transient heat transfer problems for some composite materials
Authors: M. Kamiński, M. Pawlik
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The article presented is devoted to the homogenization of transient heat transfer problems in some composite materials. Mathematical model is based on the effective modules method introduced for periodic composites - effective heat conductivity is calculated in the closed form, while effective volumetric is obtained from a simple spatial averaging. Such a homogenization scheme makes possible to significantly simplify the numerical analysis of transient heat phenomena in various types of composites - laminates, fiber and particle-reinforced structures. The comparison of transient heat transfer problem for these composites in real and homogenized configurations is carried out using the Finite Element Method commercial system ANSYS. As it is demonstrated for various boundary problems and their results, homogenization techniques give satisfactory agreement with the real structure modeling. Further numerical studies on composite cells discretization should increase modeling efficiency and diminish the numerical errors.
Mastering XSLT, 1 edition
Authors: Chuck White, Chelsea Valentine
Venue:  (2002)

:XSLT's capabilities and uses are so extensive that many books get bogged down in the complex W3C specification and provide little in the way of practical, real-world instruction. Mastering XSLT is a different kind of book. Here you'll find quick, efficient introductions to the key concepts, written for people who know their XML, and then detailed instructions that will help you meet your immediate document-transformation challenges and move on to new ones. It's the most effective way to get what you need out of XSLT, whether your application is simple or complex, conventional or ground-breaking.
Analysis of non-linear soft thin interfaces
Authors: F. Lebon, R. Rizzoni, S. Ronel-Idrissi, C. Licht
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper shows how to model thin layers and interfaces by asymptotic techniques. Some behaviors are treated: visco-elasticity (Maxwell, Kelvin-Voigt, Norton), Mohr-Coulomb non-associated elasto-plasticity, non-monotone relationship in the strain-stress diagram and contact conditions between the adhesive and the adherents. Numerical validations and algorithms are proposed and presented.
Design and Measurement of an Inductance-Oscillator for Analyzing Inductance Impact on On-Chip Interconnect Delay
Authors: Takashi Sato, Hiroo Masuda
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

A newly devised inductance-oscillator (iOSC) has beendeveloped which evaluates inductance impact on on-chip interconnectdelay. iOSC is a ring oscillator which is comprised of a set of wireseach with different loop inductance and accurate on-chip counter.The equivalent distance to the nearest ground grid, which serves asthe current return path, is varied to control wire inductance.A test chip using 0.13-µm node process is fabricated to demonstratethe concept of the iOSC. Four interconnect structures are implementedas imperfect coplanar waveguide, imitating clock lines orhigh-frequency inter-module signal lines. The structure with largestinductance variation measured 99 ps while a twisted ground structurewhich has small inductance variation measured 6 ps both for 3-mmwires. The experiments confirm that the inductance impact on delayhas to be adequately analyzed and controlled to estimate a timingbudget in high-speed LSI designs.
Towards an Algebra of Architectural Connectors: a Case Study on Synchronization for Mobility
Authors: Michel Wermelinger, Jose Luiz Fiadeiro
Venue: Proceedings of the 9th international workshop on Software specification and design (1998)

To cope with the flexibility and extensibility needed for the specification of the architecture of evolving software systems, it is useful to have a set of primitive connectors from which new ones can be created in a systematic way as needs arise and to connect components only when they are required to interact. This could be achieved with a connector algebra whose constants are given primitive connectors and whose operations allow the (transient) creation of new connectors. This paper is a step towards that goal. We put forward an application-independent connector for partial action synchronization and three generic operations. Applied to the basic connector, they provide application-specific connectors for inhibition and full synchronization of actions. Moreover, we associate to each connector a condition stating when it should be applied to components.
An Interface as a Design Object
Authors: Hermann Kopetz, Emmerich Fuchs, Dietmar Millinger, Roman Nossal
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

In the design process of distributed real-time systems a way must be found to cope with the complexity inherent to these systems. An established technique for this purpose is the decomposition of the system into smaller subsystems with well-defined, stable interfaces among them.In this paper we propose a design method for the development of distributed real-time systems that are intended for safety critical applications. The method is devised for the Time-Triggered Architecture, which constitutes such a real-time system. For the purpose of decomposition we introduce a special type of interface, the so-called temporal firewall. In the Time-Triggered Architecture there are three interfaces of this type, the Communication Network Interface, the Controlled Object Interface, and the Gateway Interface, which partition the real-time system into autonomous subsystems.The design method clearly separates system and subsystem issues and focuses on the definition of the three interfaces between the subsystems. The feasability and relevance of our design method is demonstrated by means of a small example from the automotive industry.