首页 > 最新文献

Ipsj Digital Courier最新文献

英文 中文
New Certificate Chain Discovery Methods for Trust Establishment in Ad Hoc Networks and Their Evaluation Ad Hoc网络中信任建立的新证书链发现方法及其评价
Pub Date : 2008-01-15 DOI: 10.2197/IPSJDC.4.18
H. Mohri, Ikuya Yasuda, Y. Takata, H. Seki
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.
在自组织网络中,我们不能假设普通公钥基础设施(Public-Key Infrastructure, PKI)中使用的可信证书颁发机构和集中存储库。因此,研究了一种信任网络类型的PKI系统,其中每个节点都可以以自组织的方式向其他节点颁发证书。尽管该系统对自组织网络很有用,但它存在一个问题,即为了进行身份验证,节点需要找到一个指向目标节点的证书链。本文对信任网络型PKI系统进行了形式化建模,定义了证书链发现问题,并提出了一种新的分布式算法及其改进方案来解决该问题。此外,我们提出了一个通信成本的度量,并根据该度量,我们通过对大型网络的数值计算和对中等规模网络随机生成的单元磁盘图的模拟,将我们的算法与现有的方法进行了比较。仿真结果表明,该方法的通信成本低于现有方法的10%。
{"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 碰撞预警系统中车辆间通信协议性能研究
Pub Date : 2008-01-15 DOI: 10.2197/IPSJDC.4.31
N. Thepvilojanapong, S. Motegi, H. Horiuchi
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.
碰撞预警系统(CWS)可以通过车辆间通信(IVC)向驾驶员提供某种适当的警告,从而帮助降低车祸的概率和严重程度。特别是在交通事故频发的十字路口,自动驾驶系统有助避免碰撞(推广自动驾驶汽车研究小组;交通局,2007)。装有CWS的车辆定期广播其信息,其他车辆上的CWS使用接收到的信息提醒驾驶员,帮助他们意识到其他车辆的存在。为了避免碰撞,预警系统有其具体的IVC目标,即预警系统应准确、及时地接收到有用信息。许多IVC协议,包括我们之前提出的中继控制协议(Motegi等人,2006年)已经通过传统指标开发和评估。但是,在判断IVC协议的可行性和实用性时,不能直接使用这些传统的度量标准,必须考虑交叉口CWS的许多需求。本文介绍了我们之前为CWS开发的IVC协议的性能评估。为了研究IVC协议的行为,我们首先描述了一种仿真方法,包括通过可靠和及时的通信实现的性能指标。然后,我们使用这些指标将我们的IVC协议与大规模模拟网络中的泛洪协议进行比较。仿真结果表明,该协议满足了交叉CWS的所有要求,是实际实现的良好候选协议。
{"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 基于操作行为的手机异常检测
Pub Date : 2008-01-15 DOI: 10.2197/IPSJDC.4.9
T. Isohara, K. Takemori, I. Sasase
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.
手机上的信息保护方案成为重要的挑战,因为手机上有许多类型的私人信息。一般来说,用户认证和异常检测可以有效防止非法用户的攻击。然而,用户身份验证只能在使用之初应用,传统的异常检测方法不适用于手机,只能用于计算机系统。在本文中,我们提出了一个简单易用的在手机上异常检测方案。该方案记录手机操作时的按键,并通过异常检测算法计算相似度分数,以检测非法用户。我们在BREW(无线二进制运行时环境)模拟器上实现了一个原型系统,并使用来自15个测试者的结果来评估错误率。实验结果表明,该方法能够通过多次检查相似度得分来实现异常检测。
{"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 基于抽象原理的改写归纳的合理性
Pub Date : 2008-01-15 DOI: 10.2197/IPSJDC.4.58
Takahito Aoto
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.
改写归纳法(Reddy, 1990)是一种自动证明项改写系统归纳定理的方法。Koike和Toyama(2000)从抽象约简系统中提取了重写归纳的抽象原则。基于它们的原理,可以证明原改写归纳系统的合理性。然而,尚不清楚这种方法是否也适用于更强大的重写归纳系统。本文给出了一个新的抽象原理,它扩展了Koike和Toyama的抽象原理。利用这一原理,我们证明了用猜想简化推理规则扩展的改写归纳系统的可靠性。通过猜想简化的推理规则已经在许多重写归纳系统中得到了应用。用有序重写替换底层重写机制是重写归纳法的一个重要改进——通过这种改进,重写归纳法可以处理非定向方程。结果表明,基于所引入的抽象原理,在基序为地全的条件下,基于有序改写的改写归纳系统是可靠的。在基于有序重写的系统中,简化规则扩展了文献中一些主要系统的等价片段化简规则。
{"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网络中实时多媒体应用的无缝故障恢复
Pub Date : 2007-12-15 DOI: 10.2197/IPSJDC.3.779
M. Hayasaka, T. Miki
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.
目前Internet提供的QoS对于被归类为高级流量的实时多媒体应用程序来说还不够好。认为面向连接的网络可以更好地提供QoS保证。多协议标签交换(MPLS)就是这样一种技术,这些面向连接的网络本质上更容易发生网络故障。重新路由是应对它们的一种解决方案。但是,重路由总是会导致丢包,导致业务中断。因此,实时优质流量的QoS被严重降级。本文提出的无缝故障恢复可以用于需要保证QoS的实时优质流量。它将FEC技术应用于传统的基于重路由的路径保护,并通过FEC恢复技术无缝地恢复由于重路由而导致的数据包丢失。数值和仿真结果表明,该方法可以在不中断服务的情况下为实时优质流量提供网络架构,同时最大限度地降低冗余流量和边缘路由器附加缓冲区等服务成本。
{"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和压力滚动:基于笔的界面中的两种压力技术
Pub Date : 2007-12-15 DOI: 10.2197/IPSJDC.3.767
Jibin Yin, Xiangshi Ren
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.
本文通过开发两种新的相互作用技术,研究了在现有的基本相互作用技术中引入压力后的相互作用能力。提出了一种基于压力变焦技术(以下简称ZWPS)来改进像素目标的选择。在这种技术中,压力被用作开关模式,将标准点光标和可缩放技术耦合在一起。压力滚动还提出了一种观点,以提高滚动性能,通过使用弧或线笔画来滚动文件。在这种技术中,压力被用作一个额外的控制因素,以扩大滚动速度的可调范围。我们通过两个实验来检验ZWPS和Pressure Scroll的有效性。实验结果表明,两者都为用户带来了显著的效益。
{"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:用户级磁盘带宽调节
Pub Date : 2007-12-15 DOI: 10.2197/IPSJDC.3.800
H. Yamada, K. Kono
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.
最近计算的一个趋势是利用休眠的PC资源。为了实现这一点,诸如点对点应用程序和PC网格之类的后台应用程序在普通用户的PC上运行,共享他们的计算资源。如果管理不当,后台应用程序会干扰PC用户正在进行的工作。特别是,对磁盘带宽的争用会严重降低性能。在本文中,我们提出了一种新的磁盘带宽管理方案DiscNice,它可以不显眼地托管后台应用程序。它的新颖之处在于它完全在用户级限制磁盘I/O。用户级方法对于异构环境(如世界各地配置不同的pc)具有吸引力;与内核级方法相比,可移植性得到了增强,部署也更容易。实验结果表明,在Linux 2.4.27上运行我们的原型disnice会产生12%或更少的开销,并优雅地确保后台应用程序的不显眼性。
{"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 基于并行分子动力学模拟的自由能景观分析系统
Pub Date : 2007-11-15 DOI: 10.2197/IPSJDC.3.757
M. Sekijima, J. Doi, S. Honda, T. Noguchi, S. Shimizu, Y. Akiyama
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.
我们创建了一个基于并行分子动力学(MD)模拟的自由能景观分析系统,该系统适用于IBM Blue Gene/L超级计算机。我们首先概述我们的自由能景观分析系统。接下来我们讨论平行MD是如何为蓝色基因/L调整的。然后我们展示了在Blue Gene/L上运行的一些测试目标的结果,包括它们的效率。最后,提出了本项目未来的扩展方向。
{"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 基于化学结构相似性的代谢途径定位
Pub Date : 2007-11-15 DOI: 10.2197/IPSJDC.3.736
Y. Tohsato, Yuki Nishimura
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.
在活细胞中的许多化学反应中,酶在某些化合物(底物)转化为其他化合物(产物)的过程中起催化剂的作用。当这些反应的产物被用作其他反应的底物时,代谢途径就形成了。物种间代谢途径的比较分析提供了进化和潜在药理靶点的重要信息。在这里,我们提出了一种基于化学结构相似性来调整代谢途径的方法。为了测量化学相似性的程度,我们使用MACCS键和Tanimoto/Jaccard系数形式化了一个评分系统。为了确定该方法的有效性,将其应用于大肠杆菌代谢途径的分析。结果揭示了果糖和甘露糖生物合成途径与半乳糖生物合成途径之间的复合相似性。
{"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族标注中的应用
Pub Date : 2007-11-15 DOI: 10.2197/IPSJDC.3.746
Kazuya Ogasawara, Satoshi Kobayashi
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.
树邻近语法(TAG)是一种有用的语法工具,用于模拟含有假结的RNA二级结构,但其解析的时间复杂度不够小,无法用于实际应用。最近,Weinberg和Ruzzo提出了一种用随机规则语法近似随机上下文无关语法的方法,并将其应用于非编码RNA家族的快速基因组注释。本文提出了一种将他们的思想扩展到用规则语法随机逼近标签的方法。我们还将报告一些初步的实验结果,关于我们如何使用获得的近似规则语法过滤掉基因组序列的非候选部分。
{"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
期刊
Ipsj Digital Courier
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1