oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2019 ( 36 )

2018 ( 319 )

2017 ( 317 )

2016 ( 279 )

Custom range...

Search Results: 1 - 10 of 27145 matches for " Guohua Jin "
All listed articles are free for downloading (OA Articles)
Page 1 /27145
Display every page Item
Discussion on Tourism Logistics Based on the Separation and Combination of Tourists and Items Theory  [PDF]
Zhiyang Jin, Kunhao Dai, Guohua Fu, Yang Li
American Journal of Industrial and Business Management (AJIBM) , 2017, DOI: 10.4236/ajibm.2017.74039
Abstract: In order to understand the essence of tourism logistics activities, the author studies and summarizes the existing research results of tourism logistics at home and abroad, finding that there exist two kinds of logistics phenomena in tourism industry. Then, the author analyses in-depth the cross process between the two kinds of logistics phenomena and tourist flow from the perspective of time and space as well as identifies the key factors in the process of their separation and combination. Next, focusing on the two kinds of logistics phenomena, the author completely explains the process of the tourism logistics activities via the in-out transformation mechanism. Finally, the functions and objectives of the tourism logistics system are defined through the separation and combination of tourists and items theory in this paper, which provides instructive directions for future research.
On the Problem of optimizing Parallel Programs for Complex Memory Hierarchies
On the Problem of Optimizing Parallel Programs for Complex Memory Hierarchies

Jin Guohua,Chen Fujie,
Jin Guohua
,Chen Fujie

计算机科学技术学报 , 1994,
Abstract: Based on a thorough study of the relationship between array element accesses and loop indices of the nested loop, a method is presented with which the staggering relation and the compacting relation between the threads of the nested loop (either with a single linear function or with multiple linear functions) can be determined at compile-time,and accordingly the nested loop (either perfectly nested one or imperfectly nested one)can be restructured to avoid the thrashing problem. Due to its simplicity, our method can be efficiently implemented in any parallel compiler, and the improvement of the performance is significant as shown by the experimental results.
Optimizing FORTRAN Programs for Hierarchical Memory Parallel Processing Systems
Jin Guohua Chen Fujie,
Jin Guohua
,Chen Fujie

