Mekatronik Mühendisliği Bölümü Yayın Koleksiyonu
Permanent URI for this collectionhttps://hdl.handle.net/20.500.12416/255
Browse
Browsing Mekatronik Mühendisliği Bölümü Yayın Koleksiyonu by Access Right "info:eu-repo/semantics/closedAccess"
Now showing 1 - 20 of 74
- Results Per Page
- Sort Options
Article A comparison of iterative Fourier transform algorithms for image quality estimation(2018) Arpali, Çağlar; Arpali, Çağlar; Arpali, Serap Altay; 20809A comparison was established between two iterative Fourier transform algorithms (IFTAs), such as the original Gerchberg–Saxton (GS) and the mixed-region amplitude freedom (MRAF) algorithms, for the hologram reconstruction of different target images through the full reference image quality estimation (IQE) and pixel homogeneity in the Fourier plane presented theoretically and experimentally. The comparison was applied depending upon both algorithms based on a computer-generated hologram (CGH) implemented utilizing a reflective phase-modulated liquid-crystal spatial light modulator (LC-SLM) to obtain the digital kinoform holograms of the desired intensity distributions. These digital holograms were applied to reconstruct the intensity patterns for 852 nm, which represents a laser beam source. The theoretical and experimental results of the reconstructed patterns obtained using the MRAF algorithm were found to be smoother and better than the patterns obtained using the GS algorithm. Unmodulated light beam (dc term) is removed from the reconstructed patterns attributed to digital kinoform holograms of MRAF algorithm as an alternative to the theoretical and experimental results without using any additional optic equipment at the light path. Moreover, this paper discussed the full reference objective quality estimations, such as mean square error (MSE), peak signal-to-noise ratio (PSNR), structural content (SC), normalized absolute error (NAE), normalized cross correlation (NK), and homogeneity of pixels, through the contrast (Cont) and inverse difference moment (IDM) for numerical and experimental results. According to the two desired intensity distributions processed theoretically and experimentally, the results of MRAF algorithm were found to be in the highly accurate recovered phase, the quality of image was enhanced, and the dc term was decreased. Image quality estimation of full reference objective relay on the feedback algorithms experimental attestation has not been implemented yet.Article A Comparison of Iterative Fourier Transform Algorithms for Image Quality Estimation(Optical Soc Japan, 2018) Alsaka, Dina Yaqoob; Arpali, Caglar; Arpali, Serap Altay; 20809A comparison was established between two iterative Fourier transform algorithms (IFTAs), such as the original Gerchberg-Saxton (GS) and the mixed-region amplitude freedom (MRAF) algorithms, for the hologram reconstruction of different target images through the full reference image quality estimation (IQE) and pixel homogeneity in the Fourier plane presented theoretically and experimentally. The comparison was applied depending upon both algorithms based on a computer-generated hologram (CGH) implemented utilizing a reflective phase-modulated liquid-crystal spatial light modulator (LC-SLM) to obtain the digital kinoform holograms of the desired intensity distributions. These digital holograms were applied to reconstruct the intensity patterns for 852 nm, which represents a laser beam source. The theoretical and experimental results of the reconstructed patterns obtained using the MRAF algorithm were found to be smoother and better than the patterns obtained using the GS algorithm. Unmodulated light beam (dc term) is removed from the reconstructed patterns attributed to digital kinoform holograms of MRAF algorithm as an alternative to the theoretical and experimental results without using any additional optic equipment at the light path. Moreover, this paper discussed the full reference objective quality estimations, such as mean square error (MSE), peak signal-to-noise ratio (PSNR), structural content (SC), normalized absolute error (NAE), normalized cross correlation (NK), and homogeneity of pixels, through the contrast (Cont) and inverse difference moment (IDM) for numerical and experimental results. According to the two desired intensity distributions processed theoretically and experimentally, the results of MRAF algorithm were found to be in the highly accurate recovered phase, the quality of image was enhanced, and the dc term was decreased. Image quality estimation of full reference objective relay on the feedback algorithms experimental attestation has not been implemented yet.Book Part A configurable CAN FD controller: architecture and implementation(IEEE, 2017) Afşin, Mehmet Ertuğ; Schmidt, Klaus Werner; Schmidt, Ece GüranCAN FD is a new standard which provides fast. data rate while preserving the compatibility with CAN (controller area network). In this paper, a Configurable IP core architecture (A-CAN) which is compatible with the CAN FD standard, is proposed. Different than existing CAN/CAN FD controllers, the numbers and sizes of transmit and receive buffers of A-CAN can be configured in run time. To this end, A-CAN enables the best use of single controller hardware for different applications and enables improving the real time communication performance. A CAN communicates with the host device over SPI without any specific interface requirements. A-CAN is implemented on an FPGA Evaluation Board and its functionally is verified at a rate of 2 Mbps.Article A framework for state attraction of discrete event systems under partial observation(Elsevier Science inc, 2014) Schmidt, Klaus Werner; Breindl, Christian; 17337State attraction for discrete event systems (DES) addresses the problem of reaching a desired subset of the plant state space after a bounded number of event occurrences. The problem of state attraction arises for example in fault-tolerant supervisory control or in the control of reconfigurable manufacturing systems, and is also applicable to systems biological problems such as the control of gene regulatory networks. State attraction is investigated with the assumption of full event observation in the existing literature. This paper extends the concept of state attraction to the case of partial observation. The notion of weak attraction under partial observation (WAPO) is introduced and necessary and sufficient conditions for the existence of a supervisor under partial observation that achieves WAPO are derived. Furthermore, a solution algorithm is proposed that finds such supervisor whenever it exists. It is shown that such supervisor can always be realized as a subautomaton of the observer automaton of the DES plant. An application example from systems biology illustrates the obtained results. (C) 2014 Elsevier Inc. All rights reserved.Conference Object Citation - Scopus: 11A Longest-Path Problem for Evaluating the Worst-Case Packet Delay of Switched Ethernet(2010) Schmidt, K.; Schmidt, E.G.; 17337In the recent years, the use of real-time Ethernet protocols becomes more and more relevant for time-critical networked industrial applications. In this context, this paper presents a method to compute the worst-case packet delays on switched Ethernet. Based on an evaluation of the packet delays at each switch port and the network topology, we construct a weighted directed graph that allows to find the worst-case end-toend packet delay by solving a conventional longest-path problem. © 2010 IEEE.Book Part A new multi-agent decision making structure and application to model-based fault diagnosis problem(IEEE, 2017) Leblebicioğlu, Kemal; Zengin, Yasin; Schmidt, Klaus WernerA new hierarchical multi-agent decision-making structure has been proposed. There are two phases of the structure. The first phase is the construction phase where the decision making structure consisting of switching and classification agents is built on the training data set generated by the system scenarios. In construction phase, switching and classification agents are trained and made ready for decision making. In the decision phase, which is the second phase, the class of the new data sample is decided. This process is carried out by the transmission of the data sample to the correct classifier agent by the switching agents and the classification by the classifier agent. The proposed structure is applied to a complex fault identification problem and a successful result is obtained. The structure is also adaptable to other big data decision making problems.Article A new systematic and flexible method for developing hierarchical decision-making models(TUBİTAK Scientific&Technical Research Council Turkey, 2015) Beldek, Ulaş; Leblebicioğlu, Mehmet Kemal; 59955The common practice in multilevel decision-making (DM) systems is to achieve the final decision by going through a finite number of DM levels. In this study, a new multilevel DM model is proposed. This model is called the hierarchical DM (HDM) model and it is supposed to provide a flexible way of interaction and information flow between the consecutive levels that allows policy changes in DM procedures if necessary. In the model, in the early levels, there are primary agents that perform DM tasks. As the levels increase, the information associated with these agents is combined through suitable processes and agents with higher complexity are formed to carry out the DM tasks more elegantly. The HDM model is applied to the case study 'Fault degree classification in a 4-tank water circulation system'. For this case study, the processes that connect the lower levels to the higher levels are agent development processes where a special decision fusion technique is its integral part. This decision fusion technique combines the previous level's decisions and their performance indicator suitably to contribute to the improvement of new agents in higher levels. Additionally, the proposed agent development process provides flexibility both in the training and validation phases, and less computational effort is required in the training phase compared to a single-agent development simulation carried out for the same DM task under similar circumstances. Hence, the HDM model puts forward an enhanced performance compared to a single agent with a more sophisticated structure. Finally, model validation and efficiency in the presence of noise are also simulated. The adaptability of the agent development process due to the flexible structure of the model also accounts for improved performance, as seen in the results.Article A parametric study on the elastic-plastic deformation of a centrally heated two-layered composite cylinder with free ends(Polish Acad Sciences inst Fundamental Technological Research, 2016) Yalcin, F.; Gülgeç, Müfit; Ozturk, A.; Gulgec, M.; 4168In this paper, an elastic-plastic deformation of a centrally heated two-layered composite cylinder with free ends subjected to uniformly distributed internal energy generation within an inner cylinder is studied using Tresca's yield condition and its associated flow rule. Stress, strain and displacement distributions in the composite cylinder made of elastic-perfectly plastic material are derived considering the influence of geometric parameters as well as material properties such as yield strength, modulus of elasticity, Poisson's ratio, coefficient of thermal conduction and coefficient of thermal expansion. Yielding starts at the outer boundary or at the axis corresponding to an 'edge regime' of Tresca's prism in both cases. Propagations of the plastic regions are studied due to an increase of a heat generation.Article An experimental investigation on the impact response of composite materials(Pergamon-elsevier Science Ltd, 2012) Evci, Celal; Gülgeç, Müfit; Gulgec, Mufit; 243247; 4168Due to the improved impact performance characteristics, composites are widely used in engineering and military applications to absorb the impact energy. Determination of impact response of composite materials provides the engineer and the manufacturer with critical knowledge to understand the failure criteria, initiation of the first failure and damage growth through the laminates. This study covers the investigation of impact damage growth and determination of Hertzian failure and maximum force thresholds in three different types of composites. Unidirectional E-Glass, woven E-Glass and woven Aramid composite samples with dimensions of 100 x 100 mm are subjected to low velocity impact with an instrumented impact test system. Rebound, on-set of perforation and perforation limits of composites are found out. Also, energy profile diagrams of both unidirectional and plain weave E-Glass composites are obtained. According to test results, woven composites are found to be superior to unidirectional composites in the protection limit of low velocity impact. It is also observed that damage growth in woven composites is restricted within a smaller area. Impact tests conclude that strength of the composite materials under dynamic loading increases considerably compared to static loading case as a result of strain rate sensitivity. (C) 2011 Elsevier Ltd. All rights reserved.Conference Object Citation - Scopus: 2An Experimental Study of the Flexray Dynamic Segment(IFAC Secretariat, 2010) Schmidt, K.; Schmidt, E.G.; Demirci, A.; Yürüklü, E.; Karakaya, U.It is expected that the time-triggered FlexRay bus will replace the event-triggered Controller Area Network (CAN) for the high-speed in-vehicle communication in future automobiles. To this end, FlexRay provides a static segment for the transmission of periodic messages and a dynamic segment that is suitable for exchanging event-based (sporadic) messages. In this paper, we experimentally evaluate the operation of the FlexRay dynamic segment. In particular, we study how the maximum and average message delays are affected if the length of the dynamic segment, the message payload, the utilization of the dynamic segment and the priority assignment changes. Our experiments are carried out on a FlexRay network with 6 nodes. © 2010 IFAC.Article Citation - Scopus: 9An integrated scheduling and control model for multi-mode projects(Springer, 2013) Hazir, Oncu; Schmidt, Klaus Werner; 4168In today's highly competitive uncertain project environments, it is of crucial importance to develop analytical models and algorithms to schedule and control project activities so that the deviations from the project objectives are minimized. This paper addresses the integrated scheduling and control in multi-mode project environments. We propose an optimization model that models the dynamic behavior of projects and integrates optimal control into a practically relevant project scheduling problem. From the scheduling perspective, we address the discrete time/cost trade-off problem, whereas an optimal control formulation is used to capture the effect of project control. Moreover, we develop a solution algorithm for two particular instances of the optimal project control. This algorithm combines a tabu search strategy and nonlinear programming. It is applied to a large scale test bed and its efficiency is tested by means of computational experiments. To the best of our knowledge, this research is the first application of optimal control theory to multi-mode project networks. The models and algorithms developed in this research are targeted as a support tool for project managers in both scheduling and deciding on the timing and quantity of control activities.Conference Object Citation - Scopus: 2An Optimization Model to Coordinate Scheduling and Controling in Projects: Case With İnstantaneous Control Constraints(National Technical University of Athens, 2014) Hazir, Ö.; Schmidt, K.W.; Eryilmaz, U.; 17337Today, many enterprises in different industries take part in various projects, and organizational performances depend more and more on project performances. In order to maximize performance, effective management of project functions is crucial. In this regard, we focus on scheduling and control functions and their relation. Characteristics of data sharing among them and possible integration strategies are theoretically investigated. A model base for a decision support framework that accounts for these interdependencies and supports managers is developed. To solve the formulated integrated project scheduling and control problem, a tabu search algorithm is combined with optimal control techniques. As a result, a project schedule as well as the means and timing of interventions are determined such that the project cost is minimized. The obtained results are supported by computational experiments. Integrated models and algorithms to be developed aim to fill an important theoretical gap in project management.Conference Object Analytical Solution of Thermal Stresses In A Functionally Graded Solid Cylinder Within Parabolic Continuous Grading(Trans Tech Publications Ltd, 2013) Ozturk, Ali; Gülgeç, Müfit; Gulgec, Mufit; 4168This paper presents analytical solutions of the thermal stresses in a functionally graded solid cylinder with fixed ends in elastic region. These thermal stresses are due to the uniform heat generation inside the cylinder. Material properties of the functionally graded (FG) cylinder vary radially according to a parabolic form. The material properties are assumed to be independent of the temperature which are yield strength, elasticity modulus, thermal conduction coefficient, thermal expansion coefficient and Poisson's ratio. The solutions for the thermal stresses are valid for both homogeneous and functionally graded materials.Conference Object Citation - Scopus: 12Applied Supervisory Control for A Flexible Manufacturing System(IFAC Secretariat, 2010) Moor, T.; Schmidt, K.; Perk, S.This paper presents a case study in the design and implementation of a discrete event system (DES) of real-world complexity. Our DES plant is a flexible manufacturing system (FMS) laboratory model that consists of 29 interacting components and is controlled via 107 digital signals. Regarding controller design, we apply a hierarchical and decentralised synthesis method from earlier work in order to achieve nonblocking and safe closed-loop behaviour. Regarding implementation, we discuss how digital signals translate to discrete events from a practical point of view, including timing issues. The paper demonstrates how both, design and implementation, are supported by the open-source software tool libFAUDES.Article Citation - Scopus: 12Averaging of receiver aperture for flat-topped incidence(Elsevier Sci Ltd, 2013) Kamacioglu, Canan; Baykal, Yahya; Yazgan, Erdem; 7812Using a flat-topped profile for the incident beam, the power scintillation index for weak atmospheric turbulence is formulated and analytically evaluated. Through the use of the aperture averaging factor, the averaging effect of the finite receiver aperture on the intensity fluctuations for a flat-topped incident beam is examined. The influence of the order of flatness on the averaging is investigated. At large propagation lengths, increasing the flatness parameter decreases the power scintillations and it is possible to further reduce the scintillation by increasing the receiver aperture. Increasing the structure constant increases this effect. (C) 2013 Elsevier Ltd. All rights reserved.Conference Object Comprehensive Comparison of Various Machine Learning Algorithms for RF Fingerprints Classification(Institute of Electrical and Electronics Engineers Inc., 2023) Gundogan, B.; Ergezer, Halit; Ergezer, H.; 293396In these days, the use of drones has become quite common. Remote controls can do the control of these drones with RF signals. It is important to prevent security vulnerabilities caused by using drones in our daily lives. A complex dataset was created by extracting the characteristics of the RF signals and preprocessing them. To solve this complex data set and problem, the application of models including Support Vector Machine (SVM), Random Forest, Decision Tree, Gradient Boosting, XGBoost and Neural Network (NN) models, including various ML models and comparison of optimization studies of these applied models are examined in this article. In addition, a wide range of studies was carried out to compare ML models, including comparison metrics such as Accuracy, Precision, Recall, Mean Squared Error (MSE), F1 Score, $R^{2}$ and Training Time. In line with these results, the highest score was obtained in the $\mathrm{R}^{2}$ comparison metric (97%) in the Neural Network (NN). Compared to the others, the results of Neural Network (NN) were more successful, but the Training Time (245 sec) in the Neural Network (NN) method is by far more than the other ML methods, which shows us that the NN method requires a very high computing process. As a result of the comparison, another outstanding Ensemble-based ML method is Decision Tree. This is because besides the very low Training Time $(5\sec)$, it has managed to be the 2nd ML algorithm with the highest $\mathrm{R}^{2}$ score (96%). Apart from these, among other ML methods, SVM performed slightly less well $(\mathrm{R}^{2}$ 91%) in solving this complex problem. The advanced Gradient Method (95%) and XGBoost (96%), which also have the Ensemble structure, showed a head-to-head performance regarding $\mathrm{R}^{2}$ scores. However, XGBoost (30 sec) has a very short Training Time compared to Gradient Boosting (180 sec). As a result, the approach of each ML method to solving the complex problem differed from each other, and the success rates and Training Time also differed equally. The most important work to be done here is to choose which ML method you want to achieve according to the limited system in hand and the performance-accuracy dilemma. © 2023 IEEE.Conference Object Computation of Reduced Diagnosers for the Fault Diagnosis of Discrete Event Systems(2014) Kart, Bora Eser; Schmidt, KlausMany complex systems in different areas such as manufacturing, telecommunications or transportation can be modeled as discrete event systems (DES). In this paper, we consider the fault diagnosis for DES which is concerned with detecting fault occurrences in a DES within a bounded number of event occurrences by a diagnoser automaton. Hereby, such diagnoser is able to observe a subset of the system events and the maximum required number of event occurrences until a fault detection is denoted as the worst case detection delay (WCDD). The main contribution of the paper is an approach for reducing the number of required observations for fault diagnosis without increasing the WCDD. As a result, it is possible to determine a diagnoser with a small size which is essential in practical applications. We first develop an algorithm for computing the WCDD and then adapt an approach for the reduction of the observable event set in order to obtain a reduced diagnoser. The application of our method to a communication system example demonstrates its practicability.Conference Object Computation of Supervisors for Fault-Recovery and Repair for Discrete Event Systems(Univelt Inc., 2014) Sulek, A.N.; Schmidt, K.W.; 17337; 107424In this paper, we study the fault-recovery and repair of discrete event systems (DES). To this end, we first develop a new method for the fault-recovery of DES. In particular, we compute a fault-recovery supervisor that follows the specified nominal system behavior until a fault-occurrence, that continues its operation according to a degraded specification after a fault and that finally converges to a desired behavior after fault. We next show that our method is also applicable to system repair and we propose an iterative procedure that determines a supervisor for an arbitrary number of fault occurrences and system repairs. We demonstrate our method with a manufacturing system example. Copyright © 2014 IFAC.Article Computation of supervisors for reconfigurable machine tools(Springer, 2015) Schmidt, Klaus Werner; 17337The rapid reconfiguration of manufacturing systems is an important issue in today's manufacturing technology in order to adjust the production to varying product demands and types. In this paper, we study the control of reconfigurable machine tools (RMTs) with the aim of fast reconfiguration and an easy controller implementation. We first formulate a particular reconfiguration problem for RMTs in a discrete event system setting, and then provide a necessary and sufficient condition for its solution. Moreover, we propose a polynomial-time algorithm for the construction of a reconfiguration supervisor as the composition of one modular supervisor for each separate RMT configuration. Each modular supervisor operates in three modes. In the first mode, it tracks the plant state if its corresponding configuration is inactive. In the second mode, it performs a configuration change if its corresponding configuration becomes active and in the third mode, it follows the specified behavior of its corresponding configuration if the configuration is active. An important property of the proposed reconfiguration supervisor is that it performs reconfigurations in a bounded number of event occurrences. In addition, the modular realization of our reconfiguration supervisor enables controller modifications such as adding or removing configurations during run-time. All results presented in the paper are illustrated by an RMT example.Article Controller area network with priority queues and FIFO queues: improved schedulability analysis and message set extension(inderscience Enterprises Ltd, 2016) Schmidt, Klaus Werner; Alkan, Burak; Schmidt, Ece Guran; Karani, Duygu Culum; Karakaya, Utku; 17337Controller area network (CAN) enables communication of electronic control units (ECUs) via messages using priority-based arbitration, which requires the implementation of priority queues (PQs) in the ECU device driver. Nevertheless, it is possible that not all ECUs on a CAN support PQs but use FIFO queues (FQs) instead. In this case, the classical CAN scheduling model with PQs is not suitable for the computation of message worst-case responsetimes (WCRTs) that are essential for verifying the correct vehicle operation. This paper considers an existing scheduling model for CAN with both PQs and FQs. First, an improved algorithm for speeding up the WCRT computation is proposed. Second, the practical case where an existing CAN message set is extended by new messages is addressed. An original algorithm for assigning priorities to new messages while keeping the priority order of existing messages is developed. Both algorithms are evaluated by computational experiments.