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

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Zhijun Dai Fengjun Zhang Hongan Wang Intelligence Engineering Laboratory Institute of Software Chinese Academy of Sciences China Intelligence Engineering Lab Institute of Software State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China

Sparse bundle adjustment is widely used in many computer vision applications. In this paper, we propose a method for performing bundle adjustments using the L 1 norm. After linearizing the mapping function in bundle adjustment on its first order, the kernel step is to compute the L 1 norm equations. Considering the sparsity of the Jacobian matrix in linearizing, we find two practical methods to solve the L 1 norm equations. The first one is an interior-point method, which transfer the original problem to a problem of solving a sequence of L 2 norm equations, and the second one is a decomposition method which uses the differentiability of linear programs and represents the optimal updating of parameters of 3D points by the updating variables of camera parameters. The experiments show that the method performs better for both synthetically generated and real data sets in the presence of outliers or Laplacian noise compared with the L 2 norm bundle adjustment, and the method is efficient among the state of the art L 1 minimization methods.

关键词： Cameras Noise Equations Mathematical model Laplace equations Minimization Sparse matrices

来源：评论

学校读者我要写书评

暂无评论

Efficient heuristics for minimizing reconfiguration overhead on VLSI arrays with faults

引用

Journal of Computational Information Systems 2012年第16期8卷 6663-6670页

作者： Zhu, Yuanbo Wu, Jigang Jiang, Guiyuan Chen, Ke School of Computer Science and Software Engineering Tianjin Polytechnic University Tianjin 300387 China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100190 China School of Computer Science and Technology Tianjin University Tianjin 300072 China

This paper presents an efficient heuristic algorithm to minimize the overhead on the reconfiguration for two-dimensional VLSI/WSI arrays in the presence of faulty processing elements (PEs). According to the locations of faulty PEs, the proposed technique is utilized to preprocess the host array by identifying some fault-free but unusable PEs as faults, which minimizes the size of the set of fault-free PEs that are actually useful for reconfiguration. Simulation results show that, the improvements over the two existing algorithms are up to 48% and 52% in terms of runtime, respectively. Moreover, the improvement increases with the increasing faulty density of the host arrays. © 2012 Binary Information Press.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Efficient Heuristics for Minimizing Reconfiguration Overhead on VLSI Arrays with Faults

Efficient Heuristics for Minimizing Reconfiguration Overhead...

引用

2012年全国理论计算机科学学术年会(NCTCS2012)

作者： Yuanbo Zhu Jigang Wu Guiyuan Jiang Ke Chen State Key Laboratory of Computer Science Institute of Software Chinese Academy of SciencesBeijing 100190 China School of Computer Science and Technology Tianjin University Tianjin 300072 China School of Computer Science and Software School of Computer Science and Software Engineering Tianjin Polytechnic University Tianjin 300387 China School of Computer Science and Software Engineering Tianjin Polytechnic University Tianjin 300387 China

is paper presents an efficient heuristic algorithm to minimize the overhead on the reconfiguration for two-dimensional VLSI/WSI arrays in the presence of faulty processing elements(PEs).

关键词：

来源：评论

学校读者我要写书评

暂无评论

Compositional verification of liveness property in inhibitor-arc connections of Petri net systems

Journal of Software

引用

Journal of software 2012年第3期7卷 499-507页

作者： Pu, Fei College of Computer and Information Engineering Zhejiang Gongshang University Hangzhou China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China

Petri net systems synthesis can construct large systems without the requirement of reachability analysis so that it can reduce the high complexity of analyzing global system. In a synthesis process, such good properties of subsystems as liveness and deadlock-freeness etc, must be preserved in synthesized system. This paper focusses on liveness preservation in inhibitor-arc connection operations. The systems dynamic, concurrent behavior relation i.e. concurrent language relation in inhibitor-arc connections is stressed studied. The corresponding language relation formula is present and proved, and it can be applied to determine liveness of synthesized system in inhibitor-arc connection operations. Furthermore, some criteria are introduced, which are necessary and sufficient for liveness, to determine the liveness of global system by the same ones of local systems. Finally, some examples are given, illustrating the effectiveness of the proposed approach in modeling and analyzing of large systems. © 2012 academy PUBLISHER.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Bottleneck Prediction Method Based on Improved Adaptive Network-based Fuzzy Inference System (ANFIS) in Semiconductor Manufacturing System

