ppxscal/embedding_network huggingface dataset:
Inventing e-regulation in the US, EU and East Asia: conflicting social visions of the information society
Authors: Shalini Venturelli
Venue: Telematics and Informatics (2002)

This paper attempts to assess the international approach to Internet policy in the context of distinctive socio-political frameworks evolving in the US, the European Union (EU), and East Asia. The comparative review will develop a set of underlying structural models of the Information Society particular to each region, along with an analysis of their defining characteristics in relation to one another. The paper then evaluates principal weaknesses in these regional models and argues the need for re-conceptualizing the cultural, political and economic approach to the new information space of the Internet. The analysis concludes by suggesting the need for a fundamental shift in approach to e-regulation that may offer a more effective design for the democratic and social development of cyberspace.
E-Trepreneur: A Radically Simple and Inexpensive Plan for a Profitable Internet Store in 7 Days
Authors: Sherry Szydlik, Lamont Wood
Venue:  (2000)

:The online entrepreneur's desktop companionThis book will empower the Internet novice with the ability to create a successful online store on a budget--without hardware or even basic HTML programming. Whether the reader wants to take an existing business online or start a virtual store in his spare time, E-Trepreneur is the start-to-finish guide. The book is divided into three sections that follow the basic chronology of starting a business: The Opportunity (Evaluation), The Practical Planner (Planning & Building), and Open for E-Business (Selling & Profiting). *Topics covered include: sizing up the competition and planning your online business; developing and implementing an effective testing plan; five strategies for retaining and expanding your customer base; and why good customer service still makes great business senseSherry Szydlik (New York, NY) is a veteran of the Internet industry and was involved with online technologies long before there ever was a World Wide Web. In her ten years of working for major online/Internet companies, she has helped over two hundred business clients, including several dozen Fortune 500 companies.Lamont Wood is a freelance writer in the high-tech field who has written six books and sold more than 400 bylined articles to Byte, Compute, Information Week, American Heritage, the Chicago Tribune, and other publications around the world. He is the coauthor of Net After Dark (Wiley).
On a generalization of Polya inequality and some of its statistical implications
Authors: William M. Y. Goh
Venue: Journal of Computational and Applied Mathematics (2002)

Let p be a prime and χ a nonprincipal character mod p. Let 1 ≤ m ≤ p and l an integer so that p + l. Then, we have |Σ χ(a)χ(a + l)|≤ 3 √p ln p. The proof makes use of estimation on Kloosterman sum via the Riemann hypothesis on finite fields. As simple consequence of the theorem we obtain a uniform distribution of consecutive quadratic residues mod p.
Effective Diagnostic Systems, 1st edition
Authors: Chris J. Price
Venue:  (1999)

:Chris Price shows the best way to build effective diagnostic systems for different types of diagnostic problems by giving examples of different solutions to the problem of building effective diagnostic systems, helping you to decide on an appropriate strategy for building a diagnostic system to aid troubleshooting of that diagnostic problem, showing how to use diagnostic fault trees as a common representation for discussing different ways of approaching diagnosis, and covering rule-based systems, case-based reasoning, model-based diagnosis, neural networks, and real-time diagnosis.. "Computer-Based Diagnostic Systems is written in such a way as to make the material easy to understand even when you do not have easy access to the commercial tools.
Two-handed emulation: how to build non-blocking implementations of complex data-structures using DCAS
Authors: Michael Greenwald
Venue: Proceedings of the twenty-first annual symposium on Principles of distributed computing (2002)

This paper partly addresses the question of whether, in principle, there is any point in adding richer hardware synchronization primitives when the existing set is "universal", and therefore sufficient to synchronize any data structure in a non-blocking manner. The context of this paper is the ongoing investigation of the utility of adding a DCAS instruction to modern processors to aid the design and performance of non-blocking algorithms. We add one more piece of evidence in support of this instruction.In particular, we demonstrate that DCAS is sufficient to enable a technique called "two-handed emulation" which yields efficient and understandable implementations of a class of data structures. We present a non-blocking implementation of a doubly-linked list to show the basic technique. We describe a non-blocking implementation of a dynamically resizable hash-table to illustrate how the technique is amenable to optimizations that improve performance and increase concurrency.
Ciw Site Designer Certification Bible, 1st edition
Authors: Natanya Pitts, Chelsea Valentine
Venue:  (2001)

