Search

Historically, the military men have been at the forefront of Turkey’s political and social scenery, enjoying a position of great respect from people of all classes since the days of the Ottoman Empire. This was not simply due to the fact that almost all founding fathers of the newly established Republic had a military background, but also the ideology upon which the new state had been established, Kemalism, envisioned the military as the conveyor of the positivist and progressive ideals that would guarantee the firm establishment of a politically non-Islamic, secular, and westward-looking Turkey. However, nearing the new millennium, the representation and/or the projection of these ideals into the reality was/were not somehow fit enough to guarantee Turkey a membership at the EU. How did this end up here? What could have been a perspective that would guide us in understanding this whole process? Does such a perspective need to be reductionist and thus exclusive or, on the contrary, a little more encompassing and thus inclusive than one might imagine? These questions laid the necessary basis of and led to a research process of which, the outcome is this text. The concept of mentality is the nucleus around which the research is structured and conducted. It is functionalised via the mentality analysis perspective borrowed from Werner Sombart by Sabri Ülgener, which consequentially emphasises the importance of Verstehen in social sciences, rather than Erklären.

This paper presents a novel scheduling approach that efficiently schedules the computational and the communicational resources of a Software-Defined Photonic Network-on-Chip (SD-PNoC) Architecture designed for high-performance real-time systems. The proposed scheduling approach extends the conventional cyclic executive scheduling algorithm from the one that schedules solely the computational resources into a general one that schedules both the computational and the communicational resources together in a synchronized manner. The proposed SD-PNoC architecture employs Software Defined Network (SDN) approach by using application specific conflict-free and contention-free communication patterns to solve the routing and wavelength assignment (RWA) problem exists in photonic networks. The implementations of the collective communication primitives such as broadcast and all-to-broadcast are also presented to demonstrate the system as a whole.

The purpose of the study is to identify the personality types and alacrity for job embeddedness of the candidate workers to work in the service sector and to test whether there is a meaningful relationship between these two variables and to determine which personality type has how much effect on the alacrity for job embeddedness if there is a meaningful relationship. Based on this purpose, data was obtained from the 84 candidates who applied to work in the call services within the scope of the training project organized by the Chamber of Industry and Commerce in X. This data obtained was evaluated by SPSS program and analyzed by correlation, Kruskal-Wallis H and Mann-Whitney U. As a result of the correlation analysis; no significant relationship was determined between the personality type of candidate workers and the alacrity for job embeddedness. In addition, it was determined that the alacrity for job embeddedness of candidate workers to work was not significantly different according to their previous work experience, age and education level. As a result of the findings, all the hypotheses put forward have been rejected and Maslow's hypothesis of “the physiological needs of man is the most fundamental need” stated in the theory of motivation is supported., Çalışmanın amacı; hizmet sektöründe çalışacak aday işgörenlerin kişilik tiplerini ve işe gömülme istekliliklerini saptamak, bu iki değişken arasında anlamlı bir ilişki olup olmadığını sınamak, eğer anlamlı bir ilişki var ise işe gömülme istekliliği üzerinde hangi kişilik tipinin ne kadar etkisi olduğunu belirlemektir. Bu amaca bağlı olarak, X ilindeki Sanayi ve Ticaret Odasının düzenlemiş olduğu eğitim projesi kapsamında çağrı hizmetlerinde çalışmak için başvuran 84 aday işgörenden anket yöntemiyle veri elde edilmiştir. Elde edilen bu veriler SPSS programı ile değerlendirilmiş, korelasyon, Kruskal-Wallis H ve Mann-Whitney U ile analiz edilmiştir. Gerçekleştirilen korelasyon analizi sonucunda; aday işgörenlerin kişilik tipi ile işe gömülme istekliliği arasında anlamlı bir ilişki saptanmamıştır. Ayrıca, aday işgörenlerin işe gömülme istekliliğinin daha önceki iş deneyimine, yaşa ve eğitim düzeyine göre de anlamlı bir farklılık göstermediği belirlenmiştir. Elde edilen bulgular sonucunda, öne sürülen hipotezlerin tamamı reddedilmiş ve Maslow’un motivasyon teorisinde belirttiği “fizyolojik ihtiyaçlar insanın en temel ihtiyacıdır” varsayımı desteklenmiştir.

