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

2010 2nd International Conference on MultiMedia and Information Technology, MMIT 2010

作者： Shao, Chenxi Wang, Lizhong Computer Science and Technology School of University of Science and Technology of China Hefei China Anhui Province Key Laboratory Software in Computing and Communication Hefei 230027 China MOE-Microsoft Key Laboratory Multimedia Computing and Communication University of Science and Technology of China Hefei China

ISBN: (纸本)9780769540085

In the process of supply chain (SC) management, time inventory management problem is extremely important. In terms of academic methods, quantitative methods are very popular as the researchers could calculate the inventory if they got the historic data of some SC. However, based on quantitative methods and the results cannot too be convincible. This paper considered a supply chain system includes several kinds of products. As to the historic suppliers' demand data of this SC system, firstly we applied a quantitative forecasting analysis method to it;secondly we made a qualitative analysis to improve the complex system's inventory management performance. According to the comparison between quantitative method and the method used in this paper, we find that the accuracy is more perfect. Not only the inventory cost is lower, also the forecasting accuracy is better. © 2010 IEEE.

关键词： Supply chain management

来源：评论

学校读者我要写书评

暂无评论

An adaptive strategy for updating the memory in evolutionary algorithms for dynamic optimization

An adaptive strategy for updating the memory in evolutionary...

引用

IEEE Symposium on Computational Intelligence in Dynamic and Uncertain Environments

作者： Zhu, Tao Luo, Wenjian Li, Zhifang Nature Inspired Computation and Applications Laboratory School of Computer Science and Technology University of Science and Technology of China Hefei 230027 Anhui China Anhui Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei 230027 China

ISBN: (纸本)9781424499311

The memory scheme is one of the most widely employed techniques in Evolutionary Algorithms for solving dynamic optimization problems. The updating strategy is a key concern for the memory scheme. Unfortunately, the existent memory updating strategies neglect the characteristics of the memory updating behaviors, and sometimes this could lead results against the original intention. In this paper, a novel updating strategy is proposed, which can adaptively update the memory according to the characteristics of the memory updating behaviors. Experiments are carried out in different kinds of dynamic environments, and the experimental results show that the proposed strategy is better than the traditional strategies. © 2011 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Three dimensional stratum modeling and a fast algorithm for arbitrary cutting based on half-edge structure

Three dimensional stratum modeling and a fast algorithm for ...

引用

2009 International Conference on Computational Intelligence and software engineering, CiSE 2009

作者： Xi, Liu Dong, Lanfang Lu, Detang Hefei China Anhui Province Key Lab of Software in Computing and Communication School of Computer Science and Technology USTC Hefei China Institute of Engineering and Science Software USTC Hefei China

ISBN: (纸本)9781424445073

The three dimensional stratum modeling provides important basis of analysis and policy-making in areas such as Geophysics, Petroleum, Minerals, Urban construction and so on. In this paper, we firstly propose a general flow of three dimensional stratum modeling, then research stratum partition algorithm and reconstruct the surface of three dimensional stratum model (3DSM), finally program the module of the simulation and visualization of 3DSM, and propose a fast algorithm for arbitrary cutting based on half-edge structure. The result shows that the algorithm performs real-time, and the reconstructed model of it is perfect. The algorithm has general applicability in entity cutting, it can be used in 3DSM, medical treatment, city planning and other similar areas. ©2009 IEEE.

关键词： Three dimensional computer graphics

来源：评论

学校读者我要写书评

暂无评论

Stochastic prefix-based fault tolerant source routing algorithm for network on chip

Stochastic prefix-based fault tolerant source routing algori...

引用

2012 International Conference on Computer and Information Science, ICCIS 2012 - A Conference of World engineering, Science and Technology Congress, ESTCON 2012

作者： Xu, Gengchun Ren, Kaixin Gu, Naijie Anhui Province Key Laboratory of Computing and Communication Software Hefei China USTC-SICT Joint Laboratory on Network and Communication Hefei China School of Computer Science and Technology University of Science and Technology of China Hefei China

ISBN: (纸本)9781467319386

In this paper, a novel fault-tolerant source routing algorithm for Network on Chip (NOC) called Stochastic Prefix-based Source Routing (SPSR) is proposed. Compared to non-source routing algorithms, it releases the intermediate node from complicated decision-making or routing table maintenance. Unlike the traditional source routing algorithms which use broadcast packets to record the YD of every intermediate node in Route Discovery, it predetermine prospective routes, which can greatly reduces the packets generated and forwarded in the Route Discovery phase, and therefore reduces the power consumption. The proposed routing algorithm is implemented on the open source simulator Nirgam [14], incorporating Orion [15] to estimate the power consumption. Experiment results show that the proposed algorithm can greatly reduce the power consumption in the route discovery and the latency of SPSR is comparable with that of the broadcasting mechanism. © 2012 IEEE.

