The NaYF4：yb3＋,Tb3＋ （Xyb： 0.20, XTb： 0.04） materials were prepared using the co-precipitation method, lne as-preparea material was washed either with or without water in addition to ethanol and thereafter annea...The NaYF4：yb3＋,Tb3＋ （Xyb： 0.20, XTb： 0.04） materials were prepared using the co-precipitation method, lne as-preparea material was washed either with or without water in addition to ethanol and thereafter annealed for 5 h at 500℃. This resulted in materials with moderate or very high up-conversion luminescence intensity, respectively. The structural study carried out with X-ray powder diffraction revealed microstrains in the rare earth （R） sublattice that were relaxed for the material with very high up-conversion intensity thus decreasing energy losses. The local structural details were investigated with R LⅢ and Y K edge ex- tended X-ray absorption fine structure （EXAFS） using synchrotron radiation. Around 10 tool.% of the Yb3＋ ions were found to occupy the Na site in the material with very high up-conversion intensity. These Yb species formed clusters with the Tb3＋ ions occupying the regular Na/R sites. Such clustering enhanced the energy transfer between Yb3＋ and Tb3＋ thus intensifying the up-conversion emission.展开更多
The identification between chaotic systems and stochastic processes is not easy since they have numerous similarities. In this study, we propose a novel approach to distinguish between chaotic systems and stochastic p...The identification between chaotic systems and stochastic processes is not easy since they have numerous similarities. In this study, we propose a novel approach to distinguish between chaotic systems and stochastic processes based on the component reordering procedure and the visibility graph algorithm. It is found that time series and their reordered components will show diverse characteristics in the ＇visibility domain＇. For chaotic series, there are huge differences between the degree distribution obtained from the original series and that obtained from the corresponding reordered component. For correlated stochastic series, there are only small differences between the two degree distributions. For uncorrelated stochastic series, there are slight differences between them. Based on this discovery, the well-known Kullback Leible divergence is used to quantify the difference between the two degree distributions and to distinguish between chaotic systems, correlated and uncorrelated stochastic processes. Moreover, one chaotic map, three chaotic systems and three different stochastic processes are utilized to illustrate the feasibility and effectiveness of the proposed method. Numerical results show that the proposed method is not only effective to distinguish between chaotic systems, correlated and uncorrelated stochastic processes, but also easy to operate.展开更多
Lexicalized reordering models are very important components of phrasebased translation systems.By examining the reordering relationships between adjacent phrases,conventional methods learn these models from the word a...Lexicalized reordering models are very important components of phrasebased translation systems.By examining the reordering relationships between adjacent phrases,conventional methods learn these models from the word aligned bilingual corpus,while ignoring the effect of the number of adjacent bilingual phrases.In this paper,we propose a method to take the number of adjacent phrases into account for better estimation of reordering models.Instead of just checking whether there is one phrase adjacent to a given phrase,our method firstly uses a compact structure named reordering graph to represent all phrase segmentations of a parallel sentence,then the effect of the adjacent phrase number can be quantified in a forward-backward fashion,and finally incorporated into the estimation of reordering models.Experimental results on the NIST Chinese-English and WMT French-Spanish data sets show that our approach significantly outperforms the baseline method.展开更多
This study investigated how advanced Chinese students of English construct clause relations when construing English texts. A deconstructed text was distributed in class to 42 graduate students of linguistics, who were...This study investigated how advanced Chinese students of English construct clause relations when construing English texts. A deconstructed text was distributed in class to 42 graduate students of linguistics, who were required to organize the clauses into a conceivably good text. The result suggests that these students seemed to rely on explicit cohesive words （anaphoric references and repetitions） rather than meaning relations in text construction. They seemed to have difficulties in using cataphoric contextual information and the popular discourse pattern from general to specific. This study calls for an enhanced awareness of logico-semantic relations in teaching and learning text construction.展开更多
Various government documents tend to put the reordering of relationship together with institutional reform and functional transformation.If we fail to understand this important issue,we will be unable to understand Ch...Various government documents tend to put the reordering of relationship together with institutional reform and functional transformation.If we fail to understand this important issue,we will be unable to understand China’s national governance system.The reordering of relationship has four dimensions:government and market;central and local government;the economy and society;and government and society.The routes to this reordering can be divided into separation,retention and postponement.On the one hand,the conflicts between these routes have affected China’s national governance structure,so that it seeks a balance between closure and opening up;on the other,the course taken by the reordering of relationship is rooted in the demands for generality and modernity that coexist within China’s national governance.One could say that the straightening out of relationship has reshaped the distinctive features of this governance.In the course of continuous reordering,some of its important elements have undergone a crucial change.From the perspective of the reordering of relationship,the openness with which these relations have been absorbed into a larger system is crucial to the future transformation of China’s national governance.展开更多
Semantic Web has emerged to make web content machine-readable,and with the rapid increase in the number of web pages,its importance has increased.Resource description framework(RDF)is a special data graph format where...Semantic Web has emerged to make web content machine-readable,and with the rapid increase in the number of web pages,its importance has increased.Resource description framework(RDF)is a special data graph format where Semantic Web data are stored and it can be queried by SPARQL query language.The challenge is to find the optimal query order that results in the shortest period of time.In this paper,the discrete Artificial Bee Colony(dABCSPARQL)algorithm is proposed,based on a novel heuristic approach,namely reordering SPARQL queries.The processing time of queries with different shapes and sizes is minimized using the dABCSPARQL algorithm.The performance of the proposed method is evaluated on chain,star,cyclic,and chain-star queries of different sizes from the Lehigh University Benchmark(LUBM)dataset.The results obtained by the proposed method are compared with those of ARQ(a SPARQL processor for Jena)query engine,the Ant System,the Elitist Ant System,and MAX-MIN Ant System algorithms.The experiments demonstrate that the proposed method significantly reduces the processing time,and in most queries,the reduction rate is higher compared with other optimization methods.展开更多
Geometry based block partitioning （GBP） has been shown to achieve better performance than the tree structure based block partitioning （TSBP） of H.264. However, the residual blocks of GBP mode after motion compensa...Geometry based block partitioning （GBP） has been shown to achieve better performance than the tree structure based block partitioning （TSBP） of H.264. However, the residual blocks of GBP mode after motion compensation still present some non-vertical/non-horizontal orientations, and the conventional discrete cosine transform （DCT） may generate many high-frequency coefficients. To solve this problem, in this paper we propose a video coding approach by using GBP and reordering DCT （RDCT） techniques. In the proposed approach, GBP is first applied to partition the macroblocks. Then, before performing DCT, a reordering operation is used to adjust the pixel positions of the residual macroblocks based on the partition information. In this way, the partition information of GBP can be used to represent the reordering information of RDCT, and the bitrate can be reduced. Experimental results show that, compared to H.264/AVC, the proposed method achieves on average 6.38% and 5.69% bitrate reductions at low and high bitrates, respectively.展开更多
Objective:To evaluate the performance of orthokeratology(ortho-k)lens reordering using software-designed system,so as to determine the feasibility of ortho-k lens reordering without discontinuing lens wear.Methods:Thi...Objective:To evaluate the performance of orthokeratology(ortho-k)lens reordering using software-designed system,so as to determine the feasibility of ortho-k lens reordering without discontinuing lens wear.Methods:This study is a retrospective analysis of data of ortho-k lens wearers who had a history of short-term discontinuation of lens wear.A total of 94 individuals aged over 8 years with spherical equivalent refraction ranging from-0.50 to-6.50 diopters were included.The corneal topography data at baseline(before ortho-k)and after lens wear discontinuation(cessation of ortho-k treatment)were imported separately into the lens-design software,along with corresponding refraction data.Subsequently,corneal and lens parameters were generated and compared.Intraclass correlation coefficients(ICC)were calculated,and Bland and Altman analyses were conducted.Results:All 94 children were involved in the retrospective analysis.Compared with baseline data,there was a high level of consistency between Rwo(without discontinuation)and Rwith(with discontinuation),with an ICC of 0.96(P<0.001).Furthermore,the comparison of lens parameters generated by the Easyfit software between baseline and after short-term discontinuation showed a high degree of consistency,with all of the ICC values exceeding 0.90.Similar results were obtained using the WAVE software,as both ICC values and Bland-Altman plots demonstrated a high level of consistency in lens parameters between two conditions(nearly all data points fell within the 95%LoAs).Conclusions:It is feasible to directly reorder new ortho-k lenses using software fitting approaches.However,further investigations are necessary to validate their practicability in a clinical setting.展开更多
Unstructured and irregular graph data causes strong randomness and poor locality of data accesses in graph processing.This paper optimizes the depth-branch-resorting algorithm(DBR),and proposes a branch-alternation-re...Unstructured and irregular graph data causes strong randomness and poor locality of data accesses in graph processing.This paper optimizes the depth-branch-resorting algorithm(DBR),and proposes a branch-alternation-resorting algorithm(BAR).In order to make the algorithm run in parallel and improve the efficiency of algorithm operation,the BAR algorithm is mapped onto the reconfigurable array processor(APR-16)to achieve vertex reordering,effectively improving the locality of graph data.This paper validates the BAR algorithm on the GraphBIG framework,by utilizing the reordered dataset with BAR on breadth-first search(BFS),single source shortest paht(SSSP)and betweenness centrality(BC)algorithms for traversal.The results show that compared with DBR and Corder algorithms,BAR can reduce execution time by up to 33.00%,and 51.00%seperatively.In terms of data movement,the BAR algorithm has a maximum reduction of 39.00%compared with the DBR algorithm and 29.66%compared with Corder algorithm.In terms of computational complexity,the BAR algorithm has a maximum reduction of 32.56%compared with DBR algorithm and53.05%compared with Corder algorithm.展开更多
With the maturation and advancement of blockchain technology,a novel execute-order-validate(EOV)architecture has been proposed,allowing transactions to be executed in parallel during the execution phase.However,parall...With the maturation and advancement of blockchain technology,a novel execute-order-validate(EOV)architecture has been proposed,allowing transactions to be executed in parallel during the execution phase.However,parallel execution may lead to multi-version concurrency control(MVCC)conflicts during the validation phase,resulting in transaction invalidation.Based on different causes,we categorize conflicts in the EOV blockchain into two types:within-block conflicts and cross-block conflicts,and propose an optimization solution called FabricMan based on Fabric v2.4.For within-block conflicts,a reordering algorithm is designed to improve the transaction success rate and parallel validation is implemented based on the transaction conflict graph.We also merge transfer transactions to prevent triggering multiple version checks.For cross-block conflicts,a cache-based version validation mechanism is implemented to detect and terminate invalid transactions in advance.Experimental comparisons are conducted between FabricMan and two other systems,Fabric and Fabric++.The results show that FabricMan outperforms the other two systems in terms of throughput,transaction abort rate,algorithm execution time,and other experimental metrics.展开更多
Semi-quantum secret sharing(SQSS)is a branch of quantum cryptography which only requires the dealer to have quantum capabilities,reducing the difficulty of protocol implementation.However,the efficiency of the SQSS pr...Semi-quantum secret sharing(SQSS)is a branch of quantum cryptography which only requires the dealer to have quantum capabilities,reducing the difficulty of protocol implementation.However,the efficiency of the SQSS protocol still needs to be further studied.In this paper,we propose a semi-quantum secret sharing protocol,whose efficiency can approach 100%as the length of message increases.The protocol is based on single particles to reduce the difficulty of resource preparation.Particle reordering,a simple but effective operation,is used in the protocol to improve efficiency and ensure security.Furthermore,our protocol can share specific secrets while most SQSS protocols could not.We also prove that the protocol is secure against common attacks.展开更多
We introduce a novel Sermntic-Category- Tree （SCT） model to present the sen-antic structure of a sentence for Chinese-English Machine Translation （MT）. We use the SCT model to handle the reordering in a hierarchic...We introduce a novel Sermntic-Category- Tree （SCT） model to present the sen-antic structure of a sentence for Chinese-English Machine Translation （MT）. We use the SCT model to handle the reordering in a hierarchical structure in which one reordering is dependent on the others. Different from other reordering approaches, we handle the reordering at three levels： sentence level, chunk level, and word level. The chunk-level reordering is dependent on the sentence-level reordering, and the word-level reordering is dependent on the chunk-level reordering. In this paper, we formally describe the SCT model and discuss the translation strategy based on the SCT model. Further, we present an algorithm for analyzing the source language in SCT and transforming the source SCT into the target SCT. We apply the SCT model to a role-based patent text MT to evaluate the ability of the SCT model. The experimental results show that SCT is efficient in handling the hierarehical reordering operation in MT.展开更多
This paper revisits the Space-Time Gradient(STG) method which was developed for efficient analysis of unsteady flows due to rotor–stator interaction and presents the method from an alternative time-clocking perspecti...This paper revisits the Space-Time Gradient(STG) method which was developed for efficient analysis of unsteady flows due to rotor–stator interaction and presents the method from an alternative time-clocking perspective. The STG method requires reordering of blade passages according to their relative clocking positions with respect to blades of an adjacent blade row. As the space-clocking is linked to an equivalent time-clocking, the passage reordering can be performed according to the alternative time-clocking. With the time-clocking perspective, unsteady flow solutions from different passages of the same blade row are mapped to flow solutions of the same passage at different time instants or phase angles. Accordingly, the time derivative of the unsteady flow equation is discretized in time directly, which is more natural than transforming the time derivative to a spatial one as with the original STG method. To improve the solution accuracy, a ninth order difference scheme has been investigated for discretizing the time derivative. To achieve a stable solution for the high order scheme, the implicit solution method of Lower-Upper Symmetric GaussSeidel/Gauss-Seidel(LU-SGS/GS) has been employed. The NASA Stage 35 and its blade-countreduced variant are used to demonstrate the validity of the time-clocking based passage reordering and the advantages of the high order difference scheme for the STG method. Results from an existing harmonic balance flow solver are also provided to contrast the two methods in terms of solution stability and computational cost.展开更多
Off-chip replacement （capacity and conflict） and coherent read misses in a distributed shared memory system cause execution to stall for hundreds of cycles. These off-chip replacement and coherent read misses are re...Off-chip replacement （capacity and conflict） and coherent read misses in a distributed shared memory system cause execution to stall for hundreds of cycles. These off-chip replacement and coherent read misses are recurring and forming sequences of two or more misses called streams. Prior streaming techniques ignored reordering of misses and not-recently-accessed streams while streaming data. In this paper, we present stream prefetcher design that can deal with both problems. Our stream prefetcher design utilizes stream waiting rooms to store not-recently-accessed streams. Stream waiting rooms help remove more off-chip misses. Using trace based simulation% our stream prefetcher design can remove 8% to 66% （on average 40%） and 17% to 63% （on average 39%） replacement and coherent read misses, respectively. Using cycle-accurate full-system simulation, our design gives speedups from 1.00 to 1.17 of princeton application repository for shared-memory computers （PARSEC） workloads running on a distributed shared memory system with the exception of dedup and swaptions workloads.展开更多
The visualization of dynamic graphs is a challenging task owing to the various properties of the underlying relational data and the additional time-varying property.For sparse and small graphs,the most efficient appro...The visualization of dynamic graphs is a challenging task owing to the various properties of the underlying relational data and the additional time-varying property.For sparse and small graphs,the most efficient approach to such visualization is node-link diagrams,whereas for dense graphs with attached data,adjacency matrices might be the better choice.Because graphs can contain both properties,being globally sparse and locally dense,a combination of several visual metaphors as well as static and dynamic visualizations is beneficial.In this paper,a visually and algorithmically scalable approach that provides views and perspectives on graphs as interactively linked node-link and adjacency matrix visualizations is described.As the novelty of this technique,insights such as clusters or anomalies from one or several combined views can be used to influence the layout or reordering of the other views.Moreover,the importance of nodes and node groups can be detected,computed,and visualized by considering several layout and reordering properties in combination as well as different edge properties for the same set of nodes.As an additional feature set,an automatic identification of groups,clusters,and outliers is provided over time,and based on the visual outcome of the node-link and matrix visualizations,the repertoire of the supported layout and matrix reordering techniques is extended,and more interaction techniques are provided when considering the dynamics of the graph data.Finally,a small user experiment was conducted to investigate the usability of the proposed approach.The usefulness of the proposed tool is illustrated by applying it to a graph dataset,such as e co-authorships,co-citations,and a Comprehensible Perl Archive Network distribution.展开更多
Streaming video is becoming increasingly popular among Internet multimedia applications. A robust coding scheme for DCT-based scalable video streaming over the Internet is proposed in this paper. Compared with convent...Streaming video is becoming increasingly popular among Internet multimedia applications. A robust coding scheme for DCT-based scalable video streaming over the Internet is proposed in this paper. Compared with conventional MPEG4-FGS (fine granular scalable) and progressive FGS(PFGS), the proposed method generates the base layer including some sub-base layers by DCT coefficient reordering and VLC reshuffling, which enables the video stream of to adapt itself to long-term bandwidth time-varying of channel. Furthermore, a novel end-to-end transmission architecture for scalable video streaming over the Internet is also presented, in which an adaptive unequal packet loss protection (AUPLP) strategy is proposed to determine the currently available network bandwidth and adjust the sending rates according to different situations, such as network congestion or unreliable transmission. Experimental results show that the proposed progressive scalable scheme can improve the average coding efficiency up to 1.2 dB compared with MPEG4-FGS and PFGS in lower bandwidth, and the AUPLP strategy can improve the transmitting performances not only of the proposed scheme, but also of MPEG4-FGS, PFGS system.展开更多
Today's data center networks are designed using densely interconnected hosts in the data center.There are multiple paths between source host and destination server.Therefore,how to balance traffic is key issue wit...Today's data center networks are designed using densely interconnected hosts in the data center.There are multiple paths between source host and destination server.Therefore,how to balance traffic is key issue with the fast growth of network applications.Although lots of load balancing methods have been proposed,the traditional approaches cannot fully satisfy the requirement of load balancing in data center networks.The main reason is the lack of efficient ways to obtain network traffic statistics from each network device.As a solution,the OpenFlow protocol enables monitoring traffic statistics by a centralized controller.However,existing solutions based on OpenFlow present a difficult dilemma between load balancing and packet reordering.To achieve a balance between load balancing and packet reordering,we propose an OpenFlow based flow slice load balancing algorithm.Through introducing the idea of differentiated service,the scheme classifies Internet flows into two categories:the aggressive and the normal,and applies different splitting granularities to the two classes of flows.This scheme improves the performance of load balancing and also reduces the number of reordering packets.Using the trace-driven simulations,we show that the proposed scheme gains over 50%improvement over previous schemes under the path delay estimation errors,and is a practical and efficient algorithm.展开更多
In fixed order quantity systems,uncertainty in lead time is expressed as a set of scenarios with occurrence probabilities,and the mean and variance in demand distribution are supposed to be changeable according to a k...In fixed order quantity systems,uncertainty in lead time is expressed as a set of scenarios with occurrence probabilities,and the mean and variance in demand distribution are supposed to be changeable according to a known pattern.A new concept of "dynamic robust optimal reorder point" is proposed in this paper and its value is calculated as a "robust optimal reorder point function with respect to reorder time".Two approaches were employed in determining the dynamic optimal reorder point.The first is a shortage rate satisfaction approach and the second is a backorder cost minimization approach.The former aims at finding the minimum value of reorder point at each reorder time which satisfies the condition that the cumulative distribution function (CDF) of shortage rate under a given set of scenarios in lead time is greater than or equal to a basic CDF of shortage rate predetermined by a decision-maker.In the latter approach,the CDF of closeness of reorder point is defined at each reorder time to express how close to the optimal reorder points under the set of scenarios,and the dynamic optimal reorder point is defined according to stochastic ordering.Some numerical examples demonstrate the features of these dynamic robust optimal reorder points.展开更多
In market, excess demands for many products can be met by reorder even during one period, and retailers usually adopt substitution strategy for more benefit. Under the retailer＇s substitution strategy and permission ...In market, excess demands for many products can be met by reorder even during one period, and retailers usually adopt substitution strategy for more benefit. Under the retailer＇s substitution strategy and permission of reorder, we develop the profits maximization model for the two-substitutable-product inventory problem with stochastic demands and proportional costs and revenues. We show that the objective function is concave and submodular, and therefore the optimal policy exists. We present the optimal conditions for order quantity and provide some properties of the optimal order quantities. Comparing our model with Netessine and Rudi＇s, we prove that reorder and adoption of the substitution strategy can raise the general profits and adjust down the general stock level.展开更多
In this paper we discuss a novel storage scheme for simultaneous memory access in parallel turbo decoder. The new scheme employs vertex coloring in graph theory. Compared to a similar method that also uses unnatural o...In this paper we discuss a novel storage scheme for simultaneous memory access in parallel turbo decoder. The new scheme employs vertex coloring in graph theory. Compared to a similar method that also uses unnatural order in storage, our scheme requires 25 more memory blocks but allows a simpler configuration for variable sizes of code lengths that can be implemented on-chip. Experiment shows that for a moderate to high decoding throughput （40-100 Mbps）, the hardware cost is still affordable for 3GPP＇s （3rd generation partnership project） interleaver.展开更多
基金Project supported by Palomaa-Erikoski foundation,Academy of Finland,Conselho Nacional de Desenvolvimento Cientifico e Tec-nológico(Brazil)Finnish Funding Agency for Technology and Innovation(TEKES),Nordic Energy Research(Oslo,Norway)the European Community's Seventh Framework Programme(FP7/2007-2013)(312284)
文摘The NaYF4：yb3＋,Tb3＋ （Xyb： 0.20, XTb： 0.04） materials were prepared using the co-precipitation method, lne as-preparea material was washed either with or without water in addition to ethanol and thereafter annealed for 5 h at 500℃. This resulted in materials with moderate or very high up-conversion luminescence intensity, respectively. The structural study carried out with X-ray powder diffraction revealed microstrains in the rare earth （R） sublattice that were relaxed for the material with very high up-conversion intensity thus decreasing energy losses. The local structural details were investigated with R LⅢ and Y K edge ex- tended X-ray absorption fine structure （EXAFS） using synchrotron radiation. Around 10 tool.% of the Yb3＋ ions were found to occupy the Na site in the material with very high up-conversion intensity. These Yb species formed clusters with the Tb3＋ ions occupying the regular Na/R sites. Such clustering enhanced the energy transfer between Yb3＋ and Tb3＋ thus intensifying the up-conversion emission.
基金Supported by the National Natural Science Foundation of China under Grant No U1530126
文摘The identification between chaotic systems and stochastic processes is not easy since they have numerous similarities. In this study, we propose a novel approach to distinguish between chaotic systems and stochastic processes based on the component reordering procedure and the visibility graph algorithm. It is found that time series and their reordered components will show diverse characteristics in the ＇visibility domain＇. For chaotic series, there are huge differences between the degree distribution obtained from the original series and that obtained from the corresponding reordered component. For correlated stochastic series, there are only small differences between the two degree distributions. For uncorrelated stochastic series, there are slight differences between them. Based on this discovery, the well-known Kullback Leible divergence is used to quantify the difference between the two degree distributions and to distinguish between chaotic systems, correlated and uncorrelated stochastic processes. Moreover, one chaotic map, three chaotic systems and three different stochastic processes are utilized to illustrate the feasibility and effectiveness of the proposed method. Numerical results show that the proposed method is not only effective to distinguish between chaotic systems, correlated and uncorrelated stochastic processes, but also easy to operate.
基金supported by the National Natural Science Foundation of China（No.61303082） the Research Fund for the Doctoral Program of Higher Education of China（No.20120121120046）
文摘Lexicalized reordering models are very important components of phrasebased translation systems.By examining the reordering relationships between adjacent phrases,conventional methods learn these models from the word aligned bilingual corpus,while ignoring the effect of the number of adjacent bilingual phrases.In this paper,we propose a method to take the number of adjacent phrases into account for better estimation of reordering models.Instead of just checking whether there is one phrase adjacent to a given phrase,our method firstly uses a compact structure named reordering graph to represent all phrase segmentations of a parallel sentence,then the effect of the adjacent phrase number can be quantified in a forward-backward fashion,and finally incorporated into the estimation of reordering models.Experimental results on the NIST Chinese-English and WMT French-Spanish data sets show that our approach significantly outperforms the baseline method.
基金contributes partly to the fulfillment of a National Project of Social Science entitled:A contrastive study of minimum discourse patterns in English and Chinese, coded 10BYY006an MOE project A contrastive study of clause relations and discourse patterns in English and Chinese, coded 08JA740013
文摘This study investigated how advanced Chinese students of English construct clause relations when construing English texts. A deconstructed text was distributed in class to 42 graduate students of linguistics, who were required to organize the clauses into a conceivably good text. The result suggests that these students seemed to rely on explicit cohesive words （anaphoric references and repetitions） rather than meaning relations in text construction. They seemed to have difficulties in using cataphoric contextual information and the popular discourse pattern from general to specific. This study calls for an enhanced awareness of logico-semantic relations in teaching and learning text construction.
文摘Various government documents tend to put the reordering of relationship together with institutional reform and functional transformation.If we fail to understand this important issue,we will be unable to understand China’s national governance system.The reordering of relationship has four dimensions:government and market;central and local government;the economy and society;and government and society.The routes to this reordering can be divided into separation,retention and postponement.On the one hand,the conflicts between these routes have affected China’s national governance structure,so that it seeks a balance between closure and opening up;on the other,the course taken by the reordering of relationship is rooted in the demands for generality and modernity that coexist within China’s national governance.One could say that the straightening out of relationship has reshaped the distinctive features of this governance.In the course of continuous reordering,some of its important elements have undergone a crucial change.From the perspective of the reordering of relationship,the openness with which these relations have been absorbed into a larger system is crucial to the future transformation of China’s national governance.
文摘Semantic Web has emerged to make web content machine-readable,and with the rapid increase in the number of web pages,its importance has increased.Resource description framework(RDF)is a special data graph format where Semantic Web data are stored and it can be queried by SPARQL query language.The challenge is to find the optimal query order that results in the shortest period of time.In this paper,the discrete Artificial Bee Colony(dABCSPARQL)algorithm is proposed,based on a novel heuristic approach,namely reordering SPARQL queries.The processing time of queries with different shapes and sizes is minimized using the dABCSPARQL algorithm.The performance of the proposed method is evaluated on chain,star,cyclic,and chain-star queries of different sizes from the Lehigh University Benchmark(LUBM)dataset.The results obtained by the proposed method are compared with those of ARQ(a SPARQL processor for Jena)query engine,the Ant System,the Elitist Ant System,and MAX-MIN Ant System algorithms.The experiments demonstrate that the proposed method significantly reduces the processing time,and in most queries,the reduction rate is higher compared with other optimization methods.
基金Project supported by the National Natural Science Foundation of China （No. 61102135）, the Fundamental Research Funds for the Central Universities, China （No. 2010121063）, and the Science and Technique Commission Foundation of Fujian Province, China （No. 2011 H6028）
文摘Geometry based block partitioning （GBP） has been shown to achieve better performance than the tree structure based block partitioning （TSBP） of H.264. However, the residual blocks of GBP mode after motion compensation still present some non-vertical/non-horizontal orientations, and the conventional discrete cosine transform （DCT） may generate many high-frequency coefficients. To solve this problem, in this paper we propose a video coding approach by using GBP and reordering DCT （RDCT） techniques. In the proposed approach, GBP is first applied to partition the macroblocks. Then, before performing DCT, a reordering operation is used to adjust the pixel positions of the residual macroblocks based on the partition information. In this way, the partition information of GBP can be used to represent the reordering information of RDCT, and the bitrate can be reduced. Experimental results show that, compared to H.264/AVC, the proposed method achieves on average 6.38% and 5.69% bitrate reductions at low and high bitrates, respectively.
基金supported by the National Natural Science Foundation of China(82371089).
文摘Objective:To evaluate the performance of orthokeratology(ortho-k)lens reordering using software-designed system,so as to determine the feasibility of ortho-k lens reordering without discontinuing lens wear.Methods:This study is a retrospective analysis of data of ortho-k lens wearers who had a history of short-term discontinuation of lens wear.A total of 94 individuals aged over 8 years with spherical equivalent refraction ranging from-0.50 to-6.50 diopters were included.The corneal topography data at baseline(before ortho-k)and after lens wear discontinuation(cessation of ortho-k treatment)were imported separately into the lens-design software,along with corresponding refraction data.Subsequently,corneal and lens parameters were generated and compared.Intraclass correlation coefficients(ICC)were calculated,and Bland and Altman analyses were conducted.Results:All 94 children were involved in the retrospective analysis.Compared with baseline data,there was a high level of consistency between Rwo(without discontinuation)and Rwith(with discontinuation),with an ICC of 0.96(P<0.001).Furthermore,the comparison of lens parameters generated by the Easyfit software between baseline and after short-term discontinuation showed a high degree of consistency,with all of the ICC values exceeding 0.90.Similar results were obtained using the WAVE software,as both ICC values and Bland-Altman plots demonstrated a high level of consistency in lens parameters between two conditions(nearly all data points fell within the 95%LoAs).Conclusions:It is feasible to directly reorder new ortho-k lenses using software fitting approaches.However,further investigations are necessary to validate their practicability in a clinical setting.
基金the National Key R&D Program of China(No.2022ZD0119001)the National Natural Science Foundation of China(No.61834005)+3 种基金the Shaanxi Province Key R&D Plan(No.2022GY-027)the Key Scientific Research Project of Shaanxi Department of Education(No.22JY060)the Education Research Project of XUPT(No.JGA202108)the Graduate Student Innovation Fund of Xi'an University of Posts and Telecommunications(No.CXJJZL2022011)。
文摘Unstructured and irregular graph data causes strong randomness and poor locality of data accesses in graph processing.This paper optimizes the depth-branch-resorting algorithm(DBR),and proposes a branch-alternation-resorting algorithm(BAR).In order to make the algorithm run in parallel and improve the efficiency of algorithm operation,the BAR algorithm is mapped onto the reconfigurable array processor(APR-16)to achieve vertex reordering,effectively improving the locality of graph data.This paper validates the BAR algorithm on the GraphBIG framework,by utilizing the reordered dataset with BAR on breadth-first search(BFS),single source shortest paht(SSSP)and betweenness centrality(BC)algorithms for traversal.The results show that compared with DBR and Corder algorithms,BAR can reduce execution time by up to 33.00%,and 51.00%seperatively.In terms of data movement,the BAR algorithm has a maximum reduction of 39.00%compared with the DBR algorithm and 29.66%compared with Corder algorithm.In terms of computational complexity,the BAR algorithm has a maximum reduction of 32.56%compared with DBR algorithm and53.05%compared with Corder algorithm.
文摘With the maturation and advancement of blockchain technology,a novel execute-order-validate(EOV)architecture has been proposed,allowing transactions to be executed in parallel during the execution phase.However,parallel execution may lead to multi-version concurrency control(MVCC)conflicts during the validation phase,resulting in transaction invalidation.Based on different causes,we categorize conflicts in the EOV blockchain into two types:within-block conflicts and cross-block conflicts,and propose an optimization solution called FabricMan based on Fabric v2.4.For within-block conflicts,a reordering algorithm is designed to improve the transaction success rate and parallel validation is implemented based on the transaction conflict graph.We also merge transfer transactions to prevent triggering multiple version checks.For cross-block conflicts,a cache-based version validation mechanism is implemented to detect and terminate invalid transactions in advance.Experimental comparisons are conducted between FabricMan and two other systems,Fabric and Fabric++.The results show that FabricMan outperforms the other two systems in terms of throughput,transaction abort rate,algorithm execution time,and other experimental metrics.
基金Project supported by the National Key Research and Development Program of China(Grant No.2020YFB1805405)the 111 Project(Grant No.B21049),the National Natural Science Foundation of China(Grant No.62272051)+1 种基金the Foundation of Guizhou Provincial Key Laboratory of Public Big Data(Grant No.2019BDKFJJ014)the Fundamental Research Funds for the Central Universities of China(Grant Nos.2019XD-A02 and 2020RC38).
文摘Semi-quantum secret sharing(SQSS)is a branch of quantum cryptography which only requires the dealer to have quantum capabilities,reducing the difficulty of protocol implementation.However,the efficiency of the SQSS protocol still needs to be further studied.In this paper,we propose a semi-quantum secret sharing protocol,whose efficiency can approach 100%as the length of message increases.The protocol is based on single particles to reduce the difficulty of resource preparation.Particle reordering,a simple but effective operation,is used in the protocol to improve efficiency and ensure security.Furthermore,our protocol can share specific secrets while most SQSS protocols could not.We also prove that the protocol is secure against common attacks.
基金supported by the National High Technology Research and Development Program of China under Grant No.2012AA011104the Fundamental Research Funds for the Center Universities
文摘We introduce a novel Sermntic-Category- Tree （SCT） model to present the sen-antic structure of a sentence for Chinese-English Machine Translation （MT）. We use the SCT model to handle the reordering in a hierarchical structure in which one reordering is dependent on the others. Different from other reordering approaches, we handle the reordering at three levels： sentence level, chunk level, and word level. The chunk-level reordering is dependent on the sentence-level reordering, and the word-level reordering is dependent on the chunk-level reordering. In this paper, we formally describe the SCT model and discuss the translation strategy based on the SCT model. Further, we present an algorithm for analyzing the source language in SCT and transforming the source SCT into the target SCT. We apply the SCT model to a role-based patent text MT to evaluate the ability of the SCT model. The experimental results show that SCT is efficient in handling the hierarehical reordering operation in MT.
基金co-supported by the National Natural Science Foundation of China(No.51976172)the National Science and Technology Major Project of China(No.2017-Ⅱ-0009-0023)。
文摘This paper revisits the Space-Time Gradient(STG) method which was developed for efficient analysis of unsteady flows due to rotor–stator interaction and presents the method from an alternative time-clocking perspective. The STG method requires reordering of blade passages according to their relative clocking positions with respect to blades of an adjacent blade row. As the space-clocking is linked to an equivalent time-clocking, the passage reordering can be performed according to the alternative time-clocking. With the time-clocking perspective, unsteady flow solutions from different passages of the same blade row are mapped to flow solutions of the same passage at different time instants or phase angles. Accordingly, the time derivative of the unsteady flow equation is discretized in time directly, which is more natural than transforming the time derivative to a spatial one as with the original STG method. To improve the solution accuracy, a ninth order difference scheme has been investigated for discretizing the time derivative. To achieve a stable solution for the high order scheme, the implicit solution method of Lower-Upper Symmetric GaussSeidel/Gauss-Seidel(LU-SGS/GS) has been employed. The NASA Stage 35 and its blade-countreduced variant are used to demonstrate the validity of the time-clocking based passage reordering and the advantages of the high order difference scheme for the STG method. Results from an existing harmonic balance flow solver are also provided to contrast the two methods in terms of solution stability and computational cost.
基金supported by Higher Education Commission(Pakistan)National High Technology Research and Development Program of China(863 Program)(No.2008AA01A201)+1 种基金Natural Science Foundation of China(Nos.60833004 and 60970002)TNList Cross-discipline Foundation
文摘Off-chip replacement （capacity and conflict） and coherent read misses in a distributed shared memory system cause execution to stall for hundreds of cycles. These off-chip replacement and coherent read misses are recurring and forming sequences of two or more misses called streams. Prior streaming techniques ignored reordering of misses and not-recently-accessed streams while streaming data. In this paper, we present stream prefetcher design that can deal with both problems. Our stream prefetcher design utilizes stream waiting rooms to store not-recently-accessed streams. Stream waiting rooms help remove more off-chip misses. Using trace based simulation% our stream prefetcher design can remove 8% to 66% （on average 40%） and 17% to 63% （on average 39%） replacement and coherent read misses, respectively. Using cycle-accurate full-system simulation, our design gives speedups from 1.00 to 1.17 of princeton application repository for shared-memory computers （PARSEC） workloads running on a distributed shared memory system with the exception of dedup and swaptions workloads.
文摘The visualization of dynamic graphs is a challenging task owing to the various properties of the underlying relational data and the additional time-varying property.For sparse and small graphs,the most efficient approach to such visualization is node-link diagrams,whereas for dense graphs with attached data,adjacency matrices might be the better choice.Because graphs can contain both properties,being globally sparse and locally dense,a combination of several visual metaphors as well as static and dynamic visualizations is beneficial.In this paper,a visually and algorithmically scalable approach that provides views and perspectives on graphs as interactively linked node-link and adjacency matrix visualizations is described.As the novelty of this technique,insights such as clusters or anomalies from one or several combined views can be used to influence the layout or reordering of the other views.Moreover,the importance of nodes and node groups can be detected,computed,and visualized by considering several layout and reordering properties in combination as well as different edge properties for the same set of nodes.As an additional feature set,an automatic identification of groups,clusters,and outliers is provided over time,and based on the visual outcome of the node-link and matrix visualizations,the repertoire of the supported layout and matrix reordering techniques is extended,and more interaction techniques are provided when considering the dynamics of the graph data.Finally,a small user experiment was conducted to investigate the usability of the proposed approach.The usefulness of the proposed tool is illustrated by applying it to a graph dataset,such as e co-authorships,co-citations,and a Comprehensible Perl Archive Network distribution.
文摘Streaming video is becoming increasingly popular among Internet multimedia applications. A robust coding scheme for DCT-based scalable video streaming over the Internet is proposed in this paper. Compared with conventional MPEG4-FGS (fine granular scalable) and progressive FGS(PFGS), the proposed method generates the base layer including some sub-base layers by DCT coefficient reordering and VLC reshuffling, which enables the video stream of to adapt itself to long-term bandwidth time-varying of channel. Furthermore, a novel end-to-end transmission architecture for scalable video streaming over the Internet is also presented, in which an adaptive unequal packet loss protection (AUPLP) strategy is proposed to determine the currently available network bandwidth and adjust the sending rates according to different situations, such as network congestion or unreliable transmission. Experimental results show that the proposed progressive scalable scheme can improve the average coding efficiency up to 1.2 dB compared with MPEG4-FGS and PFGS in lower bandwidth, and the AUPLP strategy can improve the transmitting performances not only of the proposed scheme, but also of MPEG4-FGS, PFGS system.
基金supported by a grant from the National Basic Research Development Program of China(973 Program)(No.2012CB315901,2012CB315906)the National High Technology Research and Development Program of China(863 Program)(No.2011AA01A103)
文摘Today's data center networks are designed using densely interconnected hosts in the data center.There are multiple paths between source host and destination server.Therefore,how to balance traffic is key issue with the fast growth of network applications.Although lots of load balancing methods have been proposed,the traditional approaches cannot fully satisfy the requirement of load balancing in data center networks.The main reason is the lack of efficient ways to obtain network traffic statistics from each network device.As a solution,the OpenFlow protocol enables monitoring traffic statistics by a centralized controller.However,existing solutions based on OpenFlow present a difficult dilemma between load balancing and packet reordering.To achieve a balance between load balancing and packet reordering,we propose an OpenFlow based flow slice load balancing algorithm.Through introducing the idea of differentiated service,the scheme classifies Internet flows into two categories:the aggressive and the normal,and applies different splitting granularities to the two classes of flows.This scheme improves the performance of load balancing and also reduces the number of reordering packets.Using the trace-driven simulations,we show that the proposed scheme gains over 50%improvement over previous schemes under the path delay estimation errors,and is a practical and efficient algorithm.
基金Project (No.21510152) supported by the Grant-in-Aid for Scientific Research (C),Japan
文摘In fixed order quantity systems,uncertainty in lead time is expressed as a set of scenarios with occurrence probabilities,and the mean and variance in demand distribution are supposed to be changeable according to a known pattern.A new concept of "dynamic robust optimal reorder point" is proposed in this paper and its value is calculated as a "robust optimal reorder point function with respect to reorder time".Two approaches were employed in determining the dynamic optimal reorder point.The first is a shortage rate satisfaction approach and the second is a backorder cost minimization approach.The former aims at finding the minimum value of reorder point at each reorder time which satisfies the condition that the cumulative distribution function (CDF) of shortage rate under a given set of scenarios in lead time is greater than or equal to a basic CDF of shortage rate predetermined by a decision-maker.In the latter approach,the CDF of closeness of reorder point is defined at each reorder time to express how close to the optimal reorder points under the set of scenarios,and the dynamic optimal reorder point is defined according to stochastic ordering.Some numerical examples demonstrate the features of these dynamic robust optimal reorder points.
文摘In market, excess demands for many products can be met by reorder even during one period, and retailers usually adopt substitution strategy for more benefit. Under the retailer＇s substitution strategy and permission of reorder, we develop the profits maximization model for the two-substitutable-product inventory problem with stochastic demands and proportional costs and revenues. We show that the objective function is concave and submodular, and therefore the optimal policy exists. We present the optimal conditions for order quantity and provide some properties of the optimal order quantities. Comparing our model with Netessine and Rudi＇s, we prove that reorder and adoption of the substitution strategy can raise the general profits and adjust down the general stock level.
基金supported by the National High-Technology Research and Development Program of China （Grant No.2003AA123310）, and the National Natural Science Foundation of China （Grant Nos.60332030, 60572157）
文摘In this paper we discuss a novel storage scheme for simultaneous memory access in parallel turbo decoder. The new scheme employs vertex coloring in graph theory. Compared to a similar method that also uses unnatural order in storage, our scheme requires 25 more memory blocks but allows a simpler configuration for variable sizes of code lengths that can be implemented on-chip. Experiment shows that for a moderate to high decoding throughput （40-100 Mbps）, the hardware cost is still affordable for 3GPP＇s （3rd generation partnership project） interleaver.
