ppxscal/embedding_network huggingface dataset:
Bellman Functions on Trees for Segmentation, Generalized Smoothing, Matching Multi-Alignment in Massive Data Sets
Authors: Ilya Muchnik, Vadim Mottl
Venue:  (1998)

A massive data set is considered as a set of experimentally acquired values of a number of variables each of which is associated with the respective node of an undirected adjacency graph that presets the fixed structure of the data set. The class of data analysis problems under consideration is outlined by the assumption that the ultimate aim of processing can be represented as a transformation of the original data array into a secondary array of the same structure but with node variables of, generally speaking, different nature, i.e. different ranges. Such a generalized problem is set as the formal problem of optimization (minimization or maximization) of a real-valued objective function of all the node variables. The objective function is assumed to consist of additive constituents of one or two arguments, respectively, node and edge functions. The former of them carry the data-dependent information on the sought-for values of the secondary variables, whereas the latter ones are meant to express the a priori model constraints. For the case when the graph of the pair-wise adjacency of the data set elements has the form of a tree, an effective global optimization procedure is proposed which is based on a recurrent decomposition of the initial optimization problem over all the node variables into a succession of partial problems each of which consists in optimization of an intervening function of only one variable like Bellman functions in the classical dynamic programming. Two kinds of numerical realization of the basic optimization procedure are considered on the basis of parametric representation of the Bellman functions, respectively, for discretely defined and quadratic node and edge functions. The proposed theoretical approach to the analysis of massive data sets is illustrated with its applications to the problems of segmentation, smoothing, fine texture analysis and matching of visual images and geophysical explorative data, as well as to the problem of multi-alignment of long molecular sequences.
The Sky is Falling: The Strong Exponential Hierarchy Collapses
Authors: Lane A. Hemachandra
Venue:  (1986)

This paper investigates the complexity of the high levels of the exponential hierarchy [HY84,HIS85]: Are they hard, and if so why are they hard? We show that $P^{NE} = NP^{NE}$. From this we conclude that the strong exponential hierarchy collapses: $P^{NE} = NP^{NE} \bigcup NP^{NP^{NE}} \bigcup NP^{NP^{NP^{NE}}} \bigcup \cdots,$ where NE is nondeterministic exponential time. This suprising result, a nontrivial hierarchy collapse, is based on $P^{NE}$ overmastering the $NP^{NE}$ computation tree by computing better and better partial census information. We note why the combinatorics involved prevents us from similarly proving that the polynomial hierarchy collapses. Next we look at the exponential hierarchy, which is NE given a rich database: $NE \bigcup NE^{NP} \bigcup NE^{NP^{NP}} \bigcup \cdots$. We show that if the exponential hierarchy''s $\Delta_{i}$ and $\Sigma_{i}$ levels do separate, this is due not to the power of the database but to the extravagant number of queries NE makes to the database. Thus the high levels of the strong exponential hierarchy are no harder than the low levels. The high levels of the exponential hierarchy separate completely only if NE floods its database with queries. Extending our techniques, we derive sufficient conditions for collapsing complexity classes, and use them to generate strong new quantitative relativization results.
Extended Graph and Matrix Models for Network
Authors: David Richard
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

We present some extended graph and matrix models which are the basis of an interactive and graphical networks navigating method. Methods of how to make condensed graphs, matrix representations and how to navigate in large networks will be studied in details.
3D Trajectory Recovery for Tracking Multiple Objects and Trajectory Guided Recognition of Actions
Authors: Romer Rosales, Stan Sclaroff
Venue:  (1998)

