ppxscal/embedding_network huggingface dataset:
Telecommunications Network Management
Authors: Haojin Wang, Henry Haojin Wang
Venue:  (1999)

:"A very important book. "Travis Russell,Telecommunications Protocols. The coplexity of telecommunications networks is growing exponentially. this book is a systematic guide to standards,basic concepts,and current practices for telecom professionals. It includes: full TMN and OSI coverage; coverage of all major telecom management standards; scenario and example sections in each chapter; coverage of Local Number Portability issues. For the pro who wants a guide to all aspects of managing telecom networks.
Logic Simulation Engines in Japan
Authors: Shigeru Takasaki, Fumiyaki Hirose, Akihiko Yamada
Venue: IEEE Design Test (1989)

A description is given of HAL II and SP, ultra-high-speed logic simulation engines for use in verifying large computer logic designs. Both use parallel processor architecture with a maximum configuration of 64 processors. The resulting simulation speed is a thousand times faster than that of conventional software logic simulators run on a mainframe. HAL II and SP, which can simulate a system with several million gates, have been used successfully in the design of large digital systems for logic simulation.
Reconstruction of Planar Surfaces Behind Occlusions in Range Images
Authors: F. Dell'Acqua, R. Fisher
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

Analysis and reconstruction of range images usually focuses on complex objects completely contained in the field of view; little attention has been devoted so far to the reconstruction of simply shaped wide areas like parts of a wall hidden behind furniture pieces in an indoor range image. The work presented in this paper is aimed at such reconstruction. First of all, the range image is partitioned based on depth discontinuities and fold edges. Next, the planes best fitting each of the regions constituting the partition of the image are determined. A third step locates potentially contiguous surfaces, while a final step reconstructs the hidden regions. This paper presents results for reconstruction of the shape of planar surfaces behind arbitrary occluding surfaces. The system proved to be effective and the reconstructed surfaces appear to be reasonable. Some examples of results are presented from the Bornholm church range images.
Design of Cache Test Hardware on the HP PA8500
Authors: Jeff Brauch, Jay Fleischman
Venue: IEEE Design Test (1998)

The PA7300 was the first PA-RISC microprocessor to incorporate an on-chip cache. To test its 128-Kbyte memory, test hardware was included consisting of an input register, an output MISR, an LFSR address source, and a state machine. The state machine was capable of executing a predefined march test with a fixed address sequence and programmable data pattern. The successes achieved on the PA7300 using this strategy, combined with some of its shortcomings, have lead to the development of a memory test subsystem on Hewlett Packard's next microprocessor, the PA8500.This article describes the memory test hardware on the PA8500, beginning with the requirements that motivated the design. An explanation of the cache architecture is given, and followed by a description of the blocks that make up the memory test subsystem. The final section presents an example that shows how the subsystem can be used to test the memory.
The Quadrics Network: High-Performance Clustering Technology
Authors: Fabrizio Petrini, Wu-chun Feng, Adolfy Hoisie, Salvador Coll, Eitan Frachtenberg
Venue: IEEE Micro (2002)

The Quadrics network extends the native operating system in processing nodes with a network operating system and specialized hardware support in the network interface. Doing so integrates individual node's address spaces into a single, global, virtual-address space and provides network fault tolerance.
Achieving IDDQ/ISSQ Production Testing with QuiC-Mon
Authors: Kenneth M. Wallquist
Venue: IEEE Design Test (1995)

IDDQ testing has become a powerful tool for improving the quality of CMOS integrated circuits. One drawback of this testing is its speed--often compromising speed for accuracy, or vice versa. Given that a well-designed part will have a very low quiescent current, accuracy cannot be sacrificed; given that test time is perhaps the most expensive part of an IC's final cost, speed cannot be sacrificed. This article describes QuiC-Mon, a loadboard mounted circuit which is capable of offering both speed and accuracy--over 1-MHz measurement rates at sub-mA accuracy.
Intentionally and unintentionally: on both, A and non-A, in neutrosophy
Authors: Feng Liu, Florentin Smarandache
Venue: Octogon Mathematical Magazine (2002)

The paper presents a fresh new start on the neutrality of neutrosophy in that "both A and Non-A" as an alternative to describe Neuter-A in that we conceptualize things in both intentional and unintentional background. This unity of opposites constitutes both objective world and subjective world. The whole induction of such argument is based on the intensive study on Buddhism and Daoism including I-ching. In addition, a framework of contradiction oriented learning philosophy inspired from the Later Trigrams of King Wen in I-Ching is meanwhile presented. It is shown that although A and Non-A are logically inconsistent, but they are philosophically consistent in the sense that Non-A can be the unintenionally instead of negation that leads to confusion. It is also shown that Buddhism and Daoism play an important role in neutrosophy, and should be extended in the way of neutrosophy to all sciences according to the original intention of neutrosophy.
Hypergraphical Codes Arising from Binary Trades
Authors: G. B. Khosrovshahi, Reza Naserasr
Venue: Designs, Codes and Cryptography (1999)