关键词： Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

PR3D: Precise and realistic 3D face reconstruction from a single image

PR3D: Precise and realistic 3D face reconstruction from a si...

引用

作者： Huang, Zhangjin Wu, Xing University of Science and Technology of China Hefei China Anhui Province Key Laboratory of Software in Computing and Communication Hefei China Deqing Alpha Innovation Institute Huzhou China

Reconstructing the three-dimensional (3D) shape and texture of the face from a single image is a significant and challenging task in computer vision and graphics. In recent years, learning-based reconstruction methods have exhibited outstanding performance, but their effectiveness is severely constrained by the scarcity of available training data with 3D annotations. To address this issue, we present the PR3D (Precise and Realistic 3D face reconstruction) method, which consists of high-precision shape reconstruction based on semi-supervised learning and high-fidelity texture reconstruction based on StyleGAN2. In shape reconstruction, we use in-the-wild face images and 3D annotated datasets to train the auxiliary encoder and the identity encoder, encoding the input image into parameters of FLAME (a parametric 3D face model). Simultaneously, a novel semi-supervised hybrid landmark loss is designed to more effectively learn from in-the-wild face images and 3D annotated datasets. Furthermore, to meet the real-time requirements in practical applications, a lightweight shape reconstruction model called fast-PR3D is distilled through teacher–student learning. In texture reconstruction, we propose a texture extraction method based on face reenactment in StyleGAN2 style space, extracting texture from the source and reenacted face images to constitute a facial texture map. Extensive experiments have demonstrated the state-of-the-art performance of our method. © 2024 John Wiley & Sons Ltd.

关键词： Textures

来源：评论

学校读者我要写书评

暂无评论

A novel updating strategy for associative memory scheme in cyclic dynamic environments

A novel updating strategy for associative memory scheme in c...

引用

International Workshop on Advanced Computational Intelligence (IWACI)

作者： Cao, Yong Luo, Wenjian Nature Inspired Computation and Applications Laboratory School of Computer Science and Technology University of Science and Technology of China Hefei 230027 Anhui China Anhui Key Laboratory of Software in Computing and Communication University of Science and Technology of China Hefei 230027 Anhui China

ISBN: (纸本)9781424463343

Associative memory schemes have been developed for Evolutionary Algorithms (EAs) to solve Dynamic Optimization Problems (DOPs), and demonstrated powerful performance. In these schemes, how to update the memory could be important for their performance. However, little work has been done about the associative memory updating strategies. In this paper, a novel updating strategy is proposed for associative memory schemes. In this strategy, the memory point whose associated environmental information is most similar to the current environmental information is first picked out from the memory. Then, the selected memory individual is updated according to the fitness value, and the associated environmental information is updated according to the matching degree between environmental information and individuals. This updating strategy is embedded into a stateof-the-art algorithm, i.e. the MPBIL, and tested by experiments. Experimental results demonstrate that the proposed updating strategy is helpful for associative memory schemes to enhance their search ability in cyclic dynamic environments.

关键词： Associative processing

来源：评论

学校读者我要写书评

暂无评论

Cache locking optimization in java virtual machine

Cache locking optimization in java virtual machine

引用

2013 IEEE Conference Anthology, ANTHOLOGY 2013

作者： Lin, Chuanwen Gu, Naijie Cai, Songsong School of Computer Science and Technology University of Science and Technology of China Anhui Province Key Laboratory of Computing and Communication Software Hefei China Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781479916603

Cache plays an important role in multilevel storage system. It can greatly reduce the memory access latency. So the cache hit rate has a significant impact on the performance of the application. Many processors provide cache locking mechanism, which can lock the certain lines in cache. It enables an application to affect the cache replacement decisions under software control. This paper presents a novel method, which uses cache locking mechanism to reduce the run-time of java virtual machine (JVM). JVM often uses just-in-time compiler (JIT) to improve the performance. JIT compiles the method that has been invoked certain times, and then JVM executes the compiled method when invoking this method the next time. This paper analyzes the calling situation of the compiled method in JVM, and then proposes a heuristic approach to lock the compiled method in cache for an appropriate period. It can reduce cache miss rate when JVM executes the compiled method. The algorithm has been implemented in HotSpot based on Loongson-3A. Also, it can be implemented in other run-time systems. Experiment results show that the cache locking heuristic algorithm averagely reduces the cache miss rate by 8.5%, and improves the performance by 4% on the benchmark SPECjvm2008. © 2013 IEEE.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