Abstract A mechanism is proposed that integrates low-level (image processing), mid-level (recursive 3D trajectory estimation), and high-level (action recognition) processes. It is assumed that the system observes multiple moving objects via a single, uncalibrated video camera. A novel extended Kalman filter formulation is used in estimating the relative 3D motion trajectories up to a scale factor. The recursive estimation process provides a prediction and error measure that is exploited in higher-level stages of action recognition. Conversely, higher-level mechanisms provide feedback that allows the system to reliably segment and maintain the tracking of moving objects before, during, and after occlusion. The 3D trajectory, occlusion, and segmentation information are utlized in extracting stabilized views of the moving object. Trajectory-guided recognition (TGR) is proposed as a new and efficient method for adaptive classification of action. The TGR approach is demonstrated using ``motion history images'''' that are then recognized via a mixture of Gaussian classifier. The system was tested in recognizing various dynamic human outdoor activities; e.g., running, walking, roller blading, and cycling. Experiments with synthetic data sets are used to evaluate stability of the trajectory estimator with respect to noise.
Assuring Interoperability in Heterogeneous, Autonomous and Decentralized Multi-Agent Systems
Authors: Hiroki Suguri, Eiichiro Kodama, Masatoshi Miyazaki
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

Multi-agent systems are autonomous decentralized platform software on whih application programs such as business transactions, network provisioning and manufacturing control are deployed. In order for the applications to be truly autonomous and decentralized, however, heterogeneous multi-agent systems themselves must communicate and interoperate with each other. To solve the problem, we take a two-step approach. Firstly, message-level interoperability is achieved by a gateway agent that interconnects eterogeneous multi-agent systems. Secondly, higher-level interoperation of conversations, which consist of bi-(or multi-) directional streams of messages, is governed by interaction protocols. We demonstrate the concept and technique of dynamic negotiation of interaction protocols and show how the method improves the assurance of real-world applications in autonomous decentralized systems.
Integrated Computer Graphics Learning System in Virtual Environment - Case Study of Bézier, B-Spline, and NURBS Algorithms
Venue: Proceedings of the International Conference on Information Visualisation (2000)

The Web is a popular platform for training educators and learners in educational systems. We find several Web-based training systems that are developed by enterprises that try to train teachers and students to use Web technologies in educational settings.The rapid growth of the Internet and computer technology in recent years has sparked a demand for easily accessible and affordable learning solutions in corporate offices, classrooms, and homes. Traditional learning models being challenged by the fast-paced, real-time environments available today.The purpose of this paper is to apply systems design principles to the design of Web-based training systems for teachers and learners. Several issues will be addressed in this paper such as the development of an Integrated Learning Graphics System (ILGS) for a better learning environment.In this paper, we attempted to develop a web-based learning system of computer graphics by Bézier, B-spline and NURBS algorithms. The purpose of the research was to increase the effect of Computer-Aided Design (CAD) in network .The other advantages is that network browser is the common platform in internet and intranet, the graphics system can be portable cross different operating system, as like windows 95,linux. In fact, the graphics system was an attempt to be shared the resource each other.
A Comparison of Feature Sets and Neural Network Classifiers on a Bird Removal Approach for Wind Profiler Data
Authors: Ralf Kretzschmar, Hans Richner, Nicolaos B. Karayiannis
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

This paper presents the development of a neural-network-based bird removal approach for wind profiler data. Bird removal was attempted by training traditional feedforward neural networks (FFNNs) and quantum neural networks (QNNs) to identify and remove bird-contaminated data recorded by a 1290-MHz wind profiler. A series of experiments evaluated several sets of features extracted from wind profiler data, various FFNNs and QNNs of different sizes, and criteria employed for identifying birds in wind profiler data based on the outputs of the trained neural networks.
Colormap: A Color Image Quantizer
Authors: Adam Rosen
Venue:  (1987)

This paper is a preliminary report on color image quantization and the background, design and implementation of the colormap program. The purpose of colormap is to quantize 24-bit per pixel color images down to only 8 or 9 bits per pixel with minimal perceived image degradation. 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
Three-dimensional exponentially fitted conforming tetrahedral finite elements for the semiconductor continuity equations
Authors: Lutz Angermann, Song Wang
Venue: Applied Numerical Mathematics (2003)

This paper presents and analyzes an exponentially fitted tetrahedral finite element method for the decoupled continuity equations in the drift-diffusion model of semiconductor devices. This finite element method is based on a set of piecewise exponential basis functions constructed on a tetrahedral mesh. The method is shown to be stable and can be regarded as an extension to three dimensions of the well-known Scharfetter-Gummel method. Error estimates for the approximate solution and its associated flux density are given. These h-order error bounds depend on some first-order seminorms of the exact solution, the exact flux density and the coefficient function of the convection terms. A method is also proposed for the evaluation of terminal currents and it is shown that the computed terminal currents are convergent and conservative.
Content and Complexity: Information Design in Technical Communication
Authors: Michael J. Albers, Beth Mazur
Venue:  (2002)

:Content and Complexity: Information Design in Technical Communication explores both theoretical perspectives as well as the practicalities of information design in areas relevant to technical communicators. This integration of theoretical and applied components make it a practical resource for students, educators, academic researchers, and practitioners in the technical communication and information design fields.
First year programming: let all the flowers bloom
Authors: Raymond Lister, John Leaney
Venue: Proceedings of the fifth Australasian conference on Computing education - Volume 20 (2003)

We describe our criterion-referenced grading scheme for a first year programming subject, which has been designed to allow all participating students to achieve their full potential. Traditional norm-referenced grading schemes, where all students work on the same assessment tasks, result in tasks that may be effective for the middle-achieving student, but the tasks do not allow the weakest students to engage effectively, nor do these tasks stretch the strongest students. Our criterion-referenced scheme uses a mix of several assessment strategies to overcome this problem. The strategies have been used before in traditional assessment environments, but in isolation, whereas we combine the strategies into a coherent, explicit grading philosophy based on Bloom's taxonomy.
A Lagrangian for von Karman equations of large deflection problem of thin circular plate
Authors: Ji-Huan He
Venue: Applied Mathematics and Computation (2003)

By the semi-inverse method proposed by He, a Lagrangian is established for the large deflection problem of thin circular plate. Ritz method is used to obtain an approximate analytical solution of the problem. First order approximate solution is obtained, which is similar to those in open literature. By Mathematica a more accurate solution can be deduced.
Reasoning about Asynchronous Behaviour in Distributed Systems
Authors: Peter Henderson
Venue: Proceedings of the Eighth International Conference on Engineering of Complex Computer Systems (2002)

When a new component is added to an existing, distributedsystem, it has to co-operate with existing componentsin a way that doesn't interfere badly with the originalsystem. Adding new components to an existing system issimplified if their communication is asynchronous. It allowsfor looser coupling. Unfortunately, the fact that thecommunication between components is asynchronous addsto the difficulty of reasoning about their behaviour. Thispaper gives an illustrative example of a simple distributedsystem with asynchronous behaviour and discusses how itsbehaviour can be described and reasoned about in terms ofgoals. This formalises what we believe to be contemporaryengineering practice. Experimental support for reasoning,including animation, is particularly appropriate and practicalin these circumstances, because the properties which wemust reason about are emergent rather than compositional.
Practical C++ Programming, 2 edition
Authors: Steve Qualline
Venue:  (2003)

:C++ is a powerful, highly flexible, and adaptable programming language that allows software engineers to organize and process information quickly and effectively. But this high-level language is relatively difficult to master, even if you already know the C programming language. This new second edition of Practical C++ Programming is a complete introduction to the C++ language for programmers who are learning C++. Reflecting the latest changes to the C++ standard, this new edition takes a practical down-to-earth approach, placing a strong emphasis on how to design clean, useful code. In short, to-the-point chapters, all aspects of programming are covered, including style, software engineering, programming design, object-oriented design, and debugging. The book also covers common mistakes and how to find (and avoid) them. End-of-chapter exercises help you ensure that you've mastered the material.
Information Society - R&D challenges and opportunities
Authors: Mário Campolargo
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

The transition from an Industrial society to an Information Society represents a fundamental change in the way we live, learn, work and play. Information society technologies increasingly pervade all industrial and societal activities, accelerating the globalisation of economies. Europe's industrial competitiveness, its jobs, its quality of life and the sustainability of growth depend on it being at the leading edge of the development and take-up of information society technologies. The pace of development of the technologies vital to the creation of the information society is extremely fast. Advances in information processing and communications are opening up exciting new possibilities. There is a shift from stand-alone systems to networked information and processes. Digitalisation is resulting in the convergence of information processing, communications and media. Content is of increasing significance. Leveraging on this convergence of information, communication and networking technologies the recently launched Information Society Technologies IST Programme aims to help creating an information society for all by building a global knowledge, media and computing space supporting interoperable, dependable and affordable services and products with ubiquitous and seamless access. This presentation will first refer the strategic objectives of the IST Programme highlighting its integrated architecture and will then provide the audience with an overview of the workprogramme that will serve as a basis for the future work. Given the main topic of the conference (Autonomous Distributed Systems) particular attention will be given to topics related to the distributed communications infrastructure. The audience will therefore be exposed to major results achieved in Europe on the field of Open Architectures for the provision of advanced communications services.
A Short Course in Computational Molecular Biology
Authors: D. Durand, M. Farach, R. Ravi, M. Singh
Venue:  (1997)

The advent of recombinant DNA technology during the 1970s has led to an inundation of biological sequence data. The compilation and analysis of DNA and protein sequences is now a fundamental task in molecular biology requiring. Computational Molecular Biology is the field of computer science that has emerged to solve algorithmic problems in determining sequences and analyzing them. Specific research efforts in this area include sequencing and mapping, pairwise and multiple sequence comparison, protein structure determination and evolutionary tree reconstruction. Solutions to these problems contribute both to basic scientific research and product development in the biotechnology industry. We have designed a course to give a basic introduction to the major algorithmic research areas in computational biology.
Just-in-time: on strategy annotations
Authors: J. C. Pol
Venue:  (2001)

A simple kind of strategy annotations is investigated, giving rise to a class of strategies, including leftmost-innermost. It is shown that under certain restrictions, an interpreter can be written which computes the normal form of a term in a bottom-up traversal. The main contribution is a correctness proof of this interpreter. Furthermore, a default strategy is provided, called just-in-time, which satisfies the criteria for the interpreter. The just-in-time strategy has a better termination behaviour than innermost rewriting for many interesting examples.% 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
Quantifier Elimination in the First-Order Theory of Algebraically Closed Fields
Authors: Doug J. Ierardi
Venue:  (1988)

We consider the problem of deciding whether a set of multivariate polynomials with coefficients in any field $F$ have a common algebraic solution. In this paper we develop a fast parallel algorithm for solving this decision problem. Since the proposed algorithm is algebraic, it easily yields a procedure for quantifier elimination in the theory of an arbitrary algebraically closed field. More precisely, we show how to decide whether $m$ polynomials in $n$ variables, each of degree at most $d$, with coefficients in an arbitrary field $F$ have a common zero in the algebraic closure of $F$, using sequential time $m^{n + O(1)} d^{n^{2} + O(n)}$, or parallel time $O(n^{3} \log^{3} d \log m)$ with $m^{n + O(1)} d^{n^{2} + O(n)}$ processors, in the operations of the coefficient field $F$. Using randomization, this may be improved to $m^{O(1)} d^{O(n)}$ time. In addition, the construction is used give a direct EXSPACE algorithm for quantifier elimination in the theory of an algebraically-closed field, which runs in PSPACE or parallel polynomial time when restricted to formulas with a fixed number of alternations of quantifiers.
Improving Software Comprehension through an Automated Dependency Tracer
Authors: Anna Rita Fasolino, Giuseppe Vissaggio
Venue: Proceedings of the 7th International Workshop on Program Comprehension (1999)

This paper presents ANALYST, a tool that automates impact analysis by exploiting a framework that implements dependency based software representation models. The preliminary experimental results show that it supports the improvement of software representation models to be used in software comprehension. Moreover, the tool allows the maintainer to perform more accurate and correct changes, decreasing the software degradation effect. Finally, it is shown that the tool can be used as a general platform for experimenting with different impact analysis approaches, and for assessing and comparing their effectiveness with the use of suitable metrics.
International Metrics Database Opportunities & Future Directions
Authors: A. Abran
Venue: Proceedings of the 3rd International Software Engineering Standards Symposium (ISESS '97) (1997)

There is currently a lack of data available in the public domain for international benchmarking in relation to the productivity and quality of software development and maintenance products and processes. With the emergence of new international standards for software measurement, there is currently an opportunity to develop international software benchmarking repositories in which content quality would be controlled by independent organizations. Such types of repositories would allow transparency of the data collected, as well as consistency to the data registration procedures and adherence to international standards. Availability of benchmarking data in the public domain would also facilitate both industry comparisons, benchmarking at the organizational level as well as research access to robust industrial datasets. This Workshop aims to identify the current opportunities in terms of emerging standards, emerging international software benchmarking organizations in the public domain as well as related opportunities. It is hoped on the one hand that the existing components will be reviewed, improved and promoted, and on the other that missing components will be identified, clarified and specified. 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
An Alternative Differential Gradient Edge Contrast Operator Suitable for Use Within High Speed Pyramid--Based Imaging Systems
Authors: W. D. Toczyski, N. P. Papanikolopoulos
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

Numerous edge operators, kernels and directional filters have been proposed, and edge detection is a well--established and mature area of computer vision. Despite this, in developing a real--time, pyramid--based imaging system, inadequacies in the standard, commonly used techniques have lead us to implement an alternate set of simple directional filters that combine to act as an edge contrast operator fulfilling the familiar requirements for (1) speed, and (2) a high localization of response. Within our application, this operator set is proving superior to the classical kernels at preserving the key requirement (2) as the operator's edge response energies are propagated up to pyramid levels of lower resolution for further recursive processing. Our scheme is shown to provide a unified response to both step and line edge types, and acceptable responses in the presence of anticipated noise levels. The method is direct, of low complexity, and we hope of general utility.