发布求助
文献互助 智能选刊 最新文献

Ipsj Digital Courier最新文献

筛选
英文 中文
New Certificate Chain Discovery Methods for Trust Establishment in Ad Hoc Networks and Their Evaluation Ad Hoc网络中信任建立的新证书链发现方法及其评价
Ipsj Digital Courier Pub Date : 2008-01-15 DOI: 10.2197/IPSJDC.4.18
H. Mohri, Ikuya Yasuda, Y. Takata, H. Seki
{"title":"New Certificate Chain Discovery Methods for Trust Establishment in Ad Hoc Networks and Their Evaluation","authors":"H. Mohri, Ikuya Yasuda, Y. Takata, H. Seki","doi":"10.2197/IPSJDC.4.18","DOIUrl":"https://doi.org/10.2197/IPSJDC.4.18","url":null,"abstract":"In an ad hoc network, we cannot assume a trusted certificate authority and a centralized repository that are used in ordinary Public-Key Infrastructure (PKI). Hence a PKI system of the web-of-trust type in which each node can issue certificates to others in a self-organizing manner has been studied. Although this system is useful for ad hoc networks, it has the problem that for authentication a node needs to find a certificate-chain to the destination node. In this paper, we formally model a web-of-trust-type PKI system, define the certificate-chain discovery problem, and propose a new distributed algorithm and its modification that solve the problem. Furthermore, we propose a measure of communication cost, and according to the measure, we compare our algorithm with an existing method by numerical computation for large-size networks and by simulation on randomly generated unit disk graphs for moderate-size networks. The simulation results show that the communication cost of the proposed method is less than 10% of the existing method.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114354603","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}
引用次数: 1
A Performance Study of Inter-Vehicle Communication Protocols for Collision Warning System 碰撞预警系统中车辆间通信协议性能研究
Ipsj Digital Courier Pub Date : 2008-01-15 DOI: 10.2197/IPSJDC.4.31
N. Thepvilojanapong, S. Motegi, H. Horiuchi
{"title":"A Performance Study of Inter-Vehicle Communication Protocols for Collision Warning System","authors":"N. Thepvilojanapong, S. Motegi, H. Horiuchi","doi":"10.2197/IPSJDC.4.31","DOIUrl":"https://doi.org/10.2197/IPSJDC.4.31","url":null,"abstract":"Collision Warning Systems (CWS) can help reduce the probability and severity of car accidents by providing some sort of appropriate warning to the driver through Inter-Vehicle Communication (IVC). Especially, the CWS can help avoid collision at intersections where traffic accidents are frequent (Study Group for Promotion of ASV; Traffic Bureau, 2007). A vehicle equipped with the CWS periodically broadcasts its information, and the CWS on other vehicles use the received information to alert drivers, helping them become aware of the existence of other vehicles. To avoid collision, the CWS has concrete objectives of IVC, i.e., the CWS should receive useful information accurately and in time. Many IVC protocols including our previously proposed relay control protocol (Motegi, et al., 2006) have been developed and evaluated through traditional metrics. However, instead of using such traditional metrics directly, many requirements of the intersection CWS must be considered to judge the feasibility and practicability of IVC protocols. This paper shows performance evaluation of our previous IVC protocol developed for CWS. To study the behavior of IVC protocols, we first describe a simulation methodology including performance metrics by means of reliable and timely communications. We then use such metrics to compare our IVC protocol with the flooding protocol in large-scale simulated networks. The simulation results show that our previously proposed protocol is a good candidate for real implementation because it passes all requirements of the intersection CWS.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132535786","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
Anomaly Detection on Mobile Phone Based Operational Behavior 基于操作行为的手机异常检测
Ipsj Digital Courier Pub Date : 2008-01-15 DOI: 10.2197/IPSJDC.4.9
T. Isohara, K. Takemori, I. Sasase
{"title":"Anomaly Detection on Mobile Phone Based Operational Behavior","authors":"T. Isohara, K. Takemori, I. Sasase","doi":"10.2197/IPSJDC.4.9","DOIUrl":"https://doi.org/10.2197/IPSJDC.4.9","url":null,"abstract":"Information protection schemes on mobile phones become important challenges because mobile phones have many types of private information. In general, user authentication and anomaly detection are effective to prevent attacks by illegal users. However, the user authentication can be applied only at the beginning of use and the conventional anomaly detection is not suited for mobile phones, only but computer systems. In this paper, we propose a simple and easy-to-use anomaly detection scheme on mobile phones. The scheme records the keystrokes as the mobile phone is operated, and an anomaly detection algorithm calculates a score of similarity, to detect illegal users. We implemented a prototype system on the BREW (Binary Run-time Environment for Wireless) emulator and evaluated error rates by using results from 15 testers. From experiments results, we show the proposed scheme is able to apply the anomaly detection by checking the similarity score several times.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121534231","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}
引用次数: 9
Soundness of Rewriting Induction Based on an Abstract Principle 基于抽象原理的改写归纳的合理性
Ipsj Digital Courier Pub Date : 2008-01-15 DOI: 10.2197/IPSJDC.4.58
Takahito Aoto
{"title":"Soundness of Rewriting Induction Based on an Abstract Principle","authors":"Takahito Aoto","doi":"10.2197/IPSJDC.4.58","DOIUrl":"https://doi.org/10.2197/IPSJDC.4.58","url":null,"abstract":"Rewriting induction (Reddy, 1990) is a method to prove inductive theorems of term rewriting systems automatically. Koike and Toyama(2000) extracted an abstract principle of rewriting induction in terms of abstract reduction systems. Based on their principle, the soundness of the original rewriting induction system can be proved. It is not known, however, whether such an approach can be adapted also for more powerful rewriting induction systems. In this paper, we give a new abstract principle that extends Koike and Toyama's abstract principle. Using this principle, we show the soundness of a rewriting induction system extended with an inference rule of simplification by conjectures. Inference rules of simplification by conjectures have been used in many rewriting induction systems. Replacement of the underlying rewriting mechanism with ordered rewriting is an important refinement of rewriting induction — with this refinement, rewriting induction can handle non-orientable equations. It is shown that, based on the introduced abstract principle, a variant of our rewriting induction system based on ordered rewriting is sound, provided that its base order is ground-total. In our system based on ordered rewriting, the simplification rule extends those of the equational fragment of some major systems from the literature.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"365 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132695704","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
Seamless Failure Recovery for Real-time Multimedia Applications in MPLS Networks MPLS网络中实时多媒体应用的无缝故障恢复
Ipsj Digital Courier Pub Date : 2007-12-15 DOI: 10.2197/IPSJDC.3.779
M. Hayasaka, T. Miki
{"title":"Seamless Failure Recovery for Real-time Multimedia Applications in MPLS Networks","authors":"M. Hayasaka, T. Miki","doi":"10.2197/IPSJDC.3.779","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.779","url":null,"abstract":"The QoS provided by current best effort Internet is not good enough for real-time multimedia applications that are categorized as premium traffic. It is believed that QoS guarantees could be better provided by the connection oriented networks. Multi Protocol Label Switching (MPLS) is one such technology and these connection oriented networks are inherently more prone to network failures. Re-routing is a solution to cope with them. However, the re-routing always causes packet losses and results in service outage. Therefore, the QoS of the real-time premium traffic is highly degraded. The seamless failure recovery proposed in this paper can be used for real-time premium traffic that needs a guaranteed QoS. It applies an FEC technique to the conventional re-routing based path protection and seamlessly recovers the packet losses due to re-routing by way of an FEC recovery technique. The numerical and simulation results show that the proposed method can provide network architecture without service outage for real-time premium traffic while minimizing the service costs such as redundant traffic and additional buffer at edge routers.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115812268","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}
引用次数: 0
ZWPS and Pressure Scroll: Two Pressure-based Techniques in Pen-based Interfaces ZWPS和压力滚动:基于笔的界面中的两种压力技术
Ipsj Digital Courier Pub Date : 2007-12-15 DOI: 10.2197/IPSJDC.3.767
Jibin Yin, Xiangshi Ren
{"title":"ZWPS and Pressure Scroll: Two Pressure-based Techniques in Pen-based Interfaces","authors":"Jibin Yin, Xiangshi Ren","doi":"10.2197/IPSJDC.3.767","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.767","url":null,"abstract":"This paper investigates the interaction ability when introducing pressure into current basic interaction techniques by developing two novel techniques. A Zoom-based technique with pressure (hereafter referred to as ZWPS) is proposed to improve pixel-target selection. In this technique the pressure is used as a switch mode to couple a standard Point Cursor and a zoomable technique together. Pressure Scroll is also presented with a view to advancing scrolling performances by employing arc or line strokes to scroll documents. In this technique pressure is used as an additional control factor to widen the adjustable range of the scrolling velocity. We conducted two experiments to examine the effectiveness of ZWPS and Pressure Scroll. The experimental results indicate that they both bring significant benefits to the users.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130291581","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}
引用次数: 10
DiscNice: User-level Regulation of Disk Bandwidth disnice:用户级磁盘带宽调节
Ipsj Digital Courier Pub Date : 2007-12-15 DOI: 10.2197/IPSJDC.3.800
H. Yamada, K. Kono
{"title":"DiscNice: User-level Regulation of Disk Bandwidth","authors":"H. Yamada, K. Kono","doi":"10.2197/IPSJDC.3.800","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.800","url":null,"abstract":"A recent trend in computing has been to leverage dormant PC resources. To achieve this, background applications such as peer-to-peer applications and PC Grid run on ordinary users' PCs, sharing their computing resources. If not properly managed, the background applications obtrude on the PC user's active jobs. In particular, the contention over disk bandwidth severely degrades performance. In this paper, we present DiscNice, a novel scheme for disk bandwidth management that can host background applications unobtrusively. Its novelty lies in the fact that it throttles disk I/O completely at the user-level. The user-level approach is attractive for heterogeneous environments such as differently configured PCs over the world; portability is enhanced and deployment is easier in comparison with kernel-level approaches. Experimental results suggest that our prototype DiscNice running on Linux 2.4.27 incurs 12% or less overhead, and gracefully ensures the unobtrusiveness of background applications.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128596025","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}
引用次数: 0
Free Energy Landscape Analysis System Based on Parallel Molecular Dynamics Simulation 基于并行分子动力学模拟的自由能景观分析系统
Ipsj Digital Courier Pub Date : 2007-11-15 DOI: 10.2197/IPSJDC.3.757
M. Sekijima, J. Doi, S. Honda, T. Noguchi, S. Shimizu, Y. Akiyama
{"title":"Free Energy Landscape Analysis System Based on Parallel Molecular Dynamics Simulation","authors":"M. Sekijima, J. Doi, S. Honda, T. Noguchi, S. Shimizu, Y. Akiyama","doi":"10.2197/IPSJDC.3.757","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.757","url":null,"abstract":"We created a Free Energy Landscape Analysis System based on a parallelized molecular dynamics (MD) simulation adapted for the IBM Blue Gene/L supercomputer. We begin with an outline of our Free Energy Landscape Analysis system. Next we discuss how Parallel MD was tuned for Blue Gene/L. We then show the results for some test targets run on Blue Gene/L, including their efficiency. Finally, we mention some future directions for extension of this project.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130018877","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}
引用次数: 0
Metabolic Pathway Alignment Based on Similarity between Chemical Structures 基于化学结构相似性的代谢途径定位
Ipsj Digital Courier Pub Date : 2007-11-15 DOI: 10.2197/IPSJDC.3.736
Y. Tohsato, Yuki Nishimura
{"title":"Metabolic Pathway Alignment Based on Similarity between Chemical Structures","authors":"Y. Tohsato, Yuki Nishimura","doi":"10.2197/IPSJDC.3.736","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.736","url":null,"abstract":"In many of the chemical reactions in living cells, enzymes act as catalysts in the conversion of certain compounds (substrates) into other compounds (products). Metabolic pathways are formed as the products of these reactions are used as the substrates of other reactions. Comparative analyses of the metabolic pathways among species provide important information on both evolution and potential pharmacological targets. Here, we propose a method to align the metabolic pathways based on similarities between chemical structures. To measure the degree of chemical similarity, we formalized a scoring system using the MACCS keys and the Tanimoto/Jaccard coefficients. To determine the effectiveness of our method, it was applied to analyses of metabolic pathways in Escherichia coli. The results revealed compound similarities between fructose and mannose biosynthesis and galactose biosynthesis pathways.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125437609","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}
引用次数: 21
Stochastic Regular Approximation of Tree Grammars and Its Application to Faster ncRNA Family Annotation 树文法的随机正则逼近及其在快速ncRNA族标注中的应用
Ipsj Digital Courier Pub Date : 2007-11-15 DOI: 10.2197/IPSJDC.3.746
Kazuya Ogasawara, Satoshi Kobayashi
{"title":"Stochastic Regular Approximation of Tree Grammars and Its Application to Faster ncRNA Family Annotation","authors":"Kazuya Ogasawara, Satoshi Kobayashi","doi":"10.2197/IPSJDC.3.746","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.746","url":null,"abstract":"Tree Adjoining Grammar (TAG) is a useful grammatical tool to model RNA secondary structures containing pseudoknots, but its time complexity for parsing is not small enough for the practical use. Recently, Weinberg and Ruzzo proposed a method of approximating stochastic context free grammar by stochastic regular grammar and applied it to faster genome annotation of non-coding RNA families. This paper proposes a method for extending their idea to stochastic approximation of TAGs by regular grammars. We will also report some preliminary experimental results on how well we can filter out non candidate parts of genome sequences by using obtained approximate regular grammars.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130618389","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}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信