ppxscal/embedding_network huggingface dataset:
Seed accumulating sequential estimation for PN Sequence acquisition at low signal-to-noise ratio
Authors: Seokho Yoon, Iickho Song, Sun Yong Kim
Venue: Signal Processing (2002)

The sequential estimation (SE) proposed by Ward for rapid acquisition of pseudo-noise (PN) sequences performs well only at moderate chip signal-to-noise ratios (SNRs). In this paper, a seed accumulating sequential estimation (SASE) method based on accumulated seeds of the received PN sequence is proposed, which performs well at low chip SNR also. The mean acquisition time performance of the SASE method is investigated. Numerical results show that the SASE performs dramatically better than the SE at low chip SNR and the improvement becomes larger as the period of PN sequence increases.
On a Particular Class of Minihypers and Its Applications. I. The Result for General q
Authors: P. Govaerts, L. Storme
Venue: Designs, Codes and Cryptography (2003)

This article is the first in a series of three articles that discuss a particular class of minihypers and its applications. Proving that for small &delta; and &mu; < N, a &lcub;&delta;v&mu; + 1, &delta;v&mu;&semi; N, q&rcub;-minihyper consists of a sum of &delta; &mu;-spaces, we show that the excess points of an s-cover with excess &delta; of PG(N, q), (s + 1)&verbar;(N + 1), form a sum of &delta; s-spaces, and that no maximal partial s-spreads with deficiency &delta; of PG(N, q), (s + 1)&verbar;(N + 1), exist. The case q square will be studied in greater detail in &lsqb;7&rsqb; and further applications of these classification results on this class of minihypers will be published in &lsqb;8&rsqb;.
Contour Line and Geographic Feature Extraction from USGS Color Topographical Paper Maps
Authors: Alireza Khotanzad, Edmund Zink
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

This paper presents a method for the extraction of contour lines and other geographic information from scanned color images of topographical maps. Although topographic maps are available from many suppliers, this work focuses on United States Geological Survey (USGS) maps. The extraction of contour lines, which are shown with brown color on USGS maps, is a difficult process due to aliasing and false colors induced by the scanning process and due to closely spaced and intersecting/overlapping features inherent to the map. These difficulties render simple approaches such as clustering ineffective. The proposed method overcomes these difficulties using a multistep process. First, a color key set, designed to comprehend color aliasing and false colors, is generated using an eigenvector line-fitting technique in RGB space. Next, area features, representing vegetation and bodies of water, are extracted using RGB color histogram analysis in order to simplify the next stage. Then, linear features corresponding to roads and rivers including contours, are extracted using a valley seeking algorithm operating on a transformed version of the original map. Finally, an A* search algorithm is used to link valleys together to form linear features and to close the gaps caused by intersecting features. The performance of the algorithm is tested on a number of USGS topographic map samples.
Essential arities in algebras of finite type and arity trees
Authors: Andrzej Kisielewicz, Jerzy Tomasik
Venue: Discrete Mathematics (2002)

Given an algebra A, S(A) denotes the set of those nonnegative integers n for which there is a nontrivial essentially n-ary term operation in A. Questions concerning the set S(A) for various types of algebras were raised in the early 1960s. Among still open questions, one of the most important is the problem of characterizing the sets S(A) for algebras of finite type. In this paper we give a characterization of these sets in terms of the so-called arity trees. Using this we prove several concrete results and formulate some particular questions of a combinatorial nature, which seems especially interesting in this connection.
Consumer Applications: A Driving Force for High-Level Synthesis of Signal-Processing Architectures
Authors: Rob Woudsma, Jef L. van Meerbergen
Venue: IEEE Micro (1992)

An overview of design alternatives for the translation of signal processing systems into silicon addresses for digital signal processing in consumer applications is presented. Since the most appropriate approach varies with the life-cycle phase of the application, the alternatives range from general-purpose to application-specific approaches. The architectures of the Piramid compiler, which supports digital audio, low-end digital video, telecommunications, speech processing, and control applications, and the Phideo compiler, which supports digital video applications such as HDTV in which sampling rates typically approach the maximum feasible clock rates in state-of-the-art CMOS fabrication processes, are discussed.
Delivering power with minimal restraint: APL and the web
Authors: David Mitchell
Venue: ACM SIGAPL APL Quote Quad (2002)

