The sequence of facets and nodes has a direct influence on the efficiency of access to spherical triangle region quadtree. Based on the labeling schema by Lee, spatial curves both for facets and nodes are proposed and...The sequence of facets and nodes has a direct influence on the efficiency of access to spherical triangle region quadtree. Based on the labeling schema by Lee, spatial curves both for facets and nodes are proposed and the main algorithms for coordinate translation, node Lsequence generation and visiting nodes are presented. In particular,constant time algorithms for generating node Lsequence are advanced by using bit manipulation operations,which can be easily implemented with hardware. In L curve the distance between three nodes of a facet is mostly limited in a range of small value, thus making fast access possible. Though codes of sibling facets are continuous, the difference between codes of some cousins may occasionally be very large and makes the distance of a few facets also very large, thus greatly increasing the mean node distance and the total traversing distance. Therefore an m cluster of nodes is proposed as a basic storage unit fo n cluster, which should store eery shared node in each,and the distance between three nodes of a facet is limited to a controllagle scope.展开更多
Strong orthogonal arrays(SOAs) were recently introduced and studied as a class of spacefilling designs for computer experiments. To surely realize better space-filling properties, SOAs of strength three or higher are ...Strong orthogonal arrays(SOAs) were recently introduced and studied as a class of spacefilling designs for computer experiments. To surely realize better space-filling properties, SOAs of strength three or higher are desirable. In addition, orthogonality is also an important property for designs of computer experiments, because it guarantees that the estimates of the main effects are uncorrelated. This paper first provides a systematic study on the construction of(nearly) orthogonal strength-three SOAs with better space-filling properties. The newly proposed strength-three SOAs enjoy almost the same space-filling properties of strength-four SOAs, and can accommodate much more columns than the latter. Moreover, they are(nearly) orthogonal and flexible in run sizes. The construction methods are straightforward to implement, and their theoretical supports are well established. In addition to the theoretical results, many designs are tabulated for practical needs.展开更多
When carrying out calculations for turbulent flow simulation,one inevitably has to face the choice between accuracy and speed of calculations.In order to simultaneously obtain both a computationally efficient and more...When carrying out calculations for turbulent flow simulation,one inevitably has to face the choice between accuracy and speed of calculations.In order to simultaneously obtain both a computationally efficient and more accurate model,a surrogate model can be built on the basis of some fast special model and knowledge of previous calculations obtained by more accurate base models from various test bases or some results of serial calculations.The objective of this work is to construct a surrogate model which allows to improve the accuracy of turbulent calculations obtained by a special model on unstructured meshes.For this purpose,we use 1D Convolutional Neural Network(CNN)of the encoder-decoder architecture and reduce the problem to a single dimension by applying space-filling curves.Such an approach would have the benefit of being applicable to solutions obtained on unstructured meshes.In this work,a non-local approach is applied where entire flow fields obtained by the special and base models are used as input and ground truth output respectively.Spalart-Allmaras(SA)model and Near-wall Domain Decomposition(NDD)method for SA are taken as the base and special models respectively.The efficiency and accuracy of the obtained surrogate model are demonstrated in a case of supersonic flow over a compression corner with different values for angleαand Reynolds number Re.We conducted an investigation into interpolation and extrapolation by Re and also into interpolation byα.展开更多
Space-filling designs are widely used in computer experiments.They are frequently evaluated by the orthogonality and distance-related criteria.Rotating orthogonal arrays is an appealing approach to constructing orthog...Space-filling designs are widely used in computer experiments.They are frequently evaluated by the orthogonality and distance-related criteria.Rotating orthogonal arrays is an appealing approach to constructing orthogonal space-filling designs.An important issue that has been rarely addressed in the literature is the design selection for the initial orthogonal arrays.This paper studies the maximin L_(2)-distance properties of orthogonal designs generated by rotating two-level orthogonal arrays under three criteria.We provide theoretical justifications for the rotation method from a maximin distance perspective and further propose to select initial orthogonal arrays by the minimum G_(2)-aberration criterion.New infinite families of orthogonal or 3-orthogonal U-type designs,which also perform well under the maximin distance criterion,are obtained and tabulated.Examples are presented to show the effectiveness of the constructed designs for building statistical surrogate models.展开更多
The common characteristics of peer-to-peer （P2P） overlay networks and wireless multi-hop network, such as self-organization, decentralization, hop-by-hop message transmission mode and high degree of dynamicity, lead...The common characteristics of peer-to-peer （P2P） overlay networks and wireless multi-hop network, such as self-organization, decentralization, hop-by-hop message transmission mode and high degree of dynamicity, lead to research of operating wired P2P applications on wireless multi-hop networks. Wireless mesh network （WMN） as a relative static multi-hop wireless network which is extended from Ad-Hoc networks, has become one of the key technologies for providing increased network coverage of Internet infrastructures. This paper investigates the problem of enabling P2P file sharing in WMNs. A special chord algorithm--spiralchord is proposed to address the major problem in wireless file sharing system how to efficiently find resources currently available. Spiralchord put forward an identifier （ID） assignment technique based on spiral space-filling curve to integrate location-awareness with cross-layering. Location awareness aims at alleviating the mismatch of physical network topology and overlay network topology, and requires close-by IDs in logical ring of neighboring peers, while cross-layering aims at speeding up resource lookup operations, requires faraway IDs of neighboring peers. Spiralchord uses spiral curve to assign peers＇ IDs which meet the contradictory requirements of location-awareness and cross-layering. The simulation results show spiralchord is effective in reducing message overhead, and increasing lookup performance with respect to basic chord.展开更多
Phase-field modeling for three-dimensional foam structures is presented. The foam structure, which is generally applicable for porous material design, is geometrically approximated with a space-filling structure, and ...Phase-field modeling for three-dimensional foam structures is presented. The foam structure, which is generally applicable for porous material design, is geometrically approximated with a space-filling structure, and hence, the analysis of the space-filling structure was performed using the phase field model. An additional term was introduced to the conventional multi-phase field model to satisfy the volume constraint condition. Then, the equations were numerically solved using the finite difference method, and simulations were carried out for several nuclei settings. First, the nuclei were set on complete lattice points for a bcc or fcc arrangement, with a truncated hexagonal structure, which is known as a Kelvin cell, or a rhombic dodecahedron being obtained, respectively. Then, an irregularity was introduced in the initial nuclei arrangement. The results revealed that the truncated hexagonal structure was stable against a slight irregularity, whereas the rhombic polyhedral was destroyed by the instability. Finally, the nuclei were placed randomly, and the relaxation process of a certain cell was traced with the result that every cell leads to a convex polyhedron shape.展开更多
In a previous paper published in this journal, it was demonstrated that any bounded, closed interval of the real line can, except for a set of Lebesgue measure 0, be expressed as a union of c pairwise disjoint perfect...In a previous paper published in this journal, it was demonstrated that any bounded, closed interval of the real line can, except for a set of Lebesgue measure 0, be expressed as a union of c pairwise disjoint perfect sets, where c is the cardinality of the continuum. It turns out that the methodology presented there cannot be used to show that such an interval is actually decomposable into c nonoverlapping perfect sets without the exception of a set of Lebesgue measure 0. We shall show, utilizing a Hilbert-type space-filling curve, that such a decomposition is possible. Furthermore, we prove that, in fact, any interval, bounded or not, can be so expressed.展开更多
Scientific instruments and simulation programs are generating large amounts of multidimensional array data. Queries with value and dimension subsetting conditions are commonly used by scientists to find useful informa...Scientific instruments and simulation programs are generating large amounts of multidimensional array data. Queries with value and dimension subsetting conditions are commonly used by scientists to find useful information from big array data, and data storage and indexing methods play an important role in supporting queries on multidimensional array data efficiently. In this paper, we propose SwiftArray, a new storage layout with indexing techniques to accelerate queries with value and dimension subsetting conditions. In SwiftArray, the multidimensional array is divided into blocks and each block stores sorted values. Blocks are placed in the order of a Hilbert space-filling curve to improve data locality for dimension subsetting queries. We propose a 2-D-Bin method to build an index for the blocks＇ value ranges, which is an efficient way to avoid accessing unnecessary blocks for value subsetting queries. Our evaluations show that SwiftArray surpasses the NetCDF-4 format and FastBit indexing technique for queries on multidimensional arrays.展开更多
Non-convex optimization can be found in several smart manufacturing systems. This paper presents a short review on global optimization(GO) methods. We examine decomposition techniques and classify GO problems on the b...Non-convex optimization can be found in several smart manufacturing systems. This paper presents a short review on global optimization(GO) methods. We examine decomposition techniques and classify GO problems on the basis of objective function representation and decomposition techniques. We then explain Kolmogorov's superposition and its application in GO. Finally,we conclude the paper by exploring the importance of objective function representation in integrated artificial intelligence, optimization, and decision support systems in smart manufacturing and Industry 4.0.展开更多
Tool path generated by space-filling curve always turns frequently causing trembling to machine,reducing toollife and affecting workpiece quality. Length and generation time of tool paths are both relatively long. In ...Tool path generated by space-filling curve always turns frequently causing trembling to machine,reducing toollife and affecting workpiece quality. Length and generation time of tool paths are both relatively long. In order to solve these problems,a toolpath generation method of NC milling based on space-filling curve is proposed. First,T-spline surface is regarded as the modeling surface,the grid,which is based on the limited scallop-height,can be got in the parameter space,and the influence value of grid node is determined. Second,a box is defined and planned,and the tool paths are got preliminarily,which is based on minimal spanning tree; Finally,based on an improved chamfering algorithm,the whole tool paths are got. A simulation system is developed for computer simulation,and an experiment is carried out to verify the method. The results of simulation and experiment show that the method is effective and feasible,and length and time of the tool paths are reduced.展开更多
Digital image halftoning is a widely used technique. However, achieving high fidelity tone reproduction and structural preservation with low computational time cost remains a challenging problem. This paper presents a...Digital image halftoning is a widely used technique. However, achieving high fidelity tone reproduction and structural preservation with low computational time cost remains a challenging problem. This paper presents a highly parallel algorithm to boost real-time application of serial structure-preserving error diffusion. The contrast-aware halftoning approach is one such technique with superior structure preservation, but it offers only a limited opportunity for graphics processing unit(GPU) acceleration. Our method integrates contrast-aware halftoning into a new parallelizable error-diffusion halftoning framework. To eliminate visually disturbing artifacts resulting from parallelization, we propose a novel multiple quantization model and space-filling curve to maintain tone consistency, blue-noise property, and structure consistency. Our GPU implementation on a commodity personal computer achieves a real-time performance for a moderately sized image. We demonstrate the high quality and performance of the proposed approach with a variety of examples, and provide comparisons with state-of-the-art methods.展开更多
Experimental design is an effective statistical tool that is extensively applied in modern industry,engineering,and science.It is proved that experimental design is a powerful and efficient means to screen the relatio...Experimental design is an effective statistical tool that is extensively applied in modern industry,engineering,and science.It is proved that experimental design is a powerful and efficient means to screen the relationships between input factors and their responses,and to distinguish significant and unimportant factor effects.In many practical situations,experimenters are faced with large experiments having four-level factors.Even though there are several techniques provided to design such experiments,the challenge faced by the experimenters is still daunting.The practice has demonstrated that the existing techniques are highly time-consuming optimization procedures,satisfactory outcomes are not guaranteed,and non-mathematicians face a significant challenge in dealing with them.A new technique that can overcome these defects of the existing techniques is presented in this paper.The results demonstrated that the proposed technique outperformed the current techniques in terms of construction simplicity,computational efficiency and achieving satisfactory results capability.For non-mathematician experimenters,the new technique is much easier and simpler than the current techniques,as it allows them to design optimal large experiments without the recourse to optimization softwares.The optimality is discussed from four basic perspectives:maximizing the dissimilarity among experimental runs,maximizing the number of independent factors,minimizing the confounding among factors,and filling the experimental domain uniformly with as few gaps as possible.展开更多
Space-filling designs are widely used in various fields because of their nice space-filling properties.Uniform designs are one of space-filling designs,which desires the experimental points to scatter uniformly over t...Space-filling designs are widely used in various fields because of their nice space-filling properties.Uniform designs are one of space-filling designs,which desires the experimental points to scatter uniformly over the experimental area.For practical need,the construction and their properties of nine-level uniform designs are discussed via two code mappings in this paper.Firstly,the algorithm of constructing nine-level uniform designs is presented from an initial three-level design by the Type-I code mapping and tripling technique.Secondly,the algorithm of constructing nine-level uniform designs is presented from a three-level base design by the Type-II code mapping and generalized orthogonal arrays.Moreover,relative properties are discussed based on the two code mappings.Finally,some numerical examples are given out for supporting our theoretical results.展开更多
Many database applications currently deal with objects in a metric space.Examples of such objects include unstructured multimedia objects and points of interest(POIs)in a road network.The M-tree is a dynamic index str...Many database applications currently deal with objects in a metric space.Examples of such objects include unstructured multimedia objects and points of interest(POIs)in a road network.The M-tree is a dynamic index structure that facilitates an efficient search for objects in a metric space.Studies have been conducted on the bulk loading of large datasets in an M-tree.However,because previous algorithms involve excessive distance computations and disk accesses,they perform poorly in terms of their index construction and search capability.This study proposes two efficient M-tree bulk loading algorithms.Our algorithms minimize the number of distance computations and disk accesses using FastMap and a space-filling curve,thereby significantly improving the index construction and search performance.Our second algorithm is an extension of the first,and it incorporates a partitioning clustering technique and flexible node architecture to further improve the search performance.Through the use of various synthetic and real-world datasets,the experimental results demonstrated that our algorithms improved the index construction performance by up to three orders of magnitude and the search performance by up to 20.3 times over the previous algorithm.展开更多
A good visualisation method can greatly enhance human-machine collaboration in target contexts.To aid the optimal selection of visualisations for users,visualisation recommender systems have been developed to provide ...A good visualisation method can greatly enhance human-machine collaboration in target contexts.To aid the optimal selection of visualisations for users,visualisation recommender systems have been developed to provide the right visualisation method to the right person given specific contexts.A visualisation recommender system often relies on a user study to collect data and conduct analysis to provide personalised recommendations.However,a user study without employing an effective experimental design is typically expensive in terms of time and cost.In this work,we propose a prediction-oriented optimal design to determine the user-task allocation in the user study for the recommendation of visualisation methods.The proposed optimal design will not only encourage the learning of the similarity embedded in the recommendation responses(i.e.,users’preference),but also improve the modelling accuracy of the similarities captured by the covariates of contexts(i.e.,task attributes).A simulation study and a real-data case study are used to evaluate the proposed optimal design.展开更多
A space-filling curve in 2,3,or higher dimensions can be thought as a path of a continuously moving point.As its main goal is to preserve spatial proximity,this type of curves has been widely used in the design and im...A space-filling curve in 2,3,or higher dimensions can be thought as a path of a continuously moving point.As its main goal is to preserve spatial proximity,this type of curves has been widely used in the design and implementation of spatial data structures and nearest neighbor-finding techniques.This paper is essentially focused on the efficient representation of Digital Ele-vation Models(DEM) that entirely fit into the main memory.We propose a new hierarchical quadtree-like data structure to be built over domains of unrestricted size,and a representation of a quadtree and a binary triangles tree by means of the Hilbert and the Sierpinski space-filling curves,respectively,taking into account the hierarchical nature and the clustering properties of this kind of curves.Some triangulation schemes are described for the space-filling-curves-based approaches to efficiently visualize multiresolu-tion surfaces.展开更多
In this paper, two algorithms are presented for generating two code scan lists of an N dimensional Hilbert cell, and a formal proof of the backward encoding algorithm is given. On the basis of the self similarity prop...In this paper, two algorithms are presented for generating two code scan lists of an N dimensional Hilbert cell, and a formal proof of the backward encoding algorithm is given. On the basis of the self similarity properties of a Hilbert curve, this paper gives a novel algorithm for generating a static evolvement rule table through analyzing a Hilbert cell. By looking up the static evolvement rule table, the N dimensional Hilbert mappings are efficiently implemented.展开更多
文摘The sequence of facets and nodes has a direct influence on the efficiency of access to spherical triangle region quadtree. Based on the labeling schema by Lee, spatial curves both for facets and nodes are proposed and the main algorithms for coordinate translation, node Lsequence generation and visiting nodes are presented. In particular,constant time algorithms for generating node Lsequence are advanced by using bit manipulation operations,which can be easily implemented with hardware. In L curve the distance between three nodes of a facet is mostly limited in a range of small value, thus making fast access possible. Though codes of sibling facets are continuous, the difference between codes of some cousins may occasionally be very large and makes the distance of a few facets also very large, thus greatly increasing the mean node distance and the total traversing distance. Therefore an m cluster of nodes is proposed as a basic storage unit fo n cluster, which should store eery shared node in each,and the distance between three nodes of a facet is limited to a controllagle scope.
基金supported by the National Natural Science Foundation of China under Grant Nos. 12131001and 12226343the MOE Project of Key Research Institute of Humanities and Social Sciences under Grant No.22JJD110001the National Ten Thousand Talents Program of China。
文摘Strong orthogonal arrays(SOAs) were recently introduced and studied as a class of spacefilling designs for computer experiments. To surely realize better space-filling properties, SOAs of strength three or higher are desirable. In addition, orthogonality is also an important property for designs of computer experiments, because it guarantees that the estimates of the main effects are uncorrelated. This paper first provides a systematic study on the construction of(nearly) orthogonal strength-three SOAs with better space-filling properties. The newly proposed strength-three SOAs enjoy almost the same space-filling properties of strength-four SOAs, and can accommodate much more columns than the latter. Moreover, they are(nearly) orthogonal and flexible in run sizes. The construction methods are straightforward to implement, and their theoretical supports are well established. In addition to the theoretical results, many designs are tabulated for practical needs.
文摘When carrying out calculations for turbulent flow simulation,one inevitably has to face the choice between accuracy and speed of calculations.In order to simultaneously obtain both a computationally efficient and more accurate model,a surrogate model can be built on the basis of some fast special model and knowledge of previous calculations obtained by more accurate base models from various test bases or some results of serial calculations.The objective of this work is to construct a surrogate model which allows to improve the accuracy of turbulent calculations obtained by a special model on unstructured meshes.For this purpose,we use 1D Convolutional Neural Network(CNN)of the encoder-decoder architecture and reduce the problem to a single dimension by applying space-filling curves.Such an approach would have the benefit of being applicable to solutions obtained on unstructured meshes.In this work,a non-local approach is applied where entire flow fields obtained by the special and base models are used as input and ground truth output respectively.Spalart-Allmaras(SA)model and Near-wall Domain Decomposition(NDD)method for SA are taken as the base and special models respectively.The efficiency and accuracy of the obtained surrogate model are demonstrated in a case of supersonic flow over a compression corner with different values for angleαand Reynolds number Re.We conducted an investigation into interpolation and extrapolation by Re and also into interpolation byα.
基金supported by National Natural Science Foundation of China(Grant Nos.11901199 and 71931004),supported by National Natural Science Foundation of China(Grant Nos.11971098 and 11471069)the Open Research Fund of Key Laboratory for Applied Statistics of Ministry of Education,Northeast Normal University(Grant No.130028906)+1 种基金Shanghai Chenguang Program(Grant No.19CG26)National Key R&D Program of China(Grant No.2020YFA0714102)。
文摘Space-filling designs are widely used in computer experiments.They are frequently evaluated by the orthogonality and distance-related criteria.Rotating orthogonal arrays is an appealing approach to constructing orthogonal space-filling designs.An important issue that has been rarely addressed in the literature is the design selection for the initial orthogonal arrays.This paper studies the maximin L_(2)-distance properties of orthogonal designs generated by rotating two-level orthogonal arrays under three criteria.We provide theoretical justifications for the rotation method from a maximin distance perspective and further propose to select initial orthogonal arrays by the minimum G_(2)-aberration criterion.New infinite families of orthogonal or 3-orthogonal U-type designs,which also perform well under the maximin distance criterion,are obtained and tabulated.Examples are presented to show the effectiveness of the constructed designs for building statistical surrogate models.
基金supported by the Longitudinal Scientific Research of Wuhan University of Technology of China (201109YB01)
文摘The common characteristics of peer-to-peer （P2P） overlay networks and wireless multi-hop network, such as self-organization, decentralization, hop-by-hop message transmission mode and high degree of dynamicity, lead to research of operating wired P2P applications on wireless multi-hop networks. Wireless mesh network （WMN） as a relative static multi-hop wireless network which is extended from Ad-Hoc networks, has become one of the key technologies for providing increased network coverage of Internet infrastructures. This paper investigates the problem of enabling P2P file sharing in WMNs. A special chord algorithm--spiralchord is proposed to address the major problem in wireless file sharing system how to efficiently find resources currently available. Spiralchord put forward an identifier （ID） assignment technique based on spiral space-filling curve to integrate location-awareness with cross-layering. Location awareness aims at alleviating the mismatch of physical network topology and overlay network topology, and requires close-by IDs in logical ring of neighboring peers, while cross-layering aims at speeding up resource lookup operations, requires faraway IDs of neighboring peers. Spiralchord uses spiral curve to assign peers＇ IDs which meet the contradictory requirements of location-awareness and cross-layering. The simulation results show spiralchord is effective in reducing message overhead, and increasing lookup performance with respect to basic chord.
文摘Phase-field modeling for three-dimensional foam structures is presented. The foam structure, which is generally applicable for porous material design, is geometrically approximated with a space-filling structure, and hence, the analysis of the space-filling structure was performed using the phase field model. An additional term was introduced to the conventional multi-phase field model to satisfy the volume constraint condition. Then, the equations were numerically solved using the finite difference method, and simulations were carried out for several nuclei settings. First, the nuclei were set on complete lattice points for a bcc or fcc arrangement, with a truncated hexagonal structure, which is known as a Kelvin cell, or a rhombic dodecahedron being obtained, respectively. Then, an irregularity was introduced in the initial nuclei arrangement. The results revealed that the truncated hexagonal structure was stable against a slight irregularity, whereas the rhombic polyhedral was destroyed by the instability. Finally, the nuclei were placed randomly, and the relaxation process of a certain cell was traced with the result that every cell leads to a convex polyhedron shape.
文摘In a previous paper published in this journal, it was demonstrated that any bounded, closed interval of the real line can, except for a set of Lebesgue measure 0, be expressed as a union of c pairwise disjoint perfect sets, where c is the cardinality of the continuum. It turns out that the methodology presented there cannot be used to show that such an interval is actually decomposable into c nonoverlapping perfect sets without the exception of a set of Lebesgue measure 0. We shall show, utilizing a Hilbert-type space-filling curve, that such a decomposition is possible. Furthermore, we prove that, in fact, any interval, bounded or not, can be so expressed.
基金supported in part by the Natural Science Foundation of China (No. 41375102)the National Key Basic Research and Development (973) Program of China (No. 2014CB347800)the National HighTech Research and Development Program (863) of China (No. 2011AA01A203)
文摘Scientific instruments and simulation programs are generating large amounts of multidimensional array data. Queries with value and dimension subsetting conditions are commonly used by scientists to find useful information from big array data, and data storage and indexing methods play an important role in supporting queries on multidimensional array data efficiently. In this paper, we propose SwiftArray, a new storage layout with indexing techniques to accelerate queries with value and dimension subsetting conditions. In SwiftArray, the multidimensional array is divided into blocks and each block stores sorted values. Blocks are placed in the order of a Hilbert space-filling curve to improve data locality for dimension subsetting queries. We propose a 2-D-Bin method to build an index for the blocks＇ value ranges, which is an efficient way to avoid accessing unnecessary blocks for value subsetting queries. Our evaluations show that SwiftArray surpasses the NetCDF-4 format and FastBit indexing technique for queries on multidimensional arrays.
文摘Non-convex optimization can be found in several smart manufacturing systems. This paper presents a short review on global optimization(GO) methods. We examine decomposition techniques and classify GO problems on the basis of objective function representation and decomposition techniques. We then explain Kolmogorov's superposition and its application in GO. Finally,we conclude the paper by exploring the importance of objective function representation in integrated artificial intelligence, optimization, and decision support systems in smart manufacturing and Industry 4.0.
基金Supported by the National Natural Science Foundation of China(No.51575143)
文摘Tool path generated by space-filling curve always turns frequently causing trembling to machine,reducing toollife and affecting workpiece quality. Length and generation time of tool paths are both relatively long. In order to solve these problems,a toolpath generation method of NC milling based on space-filling curve is proposed. First,T-spline surface is regarded as the modeling surface,the grid,which is based on the limited scallop-height,can be got in the parameter space,and the influence value of grid node is determined. Second,a box is defined and planned,and the tool paths are got preliminarily,which is based on minimal spanning tree; Finally,based on an improved chamfering algorithm,the whole tool paths are got. A simulation system is developed for computer simulation,and an experiment is carried out to verify the method. The results of simulation and experiment show that the method is effective and feasible,and length and time of the tool paths are reduced.
基金Project supported by the National Key Technology R&D Program of China(No.2012BAH35B03)the National High-Tech R&D Program of China(No.2012AA12090)+1 种基金the National Natural Science Foundation of China(Nos.61232012 and 81172124)the Zhejiang Provincial Natural Science Foundation(No.LY13F020002)
文摘Digital image halftoning is a widely used technique. However, achieving high fidelity tone reproduction and structural preservation with low computational time cost remains a challenging problem. This paper presents a highly parallel algorithm to boost real-time application of serial structure-preserving error diffusion. The contrast-aware halftoning approach is one such technique with superior structure preservation, but it offers only a limited opportunity for graphics processing unit(GPU) acceleration. Our method integrates contrast-aware halftoning into a new parallelizable error-diffusion halftoning framework. To eliminate visually disturbing artifacts resulting from parallelization, we propose a novel multiple quantization model and space-filling curve to maintain tone consistency, blue-noise property, and structure consistency. Our GPU implementation on a commodity personal computer achieves a real-time performance for a moderately sized image. We demonstrate the high quality and performance of the proposed approach with a variety of examples, and provide comparisons with state-of-the-art methods.
基金partially supported by the UIC Grants(Nos.R201810,R201912 and R202010)the Zhuhai Premier Discipline Grant.
文摘Experimental design is an effective statistical tool that is extensively applied in modern industry,engineering,and science.It is proved that experimental design is a powerful and efficient means to screen the relationships between input factors and their responses,and to distinguish significant and unimportant factor effects.In many practical situations,experimenters are faced with large experiments having four-level factors.Even though there are several techniques provided to design such experiments,the challenge faced by the experimenters is still daunting.The practice has demonstrated that the existing techniques are highly time-consuming optimization procedures,satisfactory outcomes are not guaranteed,and non-mathematicians face a significant challenge in dealing with them.A new technique that can overcome these defects of the existing techniques is presented in this paper.The results demonstrated that the proposed technique outperformed the current techniques in terms of construction simplicity,computational efficiency and achieving satisfactory results capability.For non-mathematician experimenters,the new technique is much easier and simpler than the current techniques,as it allows them to design optimal large experiments without the recourse to optimization softwares.The optimality is discussed from four basic perspectives:maximizing the dissimilarity among experimental runs,maximizing the number of independent factors,minimizing the confounding among factors,and filling the experimental domain uniformly with as few gaps as possible.
基金supported by the National Natural Science Foundation of China(Nos.12161040,119610271,1701213,11871237)Natural Science Foundation of Hunan Province(Nos.2020JJ4497,2021JJ30550)+2 种基金Scientific Research Plan Item of Hunan Provincial Department of Education(No.19A403)Graduate Scientific Research Innovation Item of Hunan Province(No.CX20211504)the Scientific Research Item of Jishou University(No.Jdy20057)。
文摘Space-filling designs are widely used in various fields because of their nice space-filling properties.Uniform designs are one of space-filling designs,which desires the experimental points to scatter uniformly over the experimental area.For practical need,the construction and their properties of nine-level uniform designs are discussed via two code mappings in this paper.Firstly,the algorithm of constructing nine-level uniform designs is presented from an initial three-level design by the Type-I code mapping and tripling technique.Secondly,the algorithm of constructing nine-level uniform designs is presented from a three-level base design by the Type-II code mapping and generalized orthogonal arrays.Moreover,relative properties are discussed based on the two code mappings.Finally,some numerical examples are given out for supporting our theoretical results.
基金the National Research Foundation of Korea(NRF,www.nrf.re.kr)grant funded by the Korean government(MSIT,www.msit.go.kr)(No.2018R1A2B6009188)(received by W.-K.Loh).
文摘Many database applications currently deal with objects in a metric space.Examples of such objects include unstructured multimedia objects and points of interest(POIs)in a road network.The M-tree is a dynamic index structure that facilitates an efficient search for objects in a metric space.Studies have been conducted on the bulk loading of large datasets in an M-tree.However,because previous algorithms involve excessive distance computations and disk accesses,they perform poorly in terms of their index construction and search capability.This study proposes two efficient M-tree bulk loading algorithms.Our algorithms minimize the number of distance computations and disk accesses using FastMap and a space-filling curve,thereby significantly improving the index construction and search performance.Our second algorithm is an extension of the first,and it incorporates a partitioning clustering technique and flexible node architecture to further improve the search performance.Through the use of various synthetic and real-world datasets,the experimental results demonstrated that our algorithms improved the index construction performance by up to three orders of magnitude and the search performance by up to 20.3 times over the previous algorithm.
文摘A good visualisation method can greatly enhance human-machine collaboration in target contexts.To aid the optimal selection of visualisations for users,visualisation recommender systems have been developed to provide the right visualisation method to the right person given specific contexts.A visualisation recommender system often relies on a user study to collect data and conduct analysis to provide personalised recommendations.However,a user study without employing an effective experimental design is typically expensive in terms of time and cost.In this work,we propose a prediction-oriented optimal design to determine the user-task allocation in the user study for the recommendation of visualisation methods.The proposed optimal design will not only encourage the learning of the similarity embedded in the recommendation responses(i.e.,users’preference),but also improve the modelling accuracy of the similarities captured by the covariates of contexts(i.e.,task attributes).A simulation study and a real-data case study are used to evaluate the proposed optimal design.
基金Supported by the GeneSIG Project, University of Informatics Sciences (UCI), Havana, Cuba
文摘A space-filling curve in 2,3,or higher dimensions can be thought as a path of a continuously moving point.As its main goal is to preserve spatial proximity,this type of curves has been widely used in the design and implementation of spatial data structures and nearest neighbor-finding techniques.This paper is essentially focused on the efficient representation of Digital Ele-vation Models(DEM) that entirely fit into the main memory.We propose a new hierarchical quadtree-like data structure to be built over domains of unrestricted size,and a representation of a quadtree and a binary triangles tree by means of the Hilbert and the Sierpinski space-filling curves,respectively,taking into account the hierarchical nature and the clustering properties of this kind of curves.Some triangulation schemes are described for the space-filling-curves-based approaches to efficiently visualize multiresolu-tion surfaces.
文摘In this paper, two algorithms are presented for generating two code scan lists of an N dimensional Hilbert cell, and a formal proof of the backward encoding algorithm is given. On the basis of the self similarity properties of a Hilbert curve, this paper gives a novel algorithm for generating a static evolvement rule table through analyzing a Hilbert cell. By looking up the static evolvement rule table, the N dimensional Hilbert mappings are efficiently implemented.
