检索结果-内蒙古大学图书馆

2011 5th International Conference on Innovative Mobile and Internet services in Ubiquitous computing, IMIS 2011

作者： Xin, Qin Yao, Xiaolan He, Wei Universite Catholique de Louvain Department of Applied Mathematics Louvain-la-Neuve Belgium National University of Defense Technology School of Computer Science Changsha China State Key Laboratory of Power Transmission Equipment and System Security and New Technology College of Electrical Engineering Chongqing University China

ISBN: (纸本)9780769543727

In a Wireless Sensor Networks (WSN), there are normally one or several sensor nodes working as Access Points (AP), which are able to provide a relay for other sensors to an external Internet connection. Since WSNs are resource-constrained, the selection of APs is very crucial in economizing power usage. In this paper, we study the optimal selection of APs to maximize the WSN lifetime. This issue is closely related to routing protocols in WSN. We propose a new adaptive multi-path routing protocol to reduce the energy consumption and guarantee QoS requirements with respect to transmission delay. In this paper, we formulate the issues we mentioned above as a non-linear NP-hard optimization problem. Due to the high computation complexity of this problem, we proposed two polynomial-time approximation algorithms to optimally select APs in the WSN that based on the framework in [41]. Combining with our new adaptive multi-path routing protocol, our preliminary simulation results show that our schemes can save more than 20% energy compared with the existing APs selection schemes with single-path routing protocols. © 2011 IEEE.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

The Modelling and Verification of PLC Program Based on Interactive Theorem Proving Tool COQ

The Modelling and Verification of PLC Program Based on Inter...

引用

2011 International Conference on computer science and Information technology(ICCSIT 2011)

作者： Litian Xiao Mengyuan Li Ming Gu Jiaguang Sun National Laboratory for Information Science and Technology Key Laboratory for Information System Security Ministry of EducationDepartment of Computer Science and Technology School of Software Tsinghua University Beijing Special Engineering Design and Research Institute National Laboratory for Information Science and Technology Key Laboratory for Information System Security Ministry of Education Department of Computer Science and Technology School of Software Tsinghua University

COQ is an interactive theorem proving tool. The paper abstractly describes the feature of COQ, the architecture and working modes of PLC program with the example of typical PLC. It also introduces the first-order logic syntax and semantics of Intuitionistic Logic. It briefly introduces the main Gallina language syntax elements, the corresponding use methods and main theorem proving tactic on COQ. The work has modeled kernel data type and basic statements and and the denotational semantics of PLC program with Gallina. It has given the correctness proof of PLC program based on theorem proving, i.e. based on semantics function the relationship of configuration between the before codes execution and the after is proved. The main purpose is to prove whether a PLC program satisfies certain nature within a scan period.

关键词： PLC Program, Embedded system, Verification, Denotational Semantics, Theorem Proving, COQ

来源：评论

学校读者我要写书评

暂无评论

Converting sectional views to three orthographic views to reconstruct 3D models

引用

computer-Aided Design and Applications 2011年第4期8卷 571-582页

作者： Ding, Fengqing Zhang, Hui Wen, Yamei School of Software Tsinghua University China Tsinghua National Laboratory for Information Science and Technology China Department of Computer Science and Technology Tsinghua University China Key Laboratory for Information System Security Ministry of Education

Compared with the CSG-based approach, the Brep-based approach has several advantages to construct 3D models from 2D engineering drawings, such as the structure is simpler and the domain of objects that can be handled is wider. However, this approach cannot handle sectional views directly. In this paper, a new method of converting sectional views to three orthographic views is presented. Firstly, the views which have the same projection direction are merged into one view. If the number of views is two, then a new view will be added according to the coordinate relations. Secondly, elements which have been omitted in sectional views are recovered according to the matching information of the existing edges. Finally, the existing Brepbased approach is used to reconstruct the 3D models. The algorithm can handle full sections, broken-out sections, offset sections as well as two orthographic views. The algorithm has been validated by experiments. © 2011 CAD Solutions, LLC.

关键词： Three dimensional computer graphics

来源：评论

学校读者我要写书评

暂无评论

A linear algorithm for pseudo recognition in 3D reconstruction

引用

computer-Aided Design and Applications 2011年第6期8卷 827-839页

作者： Li, Qi Zhang, Hui School of Software Tsinghua University China Department of Computer Science and Technology Tsinghua University China Key Laboratory for Information System Security Ministry of Education China Tsinghua National Laboratory for Information Science and Technology China

