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

IEEE International Conference on Performance, Computing and Communications (IPCCC)

作者： Guangping Xu Sheng Lin Gang Wang Xiaoguang Liu Kai Shi Hua Zhang Tianjin Key Lab. of Intelligence Computing and New Software Technology Tianjin China College of Information Tech. and Science Nankai University Tianjin China School of Computer and Communication Tianjin University of Technology Tianjin China

Heterogeneity is the natural feature in distributed networks. Different from the traditional disk array, the amount of data allocated on heterogenous peers may be not the same. To maximize the reliability of stored data objects in heterogeneous networks, the optimal allocation of erasure-coded fragments is a challenging problem constrained with heterogeneous peer availab.lities and redundancy overhead. This paper examines this optimal problem considered MDS erasure codes applied into distributed storage networks. First, we model the reliability of an allocation with the weighted-k-out-of-s model and extend its properties to efficiently calculate the reliability of an allocation; then we reduce the reliability computation of a given allocation to linear computation cost based on the weighted k-out-of-s model. Then, we deduce the problem to integer partition problem and propose two order-based search algorithms. Our experiments show that our proposed algorithms can be applied to find the optimal allocations efficiently in various practical coding cases. Furthermore, we evaluate the performance of our proposed search algorithms with some practical storage settings, and then present experimental results including the reliability, redundancy overheads and allocation pattern for the optimal allocation driven by practical network traces.

关键词： Resource management Reliability theory Availab.lity Computational modeling Redundancy computer network reliability

来源：评论

学校读者我要写书评

暂无评论

Cluster-based superseding nearest neighbor queries on uncertain data

引用

Journal of Convergence Information Technology 2012年第17期7卷 392-401页

作者： Liu, Wenyuan Li, Wei Du, Ying Chen, Zijun He, Yourui College of Information Science and Engineering Yanshan University Qinhuangdao Hebei 066004 China College of Economics and Management Yanshan University Qinhuangdao Hebei 066004 China The Key Lab. for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao Hebei 066004 China

Recently, query processing based on uncertain data is becoming research focuses. Cluster-based superseding nearest neighbor (CSNN) query algorithm on uncertain data is proposed in this paper. We divide the instances of each object into k clusters by applying the clustering algorithm k-means, and then store these clustered objects in R-tree like index structures. Ranked list will be retrieved through traversing R-tree, which could include instances, clusters, or objects. While unfolding the ranked list, the superseding graph G will be constructed gradually based on the superseding relationship. The final result sets will be found through pruning and validating the superseding graph G. Finally, the experimental results show that the algorithm is efficient and effective.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

The higher-order meet-in-the-middle attack and its application to the Camellia block cipher (extended abstract)

The higher-order meet-in-the-middle attack and its applicati...

引用

13th International Conference on Cryptology in India, INDOCRYPT 2012

作者： Lu, Jiqiang Wei, Yongzhuang Kim, Jongsung Pasalic, Enes Institute for Infocomm Research Agency for Science Technology and Research 1 Fusionopolis Way #19-01 Connexis Singapore 138632 Singapore Guilin University of Electronic Technology Guilin City Guangxi Province 541004 China State Key Lab. of Information Security Institute of Software Chinese Academy of Sciences Beijing 100190 China Department of E-Business Kyungnam University 449 Wolyoung-dong Masan Kyungnam Korea Republic of University of Primorska FAMNIT Koper Slovenia

ISBN: (纸本)9783642349300

The meet-in-the-middle (MitM) attack is a technique for analysing the security of a block cipher. In this paper, we propose an extension of the MitM attack, which we call the higher-order meet-in-the-middle (HO-MitM) attack;the core idea of the HO-MitM attack is to use multiple plaintexts to cancel some key-dependent component(s) or parameter(s) when constructing a basic unit of "value-in-the-middle". We introduce a novel approach, which combines integral cryptanalysis with the MitM attack, to construct HO-MitM attacks on 10-round Camellia under 128 key bits, 11-round Camellia under 192 key bits and 12-round Camellia under 256 key bits, all of which include FL/FL-1 functions. Finally, we apply an existing approach to construct HO-MitM attacks on 14-round Camellia without FL/FL-1 functions under 192 key bits and 16-round Camellia without FL/FL-1 functions under 256 key bits. © Springer-Verlag 2012.

关键词： Security of data

来源：评论

学校读者我要写书评

暂无评论

Wide Area Control Framework Design Considering Different Feedback Time Delays

Wide Area Control Framework Design Considering Different Fee...

引用

IEEE Power and Energy Society General Meeting

作者： Gang Chen Yuanzhang Sun Vaithianathan "Mani" Venkatasubramanian Lin Cheng Jin Lin Anjan Bose Weixing Zhao Cheng Lin State Key Lab. of Power Systems Dept. of Electrical Engineering Tsinghua University Beijing 100084 China School of Electrical Engineering and Computer Science Washington State University Pullman WA 99164-2752 USA Guizhou Electric Power Grid Dispatching and Control Center Guiyang Guizhou 550002 China

