ppxscal/embedding_network huggingface dataset:
Polymorphic Unification of ML Typing
Authors: Paris C. Kanellakis, John C. Mitchell
Venue:  (1989)

We study the complexity of type inference for a core fragment of ML with lambda abstraction, function application, and the polymorphic let declaration. Our primary technical tool is the unification problem for a class of ``polymorphic'''' type expressions. This form of unification, which we call {\em polymorphic unification,} allows us to separate a combinatorial aspect of type inference from the syntax of ML programs. After observing that ML typing is in DEXPTIME, we show that polymorphic unification is PSPACE hard. From this, we prove that recognizing the typable core ML programs is also PSPACE hard. From this, we prove that recognizing the typable core ML programs is also PSPACE hard. Our lower bound stands in contrast to the common belief that typing ML programs is ``efficient,'''' and to practical experience which suggests that the algorithms commonly used for this task slow compilation substantially.
Experience in the design and implementation of an object-oriented network management system
Authors: E. Chan, C. Bloor
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

The design and implementation of network management systems is one of the first application areas in which the use of object-orientation was applied on a wide scale. A major reason is that resources that need to be managed in computer networks seem to map naturally into objects. However, network management systems which can deal with heterogeneous networks are very complex systems, and it is easy to end up with a large number of poorly designed objects instead of an integrated and effective system. This paper evaluates the weaknesses of some of the common object-oriented analysis techniques, and provide the outline of a methodology which will avoid some of these pitfalls in the design and implementation of an X.25 network management system based on an object-oriented database management system (OODBMS).
Unsupervised clustering with spiking neurons by sparse temporal coding and multi-layer RBF networks
Authors: S. M. Bohte, J. A. L Poutre, Joost N. Kok
Venue:  (2000)

We demonstrate that spiking neural networks encoding information in spike times are capable of computing and learning clusters from realistic data. We show how a spiking neural network based on spike-time coding and Hebbian learning can successfully perform unsupervised clustering on real-world data, and we demonstrate how temporal synchrony in a multi-layer network induces hierarchical clustering. We develop a temporal encoding of continuously valued data to obtain adjustable clustering capacity and precision with an efficient use of neurons: input variables are encoded in a population code by neurons with graded and overlapping sensitivity profiles. We also discuss methods for enhancing scale-sensitivity of the network and show how induced synchronization of neurons within early RBF layers allows for the subsequent detection of complex clusters.
Computational Neurobiology Meets Semiconductor Engineering
Authors: Dan Hammerstrom
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

Many believe that the most important result to come out of the last ten years of neural network research is the significant change in perspective in the neuroscience community towards a theory of computational neurobiology and functional neuro-models. Arriving on a fast moving train from the other direction is semiconductor technology, one of the greatest technology success stories of all time - transistors are now approaching deep submicron (less than 100 nanometers) in size, and we will soon be building silicon chips with over 1 billion transistors. The marriage of these two technologies is creating what Andy Grove (ex-CEO of Intel) refers to as a strategic inflection point. Although previous attempts at merging these technologies were premature, silicon and computational neurobiology are now merging to create an extremely powerful, and radically new form of computation.
Measuring the Behavior of a World-Wide Web Server
Authors: Jussara Almeida, Virgilio Almeida, David Yates
Venue:  (1996)

Abstract Server performance has become a crucial issue for improving the overall performance of the World-Wide Web. This paper describes Webmonitor, a tool for evaluating and understanding server performance, and presents new results for a realistic workload. Webmonitor measures activity and resource consumption, both within the kernel and in HTTP processes running in user space. Webmonitor is implemented using an efficient combination of sampling and event-driven techniques that exhibit low overhead. Our initial implementation is for the Apache World-Wide Web server running on the Linux operating system. We demonstrate the utility of Webmonitor by measuring and understanding the performance of a Pentium-based PC acting as a dedicated WWW server. Our workload uses a file size distribution with a heavy tail. This captures the fact that Web servers must concurrently handle some requests for large audio and video files, and a large number of requests for small documents, containing text or images. Our results show that in a Web server saturated by client requests, over 90% of the time spent handling HTTP requests is spent in the kernel. Furthermore, keeping TCP connections open, as required by TCP, causes a factor of 2-9 increase in the elapsed time required to service an HTTP request. Data gathered from Webmonitor provide insight into the causes of this performance penalty. Specifically, we observe a significant increase in resource consumption along three dimensions: the number of HTTP processes running at the same time, CPU utilization, and memory utilization. These results emphasize the important role of operating system and network protocol implementation in determining Web server performance.
Clustering Writing Styles with a Self-Organizing Map
Authors: Vuokko Vuori
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

