ppxscal/embedding_network huggingface dataset:
The C Standard
Authors: British Standards Institute
Venue:  (2002)

:The definitive reference for any C programmer or for programmers needing to work with C programs.Every book written about C refers frequently to the international standard that defines the language, this will be a must-have companion volume for everyone who is serious about programming in this language. The complete, current C standard (ISO/IEC 9899-1999) as approved by international standards bodies (BSI and ANSI)The ONLY available bound version of the standardIncludes the C rationale which provides a valuable insight into why certain decisions were made during the creation of the languageAn introductory chapter explains what the standards process is and how the reader can participate in the standards process 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
Telegram Stop
Authors: Linda Rosenkrantz
Venue:  (2003)

:There was a time when the sight of a Western Union delivery boy coming up the walk filled Americans with a sense of excitement or trepidation. Between its invention in the mid-nineteenth century and its post-1960s relegation to money transfer and congratulations, the telegraph served as the primary medium for urgent messages. SEND MONEY STOP collects the most poignant and revealing examples of this earliest form of instant communication.Organized into categories such as "Parents and Children," "Hooray for Hollywood," and "Lincoln in the Telegraph Office," the telegrams range from such moving personal notes as W.C. Fields's wire to his dying friend John Barrymore, "You can't do this to me," to political advice, such as one voter's telegraphed suggestion to President Herbert Hoover: "Vote for Roosevelt and make it unanimous." The communication compiled here also provides a novel and engaging perspective on modern history. Abraham Lincoln virtually conducted the Civil War over the telegraph wires, financial nabobs used them to discuss (and fail to predict) the stock market crash that precipitated the Great Depression, and Japanese diplomats in Washington sent a flurry of encoded telegrams to Tokyo in the weeks leading up to the attack on Pearl Harbor. This handsome volume blends history, sociology, wit, and creativity as captured and dispatched by the telegram in its golden age. About the Author:Linda Rosenkrantz is co-author of the bestselling baby-naming guide Beyond Jason & Jennifer and has written numerous other fiction and nonfiction books. She lives with her husband and daughter in Los Angeles. 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
Interactive Data Analysis on Numeric-Data
Authors: Hong Ki Chu, Man Hong Wong
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

Data Mining has been a hot topic in computer science. Many researchers have been putting lots of efforts on how to extract explicit knowledge from large databases. Among the problems in data mining, finding useful patterns in large databases has attracted lots of interest in recent years. However, like other data mining algorithms, most of the proposed clustering algorithms are suffering from the same demerit: lack of user interaction and exploration. In this paper, a new algorithm called Interactive Data Analysis on Numeric-data : IDAN is being introduced. IDAN is good in discovering clustering patterns from numeric data. This algorithm is incremental and providing more user interaction in the mining process. At the same time, it allows the user to explore the rules or clusters being found when integrated with a visualizer.
Cyclic codes over Z4 of oddly even length
Authors: Thomas Blackford
Venue: Discrete Applied Mathematics (2003)

This paper classifies all cyclic codes over Z4 of length 2n,n odd. Descriptions are given in terms of discrete Fourier transforms, generator polynomials, parity check matrices, and the concatenated (a + b|b) construction. Some results about the minimum Lee weights of these codes and self-dual codes are also included.
Software Reliability Modeling and Cost Estimation Incorporating Testing-Effort and Efficiency
Authors: Chin-Yu Huang, Jung-Hua Lo, Sy-Yen Kuo, Michael R. Lyu
Venue: Proceedings of the 10th International Symposium on Software Reliability Engineering (1999)

Many studies have been performed on the subject of software reliability, but few explicitly consider the impact of software testing on the reliability process. This paper presents two important issues on software reliability modeling and software reliability economics: testing effort and efficiency. First, we will discuss on how to extend the logistic testing-effort function into a general form. The generalized logistic testing-effort function has the advantage of relating the work profile more directly to the natural flow of software development. Therefore, it can be used to describe the actual consumption of resources during software development process and get a conspicuous improvement in modeling testing-effort expenditures. Furthermore, we will incorporate the generalized logistic testing-effort function into software reliability modeling and its fault-prediction capability is evaluated through four numerical experiments on real data. Then, we will address the effects of automated techniques or tools on increasing the efficiency of software testing. New testing techniques will usually increase test coverage.We propose a modified software reliability cost model to reflect these effects. From the simulation results, we obtain a powerful software economic policy which clearly indicates the benefits of applying new automated testing techniques and tools during software development process.
Low-dimensional models of subcritical transition to turbulence
Authors: Jeffrey S. Baggett, Lloyd N. Trefethen
Venue:  (1996)

