ppxscal/embedding_network huggingface dataset:
Wavelength Division Multiple Access Ring - Virtual Topology on a Simple Ring Network
Authors: Xiaoshe Dong, Tomohiro Kudoh, Hideharu Amano
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

In this paper, Wavelength Division Multiple access (WDM) ring is proposed for interconnection in workstation clusters or parallel machines. This network consists of ring connected routers each of which selectively passes signals addressed in some particular wavelengths. Other wavelengths are once converted to electric signals, and re-transmitted being addressed in different wavelengths. Wavelengths are assigned into divisors of the number of nodes in the system. Using the regular WDM ring with imaginary nodes, the diameter and average distance are reduced even if the number of nodes has few divisors. It provides better diameter and average distance than that of the uni-directional torus. Although the diameter and average distance is worse than that of ShuffleNet, the physical structure of the WDM ring is simple and the available number of nodes is flexible.
Enhancing Program Comprehension with Recovered State Models
Authors: Stéphane S. Somé, Timothy C. Lethbridge
Venue: Proceedings of the 10th International Workshop on Program Comprehension (2002)

State Transition Machines are high-level behavior descriptions often used as modeling tools for the design and implementation of a large class of software systems. Some of the state transition machine implementation approaches are such that the static structure of the resulting code closely matches that of the original state transition machines. Therefore, having a representation of the original state transition machines is likely to improve the correspondingcode understandability.In this paper, we present an approach supported by a prototype tool, to extract state transition machines by static analysis of source code. An objective of this work is to enhanceprogram comprehension with visual representations of the behavior of the programs being analyzed.
Genetic algorithms in a competitive environment with application to reliability optimal design
Authors: C. Dimou, V. Koumousis
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

Competition is introduced among the populations of a number of Genetic Algorithms (GAs). The aim is to calibrate the size of the populations of the GAs by altering the resources of the system i.e. the allocated computing time. The evolution of the different populations is controlled on the level of metapopulation, i.e. the union of populations, on the basis of statistics and trends of the evolution of every population. The method is applied to the reliability based optimal design of a simple truss. Numerical results are presented and the robustness of the proposed algorithm is discussed.
Solution of the least-squares problem for logistic function
Authors: D. Jukic´, R. Scitovski
Venue: Journal of Computational and Applied Mathematics (2003)

Given the data (pi, ti, fi), i= 1,...., m, m > 3, we consider the best least-squares approximation of parameters for the logistic function t ↦ f(t;α,β,γ)= α/(1 + eβ-γt), α, γ > 0, β ∈ R. We give necessary and sufficient conditions which guarantee the existence of such optimal parameters.
Non-linear vibrations of anisotropic cylindrical shells
Authors: M. H. Toorani, A. A. Lakis
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

A semi-analytical method is developed in conjunction with shearable shell theory and modal expansion approach to predict the influence of geometrical non-linearities on free vibrations of anisotropic laminated cylindrical shells. The shear deformation and rotary inertia effects are taken into account in the equations of motion. The hybrid method developed in this theory is a combination of classical finite element approach, shearable shell theory and modal coefficient procedure. The displacement functions are obtained by the exact solution of the equilibrium equations of anisotropic cylindrical shells and thereafter, the mass and linear stiffness matrices are derived by exact analytical integration. Green's exact strain-displacement relations are used to obtain the modal coefficients for these displacement functions. The second- and third-order non-linear stiffness matrices are then calculated by precise analytical integration and superimposed on the linear part of equations to establish the non-linear modal equations. The linear and non-linear natural frequency variations are determined as a function of shell parameters for different cases. The comparison shows that the numerical analysis is of good reliability on the prediction of the experimental results.
An assigned-buffer ATM switching architecture
Authors: A. Jajszczyk, M. Roszkiewicz
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

There has been a great technological advancement in microelectronics and communications, which forces, among others, investigations on ATM switching architectures. Researchers keep on searching an efficient architecture, able to perform at a wide range of traffic loads and patterns, ensuring both minimum probability of cell loss as well as minimum cell delay. The authors propose one more architecture. The main goal is to create an architecture capable of operating at very high data rates. As the result, the switch uses the fastest method of buffer management, and is characterized by sufficiently low probability of blocking and short delay time. Appropriate simulation results are presented and some implementation issues are discussed.
Evolutionary structural optimisation with fatigue life constraints
Authors: M. Haiba, D. C. Barton, P. C. Brooks, M. C. Levesley
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper presents an evolutionary structural optimisation strategy based on the concept of repeatedly removing sets of finite elements with the highest fatigue life. The practical application of the proposed strategy required the development of: (1) the most appropriate stress calculation method, (2) a suitable fatigue life evaluation technique and (3) a code to sort the life evaluation results and to select and remove the set of elements with the highest fatigue life. A Patran Command Language code, which uses MSC.Patran as the modelling environment, MSC.Nastran as the finite element solver and MSC.Fatigue as the life estimation tool, was written to automate the proposed optimisation strategy. The results, obtained using the code to optimise simple 2D and 3D structures, appear to be very promising compared to corresponding results obtained using mathematically proven optimisation methods. The proposed technique was found to be particularly powerful in optimising dynamically loaded components starting from basic ground structures.
Extending checkland's phenomenological approach to information systems
Authors: Hernán López-Garay
Venue: Critical reflections on information systems: a systemic approach (2003)

