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
Discrete discriminant analysis and dependence
Download
008194.pdf
Date
1990
Author
Geyik, Cemal
Metadata
Show full item record
Item Usage Stats
68
views
0
downloads
Cite This
URI
https://hdl.handle.net/11511/3785
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Discrete-time stochastic analysis of land combat
Eliiyi, Uğur; Özdemirel, Nur Evin; Department of Industrial Engineering (2004)
In this study, we present the implementation and experimental analysis of a modeling approach for analyzing tactical level land combat to generate information for weapon and ammunition planning. The discrete-time stochastic model (DSM), which can handle small and moderately large force levels, is based on single shot kill probabilities. Forces are assumed to be heterogeneous on both sides, and both directed and area fire types are modeled by means of combinatorial analysis. DSM considers overkills and can h...
Discrete and continuous structural optimization using Evolution Strategies
Hasançebi, Oğuzhan (null; 2005-01-01)
Discrete bifurcation diagrams and persistence
Örnek, Türkmen; Pamuk, Semra; Department of Mathematics (2018)
Let fti : M → R be a discrete Morse function on a cell complex M for each t0 < t1 < ... < tn = 1. Let us denote slice as Mi = M ×{ti} ⊂ M × I and let Vi be the discrete vector field on each slice. After extending the discrete vector field on each slice to a discrete vector field on all of M ×I, a discrete bifurcation diagram is obtained by connecting critical cells of the slices. In”Birth and Death in Discrete MorseTheory”(King,Knudson,Mramor), a solution about finding the discrete bifurcation diagram has been ...
Discrete gradient method: Derivative-free method for nonsmooth optimization
Bagirov, A. M.; Karasözen, Bülent; Sezer, M. (2008-05-01)
A new derivative-free method is developed for solving unconstrained nonsmooth optimization problems. This method is based on the notion of a discrete gradient. It is demonstrated that the discrete gradients can be used to approximate subgradients of a broad class of nonsmooth functions. It is also shown that the discrete gradients can be applied to find descent directions of nonsmooth functions. The preliminary results of numerical experiments with unconstrained nonsmooth optimization problems as well as th...
Discrete symmetries and nonlocal reductions
GÜRSES, METİN; Pekcan, Asli; Zheltukhın, Kostyantyn (Elsevier BV, 2020-01-31)
We show that nonlocal reductions of systems of integrable nonlinear partial differential equations are the special discrete symmetry transformations.
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
C. Geyik, “Discrete discriminant analysis and dependence,” Middle East Technical University, 1990.