ppxscal/embedding_network huggingface dataset:
The adoption of IPv6
Authors: Brian Childress, Bryan Cathey, Sara Dixon
Venue: Journal of Computing Sciences in Colleges (2003)

There is no question the Internet has revolutionalized the world. Many of the things we take for granted today were not even possible a few years ago. Will the Internet continue to push the boundaries of technology? The answer lies within IPv6. IPv6 will replace IPv4 as the standard addressing scheme of the Internet. Why do we need a new addressing scheme? There are numerous amounts of limitations in IPv4, namely, the shortage of addresses. Most countries, excluding the United States, do not have nearly as many IP addresses as they need. The United States owns 70% of the available IP addresses, so it is no surprise that the United States is not pushing for a quick transition to the new technology.This is all new material for professional technologists. The first implementation was IPv4, which built the addressing scheme, but now IPv6 is the first step to revise and expand it. This will take extraneous time and perseverance to complete the Internet Protocol next generation. The European Union and Japan are leading the transition to IPv6. This is inevitable since they rely on the Internet as much as the Americans, yet own significantly fewer IP addresses. IT professionals question the theory of which to upgrade first the Domain Name Server (DNS), routers, or hosts. There is not an IPv6 DNS root server. Presently, the DNS implementations all run on top of IPv4 addresses and the DNS system that supports IPv6 is linked to IPv4 information. Some DNS implementations are beginning to support national IPv6 transitions, such as, bind8 with a KAME patch, or newbie and bind9 (which are still under development). Upgrading these servers is a crucial step in the conversion process. Asia is in the process of implementing 6Bone, a virtual network layer that allows IPv4 and IPv6 to coexist. This is a major requirement for a smooth transition to IPv6. Without an intermediate layer like 6Bone, the only alternative would be to change every network in the world over to IPv6 on a specified day at a specific time-not a very ideal situation. Japan's 6Bone will take 4-5 years to complete, not including additional time to debug and fix errors.
Existence of solutions for 2 n-order boundary value problem
Authors: Xiaojing Yang
Venue: Applied Mathematics and Computation (2003)

In this paper, we discuss the existence of solutions for the 2n-order boundary value problem (-1)nu(2n)(t) = f(t, u(t), u''(t),...,u(2n-2)(t)), 0 < t < 1, u(2i)(0) = u(2i)(1) = 0, i = 0, 1 ....,n - 1, where f : [0, 1] × Rn → R is continuous.
Design and Implementation of High-Performance RNS Wavelet Processors Using Custom IC Technologies
Authors: Javier Ramírez, Uwe Meyer-Bäse, Fred Taylor, Antonio García, Antonio Lloris
Venue: Journal of VLSI Signal Processing Systems (2003)

The design of high performance, high precision, real-time digital signal processing (DSP) systems, such as those associated with wavelet signal processing, is a challenging problem. This paper reports on the innovative use of the residue number system (RNS) for implementing high-end wavelet filter banks. The disclosed system uses an enhanced index-transformation defined over Galois fields to efficiently support different wavelet filter instantiations without adding any extra cost or additional look-up tables (LUT). A selection of a small wordwidth modulus set are the keys for attaining low-complexity and high-throughput. An exhaustive comparison against existing two's complement (2C) designs for different custom IC technologies was carried out. Results reveal a performance improvement of up to 100% for high-precision RNS-based systems. These structures demonstrated to be well suited for field programmable logic (FPL) assimilation as well as for CBIC (cell-based integrated circuit) technologies.
A 5-20 GHz, low power FPGA implemented by SiGe HBT BiCMOS technology
Authors: Chao You, Jong-Ru Guo, Russell P. Kraft, Kuan Zhou, Michael Chu, John F. McDonald
Venue: Proceedings of the 13th ACM Great Lakes symposium on VLSI (2003)

