ppxscal/embedding_network huggingface dataset:
QoS Routing with Wavelengths Conversion and Call Admission Connection in DWDM Networks
Authors: C. Ben Ahmed, N. Boudriga, M. S. Obaidat
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

In a dense wavelength division multiplexed (DWDM) network, a connection must be established along a route using a common wavelength on all of the links along the route. This constraint may be removed by the introduction of wavelength converters, which are devices that take the data modulated on an input wavelength, and transfer it to a different output wavelength. Wavelength converters improve the network blocking performance as well as the QoS and routing management. This paper provides a review of the conclusionsdrawn from these investigations. We also present an approximate analytic model to allow flexible wavelengths assignment policies by virtue of optical layered approach.
Fault tolerance of PCS mobility databases
Authors: Shu-Chin Chen, Ming-Feng Chang, Yi-Bing Lin
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

A personal communications services (PCS) network system constantly tracks the locations of the mobile stations (MS) so that incoming calls can be delivered to the target mobile stations. The overall architecture of the PCS mobility management in GSM is presented. In general, a two-level database is used to store the mobile station location information. The mobile station location update procedure and the call delivery procedure are described in detail. In case of location database failure, incoming calls may be lost. The database failure restoration procedure to reduce the number of lost calls in GSM are also described. Moreover, an efficient home location register (HLR) failure recovery procedure which utilizes the MS movement information to speedup the recovery procedure is also presented.
Professional Digital Photography: Techniques for Lighting, Shooting and Image Editing
Authors: Dave Montizambert
Venue:  (2002)

:Going beyond a basic introduction to digital equipment, this book teaches photographers how to achieve high-quality, professional results with digital equipment and the application of traditional photographic techniques. It serves as a sourcebook for professionals who are ready to complement their traditional images with digital imaging techniques. Explained are how color balancing can be altered with a dial on a camera; how to effectively light subjects for digital capture; and how to enhance, highlight, shadow, and sharpen fuzzy images. Whether working with a Mac or PC, photographers will learn to use the tools in Photoshop to fully realize their artistic and professional potential.Dave Montizambert is the author of Creative Lighting Techniques for Studio Photographers. He lives in Vancouver, British Columbia. 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
Cycle simulation techniques
Authors: S. Palnitkar, D. Parham
Venue: Proceedings of the 4th IEEE International Verilog HDL Conference (1995)

Nowadays most hardware design is being done at a high level of abstraction, such as a hardware description language. Hence, simulation constitutes a significant part of the design verification process. We study cycle simulation techniques that could potentially speed up simulation. Then we propose various metrics to predict the performance of a cycle based simulator which uses these cycle simulation techniques. A justification is provided as to why each metric is the best possible indicator of a certain characteristic of the design. Finally we summarize the results obtained from the analysis of various designs and draw inferences from them.
Visual Communication for the Masses
Venue: Proceedings of the International Conference on Information Visualisation (2000)

Visual communication is vitally important to a variety of disciplines. Generally, information is communicated in a way deemed appropriate for the discipline, governed by established rules based on prior research. However, when communicating to general audiences en masse, it is imperative that information be presented as simply as possible - the rules governing specialized scientific communication may or may not be applicable. In short, accessing information should be straightforward, allowing the user to efficiently gain the knowledge for which they are searching. Visual content that is presented should be clear, concise and accurate. With this in mind, this contribution discusses issues related to delivering spatially oriented data to the general populace. Communication through computer graphics should be for the masses as much as it is for individual disciplines. As such, the first portion of this paper examines issues related to visual communication for the mass population. The later half of this contribution examines one such resource being used for visualization and communication at Purdue University.
Approximation algorithms for MAX-MIN tiling
Authors: Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan
Venue: Journal of Algorithms (2003)

The MAX - MIN tiling problem is as follows. We are given A [1 ..... n] [1, ..., n], a two-dimensional array where each entry A[i][j] stores a non-negative number. Define a tile of A to be a subarray A[l ......, r][t ..... b] of A, the weight of a tile to be the sum of all array entries in it, and a tiling of A to be a collection of files of A such that each entry A[i][j] is contained in exactly one tile. Given a weight bound W the goal of our MAX - MIN tiling problem is to find a tiling of A such that: (1) each tile is of weight at least W (the MIN condition), and (2) the number of tiles is maximized (the MAX condition). The MAX - MIN filing problem is known to be NP-hard; here, we present first non-trivial approximations algorithms for solving it.
Semantics of Exceptions
Authors: K. R Leino, Jan L. A. Van de Snepscheut
Venue:  (1993)

