ppxscal/embedding_network huggingface dataset:
Beyond Borders: Web Globalization Strategies
Authors: John H. Yunker
Venue:  (2002)

:Web globalization isn't just about expanding into new markets; it's about surviving in changing markets -- and it isn't easy. Beyond Borders: Web Globalization Strategies helps you hit the ground running. It offers great tips and hands-on strategies for setting up your site to "go global" and helps you avoid common mistakes that even Fortune 500 companies have made along the way. In the end, you will have guidelines and suggestions for bridging the borders between languages, cultures, countries, and -- ultimately -- people.
Correlational and Distributional Effects in Network Traffic Models
Authors: Robert Geist, James Westall
Venue: Proceedings of the 4th International Computer Performance and Dependability Symposium (2000)

Simulation studies are used to evaluate the impact of the distributional and correlational characteristics of traffic arrival processes on the performance of network routing elements. It is shown that synthetic traffic models that capture only the distributional or the correlational characteristics of real workloads can yield substantially optimistic predictions of queue lengths and drop rate.A new technique for generating synthetic arrival streams is proposed and evaluated. Arrival streams are generated by the widely used method of sampling from a target distribution. However, the uniform stream used in the sampling is itself derived from Fractional Gaussian Noise. The resulting synthetic streams are shown to have sample autocorrelation functions that are consistent with long-range dependence and to provide measurably better performance estimates than standard distribution-based and FGN-based techniques.
Integrating and applying processes and methods for product line management
Authors: C. D. Klingler, R. Creps
Venue: Proceedings of the 10th International Software Process Workshop (1996)

We have formulated an integrated set of concepts, processes, methods and tools, called ReuseWorks, which supports the product line approach to software development. ReuseWorks is generic and tailorable and has been validated through usage on the Army STARS Demonstration Project.
Advances in Parallel Debuggers: New Approaches to Visualization
Authors: Cherri M. Pancake, Sue Utter
Venue:  (1989)

Programmers who write serial code can take advantage of a wide range of debuggers whose features draw on more than three decades of research in how humans design and verify computer programs. Debugging tools are generally designed to facilitate a cyclic, cause-effect approach to error detection and correction. This strategy is effective in serial environments, where program execution is repeatable; in parallel settings, however, many traditional techniques are rendered useless by the effects of nondeterminism. This essay reviews recent research in parallel debuggers. In particular, it addresses the difficulties involved in developing effective schemes for portraying program behavior. A debugger''s visualization system encompasses representational and interpretive concepts as well as graphical display techniques. The goal of visualization design is to furnish relevant views of program execution as clearly and succinctly as possible. Inadequate or inappropriate visualization systems jeopardize the usefulness and acceptability of debugging tools by making it difficult for the user to draw accurate inferences about the relationship between program code and run-time errors. Industrial, governmental, and academic research efforts in debugger visualization are traced, with emphasis on the evolution of new strategies and techniques. Three basic approaches are identified -- corresponding to functional, structural, and behavioral perspectives -- and examples of recent developments are presented from each area. This is followed by a summary of the problems still confronting visualization designers.
A Near-Horn Prolog for Compilation
Authors: W D Loveland, W D Reed
Venue:  (1989)

{\bf Near-Horn Prolog} is a logic programming language which extends Prolog to handle non-Horn clauses. It was designed with the goal of minimizing the performance loss for programs with very few non-Horn clauses, while preserving the Prolog format. In this paper, we present a version of near-Horn Prolog that provides a stronger proof system than used by previous near-Horn procedures, and takes advantage of the preprocessing capability of compilers to reduce the accompanying performance penalty. In fact, for a sizable class of non-Horn programs the added inference rule strength incurs no performance penalty at all. In addition to describing this variant, called {\bf Inheritance near-Horn Prolog}, we prove its soundness and (classical) completeness.
Fracture analysis of cracked cylindrical shells under internal pressure and bending
Authors: Z. Tonković, J. Sorić
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper deals with elastic and elastoplastic fracture analyses of cracked cylindrical shells subjected to combined internal pressure and bending. The effect of an off-centre crack angle on the J-integral evaluation has been illustrated. A nonproportional loading approach, which includes only tension forces due to the pressure and neglected pressure-induced hoop stresses, has been applied. The solutions for a thin-walled pipe with the medium crack length are obtained on the basis of nonlinear 3D finite element analysis using deformation theory of plasticity. For off-centre cracks with a small offset angle, the computed values of the J-integral at the crack front which is farther away from the bending axis of the cylinder exceed those of the centred cracks. This effect exhibited for the medium crack is slightly higher than that for pure bending. An increase in the centre angles produces a decrease in the J values, which results in increasing load-carrying capacity of a cylinder.
Distributed knowledge representation in fully connected networks
Authors: J. R. Gattiker
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