:The only guide you need for CIW Site Designer exam success  You're holding in your hands the most comprehensive and effective guide available for the CIW Site Designer exam. Two veteran Web design trainers provide incisive, crystal-clear explanations of every topic covered, highlighting exam-critical concepts and offering hands-on tips that will help you in your real-world Web design career. Throughout, they provide pre-tests, exam-style assessment questions, scenario problems, and lab exercises  everything you need to master the material and pass the exam. Inside, get complete coverage of Site Designer exam objectivesUnderstand the ins and outs of page layout, site navigation, graphics, multimedia, and the development processGet a handle on HTML standards and compliance, tables, page structure, frames, and metadataDelve into cascading style sheets, plug-ins, and downloadable filesDiscover what you need to know about FrontPage, Dreamweaver, HomeSite, and FlashFind out how to use JavaScript and other client-side scripting as well as Java appletsGet in-depth explanations about XML authoring, HTTP servers, and cookiesExplore Web site publishing and database technologiesTest-Prep Tools on CD-ROMHungry Minds test engine powered by top-rated Boson SoftwareMacromedia trial versions of Dreamweaver, Flash, and HomeSiteAdobe Photoshop and Adobe GoLive tryout versionsPlus, Paint Shop Pro evaluation version, BBEdit and BBEdit Lite, XML Pro demo, and WS_FTP Pro trial version, and more!Boson Software System Requirements: PC running Windows 9x/2000/Me/XP, Windows NT 4 or later; Power Macintosh running System 8.6 orlater. See the About the CD appendix for details and complete system requirements. www.hungryminds.comAuthor Biography: About the AuthorsNatanya Pitts is a lead instructional designer and XHTML/XML specialist at Powered, an online training company. She has also co-authored HTML 4 For Dummies, among others.Chelsea Valentine is the lead markup language specialist at LANWrights, Inc., and a co-author of Mastering XHTML and other titles. She teaches XHTML and XML at Austin Community College as well as at NetWorld + InterOp and other conferences.Ed Tittel is a 19-year computer industry veteran. He is currently the president of LANWrights, Inc., and Vice President of IT Certifications at Leaplt.com. Ed stays busy writing magazine articles and books (he has 110 titles to his credit), teaching, and consulting.
On an Iteration Method for Solving a Class of Nonlinear Matrix Equations
Authors: Salah M. El-Sayed, André C. M. Ran
Venue: SIAM Journal on Matrix Analysis and Applications (2001)

This paper treats a set of equations of the form $X+A^{\star}{\cal F}(X)A =Q$, where ${\cal F}$ maps positive definite matrices either into positive definite matrices or into negative definite matrices, and satisfies some monotonicity property. Here A is arbitrary and Q is a positive definite matrix. It is shown that under some conditions an iteration method converges to a positive definite solution. An estimate for the rate of convergence is given under additional conditions, and some numerical results are given. Special cases are considered, which cover also particular cases of the discrete algebraic Riccati equation.
Nonlinear Adaptive Tracking Using Kernel Estimators: Estimation and Test for Linearity
Authors: Jean-Michel Poggi, Bruno Portier
Venue: SIAM Journal on Control and Optimization (2000)

We present some statistical results on nonlinear adaptive control using kernel estimators. We are concerned with a nonlinear autoregressive model of the form $$ X_{n+1} = f(X_n) + U_n + \xi_{n+1}, \hskip 0.4cm n \in \mathbb{N}, $$ controlled using a nonparametric estimator of the unknown function f and derived from a tracking control policy. We prove an almost sure convergence result for the noise density estimator, a pointwise central limit theorem for f, and a test for linearity of the driving function f.
Web Page Design
Authors: P. Crispen, Karl Barksdale, S. Todd Stubbs
Venue:  (1999)

