Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection

Permanent URI for this collectionhttps://hdl.handle.net/11147/7148

Browse

Filters

2005 - 200912010 - 20151

Settings

Institution Author: search.filters.institutionAuthor.Ayav, TolgaScopus Q: search.filters.scopusQuartile.Q3

Search Results

Now showing 1 - 2 of 2
  • Article
    Optimal Control for Real-Time Feedback Rate-Monotonic Schedulers
    (Springer Verlag, 2005) Ayav, Tolga; Ferrari-Trecate, Giancarlo
    This paper presents an optimal control scheme for a real-time feedback control rate-monotonic scheduling (FC-RMS) system. We consider two-version tasks composed of a mandatory and an optional part to be scheduled according to the FC-RMS. In FC-RMS, the controller provides a feedback strategy for deciding about the execution or rejection of the optional sub-tasks. By modeling the task execution times as random variables, we first find the statistical model of FC-RMS and then we design a pure optimal controller and an optimal controller with feedforward integral compensation. The comparison of these two schemes with common Proportional-Integral-Derivative (PID) controller highlights the benefit of the optimal scheme with integral compensation. The results are demonstrated through the real implementation of FC-RMS on RT-Linux.
  • Article
    Citation - WoS: 3
    Citation - Scopus: 4
    Full-Exact Approach for Frequent Itemset Hiding
    (IGI Global Publishing, 2015) Ayav, Tolga; Ergenç, Belgin
    This paper proposes a novel, exact approach that relies on integer programming for association rule hiding. A large panorama of solutions exists for the complex problem of itemset hiding: from practical heuristic approaches to more accurate exact approaches. Exact approaches provide better solutions while suffering from the lack of performance and existing exact approaches still augment their methods with heuristics to make the problem solvable. In this case, the solution may not be optimum. This work present a full-exact method, without any need for heuristics. Extensive tests are conducted on 10 real datasets to analyze distance and information loss performances of the algorithm in comparison to a former similar algorithm. Since the approach provides the optimum solution to the problem, it should be considered as a reference method.