<?xml version='1.0' encoding='UTF-8'?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-03-16T00:47:00Z</responseDate>
  <request metadataPrefix="jpcoar_1.0" verb="GetRecord" identifier="oai:ipsj.ixsq.nii.ac.jp:00208506">https://ipsj.ixsq.nii.ac.jp/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:ipsj.ixsq.nii.ac.jp:00208506</identifier>
        <datestamp>2025-01-19T18:50:10Z</datestamp>
        <setSpec>6164:6165:6462:10428</setSpec>
      </header>
      <metadata>
        <jpcoar:jpcoar xmlns:datacite="https://schema.datacite.org/meta/kernel-4/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcndl="http://ndl.go.jp/dcndl/terms/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:jpcoar="https://github.com/JPCOAR/schema/blob/master/1.0/" xmlns:oaire="http://namespace.openaire.eu/schema/oaire/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:rioxxterms="http://www.rioxx.net/schema/v2.0/rioxxterms/" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns="https://github.com/JPCOAR/schema/blob/master/1.0/" xsi:schemaLocation="https://github.com/JPCOAR/schema/blob/master/1.0/jpcoar_scm.xsd">
          <dc:title>アニーリング計算を用いたマルウェア感染ネットワークの遮断最適化</dc:title>
          <dc:title xml:lang="en">Solving Malware-Infected Network Disconnection Optimization Problems Using Annealing Computation</dc:title>
          <jpcoar:creator>
            <jpcoar:creatorName>山口, 純平</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName>清水, 俊也</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName>古川, 和快</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName>鳥居, 悟</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName>森川, 郁也</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName>伊豆, 哲也</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Junpei, Yamaguchi</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Toshiya, Shimizu</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Kazuyoshi, Furukawa</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Satoru, Torii</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Ikuya, Morikawa</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Tetsuya, Izu</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:subject subjectScheme="Other">アニーリング，遮断最適化門d内</jpcoar:subject>
          <datacite:description descriptionType="Other">近年，量子アニーリング計算機や疑似的に量子アニーリングを再現するアニーリング計算機の開発が進んでおり，&lt;br&gt;実用的な規模の組合せ最適化問題を解くことが可能となりつつある．&lt;br&gt;セキュリティの分野においても応用研究が進められており，&lt;br&gt;汎用計算機を超えない範囲ではあるが暗号解析で成果が出始めている．&lt;br&gt;これらのノウハウを元に，我々はアニーリング計算機のさらなる応用として，&lt;br&gt;サイバーセキュリティの課題である「マルウェア感染ネットワークの通信路遮断最適化問題」の単純化したモデルを設計し，&lt;br&gt;これに対してアニーリング計算機を適用した．&lt;br&gt;この中で我々は，従来のように最適化問題を既知の組合せ最適化問題に帰着させるのではなく，実問題に近い形で独自の定式化を与えた．&lt;br&gt;また，富士通のアニーリング計算機であるデジタルアニーラ（DA）を用いた本定式化の求解実験では，&lt;br&gt;全数探索の計算量が2の5246乗となる219台のPC・サーバが接続されたネットワークの遮断最適化問題に対して，&lt;br&gt;自明な解より最適な遮断の組合せを計算できた．</datacite:description>
          <datacite:description descriptionType="Other">Recently, annealing computers including quantum annealing computers and digital computers specialized for &lt;br&gt;annealing computation inspired by the quantum annealing have been developed, &lt;br&gt;and the time is approaching when these computers can solve practical-scale combinatorial optimization problems. &lt;br&gt;Although these computers have not reached general computers, they are applied to security fields such as cryptanalysis. &lt;br&gt;With knowledge of these studies, we apply them to a simplified model of "malware-infected network disconnection optimization problem" as a further application. &lt;br&gt;In this study, we give a formulation of the problem close to reality, not attributing the problem to known combinatorial optimization problems. &lt;br&gt;In our experiments using the Digital Annealer developed by Fujitsu, &lt;br&gt;we tried to solve a problem which has a network with 219 PC and Server connections and 5246 bit complexity in exhaustive search &lt;br&gt;and succeeded in finding a solution of the problem better than that of the trivial solution.</datacite:description>
          <dc:publisher xml:lang="ja">情報処理学会</dc:publisher>
          <datacite:date dateType="Issued">2020-10-19</datacite:date>
          <dc:language>jpn</dc:language>
          <dc:type rdf:resource="http://purl.org/coar/resource_type/c_5794">conference paper</dc:type>
          <jpcoar:identifier identifierType="URI">https://ipsj.ixsq.nii.ac.jp/records/208506</jpcoar:identifier>
          <jpcoar:sourceTitle>コンピュータセキュリティシンポジウム2020論文集</jpcoar:sourceTitle>
          <jpcoar:pageStart>559</jpcoar:pageStart>
          <jpcoar:pageEnd>566</jpcoar:pageEnd>
          <jpcoar:file>
            <jpcoar:URI label="IPSJCSS2020078.pdf">https://ipsj.ixsq.nii.ac.jp/record/208506/files/IPSJCSS2020078.pdf</jpcoar:URI>
            <jpcoar:mimeType>application/pdf</jpcoar:mimeType>
            <jpcoar:extent>1.7 MB</jpcoar:extent>
            <datacite:date dateType="Available">2022-10-19</datacite:date>
          </jpcoar:file>
        </jpcoar:jpcoar>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