:This text provides a common sense approach to design fundamentals. Focuses on the Web page as a practical tool designed to capture an audience. Includes critical analysis of Web page organization, design, and functionality. Essential preparation for using any brand of Web page design software.
Automated selective multi-threshold design for ultra-low standby applications
Authors: Kimiyoshi Usami, Naoyuki Kawabe, Masayuki Koizumi, Katsuhiro Seta, Toshiyuki Furusawa
Venue: Proceedings of the 2002 international symposium on Low power electronics and design (2002)

This paper describes an automated design technique to selectively use multi-threshold CMOS (MTCMOS) in a cell-by-cell fashion. MT cells consisting of low-Vth transistors and high-Vth sleep transistors are assigned to critical paths, while high-Vth cells are assigned to non-critical paths. Compared to the conventional MTCMOS, the gate delay is not affected by the discharge patterns of other gates because there is no virtual ground to be shared. We applied this technique to a test chip of a DSP core. The worst path-delay was improved by 14% over the single high-Vth design without increasing standby leakage at 10% area overhead.
Ravenscar-Java: a high integrity profile for real-time Java
Authors: Jagun Kwon, Andy Wellings, Steve King
Venue: Proceedings of the 2002 joint ACM-ISCOPE conference on Java Grande (2002)

For many, Java is the antithesis of a high integrity programming language. Its combination of object-oriented programming features, its automatic garbage collection, and its poor support for real-time multi-threading are all seen as particular impediments. The Real-Time Specification for Java has introduced many new features that help in the real-time domain. However, the expressive power of these features means that very complex programming models can be created, necessitating complexity in the supporting real-time virtual machine. Consequently, Java, with the real-time extensions as they stand, seems too complex for confident use in high integrity systems. This paper presents a Java profile for the development of software-intensive high integrity real-time systems. This restricted programming model removes language features with high overheads and complex semantics, on which it is hard to perform timing and functional analyses. The profile fits within the J2ME framework and is consistent with well-known guidelines for high integrity software development, such as those defined by the U.S. Nuclear Regulatory Commission.
Managing the Corporate Intranet
Authors: Mitra Miller, Benjamin Bernard, Andrew Roehr
Venue:  (1997)

:This book provides intranet managers, Webmasters and administrators with hands-on solutions, action plans, and checklists for maintaining an intranet to achieve optimum results. Web page on author's site shows all checklists found in the book in downloadable format.
Managerial information overload
Venue: Communications of the ACM (2002)

Overwhelmed by the organizational imperative to collect every kind of information available, and finding technical solutions generally miss the point, knowledge workers need to improve their personal capacity for inquiry.
Theory of Computing: A Gentle Introduction, 1st edition
Authors: Carl Smith, Efim Kinber
Venue:  (2000)

:This book focuses on fundamental issues of computation. The readers can master the content and gain lasting perspective from which to understand computers by carefully worked out examples, illustrations, and algorithmic proofs. Teaches the fundamental concepts behind computation. Hundreds of exercises marked according to the level of difficulty provide readers ample opportunity to apply concepts. Hundreds of illustrations which enhance understanding. Only algorithmic proofs are given in the text allowing readers to calibrate the mathematical depth they want to pursue. Appropriate for upper division undergraduate and graduate level courses in Computer Science Theory, Theory of Computation, and Automata and Formal Language Theory.
Setting Up A Linux Internet Server Visual Black Book
Authors: Hidenori Tsuji, Takashi Watanabe, Acrobyte
Venue:  (2000)

:The only book to visually guide you through setting up a Linux internet server. Visually describes how to use Linux as an Internet server to support a globally linked TCP/IP computer network. Written by the author team of Setting Up a Linux Intranet Server Visual Black Book (Coriolis, ISBN 1-57610-568-7) Uses a step-by-step approach and a two-color layout to emphasize important aspects of each task. This book takes the reader through the entire process of setting up and supporting a functional Linux Internet Server from beginning to end.
Characteristics of neuroscience computer graphics displays and a proposed system to generate those displays
Authors: Joseph J. Capowski
Venue: ACM SIGGRAPH Computer Graphics (1976)