This work shows how a Self-Organizing Map (SOM) can be applied in the analysis of different handwriting styles. The analyzed handwriting samples have been collected in on-line fashion with special writing equipments such as pressure sensitive tablets. The handwriting style of an individual subject is represented by a vector, components of which reflect the tendencies of the writer to use certain prototypical styles for isolated alphanumeric characters. This study shows that correlations between different writing styles, both character-wise and writer-wise can be found. Clusters of different personal writing styles can be found by studying the U-matrix viasualization of the SOM trained with data collected from over 700 subjects. An examination of the component planes of the SOM reveals some interesting correlations between the prototypical character styles.
Generating Levels of Detail for Large-Scale Polygonal Models
Authors: Varshney,  A, K P Agarwal, P F Brooks, V W Wright, Weber,  H
Venue:  (1995)

We present an efficient algorithm for generating various levels-of-detail approximations for a given polygonal model. Our algorithm guarantees that all points of an approximation are within a user-specifiable distance $\epsilon$ from the original model and all points of the original model are within a distance $\epsilon$ from the approximation. Each approximation attempts to minimize the total number of polygons required to satisfy the previous constraint. We show how the problem of generating levels-of-detail approximations reduces to the classic set partition problem. The various approximations are guaranteed to be topologically consistent with the input polygonal model. The approximations can be constrained by the user to preserve any desired edges of the input model. We also propose a method to compute an estimate of the quality of the approximation generated by our algorithm with respect to the optimal approximation satisfying the same constraints. We have implemented our algorithm and have obtained polygonal objects from a CAD model of a notional submarine.
Neural identification for critical flutter load of a polar-orthotropic annular plate
Authors: I. Takahashi
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

With increasing size and complexity of machines and vessels, the inverse problems of continuous bodies are becoming important. In this paper the possibility of using a Multilayer Perceptron Network trained with the Backpropagation Algorithm for detecting the critical flutter load of tapered annular plates is studied. The considered model is a polar-orthotropic plate, using a transfer matrix method, to estimate the changes in various modal parameters, caused by the shape parameters and support conditions of plates.
Stable Numerical Algorithms for Equilibrium
Authors: Stephen A. Vavasis
Venue:  (1992)

An equilibrium system (also known as a KKT system, a saddlepoint system, or a sparse tableau) is a square linear system with a certain structure. G. Strang has observed that equilibrium systems arise in optimization, finite elements, structural analysis, and electrical networks. Recently, G.W. Stewart established a norm bound for a type of equilibrium system in the case that the "stiffness" portion of the system is very ill-conditioned. In this paper, we investigate the algorithmic implications of Stewart''s result. We show that all standard textbook algorithms for equilibrium systems are unstable. Then we show that a certain hybrid method has the right stability property.
A Study On the Use of CDHMM for Large Vocabulary Offline Recognition of Handwritten Chinese Characters
Authors: Yong Ge, Qiang Huo
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

We've been investigating how to use Gaussian mixture continuous-density hidden Markov models (CDHMMs) for handwritten Chinese character modeling and recognition. We've identified and developed a set of techniques that can be used to construct a practical CDHMM-based offline recognition system for a large vocabulary of handwritten Chinese characters. We have reported elsewhere the key techniques that contribute to the high recognition accuracy. In this paper, we describe how to make our recognizer compactwithout sacrificing too much of the recognition accuracy. We also report the results of a series of experiments that were performed to help us make a good decision when we face several design choices.
Congestion at flow level and the impact of user behaviour
Authors: T. Bonald, J. W. Roberts
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

So-called elastic flows, corresponding to document transfers of various types, constitute the bulk of Internet traffic. This paper presents models of a single bottleneck link handling elastic traffic, accounting for random flow arrivals. The transport protocol and packet scheduling are taken into account approximately by assuming perfectly realized bandwidth sharing objectives.We refer to the demand as the product of the flow arrival rate and the average flow size. It is shown that per-flow throughput performance is generally satisfactory as long as demand is only slightly less than capacity. In overload, on the other hand, some flows must be abandoned. A fraction of link bandwidth is then wasted and performance critically depends on user behaviour. The models are useful in appraising the effectiveness of proposed schemes for Internet service differentiation.
Box Consistency through Weak Box Consistency
Authors: Laurent Granvilliers, Frédéric Goualard, Frédéric Benhamou
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