A high speed, low power FPGA design is presented in this paper. This gigahertz FPGA design has an improved XC6200 structure. Redundant multiplexers are eliminated from critical signal path to enhance the performance of the previous design. By balancing between the power consumption and performance, the simulated clock rate is from 5 GHz to 20 GHz and the power consumption is from 4 mW to 12 mW per single cell in the IBM 7HP SiGe HBT BiCMOS process.
Using spreadsheets to simulate neural networks
Authors: Parvin Rahnavard
Venue: Journal of Computing Sciences in Colleges (2002)

The field of neural networks is an active research area in artificial intelligence for solving problems ranging from image recognition to financial systems. Unfortunately, the solution to such problems using neural networks is often complex and highly mathematical. In teaching neural networks, spreadsheets are excellent tools for visualizing the problem as well as for describing the proposed scientific solution.
Computing Stationary Nash Equilibria of Undiscounted Single-Controller Stochastic Games
Authors: T. E. S. Raghavan, Zamir Syed
Venue: Mathematics of Operations Research (2002)

Given a two-person, nonzero-sum stochastic game where the second player controls the transitions, we formulate a linear complementarity problem LCP( q, M) whose solution gives a Nash equilibrium pair of stationary strategies under the limiting average payoff criterion. The matrixM constructed is of the copositive class so that Lemke's algorithm will process it. We will also do the same for a special class ofN-person stochastic games called polymatrix stochastic games.
Distribution Estimation Using Laplace Transforms
Authors: Carl M. Harris, William G. Marchal
Venue: INFORMS Journal on Computing (1998)

We propose two related methods for deriving probability distribution estimates using approximate rational Laplace transform representations. Whatever method is used, the result is a Coxian estimate for an arbitrary distribution form or plain sample data, with the algebra of the Coxian often simplifying to a generalized hyperexponentia l or phase-type. The transform (or, alternatively, the moment-generating function) is used to facilitate the computations and leads to an attractive algorithm. For method one, the first 2N - 1 derivatives of the transform are matched with those of an approximate rational function; for the second method, a like number of values of the transform are matched with those of the approximation. The numerical process in both cases begins with an empirical Laplace transform or truncation of the actual transform, and then requires only the solution of a relatively small system of linear equations, followed by root finding for a low-degree polynomial. Besides the computationally attractive features of the overall procedure, it addresses the question of the number of terms, or the order, involved in a generalized hyperexponential, phase-type, or Coxian distribution, a problem not adequately treated by existing methods. Coxian distributions are commonly used in the modeling of single-stage and network queueing problems, inventory theory, and reliability analyses. They are particularly handy in the development of large-scale model approximations.
Optimal multi-degree reduction of Bézier curves with constraints of endpoints continuity
Authors: Guo-Dong Chen, Guo-Jin Wang
Venue: Computer Aided Geometric Design (2002)

Given a Bézier curve of degree n, the problem of optimal multi-degree reduction (degree reduction of more than one degree) by a Bézier curve of degree m (m > n - 1) with constraints of endpoints continuity is investigated. With respect to L2 norm, this paper presents one approximate method (MDR by L2) that gives an explicit solution to deal with it. The method has good properties of endpoints interpolation: continuity of any r, s (r, s ≥ 0) orders can be preserved at two endpoints respectively. The method in the paper performs multi-degree reduction at one time and does not need the stepwise computing. When applied to the multi-degree reduction with endpoints continuity of any orders, the MDR by L2 obtains the best least squares approximation. Comparison with another method of multi-degree reduction (MDR by L∞), which achieves the nearly best uniform approximation with respect to L∞ norm, is also given. The approximate effect of the MDR by L2 is better than that of the MDR by L∞. Explicit approximate error analysis of the multi-degree reduction methods is presented.
Can qualitative utility criteria obey the sure thing principle?
Authors: Hélène Fargier, Régis Sabbadin
Venue: Technologies for constructing intelligent systems: Tasks (2002)