In the past five years, working largely independently, five groups of researchers have proposed low-dimensional models of the behavior of parallel shear flows at high Reynolds numbers. These models are compared, and it is found that they are more similar than their authors have recognized. Among other similarities, most of them exhibit a threshold amplitude c=O(R**alpha) as R--<infinity for some alpha > -1, where R is the Reynolds number, for perturbations of the laminar state that may excite transition to turbulence.
First-Order System Least-Squares for Second-Order Partial Differential Equations: Part II
Authors: Z. Cai, T. A. Manteuffel, S. F. McCormick
Venue:  (1994)

This paper develops a least-squares functional that arises from recasting general second-order uniformly elliptic partial differential equations in n=2 or 3 dimensions as a system of first-order equations. In part I [10] a similar functional was developed and shown to be elliptic in the H(div) x H^1 norm and to yield optimal convergence for finite element subspaces of H(div) x H^1. In this paper the functional is modified by adding a compatible constraint and imposing additional boundary conditions to the first-order system. The resulting functional is proved to be elliptic in the (H^1)^n+1 norm, and optimal convergence for finite element subspaces of (H^1)^n+1 is established. Further, multiplicative and additive multigrid algorithms for the numerical solution of the resulting discrete functional are derived and shown to be optimally convergent. Apparently, this equations, avoiding the limitations of perturbation type results.
On the Origin of Power Laws in Internet Topologies
Authors: Alberto Medina, Ibrahim Matta, John Byers
Venue:  (2000)

Abstract Recent empirical studies have shown that Internet topologies exhibit power laws of the form $y = x^\alpha$ for the following relationships: (P1) outdegree of node (domain or router) versus rank; (P2) number of nodes versus outdegree; (P3) number of node pairs within a neighborhood versus neighborhood size (in hops); and (P4) eigenvalues of the adjacency matrix versus rank. However, causes for the appearance of such power laws have not been convincingly given. In this paper, we examine four factors in the formation of Internet topologies. These factors are (F1) preferential connectivity of a new node to existing nodes; (F2) incremental growth of the network; (F3) distribution of nodes in space; and (F4) locality of edge connections. In synthetically generated network topologies, we study the relevance of each factor in causing the aforementioned power laws as well as other properties, namely diameter, average path length and clustering coefficient. Different kinds of network topologies are generated: (T1) topologies generated using our parametrized generator, we call BRITE; (T2) random topologies generated using the well-known Waxman model; (T3) Transit-Stub topologies generated using GT-ITM tool; and (T4) regular grid topologies. We observe that some generated topologies may not obey power laws P1 and P2. Thus, the existence of these power laws can be used to validate the accuracy of a given tool in generating representative Internet topologies. Power laws P3 and P4 were observed in nearly all considered topologies, but different topologies showed different values of the power exponent $\alpha$. Thus, while the presence of power laws P3 and P4 do not give strong evidence for the representativeness of a generated topology, the value of $\alpha$ in P3 and P4 can be used as a litmus test for the representativeness of a generated topology. We also find that factors F1 and F2 are the key contributors in our study which provide the resemblance of our generated topologies to that of the Internet. Note: BRITE (Boston university Representative Internet Topology gEnerator) is available at http://www.cs.bu.edu/fac/matta/software.html
A Jump and Look all round Long Range Image Restoration and Its Parallelism
Authors: Wen Li, Xiangzhen Qiao, Dapeng Zhang, Zhiyong Liu
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

Image information restoration algorithm based on Long-Range correlation (LR-IIRA) can be efficiently applied in image interpretation, restoration, and error concealment. However, this algorithm requires excessive computing time, which restricts its application on large-scale problems and real-time problems. In this paper, we propose an improved LR-IIRA, named jumping and looking all round (JL-LR-IIRA). By using this algorithm, the computing time can be reduced to 1/6 of LR-IIRA's, i.e., the computing time is 14.17(second) by LR-IIRA, and 2.41(s) by JL-LR-IIRA. To reduce the processing time further, a parallel JL-LR-IIRA algorithm (PJL-LR-IIRA) to parallelize the restoration processing is proposed. In our PJL-LR-IIRA, after we analyze data distribution and communication deeply, a parallel read method and a key position technique are presented. By using our PJL-LR-IIRA on four computing nodes on Dawning 2000 cluster system, the processing time is 0.69(second). PJL-LR-IIRA provides a new efficient way for real-time image restoration applications. Furthermore, from theoretical analysis and experiment results, it shows that the scalability of our PJL-LR-IIRA is good. Therefore, PJL-LR-IIRA is also a new efficient way for large-scale image restoration applications.
High Quality Analog CMOS and Mixed Signal LSI Design
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

