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

2011 IEEE International Conference on Mechatronics and Automation, ICMA 2011

作者： Xu, Jia Zhang, Wei Liu, Lanjiao Wang, Zuobin Zhang, Jin Song, Zhengxun Weng, Zhankun Hu, Zhen Yue, Yong Li, Dayou CNM and IJRCNB Centers Changchun University of Science and Technology Changchun 130022 China Shaanxi Province Key Lab. of Thin Films Technology and Optical Test Xi'an Technological University Xi'an 710032 China Institute for Research in Applicable Computing University of Bedfordshire Luton LU1 3JU United Kingdom

ISBN: (纸本)9781424481149

This paper presents a method of phase-shift control in two-beam laser interference lithography. In the method, a PZT actuator is used to push a mirror and introduce phase shifts in a He-Ne laser interference lithography simulation system. When different voltages are applied to the PZT actuator, fringe positions are changed accordingly, and the phase shifts are introduced. The phase shifts can be determined by fringe pattern correlation with subpixel accuracy. This method is useful in two-beam laser interference lithography for the control of phase shifts and fringe positions in interference patterns for multi-exposure patterning applications. © 2011 IEEE.

关键词： Actuators

来源：评论

学校读者我要写书评

暂无评论

Improving Rating Estimation in Recommender Using Demographic Data and Expert Opinions

Improving Rating Estimation in Recommender Using Demographic...

引用

2011 2nd IEEE International Conference on Software Engineering and Service Science(2011年第二届 IEEE 软件工程与服务科学国际会议 ICSESS 2011)

作者： Long Yun Yan Yang Jing Wang Ge Zhu Dept. of Computer Science and Technology Heilongjiang University Key Lab. of Database and Parallel Computing Heilongjiang Province Harbin China

Memory-based collab.rative filtering algorithms have been widely adopted in many popular recommender systems, however the rating data are very sparse, which affects prediction accuracy greatly. To solve this problem, we use expert opinions to improve prediction accuracy. Firstly, we propose a novel similarity measure in order to highlight users' background. Then, combining users' ratings with expert opinions, the prediction get a right balance in both expert professional opinions and similar users. Finally, since SVD-based collab.rative filtering algorithms shows good performance on the prevention of noise, we use it to smooth the prediction. Experiments of MovieLens have shown that our proposed method improves recommendation quality obviously.

关键词： Recommendation Collab.rative Filtering Data Sparsity Expert Demography

来源：评论

学校读者我要写书评

暂无评论

A novel framework of online network coding for multicast switches with constrained buffers

引用

Journal of Electronics 2011年第4期28卷 460-467页

作者： Wang, Wei Yu, Li Zhu, Guangxi Li, Hui Wuhan National Lab. for Optoelectronics Division of Communiction and Intelligent Networks Department of Electronics and Information Engineering Huazhong University of Science and Technology Wuhan 430074 China Shenzhen Key Lab of Cloud Computing Technology and Application Shenzhen Graduate School Peking University Shenzhen 518055 China Department of Electronics and Information Engineering Huazhong University of Science and Technology Wuhan 430074 China

Network coding is able to address output conflicts when fanout splitting is allowed for multicast switching. Hence, it successfully achieves a larger rate region than non-coding approaches in crossbar switches. However, network coding requires large coding buffers and a high computational cost on encoding and decoding. In this paper, we propose a novel Online Network Coding framework called Online NC for multicast switches, which is adaptive to constrained buffers. Moreover, it enjoys a much lower decoding complexity O(n ²) by a Vandermonde matrix based approach, as compared to conventional randomized network coding O(n ³). Our approach realizes online coding with one coding algorithm that synchronizes buffering and coding. Therefore, we significantly reduce requirements on buffer space, while also sustaining high throughputs. We confirm the superior advantages of our contributions using empirical studies. © 2011 Science Press, Institute of Electronics, CAS and Springer-Verlag Berlin Heidelberg.

关键词： Multicast Network coding Packet switching Vandermonde matrix

来源：评论

学校读者我要写书评

暂无评论

A NOVEL FRAMEWORK OF ONLINE NETWORK CODING FOR MULTICAST SWITCHES WITH CONSTRAINED BUFFERS

引用

Journal of Electronics(China) 2011年第4期28卷 460-467页

作者： Wang Wei Yu Li Zhu Guangxi Li Hui Wuhan National Laboratory for Optoelectronics Division of Communiction ＆ Intelligent NetworksDepartment of Electronics and Information Engineering Huazhong University of Science and Technology Wuhan 430074 China Shenzhen Key Lab of Cloud Computing Technology ＆ Application Shenzhen Graduate School Peking University Shenzhen 518055 China