Interval constraint solvers use local consistencies---among which one worth mentioning is box consistency---for computing verified solutions of real constraint systems. Though among the most efficient ones, the algorithm for enforcing box consistency suffers from the use of time-consuming operators. This paper first introduces box varphi consistency, a weakening of box consistency; this new notion then allows us to devise an adaptive algorithm that computes box consistency by enforcing box varphi consistency, decreasing the varphi parameter as variables' domains get tightened, then achieving eventually box0 consistency, which is equivalent to box consistency. A new propagation algorithm is also given, that intensifies the use of the most contracting pruning functions based on box varphi consistency. The resulting algorithm is finally shown to outperform the original scheme for enforcing box consistency on a set of standard benchmarks.
The Use of Lemmas in the Model Elimination Procedure
Authors: L O Astrachan, W D Loveland
Venue:  (1993)

When the Model Elimination (ME) procedure was first proposed, a notion of lemma was put forth as a promising augmentation to the basic complete proof procedure. The lemmas that are used are also discovered by the procedure in the same proof run. Several implementations of ME now exist but only a 1970''s implementation explicitly investigated the lemma mechanism, with indifferent results. We report on the METEOR implementation of ME and its very successful use of lemmas. Indeed, many theorems have been proven by METEOR that have not been established by any other ME prover, and that are inaccessible to METEOR without the lemma device. We discuss several of the most difficult theorems, at the edge of capability of any uniform general-purpose theorem prover: two theorems regarding continuous functions and a logic challenge problem. The examples differ substantially in the role lemmas play in the proof, and help illustrate the potential and the problems in using this clearly powerful tool.
A sockets-based implementation of hardware and software co-design
Authors: A. Herbert
Venue: Proceedings of the 1996 IEEE International Verilog HDL Conference (IVC '96) (1996)

The EDA community has provided the tools to automate and accelerate much of the IC design process. However, the development of large ICs still remains expensive and complex. One of the biggest development risks lies in the area of design completeness-that the design will not support all target applications. Design verification tends to be ad hoc, with engineers focusing on verifying the designed functionality with no systematic approach toward verifying all possible applications. This results in partial verification. Design oversights that escape to the IC's prototype stage add time and cost to the project. Clearly, a benefit will result from integration of the end user into the earliest parts of the design cycle. By enabling end users to explore the design space, a more robust design can be yielded.
Important aspect of knowledge management
Authors: Hermann Maurer
Venue: Computer Science in Perspective: Essays Dedicated to Thomas Ottmann (2003)

In this paper it is explained what Knowledge Management (KM) is and why it will play an important role in the future. This implies that KM is indeed more than just the sophisticated use of information systems or distributed databases for complex tasks. With the introduction of the Maurer-Tochtermann model for KM and the description of the basic elements of new techniques, it can be demonstrated quite readily that KM is indeed something fundamentally new. At the end of this paper a system developed in Europe called Hyperwave will be mentioned briefly as perhaps being the leading example of this new type of software, i.e. software for KM systems.
Broadcast Anti-Jamming Systems
Authors: Y. Desmedt, R. Safavi-Naini, H. Wang, C. Charnes, J. Pieprzyk
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

In a traditional anti-jamming system a transmitter who wants to send a signal to a single sender spreads the signal power over a wide frequency spectrum with the aim of stopping a jammer from blocking the transmission. In this paper we consider the case that there are multiple receivers and the sender wants to broadcast a message to all receivers such that colluding groups of receivers cannot jam the reception of any other receiver. We propose efficient coding methods that achieve this goal and link this problem to well known problems in combinatorics. We also link a generalization of this problem to the Key Distribution Pattern problem studied in combinatorial cryptography.
Uses of Generics in Ada
Authors: Mark Sherman
Venue:  (1986)

This paper discusses how Ada generic procedures and packages can be used in novel ways to provide general initialization of records, expressions using discriminants, record field hiding and explicit control of parameter binding.
Efficient admission control for EDF scheduler with statistical QoS guarantee
Authors: Yinggang Xie, Tao Yang
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

We study the admission control problem at an earliest deadline first (EDF) link scheduler where multiple quality of service (QoS) requirements are supported statistically. It is shown that, if the aggregate QoS requirement of the aggregate traffic is guaranteed, the individual QoS requirements can also be guaranteed using an optimal discarding policy when the traffic flows are equally demanding. Therefore the problem is reduced to one with single traffic stream and a single QoS requirement. We adopt the stationary Gaussian approximation method and present a simple formula, referred to as the weighted Gaussian method, to estimate the minimum bandwidth requirement. Efficient admission control algorithms can be readily constructed based on the weighted Gaussian method. Numerical results are presented to show its advantages and limitations.
Photoshop Elements 2 from Zero to Hero, 1 edition
Authors: Tom Arah, Adam Juniper, Barry Beckham, Todd Pierson, Paul Shipley
Venue:  (2002)

:Special Offer: Register your copy with the friendsofED.com site for a $5 rebate. You have the creativity. We can unlock it. From absolute beginner to Photoshop Elements master a come with us on a journey from Zero to Hero. Starting with the basics, this book gets you up and running in Photoshop quicker than you thought possible. Chapter Zero shows you around the program, so you can skip ahead and produce the results you really want. Fast. Zero to Hero doesn't stop there. We also devote space to four Photoshop heroes, who share their skills and creativity. Within these pages, you'll find easy-to-follow, fully illustrated solutions to all the common, and not-so-common, problems that photographs present: - Convincingly correct bad lighting in seconds - Swap people and objects from other photos - Combine amazing effects for artistic results - Add stylish captions and shapes - Animate your graphics In the 96-page, full color section at the back of the book, the heroes reveal their projects in depth, sharing tips and tricks on the whole creative cycle, from shooting your photos right through to the finished article. Packed with added insight, and backed up by free technical support, this book will give you the knowledge, and the inspiration, to be a Photoshop Elements 2 hero.
Movement and memory function in biological neural networks
Authors: N. Ishii, K. Naka
Venue: Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95) (1995)