引用

Chinese Journal of Chemical engineering 2012年第6期20卷 1081-1088页

作者：曹政才邓积杰刘民王永吉 College of Information Science and Technology Beijing University of Chemical Technology Key Laboratory of Measurement and Control of Complex Systems of Engineering Ministry of EducationSoutheast University Tsinghua National Laboratory for Information Science and Technology State Key Laboratory of Computer Science Institute of SoftwareChinese Academy of SciencesBeijing 100190China

Semiconductor manufacturing (SM) system is one of the most complicated hybrid processes involved continuously variable dynamical systems and discrete event dynamical systems. The optimization and scheduling of semiconductor fabrication has long been a hot research direction in automation. Bottleneck is the key factor to a SM system, which seriously influences the throughput rate, cycle time, time-delivery rate, etc. Efficient prediction for the bottleneck of a SM system provides the best support for the consequent scheduling. Because categorical data (product types, releasing strategies) and numerical data (work in process, processing time, utilization rate, buffer length, etc.) have significant effect on bottleneck, an improved adaptive network-based fuzzy inference system (ANFIS) was adopted in this study to predict bottleneck since conventional neural network-based methods accommodate only numerical inputs. In this improved ANFIS, the contribution of categorical inputs to firing strength is reflected through a transformation matrix. In order to tackle high-dimensional inputs, reduce the number of fuzzy rules and obtain high prediction accuracy, a fuzzy c-means method combining binary tree linear division method was applied to identify the initial structure of fuzzy inference system. According to the experimental results, the main-bottleneck and sub-bottleneck of SM system can be predicted accurately with the proposed method.

关键词： semiconductor manufacturing system bottleneck prediction adaptive network-based fuzzy inference system

来源：评论

学校读者我要写书评

暂无评论

SLA-Driven adaptive resource allocation for virtualized servers

SLA-Driven adaptive resource allocation for virtualized serv...

引用

作者： Zhang, Wei Ruan, Li Zhu, Mingfa Xiao, Limin Liu, Jiajun Tang, Xiaolan Mei, Yiduo Song, Ying Sun, Yuzhong State Key Laboratory of Software Development Environment Beijing 100191 China School of Computer Science and Engineering Beihang University Beijing 100191 China China Center Beijing 100044 China Istitute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

In order to reduce cost and improve efficiency, many data centers adopt virtualization solutions. The advent of virtualization allows multiple virtual machines hosted on a single physical server. However, this poses new challenges for resource management. Web workloads which are dominant in data centers are known to vary dynamically with time. In order to meet application's service level agreement (SLA), how to allocate resources for virtual machines has become an important challenge in virtualized server environments, especially when dealing with fluctuating workloads and complex server applications. User experience is an important manifestation of SLA and attracts more attention. In this paper, the SLA is defined by server-side response time. Traditional resource allocation based on resource utilization has some drawbacks. We argue that dynamic resource allocation directly based on real-time user experience is more reasonable and also has practical significance. To address the problem, we propose a system architecture that combines response time measurements and analysis of user experience for resource allocation. An optimization model is introduced to dynamically allocate the resources among virtual machines. When resources are insufficient, we provide service differentiation and firstly guarantee resource requirements of applications that have higher priorities. We evaluate our proposal using TPC-W and Webbench. The experimental results show that our system can judiciously allocate system resources. The system helps stabilize applications' user experience. It can reduce the mean deviation of user experience from desired targets. Copyright © 2012 The Institute of Electronics, Information and Communication Engineers.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Improving linear drawing Concerning Stylized Sketch

Improving linear drawing Concerning Stylized Sketch

引用

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

作者： Wen-Jing Guo Yan-Qiu Zhang Cui-Xia Ma Yong-Jin Liu Tsinghua National Laboratory for Information Science and Technology Department of Computer Science a Intelligence Engineering Laboratory Institute of SoftwareChinese Academy of Sciences Beijing Chi