ISBN: (纸本)9781467327275

In this paper, a framework for a real-time wide area controller is established for damping small-signal instability related events in interconnected power systems. Offline designing is performed to design the centralized controller for each inter-area mode of the power system. Residue approach is used to select the most effective stabilizing signals and controller locations. Different constant time delays are taken into controller parameters design. Thus an offline controller database is formed, including different controllers of each mode. The parameters of each controller are different for various ranges of time delay. The damping and other mode information will be identified by online multi-Prony analysis. When an inter-area mode is detected with weak or negative damping, say less than 3%, the corresponding controller for the detected mode will be initiated and deployed for enhancing the damping of the problematic mode. The time delay, which is used to select a suitable set of parameters for a chosen controller, could be calculated online, using the time stamps of the actuator and feedback signal. The paper proposes the framework of the controller with preliminary discussions on the various components of the controller, including: 1) the offline controller database, 2) the online detection of undamped oscillations, and 3) the online corrective control actions at the actuator. The 4-machine 2-area case study results demonstrated the advantage of the proposed method.

关键词： Small signal stability phasor measurement units (PMUs) power system stabilizer (PSS) wide area control damping controller time delay Controllers timestamp time delay undamped oscillations central controller OFF LINE Frameworks actuators

来源：评论

学校读者我要写书评

暂无评论

Optimizing SpMV for diagonal sparse matrices on GPU

Optimizing SpMV for diagonal sparse matrices on GPU

引用

40th International Conference on Parallel Processing, ICPP 2011

作者： Sun, Xiangzheng Zhang, Yunquan Wang, Ting Zhang, Xianyi Yuan, Liang Rao, Li Lab. of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences Beijing China State Key Lab. of Computer Science Institute of Software Chinese Academy of Sciences Beijing China Graduate University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9780769545103

Sparse Matrix-Vector multiplication (SpMV) is an important computational kernel in scientific applications. Its performance highly depends on the nonzero distribution of sparse matrices. In this paper, we propose a new storage format for diagonal sparse matrices, defined as Compressed Row Segment with Diagonal-pattern (CRSD). In CRSD, we design diagonal patterns to represent the diagonal distribution. As the Graphics Processing Units (GPUs) have tremendous computation power and OpenCL makes them more suitable for the scientific computing, we implement the SpMV for CRSD format on the GPUs using OpenCL. Since the OpenCL kernels are complied at runtime, we design the code generator to produce the codelets for all diagonal patterns after storing matrices into CRSD format. Specifically, the generated codelets already contain the index information of nonzeros, which reduces the memory pressure during the SpMV operation. Furthermore, the code generator also utilizes property of memory architecture and thread schedule on the GPUs to improve the performance. In the evaluation, we select four storage formats from prior state-of-the-art implementations (Bell and Garland, 2009) on GPU. Experimental results demonstrate that the speedups reach up to 1.52 and 1.94 in comparison with the optimal implementation of the four formats for the double and single precision respectively. We also evaluate on a two-socket quad-core Intel Xeon system. The speedups reach up to 11.93 and 12.79 in comparison with CSR format under 8 threads for the double and single precision respectively. © 2011 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Collab.ratively modeling buildings from large-scale street-side and remote sensing images

Collaboratively modeling buildings from large-scale street-s...

引用

2nd International Conference on Multimedia Technology, ICMT 2011

作者： Hua, Wei Zhang, Wei State Key Lab. of CAD and CG College of Computer Science Zhejiang University Hangzhou China

ISBN: (纸本)9781612847740

This paper proposed an approach to rapidly generate 3D models for street-side buildings from street-side images, remote sensing images, and GPS information. Traditional modeling methods usually require a single user to fulfill all processes of 3D modeling, and lack efficient management on massive data. Thus, they are unsuitable for large-scale modeling. In order to overcome those drawbacks, we employ the pipeline idea. The modeling processes are divided into several steps, which are further assembled to form a pipeline elab.rately. We allocate computing resources into each step according to their requirements;on the other side, human resources are deployed into the pipeline to achieve team-work modeling. To demonstrate the effectiveness of ur approach, we developed a distributed prototype system for rapid large-scale urban 3D modeling. This system was tested to build an urban scene with more than 500, 000 street-side images. The results show great improvement on modeling efficiency compared with traditional methods, and it reveals a great prospect in applications. © 2011 IEEE.

关键词： Pipelines

来源：评论

学校读者我要写书评

暂无评论

Self-healing optical access networks (SHOAN) operated by optical switching technologies

引用

IEEE Transactions on Network and Service Management 2011年第3期8卷 234-244页

