GLORIA

GEOMAR Library Ocean Research Information Access

X

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • English  (2)
  • Economics  (2)
Material
Publisher
Person/Organisation
Language
  • English  (2)
Years
Subjects(RVK)
  • Economics  (2)
RVK
  • 1
    Online Resource
    Online Resource
    An Intrusion Detection Scheme Based on Repeated Game in Smart Home
    Hindawi Limited ; 2020
    In:  Mobile Information Systems Vol. 2020 ( 2020-09-17), p. 1-9
    Details
    In: Mobile Information Systems, Hindawi Limited, Vol. 2020 ( 2020-09-17), p. 1-9
    Abstract: Smart Home brings a new people-oriented home life experience. However, the edge devices in this system are facing severe threats such as data security and equipment safety. To solve the above problems, this paper proposes an intrusion detection scheme based on repeated game. We first use the K-Nearest Neighbors (KNN) algorithm to classify edge devices and equip the intrusion detection system to cluster heads. Secondly, we use the regret minimization algorithm to determine the mixed strategy Nash equilibrium of the one-order game and then take a severe punishment strategy to domesticate malicious attackers. Thirdly, the intrusion detection system can detect malicious attackers by reduction of payoff. Finally, the detailed experimental results show that the proposed scheme can reduce the loss of attacked intrusion detection system and then achieve the purpose of defending against the attacker.
    Type of Medium: Online Resource
    ISSN: 1574-017X , 1875-905X
    URL: Article
    DOI: 10.1155/2020/8844116
    RVK:
    QA 10000
    Language: English
    Publisher: Hindawi Limited
    Publication Date: 2020
    detail.hit.zdb_id: 2187808-0
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 2
    Online Resource
    Online Resource
    Sequencing single machine multiple-class customer order jobs using heuristics and improved simulated annealing algorithms
    EDP Sciences ; 2023
    In:  RAIRO - Operations Research Vol. 57, No. 3 ( 2023-05), p. 1417-1441
    Details
    In: RAIRO - Operations Research, EDP Sciences, Vol. 57, No. 3 ( 2023-05), p. 1417-1441
    Abstract: The multiple job class scheduling problem arises in contexts where a group of jobs belong to multiple classes and in which if all jobs in the same class are operated together, extra setup times would not be needed. On the other hand, the customer order scheduling problem focuses on finishing all jobs from the same order at the same time in order to reduce shipping costs. However, works on customer orders coupled with class setup times do not appear often in the literature. Hence we address here a bicriteria single machine customer order scheduling problem together with multiple job classes. The optimality criterion minimizes a linear combination of the sum of the ranges and sum of tardiness of all customer orders. In light of the high complexity of the concerned problem, we propose a lower bound formula and a property to be used in a branch-and-bound method for optimal solutions. To find approximate solutions, we then propose four heuristics together with a local search method, four cloudy theoretical simulated annealing and a cloudy theoretical simulated annealing hyperheuristic along with five low-level heuristics. The simulation results of the proposed heuristics and algorithms are analyzed.
    Type of Medium: Online Resource
    ISSN: 0399-0559 , 2804-7303
    URL: Article
    DOI: 10.1051/ro/2023056
    RVK:
    QA 10000
    Language: English
    Publisher: EDP Sciences
    Publication Date: 2023
    detail.hit.zdb_id: 1468388-X
    SSG: 3,2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...