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

A reconfigurable routing method for fault-tolerant mesh-based network on chip

Journal of information and Computational Science 2013年第1期10卷 157-165页

作者： Liu, Yanhua Ruan, Ying Lai, Zongsheng Sun, Ling Institute of Microelectronics Circuit and System East China Normal University Shanghai 200241 China Jiangsu Provincial Key Lab. of ASIC Design Nantong University Nantong 226019 China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

As the semiconductor industry advances to nano-technology points, Network on Chip (NoC) components are becoming vulnerable to errors during the system operation. Consequently, fault-tolerant techniques for NoC are needed to achieve high reliability. In this paper, we present a fault-tolerant routing method to tolerate faulty routers in a two-dimension (2D) mesh-based NoC. With this method, the system can have a multi-router fault-tolerant capability and the routing path can be dynamically reconfigured to support different situations caused by faulty routers in NoC. Fault-tolerance capability and system performance of the proposed method are evaluated through analysis and simulations. Theoretical analysis and simulation results show that the proposed method can enhance the reliability of system and offer considerable fault-tolerance capability. © 2013 by Binary information Press.

关键词： Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

Variable-order fractional derivative rutting depth prediction of asphalt pavement based on the RIOHTrack full-scale track

引用

Science China(information Sciences) 2023年第5期66卷 196-214页

作者： Yu WANG Jiaojiao YAN Wei HUANG Leszek RUTKOWSKI Jinde CAO School of Mathematics Southeast University Jiangsu Provincial Key Laboratory of Networked Collective Intelligence Southeast University Intelligent Transportation System Research Center Southeast University Systems Research Institute of the Polish Academy of Sciences Institute of Computer Science AGH University of Science and Technology Information Technology Institute University of Social Sciences Yonsei Frontier Lab Yonsei University

Rutting deformation is typical damage to asphalt pavement and can be quantitatively described as the time-varying mechanical deformation feature of the asphalt mixture during the creep process. First,a nonlinear viscoelastic creep model is established based on the Caputo variable-order fractional *** fractional order in this model is not fixed and is defined as a time-varying function. The time-dependent mechanical properties of asphalt mixtures are efectively reflected. Based on the modified Burgers model, the variable-order function is revised to a linear form. Second, the variable-order fractional Burgers rutting model is obtained by fitting the test data of the RIOHTrack full-scale track. The Levenberg-Marquardt optimization algorithm is used to analyze the test data and the corresponding parameters to obtain more accurate and applicable variable-order fractional rutting mechanics and empirical models for diferent asphalt pavement structures. Finally, according to the classification of the pavement structure, structures III and VI are taken as examples. The rutting prediction and comparison results of several representative pavement structures are obtained to verify that the proposed rutting prediction model can also accurately predict all road sections of RIOHTrack. The new model is also compared with the rutting model of the mechanistic-empirical pavement design guide, the fractional-order Burgers rutting model, and the modified Burgers rutting model. The fitting results are evaluated using the determination coefficient R2. The results show that the variable-order fractional Burgers rutting model proposed in this study exhibits a better fit and is more applicable to describe the rutting deformation of asphalt pavement.

关键词： RIOHTrack full-scale track Caputo fractional derivative variable-order fractional modified Burgers model rutting prediction

来源：评论

学校读者我要写书评

暂无评论

Vertex-disjoint paths in the generalized hypercube under 1-restricted connectivity 21

Vertex-disjoint paths in the generalized hypercube under 1-r...

引用

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on Data Science and Systems, HPCC/SmartCity/DSS 2019

作者： Wang, Guijuan Lin, Cheng-Kuan Fan, Jianxi Cheng, Baolei Liu, Zhao School of Computer Science and Technology Soochow University Suzhou215006 China College of Mathematics and Computer Science Fuzhou University Fuzhou350108 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Jiangsu Province Nanjing210003 China Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou215006 China

ISBN: (纸本)9781728120584

The generalized hypercube is an excellent interconnection network since it includes many interconnection topologies and it can be used to construct many data center networks. Considering the probability that, in general, all neighbors of one vertex becoming faulty at the same time is extremely low, we assume that each vertex has at least one fault-free neighbor. An r-dimensional generalized hypercube is denoted by G(m-r, m-r-1,⋅, m-1). In this paper, we proposed an efficient algorithm which can construct at least κ^1(G) disjoint paths based on any two adjacent vertices in G(m-r, m-r-1, m-1) in O(rm) time where κ^1(G) is the 1-restricted connectivity of G(m-r, m-r-1, m-1). The maximum length of these disjoint paths is bounded by 7. © 2019 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Efficient Parallel Community Detection in Large Edge-Intensive Networks 2