No abstract available.
Network Tutorial: A Complete Introduction to Networks, 5 edition
Authors: Steve Steinke, Network Magazine Editors
Venue:  (2003)

:Based on a popular series from Network Magazine, NETWORK TUTORIAL provides a systematic introduction to all facets of networks. New subjects in this fifth edition include wireless, optical, and broadband network technologies; RAID and other network storage technologies; QOS (quality of service) over IP networks; and critical security topics such as firewalls, intrusion detection, trojan horses, and vulnerability assessment tools. Also covered are network basics, including protocols and access methods; network hardware, including cabling, servers, hubs, and Ethernet; network software, including client-server applications, network operating systems, printing, and e-mail; interoperability, including TCP/IP, Internet and web services, and LDAP; internetworking, including routers, frame relay, ATM, and remote access; and network management, including backup, fault-tolerant systems, security, and telecommuting services. This book introduces networking's basic precepts, its hardware and software components, and its jargon. Concepts are explained in easy-to-understand terms and the extensive glossary provides a quick reference for unfamiliar words.
On convergence of solutions of a second order nonlinear difference equations
Authors: Jarosław Morchało
Venue: The Korean Journal of Computational Applied Mathematics (2003)

The object of the present paper is to establish some criteria of the convergence of all bounded solutions of (1), (1').
RDB structure chart display using fuzzy rules
Authors: S. Tsuhara
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

With rapid spread of EUC (E_nd U_ser C_omputing), RDB (R_elational D~ataB_ase) construction and retrieval using GUI (G_raphical U_ser I_nterface) have become a major part of information network users. Since main activity in the RDB construction is its structure design, it must be done efficiently in order to shorten the construction term. Although display function of RDB entire structure (table structures and relations between tables) defined by users is provided as a "structure chart" display function in most RDBMS (R_elational D~ataB_ase M_anagement S_ystem) to support the activity, we can say that its quality is not high enough at present. For example, the chart contains many backward or intersecting arrows (relations between tables) and tables in the chart are not well-balanced. Therefore, it is not easy to grasp the entire structure by the present chart. This has been the cause of inefficiency in the RDB construction. In this paper, we propose a new method of making and displaying a high quality structure chart using BBM (B_ranch and B_ound M_ethod) and fuzzy inference as a solution to the above problems. Furthermore, we verify the effect of the proposed method in experiment.
Determining the importance of factors affecting a ground-foundation system using artificial neural network and systems methodologies
Authors: P. Lu, M. Rosenbaum
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

Consideration is given to determining the importance of factors affecting a ground-foundation-structure system. A novel strategy has been developed for analysing the relative importance of factors by employing both Artificial Neural Network (ANN) and Rock Engineering System (RES) methodologies. ANN is mainly employed in situations where significant quantities of data are available; RES is primarily used to obtain a pragmatic solution in cases where the data are sparse. Used together, these two methodologies are able to compensate for each other's weaknesses and so derive a more realistic description of likely ground conditions. The application is illustrated by reference to examples that deal with the impact on low-rise structures of geohazards caused by soil volume change.
On Algebraic Foundations of Information Granulation III Investigating the HATA-MUKAIDONO Approach
Authors: Helmut Thiele
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

In his paper ¿Towards a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic¿ L.A. ZADEH writes ¿There are three basic concepts that underline human cognition: granulation, organization and causation. Informally, granulation involves decomposition of whole into parts; organization involves integration of parts into whole; and causation involves association of causes with effects. Granulation of an object A leads to a collection of granules of A, with a granule being a clump of points (objects) drawn together by indistinguishability, similarity, proximity or functionality.¿ Furthermore, he writes: ¿Modes of information granulation (IG) in which the granules are crisp (c-granular) play important roles in a wide variety of methods, approaches and techniques. Crisp IG, however, does not reflect the fact that in almost all of human reasoning and concept formation the granules are fuzzy (f-granular)¿.Besides others, the paper presented is a further step to develop a systematic mathematical theory fitting ZADEH's approach. In particular, the paper deals with further conceptual considerations and mathematical investigations of the approach suggested by Y. HATA and M. MUKAIDONO for defining ¿some classes of fuzzy information granularity and their representations¿.
Formalising ERP Selection Criteria
Authors: Xavier Burgués Illa, Xavier Franch, Joan Antoni Pastor
Venue: Proceedings of the 10th International Workshop on Software Specification and Design (2000)

We present a proposal for selecting ERP products from a formal description of their relevant characteristics. The work is based on a previous and successful collaboration with a midsize company in the field of software package selection. An ERP was selected following a systematic methodology called SHERPA. In this past experience, SHERPA relied on natural language descriptions of the application domain, user needs and candidate ERP solutions. In this paper, we show that a formal language may be used for modeling this application domain, translating user needs into requirements over the ERP products, and for reflecting how concrete ERP, products adjust to them. Having selection criteria used during ERP acquisition formally modeled, as well as user needs and ERP product descriptions, we expect to obtain more reliable and understandable results in this process.
Computational Complexity of Random Access Stored Program Machines
Authors: Juris Hartmanis
Venue:  (1970)

In this paper we explore the computational complexity measure defined by running times of programs on random access stored program machines, RASP''S. The purpose of this work is to study more realistic complexity measures and to provide a setting and some techniques to explore different computer organizations. The more interesting results of this paper are obtained by an argument about the size of the computed functions. For example, we show (without using diagonalization) that there exist arbitrarily complex functions with optimal RASP programs whose running time cannot be improved by any multiplicative constant. We show, furthermore, that these optimal programs cannot be fixed prodecures and self-modifying programs. The same technique is used to compare computation speed of machines with and without built in multiplication. We conclude the paper with a look at machines with associative memory and distributed logic machines.
Computer Systems Performance Evaluation and Prediction
Authors: Paul J. Fortier, Howard Michel
Venue:  (2002)

:*Fills the void between engineering practice and the academic domain's treatments of computer systems performance evaluation and assessment *Provides a single source where the professional or student can learn how to perform the computer systems engineering tradeoff analysis *Allows managers to realize cost effective yet optimal computer systems tuned to a specific application Computer Systems Performance Evaluation and Prediction provides an up-to-date treatment of the concepts and techniques applied to the performance evaluation of computer systems. Computer systems in this context include computer systems hardware and software components, computer architecture, computer networks, operating systems, database systems and middleware. The motivation in writing this book comes from the inability to find one book which adequately covers analytic, simulation and empirical testbed techniques applied to the evaluation of systems software and the computer systems which support them. The book can be used as a reference text for researchers and practitioners in the computer systems engineering and performance evaluation fields or as a single or multiple semester book on computer systems performance evaluation. Author Biography: Paul Fortier D.Sc., is Associate Professor,Electrical and Computer Engineering,University of Massachusetts at Dartmouth Howard Michel, Ph.D., is Assistant Professor,Electrical and Computer Engineering,University of Massachusetts at Darmouth
On the adaptive computation of integrals of wavelets
Authors: C. C S. Bertoluzza
Venue:  (1999)

The numerical solution of partial differential equations involves the computation of integrals of products of given functions and (derivatives of) trial and test functions. We study this problem using adaptively chosen wavelet bases. Firstly, we reduce this problem to the computation of 1-dimensional integrals. Then, we consider appropriate adaptive approximations and study the induced error. Finally, we present an algorithm for computing these integrals and give numerical results. EMAIL:: urban@dragon.ian.pv.cnr.it KEYWORDS:: Partial differential equations, integrals, wavelets, adaptive methods 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
On independent domination number of graphs with given minimum degree
Authors: N. I. Glebov, A. V. Kostochka
Venue:  (1996)

We prove a new upper bound on the independent domination number of graphs in terms of the number of vertices and the minimum degree. This bound is slightly better than that by J.~Haviland~\cite{H} and settles Case $\de =2$ of the corresponding conjecture by O.~Favaron~\cite{F}.
How well can we predict changes at architecture design time?
Authors: Nico Lassing, Daan Rijsenbrij, Hans van Vliet
Venue: Journal of Systems and Software (2003)

Two years ago, we analyzed the architecture of Sagitta 2000/SD, a large business information system being developed on behalf of Dutch Customs. We were in particular interested in assessing the capabilities of the system to accommodate future complex changes. We asked stakeholders to bring forward possible changes to the system, and next investigated how these changes would affect the software architecture. Since then, the system has been implemented and used, and actual modifications have been proposed and realized. We studied all 117 change requests submitted since our initial analysis. The present paper addresses how well we have been able to predict complex changes during our initial analysis, and how and to what extent the process to elicit and assess the impact of such changes might be improved. This study suggests that architecture analysis can be improved if we explicitly challenge the initial requirements. The study also hints at some fundamental limitations of this type of analysis: (1) fundamental modifiabilityrelated decisions need not be visible in the documentation available, (2) the actual evolution of a system remains, to a large extent, unpredictable and (3) some changes concern complex components, and this complexity might not be known at the architecture level, and/or be unavoidable.
ON THE SPLINE-BASED WAVELET DIFFERENTIATION MATRIX
Authors: Leland Jameson
Venue:  (1993)

The differentiation matrix for a spline-based wavelet basis will be constructed. Given an n-th order spline basis it will be proven that the differentiation matrix is accurate of order 2n+2 when periodic boundary conditions are assumed. This high accuracy, or superconvergence, is lost when the boundary conditions are no longer periodic. Furthermore, it will be shown that spline-based bases generate a class of compact finite difference schemes.
Online 6 DOF Augmented Reality Registration from Natural Features
Authors: Kar Wee Chia, Adrian David Cheok, Simon J. D. Prince
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

We present a complete scalable system for 6 d.o.f. camera tracking based on natural features. Crucially, the calculation is based only on pre-captured reference images and previous estimates of the camera pose and is hence suitable for online applications. We match natural features in the current frame to two spatially separated reference images. We overcome the wide baseline matching problem by matching to the previous frame and transferring point positions to the reference images. We then minimize deviations from thetwo-view and three-view constraints between the reference images and the current frame as a function of the camera position parameters. We stabilize this calculation using a recursive form of temporal regularization that is similar in spirit to the Kalman filter. We can track camera pose over hundreds of frames and realistically integrate virtual objects with only slight jitter.
Global minimization of a mutivariate polynomial using matrix methods
Authors: B. Hanzon, D. Jibetean
Venue:  (2001)

Abstract: The problem of minimizing a polynomial function in several variables over ${\bf R}^n$ is considered and an algorithm is given. When the polynomial has a minimum the algorithm returns the global minimum and finds at least one point in every connected component of the set of minimizers. A characterization of such points is given. When the polynomial does not have a minimum the algorithm can compute its infimum. No assumption is made on the polynomial. The algorithm can be applied for solving a system of polynomial equations.
The Design and Implementation of a Java Playground
Authors: Dahlia Malkhi, Michael Reiter, Avi Rubin
Venue:  (1997)

Mobile code presents a number of threats to the machines that execute it. In this paper we introduce an approach for protecting machines and the resources they hold from mobile code, and describe a system based on our approach for protecting host machines from Java applets. In our approach, each Java applet downloaded to the protected domain is rerouted to a dedicated machine (or set of machines), the playground, at which it is executed. Prior to execution the applet is transformed to use the downloading user''s web browser as a graphics terminal for its input and output, and so the user has the illusion that the applet is running on her own machine. In reality, however, mobile code runs only in the sanitized environment of the playground, where user files cannot be mounted and from which only limited network connections are accepted by machines in the protected domain. We describe the design, implementation, performance and limitations of our system, and directions for future work.
Sensor Information Networking Architecture
Authors: Chavalit Srisathapornphat, Chaiporn Jaikaeo, Chien-Chung Shen
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

The advent of technology has facilitated the development of networked systems of extremely small, low power devices that combine programmable general purpose computing with multiple sensing and wireless communication capability. This networked system of programmable sensor no des, together form a sensor network, poses unique challenges on how information collected by and stored within the sensor network could be queried and accessed, and how concurrent sensing tasks could be executed internally and programmed by external users. In this paper, we describe a sensor information networking architecture, called SINA that facilitates querying, monitoring, and tasking of sensor networks. We model a sensor network as a collection of massively distributed objects, and SINA plays the role of a middleware that facilitates adaptive organization of sensor information. The SINA kernel provides a set of configuration and communication primitives that enable scalable, robust, and energy-efficient organization of and inter actions among sensor objects. On top, the SINA kernel is a programmable substrate that follows the spreadsheet paradigm and provides mechanisms to create associations among sensor nodes. Users then access information within a sensor network using declarative queries and perform tasks using programmable scripts. Issues concerning inter-working between stationary sensor networks and mobile no des will also be addressed.
Effectively Finding Relevant Web Pages from Linkage Information
Authors: Jingyu Hou Yanchun Zhang
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

This paper presents two hyperlink analysis-based algorithms to find relevant pages for a given Web page (URL). The first algorithm comes from the extended cocitation analysis of the Web pages. It is intuitive and easy to implement. The second one takes advantage of linear algebra theories to reveal deeper relationships among the Web pages and to identify relevant pages more precisely and effectively. The experimental results show the feasibility and effectiveness of the algorithms. These algorithms could be used for various Web applications, such as enhancing Web search. The ideas and techniques in this work would be helpful to other Web-related researches.