Recent developments in systems thinking (Fuenmayor & López Garay, 1991; Fuenmayor, 1991a,b,c; Fuenmayor, 1997; López-Garay & Suárez, 1999) linked to the phenomenological perspective, are changing our understanding of systems, and organizations. In this chapter, we will introduce a new image of organizations as holistic practices--an image based on these developments- and examine how this image may enrich Checkland's phenomenological design of information systems.The application of a phenomenological approach to information systems design (ISD) is not a new idea. Boland (1985) and Checkland & Scholes (1990), among others, brought the attention of information systems designers to this fruitful approach years ago. To phenomenology, reality is socially constructed, the product of continuous social interaction. Sense-making becomes then the focus of the systems designer, rather than the positivistic search for the "true" organization and the "true" requirements of the system to be designed (usually the main concern of the classical systems expert in every study). In the phenomenological perspective, organizations are socially constructed. Such systems can be described in relation to different particular world views of the members of the organization (Checkland & Scholes, 1990) and their interpretations. Therefore information is the meaning that results from an engagement with the different perspectives a human organization handles. In this connection, information systems have to be designed as systems to support the organization's central meaning-creation processes, and hence, their social construction of organizational reality (Boland 1987).
Implementational Issues in GCLA: A-Sufficiency and the Definiens Operation
Authors: Martin Aronsson
Venue:  (1993)

We present algorithms for computing A-sufficient substitutions and constraint sets together with the definiens operation. These operations are primitive operations in the language GCLA. The paper first defines those primitives, which together form a dual rule to SLD resolution, and then describes the different algorithms and some of their properties together with examples. One of the algorithms shows how a definition can be compiled into a representation holding all possible A-sufficient substitutions/constraint sets together with their corresponding definiens. This representation makes the computation at runtime of a definiens and an A-sufficient substitution/constraint set have the same complexity as the table lookup operation clause/2 in Prolog. The paper also describes the generalisation from unification (sets of equalities) to constraint sets and satisfiability of systems of equalities and inequalities.
A Large Scale Distributed Object Architecture - CORBA & COM for Real Time Systems
Authors: E. Chang, D Annal, F. Grunta
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

In this paper, we discuss a more complex class of industrial applications involving co-operating multiple applications each of which themselves involve multiple processes. They normally work on multiple platforms with multiple languages. The architecture chosen is a distributed object architecture using CORBA in conjunction with a dynamic plug and play GUI architecture that uses plug-ins consisting of C++ objects with COM wrappers. The system addressed the issues of working in real time with CORBA by allocating fixed priorities. The presence of a DCOM based legacy system required the development of a DCOM /CORBA bridge. Furthermore, it uses a time triggered architecture at the lowest level for collecting information from the sensors and an event triggered architecture at the Global Network Manager level.
Experience Report on Early Software Reliability Prediction and Estimation
Authors: Curt Smith, Craig Uber
Venue: Proceedings of the 10th International Symposium on Software Reliability Engineering (1999)

The reliability growth of the network software for a multi-ship naval system was estimated using the Computer Aided Software Reliability Estimation (CASRE) program developed by Allen Nikora. Although CASRE provides useful results it isn't applicable until after system integration testing begins. To see if results could be obtained sooner, the CASRE estimates were compared with those from two other models that promised earlier results. The first was a development process model created by Sam Keene. This model makes reliability predictions based on the Software Engineering Institute's Capability Maturity Model level of the developer and the estimated lines of code. The second model, developed by John Gaffney and implemented in the Software Error Estimation Program (SWEEP) fits errors discovered to a Rayleigh curve. SWEEP was used to show our reliability growth from unit test forward. After all the results were obtained, they were normalized to software errors remaining per thousand source lines of code and plotted on one graph. From this graph it was clear that software reliability could be predicted well before system integration.
An introduction to the testing and test control notation (TTCN-3)
Authors: Jens Grabowski, Dieter Hogrefe, György Réthy, Ina Schieferdecker, Anthony Wiles, Colin Willcock
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

