Turkey-Africa alliance: Evolving patterns in security relations

ABSTRACT

Turkey has maintained its strategic relations with Africa at the highest level under recent AK Party governments in the field not only of low politics but also of high politics. For example, it opened its largest overseas military base in Somalia in 2017 and signed military, defense and security pacts with more than 25 African countries. This article traces the deep historical and cultural relations with Africa behind its newly evolving foreign policy identity, arguing that its booming economic power has been a significant driving force in shaping a new security strategy. It examines what the growing security involvement means for both Turkey and Africa in order to contribute to the relevant literature through a holistic approach from both theoretical and conceptual perspectives.     

Exact expected values of variance estimators for simulation

We formulate exact expressions for the expected values of selected estimators of the variance parameter (that is, the sum of covariances at all lags) of a steady‐state simulation output process. Given in terms of the autocovariance function of the process, these expressions are derived for variance estimators based on the simulation analysis methods of nonoverlapping batch means, overlapping batch means, and standardized time series. Comparing estimator performance in a first‐order autoregressive process and the M/M/1 queue‐waiting‐time process, we find that certain standardized time series estimators outperform their competitors as the sample size becomes large. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Scheduling twin robots on a line

This article introduces the twin robots scheduling problem (TRSP), in which two robots positioned at the opposite ends of a rail are required to deliver items to positions along the rail, and the objective is to minimize the makespan. A proof of ‐hardness of the TRSP is presented, along with exact and heuristic algorithms. Computational results on challenging instances are provided.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 119–130, 2014     

Discrete stochastic optimization using variants of the stochastic ruler method

We present two random search methods for solving discrete stochastic optimization problems. Both of these methods are variants of the stochastic ruler algorithm. They differ from our earlier modification of the stochastic ruler algorithm in that they use different approaches for estimating the optimal solution. Our new methods are guaranteed to converge almost surely to the set of global optimal solutions under mild conditions. We discuss under what conditions these new methods are expected to converge faster than the modified stochastic ruler algorithm. We also discuss how these methods can be used for solving discrete optimization problems when the values of the objective function are estimated using either transient or steady‐state simulation. Finally, we present numerical results that compare the performance of our new methods with that of the modified stochastic ruler algorithm when applied to solve buffer allocation problems. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Averaging frameworks for simulation optimization with applications to simulated annealing

We present two frameworks for designing random search methods for discrete simulation optimization. One of our frameworks is very broad (in that it includes many random search methods), whereas the other one considers a special class of random search methods called point‐based methods, that move iteratively between points within the feasible region. Our frameworks involve averaging, in that all decisions that require estimates of the objective function values at various feasible solutions are based on the averages of all observations collected at these solutions so far. Also, the methods are adaptive in that they can use information gathered in previous iterations to decide how simulation effort is expended in the current iteration. We show that the methods within our frameworks are almost surely globally convergent under mild conditions. Thus, the generality of our frameworks and associated convergence guarantees makes the frameworks useful to algorithm developers wishing to design efficient and rigorous procedures for simulation optimization. We also present two variants of the simulated annealing (SA) algorithm and provide their convergence analysis as example application of our point‐based framework. Finally, we provide numerical results that demonstrate the empirical effectiveness of averaging and adaptivity in the context of SA. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

星上路由查找设计与算法实现

针对星上路由器的路由查找功能展开研究。通过分析比较多种路由查找算法,利用软硬件协同设计的思想,给出了星上路由查找的设计与适合硬件查找的Trie树实现。给出了算法实现程序,通过实例分析了算法的优点。结果表明设计可以满足宽带卫星通信系统业务的需求。     

模拟训练系统中CGF的号手操作技能建模

针对模拟训练系统对CGF真实性的要求,从号手的操作技能入手,建立可以反映真实训练水平的号手操作技能模型。在分析操作技能相关原理和规律的基础上,采用时间序列分析的方法对其进行预测。采用了指数平滑预测模型,详细分析了其原理,并针对其在实际应用中的缺陷进行了改进。最后,通过两个实际案例验证了模型的可用性和可信性。所建模型反映了号手的操作技能,为模拟训练系统中CGF的真实性研究提供新的思路和方法。