作者： Huang, Anpeng Liu, Siyu Xie, Linzhen Chen, Zhangyuan Mukherjee, Biswanath State Key Lab. of Advanced Optical Communication Systems and Networks China Wireless Communications Lab. PKU-UCLA Joint Research Institute Peking University Beijing 100871 China Department of Computer Science University of California Davis United States

An optical access network should offer low-cost reliable services to its end users. To address this problem, an optimal solution is needed which can turn an optical access architecture into a self-healing system. Hence, we propose the Self-Healing Optical Access Network (SHOAN), in which two or more optical access architectures are partners of each other, and they are interconnected by elementary optical crossbar switches into a simple mesh network. In SHOAN, the crossbar switches can keep each access architecture as an independent and closed system for only serving its own end users in normal state. But the crossbars become open in fault scenarios. Whenever a failure occurs in the network, the fault can be monitored and affected services can be recovered by the partner of the access architecture that is affected. Such an interconnected optical access network can withstand failures in its transmission paths, and recover network services in a self-healing way. Compared to existing solutions (e.g., dual-home architecture), illustrative examples demonstrate that SHOAN has many desirable properties: (1) it is robust because risks are disjointed, (2) it is reliable because service recovery is given top priority, and (3) it has low cost because redundant backup components are not necessary since the partner's resources act as backup resources. Analysis results show that SHOAN can minimize disruption duration and network cost for broadband access services. © 2011 IEEE.

关键词： Cost benefit analysis

来源：评论

学校读者我要写书评

暂无评论

A model of malware passive propagation on the WWW

引用

Journal of Computational Information systems 2011年第7期7卷 2593-2600页

作者： Liu, Chunbo Wang, Zhi Jia, Chunfu College of Information Technical Science Nankai University Tianjin 300071 China College of Computer Science and Technology Civil Aviation University of China Tianjin 300300 China State Key Lab. for Novel Software Technology Nanjing University China

Web-based malwares host in websites fixedly and are downloaded onto user's computers automatically while users browse. This passive propagation pattern is different from that of traditional viruses and worms. A propagation model based on reverse web graph is proposed. In this model, propagation of malwares is analyzed by means of random jump matrix which combines orderness and randomness of user browsing behaviors. Explanatory experiments, which has single or multiple propagation sources respectively, prove the validity of the model. Using this model, people can evaluate the hazardness of specified websites and take corresponding countermeasures. Copyright © 2011 Binary Information Press.

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

Empirical studies of pen tilting performance in pen-based user interfaces 11

Empirical studies of pen tilting performance in pen-based us...

引用

Proceedings of the 2011 Visual Information Communication - International Symposium

作者： Tian, Feng Cao, Xiang Lu, Fei Dai, Guozhong Zhang, Xiaolong Wang, Hongan Intelligence Engineering Lab. Institute of Software Chinese Academy of Sciences China Microsoft Research Asia China State Key Lab. of Computer Science Institute of Software Chinese Academy of Sciences China Pennsylvania State University United States

ISBN: (纸本)9781450308755

Recently, pen tilting has been explored in pen-based user interfaces and has shown potential to improve user interaction in various tasks (e.g., menu selection, modeless object manipulation). However, some basic questions concerning pen tilting behaviors, such as the ideal range, azimuth size, and direction of pen tilting, have not been thoroughly investigated. In this paper, we report our empirical studies on user performances in basic pen tilting tasks. First, we conducted a baseline study, which helps us to determine tilting directions, tilting ranges, and the thresholds that separate incidental pen tilting actions from intentional actions used for interaction. Based on the results from the baseline study, we designed an experiment to investigate user performances in goal tilting in different tilting ranges, azimuth sizes, and directions. Drawing on the results of our data analyses on task completion time, error rate, and pen tip movements, we discussed values of tilting parameters like titling range, minimal azimuth size, and tilting direction. © 2011 ACM.

关键词： User interfaces

来源：评论

学校读者我要写书评

暂无评论

Energy conservation using network coding in grid wireless sensor networks

Energy conservation using network coding in grid wireless se...

引用

International Workshop on Intelligent systems and Applications

作者： Kasireddy, Bharat Wang, Yun Liu, Jin Department of Computer Science Southern Illinois University Edwardsville IL United States State Key Lab. of Software Engineering Wuhan University China

ISBN: (纸本)9781424498574

This work investigates the energy consumption rate of an energy-constrained wireless sensor network and demonstrates that sensor energy dissipation can be reduced by employing network coding in terms of routing the same amount of sensing data to base stations through theoretical and simulation perspectives. In addition,this work examines the interplays between network parameters such as node density, traffic rate,and coding strategy and the performance gain of employing network coding for energy conservation in a grid wireless sensor *** provides insights into the design of wireless sensor networks and the deployment of network coding for energy conservation in practice. © 2011 IEEE.

关键词： Energy conservation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：