By considering the null space of incidence matrices of trivial designs over GF(2) (the space of 1- (v,k) trades overGF(2) ) we obtain families of codes which are optimal for some v and k. Moreover, by generalizing the concept of bond space, the weight enumerator polynomials for these codes are obtained.
A meta-authoring tool for specifying interactions in virtual reality environments
Authors: Zayd Hendricks, Gary Marsden, Edwin Blake
Venue: Proceedings of the 2nd international conference on Computer graphics, virtual Reality, visualisation and interaction in Africa (2003)

When creating virtual reality environments a large amount of the interaction needs to be programmed. The problem with this is that non-computer expert users lack the programming skills necessary to create useful applications. Specifying interactions remains in the domain of the programmer. Creating a single, generic authoring tool for every different kind of application would be an impossible task -- more so if the authors are non-programmers. A more realistic solution to the problem would be to think of every environment as having a particular context such as a virtual museum or gallery. Creating authoring tools specific to these types of environment contexts greatly reduces the problem. We have produced a progressive meta-authoring system that allows both novice and advanced users to create useful virtual reality applications, allowing the smooth migration of novice users to becoming more experienced. We believe that our system overcomes problems in architecture and support for novice users found in previous systems.
Designing a Custom DSP Circuit Using VHDL
Authors: Krishna A. Kumar, Brian Petrasko
Venue: IEEE Micro (1990)

The application of VHDL (VHSIC hardware description language) in the design and development of a custom DSP (digital signal processing) complex-to-magnitude circuit is described. The circuit produces the magnitude of a complex number using an approximation algorithm. The target implementation is a bit-serial architecture using a set of primitive operators for DSP design. The algorithm and architecture are investigated at the word level using the real-number type, and the results are applied to the bit level. It is found that VDHL provides strong support and clear documentation for each level of abstraction.
Uniform Approach for Solving some Classical Problems on a Linear Array
Authors: D. R. O'Hallaron
Venue: IEEE Transactions on Parallel and Distributed Systems (1991)

It is shown that a number of classical problems from linear algebra and graph theory,including instances of the algebraic path problem, matrix multiplication, matrix triangularization, and matrix transpose, can be solved using the same basic recurrence. Asimple mapping of the recurrence onto a unidirectional linear array is discussed. Qualitative advantages to programming linear arrays using this approach include uniformity of design, simplicity of programming, and scalability to larger problems. The major disadvantage is that the resulting algorithms are not necessarily optimal.
Axioms for Recursion in Call-by-Value
Authors: Masahito Hasegawa, Yoshihiko Kakutani
Venue: Higher-Order and Symbolic Computation (2002)

We propose an axiomatization of fixpoint operators in typed call-by-value programming languages, and give its justifications in two ways. First, it is shown to be sound and complete for the notion of uniform T-fixpoint operators of Simpson and Plotkin. Second, the axioms precisely account for Filinski's fixpoint operator derived from an iterator (infinite loop constructor) in the presence of first-class continuations, provided that we define the uniformity principle on such an iterator via a notion of effect-freeness (centrality). We then explain how these two results are related in terms of the underlying categorical structures.
Correct Program Slicing of Database Operations
Authors: Hee Beng Kuan Tan, Tok Wang Ling
Venue: IEEE Software (1998)

Program slicing often used in software maintenance, program version integration, and reverse engineering helps isolate program components during debugging and analysis. Often, however, traditional methods struggle to correctly slice programs that involve database operations they may not, for example, be able to compute a slice that contains only those program statements suspected of affecting I/O. The authors propose a method that overcomes such limitations.
Case Study: Digital's Application Generator
Authors: Ernesto Guerrieri
Venue: IEEE Software (1994)

One approach to software reuse is to generate an application from a domain specific specification. The specification describes the application's problem or task, and it might take diverse forms, such as an interactive dialogue or a formal language. DECAdmire, an application generator provided by Digital Equipment, is an interactive application development tool that provides code generation for interactive management information-systems that involve relational database updates. DECAdmire provides 80 to 95 percent code reuse.
Parallelizing a GIS on a Shared Address Space Architecture
Authors: Shashi Shekhar, Sivakumar Ravada, Vipin Kumar, Douglas Chubb, Greg Turner
Venue: Computer (1996)

