Bilgilendirme: Kurulum ve veri kapsamındaki çalışmalar devam etmektedir. Göstereceğiniz anlayış için teşekkür ederiz.

Mekatronik Mühendisliği Bölümü

Permanent URI for this communityhttps://hdl.handle.net/20.500.12416/20

Browse

Browsing Mekatronik Mühendisliği Bölümü by browse.metadata.publisher "IEEE"

Filter results by typing the first few letters
Now showing 1 - 5 of 5
  • Thumbnail Image
    Book Part
    A configurable CAN FD controller: architecture and implementation
    (IEEE, 2017) Afşin, Mehmet Ertuğ; Schmidt, Klaus Werner; Schmidt, Ece Güran
    CAN 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.
  • Thumbnail Image
    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 Werner
    A 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.
  • Thumbnail Image
    Conference Object
    Localization of Semantic Category Classification in FMRı Images
    (IEEE, 2014) Alkan, Sarper; Yarman-Vural, Fatos T.
    In this study, we provide a methodology to localize the brain regions that contribute to semantic category classification. For this purpose we first cluster the data using spectral clustering. Then we extract local features within each cluster by using mesh-arc descriptors. Finally, we test the classification accuracy of each cluster against a hypothesis testing measure we provide here. We have found that, for the experimental task at hand, calcerine fissure and angular gyrus were most effective in classification. These results are shown to be match well with the nature of the experiment. Thus the validity of our approach is confirmed.
  • Thumbnail Image
    Article
    Optimal Message Scheduling for the Static Segment of Flexray
    (IEEE, 2010) Schmidt, Klaus Werner; Schmidt, Ece G.
    In this paper, we study the scheduling of periodic messages in the static segment of the FlexRay protocol. Our approach is based on two performance metrics. Similar to previous work, we seek to allocate a minimum number of frame IDs (FIDs) in the static segment. In addition, different from existing work, we want to minimize the message jitter, i.e., the deviation of the message transmission from the required periodicity. To this end, we first derive analytical expressions that quantify the FID allocation and the jitter, and then formulate a linear integer programming problem whose solution is the desired message schedule. An example illustrates our schedule optimization.
  • Thumbnail Image
    Publication
    Schedulability Analysis and Message Schedule Computation for the Dynamic Segment of Flexray
    (IEEE, 2010) Schmidt, Klaus Werner; Schmidt, Ece G.
    In this paper, we perform the schedulability analysis and schedule computation for sporadic real-time messages in the dynamic segment of the FlexRay protocol. We first formulate a linear integer programming problem that allows to determine if a given message schedule is feasible, i.e., the worst-case delay of each message is smaller than its deadline. Then, we develop a heuristic algorithm that enables the efficient computation of feasible schedules. Our results are illustrated by an experimental setup with three FlexRay nodes.