Pseudo recognition is essential to reconstruct correct 3D models from engineering drawings. This paper proposes a novel linear algorithm to recognize pseudo elements based on the existence of non-manifold edges. First, mini face loops are defined to construct correct face loops and avoid overlapped loops, which previous loop construction methods would always result in when pseudo elements exist. Then, suspect faces whose all boundary edges are non-manifold edges, are defined to reduce the searching space of the algorithm for pseudo recognition, thus the algorithm can achieve linear time complexity. The algorithm is applicable for wireframe models including planes and basic conicoid surfaces. Experimental results are provided to demonstrate the algorithm. © 2011 CAD Solutions.

关键词： Three dimensional computer graphics

来源：评论

学校读者我要写书评

暂无评论

RESTful web service composition: Extracting a process model from Linear Logic theorem proving

RESTful web service composition: Extracting a process model ...

引用

2011 7th International Conference on Next Generation Web services Practices, NWeSP 2011

作者： Zhao, Xia Liu, Enjie Clapworthy, Gordon J. Ye, Na Lu, Yueming Department of Computer Science and Technology University of Bedfordshire Luton United Kingdom School of Information and Control Engineering Xi'An University of Architecture and Technology Xi'an China School of Electronic and Information Engineering Xi'An Jiao Tong University Xi'an China Key Laboratory of Trustworthy Distributed Computing and Service Beijing University of Posts and Telecommunications Ministry of Education Beijing China

ISBN: (纸本)9781457711268

This paper introduces a two-stage Linear Logic based program synthesis approach to automatic RESTful web service composition. The Linear Logic theorem proof is applied at both resource and service invocation method levels, which greatly improves the searching efficiency and guarantees the correctness and completeness of the service composition. Furthermore, the process calculus is used as formalism for the composition process, which enables the approach to be executable at the business management level. The process calculus is attached to the Linear Logic inference rules in the style of type theory, so the process model is extracted directly from the complete proof. An example is given to show the extraction of a process model from a Linear Logic proof search. © 2011 IEEE.

关键词： computer circuits

来源：评论

学校读者我要写书评

暂无评论

PDRS: A New Recovery Scheme Application for Vertical RAID-6 Code

PDRS: A New Recovery Scheme Application for Vertical RAID-6 ...

引用

International Conference on Networking, Architecture, and Storage (NAS)

作者： Siyi Li Qaing Cao Jianzhong Huang Shenggang Wan Changsheng Xie School of Computer Science and Tech Data Storage System Laboratory Wuhan National Laboratory for Optoelectronics Huazhong University of Science and Technology Wuhan China

As the technique developing, some important problems in storage systems have been solved appropriately. A good example is the development of RAID-6 code techinque, the appear of it has greatly improved the reliability, availability of modern storage systems. Some best known vertical RAID-6 code like P-code and X-code has acquire optimal or near optimal performance in encoding, decoding and update. But they do not detailedly analysis the status of reconstruction with single-disk failure. In the status, there are many paths to perform reconstructing. But the path you choice will greatly affect the performance of whole storage system. Based the phenomenon found above, we present a fast and effcient scheme, Path Directed Recovery Scheme (PDRS for short), to find a optimal path to reconstruct single-disk failure in P-code and X-code. Using PDRS, we will acquire some benefits: (1) it can decrease the disk I/O complexity caused by reconstruction and therefore accelerating the speed of reconstruction, (2) it can balance the load on each disk, consequently can avoid the hot problem in a degree. We perform theoretical analysis and evaluation of the PDRS when applied in P-code with (p-1)-disk and X-code with p-disk. Our theoretical analysis shows that PDRS applied in P-code with (p-1)-disk can acquire up to 25% performance improvement. To verify the effectiveness of PDRS, we have conducted intenvice simulation. The simulation results shows that PDRS applied in P-code with (p-1)-disk can speedup the recovery duration by up to 23.6% under spare-rebuilding mode. Overall, PDRS is a efficient and useful recovery scheme that can applied to all of the vertical RAID-6 code.

关键词： Arrays Labeling Encoding Complexity theory Reliability Decoding Acceleration

来源：评论

学校读者我要写书评

暂无评论

Adaptive social network construction using Gaussian mixture model

引用

Information technology Journal 2011年第12期10卷 2252-2259页

作者： Guo, Xin Xiang, Yang Chen, Qian Wei, Wei Department of Computer Science and Technology School of Electronic and Information Engineering Tongji University Shanghai 201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China

A Social network graph shows social interactions and relationships between individuals in a specific social environment, which is very helpful for analyzing social relationships, activities, structures, etc. The author quantized the strengths of social objects' relationships in social environment using an improved vector space model. Gaussian mixture model was employed to set the threshold for identifying social relationships adaptively and divide social subgroups automatically. According to the threshold, social network graph would be constructed based on performance measures. It is concluded that hidden social relationships can be discovered effectively by using this approach which is very flexible and adaptive for dynamic information feedback mechanism. © 2011 Asian Network for Scientific Information.