Efficient Parallel Community Detection in Large Edge-Intensi...

引用

2nd International Conference on Advanced Cloud and Big Data, CBD 2014

作者： Gao, Guangliang Bu, Zhan Wu, Zhiang Li, Yuan Cao, Jie College of Computer Sci. and Eng. Nanjing University of Science and Technology China Jiangsu Provincial Key Lab. of E-Business Nanjing University of Finance and Economics China

ISBN: (纸本)9781479980857

Community detection is a classic and very difficult task in social network analysis. A large number of methods have been developed for both efficient and effective community detection. However, much of the existing methods are heavily dependent on the number of links in the network, and thus they often suffer from the computational inefficiency when meeting large edge-intensive networks. In this paper, we present a novel SIMPLifying and Ensembling (SIMPLE) framework for parallel community detection. It employs the random link sampling to simplify the network and obtain basic partitionings on every sampled graphs. Then, the K-means-based Consensus Clustering is used to ensemble a number of basic partitionings to get high-quality community structures. Meanwhile, steps of random sampling and sampled graph partitioning are encapsulated into MapReduce to further improve the efficiency. Experiments on four real-world social networks analyze key parameters and factors inside SIMPLE, and demonstrate the effectiveness of the SIMPLE. © 2014 IEEE.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

An improved method in change detection of multitemporal remote sensing image

An improved method in change detection of multitemporal remo...

引用

4th International Conference on Intelligence Science and Big Data Engineering, IScIDE 2013

作者： Liao, Fangshun Yu, Sufen Li, Ying Zhang, Yanning Shaanxi Provincial Key Lab. of Speech and Image Information Processing Northwestern Polytechnical University Xi'an Shaanxi 710072 China Science and Technology on Electro-optic Control Laboratory Louyang 471009 China

ISBN: (纸本)9783642420566

Traditional Markov random Field (MRF) methods assume that neighboring pixels tend to have the same lab.l. However, this assumption is always inconsistent with the actual situation and affects the resultant accuracy of the algorithm. To overcome this, we propose an object-based Markov Random Field (OMRF) model and a change detection method based on OMRF model. The OMRF model assumes that pixels within same object are in the same class. First, we generate the difference image from multi-temporal remote sensing images. Second, Mean Shift is applied to extract objects from difference image. Finally, change detection map is generated by iterative algorithm. The experimental results show that the algorithm can effectively improve the detection accuracy of the algorithm on real remote sensing datasets. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Change detection

来源：评论

学校读者我要写书评

暂无评论

Pick-up tree based route recommendation from taxi trajectories

Pick-up tree based route recommendation from taxi trajectori...

引用

13th International Conference on Web-Age information Management, WAIM 2012

作者： Hu, Haoran Wu, Zhiang Mao, Bo Zhuang, Yi Cao, Jie Pan, Jingui State Key Lab. for Novel Software Technology Nanjing University Nanjing China Jiangsu Provincial Key Laboratory of E-Business Nanjing University of Finance and Economics Nanjing China College of Computer and Information Engineering Zhejiang Gongshang University Hangzhou China

ISBN: (纸本)9783642322808

Recommending suitable routes to taxi drivers for picking up passengers is helpful to raise their incomes and reduce the gasoline consumption. In this paper, a pick-up tree based route recommender system is proposed to minimize the traveling distance without carrying passengers for a given taxis set. Firstly, we apply clustering approach to the GPS trajectory data of a large number of taxis that indicates state variance from "free" to "occupied", and take the centroids as potential pick-up points. Secondly, we propose a heuristic based on skyline computation to construct a pick-up tree in which current position is its root node that connects all centroids. Then, we present a probability model to estimate gasoline consumption of every route. By adopting the estimated gasoline consumption as the weight of every route, the weighted Round-Robin recommendation method for the set of taxis is proposed. Our experimental results on real-world taxi trajectories data set have shown that the proposed recommendation method effectively reduce the driving distance before carrying passengers, especially when the number of cabs becomes large. Meanwhile, the time-cost of our method is also lower than the existing methods. © 2012 Springer-Verlag.

关键词： Taxicabs

来源：评论

学校读者我要写书评

暂无评论

Exploring Various Features in Semantic Role lab.ling

Exploring Various Features in Semantic Role Labeling