Networked computers have been used for over 30 years. APL has been part of that environment from the beginning. One key value APL has always provided is the ability for individuals and groups to be independent of complex, centralized administration.Today, APL continues to excel in that role. New technologies often require centralized administration of services such as Web page development and publishing, report printing and distribution, Web based interactive applications and Web enabled data delivery.We have been able to provide these types of services in a way that allows users connected worldwide to a singe APL system to develop, test and distribute data and applications with a minimum of overhead and central control. This paper will discuss four areas of services and several applications in each area.The four areas are:1. Web Mapped APL Files.These allow any user that can create and manage an APL file to create a Web site and distribute non-interactive data.2. Global Print Distribution via FTP.This facility allows any network user to define their PC, Workstation or Server to the APL FTP delivery system. Once defined, reports can be automatically FTPed to their PC from any corporate network host, not just the APL host.3. Parameterized Interactive Web Applications.This is a Web metasystem that allows any APL user to define an interactive Web site using a centralized Web server based in APL. Once the initial registration is complete, the user is free to change or expand their web application using simple, but powerful tools.4. Application-to-Application Systems.These are applications that require custom software on both the server and client systems. These offer the most tailored user interface, but require the most sophisticated programming, in general.
The Microprocessor's Impact on Society
Authors: John Markoff
Venue: IEEE Micro (1996)

Today, we literally swim in a sea of silicon. There are dozens of chips in every car and dozens in every office. Microprocessors in the form of watches, pagers, cellular phones, and Sharp Wizard's adorn our bodies as jewelry. Beyond embedded systems, the rapid rise of the Internet now appears to be on the verge of ensuring that the personal computer truly becomes ubiquitous. Where in the past PCs have been concentrated in the workplace and scattered in the homes of the wealthier third of American society, the Internet is almost certain to lower the final obstacles and make it possible to create a new class of information appliances that will extend the reach of the Net until it matches that of television or the telephone. Microprocessors are everywhere, but how is modern life different? In many areas the advent of microelectronics obviously does have clear benefits. That can be seen in the effect of computing technology on the disabled; the transformation of certain kinds of boring and dangerous manual labor; advances in medical technology and weather forecasting. Indeed the easy answer is that microprocessors have transformed modern society. They affect the way we work and play, the way we travel and communicate. They offer remarkable processing power at infinitesimal cost.
Knowledge Representation Using Fuzzy Petri Nets-Revisited
Authors: T. v. Manoj, John Leena, Rajan B. Soney
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

In the paper entitled "Knowledge Representation Using Fuzzy Petri Nets" [1], Chen, Ke, and Chang proposed an algorithm which determines whether there exists an antecedent-consequence relationship from a fuzzy proposition ds to proposition dj and if the degree of truth of proposition ds is given, then the degree of truth of proposition dj can be evaluated. The fuzzy reasoning algorithm proposed in [1] was found not to be working with all types of data. Here we propose 1) a modified form of the algorithm, and 2) concept of hierarchical Fuzzy Petri Nets for data abstraction.
Parallel Dynamic Programming
Authors: S. H. S. Huang, H. Liu, V. Viswanathan
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

Recurrence formulations for various problems, such as finding an optimal order of matrixmultiplication, finding an optimal binary search tree, and optimal triangulation of polygons, assume a similar form. A. Gibbons and W. Rytter (1988) gave a CREW PRAM algorithm to solve such dynamic programming problems. The algorithm uses O(n/sup 6//log n) processors and runs in O(log/sup 2/ n) time. In this article, a modified algorithm is presented that reduces the processor requirement to O(n/sup 6//log /sup 5/n) whilemaintaining the same time complexity of O(log/sup 2/ n).
Efficient Path Selection for Delay Testing Based on Path Clustering
Authors: Seiichiro Tani, Mitsuo Teramoto, Tomoo Fukazawa, Kazuyoshi Matsuhiro
Venue: Journal of Electronic Testing: Theory and Applications (1999)

In this paper, we introduce a way of modeling the differences between the calculated delays and the real delays, and propose an efficient path selection method for path delay testing based on the model. Path selection is done by judging which of two paths has the larger real delay by taking into account the ambiguity of calculated delay, caused by imprecise delay modeling as well as process disturbances. In order to make precise judgment under this ambiguity, the delays of only the unshared segments of the two paths are evaluated. This is because the shared segments are presumed to have the same real delays on both paths.The experiments used the delays of gates and interconnects, which were calculated from the layout data of ISCAS85 benchmark circuits using a real cell library. Experimental results show the method selects only about one percent of the paths selected by the most popular method.
Algorithms for Finding Attribute Value Group for Binary Segmentation of Categorical Databases
Authors: Yasuhiko Morimoto, Takeshi Fukuda, Takeshi Tokuyama
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

We consider the problem of finding a set of attribute values that give a high quality binary segmentation of a database. The quality of a segmentation is defined by an objective function suitable for the user's objective, such as "mean squared error," "mutual information," or "\chi^2," each of which is defined in terms of the distribution of a given target attribute. Our goal is to find value groups on a given conditional domain that split databases into two segments, optimizing the value of an objective function. Though the problem is intractable for general objective functions, there are feasible algorithms for finding high quality binary segmentations when the objective function is convex, and we prove that the typical criteria mentioned above are all convex. We propose two practical algorithms, based on computational geometry techniques, which find a much better value group than conventional heuristics.
Learning in an Introductory Expert Systems Course
Authors: David Warman, Kenneth L. Modesitt
Venue: IEEE Expert: Intelligent Systems and Their Applications (1989)

The first author, a graduate student in computer science, had just completed an introductory knowledge-based systems course taught by the other, a professor of computer science, when they read a recent IEEE Expert article title, 'Teaching an Introductory Course in Expert Systems' (p.59-63, Winter 1986). Because their respective experiences differed substantially from those of the authors of the above article, they describe such a course here as seen primarily through the eyes of the learner. The present authors provide two distinct perspectives. The first shares the student's background, motivations, and expectations, leading to a discussion of what he learned and did not learn during the course. The second (the professor's) comments on overall project and course results, including lessons learned by the professor.
Randomized Algorithms: A System-Level, Poly-Time Analysis of Robust Computation
Authors: Cesare Alippi
Venue: IEEE Transactions on Computers (2002)

