the proceedings contains 31 papers from the IFIP Formal Description Techniques conference. Topics discussed include network protocols;formal languages;telephone switch recovery procedures;software engineering;multimed...
详细信息
ISBN:
(纸本)0444892826
the proceedings contains 31 papers from the IFIP Formal Description Techniques conference. Topics discussed include network protocols;formal languages;telephone switch recovery procedures;software engineering;multimedia information systems;Estelle semantics;Language of Temporal Ordering Specification (LOTOS);concurrent programming;Equivalence checking algorithms and Open Systems Interconnection (OSI).
the proceedings contain 79 papers. the special focus in this conference is on algorithms and Computation. the topics include: Quasi-random combinatorial structures;Hamiltonian abstract voronoi diagrams in linear time;...
ISBN:
(纸本)9783540583257
the proceedings contain 79 papers. the special focus in this conference is on algorithms and Computation. the topics include: Quasi-random combinatorial structures;Hamiltonian abstract voronoi diagrams in linear time;every set of disjoint line segments admits a binary tree;the traveling cameraman problem, with applications to automatic optical inspection;on determining the congruity of point sets in higher dimensions;computing solutions uniquely collapses the polynomial hierarchy;verifying the determinant in parallel;hardness of approximating graph transformation problem;randomized wait-free naming;unifying themes for network selection;robust asynchronous algorithms in networks with a fault detection ring;distributed algorithms for finding small cycle covers in arbitrary networks;a neural network model for quadratic programming with simple upper and lower bounds and its application to linear programming;analysis of the convergency of topology preserving neural networks on learning;on helping and interactive proof systems;average cost to produce partial orders;two notes on low-density subset sum algorithm;finitely representable spatial objects and efficient computation;computing all small cuts in undirected networks;edge-coloring and f-coloring for various classes of graphs;edge-disjoint paths in permutation graphs;algorithmic chernoff-hoeffding inequalities in integer programming;approximate pattern matching with samples;an efficient optimal algorithm for minimizing the overall communication cost in replicated data management;realizing degree sequences in parallel;a linear-time algorithm for computing characteristic strings;fast deterministic hot-potato routing on processor arrays and optimal routing of permutations on rings.
the proceedings contain 45 papers. the special focus in this conference is on Analogical and Inductive Inference. the topics include: Deductive plan generation;average case analysis of pattern language learning algori...
ISBN:
(纸本)9783540585206
the proceedings contain 45 papers. the special focus in this conference is on Analogical and Inductive Inference. the topics include: Deductive plan generation;average case analysis of pattern language learning algorithms;enumerable classes of total recursive functions;derived sets and inductive inference;therapy plan generation as program synthesis;a calculus for logical clustering;learning with higher order additional information;efficient learning of regular expressions from good examples;identifying nearly minimal Gödel numbers from additional information;on case-based represent ability and learnability of languages;rule-generating abduction for recursive prolog;fuzzy analogy based reasoning and classification of fuzzy analogies;explanation-based reuse of prolog programs;constructive induction for recursive programs;training digraphs;towards realistic theories of learning;a unified approach to inductive logic and case-based reasoning;three decades of team learning;on-line learning with malicious noise and the closure algorithm;learnability with restricted focus of attention guarantees noise-tolerance;efficient algorithm for learning simple regular expressions from noisy examples;a note on learning DNF formulas using equivalence and incomplete membership queries;identifying regular languages over partially-commutative monoids;classification using information;learning from examples with typed equational programming;finding tree patterns consistent with positive and negative examples using queries;program synthesis in the presence of infinite number of inaccuracies;language learning under various types of constraint combinations and monotonicity versus efficiency for learning languages from texts.
the conference materials contain 95 papers. the topics covered include artificial neural networks;artificial intelligence (AI) algorithms;AI and object-oriented systems;AI and software engineering;knowledge base archi...
详细信息
ISBN:
(纸本)0818642009
the conference materials contain 95 papers. the topics covered include artificial neural networks;artificial intelligence (AI) algorithms;AI and object-oriented systems;AI and software engineering;knowledge base architectures;machine learning;reasoning under uncertainty, fuzzy logic;expert systems and environments;natural language processing;logic and intelligent databases;parallel processing and hardware support.
the proceedings contain 117 papers. the special focus in this conference is on Computer Analysis of Images and Patterns. the topics include: Performance characterization in computer vision;low-level computational mono...
ISBN:
(纸本)9783540572336
the proceedings contain 117 papers. the special focus in this conference is on Computer Analysis of Images and Patterns. the topics include: Performance characterization in computer vision;low-level computational mono and stereo vision;the dual irregular pyramid;analytical results on the quadtree storage-requirements;calculation and estimation of sample statistics of binary images using quadtree data representations;temporal speckle reduction for feature extraction in ultrasound images;noise effects in statistical subpixel pattern recognition;fast iterative reconstruction of band-limited images from non-uniform;anisotropic filtering of mri data based upon image gradient histogram;fast discrete cosine transform approximation for J-PEG image;error diffusion in block truncation coding;on a bound on signal-to-noise ratio in subband coding of gaussian image process;a linear predictor as a regularization function in adaptive image restoration and reconstruction;inversion of convolution by small kernels;a model-based image quantization technique for supervised image recognition;brightness-contrast diffusion and the grouping of missing angles;using eigenvectors of a vector field for deriving a second directional derivative operator for color images;crest lines detection in grey level images;a comparative study of performance for noisy roof edge detection;a hough-like prediction/correction approach for ellipse detection;fourier parameterization provide uniform bounded hough space;circle extraction via least squares and the kalman filter;a multiresolution shape description algorithm;image coding by morphological skeleton transformation;a non-linear shape abstraction technique and minimum-space time-optimal convex hull algorithms.
Modern verification systems such as PVS are now reaching the stage of development where the formal verification of critical algorithms is feasible with reasonable effort. this paper describes one such verification in ...
详细信息
the proceedings contain 35 papers. the special focus in this conference is on Languages and Compilers for Parallel Computing. the topics include: Compilation of a highly parallel actor-based language;a concurrent exec...
ISBN:
(纸本)9783540575023
the proceedings contain 35 papers. the special focus in this conference is on Languages and Compilers for Parallel Computing. the topics include: Compilation of a highly parallel actor-based language;a concurrent execution semantics for parallel program graphs and program dependence graphs;using profile information to assist advanced compiler optimization and scheduling;a hierarchical parallelizing compiler for VLIW/MIMD machines;a novel method for data dependence evaluation;on the feasibility of dynamic partitioning of pointer structures;compiler analysis for irregular problems in fortran D;data ensembles in orca C;compositional parallel programming;data parallelism and linda;techniques for efficient execution of fine-grained concurrent programs;computing per-process summary side-effect information;supporting SPMD execution for dynamic data structures;determining transformation sequences for loop parallelization;compiler optimizations for massively parallel machines: transformations on iterative spatial loops;handling distributed data in vienna fortran procedures;on the synthesis of parallel programs from tensor product formulas for block recursive algorithms;collective loop fusion for array contraction;parallel hybrid data flow algorithms: a case study;a control-parallel programming model implemented on SIMD hardware;a calculus of gamma programs;a linda-based runtime system for a distributed logic language;parallelizing a C dialect for distributed memory MIMD machines;a singular loop transformation framework based on non-singular matrices;and designing the McCAT compiler based on a family of structured intermediate representations and experience with techniques for refining data race detection.
the proceedings contain 23 papers. the special focus in this conference is on Workshop on Distributed algorithms. the topics include: On the limitation of the global time assumption in distributed systems;mustaque aha...
ISBN:
(纸本)9783540552369
the proceedings contain 23 papers. the special focus in this conference is on Workshop on Distributed algorithms. the topics include: On the limitation of the global time assumption in distributed systems;mustaque ahamad, james E. burns, phillip W. hutto, Gil neiger;uniform self-stabilizing randomized algorithms;maintaining digital clocks in step;implementing FIFO queues and stacks;optimal amortized distributed consensus;optimally simulating crash failures in a byzantine environment;using adaptive timeouts to achieve at-most-once message delivery;uniform dynamic self-stabilizing leader election;the quickest path problem in distributed computing systems;the communication complexity of the two list problem;distributed algorithms for updating shortest paths;minimal shared information for concurrent reading and writing;reading many variables in one atomic operation solutions with linear or sublinear complexity;analysis of distributed algorithms based on recurrence relations;detection of global state predicates;using consistent subcuts for detecting stable properties;atomic m-register operations;a robust distributed mutual exclusion algorithm and message delaying synchronizers.
the proceedings contain 47 papers. the topics discussed include: the hyper-dynamic architecture (massively parallel message-passing machine) - architecture and performance;high performance communication for MIMD super...
ISBN:
(纸本)0897914341
the proceedings contain 47 papers. the topics discussed include: the hyper-dynamic architecture (massively parallel message-passing machine) - architecture and performance;high performance communication for MIMD supercomputers;a space-efficient parallel garbage compaction algorithm;sequential description and parallel execution language DFCII for dataflow supercomputer;GRACIA - a software environment for graphical specification, automatic configuration and animation of parallel programs;a scheme to extract run-time parallelism from sequential loops;compiler algorithms for event variable synchronization;and work distribution in parallel programs for distributed memory multiprocessors.
Experimental research on Artificial Neural Network (ANN) algorithms requires either writing variations on the same program or making one monolithic program with many parameters and options. By using an object-oriented...
ISBN:
(纸本)9781558602229
Experimental research on Artificial Neural Network (ANN) algorithms requires either writing variations on the same program or making one monolithic program with many parameters and options. By using an object-oriented library, the size of these experimental programs is reduced while making them easier to read, write and modify. An efficient and flexible realization of this idea is Connectionist Layered Object-oriented Network Simulator (CLONES). CLONES runs on UNIX workstations and on the 100-1000 MFLOP Ring Array Processor (RAP) that we built with ANN algorithms in mind. In this report we describe CLONES and show how it is implemented on the RAP.
暂无评论