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

Ipsj Digital Courier最新文献

筛选
英文 中文
Performance Improvement of Ad Hoc Networks by Deployment of Directional Antenna 定向天线部署对Ad Hoc网络性能的改善
Ipsj Digital Courier Pub Date : 2007-06-15 DOI: 10.2197/IPSJDC.3.302
K. Yamamoto, M. Yamamoto
{"title":"Performance Improvement of Ad Hoc Networks by Deployment of Directional Antenna","authors":"K. Yamamoto, M. Yamamoto","doi":"10.2197/IPSJDC.3.302","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.302","url":null,"abstract":"Ad hoc network which requires no infrastructure equipment such as access points is paid great attention in recent years. In ad hoc network, each host controls its wireless access in a distributed fashion. Generally, carrier sensing is used for detecting channel availability. By using RTS and CTS control frames, MAC sub-layer predicts the channel use and resolves hidden-terminal problem. Broadcast nature of RTS and CTS control frames leads to inefficient spatial reuse. One promising solution for this inefficient spatial reuse is usage of directional antenna. In ad hoc networks, heterogeneous network configuration is general, which means each host is equipped with different network facilities. For antennas, it will be general situation that not all hosts are equipped with directional antenna. This paper evaluates throughput performance of the ad hoc network in this realistic situation and shows how much performance improvement deployment of directional antenna will bring to the network.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114090683","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}
引用次数: 7
Acquisition and Rectification of Shape Data Obtained by a Moving Range Sensor 移动距离传感器形状数据的采集与校正
Ipsj Digital Courier Pub Date : 2007-06-15 DOI: 10.2197/IPSJDC.3.424
A. Banno, K. Ikeuchi
{"title":"Acquisition and Rectification of Shape Data Obtained by a Moving Range Sensor","authors":"A. Banno, K. Ikeuchi","doi":"10.2197/IPSJDC.3.424","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.424","url":null,"abstract":"“Modeling from Reality” techniques are making great progress because of the availability of accurate geometric data from three-dimensional digitizers. These techniques contribute to numerous applications in many areas. Among them, one of the most important and comprehensive applications is modeling cultural heritage objects. For a large object, scanning from the air is one of the most efficient methods for obtaining 3D data. We developed a novel 3D measurement system, the Floating Laser Range Sensor (FLRS), in which a range sensor is suspended beneath a balloon. The obtained data, however, have some distortions due to movement of the system during the scanning process. We propose two novel methods to rectify the shape data obtained by the moving range sensor. One method rectifies the data by using image sequences; the other rectifies the data without images. To test these methods, we have conducted a digital archiving project of a large-scale heritage object, in which our algorithms are applied. The results show the effectiveness of our methods. Moreover, both methods are applicable not only to our FLRS, but also to moving range sensors in general.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132283404","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
Registration and Deformation of 3D Shape Data through Parameterized Formulation 三维形状数据的参数化配准与变形
Ipsj Digital Courier Pub Date : 2007-06-15 DOI: 10.2197/IPSJDC.3.404
T. Masuda, K. Ikeuchi
{"title":"Registration and Deformation of 3D Shape Data through Parameterized Formulation","authors":"T. Masuda, K. Ikeuchi","doi":"10.2197/IPSJDC.3.404","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.404","url":null,"abstract":"In this paper, we investigate conventional registration implementation, consisting of rotation and translation, to design the most precise registration so as to accurately restore the 3D shape of an object. To achieve the most accurate registration, our registration implementation needs robustness against data noise, or initial pose and position of data. To verify the accuracy of our implemented registration, we compare the registration behavior with the registration behavior of conventional methods, and evaluate the numerical accuracy of transformation parameter obtained by our registration. However, registration by rigid-body transformation is not enough for modeling and shape comparison: registration with deformation is needed. In this paper, we extend our robust registration to simultaneously estimate the shape parameter as well as the rigid-body transformation parameter. This extension method assumes that the deformation is formulated strictly from the deformation mechanism. We additionally introduce the applications of our extension method.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117170399","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
Anomaly Detection Using Integration Model of Vector Space and Network Representation 基于向量空间和网络表示集成模型的异常检测
Ipsj Digital Courier Pub Date : 2007-06-15 DOI: 10.2197/IPSJDC.3.269
Mizuki Oka, Kazuhiko Kato
{"title":"Anomaly Detection Using Integration Model of Vector Space and Network Representation","authors":"Mizuki Oka, Kazuhiko Kato","doi":"10.2197/IPSJDC.3.269","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.269","url":null,"abstract":"We propose the Eigen Co-occurrence Matrix (ECM) method, which is a modeling method for tracking the behaviors of an individual, system, or network in terms of event sequences of discrete data. Our method uses the correlation between events in a sequence to extract distinct characteristics. A key idea behind the ECM method is to regard a sequence as a serialized sequence that originally had structural relations and to extract the embedded dependencies of the events. To test its retrieval performance, we applied the ECM method to the problem of anomaly detection in intrusion detection systems. Specifically, we used the method to model a UNIX command sequence and attempted to detect intruders masquerading as valid users. The experimental results reveal that the ECM method offers distinct characteristic models for analyzing event sequences.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116264971","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
Design, Analysis, and Evaluation of Mobile Agent based Privacy Protection Scheme for Multi-party Computation Problems 基于移动代理的多方计算问题隐私保护方案的设计、分析与评价
Ipsj Digital Courier Pub Date : 2007-06-15 DOI: 10.2197/IPSJDC.3.320
M. N. Huda, E. Kamioka, S. Yamada
{"title":"Design, Analysis, and Evaluation of Mobile Agent based Privacy Protection Scheme for Multi-party Computation Problems","authors":"M. N. Huda, E. Kamioka, S. Yamada","doi":"10.2197/IPSJDC.3.320","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.320","url":null,"abstract":"Existing cryptography-based algorithms for multi-party computation problems (MPCP) are either too complex to be used practically or applicable only to the specific applications for which they have been developed. In addition, traditional (non-cryptography-based)algorithms do not provide good privacy protection for MPCPs. This paper presents the security system design, intuitive analysis, and empirical evaluation of an agent server platform for protecting privacy in solving multi-party computation problems with traditional algorithms. We have devised the security policies for an agent server platform and showed how the enforcement of those policies can effectively protect privacy while solving many MPCPs. Experimental analysis shows that the presented agent platform security system can significantly enhance privacy protection while solving the problems with traditional algorithms.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129798202","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
A D L OC : Collaborative Location-based Annotation A D L OC:基于位置的协作标注
Ipsj Digital Courier Pub Date : 2007-06-15 DOI: 10.2197/IPSJDC.3.280
D. Corbett, D. Cutting
{"title":"A D L OC : Collaborative Location-based Annotation","authors":"D. Corbett, D. Cutting","doi":"10.2197/IPSJDC.3.280","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.280","url":null,"abstract":"AD LOC is a novel system for mobile devices to collaboratively tie persistent virtual notes to physical locations. Notes that are relevant to particular locations can be created and then cached using serendipitously formed one-hop wireless ad hoc network connections. The location provides an address to which the information is relevant and devices attempt to keep the information stored at devices which remain close to this address. In simulation experiments, even under conditions of nodal flux, it is possible to retrieve over 90% of the notes that have been stored.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132064027","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
A Heterogeneous Multihop Wireless Access Network for Multipoint Streaming: A detailed Performance Analysis 多点流的异构多跳无线接入网:详细的性能分析
Ipsj Digital Courier Pub Date : 2007-06-15 DOI: 10.2197/IPSJDC.3.332
M. Hauge, O. Kure
{"title":"A Heterogeneous Multihop Wireless Access Network for Multipoint Streaming: A detailed Performance Analysis","authors":"M. Hauge, O. Kure","doi":"10.2197/IPSJDC.3.332","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.332","url":null,"abstract":"The current 3G-Cellular radio access network cannot support many concurrent high data rate unicast or multicast flows due to limited radio resources. We have proposed a heterogeneous wireless network architecture intended for point-to-multipoint services, to improve the availability of such services to mobile users. The architecture consists of a 3G-Cellular network, supported by a number of local ad hoc networks that are established on demand. In this framework the 3G multipoint-channel range is reduced while the unicast and signalling connections are maintained. Local ad hoc networks are used to forward the multicast data onto users located outside the shortened 3G multicast-channel range. In this paper we present a performance analysis of multicast streaming on the heterogeneous network architecture. The simulation results are complemented with a sensitivity analysis identifying the impact that parameters like node mobility and traffic patterns will have. The results verify that the architecture and the routing protocol are able to provide multicast services with acceptable quality to the multicast subscribers, while conserving 3G-Cellular radio resources.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114149119","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}
引用次数: 3
An Equivalence Relation for the Typed Ambient Calculus 类型化环境微积分的等价关系
Ipsj Digital Courier Pub Date : 2007-06-15 DOI: 10.2197/IPSJDC.3.369
Toru Kato
{"title":"An Equivalence Relation for the Typed Ambient Calculus","authors":"Toru Kato","doi":"10.2197/IPSJDC.3.369","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.369","url":null,"abstract":"The ambient calculus is a process algebra designed for describing mobile processes. It has a layered structure of ambients that enables us to describe not only mobile processes but also the world in which the processes move around such as computer networks and freight systems. When we describe such a system with ambients, however, malicious processes can destroy nodes of the network or alter the construction of the system. Thus, several mobility types for the ambient calculus have been proposed to enable us to give each node desirable characteristics that prevent malicious processes from acting harmfully. Gordon and Cardelli, the originators of the ambient calculus, also defined an equivalence relation for the untyped ambient calculus. Our previous work pointed out that there exist identified processes up to the relation that have different properties, and it refined the relation so that we can discriminate those processes. This paper shows that the original relation and our previous relation are no longer available for the typed ambient calculus and it presents another relation that is suitable.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126896051","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
Sub-Computation Based Transition Predicate Abstraction 基于子计算的转换谓词抽象
Ipsj Digital Courier Pub Date : 2007-06-15 DOI: 10.2197/IPSJDC.3.380
Carl Christian Frederiksen, M. Hagiya
{"title":"Sub-Computation Based Transition Predicate Abstraction","authors":"Carl Christian Frederiksen, M. Hagiya","doi":"10.2197/IPSJDC.3.380","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.380","url":null,"abstract":"The transition predicate abstraction framework developed by Podelski, et al. (2005) captures size relations over state transitions which can be used to show infeasibility of certain program computations. In particular, general liveness properties (i.e., properties of infinite computations) can be verified by reducing the verification problem to one of fair termination and then proving that all (infinite) fair computations are infeasible. We present an extension of the algorithm by Podelski, et al. that can be used to improve the precision of transition predicate abstraction as well as speed up analysis time for programs with well-structured control-flow. The main key is to identify sub-computations that can be evaluated independently of their context. Efficiency is then readily improved by analyzing each sub-computation in turn, thus avoiding to reanalyze the effect of a given sub-computations for different contexts. Further, precision can be improved by using stronger methods for extracting summary information about a given sub-computation. We present two versions of the sub-computation based analysis: one for a non-parallel imperative language with loops and recursive procedures, serving as an introduction, and one for the extension of the non-parallel language to a parallel language with synchronous communication via statically named channels.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116901787","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
An Efficient Analysis of Worst Case Flush Timings for Branch Predictors 分支预测器最坏情况刷新时间的有效分析
Ipsj Digital Courier Pub Date : 2007-05-15 DOI: 10.2197/IPSJDC.3.255
Masahiro Konishi, Takashi Nakada, Tomoaki Tsumura, H. Nakashima, H. Takada
{"title":"An Efficient Analysis of Worst Case Flush Timings for Branch Predictors","authors":"Masahiro Konishi, Takashi Nakada, Tomoaki Tsumura, H. Nakashima, H. Takada","doi":"10.2197/IPSJDC.3.255","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.255","url":null,"abstract":"This paper proposes an efficient algorithm to find the worst case flush timings for a given program with respect to the number of branch mispredictions. We first give a basic algorithm based on dynamic programming which takes O(N2F) computation time for a program with Nconditional branches and F flush timings. We then show it can be improved to achieve a computation time of approximately O(NF) for practical programs with its proof obtained through an evaluation with SPEC CPU95 benchmarks.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131268190","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
首页 上一页 下一页 尾页
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学术官方微信