Codeword distribution for frequency sensitive competitive learning with one-dimensional input data

1996 ◽  
Vol 7 (3) ◽  
pp. 752-756 ◽  
Author(s):  
A.S. Galanopoulos ◽  
S.C. Ahalt
Keyword(s):  
Input Data ◽  
Competitive Learning ◽  
One Dimensional

Input data used to generate one-dimensional burial history models, central Alberta, Canada

2005 ◽  
Author(s):  
Laura N.R. Roberts ◽  
Debra K. Higley ◽  
Mitchell E. Henry
Keyword(s):  
Input Data ◽  
Burial History ◽  
One Dimensional

A New Scan Conversion Algorithm for Ultrasound Compound Scanning

1985 ◽  
Vol 7 (3) ◽  
pp. 215-224 ◽  
Author(s):  
Seung-Woo Lee ◽  
Song-Bai Park
Keyword(s):  
Real Time ◽  
Input Data ◽  
Linear Interpolation ◽  
Reconstruction Error ◽  
Ultrasound Images ◽  
Two Dimensional ◽  
Spatial Compounding ◽  
One Dimensional ◽  
Conversion Algorithm ◽  
Scan Conversion

An improved scan conversion algorithm for ultrasound compound scanning is proposed. In this algorithm, the input data in the spatial domain is sampled by the concentric square raster sampling (CSRS) method, and the display pixel data are filled by one-dimensional linear interpolation. The reconstruction error of the proposed algorithm is much smaller than that of other algorithms, because only one-dimensional, rather than two-dimensional, interpolation is involved. This algorithm greatly simplifies implementation of a real-time digital scan converter (DSC) for spatial compounding of ultrasound images.

COMPENSATION COMPETITIVE LEARNING

2001 ◽  
Vol 01 (03) ◽  
pp. 303-322
Author(s):  
ZHI-QIANG LIU ◽  
YAJUN ZHANG
Keyword(s):  
Input Data ◽  
Learning Algorithm ◽  
A Priori ◽  
Competitive Learning ◽  
Experimental Results ◽  
Initial Number ◽  
Number Of Clusters ◽  
And Performance ◽  
Competitive Algorithms

In general, in competitive learning the requirement for the initial number of prototypes is a difficult task, as we do not usually know the number of clusters in the input data a priori. The behavior and performance of the competitive algorithms are very sensitive to the initial locations and number of the prototypes. In this paper after investigating several important competitive learning paradigms, we present compensation techniques for overcoming the problems in competitive learning. Our experimental results show that competition with compensation can improve the performance of the learning algorithm.

scholarly journals Hardware Design Rule Checker Using a CAM Architecture

VLSI Design ◽  
1996 ◽  
Vol 4 (2) ◽  
pp. 141-147
Author(s):  
Seokjin Kim ◽  
Ramalingam Sridhar
Keyword(s):  
Pattern Matching ◽  
Input Data ◽  
Hardware Implementation ◽  
Low Cost ◽  
Design Rule ◽  
Design Rules ◽  
One Dimensional ◽  
Content Addressable Memory ◽  
Logic Operations ◽  
Geometric Designs

This paper presents a hardware implementation of design rule checker using a specialized Content Addressable Memory(CAM) for the Manhattan geometric designs. Two dimensional relationships between rectangular objects in a design are checked with one dimensional design rules. The input data is processed by the pixel pre-processor in such a way that direct comparison between the input data and the stored rules in the CAM is possible. The comparison by the CAM reduces the number of memory references and logic operations of pattern matching and the simple architecture of the system enables a low cost implementation.

DATA PARALLEL VISUAL RECONSTRUCTION AND PARTITIONING ALGORITHMS

1993 ◽  
Vol 03 (03) ◽  
pp. 267-277
Author(s):  
PAUL C. XIROUCHAKIS ◽  
PEARL Y. WANG ◽  
OPHIR FRIEDER
Keyword(s):  
Input Data ◽  
Random Access ◽  
Reconstruction Problem ◽  
One Dimensional ◽  
Data Parallel ◽  
Distributed Array ◽  
Partitioning Algorithms ◽  
Visual Reconstruction ◽  
The One ◽  
Specific Implementation