关键词： Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

Non-reference virtual view quality evaluation of MVD

引用

Journal of Shanghai University(English Edition) 2011年第4期15卷 342-346页

作者：张艳安平张秋闻王元庆张兆杨 School of Communication and Information Engineering Shanghai University Department of Computer Science and Technology Anhui University of Finance and EconomicsBengbu 230030AnhuiP.R.China Key Laboratory of Advanced Display and System Application (shanghai University) Ministry of Education Department of Electronics Science and Engineering Nanjing University

The quality of virtual view based on multi-view video （MVD） plus depth format is often evaluated by PSNR or subjectively judged. However, due to synthesizing arbitrary view images, the virtual view images mostly have no reference images and are only assessed using non-reference. Virtual view images synthesized by depth estimation reference software （DERS） and view synthesis reference software （VSRS） often accompanied with blockiness and other distortions on the edge. In addition, matching level for the depth map and the corresponding texture maps of left and right views also affects the quality of the virtual view. This paper compares the edge similarity of the depth and the corresponding texture maps which generate the intermediate virtual view and combined with the virtual view＇s blockiness which causing blur to evaluate the quality of the virtual view. Experiment results show that the proposed method can reflect the quality of the virtual view better.

关键词： non-reference quality evaluation virtual view multi-view video （MVD） plus depth free viewpoint television （FTV）

来源：评论

学校读者我要写书评

暂无评论

基于探测球的多光源追踪算法

基于探测球的多光源追踪算法

引用

中国电子学会第十八届青年学术年会

作者： Zhou Jie-bing 周洁冰 Liu Ai-xi 刘爱惜 Yu Hong-tao 余洪涛 Wang Yong-tian 王涌天 Key Laboratory of Photo electronic Imaging Technology and System Ministry of Education of China Sc 北京理工大学光电学院光电成像技术与系统教育部重点实验室北京100081 School of Computer Science&Technology Beijing Institute of Technology Beijing 100081 北京理工大学计算机学院北京 100081

增强现实系统中，虚拟物体表面的光影效果与真实场景中的光照情况一致是增强现实中真实感绘制的关键。本文提出了一种镜面小球结合标志点注册来估计真实场景中的多光源位置的方法，再将估算出的光源位置转换Virtools中实现虚拟物体的阴... 详细信息

增强现实系统中，虚拟物体表面的光影效果与真实场景中的光照情况一致是增强现实中真实感绘制的关键。本文提出了一种镜面小球结合标志点注册来估计真实场景中的多光源位置的方法，再将估算出的光源位置转换Virtools中实现虚拟物体的阴影效果和遮挡效果。首先通过标志点确定探测球相对摄像机的位姿关系，再获取不同角度拍摄得到的高光点在屏幕坐标系下的二维坐标，结合已知的摄像机相对于世界坐标系的位姿转换矩阵计算出高光点在世界坐标系下的三维坐标，然后再由探测球的几何信息和高光点的三维信息来推算出光源的方向。实验结果表明，该方法可以估计出场景中多个光源的方向，较好地实现了预期的效果，适用于复杂光源下的增强现实系统。

关键词：计算机视觉增强现实系统多光源追踪算法探测球

来源：评论

学校读者我要写书评

暂无评论

GPU Accelerating for Rapid Multi-core Cache Simulation

GPU Accelerating for Rapid Multi-core Cache Simulation

引用

IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Wan Han Long Xiang Gao Xiaopeng Li Yi State Key Laboratory of Virtual Reality Technology and System School of Computer Science and Engineering Beihang University Beijing China

To find the best memory system for emerging workloads, traces are obtained during application's execution, then caches with different configurations are simulated using these traces. Since program traces can be several gigabytes, simulation of cache performance is a time consuming process. Compute unified device architecture (CUDA) is a software development platform which enables programmers to accelerate the general-purpose applications on the graphics processing unit (GPU). This paper presents a real time multi-core cache simulator, which was built based on the Pin tool to get the memory reference, and fast method for multi-core cache simulation using the CUDA-enabled GPU. The proposed method is accelerated by the following techniques: execution parallelism exploration, memory latency hiding, a novel trace compression methodology. We describe how these techniques can be incorporated into CUDA code. Experimental results show that the hybrid parallel method of time-partitioning combines with set-partitioning presented here is 11.10× speedup compared to the CPU serial simulation algorithm. The present simulator can characterize cache performance of single-threaded or multi-threaded workloads at the speeds of 6-15 MIPS. It can simulates 6 cache configurations within one single pass at this speeds compared to CMP$im, which can only simulate one cache configuration each simulation pass at the speeds of 4-10 MIPS.

关键词： Graphics processing unit Instruction sets Computational modeling Parallel processing Instruments Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：