This article describes three algorithms for distance field generation on triangulated model: brute force algorithm, single-threaded algorithm based on spatial partition and multi-threaded algorithm based on spatial pa...This article describes three algorithms for distance field generation on triangulated model: brute force algorithm, single-threaded algorithm based on spatial partition and multi-threaded algorithm based on spatial partition. Spatial partition algorithm use equidistant network divide the bounding box into equal-sized cubes, calculates the maximum and minimum distances between the sample point and each of the small cubes,taking the minimum value from the maximum distance as the minimum distance from the sample point to the model named d1, comparing d1 with the distance from sample point to every little cube's minimum distance d2, if d1 <d2, the sample point's distance to all triangles inside this cube are greater than d1, skip this cube, otherwise, calculated the distance from the point to all the triangles intersect with the cube, then alternative d1 with the minimum value, circulate all small cubes intersect with the model. Comparing the calculation results, it can be seen that the algorithm about the multi-threaded distance field relative to the other two algorithms in computational speed is greatly improved especially for complex models.展开更多
Considering the defects of conventional optimization methods, a novel optimization algorithm is introduced in this paper. Target space partitioning method is used in this algorithm to solve multi-objective optimizatio...Considering the defects of conventional optimization methods, a novel optimization algorithm is introduced in this paper. Target space partitioning method is used in this algorithm to solve multi-objective optimization problem, thus achieve the coherent solution which can meet the requirements of all target functions, and improve the population's overall evolution level. The algorithm which guarantees diversity preservation and fast convergence to the Pareto set is applied to structural optimization problems. The empirical analysis supports the algorithm and gives an example with program.展开更多
Circuit partitioning plays a crucial role in very large-scale integrated circuit (VLSI) physical design automation. With current trends, partitioning with multiple objectives which includes cutsize, area, delay, and p...Circuit partitioning plays a crucial role in very large-scale integrated circuit (VLSI) physical design automation. With current trends, partitioning with multiple objectives which includes cutsize, area, delay, and power obtains much concentration. In this paper, a multi-objective greedy randomized adaptive search procedure (GRASP) is presented for simultaneous cutsize and circuit delay minimization. Each objective is assigned a preference or weight to direct the search procedure and generate a variety of efficient solutions by changing the preference. To get a good initial partition with minimal cutsize and circuit delay, the gain of each module in a circuit is computed by considering both signal nets and circuit delay. The performance of the proposed algorithm is evaluated on a standard set of partitioning benchmark. The experimental results show that the proposed algorithm can generate a set of Pareto optimal solutions and is efficient for tackling multi-objective circuit partitioning.展开更多
We show a scheme of preparing multipartite W type of maximally entangled states among many atomic ensembles with the generation time increasing with the party number only polynomially. The scheme is based on laser man...We show a scheme of preparing multipartite W type of maximally entangled states among many atomic ensembles with the generation time increasing with the party number only polynomially. The scheme is based on laser manipulation of atomic ensembles and single-photon detection, and fits well the status of the current experimental technology. We also show one of the applications of this kind of W state, demonstrating Bell theorem without inequalities.展开更多
针对多核处理器性能优化问题,文中深入研究多核处理器上共享Cache的管理策略,提出了基于缓存时间公平性与吞吐率的共享Cache划分算法MT-FTP(Memory Time based Fair and Throughput Partitioning)。以公平性和吞吐率两个评价性指标建立...针对多核处理器性能优化问题,文中深入研究多核处理器上共享Cache的管理策略,提出了基于缓存时间公平性与吞吐率的共享Cache划分算法MT-FTP(Memory Time based Fair and Throughput Partitioning)。以公平性和吞吐率两个评价性指标建立数学模型,并分析了算法的划分流程。仿真实验结果表明,MT-FTP算法在系统吞吐率方面表现较好,其平均IPC(Instructions Per Cycles)值比UCP(Use Case Point)算法高1.3%,比LRU(Least Recently Used)算法高11.6%。MT-FTP算法对应的系统平均公平性比LRU算法的系统平均公平性高17%,比UCP算法的平均公平性高16.5%。该算法实现了共享Cache划分公平性并兼顾了系统的吞吐率。展开更多
文摘This article describes three algorithms for distance field generation on triangulated model: brute force algorithm, single-threaded algorithm based on spatial partition and multi-threaded algorithm based on spatial partition. Spatial partition algorithm use equidistant network divide the bounding box into equal-sized cubes, calculates the maximum and minimum distances between the sample point and each of the small cubes,taking the minimum value from the maximum distance as the minimum distance from the sample point to the model named d1, comparing d1 with the distance from sample point to every little cube's minimum distance d2, if d1 <d2, the sample point's distance to all triangles inside this cube are greater than d1, skip this cube, otherwise, calculated the distance from the point to all the triangles intersect with the cube, then alternative d1 with the minimum value, circulate all small cubes intersect with the model. Comparing the calculation results, it can be seen that the algorithm about the multi-threaded distance field relative to the other two algorithms in computational speed is greatly improved especially for complex models.
基金National Natural Science Foundations of China (No. 60970004, No. 60743010)Natural Science Foundation of ShandongProvince, China (No. Z2008G02)
文摘Considering the defects of conventional optimization methods, a novel optimization algorithm is introduced in this paper. Target space partitioning method is used in this algorithm to solve multi-objective optimization problem, thus achieve the coherent solution which can meet the requirements of all target functions, and improve the population's overall evolution level. The algorithm which guarantees diversity preservation and fast convergence to the Pareto set is applied to structural optimization problems. The empirical analysis supports the algorithm and gives an example with program.
基金National Natural Science Foudation of China (No. 61070020 )Research Foundation for Doctoral Program of Ministry of Education,China (No. 20093514110004)Foundations of Education Department of Fujian Province,China (No. JA10284,No. JB07283)
文摘Circuit partitioning plays a crucial role in very large-scale integrated circuit (VLSI) physical design automation. With current trends, partitioning with multiple objectives which includes cutsize, area, delay, and power obtains much concentration. In this paper, a multi-objective greedy randomized adaptive search procedure (GRASP) is presented for simultaneous cutsize and circuit delay minimization. Each objective is assigned a preference or weight to direct the search procedure and generate a variety of efficient solutions by changing the preference. To get a good initial partition with minimal cutsize and circuit delay, the gain of each module in a circuit is computed by considering both signal nets and circuit delay. The performance of the proposed algorithm is evaluated on a standard set of partitioning benchmark. The experimental results show that the proposed algorithm can generate a set of Pareto optimal solutions and is efficient for tackling multi-objective circuit partitioning.
基金supported by the National Natural Science Foundation of China(Grant Nos.11174052 and 11474049)the China Advanced Science and Technology Innovation Fund
文摘We show a scheme of preparing multipartite W type of maximally entangled states among many atomic ensembles with the generation time increasing with the party number only polynomially. The scheme is based on laser manipulation of atomic ensembles and single-photon detection, and fits well the status of the current experimental technology. We also show one of the applications of this kind of W state, demonstrating Bell theorem without inequalities.
文摘针对多核处理器性能优化问题,文中深入研究多核处理器上共享Cache的管理策略,提出了基于缓存时间公平性与吞吐率的共享Cache划分算法MT-FTP(Memory Time based Fair and Throughput Partitioning)。以公平性和吞吐率两个评价性指标建立数学模型,并分析了算法的划分流程。仿真实验结果表明,MT-FTP算法在系统吞吐率方面表现较好,其平均IPC(Instructions Per Cycles)值比UCP(Use Case Point)算法高1.3%,比LRU(Least Recently Used)算法高11.6%。MT-FTP算法对应的系统平均公平性比LRU算法的系统平均公平性高17%,比UCP算法的平均公平性高16.5%。该算法实现了共享Cache划分公平性并兼顾了系统的吞吐率。