Visualization applications--like flight simulators and virtual reality environments--use geographic information systems to represent actual terrain. Applications like these impose stringent restrictions on acceptable performance and response time. Sequential methods do not meet these requirements, but parallel methods can. The authors are developing a high-performance GIS on an SGI Challenge, a 16-processor machine with a shared address space architecture. They describe how they parallelized a key GIS operation using a message-passing algorithm. As part of the GIS project, the authors evaluated the effect of parallelizing an important GIS operation: range query. They parallelized range query using data partitioning (to reduce synchronization) and dynamic load balancing (to improve speedup). They found these approaches do achieve the performance required for many GIS applications. The approach described here links two diverse approaches to the design of parallel architectures and algorithms. Parallel architectures have emphasized either shared address space or message passing; algorithms either the PRAM or message-passing models. The authors advocate a different link between the architecture and algorithms--their range query operation uses a message-passing algorithm, yet is appropriate for a SASA architecture.
A Mixed-Signal Design Roadmap
Authors: Ralf Brederlow, Werner Weber, Joseph Sauerer, Stéphane Donnay, Piet Wambacq, Maarten Vertregt
Venue: IEEE Design Test (2001)

This roadmap for the 2001 International Technology Roadmap for Semiconductors uses performance figures of merit (FoMs) derived from basic circuits critical to mixed-signal design performance. Extrapolations from the FoMs to future performance values establish the device parameters necessary for design progress.
Hypercube Communication Delay with Wormhole Routing
Authors: Jong Kim, C. R. Das
Venue: IEEE Transactions on Computers (1994)

We present an analytical model for the performance evaluation of hypercube computers. This analysis is aimed at modeling a deadlock-free wormhole routing scheme prevalent on second generation hypercube systems. Probability of blocking and average message delay are the two performance measures discussed. We start with the communication traffic to find the probability of blocking. The traffic analysis can capture any message destination distribution. Next, we find the average message delay that consists of two parts. The first part is the actual message transfer delay between any source and destination nodes. The second part of the delay is due to blocking caused by the wormhole routing scheme. The analysis is also extended to virtual cut-through routing and random wormhole routing techniques. The validity of the model is demonstrated by comparing analytical results with those from simulation.
Polynomial-Time Decomposition Algorithms for Support Vector Machines
Authors: Don Hush, Clint Scovel
Venue: Machine Learning (2003)

This paper studies the convergence properties of a general class of decomposition algorithms for support vector machines (SVMs). We provide a model algorithm for decomposition, and prove necessary and sufficient conditions for stepwise improvement of this algorithm. We introduce a simple &ldquo;rate certifying&rdquo; condition and prove a polynomial-time bound on the rate of convergence of the model algorithm when it satisfies this condition. Although it is not clear that existing SVM algorithms satisfy this condition, we provide a version of the model algorithm that does. For this algorithm we show that when the slack multiplier C satisfies \sqrt{1/2} &le; C &le; mL, where m is the number of samples and L is a matrix norm, then it takes no more than 4LC2m4/&epsi; iterations to drive the criterion to within &epsi; of its optimum.
A Large-Scale Complex Virtual Environment for Team Training
Authors: Thomas W. Mastaglio, Robert Callahan
Venue: Computer (1995)

Virtual environments that allow multiple participants to cooperatively interact present complex design problems. A joint Loral-US Army project, the Close Combat Tactical Trainer (CCTT) described in this article will, when completed, train ground combat tank and mechanized infantry forces on simulated equipment using a high-fidelity representation of actual terrain. With over 50 different human-computer interfaces and ultimately consisting of over half a million lines of Ada program code, together with extensive distribution requirements, CCTT is the most complex virtual environment attempted to date. To solve some of the design problems, CCTT relies successfully on concurrent engineering, spiral development, and usability engineering. The CCTT system consists of networked simulators and workstations based on a Fiber Distributed Data Interface (FDDI) LAN with up to 100 IBM RS/6000 processors attached. Each manned module has a single RS/6000 processor to perform vehicle computations, transmit updated vehicle information to the FDDI network, and accept information about other simulated entities from the FDDI network. An Evans and Sutherland Image Generator 3000 generates the visual scene for each module. Software elements start with the network layer, proceed up through the service layer, and end at the application level. Each layer is based on data-driven, object- oriented program code that meets real-time performance requirements. The authors describe the CCTT architecture, their development approach, and lessons learned. For example, they explain that applying concurrent engineering is a significant effort and may actually increase the time needed to organize and train teams and accustom engineers to the collaborative process. They also briefly discuss costs and testing trends for contracted system developments.
ADOME: An Advanced Object Modeling Environment
Authors: Qing Li, Frederick H. Lochovsky
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