The testing and test control notation (TTCN-3) is a new test specification and test implementation language that supports all kinds of black-box testing of distributed systems. TTCN-3 was developed in the years 1999 to 2002 at the European Telecommunications Standards Institute (ETSI), as a redesign of the tree and tabular combined notation (TTCN) standard (ITU-T Rec. X.292). TTCN-3 is built from a textual core language that provides interfaces to different data description languages and the possibility of different presentation formats. This makes TTCN-3 quite universal and application independent. TTCN-3 is being published as the ITU-T Rec. Z.140 series. This paper provides an introduction to TTCN-3. This includes an overall view of the TTCN-3 core language, a description of the existing presentation formats, an explanation of the implementation of TTCN-3-based test systems and a discussion about the current usage and the future of the language. The authors all participated in the work within ETSI.
Reasoning about secrecy for active networks
Authors: Pankaj Kakkar, Carl A. Gunter, Martín Abadi
Venue: Journal of Computer Security (2003)

In this paper we develop a language of mobile agents called uPLAN for describing the capabilities of active (programmable) networks. We use a formal semantics for uPLAN to demonstrate how capabilities provided for programming the network can affect the potential flows of information between users. In particular, we formalize a concept of security against attacks on secrecy by an 'outsider' and show how basic protections are preserved in the presence of programmable network functions.
Data Invalidation Analysis for Scan-Based Debug on Multiple-Clock System Chips
Authors: Sandeep Kumar Goel, Bart Vermeulen
Venue: Journal of Electronic Testing: Theory and Applications (2003)

To debug a digital chip with a scan-based debug methodology, the chip is stopped at a certain point in time in the application. The states of the flip-flops and the memory elements are observed and compared with the simulation results. If the chip contains multiple clock domains then these clock domains must be stopped simultaneously, otherwise some of the elements in one or more of the clock domains will capture old data/invalid data. The phenomenon of capturing invalid data is known as data invalidation. This paper describes the data invalidation problem in depth and presents a data invalidation detector circuit. An automated data invalidation analysis tool named DIAna is also presented. By means of experimental results for an industrial SOC, we show the amount of data invalidation that can occur during silicon debug.
Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning
Authors: Monika Henzinger, Jan Telle
Venue:  (1995)

This paper shows how a general technique, called {\it lock-step search}, developed for dynamic graph algorithms, can be used to improve the running time of two problems arising in program verification and communication protocol design. (1) We consider the {\it nonemptiness problem for Streett automata}: We are given a directed graph $G=(V,E)$ with $n=|V|$ and $m=|E|$, and a collection of pairs of subsets of vertices, called {\em Streett pairs}, $\langle L_i, U_i \rangle, i= 1..k$. The question is whether $G$ has a cycle (not necessarily simple) which, for each $1 \leq i \leq k$, either contains no vertex from $L_i$ or contains a vertex of $U_i$. Let $b= \sum_{i=1..k} |L_i|+|U_i|$. The previously best algorithm takes time $O((m+ b)\min\{n,k\})$. We present an algorithm that takes time $O(m \min \{ \sqrt{m \log n}, k, n\} + b \min \{\log n, k\})$. (2) In {\it communication protocol pruning} we are given a directed graph $G=(V,E)$ with $l$ special vertices. The problem is to efficiently maintain the strongly-connected components of the special vertices on a restricted set of edge deletions. Let $m_i$ be the number of edges in the strongly connected component of the $i$th special vertex. The previously best algorithm repeatedly recomputes the strongly-connected components which leads to a running time of $O(\sum_i m_i^2)$. We present an algorithm with time $O(\sqrt{l}\sum_i m_i^{1.5})$.
Developing Online Games: An Insider's Guide, 1 edition
Authors: Jessica Mulligan, Bridgette Patrovsky, Raph Koster
Venue:  (2003)

:A soup-to-nuts overview of just what it takes to successfully design, develop and manage an online game. Learn from the top two online game developers through the real-world successes and mistakes not known to others. There are Case studies from 10+ industry leaders, including Raph Koster, J. Baron, R. Bartle, D. Schubert, A. Macris, and more! Covers all types of online games: Retail Hybrids, Persistent Worlds, and console games. Developing Online Games provides insight into designing, developing and managing online games that is available nowhere else. Online game programming guru Jessica Mulligan and seasoned exec Bridgette Patrovsky provide insights into the industry that will allow others entering this market to avoid the mistakes of the past. In addition to their own experiences, the authors provide interviews, insight and anecdotes from over twenty of the most well-known and experienced online game insiders. The book includes case studies of the successes and failures of today's most well-known online games. There is also a special section for senior executives on how to budget an online game and how to assemble the right development and management teams. The book ends with a look at the future of online gaming: not only online console gaming (Xbox Online, Playstation 2), but the emerging mobile device game market (cell phones, wireless, PDA).
Shiftless decomposition and polynomial-time rational summation
Authors: J. Gerhard, M. Giesbrecht, A. Storjohann, E. V. Zima
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