Network coding is able to address output conflicts when fanout splitting is allowed for multicast ***,it successfully achieves a larger rate region than non-coding approaches in crossbar ***,network coding requires large coding buffers and a high computational cost on encoding and *** this paper,we propose a novel Online Network Coding framework called Online NC for multicast switches,which is adaptive to constrained ***,it enjoys a much lower decoding complexity by a Vandermonde matrix based approach,as compared to conven-tional randomized network coding Our approach realizes online coding with one coding algo-rithm that synchronizes buffering and ***,we significantly reduce requirements on buffer space,while also sustaining high *** confirm the superior advantages of our contributions using empirical studies.

关键词： Packet switching Multicast Network coding Vandermonde matrix

来源：评论

学校读者我要写书评

暂无评论

Parallel method for preprocessing high-speed railway noise data based on MapReduce

引用

Tongxin Xuebao/Journal on Communications 2011年第9 A期32卷 263-269页

作者： Wang, Zhong-Gang Li, Tian-Rui Zhang, Jun-Bo Zhao, Cheng-Bing Gao, Zi-Zhe School of Information Science and Technology Southwest Jiaotong University Chengdu 610031 China Key Lab. of Cloud Computing and Intelligent Technology Chengdu 610031 Sichuan Province China

With the development of high-speed railway, its security problem gained more and more attention. Noise data collected by sensors reflected the operation condition and was close related to the security of train. The efficiency of processing data became significant due to the volume of data growing at an unprecedented rate. It was a challenge to process massive noise data effectively. A method for preprocessing massive noise data based on MapReduce was proposed by use of the idea of parallel computing. The experiments on Hadoop platform prove that the proposed method can improve the efficiency of preprocessing massive noise data.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

面向微博的情感影响最大化模型

面向微博的情感影响最大化模型

引用

第29届中国数据库学术会议

作者： OU Gaoyan 欧高炎 CHEN Wei 陈薇 WANG Tengjiao 王腾蛟 LEI Kai 雷凯 YANG Dongqing 杨冬青 Key Laboratory of High Confidence Software Technologies Ministry of Education Beijing 100871 Chin 高可信软件技术教育部重点实验室北京100871 北京大学信息科学技术学院北京100871 The Shenzhen Key Lab for Cloud Computing Technology and Applications Shenzhen Graduate School Peki 北京大学深圳研究生院深圳市云计算关键技术与应用重点实验室广东深圳518055

社交网络中影响最大化问题是寻找具有最大影响范围的节点。影响最大化的大部分求解算法仅仅依赖社交网络图。基于微博的转发关系树和微博内容的情感倾向性,以及用户的社交网络图,提出了一个能够刻画用户情感影响的情感影响最大化模型—... 详细信息

社交网络中影响最大化问题是寻找具有最大影响范围的节点。影响最大化的大部分求解算法仅仅依赖社交网络图。基于微博的转发关系树和微博内容的情感倾向性,以及用户的社交网络图,提出了一个能够刻画用户情感影响的情感影响最大化模型——情感影响分配模型(SID),证明了SID模型下的情感影响最大化问题是一个NP难问题,给出了一个具有精度保证的贪心算法。在真实的微博数据上的实验结果表明,SID模型能够有效地找出情感影响最大化的节点集,同时具有很高的扩展性。

关键词：社交网络情感分析信息传播模型分配算法

来源：评论

学校读者我要写书评

暂无评论

Towards the optimization of data mining execution process in distributed environments

引用

Journal of Computational Information Systems 2011年第8期7卷 2931-2939页

作者： Zhang, Yan Meng, Luoming Liu, Feng Li, Honghui Brezany, Peter School of Computer and Information Technology Beijing Jiaotong University Beijing China State Key Lab. of Networking and Switching Beijing University of Posts and Telecommunications Beijing China Institute of Scientific Computing University of Vienna Vienna Austria

The distribution and heterogeneity of data resources in loosely coupled distributed environments bring the challenges to data mining applications, because the parallelism and collab.ration of nodes should be considered during the optimization and execution. Data mining algorithms can be represented as data mining execution processes which are composed of finer grained operators, and optimizing the execution processes according to the distribution of resources is critical for the execution performance and presents several algorithmic and systemic challenges. The work described in this paper offers such optimization functionality to transform the central data mining execution processes into distributed ones according to the distribution of resources in loosely coupled distributed environments, such as Grid or clouds. First, data mining operators are analyzed and classified, and then optimization of data mining execution processes is divided into three phases in which data mining operators are processed according to their characteristics. The aim of optimization is to employ parallelism and collab.ration to achieve the better performance. The evaluation results show that the optimization approach can reduce the execution times and use the resources in balance. © 2005 by Binary Information Press.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Decomposition of association rules mining process and analysis of the intermediate results