Generally speaking,sketch takes advantage in conciseness and storage *** with the cognitive features of users,sketch maybe a better choice to communicate image message,which contains the least information but sufficiently satisfies the general needs of users and *** the paper,we propose a novel sketch stylized method,which improves the approach of Kang et al.[1] to get rid of some abundant points and eliminate the hard edges of the sketch,and finally modify the existing algorithm to redraw the sketch to reach better visual *** method based on existing approach and our own algorithm is easy to implement,and the effect is *** order to examine the satisfaction,we design a questionnaire and invite some volunteers to evaluate the sketch generated by the integrated method,and finally reach a high evaluation score.

关键词： sketch redundant points hard borders redrawing

来源：评论

学校读者我要写书评

暂无评论

Introduction

Introduction

引用

Information Security for South Africa (ISSA)

作者： Hein Venter Marianne Loock Marijke Coetzee Department of Computer Science University of Pretoria South Africa School of Computing University of South Africa South Africa Academy for Computer Science and Software Engineering University of Johannesburg South Africa

ISSA2012 is the annual conference for the information security community that continues on the successful recipe established in *** are pleased to announce, however, that from 2010, ISSA is co-sponsored by the IEEE Systems, Man and Cybernetics Society (SMCS) Chapter, a chapter of the IEEE South Africa Section. The upcoming conference is held under the auspices of the University of Johannesburg academy for computer science and software engineering, the University of South Africa School of Computing and the University of Pretoria School of Information Technology.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Preliminary results of a systematic review on requirements evolution

Preliminary results of a systematic review on requirements e...

引用

16th International Conference on Evaluation & Assessment in software engineering (EASE 2012)

作者： Juan Li He Zhang Liming Zhu Ross Jeffery Qing Wang Mingshu Li Institute of Software Chinese Academy of Sciences China NICTA Australia School of Computer Science and Engineering University of New South Wales Australia

ISBN: (纸本)9781622762538

Background: software systems must evolve in order to adapt in a timely fashion to the rapid changes of stakeholder needs, technologies, business environment and society regulations. Numerous studies have shown that cost, schedule or defect density of a software project may escalate as the requirements evolve. Requirements evolution management has become one important topic in requirements engineering research. Aim: To depict a holistic state-of-the-art of requirement evolution management. Method: We undertook a systematic review on requirements evolution management. Results: 125 relevant studies were identified and reviewed. This paper reports the preliminary results from this review: (1) the terminology and definition of requirements evolution; (2) fourteen key activities in requirements evolution management; (3) twenty-eight metrics of requirements evolution for three measurement goals. Conclusions: Requirements evolution is a process of continuous change of requirements in a certain direction. Most existing studies focus on how to deal with evolution after it happens. In the future, more research attention on exploring the evolution laws and predicting evolution is encouraged.

关键词： Requirements evolution Requirements change Management process Measurement Systematic literature review evolution Review, Systematic software project preliminary data

来源：评论

学校读者我要写书评

暂无评论

Selective opening chosen ciphertext security directly from the DDH assumption

Selective opening chosen ciphertext security directly from t...

引用

6th International Conference on Network and System Security, NSS 2012

作者： Liu, Shengli Zhang, Fangguo Chen, Kefei Dept. of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240 China School of Information Science and Technology Sun Yat-sen University Guangzhou 510006 China State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences China Shanghai Key Laboratory of Scalable Computing and Systems Shanghai China

ISBN: (纸本)9783642346002

Chosen-ciphertext security has been well-accepted as a standard security notion for public key encryption. But in a multi-user surrounding, it may not be sufficient, since the adversary may corrupt some users to get the random coins as well as the plaintexts used to generate ciphertexts. The attack is named "selective opening attack". We study how to achieve full-fledged chosen-ciphertext security in selective opening setting directly from the DDH assumption. Our construction is free of chameleon hashing, since tags are created for encryptions in a flexible way to serve the security proof. © 2012 Springer-Verlag.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：