Fully-connected binary networks, in addition to implementing content addressable memories, have been shown to be capable of encoding arbitrary limit cycles using synchronous dynamics. A stochastic knowledge representation paradigm is proposed, and a way to encode this knowledge form into cycles in fully-connected networks is described. This new representation format stores information in a truly distributed manner across the network, as opposed to previous schemes which store one knowledge atom per neuron.
The COMEL Language
Authors: R. "Ibrahim, C. Szyperski
Venue:  (1997)

In this paper, we propose an examplary language, COMEL, that support the Microsoft''s Component Object Model (COM) facilities. Microsoft''s COM is a leading example of the currently emerging technologies for component software. As such, it is the foundation of Microsoft''s OLE (Object Linking and Embedding) and ActiveX. Despite its importance, COM does not have a formal specification. An examplary language, COMEL, is used to model COM''s rules. A formal type system for COMEL is presented. This paper in effect presents an approach to the formalization of COM.
Optical switch configuration and lightpath assignment in wavelength routing multihop lightwave networks
Authors: Chien Chen, S. Banerjee
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

A wide-area transparent optical network can be constructed by using wavelength routers and switches, each dealing with only a small number of wavelengths. In this work we consider the problem of configuring the wavelength routers based on the observed traffic. Various policies for wavelength routing, and the corresponding assignment of wavelengths along the routes have been studied before, which are based on minimizing congestion, average hop-distance, and call blocking probability or on maximizing carried traffic, and the number of clear channels. However these approaches often lead to scenarios where a significant number of available wavelengths at the input/output ports of the routers cannot be used due to potential wavelength conflict. The wavelength routing and assignment algorithms presented in this paper focus on maximizing the wavelength-utilization at the switching devices which also improve the overall network performance.
A Simple Bivalency Proof that t-Resilient Consensus Requires t+1 Rounds
Authors: Marcos K Aguilera, Sam Toueg
Venue:  (1998)

We use a straightforward bivalency argument borrowed from [FLP85] to show that in a synchronous system with up to t crash failures solving consensus requires at least t+1 rounds. The proof is simpler and more intuitive than the traditional one: It uses an easy forward induction rather than a more complex backward induction which needs the induction hypothesis several times.
Evolving Bargaining Strategies with Genetic Programming: An Overview of AIE-DA, Ver. 2, Part 1
Authors: Shu-Heng Chen
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

The purpose of this paper is to introduce the software system AIE-DA, which is designedfor the implementation of an age t-based modeling of double auction markets.We shallstart this introduction with the current version, Version2, and the indicate what can beexpected from the future of it. 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
Profiling the Performance of TCP/IP on Windows NT
Authors: P. Xie, B. Wu, M. Liu, J. Harris, C. Scheiman
Venue: Proceedings of the 4th International Computer Performance and Dependability Symposium (2000)

This paper presents detailed network performance measurements of a prototype implementation of the TCP/IP network software on Windows NT. The measurements include latency, throughput, and CPU utilization of the protocol stack and for some key operations within the stack.
Advanced 3ds max 5 Modeling and Animating
Authors: Boris Kulagin
Venue:  (2003)

:3ds max is the revolutionary new application that delivers computer graphics professionals advanced tools for character animation, next generation game development, and visual effects production. In this comprehensive reference, users are taken from modeling a still-life scene to animating photo-realistic and fantasy characters in a variety of organic and mechanical backgrounds. Users are shown not only how to perform an action, but which actions should be used in a variety of situations. Important tasks such as creating seamless texture and modeling a person's head are demonstrated and special attention is given to the software's functionality. Also included are techniques to develop the efficiency and productivity of routine work.
Performance of a mass storage system for video-on-demand
Authors: J. Hsieh, Mengjou Lin, J. C. L. Liu, D. H. C. Du, T. M. Ruwart
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

Advancements in storage technology along with the fast deployment of high-speed networks has allowed the storage, transmission and manipulation of multimedia information such as text, graphics, still images, video and audio to be feasible. Our study focused on, the performance of the mass storage system for a large-scale video-on-demand server. Different video file striping schemes, such as application level striping and device driver level striping, were examined in order to study scalability and performance issues. To study the impact of different concurrent access patterns on the performance of a server, experimental results were obtained on group access on a single video file and multiple group accesses on multiple video files.
Low-Cost and Real-Time Super-Resolution over a Video Encoder IP
Authors: Gustavo M. Callicó, Antonio Núñez, Rafael Peset Llopis, Ramanathan Sethuraman
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