Computer graphics displays in the neurosciences are classified into three categories: anatomical structures, physiological waveforms, and statistical summaries. The capabilities required in a line drawing system to present neuroscience displays are smooth rotation and translation of 3D structures, simple line rejection, orthographic projection, and flexible interactive hard copy capable of drawing dots. The general purpose computer is available to refresh the CRT. A simple graphics processor with the necessary capabilities is defined and its unique features are discussed.
DrJava: a lightweight pedagogic environment for Java
Authors: Eric Allen, Robert Cartwright, Brian Stoler
Venue: Proceedings of the 33rd SIGCSE technical symposium on Computer science education (2002)

DrJava is a pedagogic programming environment for Java that enables students to focus on designing programs, rather than learning how to use the environment. The environment provides a simple interface based on a "read-eval-print loop" that enables a programmer to develop, test, and debug Java programs in an interactive, incremental fashion. This paper gives an overview of DrJava including its pedagogic rationale, functionality, and implementation.
Second Order Optimality Conditions for Semilinear Elliptic Control Problems with Finitely Many State Constraints
Authors: Eduardo Casas, Mariano Mateos
Venue: SIAM Journal on Control and Optimization (2001)

This paper deals with necessary and sufficient optimality conditions for control problems governed by semilinear elliptic partial differential equations with finitely many equality and inequality state constraints. Some recent results on this topic for optimal control problems based upon results for abstract optimization problems are compared with some new results using methods adapted to the control problems. Meanwhile, the Lagrangian formulation is followed to provide the optimality conditions in the first case; the Lagrangian and Hamiltonian functions are used in the second statement. Finally, we prove the equivalence of both formulations.
ASIS Report for WG9 Meeting on 12 June 1998, Uppsala, Sweden
Authors: Stephen Blake, Clyde G. Roby,  Jr., William Currie Colket
Venue: ACM SIGAda Ada Letters (1998)

This report covers the ASIS activities since the last ISO/IEC JTC1/SC22 WG9 meeting on 14 November 1997 in St. Louis, Missouri; United States.
Computer Confluence: Exploring Tomorrow's Technology, 3rd edition
Authors: George Beekman, Eugene J. Rathswohl
Venue:  (2001)

:The standard version of Computer Confluence combines three information sourcesan illustrated book, a multimedia CD-ROM, and an up-to-the-minute Companion Websiteto explore the promises and challenges of information technology, its effect on businesses, people, society, and the future. Topics include Computer Security and Risks, Inside the Internet and Web, and Calculation, Visualization and Simulation. For professionals in the information technology field.
Early Detection of Message Forwarding Faults
Authors: Amir Herzberg, Shay Kutten
Venue: SIAM Journal on Computing (2000)

In most communication networks, pairs of processors communicate by sending messages over a path connecting them. We present communication-efficient protocols that quickly detect and locate any failure along the path. Whenever there is excessive delay in forwarding messages along the path, the protocols detect a failure (even when the delay is caused by maliciously programmed processors). The protocols ensure optimal time for either message delivery or failure detection.We observe that the actual delivery time $\delta$ of a message over a link is usually much smaller than the a priori known upper bound D on that delivery time. The main contribution of this paper is the way to model and take advantage of this observation. We introduce the notion of asynchronously early-terminating protocols, as well as protocols that are asynchronously early-terminating, i.e., time optimal in both worst case and typical cases. More precisely, we present a time complexity measure according to which one evaluates protocols both in terms of $D$ and $\delta$. We observe that asynchronously early termination is a form of competitiveness.The protocols presented here are asynchronously early terminating since they are time optimal both in terms of $D$ and of $\delta$. Previous communication-efficient solutions were slow in the case where $\delta \ll D$. We observe that this is the most typical case.It is suggested that the time complexity measure introduced, as well as the notion of asynchronously early-terminating, can be useful when evaluating protocols for other tasks in communication networks. The model introduced can be a useful step towards a formal analysis of real-time systems.Our protocols have O(n log n) worst-case communication complexity. We show that this is the best possible for protocols that send immediately any acknowledgment they ever send. Then we show an early-terminating protocol which uses timing and delay to reduce the communication complexity in the typical executions where the number of failures is small and $\delta \ll D$. In such executions, its message complexity is linear, as is the complexity of nonfault tolerant protocols.
Shader metaprogramming
Authors: Michael D. McCool, Zheng Qin, Tiberiu S. Popa
Venue: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware (2002)