Monotonic utilities are qualitative decision criteria that have been proposed for dealing with problems where preferences and uncertainty cannot be quantified. However, these criteria suffer from a double drawback: first, they may suffer from a lack of decisiveness power. Second, they do not fully satisfy the Sure-Thing Principle (STP), which is widely accepted as a fundamental property of decision criteria. We try to cope with these two problems, proposing refinements of these decision criteria that obey the Sure Thing Principle. These procedures are derived from the comparison of the monotonic utilities of acts, every state in which both acts give identical results being neglected.
Instability of a gas jet of zero inertia dispersed in a liquid using Lagrangian's non-linear differential equation
Authors: Ahmed E. Radwan, Ramadan M. Ali
Venue: Applied Mathematics and Computation (2003)

The stability of a gas jet of zero inertia (of radius R) dispersed in a liquid (i.e. hollow jet) has been developed. The potential and kinetic energies of the system are computed, Lagrangian's function is constructed and the desired stability criterion is derived on using Lagrangian's non-linear differential equation. The eigenvalue relation is discussed and the results are analysed numerically for all wavelengths in various modes of disturbance. It is found that the temporal amplification prevailing in the full liquid jet is much lower than that of the hollow jet. The latter is capillary stable in the non-axisymmetric modes m ≠ 0 for all wavelengths and also stable in the axisyrmmetric mode m = 0 whose wavelength λ is equal to or less than the circumference 2πR of the gas jet, where m (an integer) is the azimuthal wavenumber. The hollow jet is unstable only in the mode m = 0 as λ > 2πR.
Graphs with large maximum degree containing no odd cycles of a given length
Authors: Paul Balister, Béla Bollobás, Oliver Riordan, Richard H. Schelp
Venue: Journal of Combinatorial Theory Series B (2003)

Let us write f (n, Δ; C2k+1) for the maximal number of edges in a graph of order n and maximum degree Δ that contains no cycles of length 2k+ 1. For n/2 ≤ Δ ≤ n - k- 1 and n sufficiently large we show that f (n, Δ;C2k-1) = Δ (n - Δ), with the unique extremal graph a complete bipartite graph.
Implementing a component-based tool for interactive synthesis of UML statechart diagrams
Authors: Johannes Koskinen, Erkki Mäkinen, Tarja Systä
Venue: Acta Cybernetica (2002)

The Unified Modeling Language (UML) has an indisputable role in object-oriented software development. It provides several diagram types viewing a system from different perspectives. Currently available systems have relatively modest tool support for comparing, merging, synthesizing, and slicing UML diagrams based on their semantical relationships. Minimally Adequate Synthesizer (MAS) is a tool that synthesizes UML statechart diagrams from sequence diagrams in an interactive manner. It follows Angluin's framework of minimally adequate teacher to infer the desired statechart diagram with the help of membership and equivalence queries. MAS can also synthesize sequence diagrams into an edited or manually constructed statechart diagram. In this paper we discuss problems related to a practical implementation of MAS and its integration with two existing tools (Nokia TED and Rational Rose) supporting UML-based modeling. We also discuss information exchange techniques that could be used to allow the usage of other CASE tools supporting UML.
Dynamic maintenance and visualization of molecular surfaces
Authors: Chandrajit L. Bajaj, Valerio Pascucci, Ariel Shamir, Robert J. Holt, Arun N. Netravali
Venue: Discrete Applied Mathematics (2003)