Data parallel visual reconstruction and partitioning algorithms and the associated code are developed for a vector random access machine (V-RAM). Finite element algorithms are constructed for solving the one-dimensional visual reconstruction problem with the input data consisting of a symmetrical top hat loading for the modeling of interacting step discontinuities. The advantage of the V-RAM implementation is the general code applicability to a variety of architectures. A specific implementation is performed on a Distributed Array Processor (DAP) simulator on the VAX 6000–420. Execution times on the DAP simulator are obtained and are found to be in agreement with the algorithmic complexities of the V-RAM code.

scholarly journals INVERSE PROBLEM OF A ONE-DIMENSIONAL MODEL IN MULTILAYER HEAT CONDUCTION

2020 ◽  
Vol 19 (1) ◽  
pp. 42
Author(s):  
G. C. Oliveira ◽  
S. S. Ribeiroa ◽  
G. Guimarães
Keyword(s):  
Inverse Problem ◽  
Measurement Errors ◽  
Input Data ◽  
Temperature Measurements ◽  
Dimensional Model ◽  
One Dimensional ◽  
Ill Posed ◽  
Measurements Errors ◽  
Chip Chip

The inverse problem in conducting heat is related to the determination of the boundary condition, rate of heat generation, or thermophysical properties, using temperature measurements at one or more positions of the solid. The inverse problem in conducting heat is mathematically one of the ill-posed problems, because its solution extremely sensitive to measurement errors. For a well-placed problem the following conditions must be satisfied: the solution must exist, it must be unique and must be stable on small changes of the input data. The objective of the work is to estimate the heat flux generated at the tool-chip-chip interface in a manufacturing process. The term "estimation" is used because in the temperature measurements, errors are always present and these affect the accuracy of the calculation of the heat flow.

scholarly journals Formulation and analysis of a parabolic transmission problem on disjoint intervals

2012 ◽  
Vol 91 (105) ◽  
pp. 111-123 ◽  
Author(s):  
Bosko Jovanovic ◽  
Lubin Vulkov
Keyword(s):  
Boundary Value Problem ◽  
Weak Solutions ◽  
Parabolic Equations ◽  
Input Data ◽  
Boundary Value ◽  
Initial Boundary ◽  
Initial Boundary Value Problem ◽  
Well Posedness ◽  
One Dimensional ◽  
Initial Boundary Value

We investigate an initial-boundary-value problem for one dimensional parabolic equations in disjoint intervals. Under some natural assumptions on the input data we proved the well-posedness of the problem. Nonnegativity and energy stability of its weak solutions are also studied.

scholarly journals The initial analysis of the river Ibar temperature downstream of the lake Gazivode

2014 ◽  
Vol 18 (suppl.1) ◽  
pp. 73-80 ◽  
Author(s):  
Dragan Kalaba ◽  
Ivana Ivanovic ◽  
Dejan Cikara ◽  
Gordana Milentijevic
Keyword(s):  
Water Quality ◽  
Input Data ◽  
Temperature Data ◽  
Numerical Results ◽  
Measured Temperature ◽  
One Dimensional ◽  
Initial Analysis ◽  
Temperature Modeling ◽  
River Reach ◽  
The City

As a result of a very limited number of geometric and other input data, the temperature modeling of the river Ibar downstream of the lake Gazivode was started by analyzing one river reach between Pridvorica, secondary dam in the system Gazivode, and the city Kosovska Mitrovica. River reach was selected so that the numerical results can be compared with available measured temperature data. Water quality component of HEC-RAS one-dimensional hydraulic river model was used for temperature calculations.

A normalization method of input data that conserves the norm information for competitive learning neural network using inner product

1996 ◽  
Vol 3 (6) ◽  
pp. A414-A417 ◽  
Author(s):  
Mikihiko Terashima ◽  
Fumiyuki Shiratani ◽  
Takeshi Hashimoto ◽  
Kimiaki Yamamoto
Keyword(s):  
Neural Network ◽  
Input Data ◽  
Competitive Learning ◽  
Normalization Method ◽  
Inner Product
Sign in / Sign up

Export Citation Format

Share Document