This paper provides a methodology for analyzing the performance degradation of a computation once affected by perturbations. The suggested methodology, by relaxing all assumptions made in the related literature, provides design guidelines for the subsequent implementation of complex computations in physical devices. Implementation issues, such as finite precision representation, fluctuations of the production parameters, and aging effects, can be studied directly at system level, independently from any technological aspect and quantization technique. Only the behavioral description of the computational flow, which is assumed to be Lebesgue measurable and the architecture to be investigated are needed. The suggested analysis is based on the recent theory of Randomized Algorithms, which transforms the computationally intractable problem of robustness investigation in a poly-time algorithm by resorting to probability.
Simulating and visualising spray deposition on plant canopies
Authors: Jim Hanan, Michael Renton, Emily Yorston
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

Modelling and visualisation can provide valuable insights into the chaotic system in operation when farmers spray their crops. L-system models of maize plant development provide a platform for simulation of spray dynamics in the crop. Particle systems capture spray droplet flight, impact and splash. Visualisations will lead to better understanding of the spray-canopy interface.
Reachability in contextual nets
Authors: Józef Winkowski
Venue: Fundamenta Informaticae (2002)

Contextual nets, or Petri nets with read arcs, are models of concurrent systems with context dependent actions. The problem of teachability in such nets consists in finding a sequence of transitions that leads from the initial marking of a given contextual net to a given goal marking. The solution to this problem that is presented in this paper consists in constructing a finite complete prefix of the unfolding of the given contextual net, that is a finite prefix in which all the markings that are reachable from the initial marking are present, and in searching in each branch of this prefix for the goal marking by solving an appropriate linear programming problem.
Operational Prototyping: A New Development Approach
Authors: Alan M. Davis
Venue: IEEE Software (1992)

The two traditional types of software prototyping methods, throwaway prototyping and evolutionary prototyping, are compared, and prototyping's relation to conventional software development is discussed. Operational prototyping, a method that combines throwaway and evolutionary prototyping techniques by layering a rapid prototype over a solid evolutionary base, is described. Operational prototyping's implications for configuration management, quality assurance, and general project management are reviewed. The application of operational prototyping to a prototype ocean surveillance terminal is presented.
Probabilistic methods for centroidal Voronoi tessellations and their parallel implementations
Authors: Lili Ju, Qiang Du, Max Gunzburger
Venue: Parallel Computing (2002)

Centroidal Voronoi tessellations (CVTs) are Voronoi tessellations of a region such that the generating points of the tessellations are also the centroids of the corresponding Voronoi cells. In this paper, some probabilistic methods for determining CVTs and their parallel implementations on distributed memory systems are presented. By using multi-sampling in a new probabilistic algorithm we introduce, more accurate and efficient approximations of CVTs are obtained without the need to explicit construct Voronoi diagrams. The new algorithm lends itself well to parallelization, i.e., near prefect linear speed up in the number of processors is achieved. The results of computational experiments performed on a CRAY T3E-600 system are provided which illustrate the superior sequential and parallel performance of the new algorithm when compared to existing algorithms. In particular, for the same amount of work, the new algorithms produce significantly more accurate CVTs.
Design Automation Systems in Japan
Authors: Tsuneta Sudo
Venue: IEEE Design Test (1988)

A brief historical overview is given of computer-aided design of integrated circuits. Layout strategies are examined, with emphasis on the hierarchical approach, which is the one most commonly adopted for semicustom LSIs. Functional and logic design are discussed, covering languages, logic synthesis, and hardware. A design example is presented to illustrate the use of the advanced tools discussed.
Simulation of terrace wall methane-steam reforming reactors
Authors: J. S. Soltan Mohammadzadeh, A. Zamaniyan
Venue: Iranian Journal of Science and Technology (2002)

