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

Third International Conference on Cyberspace Technology (CCT 2015)

作者： Qingfeng Pan Xianghan Zheng Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou 350108 China College of Mathematics and Computer Science Fuzhou University 350108 China

ISBN: (纸本)9781510821873

Multi-constrained optimal routing problem and disjoint path selection are NP-hard problem. The conventional single-path and single constraint routing can not meet people's needs. The reliability of network data transmission and packet loss rate can be decreased when the route or the transmission fails. To solve the problems, we need to study the routing path selection strategies. This paper optimizes the routing path that meets the QoS constraints under the SDN pre planning routing, and proposes a routing mechanism that can solve problems in polynomial time. Firstly, the paper combined with Clustering and Gauss algorithm to simulate the network simulation, obtain the initial experimental data. It can reflect the network status more accurately. Secondly, simplify the multi-objectives based on the AHP, It reduces the complexity of the problem and meets QoS requirements. Finally, select the disjoint communication paths and backup paths with the heuristic algorithms in order to balance the load of network and improve the transmission reliability. The selection mechanism can improve the efficiency of data transmission, and the survival of network communication.

关键词： Analytic Hierarchy Process Disjoint Path Multi constraints Optimal Path QoS Routing

来源：评论

学校读者我要写书评

暂无评论

A MapReduce Optimization Method on Hadoop Cluster

A MapReduce Optimization Method on Hadoop Cluster

引用

International Conference on Industrial Informatics - computing Technology, intelligent Technology, Industrial information Integration

作者： Xiaodong Wu Faculty of Mathematics and Computer Science Quanzhou Normal University Fujian Provincial Key Laboratory of Data Intensive Computing Key Laboratory of Intelligent Computing and Information Processing Fujian Province University

ISBN: (纸本)9781467383134

The MapReduce parallel and distributed computing framework has been widely applied in both academia and industry. MapReduce applications are divided into two steps: Map and Reduce. Then, the input data is divided into splits, which can be concurrently processed, and the amount of the splits determines the number of map tasks. In this paper, we present a regression-based method to compute the number of Map tasks as well as Reduce tasks such that the performance of the MapReduce application can be improved. The regression analysis is used to predict the executing time of MapReduce applications. Experimental results show that the proposed optimization method can effectively reduce the execution time of the applications.

关键词： MapReduce Hadoop Optimization Polynomial Regression

来源：评论

学校读者我要写书评

暂无评论

Adaptive sparse recovery based on difference algorithm

引用

Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics 2015年第6期27卷 1047-1052页

作者： Zhang, Fengzhen Zhao, Ruizhen Cen, Yigang Hu, Shaohai Zhang, Yongdong Institute of Information Science Beijing Jiaotong University Beijing100044 China Key Laboratory of Advanced Information Science and Network Technology of Beijing Beijing100044 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China

To improve the disadvantages that iterative reconstruction algorithms of compressed sensing need priori knowledge of the sparsity of original signal or iterative threshold, an adaptive sparse recovery based on difference algorithm is proposed. When the sparsity of original signal is unknown, the proposed algorithm takes advantage of unbalance of correlation coefficient between the measurement matrix and residual. With those properties, the proposed algorithm can select the support set of the original signal, and approach the sparsity of the original signal. Simulation results show that the proposed algorithm obtains better recovery results under the same conditions. Especially in the lower sampling rate, the advantage is more obvious. ©, 2015, Institute of computing Technology. All right reserved.

关键词： Recovery

来源：评论

学校读者我要写书评

暂无评论

A Runtime Architecture Based Framework Managing Hybrid Clouds

A Runtime Architecture Based Framework Managing Hybrid Cloud...

引用

IEEE Annual International Computer Software and Applications Conference (COMPSAC)

作者： Xuee Zeng Xingtu Lan Xing Chen Wenzhong Guo College of Mathematics and Computer Science Fuzhou University Fuzhou China Fujian Provincial Key Laboratory of Networking Computing and Intelligent Information Processing

Cloud management becomes increasingly complex and brings high costs, especially with the advent of hybrid cloud. In a hybrid cloud, numerous resources like Virtual Machines (VMs) and Physical Machines in different clouds have to be managed together to make the whole hybrid cloud work cost-effectively. For controlling the management cost, in particular the manual management cost, many programs have been developed to take over manual management tasks or reduce their complexity and difficulty. These programs are usually hard-coded by languages like Java and C++, which bring enough capability and flexibility but also cause high programming effort and cost. As the architecture-based runtime model is causally connected with the corresponding running system automatically, constructing a hybrid cloud management system based on the architecture-based runtime models of clouds can benefit from the model-specific natures, and thus reduce the development workload. This paper proposes a runtime architecture based approach to developing the management programs in a simple but powerful enough manner. First of all, the manageability (such as APIs, configuration files and scripts) of different kinds of clouds, is abstracted as a runtime architecture based model of cloud software architecture, which can automatically and immediately propagate any observable runtime changes of the target platforms to the corresponding architecture models, and vice versa. Second, we provide a unified model of cloud software architecture, according to the domain knowledge of current cloud platforms, such as Cloud Stack, Open Stack and Eucalyptus. Third, the synchronization between the unified model and cloud runtime models is ensured through model transformation, thus, all the management tasks of the hybrid cloud, could be carried out through executing programs on the unified model, which decreases the complexity of use and management. The experiment on a real-world hybrid cloud demonstrates the feasibil