引用

Journal of Computational Information Systems 2011年第10期7卷 3606-3613页

作者： Zhang, Yan Meng, Luoming Liu, Feng Li, Honghui Brezany, Peter School of Computer and Information Technology Beijing Jiaotong University Beijing 100000 China State Key Lab. of Networking and Switching Beijing University of Posts and Telecommunications Beijing 100000 China Institute of Scientific Computing University of Vienna Vienna Austria

Association rules mining is a method for discovering interesting relations between variables in large databases. In data mining systems/platforms, association rules mining process is always treated as a black-box and it only focuses on the function of the whole algorithm, so what happens during the mining process is totally invisible to users and applications, which makes it difficult to analyze the intermediate result and predicate the execution cost before the execution. The work presented in this paper elab.rates on decomposing the typical association rules mining algorithm-Apriori as an execution process which is composed of finer-grained data mining operators, and then based on the decomposition, the size of intermediate result of every data mining operator is estimated, which make it possible to estimate the performance of Apriori execution process precisely and the customers can have a clue about the intermediate results and the execution cost of Apriori algorithm. The size of intermediate results and the execution time of every data mining operator are evaluated via OGSA-DAI-based implementations, which show the feasibility of the proposed approach as well as the possibility to estimate Apriori execution process beforehand. © 2011 Binary Information Press.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Beyond Green: Evolution to Adaptability and Recyclab.lity

Beyond Green: Evolution to Adaptability and Recyclability

引用

IEEE/ACM Int'l Conference on & Int'l Conference on Cyber, Physical and Social computing (CPSCom) Green computing and Communications (GreenCom)

作者： Yuzhong Sun Ying Song Key Laboratory of Computer System and Architecture Chinese Academy of Sciences (CAS) Beijing China Institute of Computing Technology Chinese Academy of Sciences (CAS) Beijing China Key Lab. of Comput. Syst. & Archit. Beijing China

In current social computing system, not only hardware but also software experiences a directly discarded mode. Such directly discarded mode may result in huge waste. The major challenge in green computing is the recyclab.lity of the computing system. In order to address this challenge in the software field, this paper proposes a design idea of green software embodying the adaptability and recyclab.lity. The adaptable and recyclab.e strategy may consist of two phases. The first one is compressing the increasingly deeper software stack, another one is keeping the functionality recycling and code reuse. The adaptability and recyclab.lity mean automatically decomposing the complex software into several parts which are ease to be reused and automatically selecting the feasible parts for the on-writing software. And we also explore the system software design path to adaptability and recyclab.lity in our previous work as well as in the future.

关键词： Hardware Green products Recycling Software design Computers Complexity theory

来源：评论

学校读者我要写书评

暂无评论

XML模式匹配:整体连接算法TurboStack

XML模式匹配:整体连接算法TurboStack

引用

第29届中国数据库学术会议

作者： Guo Shaosong 郭少松 Bao Xiaoyuan 包小源 Chen Wei 陈薇 Wang Tengjiao 王腾蛟 Lei Kai 雷凯 Yang Dongqing 杨冬青 Key Laboratory of High Confidence Software Technologies(Ministry of Education) School of EECS Peki 高可信软件技术教育部重点实验室北京大学信息科学技术学院北京 100871 School of EECS Peking University Beijing 100871 北京大学信息科学技术学院北京 100871 The Shenzhen Key Lab for Cloud Computing Technology and Applications(SPCCTA) Peking University Shen 深圳市云计算关键技术与应用重点实验室(SPCCTA) 北京大学深圳研究生院

含谓词的XPath查询为小枝查询(twig query),它是XQuery最基本的查询模式。小枝查询算法有两大类：小枝分解和整体小枝连接,其中TwigStack系列算法处理小枝查询的效率是最优的,但其缺点在于不支持Twig Query中含“OR”以及通配符“*”的... 详细信息

含谓词的XPath查询为小枝查询(twig query),它是XQuery最基本的查询模式。小枝查询算法有两大类：小枝分解和整体小枝连接,其中TwigStack系列算法处理小枝查询的效率是最优的,但其缺点在于不支持Twig Query中含“OR”以及通配符“*”的查询;在大型商业数据库管理系统中,TurboXPath是DB2用于处理小枝查询的基本算法,它对XPath的支持较全面,但由于TurboXPath是针对XML数据流查询处理设计的,因而对数据库中Native存储的XML数据的查询处理效率较低;针对已有方法的不足,设计了一种纯XML存储方式,以DDE编码为基础,提出了TurboStack算法,并通过大量实验验证了该方法的有效性。

关键词：可扩展标记语言数据模式匹配整体连接算法信息查询

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：