Modern graphics accelerators have embedded programmable components in the form of vertex and fragment shading units. Current APIs permit specification of the programs for these components using an assembly-language level interface. Compilers for high-level shading languages are available but these read in an external string specification, which can be inconvenient.It is possible, using standard C++, to define a high-level shading language directly in the API. Such a language can be nearly indistinguishable from a special-purpose shading language, yet permits more direct interaction with the specification of textures and parameters, simplifies implementation, and enables on-the-fly generation, manipulation, and specialization of shader programs. A shading language built into the API also permits the lifting of C++ host language type, modularity, and scoping constructs into the shading language without any additional implementation effort.
Inside Adobe PhotoShop 5
Authors: Gary David Bouton, Gary Kubicek, Barbara Bouton
Venue:  (1998)

:Inside Adobe Photoshop.0 teaches Photoshop s capabilities through step-by-step techniques that are specifically designed to create knowledge and effects that readily transfer to other uses of image editing in Photoshop. Inside Photoshop.0 offers tips, tricks, and invaluable high-end techniques that result in top quality professional images. Topics will include: Customizing Photoshop and working with New Features Working with Selections, Paths, and Layers Retouching a Photograph Working with Mixed Media Creating a Perfect Image Batch Processing Filters and Special Effects Outputting your Input Creating Graphics for the Web and building AnimationsInside Photoshop.0 is the only book you need to master the latest release of Photoshop! The new edition is completely revised with all new artwork and tutorials.Returning author Gary Bouton s creative style and technical know-how is famous among Photoshop users.Photoshop.0 is a significant update over previous versions and even expert users will need books to quickly take advantage of the new features and tools.
Superconvergent Deferred Correction Methods For First Order Systems of Nonlinear Two-Point Boundary Value Problems
Authors: Marnix Van Daele, Jeff R. Cash
Venue: SIAM Journal on Scientific Computing (2000)

Iterated deferred correction is a widely used approach to the numerical solution of first order systems of nonlinear two-point boundary value problems. Normally the orders of accuracy of the various methods used in a deferred correction scheme differ by 2, and, as a direct result, each time a deferred correction is applied the order of the overall scheme is increased by a maximum of 2. In this paper we consider the construction of mono-implicit Runge--Kutta (MIRK) methods where an increase of four orders of accuracy is obtained for each deferred correction. We develop a very powerful yet rather straightforward theory which allows us to identify the appropriate Runge--Kutta formulae for inclusion in such schemes. In particular, we will focus on the construction of pairs of MIRK formulae of order 4 and 8 which will allow this superconvergence to be realized. We will further show that it is possible to derive formulae of this type for which high order interpolants and accurate error estimates are readily available.
Energy estimation of nested loop programs
Authors: Frank Hannig, Jürgen Teich
Venue: Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures (2002)

An energy estimation methodology when mapping nested loop programs onto fine grained VLSI architectures is proposed. Regular loop algorithms with uniform data dependencies have some power consumption-friendly properties. E.g., using linear allocation and scheduling functions (loop transformations) results in distributed computations and communication between nearest neighbor processors. So, data can be stored locally in each processor which is essential for low power VLSI designs. We show that the chosen mapping has a significant influence on the consumed energy. Our estimation approach identifies statements with decreased operand switching activity. For these statements with reduced activity, a lower power consumption value can be directly obtained from a generated table based model to refine the estimation. Experimental results fortify the significant influence of the mapping (loop transformation).