BACKGROUND: The purpose of this study was to compare of telemetric monitoring system and tympanic device for determination of core temperature during running velocity at maximal lactate steady state. METHODS: Fifteen15 healthy female futsal players volunteered to participate in this study. The mean age, height and weight of athletes were 20.14±0.82 years, 165.45±4.30 cm and 57.96±6.54 kg, respectively. Two separate test protocol was applied to participants. Firstly, each subject performed an intermittent incremental test on the treadmill for determination of lactate threshold at 4 mmol•l-1 lactate concentration. During test, the initial velocity of 7.0 km•h-1 was increased by 1.0 km•h-1 every 3 min until volitional exhaustion. Secondly, maximal lactate steady state (MLSS) of the athletes was determined by a serious of 30 minutes constant-speed treadmill runs. MLSS was defined as the highest lactate concentration that increased by no more than 1 mmol•l-1 between the 10th and 30th minute of the submaximal treadmill test. Core temperatures of the subjects were measured by both a telemetric monitoring system (Tm) and tympanic device (Td) at rest and at 10 min intervals throughout the MLSS Test. RESULTS: Paired-sample t-test was conducted to evaluate the significance of mean differences in devices before and during the MLSS Test. While there were no significant differences in core temperature values between Tm and Td at rest (P>0.05), Td was lower than Tm after 10th, 20th, and 30th min of exercise (P, Firat University Scientific Research Projects Management Unit, Conflicts of interest.—The authors certify that there is no conflict of interest with any financial organization regarding the material discussed in the manuscript. Funding.—This research study was supported by the Dumlupınar University Scientific Research Projects Coordination Unit. Manuscript accepted: March 28, 2018. - Manuscript received: June 30, 2015.

Reaching the physical boundaries of the electronics-based communication approach has enabled photonic-based systems, which promise high-bandwidth and low power consumption, especially in multiprocessor systems, to be an alternative to electronic systems on chips. Real-time systems are specialized systems where tasks that cannot be completed in time cause high costs, and particularly communication with sensors and actuators have high importance. In this study, a sensor data distribution model is presented for multi-processor real-time systems that communicate with the photonic network on the chip. The study provides the distribution of the sensor data to the processors on the chip with the photonic infrastructure, and the results show that the proposed model is an effective approach for real-time systems.

The need for high-performance computing together with the increasing trend from single processor to parallel computer architectures has leveraged the adoption of parallel computing. To benefit from parallel computing power, usually parallel algorithms are defined that can be mapped and executed on parallel computing platforms. In general, different alternative mappings can be defined each with different performance. For small computing platforms with a limited number of processing nodes, the mapping process can be carried out manually. However, for large-scale parallel computing platforms in which hundreds of thousands of processing nodes are applied, the number of possible mapping alternatives increases dramatically, and the mapping process becomes intractable for the human engineer. To assist the parallel computing engineer, we provide a systematic approach to derive feasible mapping alternatives of parallel algorithms to parallel computing platforms. The approach includes activities for modeling the parallel algorithm and parallel computing platform, generation of feasible mapping alternatives, generation of the deployment code, and finally the deployment of the generated code to the nodes. We evaluate our approach for deriving feasible mapping alternatives for four well-known parallel algorithms. The evaluation is based on both simulations and real executions of the generated mapping alternatives.

High performance computing (HPC) has great potential to speedup agent-based simulations. In parallel and distributed simulation (PADS) community, a well-known fact is that employing an optimistic time management mechanism instead of a conservative time management mechanism may provide remarkable performance enhancement, because optimistic approach avoids redundant synchronization among logical processes (LPs). In this paper, an existing optimistic time management mechanism, namely Time Warp, by Jefferson, is adapted for a distributed agent based simulation tool. We implemented Time Warp on an open source and distributed agent based modeling and simulation (ABMS) tool, namely Repast for High Performance Computing (Repast HPC), from Argonne National Laboratory, Chicago, IL, USA. We incorporated a simple and self-adaptive technique for adjusting checkpoint intervals. Two case studies have been implemented to compare our optimistic approach and existing Repast HPC's conservative approach. The experiments suggest that optimistic approach is more scalable than conservative approach in agent based simulations.

The High Level Architecture (HLA) as a well-known IEEE standard for developing parallel and distributed simulation systems has been around for many years. In this paper, Runtime Infrastructure (RTI) of HLA is re-evaluated in the light of the current trends in many-core processor architectures. The future many-core processor architectures will contain thousands of cores connected with on chip networks. Such network on chip (NoC) architectures will not only be built as electronic networks but also as photonic networks. The communication links are established by using scalable communication patterns which define how the light paths to be setup in a 2D photonic network. In other words, RTI specific communication patterns orchestrate the underlying photonic network both to guarantee contention-free network operation and to utilize the bisection bandwidth available on the photonic torus. Time and data distribution management related algorithms are especially subject to this paper. Both the Greatest Available Logical Time (GALT) calculation algorithm and timestamp order (TSO) message delivery are carried out in small number of communication steps on 2D photonic torus. The approach taken in this work is based on hardware and software co-design.

Parallel and distributed simulations (PADS) realize the distributed execution of a simulation system over multiple physical resources. To realize the execution of PADS, different simulation infrastructures such as HLA, DIS and TENA have been defined. Recently, the Distributed Simulation Engineering and Execution Process (DSEEP) that supports the mapping of the simulations on the infrastructures has been defined. An important recommended task in DSEEP is the evaluation of the performance of the simulation systems at the design phase. In general, the performance of a simulation is largely influenced by the allocation of member applications to the resources. Usually, the deployment of the applications to the resources can be done in many different ways. DSEEP does not provide a concrete approach for evaluating the deployment alternatives. Moreover, current approaches that can be used for realizing various DSEEP activities do not yet provide adequate support for this purpose. We provide a concrete approach for deriving feasible deployment alternatives based on the simulation system and the available resources. In the approach, first the simulation components and the resources are designed. The design is used to define alternative execution configurations, and based on the design and the execution configuration; a feasible deployment alternative can be algorithmically derived. Tool support is developed for the simulation design, the execution configuration definition and the automatic generation of feasible deployment alternatives. The approach has been applied within a large-scale industrial case study for simulating Electronic Warfare systems.

Date of Conference: September 29 – October 4, 2013 Conference name: International Conference on Model Driven Engineering Languages and Systems 16th International Conference, MODELS 2013 The trend from single processor to parallel computer architectures has increased the importance of parallel computing. To support parallel computing it is important to map parallel algorithms to a computing platform that consists of multiple parallel processing nodes. In general different alternative mappings can be defined that perform differently with respect to the quality requirements for power consumption, efficiency and memory usage. The mapping process can be carried out manually for platforms with a limited number of processing nodes. However, for exascale computing in which hundreds of thousands of processing nodes are applied, the mapping process soon becomes intractable. To assist the parallel computing engineer we provide a model-driven approach to analyze, model, and select feasible mappings. We describe the developed toolset that implements the corresponding approach together with the required metamodels and model transformations. We illustrate our approach for the well-known complete exchange algorithm in parallel computing. © 2013 Springer-Verlag.