A preliminary study on why using the nonself detector set for anomaly detection in artificial immune Systems

A preliminary study on why using the nonself detector set fo...

引用

2009 International Conference on Computational Intelligence and Security, CIS 2009

作者： Xu, Baoliang Luo, Wenjian Wang, Xufa Nature Inspired Computation and Applications Laboratory School of Computer Science and Technology University of Science and Technology of China Hefei 230027 Anhui China Anhui Key Laboratory of Software in Computing and Communication University of Science and Technology of China Hefei 230027 Anhui China

ISBN: (纸本)9780769539317

In artificial immune systems, the detectors in the nonself space are often adopted to detect anomaly changes, such as the negative selection algorithm and its improvements. Since the detectors in the self space can also be used to detect anomaly changes, a frequently asked question is which kind of detector sets is more efficient for a specific problem. In this paper, firstly, the advantages and disadvantages of the self detector set and the nonself detector set are briefly reviewed. Secondly, when the complete matching rule is adopted, the average time costs of employing the nonself detector set and the self detector set for anomaly detection are compared theoretically. Thirdly, simulated experiments are done, and experimental results demonstrate that the theoretical conclusion is essentially correct. © 2009 IEEE.

关键词： Immune system

来源：评论

学校读者我要写书评

暂无评论

IPRAR: A DFG-based approach to instruction clustering for multicluster VLIW DSP processor with SIMD structure

引用

Journal of Computational Information Systems 2014年第3期10卷 1257-1269页

作者： Yang, Yangzhao Gu, Naijie Zhao, Zeng Ren, Kaixin School of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Anhui Province Key Laboratory of Computing and Communication Software Hefei 230027 China USTC and Loongson Technology Associated Laboratory Institute of Advanced Technology University of Science and Technology of China Hefei 230027 China

Modern Very Long Instruction (VLIW) DSP can improve performance by using instruction-level parallelism (ILP) and obtain better parallelism through instruction clustering. The essence of clustering is resource allocation. Traditional clustering method assumes that one instruction can only be assigned to a certain cluster, which is inapplicable to the architecture with SIMD structure. To address this issue, this paper presents IPRAR, a novel instruction clustering algorithm for the features of SIMD structure based on DFG. Due to considering the features of SIMD structure, IPRAR can be implemented on BWDSP100 with satisfactory. Besides, IPRAR can make the load of cluster more balanced and minimize the intercluster communication overload. Finally, numerous experiment results show that the IPRAR has an average of 7-10% performance improvement compared to the traditional methods. © 2014 Binary Information Press.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Study of hybrid strategy for ambulatory ECG waveform clustering

Journal of Software

引用

Journal of software 2011年第7期6卷 1257-1264页

作者： Zheng, Gang Yu, Tian Laboratory of Biological signal and Intelligent Processing Tianjin University of Technology Tianjin China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin China School of Computer and Communication Engineering Tianjin University of Technology Tianjin China Laboratory of Biological signal and Intelligent Processing Tianjin University of Technology Tianjin China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin China

A hybrid strategy has been proposed to reduce the wrong clustering on Ambulatory ECG (electrocardiogram). Since Ambulatory ECG is usually composed by 24 hours data, the number of individual ECG waveform can reach to 100,000, the request for accurate clustering result is highly required. The proposed strategy adopted some intelligent algorithms to solve the above problem. It clusters ECG waveform sample (selected from Ambulatory ECG) synchronously by Max-Min distance clustering algorithm, K-means algorithm and Simulated annealing algorithm first. And then, it adopted all three outputs from the above three algorithms as input on Back Propagation Artificial Neural Network (BP ANN). In the end, we got more accurate clustering result from the output of ANN. For testing the results, data of MIT/BIH arrhythmia database were used for experiments. After the controlled trial on MIT/BIH data, it can be safely concluded that the clustering result achieved by improved strategy can got more accurate than that by the traditional clustering algorithm. An average accuracy ratio is about 94.6%, 1.6% higher than k-means algorithm averagely and 1.3% higher than Simulated Annealing algorithm averagely. © 2011 ACADEMY PUBLISHER.

关键词： Electrocardiograms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：