This paper addresses a low-cost and real-time solutionfor the implementation of super-resolution (SR)algorithms over SOC (System-On-Chip) platforms inorder to achieve high-quality image improvements. Low-costconstraints are accomplished in the sense that SR isperformed without developing a specific hardware, butre-using a video encoder IP block. This encoder can beused either in compression mode or in SR mode. Thisvideo encoder together with the new SR featuresconstitutes an IP block inside Philips Research, uponwhich several SOC platforms are being developed.Furthermore, this work can be easily adapted to othervideo encoder platforms.
A Heuristic Global Router for Polycell Layout
Authors: Krishna V De
Venue:  (1986)

In this work, a global router has been developed for automatic routing of nets in a polycell layout methodology. The global router attempts to optimize two quantities of prime importance, namely the total length of the conducting material and the total area of the layout. Since there is no polynomial time solution to obtaining the optimal solution to this problem, a heuristic approach has been adopted to obtain an approximate solution which is computationally efficient. The problem has been divided into essentially three problems of manageable complexity - routing of the easy nets based on a set of heuristic rules, forming close-to-optimal length rectilinear steiner tree on each of the big nets and routing of each tree based on another set of heuristic rules. The close-to-optimal length rectilinear steiner tree algorithm is heuristic in nature and has several nice features. The heuristics adopted have been tailored to exploit as much as possible the conditions which hold true for the majority of actually designed VLSI circuits and hence are expected to perform satisfactorily in most cases. The entire global routing algorithm has been implemented and interfaced with the VPNR system environment. The router has been tested on a number of actually designed circuits. The results have been compared with those of the global router developed by John E. Rose on the same circuits. Results show that the router developed in this work improves the layout area in the range of 30\% to 50\% or 80\% to 140\% depending on placement. Performance of the router developed in this work is also compared with the TimberWolf global router, which does global routing by simulated annealing, using TimberWolf placement package in both cases. Results show that this router achieves 18\% to 30\% improvement in the layout width (total number of tracks) and is computationally more efficient. 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
Analyzing Nondeterminacy of Message Passing Programs
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

