Bulletin of the Society of Sea Water Science, Japan最新文献_第9页

Decision Diagrams for Solving a Job Scheduling Problem Under Precedence Constraints 优先约束下作业调度问题的决策图

Bulletin of the Society of Sea Water Science, Japan Pub Date : 2018-06-01 DOI: 10.4230/LIPIcs.SEA.2018.5

Kosuke Matsumoto, Kohei Hatano, Eiji Takimoto

引用次数: 3

Fleet Management for Autonomous Vehicles Using Multicommodity Coupled Flows in Time-Expanded Networks 时间扩展网络中基于多商品耦合流的自动驾驶车辆车队管理

Bulletin of the Society of Sea Water Science, Japan Pub Date : 2018-06-01 DOI: 10.4230/LIPIcs.SEA.2018.25

Sahar Bsaybes, A. Quilliot, Annegret K. Wagler

{"title":"Fleet Management for Autonomous Vehicles Using Multicommodity Coupled Flows in Time-Expanded Networks","authors":"Sahar Bsaybes, A. Quilliot, Annegret K. Wagler","doi":"10.4230/LIPIcs.SEA.2018.25","DOIUrl":"https://doi.org/10.4230/LIPIcs.SEA.2018.25","url":null,"abstract":"VIPAFLEET is a framework to develop models and algorithms for managing a fleet of Individual Public Autonomous Vehicles (VIPA). We consider a homogeneous fleet of such vehicles distributed at specified stations in a closed site to supply internal transportation, where the vehicles can be used in different modes of circulation (tram mode, elevator mode, taxi mode). We treat in this paper a variant of the Online Pickup-and-Delivery Problem related to the taxi mode by means of multicommodity coupled flows in a time-expanded network and propose a corresponding integer linear programming formulation. This enables us to compute optimal offline solutions. However, to apply the well-known meta-strategy Replan to the online situation by solving a sequence of offline subproblems, the computation times turned out to be too long, so that we devise a heuristic approach h-Replan based on the flow formulation. Finally, we evaluate the performance of h-Replan in comparison with the optimal offline solution, both in terms of competitive analysis and computational experiments, showing that h-Replan computes reasonable solutions, so that it suits for the online situation.","PeriodicalId":9448,"journal":{"name":"Bulletin of the Society of Sea Water Science, Japan","volume":"47 1","pages":"25:1-25:14"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76875998","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams 用零抑制二值和三值决策图枚举没有太小连通分量的图分区

Bulletin of the Society of Sea Water Science, Japan Pub Date : 2018-04-01 DOI: 10.4230/LIPIcs.SEA.2018.21

Yu Nakahata, J. Kawahara, S. Kasahara

引用次数: 1

Restructuring expression dags for efficient parallelization 重组表达式标签以实现高效并行化

Bulletin of the Society of Sea Water Science, Japan Pub Date : 2018-04-01 DOI: 10.4230/LIPIcs.SEA.2018.20

M. Wilhelm

引用次数: 1

Experimental Evaluation of Parameterized Algorithms for Feedback Vertex Set 反馈顶点集参数化算法的实验评价

Bulletin of the Society of Sea Water Science, Japan Pub Date : 2018-03-02 DOI: 10.4230/LIPIcs.SEA.2018.12

K. Kiljan, Marcin Pilipczuk

引用次数: 12

Aggregative Coarsening for Multilevel Hypergraph Partitioning 多级超图划分的聚合粗化

Bulletin of the Society of Sea Water Science, Japan Pub Date : 2018-02-01 DOI: 10.4230/LIPIcs.SEA.2018.2

Ruslan Shaydulin, Ilya Safro

引用次数: 11

Memetic Graph Clustering 模因图聚类

Bulletin of the Society of Sea Water Science, Japan Pub Date : 2018-02-01 DOI: 10.4230/LIPIcs.SEA.2018.3

Sonja Biedermann, M. Henzinger, Christian Schulz, Bernhard Schuster

引用次数: 9

An Efficient Local Search for the Minimum Independent Dominating Set Problem 最小独立支配集问题的有效局部搜索

Bulletin of the Society of Sea Water Science, Japan Pub Date : 2018-02-01 DOI: 10.4230/LIPIcs.SEA.2018.13

Kazuya Haraguchi

引用次数: 0

An Ambiguous Coding Scheme for Selective Encryption of High Entropy Volumes 高熵体积选择性加密的一种模糊编码方案

Bulletin of the Society of Sea Water Science, Japan Pub Date : 2018-01-01 DOI: 10.4230/LIPIcs.SEA.2018.7

M. O. Külekci

{"title":"An Ambiguous Coding Scheme for Selective Encryption of High Entropy Volumes","authors":"M. O. Külekci","doi":"10.4230/LIPIcs.SEA.2018.7","DOIUrl":"https://doi.org/10.4230/LIPIcs.SEA.2018.7","url":null,"abstract":"This study concentrates on the security of high-entropy volumes, where entropy–encoded multimedia files or compressed text sequences are the most typical sources. We consider a system in which the cost of encryption is hefty in terms of some metric (e.g., time, memory, energy, or bandwidth), and thus, creates a bottleneck. With the aim of reducing the encryption cost on such a system, we propose a data coding scheme to achieve the data security by encrypting significantly less data than the original size without sacrifice in secrecy. The main idea of the proposed technique is to represent the input sequence by not uniquely–decodable codewords. The proposed coding scheme splits a given input into two partitions as the payload, which consists of the ambiguous codeword sequence, and the disambiguation information, which is the necessary knowledge to properly decode the payload. Under the assumed condition that the input data is the output of an entropy-encoder, and thus, on ideal case independently and identically distributed, the payload occupies ≈ (d−2) d , and the disambiguation information takes ≈ 2 d of the encoded stream, where d > 2 denotes a chosen parameter typically between 6 to 20. We propose to encrypt the payload and keep the disambiguation information in plain to reduce the amount of data to be encrypted, where recursive representation of the payload with the proposed coding can decrease the to-be-encrypted volume further. When 2 · 2 ≤ n ≤ τ · d · 2, for τ = d−1.44 2 , we show that the contraction of the possible message space 2 due to the public disambiguation information is accommodated by keeping the codeword set secret. We discuss possible applications of the proposed scheme in practice. 2012 ACM Subject Classification Information systems → Data encryption, Information systems → Multimedia databases, Mathematics of computing → Combinatorics, Mathematics of computing → Coding theory, Security and privacy → Management and querying of encrypted data","PeriodicalId":9448,"journal":{"name":"Bulletin of the Society of Sea Water Science, Japan","volume":"11 1","pages":"7:1-7:13"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79995339","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Desalination of salt solutions by means of circulating diffusion dialysis system using salinity gradient energy 利用盐度梯度能的循环扩散透析系统对盐溶液进行脱盐

Bulletin of the Society of Sea Water Science, Japan Pub Date : 2018-01-01 DOI: 10.11457/SWSJ.72.6_334

Yuki Noguchi, M. Yasukawa, Mitsuru Higa

引用次数: 0