关键词： Computers Software Conferences

来源：评论

学校读者我要写书评

暂无评论

The Recognition of Maize seeds Based on Multi-scale Feature Fusion and Extreme Learning Machine

The Recognition of Maize seeds Based on Multi-scale Feature ...

引用

2015 3rd International Conference on Mechanical Engineering and intelligent Systems(ICMEIS 2015)

作者： Mingzhi Du Xiao Ke Mingke Zhou College of Mathematics and Computer Science Fuzhou University Fujian Provincial Key Laboratory of Networking Computing and Intelligent Information Processing (Fuzhou University)

In recognizing traditional crops seeds like maize seeds, we usually use electrophoresis assay method, fluorescence scanning method and chemical assay method. These methods are destructive methods. They take a long time to detect and are demanding of professional background knowledge and hardware conditions etc. What's more, these methods, based on BP neural network and support vector machine(SVM)while taking a long time to detect are less accurate in process of classification. In this paper, based on the computer vision technology, we proposed a new method for the classification of maize seeds, a method based on multi-scale feature fusion and extreme learning machine. First, we extract the multi-scale fusion feature of maize seeds. Second, based on extreme learning machine, we construct the classifier model of maize seed. Third, because of the window of image in the case of multi-scale detection has the problem of capturing the same object seed with many overlapping windows, we put forward a kind of window fusion algorithm to solve it. The simulation results show that: The method is able to identify the maize seeds accurately. Using this method the accuracy of classification of maize seeds can reached 97.66% and the error rate is less than 0.1%. Compared with the traditional methods, the method we proposed can improve the speed of detection and the accuracy of classification, and has no strict hardware requirements.

关键词： extreme learning machine feature fusion object recognition

来源：评论

学校读者我要写书评

暂无评论

XGRouter: high-quality global router in X-architecture with particle swarm optimization

引用

Frontiers of Computer Science 2015年

作者： Liu, Genggeng Guo, Wenzhong Li, Rongrong Niu, Yuzhen Chen, Guolong College of Mathematics and Computer Science Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China

This paper presents a high-quality very large scale integration (VLSI) global router in X-architecture, called XGRouter, that heavily relies on integer linear programming (ILP) techniques, partition strategy and particle swarm optimization (PSO). A new ILP formulation, which can achieve more uniform routing solution than other formulations and can be effectively solved by the proposed PSO is proposed. To effectively use the new ILP formulation, a partition strategy that decomposes a large-sized problem into some small-sized sub-problems is adopted and the routing region is extended progressively from the most congested region. In the post-processing stage of XGRouter, maze routing based on new routing edge cost is designed to further optimize the total wire length and mantain the congestion uniformity. To our best knowledge, XGRouter is the first work to use a concurrent algorithm to solve the global routing problem in X-architecture. Experimental results show that XGRouter can produce solutions of higher quality than other global routers. And, like several state-of-the-art global routers, XGRouter has no overflow. © 2015 Higher Education Press and Springer-Verlag Berlin Heidelberg

关键词： VLSI circuits

来源：评论

学校读者我要写书评

暂无评论

Noisy image super-resolution reconstruction based on sparse representation

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2015年第4期52卷 943-951页

作者： Dou, Nuo Zhao, Ruizhen Cen, Yigang Hu, Shaohai Zhang, Yongdong Institute of Information Science Beijing Jiaotong University Beijing100044 China Beijing Key Laboratory of Advanced Information Science and Network Technology Institute of Information Science Beijing Jiaotong University Beijing100044 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China