计算机科学技术学报 , 1993,
Abstract: Parallel loops account for the greatest amount of parallelism in numerical programs.Executing nested loops in parallel with low run-time overhead is thus very important for achieving high performance in parallel processing systems.However,in parallel processing systems with caches or local memories in memory hierarchies,“thrashing problemmay”may arise whenever data move back and forth between the caches or local memories in different processors.Previous techniques can only deal with the rather simple cases with one linear function in the perfactly nested loop.In this paper,we present a parallel program optimizing technique called hybri loop interchange(HLI)for the cases with multiple linear functions and loop-carried data dependences in the nested loop.With HLI we can easily eliminate or reduce the thrashing phenomena without reucing the program parallelism.
Bootstrap-based Support of HGT Inferred by Maximum Parsimony
Hyun Park, Guohua Jin, Luay Nakhleh
BMC Evolutionary Biology , 2010, DOI: 10.1186/1471-2148-10-131
Abstract: In this paper, we address this problem in a more systematic way, by proposing a nonparametric bootstrap-based measure of support of inferred reticulation events, and using it to determine the number of those events, as well as their placements. A number of samples is generated from the given sequence alignment, and reticulation events are inferred based on each sample. Finally, the support of each reticulation event is quantified based on the inferences made over all samples.We have implemented our method in the NEPAL software tool (available publicly at http://bioinfo.cs.rice.edu/ webcite), and studied its performance on both biological and simulated data sets. While our studies show very promising results, they also highlight issues that are inherently challenging when applying the maximum parsimony criterion to detect reticulate evolution.The massive evidence of horizontal gene transfer in prokaryotes and higher organisms and the significant role hybridization plays in speciation of various groups of species in the plant kingdom and beyond, have highlighted the need for developing models and methodologies that augment trees to enable modeling of reticulate evolutionary relationships. Indeed, the computational biology and bioinformatics communities have developed a host of such models and methodologies for reconstructing and evaluating phylogenetic networks. Several extensive surveys have been written recently about phylogenetic networks; we refer the reader to [1-7].One of the most commonly used criteria for reconstructing phylogenetic trees is maximum parsimony (MP). Under this criterion, the phylogenetic tree that best fits a sequence data set is one that minimizes the total number of mutations over all possible tree topologies and sequence assignments to internal nodes of the tree topologies. There is a polynomial time algorithm for computing the parsimony length of a fixed phylogenetic tree leaf-labeled by a set of sequences, due to [8], while solving the MP
Loop staggering, loop compacting: Restructuring techniques for thrashing problem
Loop Staggering,Loop Compacting:Restructuring Techniques for Thrashing Problem

Guohua Jin,Xuejun Yang,Fujie Chen,
Jin Guohua
,Yang Xuejun,Chen Fujie

计算机科学技术学报 , 1993,
Abstract: Parallel loops account for the greatest amount of parallelism in numerical programs. Executing nested loops in parallel with low run-time overhead is thus very important for achieviog high performance in parallel processing systems. However, in parallel processing systems with caches or local memories in memory hierarchies, “thrashing problem” may arise when data move back and forth frequently between the caches or local memories in different processors. The techniques associated with parallel compiler to solve the problem are not completely developed. In this paper, we present two restructuring techniques called loop staggering, loop staggering and compacting, with which we can not only eliminate the cache or local memory, thrashing phenomena significantly, but also exploit the potential parallelism existing in outer serial loop. Loop staggering benefits the dynamic loop scheduling strategies, whereas loop staggering and compacting is good for static loop scheduling strategies. Our method especially benefits parallel programs, in which a parallel loop is enclosed by a serial loop and array elements are repeatedly used in the different iterations of the parallel loop.
Ribbon Element on Co-Frobenius Quasitriangular Hopf Algebras  [PDF]
Guohua Liu
Applied Mathematics (AM) , 2010, DOI: 10.4236/am.2010.13028
Abstract: Let (H, R) be a co-Frobenius quasitriangular Hopf algebra with antipode S. Denote the set of group-like elements in H by G (H). In this paper, we find a necessary and sufficient condition for (H, R) to have a ribbon element. The condition gives a connection with the order of G (H) and the order of S2.
Cost Optimal Selection of Storage Tanks in LPG Vaporization Station  [PDF]
Guohua Shi
Natural Resources (NR) , 2012, DOI: 10.4236/nr.2012.33021
Abstract: Liquefied petroleum gas (LPG) is an important urban gas source in China. Before supplied to customers by pipeline supply systems, LPG is stored in tanks in LPG vaporization stations. Designers usually decide the number and the size of storage tanks by their experience during constructions of vaporization stations. These decisions are usually not best and most economical. To solve the problem, a compact mixed integer nonlinear programming model has been developed in this paper. The objective is to minimize annual storage cost of the vaporization station. The model has been transformed into a general nonlinear programming model by transforming integer variables and 0-1 variables into continuous variables. One LPG vaporization station was taken as an example to illustrate the usage of the model. The results show that the optimal storage scheme can be determined accurately and quickly by the model and about 15% of storage cost can be saved every year after optimization.
N-Fold Darboux Transformation of the Jaulent-Miodek Equation  [PDF]
Guohua Xu
Applied Mathematics (AM) , 2014, DOI: 10.4236/am.2014.517254
Abstract: In this paper, based on the Lax pair of the Jaulent-Miodek spectral problem, we construct the Darboux transformation of the Jaulent-Miodek Equation. Then from a trivial solution, we get the exact solutions of the Jaulent-Miodek Equation. We obtain a kink-type soliton and a bell-kink-type soliton. Particularly, we obtain the exact solutions which describe the elastic-inelastic-interaction coexistence phenomenon.
The Study on the Relationship between Agricultural Product Price Fluctuation and Inflation  [PDF]
Guohua Gou
Journal of Service Science and Management (JSSM) , 2017, DOI: 10.4236/jssm.2017.102015
Abstract:
After introducing the inflation expectation, this paper uses the co-integration test and VAR model to analyze the price fluctuation of agricultural products and the paper analyzes the relationship between inflation and inflation expectation. The results show that there is no co-integration relationship between agricultural product price fluctuation, inflation expectation and inflation, but agricultural product price fluctuation is Granger reason of inflation expectation. There is bi-directional Granger causality between inflation expectation and inflation. In the short run, there is volatility between the three in the current or lag phase 1 to reach the maximum.
A NEW ALGORITHM FOR INTENSIVE ALIAS ANALYSIS
一个新的强化别名分析算法

Jin Guohua,Chen Fujie,
金国华
,陈福接

软件学报 , 1994,
Abstract: lthough much more attention have been paid, data dependence analysis and program parallelization become very difficult when the analyzed program has procedure call. Based on thorough study of the effect of alias on program parallelization, in this paper, they present an algorithm which intensively analyzes the aliases, and as the result,they make the parallelization of the called procedures possible.
Page 1 /27145
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.