Asymmetrical neural networks are shown in a biological neural network, the catfish retina. Several mechanisms have been proposed for the detection of motion in biological system. Hassenstein and Reichardt network (1956) and Barlow and Levick network (1965) of movements are similar to the asymmetrical network developed here. To make clear the difference among these asymmetrical networks, we applied nonlinear analysis developed by N. Wiener. Then, we can derive the /spl alpha/-equation of movement, which shows the direction of movement. During the movement, we also can derive the movement equation, which implies that the movement holds regardless of the parameter /spl alpha/. By analyzing the biological asymmetric neural networks, it is shown that the asymmetric networks are excellent in the ability of spatial information processing on the retinal level. The symmetric network was discussed by applying nonlinear analysis. In the symmetric neural network, it was suggested that memory function is needed to perceive the movement.
Use of Software Engineering Standards in Teaching
Authors: V. Jovanovic, L. Andres, B. Sherlund
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

This paper presents a first draft of a model for the transfer of best practices as represented by Software Engineering Standards (SES) into university courses. Discussion of mechanisms for their use in the educational process (and the selection of standards actually used at the University of Detroit Mercy graduate program in Software Management) are presented as an example of the extensive possibilities for the implementation of a model. Current work on an IEEE SES sponsored survey of software related programs, aimed at assessing the use of software standards in education, is also illustrated.
On the direction of fibring feature logics with concatenation logics
Authors: Nissim Francez
Venue:  (1997)

A dual-fibring of a feature-logic and a concatenation-logic is proposed, in which syntactic categorial types ``live in'''' feature terms, in contrast to current fibring, in which feature-terms ``live in'''' types. The dual-fibring contains also arrow-introduction rules for hypothetical reasoning. It is used to explain some ``privileged features'''' in HPSG and their non-unification manipulation.
A Modular Implementation of Partial Evaluation
Authors: Christopher Colby, Peter Lee
Venue:  (1992)

Charles Consel and Siau Cheng Khoo have developed a technique for parameterizing partial evaluation and binding-time analysis with respect to abstract domains. We have found the modules system of Standard ML to be a useful vehicle for implementing a similar parameterization technique. Furthermore, the ability to parameterize binding-time analysis indicates that the technique may be useful for implementations of collecting interpretations in general. This paper describes our implementation of parameterized partial evaluation, with a particular focus on the use of the Standard ML modules system.
QoS routing algorithms for pre-computed paths
Authors: C. Pornavalai, G. Chakraborty, N. Shiratori
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

Routing with multiple QoS constraints is known to be a NP-complete problem. In our previous work (QoSR/sub BF/ algorithm), we have shown that, for a number of specific QoS constraints, this problem can be solved in polynomial time, when a weighted fair queueing (WFQ) service discipline is employed. QoSR/sub BF/ is an on-demand algorithm. We propose a number of QoS routing algorithms for pre-computed paths, when all or some of the flow specification parameters and the amount of bandwidth that has to be reserved are not known a priori. We also show that the size of the routing table could be reduced, as paths satisfying some conditions could be neglected.