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

Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)最新文献

筛选
英文 中文
One Solution for Accurate Collision Detection in Virtual Assembly Environment 虚拟装配环境中精确碰撞检测的一种解决方案
Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007) Pub Date : 2007-07-30 DOI: 10.1109/SNPD.2007.399
W. Yanfeng, Zheng Yi
{"title":"One Solution for Accurate Collision Detection in Virtual Assembly Environment","authors":"W. Yanfeng, Zheng Yi","doi":"10.1109/SNPD.2007.399","DOIUrl":"https://doi.org/10.1109/SNPD.2007.399","url":null,"abstract":"Virtual assembly system requires higher accuracy on collision detection than ordinary virtual reality application. Based on analyzing the requirement of virtual assembly on accurate collision detection, a kind of hierarchical accurate collision detection thought is proposed, which includes three levels: assembly environment level, polygon level and accurate geometry topology model level. Three ways for virtual assembly system to obtain accurate geometry topology model are given. A specific solution that synthetically uses geometry graph supporting toolkit to realize hierarchical accurate collision detection is presented. A comparison experiment manifests that above solution and approach are feasible and efficient.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115070379","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
Key-Insulated Group Signature Scheme with Verifier-Local Revocation 具有验证者本地撤销的密钥隔离组签名方案
Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007) Pub Date : 2007-07-30 DOI: 10.1109/SNPD.2007.403
Rupeng Li, Jia Yu, Jin Wang, Guowen Li, Daxing Li
{"title":"Key-Insulated Group Signature Scheme with Verifier-Local Revocation","authors":"Rupeng Li, Jia Yu, Jin Wang, Guowen Li, Daxing Li","doi":"10.1109/SNPD.2007.403","DOIUrl":"https://doi.org/10.1109/SNPD.2007.403","url":null,"abstract":"In group signature schemes, the user's group secret key is often stored on insecure devices e.g. mobile phones that are likely to be compromised by an adversary. To mitigate the damage of key exposure in group signature schemes, we proposed a key-insulated group signature scheme. The group secret key stored on an insecure device is refreshed at discrete time periods via interaction with a physically-secure device that stores a \"master key\". Our scheme has secure and random-access key updates. The exposure of up to t of the T time periods, chosen adoptively by the adversary, still keeps any period that was not exposed secure. Our scheme also adopts method of verifier-local revocation (VLR) and supports backward unlinkability, i.e. previously signed signatures remain valid, anonymous and unlinkable even after the signer is revoked.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114871015","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
Application of Concurrent Subspace Design to Shape Design of Autonomous Underwater Vehicle 并行子空间设计在自主潜航器外形设计中的应用
Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007) Pub Date : 2007-07-30 DOI: 10.1109/SNPD.2007.76
Peng Wang, Baowei Song, Yonghu Wang, Lichuan Zhang
{"title":"Application of Concurrent Subspace Design to Shape Design of Autonomous Underwater Vehicle","authors":"Peng Wang, Baowei Song, Yonghu Wang, Lichuan Zhang","doi":"10.1109/SNPD.2007.76","DOIUrl":"https://doi.org/10.1109/SNPD.2007.76","url":null,"abstract":"The optimization process of concurrent subspace design (CSD) algorithm is reviewed in details. The study is carried out in the framework of the shape design of autonomous underwater vehicle (AUV), and which is divided into two disciplines, i.e., low drag design and low noise design. A multiobjective, multidisciplinary design optimization (M&MDO) model of the shape design of AUV is developed. An optimization design example of a certain AUV is analyzed based on CSD method. And the same time the approach is applied to shape design of AUV for validation. Finally, comparisons with the present experimental data are made. The analytical result shows that the drag and noise of optimal shape are greatly improved, and the CSD method has some important implication for AUV design.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115693224","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}
引用次数: 11
Research on Ontology-based Representation and Retrieval of Components 基于本体的构件表示与检索研究
Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007) Pub Date : 2007-07-30 DOI: 10.1109/SNPD.2007.462
Liu Quan, Jin Xinjuan, Long Yihong
{"title":"Research on Ontology-based Representation and Retrieval of Components","authors":"Liu Quan, Jin Xinjuan, Long Yihong","doi":"10.1109/SNPD.2007.462","DOIUrl":"https://doi.org/10.1109/SNPD.2007.462","url":null,"abstract":"Component-based development is an approach to developing a software system by assembling and composing already built software components. For component-based development to be successful, one of the key requirements is an effective scheme for classifying and describing them in detail, as well as a corresponding repository for storing and retrieving these components. This paper proposes an ontology-based software component description scheme with OWL Web ontology language. In this scheme, the component description information that is provided by user is associated with ontology to present semantic meaning, which builds the foundation for semantic reasoning in the component retrieval process. The semantic-based software component retrieval system is also constructed in this paper. This approach can retrieve component based on semantic description of the components. The whole approach extends the software reusable library to the World Wide Web. In the retrieval process, a user query in natural language is translated into Web ontology language representation formats in order to augment retrieval recall and precision by deploying the same semantic representation technologies on both the user query side and the component side.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121123257","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
A Cluster-Based and Routing Balanced P2P Lookup Protocol 基于集群的路由均衡P2P查找协议
Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007) Pub Date : 2007-07-30 DOI: 10.1109/SNPD.2007.313
Fasheng Xu, Wei Chen, Ling Yang
{"title":"A Cluster-Based and Routing Balanced P2P Lookup Protocol","authors":"Fasheng Xu, Wei Chen, Ling Yang","doi":"10.1109/SNPD.2007.313","DOIUrl":"https://doi.org/10.1109/SNPD.2007.313","url":null,"abstract":"A fundamental problem in peer-to-peer (P2P) systems is how to efficiently locate the node that stores a particular data item. As a hot issue, a number of structured P2P lookup protocols have been presented during the past few years. Unfortunately, current protocols either have uneven routing patterns or incur unnecessary high latency hops, and thus lead to inefficient routing. In this paper, a cluster-based and routing balanced P2P protocol, called CRP, is proposed. In this protocol, all participant nodes are grouped into clusters according to cost in latency, so inner-cluster hops have lower average path latencies. Inside a cluster, each node constructs a balanced lookup tree to evenly distribute routing traffic and reduce routing bottlenecks. In routing path, most hops are inner-cluster hops, and thus CRP can lead to efficient routing. A set of simulations to justify CRP is conducted, which shows that CRP is effective in reducing the average path latency and in evenly distributing routing traffic among sibling nodes.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121206872","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}
引用次数: 32
A Method for Blind Detection of OFDM Signal Based on Power Spectrum Reprocessing 基于功率谱再处理的OFDM信号盲检测方法
Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007) Pub Date : 2007-07-30 DOI: 10.1109/SNPD.2007.40
Zhang Hai-ying, Yuan Chao-wei
{"title":"A Method for Blind Detection of OFDM Signal Based on Power Spectrum Reprocessing","authors":"Zhang Hai-ying, Yuan Chao-wei","doi":"10.1109/SNPD.2007.40","DOIUrl":"https://doi.org/10.1109/SNPD.2007.40","url":null,"abstract":"A method for blind detection of OFDM signal based on power spectrum reprocessing is presented for distinguishing OFDM signal and single carrier modulation signals. The method takes full advantage of cryptic period of OFDM signal and enhances its ability for processing through power spectrum pretreatment, and has strong ability to suppress additive interference and is applicable to frequency selectivity fading channel and accurately estimate subcarrier frequency interval, symbol period, signal bandwidth and subcarrier number of OFDM signal. The simulation result shows that the new method is able to detect OFDM signals rapidly and accurately in condition of relatively low signal-noise ratio, and achieves high identification probability, has high adaptability for frequency selectivity fading channel, and has also low computational complexity, high precision, and is suitable for hardware implement.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122026979","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
Matrix Method for Principal Normal Form of Propositional Formula 命题公式主范式的矩阵法
Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007) Pub Date : 2007-07-30 DOI: 10.1109/SNPD.2007.351
Wang Ting-ming, Wang Aiqing
{"title":"Matrix Method for Principal Normal Form of Propositional Formula","authors":"Wang Ting-ming, Wang Aiqing","doi":"10.1109/SNPD.2007.351","DOIUrl":"https://doi.org/10.1109/SNPD.2007.351","url":null,"abstract":"A matrix method for principal normal form of propositional formula is derived from disjunctive normal form and conjunctive normal form based on the extension principle and deletion principle of superscript vectors of simplified phrase and simplified clause. Calculation process of principal normal form with equivalent calculus or truth table is simplified by the method presented.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123833404","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 Topology Set Method for Vectorization 矢量化的拓扑集方法
Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007) Pub Date : 2007-07-30 DOI: 10.1109/SNPD.2007.404
Jinhe Wang
{"title":"A Topology Set Method for Vectorization","authors":"Jinhe Wang","doi":"10.1109/SNPD.2007.404","DOIUrl":"https://doi.org/10.1109/SNPD.2007.404","url":null,"abstract":"A topology set structure is a powerful image segmentation technique, it has advantages over individual pixels due to its intrinsic behavior, retrieval of colony characteristic of related pixels, shape independence, and ease of implementation. In this paper, we present a new method of topology model designed using Barnode, which achieves geometric preservation by collecting the pixels from binary patterns. The Barnodes are divided into several types from which the element features, and its distributions are extracted and concatenated into several enhanced feature links, formed a topology set structure. Several experiments on simulated and real data are provided to demonstrate the performance of the algorithm.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124542228","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 Hierarchical Clustering Based on Overlap Similarity Measure 基于重叠相似度度量的分层聚类
Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007) Pub Date : 2007-07-30 DOI: 10.1109/SNPD.2007.502
Jun Qu, Q. Jiang, Fangfei Weng, Zhiling Hong
{"title":"A Hierarchical Clustering Based on Overlap Similarity Measure","authors":"Jun Qu, Q. Jiang, Fangfei Weng, Zhiling Hong","doi":"10.1109/SNPD.2007.502","DOIUrl":"https://doi.org/10.1109/SNPD.2007.502","url":null,"abstract":"Selecting the appropriate number of clusters and distinguishing partially overlapping and irregular data are two important problems in clustering. Hierarchical clustering provides a good solution to them. Similarity measure is the key of controlling the iterative process of hierarchical clustering. In this paper, we give a definition of overlap similarity measure and proposed a hierarchical clustering algorithm based on it without specified number of clusters in advance, whose appropriate value can be decided in the iterative process. The algorithm stops clustering according to the overlap similarity between clusters. Clustering analysis is a useful approach to unsupervised image segmentation. After discussing some related topics, we applied it to synthetic and real image segmentation to evaluate the performance of the clustering algorithm and compared it with other algorithms. Moreover, we estimated parameters of the algorithm in image segmentation. Experimental results show that this approach can be effectively applied to image segmentation.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"239 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120850030","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}
引用次数: 11
Identifying Code for Directed Graph 有向图识别码
Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007) Pub Date : 2007-07-30 DOI: 10.1109/SNPD.2007.162
Yichun Xu, R. Xiao
{"title":"Identifying Code for Directed Graph","authors":"Yichun Xu, R. Xiao","doi":"10.1109/SNPD.2007.162","DOIUrl":"https://doi.org/10.1109/SNPD.2007.162","url":null,"abstract":"Identifying code is a concept for undirected graph and can be applied to target identification. Its ability of identification comes from a fact that different elements in a system may have different neighbors. In this paper we extend the concept to directed graph. Then the determination rules, the concept of optimal identifying code, the formulation with integer program, and the solving steps are all extended. In this way, the identifying code problem and the alarm placement problem in earlier literatures are linked together and solved together.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"222 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120854562","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}
引用次数: 4
首页 上一页
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学术文献互助群
群 号：604180095
Book学术官方微信
小红书