Denoising and super-resolution reconstruction are performed separately in traditional methods for noisy image super-resolution reconstruction, while in the noisy image super-resolution reconstruction method based on sparse representation and dictionary learning the two processes are compounded together. Since an image patch can be well represented as a sparse linear combination of elements from an appropriately chosen over-complete dictionary, two dictionaries are trained respectively from noisy low-and clean high-resolution image patches by enforcing the similarity of two sparse representations with respect to their own dictionary. Given a noisy low-resolution image, sparse representations of low-resolution patches via trained low-dictionary are computed, then the high-resolution image can be reconstructed from high-resolution patches with the help of the related low-resolution sparse representations and trained high-dictionary, after global optimization a clean high-resolution is obtained to accomplish the goal of image super-resolution and denosing simultaneously. The experiments show that zooming low-resolution image to a middle-resolution using locally adaptive zooming algorithm for extracting features can get a better reconstructed image than bicubic interpolation algorithm. By setting the parameter λ, we can obtain the best performance both in super-resolution and denoising with absolute advantages in image quality and visual effect, which demonstrates the validity and robustness of our algorithm. ©, 2015, Science Press. All right reserved.

关键词： Image denoising

来源：评论

学校读者我要写书评

暂无评论

An Improved Precoding of Approximative Matrix Inverse Computations Based on Norm Minimization Algorithm in Massive MIMO System

An Improved Precoding of Approximative Matrix Inverse Comput...

引用

2015 IEEE International Conference on Progress in Informatics and computing(PIC 2015)

作者： Hongliu Tu Yanjun Hu Yaohua Xu Fengrong Li Key laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Key Laboratory of Wireless Sensor Network & Communication Shanghai Institute of Microsystem and Information TechnologyChinese Academy of Sciences

In massive multiple-input multiple-output（MIMO） system, scaling up the antennas of base station（BS） has a clear benefit on sum rate and energy efficiency, but the signal processing complexity can be very high and many algorithms cannot be implemented in practice for high hardware cost. Approximati ve Matrix Inverse Computations（AMIC） algorithm is a kind of lowcomplexity precoding for large multiuser MIMO systems, but the Bite Error Rate（BER） performance is shown to be not better than the classical MMSE precoding. To improve the BER performance of AMIC algorithm, in this paper, we use norm minimization algorithm to change the coefficient of the precoding matrix to improve the BER performance of AMIC algorithm. It can verify that the proposed algorithm can achieve better BER performance than the AMIC algorithm by using only a limited number of Neumann series iterations, and keep lower complexity. The proposed scheme is a compromise solution between complexity and BER performance.

关键词： Massive MIMO linear precoding algorithm approximative matrix inverse norm minimization

来源：评论

学校读者我要写书评

暂无评论

Gaussian Mixture Model Based Interest Prediction In Social networks

Gaussian Mixture Model Based Interest Prediction In Social N...

引用

IEEE International Conference on Cloud computing Technology and Science (CloudCom)

作者： Dongyun An Xianghan Zheng Chunming Rong Tahar Kechadi ChongCheng Chen College of Mathematics and Computer Science Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou China Department of Electrical Engineering and Computer Science Stavanger Norway University College Dublin School of Computer Science and Informatics Ireland

In this paper, we investigate a typical clustering technology, namely, Gaussian mixture model (GMM)-based approach, for user interest prediction in social networks. The establishment of the model follows the following process: collect dataset from 4613 users and more than 16 million messages from Sina Weibo, obtain each user's interest eigenvalue sequence and establish GMM model to clustering users. In theory and experiment, this approach is feasible. The GMM-based approach considers the prediction accuracy and consuming time. A series of experiments are conducted to validate the feasibility and efficiency of the proposed solution and whether it can achieve a higher accuracy of prediction compared with other approaches, such as SVM and K-means. Further experiments show that GMM-based approach could produce higher prediction accuracy of 93.9%, thus leveraging computation complexity.

关键词： Predictive models Feature extraction Social network services Gaussian mixture model Eigenvalues and eigenfunctions Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Color PNG Image Authentication Scheme Based on Rehashing and Secret Sharing Method

引用

Journal of information Hiding and Multimedia Signal processing 2015年第3期6卷 523-533页

作者： Lyu, Wan-Li Chang, Chin-Chen Wang, Feng Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and TechnologyAnhui University Hefei230039 China Department of Information Engineering and Computer Science Feng Chia University 100 Wenhwa Rd Seatwen Taichung40724 Taiwan Department of Mathematics and Physics Fujian University of Technology Fuzhou Fujian350108 China

An authentication scheme that uses rehashing and secret sharing methods to verify the reality of a color image’s content is proposed in this paper. First, the proposed scheme uses Shamir’s secret sharing method to share image features. Second, the proposed scheme innovatively utilizes the rehashing method to overcome easy collisions of the random numbers to enhance the effectiveness against attacks. Third, the proposed method utilizes Portable network Graphics images to hide authentication messages. Using the rehashing method, the collisions take up little in address space, making the process suitable for processing authentication messages. The experimental results indicated that the proposed scheme had very low false acceptance and rejection ratios and verified that the rehashing method can be used in image authentication applications. © 2009 ISSN 2073-4212.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：