Terrace wall arrangement is one of the most common arrangements for methane-steam reforming reactor furnaces. In this work, a mathematical model of heat transfer in terrace wall furnaces has been developed. The model has been coupled with a reliable chemical reaction model to predict the behavior of an industrial steam-reforming reactor. The heat transfer model is similar to the zone method models, which considers heat conduction of the furnace walls in addition to the convective and radiative heat transfer. Among different operating variables, the effect of thermal conductivity of the furnace wall and the height of the burners on the performance of the reactor have been also studied.
Analysis and Comparison of Declustering Schemes for Interactive Navigation Queries
Authors: Chung-Min Chen, Rakesh K. Sinha
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

Declustering schemes enable parallel retrievals of raster-spatial data by allocating data among multiple disks. Previous work in the literature has focused on static range queries. In this paper, we focus on interactive navigation queries, which exhibit a new class of data access patterns. We analyze and compare the performance of previously known declustering schemes from the perspective of navigation queries. These schemes include a class of latin-square-based schemes, Disk Modulo, Fieldwise Exclusive-OR, Hilbert Curve Allocation Method, and a random assignment scheme. We show that, unlike the case of range queries, disk modulo outperforms other schemes and gives nearly optimal performance for navigation queries. In addition, we propose a new scheme under the constraint of bounded window size¿a common constraint in practice due to resource limitation such as monitor resolution or memory size. Through extensive analysis, we establish guidelines on how these schemes can be tuned to provide guaranteed performance under the constraint of bounded window size.
A Roadmap of Agent Research and Development
Authors: Nicholas R. Jennings, Katia Sycara, Michael Wooldridge
Venue: Autonomous Agents and Multi-Agent Systems (1998)

This paper provides an overview of research and development activities in the field of autonomous agents and multi-agent systems. It aims to identify key concepts and applications, and to indicate how they relate to one-another. Some historical context to the field of agent-based computing is given, and contemporary research directions are presented. Finally, a range of open issues and future challenges are highlighted.
Distributed interacting multipattern data association for multiplatform target tracking
Authors: Lang Hong
Venue: Signal Processing (2002)

A distributed interacting multipattern data association tracking algorithm is developed in this paper. Multipattern data association is based on a novel approach for tracking multiple targets using multiple patterns extracted from measurement sequences. A Markov chain controls the switching behavior of multipatterns, which allows an interacting operation of multipatterns. To save the communication bandwidth, the distributed interacting multipattern data association tracking algorithm is based on exchanges of combined target tracks, which creates a unique difficulty in developing an optimal fusion algorithm. The difficulty is overcome by developing equivalent platform and global models which then propagate the fused tracks needed for the distributed fusion algorithm.
Edge Detection and Surface Reconstruction Using Refined Regularization
Authors: M. Gökmen, C. C. Li
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

An edge detection and surface reconstruction algorithm in which the smoothness is controlled spatially over the image space is presented. The values of parameters in the model are adaptively determined by an iterative refinement process; hence, the image-dependent parameters such as the optimum value of the regularization parameter or the filter size are eliminated. The algorithm starts with an oversmoothed regularized solution and iteratively refines the surface around discontinuities by using the structure exhibited in the error signal. The spatial control of smoothness is shown to resolve the conflict between detection and localization criteria of edge detection by smoothing the noise in continuous regions while preserving discontinuities. The performance of the algorithm is quantitatively and qualitatively evaluated on real and synthetic images, and it is compared with those of Marr-Hildreth and Canny edge detectors.
Recovery from Malicious Transactions
Authors: Paul Ammann, Sushil Jajodia, Peng Liu
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Preventive measures sometimes fail to deflect malicious attacks. In this paper, we adopt an information warfare perspective, which assumes success by the attacker in achieving partial, but not complete, damage. In particular, we work in the database context and consider recovery from malicious but committed transactions. Traditional recovery mechanisms do not address this problem, except for complete rollbacks, which undo the work of benign transactions as well as malicious ones, and compensating transactions, whose utility depends on application semantics. Recovery is complicated by the presence of benign transactions that depend, directly or indirectly, on the malicious transactions. We present algorithms to restore only the damaged part of the database. We identify the information that needs to be maintained for such algorithms. The initial algorithms repair damage to quiescent databases; subsequent algorithms increase availability by allowing new transactions to execute concurrently with the repair process. Also, via a study of benchmarks, we show practical examples of how offline analysis can efficiently provide the necessary data to repair the damage of malicious transactions.