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

2013 IEEE Conference Anthology, ANTHOLOGY 2013

作者： Peng, Jianzhang Gu, Naijie Li, Yehua Xu, Zhang School of Computer Science and Technology University of Science and Technology of China Hefei China Anhui Province Key Laboratory of Computing and Communication Software USTC SICT Joint Laboratory of Network and Communication Hefei China

ISBN: (纸本)9781479916603

Linux 2.6 load balancing algorithm on scheduling domain supports CMP, CMT, SMP, NUMA architecture. For SMT, the algorithm try to assign the new process to the idlest CPU of the idlest core, and if the first CPU of a core is comparati vely idle, it tries to pull moderate amount of tasks from the busiest CPU of the core to balance the system workload periodically. Under certain circumstances, this strategy would cause the system to be more unbalanced. For the above defects, the algorithm can be adjusted in two ways. (1) The idlest CPU of the entire system should be selects for the new process;(2) the idlest CPU of a scheduling domain periodically can move tasks from the scheduling domain to itself. After applying this optimization, the system's performance achieved the highest increase of 8% in hackbench testing on an 8-core 32-thread XLR532 processor. © 2013 IEEE.

关键词： Linux

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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 Hybrid of the prefix algorithm and the q-hidden algorithm for generating single negative databases

A Hybrid of the prefix algorithm and the q-hidden algorithm ...

引用

IEEE Symposium on Computational Intelligence in Cyber Security

作者： Liu, Ran Luo, Wenjian Wang, Xufa 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 Hefei 230027 Anhui China

ISBN: (纸本)9781424499069

The negative database (NDB) is a complement of the corresponding database. The NDB could protect the privacy of the data, but it should be complete and hard-to-reverse. However, existent techniques cannot generate the complete and hard-to-reverse negative database. In this paper, a hybrid method is proposed to generate single negative databases. The proposed hybrid method includes two phases. Firstly, a complete negative database with a small size is generated by the transformation of the prefix algorithm. Secondly, a hard-to-reverse negative database, which is generated with the q-hidden method, is added into the small complete negative database. Therefore, the hybrid negative database is both complete and hard-to-reverse. Experiment results show that the NDB generated by the hybrid method is better than the NDB generated by the typical q-hidden method. Especially, the NDB generated by the q-hidden method can be reversed on average when the string length is 300. However, the NDB generated by the hybrid method cannot be reversed on average when the string length is 150. © 2011 IEEE.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Quantitative and qualitative forecasting applied to supply-chain inventory

Quantitative and qualitative forecasting applied to supply-c...

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Multi-layer network embedding on scc-based network with motif

引用

Digital communications and Networks 2024年第3期10卷 546-556页

作者： Lu Sun Xiaona Li Mingyue Zhang Liangtian Wan Yun Lin Xianpeng Wang Gang Xu Department of Communication Engineering Institute of Information Science TechnologyDalian Maritime UniversityDalian116026China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and TelecommunicationsChongqing400065China Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province DUT School of Software Technology&DUT-RU International School of Information Science and EngineeringDalian University of TechnologyDalian 116620China College of Information and Communication Engineering Harbin Engineering UniversityHarbin 150001China School of Information and Communication Engineering Hainan UniversityHaikou 570228China State Key Laboratory of Millimeter Waves School of Information Science and EngineeringSoutheast UniversityNanjing 210096China

Interconnection of all things challenges the traditional communication methods,and Semantic communication and computing(SCC)will become new *** is a challenging task to accurately detect,extract,and represent semantic information in the research of SCC-based *** previous research,researchers usually use convolution to extract the feature information of a graph and perform the corresponding task of node ***,the content of semantic information is quite *** graph convolutional neural networks provide an effective solution for node classification tasks,due to their limitations in representing multiple relational patterns and not recognizing and analyzing higher-order local structures,the extracted feature information is subject to varying degrees of ***,this paper extends from a single-layer topology network to a multi-layer heterogeneous topology *** Bidirectional Encoder Representations from Transformers(BERT)training word vector is introduced to extract the semantic features in the network,and the existing graph neural network is improved by combining the higher-order local feature module of the network model representation network.A multi-layer network embedding algorithm on SCC-based networks with motifs is proposed to complete the task of end-to-end node *** verify the effectiveness of the algorithm on a real multi-layer heterogeneous network.

关键词： Semantic communication and computing Multi-layer network Graph neural network Motif

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Implicit interpolation of time vector series

Implicit interpolation of time vector series

引用

2011 7th International Conference on Natural Computation, ICNC 2011

作者： Li, Dao-Lun Zha, Wen-Shu Lu, De-Tang Department of Modern Mechanics University of Science and Technology of China China Key Laboratory of Software in Computing and Communication of Anhui Province University of Science and Technology of China Hefei 230027 China

ISBN: (纸本)9781424499533

Time vector series abound in many fields, which are different from time series. Based on mapping and implicit function interpolation, the method of implicit interpolation over time vector series is developed and studied. Time vector series are mapped into a sequence of closed curves or surfaces, which are seen as the interpolation data set. Based on the interpolation data set, the implicit interpolation function is constructed and from which an isoline is drawn. The inverse mapping of the isoline is the prediction of vector series at the new time. Based on the well logging data an application is given to predict the unknown isotope logging data of year 2004 with the known data of year 2003 and 2005 which shows the performance of the method. © 2011 IEEE.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：