Molecular surface computations are often necessary in order to perform synthetic drug design. A critical step in this process is the computation and update of an exact boundary representation for the molecular surface (e.g. the Lee--Richards surface). In this paper we introduce efficient techniques for computing a molecular surface boundary representation as a set of non-uniform rational B-splines patches. This representation introduces for molecules the same geometric data structure used in the solid modeling community and enables immediate access to a wide range of modeling operations and techniques. Furthermore, this allows the use of any general solid modeling or visualization system as a molecular modeling interface. However, using such a representation in a molecular modeling environment raises several efficiency and update constraints, especially in a dynamic setting. For example, changes in the probe radius result in both geometric and topological changes to the set of patches. Our techniques provide the option of trading accuracy of the representation for the efficiency of the computation, while still tracking the changes in the set of patches. In particular, we discuss two main classes of dynamic updates: one that keeps the topology of the molecular configuration fixed, and a more complicated case were the topology may be updated continuously. In general the generated output surface is represented in a format that can be loaded into standard solid modeling systems. It can also be directly triangulated or rendered, possibly at different levels of resolution, by a standard graphics library such as OpenGL without any additional effort.
Directv: Forecasting Diffusion of a New Technology Prior to Product Launch
Authors: Frank M. Bass, Kent Gordon, Teresa L. Ferguson, Mary Lou Githens
Venue: Interfaces (2001)

We conducted research for planning the launch of a satellite television product, leading to a prelaunch forecast of subscriptions of satellite television over a five-year horizon. The forecast was based on the Bass model. We derived parameters of the modelin part from stated-intentions data from potential consumers and in part by guessing by analogy. The 1992 forecast of the adoption and diffusion of satellite television proved to be quite good in comparison with actual subscriptions over the five-year period from 1994 through 1999.
Information technology spending and the value of the firm: the case of Mexican banks
Authors: Carlos J. Navarrete, James B. Pick
Venue: Creating business value with information technology: challenges and solutions (2003)

This paper analyzes the relationship between IT expenditure and the monetary value of organizations. Based on the case of the Mexican banking industry from 1982-1992, the paper's hypotheses test the relationship between IT expenditure and the real and perceived market values of banks. Correlations are performed between annual IT expenditures for a 10 year period--when Mexico's commercial banks were owned by the federal government--and bank selling prices, when the industry divestiture took place in 1992. The main findings are that IT spending has a positive impact on the value of the firm, when the value of the firm reflects the change of ownership or the control of the firm. Second, firms spending more on IT do not tend to reach higher selling prices. Other findings are presented. The model and its results are discussed in terms of the literature about value of investment and the productivity paradox.
Large-Scale Convex Optimization Via Saddle Point Computation
Authors: Markku Kallio, Charles H. Rosa
Venue: Operations Research (1999)

This article proposes large-scale convex optimization problems to be solved via sad dle points of the standard Lagrangian. A recent approach for saddle point computation is specialized, by way of a specific perturbation technique and unique scaling method, to convex optimization problems with differentiable objective and constraint funct ions. In each iteration the update directions for primal and dual variables are determined by gradients of the Lagrangian. These gradients are evaluated at perturbed points that are generated from current points via auxiliary mappings. The resulting algorithm suits massively parallel computing, though in this article we consider only a serial implementation. We test a version of our code embedded within GAMS on 16 nonlinear problems, which are mainly large. These models arise from multistage optimization of economic systems. For larger problems with adequate precision requirements, our implementation appears faster than MINOS.
Proceedings of the symposium on Data visualisation 2003
Venue: ACM International Conference Proceeding Series; Vol. 40 (2003)

These proceedings contain the papers presented at VisSym '03, the fifth Joint Visualization Symposium of the Eurographics Associate and the Technical Committee on Visualization and Graphics (TCVG) of the IEEE Computer Society. The Symposium was held May 26-28, 2003 in Grenoble, France at the IMAG Conference Center.There were 62 papers submitted from 11 countries. Each submission was anonymously reviewed by at least three 3 members of the International Program Committee. The decision of which papers to accept was difficult due to the high quality of submissions. This year, 30 papers were accepted for publication.
Extending the Cyert-March Duopoly Model: Organizational and Economic Insights
Authors: Michael J. Prietula, Harry S. Watson
Venue: Organization Science (2000)