引用

International Conference on Advanced Language processing and Web information technology (ALPIT)

作者： Hongling Wang Guodong Zhou Qiaoming Zhu Peide Qian Jiangsu Provincial Key Lab for Computer Information Processing TechnologySchool of Computer Science and Technology Soochow University Suzhou China 215006

This paper explores the contributions of various features in semantic role lab.ling. Moreover, an optimal set of features is selected using a greedy strategy. Finally, an effective headword-driven pruning algorithm is proposed to filter out irrelavant instances. Evaluation on the CoNLL'2005 SRL benchmark corpus shows that our method achieved comparable performance with the best-reported ones on a single automatic parse tree.

关键词： Training Classification algorithms Accuracy Pediatrics Support vector machines lab.ling System performance

来源：评论

学校读者我要写书评

暂无评论

Data distribution algorithm of high-speed intrusion detection system based on network processor

Data distribution algorithm of high-speed intrusion detectio...

引用

2nd International Conference on Semantics, Knowledge, and Grid, SKG 2006

作者： Xu, Cheng Yu, Fei Dai, Zhenghui Yue, Guangxue Li, Renfa School of Computer and Communication Hunan University Changsha 410082 China Provincial Key Laboratory of Computer Information Processing Technology Jiangsu Province Suzhou Jiangsu 2150063 China State Key Laboratory of Information Security Graduate School Chinese Academy of Sciences Beijing 100049 China College of Informationg Engineering JiaXing University JiaXing 314000 China

ISBN: (纸本)076952673X

Because the processing speed of intrusion detection system can hardly keep pace with the high-speed development of network, improving the speed of intrusion detection has been the problem starved for solve. By adopting the network processor, a distribution algorithm based on protocol analysis has been realized. By delivering the captured data package to each detect node according to protocol types and then accomplishing the detection for data package through the collab.ration of the detect nodes, the processing efficiency of the intrusion detection system has been improved as a whole. © 2006 IEEE.

关键词： Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

New Pruning Methods for Mining Minimal Functional Dependencies from Large-Scale Distributed Data

New Pruning Methods for Mining Minimal Functional Dependenci...

引用

International Conference on Advanced Cloud and Big Data (CBD)

作者： Feng Cheng Zhe Yang Information Processing Technology Provincial Key Laboratory for Computer Soochow University Suzhou Jiangsu China

Extracting minimal functional dependencies (MFDs) from relational databases is an import database analysis technique. With the advent of big data era, it is challenging to discover MFDs from big data, especially large-scale distributed data stored in many different sites. The key to discovering MFDs as fast as possible is pruning the useless candidate MFDs. And in most existed algorithms, it usually prunes candidate MFDs from top to bottom or from bottom to top. We present a new algorithms FastMFDs for discovering all MFDs from large-scale distributed data both from top to bottom and from bottom to top in parallel. We experimented our algorithm in real-life datasets, and our algorithm is more efficient and faster than the existed discovering algorithms.

关键词： Distributed databases Big Data Search problems Partitioning algorithms Relational databases

来源：评论

学校读者我要写书评

暂无评论

Construction of a Sequence- and Backbone-Dependent Rotamer Library by Hidden-Markov Model

Construction of a Sequence- and Backbone-Dependent Rotamer L...

引用

International Conference on Bioinformatics and Biomedical Engineering (ICBBE)

作者： Wei Wen Qiang Qiang Lü Peng Yang Lingyun Yang Jinzhen Wu Xu Huang School of Computer Science and Technology Soochow University Suzhou China Information Processing Technology Jiangsu Provincial Key Lab for Computer Suzhou China

Sidechain prediction is an important subproblem of protein design and structure prediction. Construction of rotamer library is the basis for protein sidechain prediction because it provides the basic searching space for prediction. However, the state-of-the-art rotamer libraries focus on the statistical information of individual amino acids, ignoring the direct affection of its adjacent amino acids. This article presents a sequence- and backbone-dependent rotamer library. Both the conformation information of adjacent amino acids and torsion angle of the current residue are taken into account to construct a sequence- and backbone-dependent library by HMM. Evaluation on all 13 free modeling targets of CASP8 based on our rotamer library is conducted. Comparing with side-chain prediction based on the state-of-the-art rotamer library, our library outperforms the sidechain prediction accuracy on all the test targets to a certain extent.

关键词： Libraries Proteins Spine Amino acids Bayesian methods Hidden Markov models Predictive models Space technology Accuracy Statistical analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：