This paper presents an overview of high quality design methodology both in the analog CMOS and in the mixed signal LSI. The important design considerations in analog CMOS are first discussed. Not only taking the conventional methodology into account but also taking care of the process fluctuation including VT mismatch or 1/f noise lead to robust and high quality analog CMOS circuits. For the rapid-growing high frequency applications, parasitic effects such as cross-coupled capacitance and substrate power loss are becoming serious issues. Thus it is demonstrated that pre- and post-layout simulations are vital to achieve target characteristics. The mixed signal LSI design today requires the system-level simulation in order to meet the competitive performance specifications. The mixed-mode simulation using SPICE, Verilog-D, and Verilog-A, which can concurrently handle analog and digital circuits, is shown to be essential to the overall mixed signal system design. The substrate noise or EMI need to be analyzed effectively under such environment as well. Finally accurate device parameter extraction, its careful reflection to above circuit designs, and fine parameter control in manufacturing for the active and passive devices are described.
The Discontinuous Enrichment Method
Authors: Charbel Farhat, Isaac Harari, Leopoldo P. Franca
Venue:  (2000)

We propose a finite element based discretization method in which the standard polynomial field is enriched within each element by a nonconforming field that is added to it. The enrichment contains free-space solutions of the homogeneous differential equation that are not represented by the underlying polynomial field. Continuity of the enrichment across element interfaces is enforced weakly by Lagrange multipliers. In this manner, we expect to attain high coarse-mesh accuracy without significant degradation of conditioning, assuring good performance of the computation at any mesh resolution. Examples of application to acoustics and advection-diffusion are presented.
Gaussian segmentation of BSE images to assess the porosity of concrete
Authors: D. J. Robinson, F. Murtagh, P. A. M. Basheer
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper presents a model-based Gaussian clustering approach for the identification of the porosity, hydrated and unhydrated phases constituting a backscatter electron image of the microstructure of cement paste. The likelihood function for the Gaussian mixture is optimised using the expectation-maximization algorithm and the quality of fit is assessed using the Bayes information criterion. The technique provides a consistent and repeatable means of phase identification within the microstructure of cement paste. The application of the approach has been demonstrated through an example.
Enterprise Information Portals and Knowledge Management
Authors: Joseph M. Firestone
Venue:  (2002)

:Is the Enterprise Information Portal (EIP) knowledge management's killer app? Leading expert Joseph M. Firestone, the first author to formulate the idea of the Enterprise Knowledge Portal, breaks new ground and looks to the future with a practical, but comprehensive approach to enterprise portals and their relationship to knowledge management. Providing a clear and novel overview, Firestone tackles a wide range of topics ranging from functional EIP applications, estimating costs and benefits of EIPs, variations in EIP technical architecture, the role of intelligent agents, the nature of knowledge management, portal product/solution segmentation, portal product case studies, to the future of the EIP space.'Enterprise Information Portals and Knowledge Management' is the book on portals you've been waiting for. It is the only book that thoroughly considers, explores, and analyzes:*The EIP orientation, outlook and evolution*A new methodology for estimating EIP benefits and costs*EIP and Enterprise Knowledge Portals (EKP) architecture*The approaching role of software agents in EIPs and EKPs*The current and future contribution of EIP and EKP solutions to Knowledge Management*The role of XML in portal architecture *A comprehensive, multi-dimensional, and forward-looking segmentation of EIP products accompanied by portal product case studies*Where EIP sector companies are headed and the pathways they will follow to get there Author Biography: Joseph M. Firestone, Ph.D., is Vice President and Chief Knowledge Officer, Executive Information Systems, Inc.; Executive Vice President, Education, Research and Membership, Knowledge Management Consortium International (KMCI).
Adaptive Resource Management in Asynchronous Real-Time Distributed Systems Using Feedback Control Functions
Authors: Binoy Ravindran, Pushkin Kachroo, Tamir Hegazy
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

In this paper, we present feedback control techniques for performing adaptive resource management in asynchronous real-time distributed systems. Asynchronous real-time distributed systems are characterized by significant execution-time uncertainties in the application environment and system resource state. Thus, such systems require adaptive resource management that dynamically monitor the system for adherence to the desired real-time requirements and perform run-time adaptation of the application to changing workloads when unacceptable timeliness behavior is observed. We propose adaptive resource management techniques that are based on feedback control theory. The controllers solve resource allocation problems that arise during run-time adaptation using the classical proportional-integral-derivative control functions. We study the performance of the controllers through simulation. The simulation results indicate that the controllers produce low missed deadline ratios and resource utilizations during situations of high workloads.
A Reliability Estimator for Model Based Software Testing
Authors: Kirk Sayre, Jesse Poore
Venue: Proceedings of the 13th International Symposium on Software Reliability Engineering (2002)

