Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Optimization of Dragline Inspection Intervals with Time Counter Algorithm
Date
2016-10-07
Author
Gölbaşı, Onur
Demirel, Nuray
Metadata
Show full item record
Item Usage Stats
38
views
0
downloads
Cite This
URI
https://hdl.handle.net/11511/70953
Collections
Unverified, Conference / Seminar
Suggestions
OpenMETU
Core
Optimization of the array geometry for direction finding
Özaydın, Seval; Koç, Seyit Sencer; Tanık, Yalçın; Department of Electrical and Electronics Engineering (2003)
In this thesis, optimization of the geometry of non-uniform arrays for direction finding yielding unambiguous results is studied. A measure of similarity between the array response vectors is defined. In this measure, the effects of antenna array geometry, source placements and antenna gains are included as variable parameters. Then, assuming that the antenna gains are known and constant, constraints on the similarity function are developed and described to result in unambiguous configurations and maximum r...
Optimization of non-uniform planar array geometry for direction of arrival estimation
Birinci, Toygar; Tanık, Yalçın; Department of Electrical and Electronics Engineering (2006)
In this work, a novel method is proposed to optimize the array geometry for DOA estimation. The method is based on minimization of fine error variances with the constraint that the gross error probability is below a certain threshold. For this purpose, a metric function that reflects the gross and fine error characteristics of the array is offered. Theoretical analyses show that the minimization of this metric function leads to small DOA estimation error variance and small gross error probability. Analyses ...
Optimization of doppler processing by using bank of matched filters
Aktop, Onur; Tanık, Yalçın; Department of Electrical and Electronics Engineering (2005)
In radars, matched filters are used in the receiver of the system. Since the target velocity is not known a priori, degradation occurs due to mismatch of the return signal and the matched filter. The performance of the radar can be improved by using a bank of matched filters. The first topic investigated in this work is optimization of the bank of matched filter structure. Two methods are proposed for the design of the parallel filter structure and computations are performed with both methods. The output si...
Optimization of nonuniform array geometry for DOA estimation with the constraint on gross error probability
Birinci, Toygar; Tanık, Yalçın (2007-10-01)
In this work, a novel method is proposed to optimize the array geometry for DOA estimation. The method is based on minimization of fine error variances with the constraint that the gross error probability is below a certain threshold. For this purpose, a metric function that reflects the gross and fine error characteristics of the array is proposed. Theoretical analyses show that the minimization of this metric function leads to small DOA estimation error variance and small gross error probability. Analyses...
Optimization of single-pass milling operations by geometric programming method.
Aydemir, M. Celalettin; Department of Mechanical Engineering (1985)
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
O. Gölbaşı and N. Demirel, “Optimization of Dragline Inspection Intervals with Time Counter Algorithm,” 2016, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/70953.