On a learning trajectory for reciprocal reasoning with quantitative unknowns

2015-04-20
Hackenberg, Amy
Sevinç, Şerife

Suggestions

On the value of information in dynamic production inventory problems under forecast evolution
Gullu, R (1996-03-01)
In this article we explore how total system costs and inventory positions are affected when forecasts are incorporated explicitly in production/inventory systems. We assume that forecasts for demand of a certain item are available in each period, and they evolve from one period to the next in accordance with an additive evolution model. In order to analyze the effects of the forecasts on the production/inventory system we compare the optimal ordering policy and the expected costs of the model that keeps for...
On the minimization of total weighted flow time with identical and uniform parallel machines
Azizoğlu, Meral (1999-02-16)
We consider the NP-hard problem of scheduling jobs on identical parallel machines to minimize total weighted flow time. We discuss the properties that characterize the structure of an optimal solution, present a lower bound and propose a branch and bound algorithm. The algorithm is superior to prior methods presented in the literature. We also extend the algorithm to uniform parallel machines and solve medium-sized problem instances.
On the Attenuation of the Perfectly Matched Layer in Electromagnetic Scattering Problems with the Spectral Element Method
Mahariq, I.; Kuzuoğlu, Mustafa; Tarman, Işık Hakan (2014-09-01)
Although Spectral Element Method (SEM) has been applied in the modeling of boundary value problems of electromagnetics, its usage is not as common as the Finite Element or Finite Difference approaches in this area. It is well-known that the Perfectly Matched Layer (PML) approach is a mesh/grid truncation method in scattering or radiation applications where the spatial domain is unbounded. In this paper, the PML approach in the SEM context is investigated in two-dimensional, frequency-domain scattering probl...
On the Construction of 20 x 20 and 24 x 24 Binary Matrices with Good Implementation Properties for Lightweight Block Ciphers and Hash Functions
SAKALLI, MUHARREM TOLGA; AKLEYLEK, SEDAT; ASLAN, BORA; BULUŞ, ERCAN; Sakalli, Fatma Buyuksaracoglu (2014-01-01)
We present an algebraic construction based on state transform matrix (companion matrix) for n x n (where n + 2(k), k being a positive integer) binary matrices with high branch number and low number of fixed points. We also provide examples for 20 x 20 and 24 x 24 binary matrices having advantages on implementation issues in lightweight block ciphers and hash functions. The powers of the companion matrix for an irreducible polynomial over GF(2) with degree 5 and 4 are used in finite field Hadamard or circula...
On the Solution of Data Association Problem Using Rollout Algorithms
Ozgen, Selim; Demirekler, Mübeccel; Orguner, Umut (2016-07-08)
The quality and precision of tracking maneuvering targets under heavy clutter is highly dependent on both the data association and the state estimation algorithms. In this study, measurement-to-track association problem for a single target when P-D = 1 is discussed. The problem considers the batch set of measurements in a time interval. An approximate stochastic optimization algorithm for data association is presented. To reduce the computational load, the rollout algorithm is utilized. The algorithm is app...
Citation Formats
A. Hackenberg and Ş. Sevinç, “On a learning trajectory for reciprocal reasoning with quantitative unknowns,” presented at the American Educational Research Association (AERA) Annual Meeting, (16 - 20 Nisan 2015), Chicago, IL., 2015, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/84884.