This paper presents a reliability estimator based oncurrent Markov chain usage model testing methodology.This reliability estimator is specifically formulated totake advantage of software testing performed usingMarkov chain models of the use of the software undertest. The reliability estimator presented in this paper isuseful in the absence of observed failures, behaves in apredictable manner, can make use of pretest reliabilityinformation, and has an associated variance.
Patia: Adaptive Distributed Webserver (A Position Paper)
Authors: Julie A. McCann, Gawesh Jawaheer, Linxue Sun
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

This paper introduces the Patia Adaptive Webserver architecture, which is distributed and consists of semi-autonomous agents called FLYs. The FLY carries with it the set of rules and adaptivity policies required to deliver the data to the requesting client. Where a change in the FLY's external environment could affect performance, it is the FLY's responsibility to change the method of delivery (or the actual object being delivered). It is our conjecture that the success of today's multimedia websites in terms of dependability and performance lies in the architecture of the underlying servers and their ability to adapt to changes in demand, resource availability, as well as their ability to scale. We believe that the distributed and autonomous nature of this system is the key factor in achieving this.
A logical interface description language for components
Authors: Farhad Arbab, Marcello M. Bonsangue, Frank S. Boer
Venue:  (2000)

Motivated by our earlier work on the IWIM model and the Manifold language, in this paper, we attend to some of the basic issues in component-based software. We present a formal model for such systems, a formal-logic-based component interface description language that conveys the observable semantics of components, a formal system for deriving the semantics of a composite system out of the semantics of its constituent components, and the conditions under which this derivation system is sound and complete. Our main results in this paper are the theorems that formulate the notion of compositionality and the completeness of the derivation system that supports this property in a component-based system.
A CAD-Oriented Modeling Approach of Frequency-Dependent Behavior of Substrate Noise Coupling for Mixed-Signal IC Design
Authors: Hai Lan, Zhiping Yu, Robert W. Dutton
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

A simple, efficient CAD-oriented equivalent circuitmodeling approach of frequency-dependent behavior ofsubstrate noise coupling is presented. It is shown that thesubstrate exhibits significant frequency-dependentcharacteristics for high frequency applications usingepitaxial layers on a highly doped substrate. Using theproposed modeling approach, circuit topographiesconsisting of only ideal lumped circuit elements can besynthesized to accurately represent the frequencyresponse using y-parameters. The proposed model iswell-suited for use in standard circuit simulators. Theextracted model is shown to be in good agreement withrigorous 3D device simulation results.
Nonpreemptive scheduling algorithms for multimedia communication in local area networks
Authors: S. Eun, J. Kim, B. Kim, H. Yoon, S. R. Maeng
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

We consider a LAN-based multimedia information system like a Video On Demand (VOD) system that supports the retrieval of continuous media like motion video and sound. In the system, the server transmits the streams of continuous media on a shared communication channel while the continuity of multiple streams should be preserved. Several scheduling algorithms have been studied to guarantee the temporal constraints of time-critical messages, but there has been no study to schedule periodic transmission requests with variable bit rates (VBR), which results from the compression algorithms for motion video and sound. We suggest real-time scheduling algorithms that one is static and the other is dynamic, and an admission control algorithm to guarantee the delivery of continuous media. The characteristics of our algorithms are that it is nonpreemptive to save the overheads of preemption, and the static scheduling algorithm is proved to be optimal. It is shown through simulations that the performance of our dynamic scheduling algorithm is better than that of nonpreemptive Earliest Deadline First (EDF) algorithm, especially, under the assumption of variable bit rates
A Programmable Multicast Service in ATM
Authors: Hung Keng Pung, Naftali Bajrach
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

This paper presents a design and implementation of a ATM multicast service based on programmable and active network concepts. It aims to address the design and implementation issues of creating new network services - multicast in this case - through a set of Corba-based network interfaces, and with a java based user codes injection mechanism for supporting customization of network services. We demonstrate the feasibility of our prototype through the implementation of a wavelet video multicast application with active filters implanted at intermediate nodes for supporting heterogeneous receivers. The performance of the prototype over an ATM test-bed is measured and evaluated.
Blocking a transition in a free choice net and what it tells about its throughput
Authors: Bruno Gaujal, Stefan Haar, Jean Mairesse
Venue: Journal of Computer and System Sciences (2003)

In a live and bounded free choice Petri net, pick a non-conflicting transition. Then there exists a unique reachable marking in which no transition is enabled except the selected one. For a routed live and bounded free choice net, this property is true for any transition of the net. Consider now a live and bounded stochastic routed free choice net, and assume that the routings and the firing times are independent and identically distributed. Using the above results, we prove the existence of asymptotic firing throughputs for all transitions in the net. Furthermore, the vector of the throughputs at the different transitions is explicitly computable up to a multiplicative constant.