ppxscal/embedding_network huggingface dataset:
How Do You Select A High Quality EDA Tool Flow?
Authors: Robert N. Blair, Jacques Benkoski
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

Over the last 10 years, Integrated circuits complexity has blossomed to the point where system time to market is critically dependant on IC "correctness" as intended by the "designer". In many cases, the "designer" is a team of engineers - not an individual, and the "tools" are a flow - not a series of point tools. To a first approximation, the industry wafer fabrication process has achieved a level of "correctness", or "quality" that exceeds that of the EDA tools being used to create and implement the IC design. Integrated EDA tools lag behind Moore's law, and are the primary cause of the "non-correctness" being experienced with many complex IC designs today. The EDA industry needs to unify behind new "high quality design flow" criteria that the user community believes in and can integrate into established system design environments. One of the critical issues facing the design community is how to select a high quality EDA design tool flow in this environment, and what should EDA tool providers do to close the gap with Moore's Law?
A Comparison of 2-D Visualizations of Hierarchies
Authors: Todd Barlow, Padraic Neville
Venue: Proceedings of the IEEE Symposium on Information Visualization 2001 (INFOVIS'01) (2001)

This paper describes two experiments that compare four two-dimensional visualizations of hierarchies: organization chart, icicle plot, treemap, and tree ring. The visualizations are evaluated in the context of decision tree analyses prevalent in data mining applications. The results suggest that either the tree ring or icicle plot is equivalent to the organization chart.
Late-breaking papers of EuroGP-99
Authors: William Langdon, Riccardo Poli, Peeter Nordin, Terry Fogarty
Venue:  (1999)

This booklet contains the late-breaking papers of the Second European Workshop on Genetic Programming (EuroGP''99) held in G\"oteborg Sweden 26--27~May~1999. EuroGP''99 was one of the EvoNet workshops on evolutionary computing, EvoWorkshops''99. The purpose of the late-breaking papers was to provide attendees with information about research that was initiated, enhanced, improved, or completed after the original paper submission deadline in December 1998. To ensure coverage of the most up-to-date research, the deadline for submission was set only a month before the workshop. Late-breaking papers were examined for relevance and quality by the organisers of the EuroGP''99, but no formal review process took place. The 3 late-breaking papers in this booklet (which was distributed at the workshop) were presented during a poster session held on Thursday 27 May 1999 during EuroGP''99. Authors individually retain copyright (and all other rights) to their late-breaking papers. This booklet is available as a technical report SEN-R9913 from the Centrum voor Wiskunde en Informatica, Kruislaan 413, NL-1098~SJ Amsterdam.
Convergence and comparison theorems for a generalized alternating iterative method
Authors: Joan-Josep Climent, Carmen Perea
Venue: Applied Mathematics and Computation (2003)

Using as a principal tool the convergence results of standard iterative process for the solution of linear systems, alternating iterative methods are studied. We extend the convergence theorem for the stationary alternating iterative method of Benzi and Szyld [Numererische Mathematik 76 (1997) 309], for weak nonnegative splittings of the first type of a monotone matrix to weak nonnegative splitting of the second type. On the other hand, we introduce a more general method, the nonstationary alternating iterative method, establishing convergence results for weak nonnegative splittings of a monotone matrix, and for P-regular splittings of a symmetric positive definite matrix.
Teach Yourself PowerPoint 2002 (The Teach yourself Series)
Authors: Chris Wright
Venue:  (2003)

:Teach Yourself PowerPoint 2002 is a comprehensive, jargon-free exploration of the Microsoft Office package suitable for beginners. With guidance for producing innovative and professional presentations, this book explains all aspects of PowerPoint 2002, from using the Microsoft wizards to creating Web pages.With examples and exercises, it gives readers the tools to run professional presentations locally or over the Internet, expanding their reach in an ever-expanding global communications network. 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 equidistant constant weight codes
Authors: Fang-Wei Fu, Torleiv Kløve, Yuan Luo, Victor K. Wei
Venue: Discrete Applied Mathematics (2003)

Equidistant constant weight codes are studied in this paper. The dual distance distribution of equidistant constant weight codes is investigated and used to obtain upper bounds on the size of such codes as well as equidistant codes in general.
Call Admission Control vs. Bandwidth Reservation: Reducing Handoff Call Dropping Rate and Providing Bandwidth Efficiency in Mobile Networks
Authors: Jianping Jiang, Ten-Hwang Lai
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

In mobile (wireless) networks, one major concern about quality of service (QoS) is call dropping, where a handoff call is dropped due to insufficient wireless resources. Previous research on this issue suggested to reserve a certain amount of bandwidth for handoff calls. While such reservation schemes can reduce call dropping rate, it is at the cost of low bandwidth efficiency. In this paper, we propose a new approach that combines dynamic channel allocation and call admission control for bandwidth management. Simulation studies show that the proposed approach is capable of keeping the call dropping rate below a pre-specified value while improving bandwidth utilization by 20% to 30%.
Two-Sided Hypotheses Generation for Abductive Analogical Reasoning
Authors: Akinori Abe
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

In general, if a knowledge base lacks the necessary knowledge, abductive reasoning cannot explain an observation. Therefore, it is necessary to generate missing hypotheses. CMS can generate missing hypotheses, but it can only generate short-cut hypotheses or hypotheses that will not be placed on real leaves. That is, the inference path is incomplete (truncated), so abduction is not complete. The inference proposed here tries to generate missing hypotheses that are placed on the middle of the inference path by both abductive inference and deductive inference using analogical mapping. As a result, the inference can generate missing hypotheses even on the middle of the inference path.
Problem of the Global Brain and Multi-Agent Modeling
Authors: Vladimir G. Red'ko
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

The report characterizes a problem of the global brain and approaches to global brain researches on the basis of multi-agent modeling.
Diagnosis of Regular Structures
Authors: Antonio Caruso, Stefano Chessa, Paolo Santi, Piero Maestrini
Venue:  (1999)

This paper introduces an efficient diagnosis algorithm for regular structures (EDARS). The algorithm provides a diagnosis which is correct, but possibly incomplete, if the cardinality of the actual fault set is below a ''syndrome-dependent bound'', asserted by the algorithm itself. The time complexity of EDARS is O(nt) when executed on t-regular structures of size n. The correctness and the degree of completeness of the diagnosis provided by EDARS, were evaluated by means of simulation. Grids, hypercubes and Cube-Connected Cycles (CCC) structures were considered. Simulation results with grid structures showed a strong influence of structure degree over diagnosis performance. Furthermore, comparisons of simulation results obtained with grids, hypercubes and CCCs of same size and degree, showed that diameter and bisection width also appear to influence the performance of EDARS, particularly with respect to diagnosis completeness
Confidence Modeling for Verification Post-Processing for Handwriting Recognition
Authors: John F. Pitrelli, Michael P. Perrone
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

We apply confidence-scoring techniques to verify the output of a handwriting recognizer. We evaluate a variety of scoring functions, including likelihood ratios and estimated posterior probabilities of correctness, in a post-processing mode to generate confidence scores at the character or word level. Using the post-processor in conjunction with an HMM-based on-line handwriting recognizer for large-vocabulary word recognition, receiver-operating-characteristic(ROC) curves reveal that our post-processor is able to reject correctly 90% of recognizer errors while only falsely rejecting 33% of correctly-recognized words. For isolated-digit recognition, we achieve a correct rejection rate of 90% while keeping false rejection down to 13%.
A competitive comparison of different types of evolutionary algorithms
Authors: O. Hrstka, A. Kučerová, M. Lepš, J. Zeman
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

This paper presents comparison of several stochastic optimization algorithms developed by authors in their previous works for the solution of some problems arising in Civil Engineering. The introduced optimization methods are: the integer augmented simulated annealing (IASA), the real-coded augmented simulated annealing (RASA) [10], the differential evolution in its original fashion developed by R. Storn and K. Price [15] and simplified real-coded differential genetic algorithm (SADE) [6]. Each of these methods was developed for some specific optimization problem; namely the Chebychev trial polynomial problem, the so called type 0 function and two engineering problems - the reinforced concrete beam layout and the periodic unit cell problem respectively. Detailed and extensive numerical tests were performed to examine the stability and efficiency of proposed algorithms. The results of our experiments suggest that the performance and robustness of RASA, IASA and SADE methods are comparable, while the DE algorithm performs slightly worse.
An Autoassociator for Automatic Texture Feature Extraction
Authors: S. Kulkarni, B. Verma
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

This paper presents an autoassociator neural network for texture feature extraction. Texture features are extracted through the hidden layer of an autoassociator.The Resilient Propagation (RP) algorithm was employed to train the autoassociator with the texture input and output patterns.The performance of the feature extractor was evaluated on Brodatz benchmark database.A detail analysis of the results is included. The results and analysis showed that the autoassociator is capable of extracting texture features better than the other traditional techniques.
Automatic gait recognition by symmetry analysis
Authors: James B. Hayfron-Acquah, Mark S. Nixon, John N. Carter
Venue: Pattern Recognition Letters (2003)

We describe a new method for automatic gait recognition based on analysing the symmetry of human motion using the Generalised Symmetry Operator. This approach is reinforced by the psychologists' view that gait is a symmetrical pattern of motion and results show that gait can indeed be recognised by symmetry analysis.
Coping with Uncertainty in Map Learning
Authors: Kenneth Basye, Thomas Dean, Jeffrey S Vitter
Venue:  (1989)

In many applications in mobile robotics, it is important for a robot to explore its environment in order to construct a representation of space useful for guiding movement. We refer to such a representation as a{\em map} and to the process of constructing a map from a set of measurements as {\em map learning}. In this paper, we develop a framework for describing map-learning problems in which the measurements taken by the robot are subject to known errors. We investigate two approaches to learning maps under such conditions: one based on Valiant''s{\em probably approximately correct} learning model, and a second based on Rivest \& Sloan''s {\em reliable and probably nearly almost always useful } learning model. Both methods deal with the problem of accumulated error in combining local measurements to make global inferences. In the first approach, the effects of accumulated error are eliminated by the use of reliable and probably useful methods for discerning the local properties of space. In the second, the effects of accumulated error are reduced to acceptable levels by repeated exploration of the area to be learned. Finally, we suggest some insights into why certain existing techniques for map learning perform as well as they do.
Method for designing and placing check sets based on control flow analysis of programs
Authors: S. J. Geoghegan, D. R. Avresky
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

Proposes a formal approach for adding fault detection to software. An assertion-based formalism is used to represent algorithm specifications. This representation is then used to generate a flowgraph or decision-to-decision graph (ddgraph), which is used to construct an execution path tree. The information gained from this algorithm representation is used to aid in the design of software-based fault tolerance techniques. Algorithm-based fault tolerance (ABFT) techniques are used to detect data structure-corrupting faults and checks are added to detect program flow errors. Flowgraph and ddgraph representations provide information to predict future program flow from the current flow. During execution, the current program location is recorded, along with the expected flow. Checks are placed to verify that the program flow follows the predicted flow. Fault coverage has been estimated through experiments with SOFIT (SOftware-based Fault Injection Tool), and the data is presented to demonstrate the effectiveness of the method.
Reliability of the Shuffle-Exchange Network and Its Variants
Authors: T J Blake, S K Trivedi
Venue:  (1987)

In this paper we consider the reliability of the Shuffle-Exchange multistage interconnection Network (SEN) and two variations of this network aimed at improving reliability through fault tolerance. These two variations are the SEN with an extra stage and the redundant SEN. We derive exact closed-form expressions for the time-dependent reliability of the $8$ x $8$ and $16$ x $16$ SEN and SEN with an extra stage (SEN+). Further, we derive a tight reliability lower bound that is useful for the analysis of larger networks. We provide numerical results for networks as large as $1024$ x $1024$. A comparison of these networks shows that on the basis of reliability the SEN+ is superior to the SEN and the redundant SEN.
Pollution modelling for Hong Kong downtown area using principal component analysis and artificial neural networks
Authors: W. Z. Lu, H. Y. Fan, A. Y. T. Leung, W. J. Wang, S. M. Lo, J. C. K. Wong
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

Modeling of the pollutants' concentrations comprises an important part in the field of atmospheric environment research. Neural network modeling is regarded as a reliable and cost-effective method to achieve such prediction task. In this paper, the principal component analysis (PCA) technique is used to reduce and orthogonalize input variables of neural network (NN) model, which is established for forecasting the pollutants' concentrations in downtown area of Hong Kong. The new approach is demonstrated and validated with two practical cases of predicting the respirable suspended particulate (RSP) levels in central area in Hong Kong. The simulation results show that the proposed method is feasible and efficient.
Construction of orthogonal bases for polynomials in Bernstein form on triangular and simplex domains
Authors: Rida T. Farouki, T. N. T. Goodman, Thomas Sauer
Venue: Computer Aided Geometric Design (2003)

A scheme for constructing orthogonal systems of bivariate polynomials in the Bernstein-Bézier form over triangular domains is formulated. The orthogonal basis functions have a hierarchical ordering by degree, facilitating computation of least-squares approximations of increasing degree (with permanence of coefficients) until the approximation error is subdued below a prescribed tolerance. The orthogonal polynomials reduce to the usual Legendre polynomials along one edge of the domain triangle, and within each fixed degree are characterized by vanishing Bernstein coefficients on successive rows parallel to that edge. Closed-form expressions and recursive algorithms for computing the Bernstein coefficients of these orthogonal bivariate polynomials are derived, and their application to surface smoothing problems is sketched. Finally, an extension of the scheme to the construction of orthogonal bases for polynomials over higher-dimensional simplexes is also presented.
MCAD Developing XML Web Services and Server Components with Visual C# .NET and the .NET Framework Exam Cram 2 (Exam Cram 70-320)
Authors: Hausman, Ed Tittel
Venue:  (2003)

:This certification exam measures the ability to develop and implement XML Web Services and server components using Visual C# and the Microsoft .NET Framework. This exam, released in September 2002, counts as a core credit toward the new MCAD (Microsoft Certified Application Developer) certification as well as a core credit toward the new MCSD .NET track. Readers preparing for this exam find the best-selling Exam Cram 2 series to be the smartest, most efficient way to become certified. Under the direction of Series Editor Ed Tittel, the leading authority on certification and the founder of The Exam Cram Method™ series, this book focuses exactly on what readers need to get certified now - featuring test-taking strategies, time-saving study tips, and a special Cram Sheet that includes tips, acronyms, and memory joggers that are not available anywhere else. After review by a panel of experts, Exam Cram 2 has received the distinction of Cramsession Approved Study Material. The accompanying CD-ROM features PrepLogic Practice Tests!
A stochastic uncoupling process for graphs
Authors: Stijn Dongen
Venue:  (2000)

\newcommand{\dpsd}{$\mathit{dpsd}$} A discrete stochastic uncoupling process for finite spaces is introduced, called the \emph{Markov Cluster Process} (MCL~process). The process takes a stochastic matrix as input, and then alternates flow expansion and flow inflation, each step defining a stochastic matrix in terms of the previous one. Flow expansion corresponds with taking the~$k^{th}$~power of a stochastic matrix, where~$k\in\N$. Flow inflation corresponds with a parametrized operator~$\Gamma_r$, $r\geq 0$, which maps the set of (column) stochastic matrices onto itself. The image~$\Gamma_r M$ is obtained by raising each entry in~$M$ to the~$r^{th}$~power and rescaling each column to have sum~$1$ again. In practice the process converges very fast towards a limit which is idempotent under both matrix multiplication and inflation, with quadratic convergence around the limit points. The limit is in general extremely sparse and the number of components of its associated graph may be larger than the number associated with the input matrix. This uncoupling is a desired effect as it reveals structure in the input matrix. The inflation operator~$\Gamma_r$ is shown to map the class of matrices which are diagonally similar to a symmetric matrix onto itself. The term \emph{diagonally positive semi-definite} (\dpsd) is used for matrices which are diagonally similar to a positive semi-definite matrix. It is shown that for $r\in\N$ and for~$M$ a stochastic \dpsd\ matrix, the image~$\Gamma_r M$ is again \dpsd. Determinantal inequalities satisfied by a \dpsd\ matrix~$M$ imply a natural ordering among the diagonal elements of~$M$, generalizing a mapping of nonnegative column allowable idempotent matrices onto overlapping clusterings. The spectrum of~$\Gamma_{\infty} M$, for \dpsd\ $M$, is of the form~$\{0^{n-k}, 1^k\}$, where~$k$ is the number of endclasses of the ordering associated with~$M$, and~$n$ is the dimension of~$M$. Reductions of \dpsd\ matrices are given, a connection with Hilbert''s distance and the contraction ratio defined for nonnegative matrices is discussed, and several conjectures are made. 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
Completeness of timed muCRL
Authors: Jan F Groote, M. A. Reniers, Jos J. Wamel, Mark B. Zwaag
Venue:  (2000)

We provide soundness and completeness results for the extension of muCRL with time put forward by Groote. The specification language muCRL has been designed especially to deal with data in a process algebraic context. Using the features for data, only a minor extension of the language was needed to obtain a very expressive variant of time. The main tool to establish the completeness result is a mapping of timed to untimed muCRL and employing the completeness results obtained for untimed muCRL.
On Irrelevance and Partial Assignments to Belief Networks
Authors: Solomon E. Shimony
Venue:  (1990)

We evaluate current methods for finding best consistent explanations. The only known general probabilistic scheme for finding a consistent explanation, that of complete MAPs, suffers from the over-specification problem. We propose a partial solution by applying a probabilistic generalization to logical irrelevance. We evaluate const-based abduction in a probabilistic context by providing a probabilistic semantics for it in the case of partial assignments.
Hand-OLAP: A System for Delivering OLAP Services on Handheld Devices
Authors: Alfredo Cuzzocrea, Filippo Furfaro, Domenico Saccà
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

The main drawbacks of handheld devices (small storage space small size of the displayscreen, discontinuance of the connection to the WLAN, etc.) are often incompatible with the need of querying and browsing information extracted from the enormous amount of data which are accessible through the network. In this application scenario the issues of compression and summarization of data have a leading role: data in a lossy compressed format can be transmitted more efficiently than original ones, and can be effectively stored in the handheld devices (setting the compression ratio accordingly). In this paper we describe avery effective compression technique for datacubes and the architecture of a system (based on this compression technique), called Hand-OLAP which allows a handheld device to extract and browse compressed information coming from an OLAP server distributed on a wired network.
The Relational Representation of Knowledge in an Intelligent Information System
Authors: Mark McLoughlin
Venue:  (1992)

An Intelligent Information System contains facts, constraints and rules. We investigate how a Conceptual Design including these three types of information can be stored in a relational database and then automatically translated into a working system based on a relational database. In particular, we show how a Conceptual Schema expressed using a combination of the NIAM notation and First Order Predicate Calculus can be stored in relational tables and then used to generate an SQL-based implementation of the design.