Rootfinding process in interval arithmetic.

1983
Atabek, Emine

Suggestions

Character sums of quadratic forms over finite fields and the number of rational points for some classes of artin-schreier type curves
Coşgun, Ayhan; Doğanaksoy, Ali; Department of Mathematics (2017)
Exponential sums of quadratic forms over finite fields have many applications to various areas such as coding theory and cryptography. As an example to these applications, there is an organic connection between exponential sums of quadratic forms and the number of rational points of algebraic curves defined over finite fields. This connection is central in the application of algebraic geometry to coding theory and cryptography. In this thesis, different facts and techniques of theory of finite fields are co...
Batch scheduling duling of incompatible jobs on a single reactor with dynamic arrivals
Korkmaz, Gediz; Kayalıgil, Sinan; Department of Industrial Engineering (2004)
In this study, a single machine batch-scheduling problem with incompatible jobs and dynamic arrivals is examined. The objective function is the minimization of the total flow time of the jobs. For solving problems a case specific branch and bound algorithm with a heuristic upper bound scheme and two alternative lower bound procedures is used. An extensive computational experiment is conducted to investigate the effects of certain parameters on the computation time. For the most difficult parameter combinati...
CROWD COUNTING, LOCALIZATION AND ANOMALY DETECTION WITH CONVLSTM BASED CNN USING SYNTHETIC IMAGES
Coşkun, Muhammet Furkan; Akar, Gözde; Department of Electrical and Electronics Engineering (2022-6-28)
Crowd analysis related tasks have a wide range of real-life applications such as mass surveillance, safety monitoring, disaster management, traffic control and public area design. There are different novel works on crowd counting, localization and abnormal event detection tasks in the computer vision literature. In this study, we propose a ConvLSTM based Convolutional Neural Network to solve these three problems together in a single network. Our proposed model is a combination of P2P-Net architecture, whic...
Error Exponents for Variable-length block codes with feedback and cost constraints
Nakiboğlu, Barış; Win, Moe Z (2006-12-26)
Variable-length block-coding schemes are investigated for discrete memoryless channels (DMC) with perfect feedback under cost constraints. Upper and lower bounds are found for the minimum achievable probability of decoding error P-e,P- min as a function of transmission rate R, cost constraint P, and expected block length tau. For given P and R, the lower and upper bounds to the exponent -(ln P-e,P- min)/tau are asymptotically equal as tau -> infinity. The reliability function, Iim(tau ->infinity) (-ln P-e,P...
Error exponents for variable-length block codes with feedback and cost constraints
Nakiboğlu, Barış (Institute of Electrical and Electronics Engineers (IEEE), 2008-03-01)
Variable-length block-coding schemes are investigated for discrete memoryless channels with ideal feedback under cost constraints. Upper and lower bounds are found for the minimum achievable probability of decoding error P-e,P-min as a function of constraints R, P, and T on the transmission rate, average cost, and average block length, respectively. For given R and P, the lower and upper bounds to the exponent -(In P-e,P-min)/(T) over bar are asymptotically equal as (T) over bar -> infinity. The resulting r...
Citation Formats
E. Atabek, “Rootfinding process in interval arithmetic.,” Middle East Technical University, 1983.