Two studies were conducted to further explore the organizational and economic insights provided by the Cyert-March duopoly model (C-M) described inA Behavioral Theory of the Firm (ABTOF, Cyert and March 1963). Study 1 examined the extent to which two firms that differed solely in the decision behavior of a routine would also differ in organizational (quasiresolution of conflict, uncertainty avoidance, problem-driven search, and organizational learning) and economic (profit, price, market share, cost) measures and impacts. Three such manipulations were separately examined, where each manipulation altered the relative propensity of the firm to be more or less reactive to three events: production growth pressure, price adjustment under organizational goal conflict, and initial price adjustment under profit goal failure. Analysis of the behaviors revealed how subtle changes in these key routines could generate complex organizational and economic effects that impact firm success. The dominant result demonstrated that organizations that did not perform well organizationally did not perform well economically. In addition, higher reactivity resulted in higher costs, in part because of quantified organizational constructs (e.g., slack, pressure). Study 2 examined the data from the first study to determine the extent to which the performance of the duopoly was consistent with a set of eight stylized economic facts drawn from the empirical literature on oligopoly. Study 2 demonstrated consistency with five of the eight stylized economic facts and provided partial support for two others. We conclude that behavioral constructs of ABTOF, as articulated in the Cyert-March duopoly model, provide behavior and performance capabilities that bridge the gap between game-theoretic models of duopoly and the computational and informational realities of organizations.
Statistical performance guarantees in large-scale cross-path packet switch
Authors: Man Chi Chan, Tony T. Lee
Venue: IEEE/ACM Transactions on Networking (TON) (2003)

In this paper, we develop a general framework for a novel switch architecture, the cross-path switch, to provide persession statistical quality of service (QoS) guarantees. With characterizing the service each session receives by service curves, we derive a set of statistical bounds on the delay, backlog, and departure processes at the switch on a per-session manner using exponential bounded burstiness processes as source session traffic models. These bounds show that the service guarantees offered by the cross-path switch depend on the way of token assignment in the central stage of the switch. To provide better performance guarantees,we determine the criteria for designing a token assignment algorithm for the cross-path switch. Also, we quantify the service guaranteed by the cross-path switch with the central stage implemented in optical domain, which is important for the provision of QoS guarantees to each session in semioptical networks.
Finding Disjoint Routes in Telecommunications Networks with Two Technologies
Authors: Anne De Jongh, Michel Gendreau, Martine Labbe
Venue: Operations Research (1999)

We consider networks in which a cost is associated with each arc or edge and a transition cost is associated with each node. This la st cost is related to the presence of two technologies on the network and is incurred only when a flow enters and leaves the corresponding node on arcs of different types. The problem we consider consists in finding two node disjoint paths with minimum total cost. We show that it is strongly NP-complete. Then we propose two heuristics, study their worst case behavior, provide a lower bounding procedure based on Lagrangean relaxation, and finally embed those elements in a branch and bound procedure.
A steganographic method for images by pixel-value differencing
Authors: Da-Chun Wu, Wen-Hsiang Tsai
Venue: Pattern Recognition Letters (2003)

A new and efficient steganographic method for embedding secret messages into a gray-valued cover image is proposed. In the process of embedding a secret message, a cover image is partitioned into non-overlapping blocks of two consecutive pixels. A difference value is calculated from the values of the two pixels in each block. All possible difference values are classified into a number of ranges. The selection of the range intervals is based on the characteristics of human vision's sensitivity to gray value variations from smoothness to contrast. The difference value then is replaced by a new value to embed the value of a sub-stream of the secret message. The number of bits which can be embedded in a pixel pair is decided by the width of the range that the difference value belongs to. The method is designed in such a way that the modification is never out of the range interval. This method provides an easy way to produce a more imperceptible result than those yielded by simple least-significant-bit replacement methods. The embedded secret message can be extracted from the resulting stego-image without referencing the original cover image. Moreover, a pseudo-random mechanism may be used to achieve secrecy protection. Experimental results show the feasibility of the proposed method. Dual statistics attacks were also conducted to collect related data to show the security of the method.