ログイン
言語:

WEKO3

  • トップ
  • コミュニティ
  • ランキング
AND
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

{"_buckets": {"deposit": "7f2a5e33-44bc-4a3f-a9a7-58e384087b6f"}, "_deposit": {"id": "1929", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "1929"}, "status": "published"}, "_oai": {"id": "oai:niigata-u.repo.nii.ac.jp:00001929"}, "item_5_biblio_info_6": {"attribute_name": "\u66f8\u8a8c\u60c5\u5831", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "1993-10", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "10", "bibliographicPageEnd": "1609", "bibliographicPageStart": "1607", "bibliographicVolumeNumber": "E76-A", "bibliographic_titles": [{"bibliographic_title": "IEICE transactions on fundamentals of electronics, communications and computer sciences"}, {"bibliographic_title": "IEICE transactions on fundamentals of electronics, communications and computer sciences", "bibliographic_titleLang": "en"}]}]}, "item_5_description_4": {"attribute_name": "\u6284\u9332", "attribute_value_mlt": [{"subitem_description": "The synchronic distance is a fundamental concept in a Petri net. Marked graphs form a subclass of Petri nets. Given a matrix D, we are interested in the problem of finding a marked graph whose synchronic distance matrix is D. It is wellknown that the synchronic disrance matrix of a marked graph is a distance matrix. In this letter, we give a matrix D such that D is a distance matrix and there does not exist a marked graph whose synchronic distance matrix is D.", "subitem_description_type": "Abstract"}]}, "item_5_full_name_3": {"attribute_name": "\u8457\u8005\u5225\u540d", "attribute_value_mlt": [{"nameIdentifiers": [{"nameIdentifier": "6279", "nameIdentifierScheme": "WEKO"}], "names": [{"name": "\u4ed9\u77f3, \u6b63\u548c"}]}, {"nameIdentifiers": [{"nameIdentifier": "19", "nameIdentifierScheme": "WEKO"}], "names": [{"name": "\u5c71\u53e3, \u82b3\u96c4"}]}]}, "item_5_publisher_7": {"attribute_name": "\u51fa\u7248\u8005", "attribute_value_mlt": [{"subitem_publisher": "The Institute of Electronics, Information and Communication Engineers"}]}, "item_5_relation_31": {"attribute_name": "\u7570\u7248\u3067\u3042\u308b", "attribute_value_mlt": [{"subitem_relation_type": "isVersionOf", "subitem_relation_type_id": {"subitem_relation_type_id_text": "http://www.ieice.org/jpn/trans_online/", "subitem_relation_type_select": "URI"}}]}, "item_5_rights_15": {"attribute_name": "\u6a29\u5229", "attribute_value_mlt": [{"subitem_rights": "copyright\u00a91993 IEICE"}]}, "item_5_select_19": {"attribute_name": "\u8457\u8005\u7248\u30d5\u30e9\u30b0", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_5_source_id_11": {"attribute_name": "\u66f8\u8a8c\u30ec\u30b3\u30fc\u30c9ID", "attribute_value_mlt": [{"subitem_source_identifier": "AA10826239", "subitem_source_identifier_type": "NCID"}]}, "item_5_source_id_9": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "09168508", "subitem_source_identifier_type": "ISSN"}]}, "item_creator": {"attribute_name": "\u8457\u8005", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Mikami, Kiyoshi"}], "nameIdentifiers": [{"nameIdentifier": "6275", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Tamura, Hiroshi"}], "nameIdentifiers": [{"nameIdentifier": "6276", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sengoku, Masakazu"}], "nameIdentifiers": [{"nameIdentifier": "6277", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Yamaguchi, Yoshio"}], "nameIdentifiers": [{"nameIdentifier": "19", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "\u30d5\u30a1\u30a4\u30eb\u60c5\u5831", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2019-07-29"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "e76-a_10_1607.pdf", "filesize": [{"value": "214.9 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 214900.0, "url": {"label": "e76-a_10_1607.pdf", "url": "https://niigata-u.repo.nii.ac.jp/record/1929/files/e76-a_10_1607.pdf"}, "version_id": "08763d1f-1fa3-4243-838b-ac765e7ccd7e"}]}, "item_keyword": {"attribute_name": "\u30ad\u30fc\u30ef\u30fc\u30c9", "attribute_value_mlt": [{"subitem_subject": "marked graph", "subitem_subject_scheme": "Other"}, {"subitem_subject": "synchronic distance matrix", "subitem_subject_scheme": "Other"}, {"subitem_subject": "distance matrix", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "\u8a00\u8a9e", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "\u8cc7\u6e90\u30bf\u30a4\u30d7", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "On a Sufficient Condition for a Matrix to be the Synchronic Distance Matrix of a Marked Graph", "item_titles": {"attribute_name": "\u30bf\u30a4\u30c8\u30eb", "attribute_value_mlt": [{"subitem_title": "On a Sufficient Condition for a Matrix to be the Synchronic Distance Matrix of a Marked Graph"}]}, "item_type_id": "5", "owner": "1", "path": ["453/454", "423/424/425"], "permalink_uri": "http://hdl.handle.net/10191/6513", "pubdate": {"attribute_name": "\u516c\u958b\u65e5", "attribute_value": "2008-07-28"}, "publish_date": "2008-07-28", "publish_status": "0", "recid": "1929", "relation": {}, "relation_version_is_last": true, "title": ["On a Sufficient Condition for a Matrix to be the Synchronic Distance Matrix of a Marked Graph"], "weko_shared_id": 2}
  1. 060 工学部
  2. 10 学術雑誌論文
  3. 10 査読済論文
  1. 0 資料タイプ別
  2. 01 学術雑誌論文

On a Sufficient Condition for a Matrix to be the Synchronic Distance Matrix of a Marked Graph

http://hdl.handle.net/10191/6513
7582ee57-e6d7-4cd0-a1bb-74e17b68c6b7
名前 / ファイル ライセンス アクション
e76-a_10_1607.pdf e76-a_10_1607.pdf (214.9 kB)
Item type 学術雑誌論文 / Journal Article(1)
公開日 2008-07-28
タイトル
タイトル On a Sufficient Condition for a Matrix to be the Synchronic Distance Matrix of a Marked Graph
言語
言語 eng
キーワード
主題Scheme Other
主題 marked graph
キーワード
主題Scheme Other
主題 synchronic distance matrix
キーワード
主題Scheme Other
主題 distance matrix
資源タイプ
資源 http://purl.org/coar/resource_type/c_6501
タイプ journal article
著者 Mikami, Kiyoshi

× Mikami, Kiyoshi

WEKO 6275

Mikami, Kiyoshi

Search repository
Tamura, Hiroshi

× Tamura, Hiroshi

WEKO 6276

Tamura, Hiroshi

Search repository
Sengoku, Masakazu

× Sengoku, Masakazu

WEKO 6277

Sengoku, Masakazu

Search repository
Yamaguchi, Yoshio

× Yamaguchi, Yoshio

WEKO 19

Yamaguchi, Yoshio

Search repository
著者別名
識別子
識別子 6279
識別子Scheme WEKO
姓名
姓名 仙石, 正和
著者別名
識別子
識別子 19
識別子Scheme WEKO
姓名
姓名 山口, 芳雄
抄録
内容記述タイプ Abstract
内容記述 The synchronic distance is a fundamental concept in a Petri net. Marked graphs form a subclass of Petri nets. Given a matrix D, we are interested in the problem of finding a marked graph whose synchronic distance matrix is D. It is wellknown that the synchronic disrance matrix of a marked graph is a distance matrix. In this letter, we give a matrix D such that D is a distance matrix and there does not exist a marked graph whose synchronic distance matrix is D.
書誌情報 IEICE transactions on fundamentals of electronics, communications and computer sciences
en : IEICE transactions on fundamentals of electronics, communications and computer sciences

巻 E76-A, 号 10, p. 1607-1609, 発行日 1993-10
出版者
出版者 The Institute of Electronics, Information and Communication Engineers
ISSN
収録物識別子タイプ ISSN
収録物識別子 09168508
書誌レコードID
収録物識別子タイプ NCID
収録物識別子 AA10826239
権利
権利情報 copyright©1993 IEICE
著者版フラグ
値 publisher
異版である
関連タイプ isVersionOf
関連識別子
識別子タイプ URI
関連識別子 http://www.ieice.org/jpn/trans_online/
戻る
0
views
See details
Views

Versions

Ver.1 2021-03-01 09:04:24.429747
Show All versions

Share

Mendeley CiteULike Twitter Facebook Print Addthis

Cite as

Export

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by CERN Data Centre & Invenio


Powered by CERN Data Centre & Invenio