ADOME, which stands for ADvanced Object Modeling Environment, is an approach to integrating data and knowledge management based on object-oriented technology. Next generation information systems will require more flexible data modeling capabilities than those provided by current object-oriented DBMSs. In particular, integration of data and knowledge management capabilities will become increasingly important. In this context, ADOME provides versatile role facilities that serve as "dynamic binders" between data objects and production rules, thereby facilitating flexible data and knowledge management integration. A prototype that implements this mechanism and the associated operators has been constructed on top of a commercial object-oriented DBMS and a rule-base system.
Fault-Tolerant Meshes and Hypercubes with Minimal Numbers of Spares
Authors: J. Bruck, R. Cypher, C. Ho
Venue: IEEE Transactions on Computers (1993)

This paper presents several techniques for tolerating faults in d-dimensional mesh and hypercube architectures. The approach consists of adding spare processors and communication links so that the resulting architecture will contain a fault-free mesh or hypercube in the presence of faults. The authors optimize the cost of the fault-tolerant architecture by adding exactly k spare processors (while tolerating up to k processor and/or link faults) and minimizing the maximum number of links per processor. For example, when the desired architecture is a d-dimensional mesh and k=1, they present a fault-tolerant architecture that has the same maximum degree as the desired architecture (namely, 2d) and has only one spare processor. They also present efficient layouts for fault-tolerant two- and three-dimensional meshes, and show how multiplexers and buses can be used to reduce the degree of fault-tolerant architectures. Finally, they give constructions for fault-tolerant tori, eight-connected meshes, and hexagonal meshes.
Using Formal Methods to Develop an ATC Information System
Authors: Anthony Hall
Venue: IEEE Software (1996)

Can formal methods be a part of large-system development? The project teams at Praxis used a combination of formal methods to help specify, design, and verify CDIS, a large information-display system within an ATC-support system. Their project suggests that it can be practicable and beneficial.
Organization Self-Design of Distributed Production Systems
Authors: T. Ishida, L. Gasser, M. Yokoo
Venue: IEEE Transactions on Knowledge and Data Engineering (1992)

The authors introduce two reorganization primitives, composition and decomposition, which change the population of agents and the distribution of knowledge in an organization. To create these primitives, they formalize organizational knowledge, which represents knowledge of potential and necessary interactions among agents in an organization. The authors develop computational organizational self-design (OSD) techniques for agents with architectures based on production systems to take advantage of the well-understood body of theory and practice. They first extend parallel production systems, where global control exists, into distributed production systems, where problems are solved by a society of agents using distributed control. Then they introduce OSD into distributed production systems to provide adaptive work allocation. Simulation results demonstrate the effectiveness of the approach in adapting to changing environmental demands. The approach affects production system design and improves the ability of build production systems that can adapt to changing real-time constraints.
Will Carnivore Devour Online Privacy?
Authors: David L. Sobel
Venue: Computer (2001)

The FBI's controversial Internet eavesdropping tool has the potential to violate innocent users' online privacy.
A parallel Gauss-Seidel algorithm for sparse power system matrices
Authors: D. P. Koester, S. Ranka, G. C. Fox
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

We describe the implementation and performance of an efficient parallel Gauss-Seidel algorithm that has been developed for irregular, sparse matrices from electrical power systems applications. Although, Gauss-Seidel algorithms are inherently sequential, by performing specialized orderings on sparse matrices, it is possible to eliminate much of the data dependencies caused by precedence in the calculations. A two-part matrix ordering technique has been developed -- first to partition the matrix into block-diagonal-bordered form using diakoptic techniques and then to multi-color the data in the last diagonal block using graph coloring techniques. The ordered matrices often have extensive parallelism, while maintaining the strict precedence relationships in the Gauss-Seidel algorithm. We present timing results for a parallel Gauss-Seidel solver implemented on the Thinking Machines CM-5 distributed memory multi-processor. The algorithm presented here requires active message remote procedure calls in order to minimize communications overhead and obtain good relative speedup.
Intelligent control of aircraft dynamic systems with a new hybrid neuro-fuzzy-fractal approach
Authors: Patricia Melin, Oscar Castillo
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2002)

We describe in this paper a hybrid method for adaptive model-based control of non-linear dynamic systems using Neural Networks, Fuzzy Logic and Fractal Theory. The new neuro-fuzzy fractal method combines Soft Computing (SC) techniques with the concept of the fractal dimension for the domain of Non-Linear Dynamic System Control. The new method for adaptive model-based control has been implemented as a computer program to show that our neuro-fuzzy-fractal approach is a good alternative for controlling non-linear dynamic systems. We illustrate in this paper our new methodology with the case of controlling aircraft dynamic systems. For this case, we use mathematical models for the simulation of aircraft dynamics during flight. The goal of constructing these models is to capture the dynamics of the aircraft, so as to have a way of controlling this dynamics to avoid dangerous behavior of the aircraft dynamic system.