Nondeterminacy is an important issue of testing and debugging parallel programs. For a message passing program the inter-process communication is the main cause of nondeterminacy. From a event-based view, the execution of a message passing parallel program can be modeled as a partially ordered set of events. The nondeterminacy is reflected in the partially ordered set. In this paper, we present a method to analyze the message wise nondeterminacy of a message passing program based on the execution trace which preserves the partial order relations.
On the semantics of interactive visualizations
Authors: M. C. Chuah, S. F. Roth
Venue: Proceedings of the 1996 IEEE Symposium on Information Visualization (INFOVIS '96) (1996)

Interactive techniques are powerful tools for manipulating visualizations to analyze, communicate and acquire information. This is especially true for large data sets or complex 3D visualizations. Although many new types of interaction have been introduced recently, very little work has been done on understanding what their components are, how they are related and how they can be combined. This paper begins to address these issues with a framework for classifying interactive visualizations. Our goal is a framework that will enable us to develop toolkits for assembling visualization interfaces both interactively and automatically.
Presenting an Algorithm to Find the Minimum Edit Distance
Authors: David Gries, Bill Burkhardt
Venue:  (1988)

UNAVAILABLE
ISO/IEC 9126: an experiment of application on Brazilian software products
Authors: A. N. Tsukumo, C. R. Capovilla, C. M. Rego, M. Jino, J. C. Maldonado
Venue: Proceedings of the 2nd IEEE Software Engineering Standards Symposium (1995)

An evaluation experiment for software products, based on ISO/IEC 9126 Standard and from the user point of view is reported. A black box evaluation process based on checklists was performed. The experiment was done in the context of the awarding procedure for the ASSESPRO Prize "Best Software of the Year" for 1993, aimed at the Brazilian Software Industry. Lessons learned from qualitative observations of the evaluation process rather than quantitative results are the most important contribution of this paper. Recommendations on the elaboration of checklists and their application, already adopted for the awarding procedure of the ASSESPRO Prize for 1994, are presented.
Negotiation over tasks in hybrid human-agent teams for simulation-based training
Authors: David Traum, Jeff Rickel, Jonathan Gratch, Stacy Marsella
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

The effectiveness of simulation-based training for individual tasks -- such as piloting skills -- is well established, but its use for team training raises challenging technical issues. Ideally, human users could gain valuable leadership experience by interacting with synthetic teammates in realistic and potentially stressful scenarios. However, creating human-like teammates that can support flexible, natural interactions with humans and other synthetic agents requires integrating a wide variety of capabilities, including models of teamwork, models of human negotiation, and the ability to participate in face-to-face spoken conversations in virtual worlds. We have developed such virtual humans by integrating and extending prior work in these areas, and we have applied our virtual humans to an example peacekeeping training scenario to guide and evaluate our research. Our models allow agents to reason about authority and responsibility for individual actions in a team task and, as appropriate, to carry out actions, give and accept orders, monitor task execution, and negotiate options. Negotiation is guided by the agents' dynamic assessment of alternative actions given the current scenario conditions, with the aim of guiding the human user towards an ability to make similar assessments.
Cooperative Transaction Hierarchies
Authors: Marian H. Nodine, Mary F. Fernandez, Andrea H. Skarra, Stanley B. Zdonik
Venue:  (1990)

In this paper, we examine some of the requirements designers place on databases. On the basis of these requirements, we define a new transaction framework called {\em cooperative transaction hierarchy}. This framework allows us to relax the criterion that transactions be atomic, while restricting the effect that this has on synchronization and recovery. {\em Patterns} specify the constraints imposed on an operation history for it to be correct. We use a type of augmented finite state automaton, called an {\em operation machine}, to enforce user-defined operation patterns. The patterns are also used in computing dependency chains among operations on the objects in the database. When an operation fails, we use these chains to invalidate any operations that are dependent on the failed operations. We define a set of operations that cooperating transactions can use when recovering from these invalidations, and show that the operation history remains correct even after recovery from a failure.
Image segmentation on spiral architecture
Authors: Qiang Wu, Xiangjian He, Tom Hintz
Venue: Proceedings of the Pan-Sydney area workshop on Visual information processing - Volume 11 (2001)

Spiral Architecture is a relatively new and powerful approach to general purpose machine vision system. It contains very useful geometric and algebraic properties. Two algebraic operations, Spiral Addition and Spiral Multiplication, have been defined on it. This paper presents a way to segment the object(s) in an image uniformly by Spiral Multiplication. Namely, a number of analogous small copies of the original object(s) are made during segmentation. An algorithm is also developed in this paper to compute the scaling factor or the number of the small copies, so image segmentation can be done flexibly and quantitatively according to the specific application. The research results are very beneficial to image segmentation in parallel image processing and distributed image processing.
Extracting Efficient Code From Constructive Proofs
Authors: James T. Sasaki
Venue:  (1986)

Extraction is a technique for producing verified programs. A proof of $\forall chi : T \ldot \exists y : T'' \ldot F$ corresponds to a function $f$ of type $T \rightarrow T''$ that maps every $\chi$ of type $T$ to a $y$ of type $T''$ such that $F$ is true. If the proof is constructive, then $f$ is recursive. The semantics of extracted code involves the manipulation of justifications, which are pieces of evidence for the truth of formulas. The raw extracted code for the formula above is actually a function $\gamma$ that maps $\chi$ to a pair $(y, \gamma'')$, where $\gamma''$ is a justification that provides evidence for the truth of $F$. This thesis presents various ways to improve the efficiency of extracted programs. The first way uses traditional code optimizations. Though very helpful, they are no panacea. The second way involves small changes to its underlying semantics. Certain formulas, called singleton formulas, have no interesting justifications; if $F$ is such a formula, no justification for it needs to be built, which simplifies the extracted code. The third way to improve extracted code is to add call-by-reference parameters to it. As originally defined, extracted code passes arguments by value, which leads to inefficient code for mutable objects like arrays: passing an array by value requires making a copy of it. Adding call-by-reference parameters entails adding a state to the semantics of extracted code, which in turn leads to various semantic and syntactic design issues, like aliasing and side-effects. To account for these changes, the constructive logic used to build proofs is modified. A proof of quicksort illustrates the functional, assignment-free, side-effect-free style of proof promoted by the new logic. To relieve the user of some of the mental overhead involved in using the new logic, an array inferencing algorithm is presented. The algorithm allows users to get code that uses arrays from proofs that reason about and manipulate lists in restricted ways. In this way, users can view the use of arrays as an optimization.