New algorithms are presented for computing the dispersion set of two polynomials over Q and for shiftless factorization. Together with a summability criterion by Abramov, these are applied to get a polynomial-time algorithm for indefinite rational summation, using a sparse representation of the output.
A parallel algorithm for embedding large pyramids into smaller hypercubes with load balancing
Authors: Y. W. Chen, K. L. Chung
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

Consider a pyramid with n levels and a k-dimensional hypercube, 0/spl les/k/spl les/2n-2. The paper presents a parallel algorithm for embedding large pyramids into smaller hypercubes with load balancing. With dilation 4, congestion at most 2/sup n-k/2/+4, and load [2/sup 2n-k//3] when k is even, our algorithm embeds the pyramid into the hypercube, otherwise, with the same dilation and load, it has congestion 2/sup n-(k+1)///sup 2+1/+6 when k is odd. The algorithm can be performed in O(k)-bit time.
Robin Williams DVD Design Workshop
Authors: Robin Williams, John Tollett, David B. Rohr
Venue:  (2003)

:Robin Williams DVD Design Workshop provides a clear, accessible introduction to the world of DVD menu design and authoring. If you're an amateur video artist, home-movie buff, or professional designer, you can use this book as a great introduction to learning how to create DVDs for your personal use or professional projects. John Tollett, David Rohr, and Robin Williams make it easy by presenting necessarytechnical information and design inspiration in the classic informaland friendly style that has made Robin's books continual best-sellers.Robin Williams DVD Design Workshop provides all of theinformation you need to understand the DVD authoring process and to get started with your own DVD projects. You'll learn about the advantages of the DVD format, applications of DVD technology, hardware requirements, and the pros and cons of various consumer vs. prosumer DVD authoring tools. The book also includes overviews of leading Mac and PC DVD authoring software tools, such as iDVD, MyDVD, DVD Studio Pro, DVD Producer and more. To get you inspired, the authors includeexamples of successful (and sometimes unusual) DVD interface designs from professional designers and major Hollywood studios. Valuable outsource resources for packaging and distributing your own DVD are also included.
Techniques for Simplifying the Programming of Distributed Systems
Authors: Richard Koo
Venue:  (1987)

It is difficult to design and verify distributed programs that execute correctly despite transient processor failures, or despite variable and unpredictable processor speeds and message transmission times. In this thesis, we describe a checkpointing/rollback mechanism that allows programmers to write distributed programs with the simplifying assumption that processors do not fail, and then run these programs correctly on systems with transient processor failures. We also describe a translation mechanism that can be used to write programs with the simplifying assumptions that processors execute in synchronized steps and messages take exactly one step to arrive, and then run these programs correctly on systems that violate these assumptions. Both mechanisms are transparent to the programmer, and they can be applied to solve a large class of problems.
Parsing with Context-Free Grammars and Word Statistics
Authors: Eugene Charniak
Venue:  (1995)

We present a language model in which the probability of a sentence is the sum of the individual parse probabilities, and these are calculated using a probabilistic context-free grammar (PCFG) plus statistics on individual words and how they fit into parses. We have used the model to improve syntactic disambiguation. After training on Wall Street Journal (WSJ) text we tested on about 200 WSJ sentence restricted to the 5400 most common words from our training. We observed a 41\ performance of our PCFG without the use of the word statistics.
Exploiting Program Schemata in a Prolog Tutoring System
Authors: S T Gegg-Harrison
Venue:  (1993)

After their beginnings in computer-aided instruction, automated tutors have re-emerged as intelligent tutoring systems. These intelligent tutors have obtained considerable success by using results from cognitive psychology and artificial intelligence to permit non-traditional instruction which is tailored to their individual students. The success of these automated tutors is due to their precise understanding and modeling of both the student and the domain being taught. A common measure of the robustness of an automated tutor is the size of the domain that it can understand. The schema-based Prolog tutor described in this dissertation is capable of recognizing a larger class of programs than existing Prolog tutors. By using powerful generalized transformations, our Prolog tutor can generate this class of programs from a very small set of normal form programs than existing Prolog tutors. One of the biggest shortcomings of automated tutors for complex domains is their lack of a characterization of their domain. In computer programming tutors, for example, no current tutoring system has the ability to precisely state the class of programs that its tutor is capable of understanding. In addition to being more robust than existing programming tutors, our Prolog tutor provides a characterization of the class of programs it understands. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player