oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2019 ( 39 )

2018 ( 1198 )

2017 ( 1218 )

2016 ( 1188 )

Custom range...

Search Results: 1 - 10 of 88276 matches for " Yan-Jun Shi "
All listed articles are free for downloading (OA Articles)
Page 1 /88276
Display every page Item
Solving Project Scheduling Problems using Estimation of Distribution Algorithm with Local Simplex Search
Yan-Jun Shi,Guo-Jiang Shen,Wang Chen
Information Technology Journal , 2011,
Abstract: The Resource-Constrained Project Scheduling Problem (RCPSP) is a NP-hard problem in information engineering. The activities of a project have to be scheduled for satisfying all the precedence and resource constraints. We presented a heuristic algorithm (EDAS) to deal with this problem which employed an estimation of distribution algorithm (known as EDA) and improved the local search capacity with a simplex search. In this algorithm, the EDA firstly searched the solution space and generated activity lists to provide the initial population; then, the EDA selected the sample solutions to build a probability distribution model. The new individual was generated by sampling this model. The simplex search was used to enhance the local search capacity of the EDA. Compared with state-of-the-art algorithms available in the literature, we showed the effectiveness of this approach empirically on the standard benchmark problems of size J60 and J120 from PSPLIB.
A Dual-system Method with Differential Evolution and Genetic Algorithm for Loop-based Station Sequencing Problem
Shuai Ma,Zhuang-Cheng Liu,Yan-Jun Shi
Information Technology Journal , 2013,
Abstract: The facility layout problem is one of the most complex problems in many industries and the Loop-based Station Sequencing Problem (LSSP) is a classical sub-problem. In this study, a dual-system method based on Differential Evolution (DE) and Genetic Algorithm (GA) (DDEGA) was presented to solve the LSSP. The DDEGA duplicates the system P, which represents the original problem, as systems A and B. The systems A and B are solved by DE and GA, respectively. Since the elite migration between two systems can contribute to increasing the diversity and decreasing the premature convergence, the DDEGA can obtain better solutions and robustness. Numerical studies on four different scales showed that the proposed method can obtain a challenging solution.
Comparisons of Image Quality and ADCs in Breath-Hold, Respiratory-Triggered and Free-Breathing DWI of Pancreas at 3-T  [PDF]
Chao Ma, Jian Wang, Yan-Jun Li, Chun-Shu Pan, Yong Zhang, He Wang, Shi-Yue Chen, Jian-Ping Lu
Open Journal of Radiology (OJRad) , 2014, DOI: 10.4236/ojrad.2014.44037
Abstract: Objective: To compare image quality and apparent diffusion coefficients (ADC) of the normal pancreas parenchymas in breath-hold, respiratory-triggered and free-breathing diffusion weighted imaging (DWI) at 3.0-Tesla. Methods: DWI of the pancreas was performed at 3.0-Tesla in 21 healthy volunteers with breath-hold, respiratory-triggered and free-breathing using b-values of 0 and 500 s/mm2. For all three sequences, two readers assigned an image quality score to images at b0 and b500, and two independent readers measured ADCs for the head, body and tail of pancreas. Image quality scores and ADCs of pancreas in the three DWIs were compared. Results: For b0, image quality scores was not significantly different among the three sequences (p = 0.103). For b500, image quality score was significantly lower in free-breathing DWI than breath-hold or respiratory-triggered DWI (p = 0.000), and not significantly different between breath-hold and respiratory-triggered DWI (p = 0.212). Mean ADCs differed significantly among the anatomical regions with the lowest values measured in the pancreatic tail both at breath-hold and respiratory-triggered DWIs whereas no significant difference was found at free-breathing DWI. Conclusion: Breath-hold or respiratory-triggered technique provided DW images of pancreas with acceptable quality at 3.0-Tesla. Breath-hold is the preferred DWI technique for ADC measurements of pancreas.
A Method of Display Hide Interfaces in Volume Rendering and Its Realization
体绘制中显示隐含分界面的一种方法及其实现

PENG Yan-jun,SHI Jiao-ying,
彭延军
,石教英

软件学报 , 2002,
Abstract: The colors and the opacity of voxels in transfer function should be assigned in order to display hide interfaces (the interface of inner different mediums) in objects by direct volume rendering based on the general volume light model. Although the inner structure of objects is seen, it is not clear to see inner hide interfaces from the surface based on this model. One reason is that the general volume light model does not have the attribute of select transparency. The particles in 3D space are not penetrated by visible lights with one wavelength and absorb visible lights with another different wavlength.They can only absorb all kinds of visible lisible light in the same extent. Another reason is that it is short of surface information.A light model with the attribute of select transparency is used in the new algorithm,and the surface scatter which has nothing to do with the line of sight and the position of light source is put up into it.Meanwhile,the non-photorealistic rendering techniques are used to advance effects of inner hide interfaces.The hide interfaces and details are clearly displayed based on the new light model.
1,4-Bis[(1H-pyrazol-1-yl)methyl]benzene dihydrate
Ai-E Shi,Yan-Jun Hou,Yi-Ming Zhang,Guang-Feng Hou
Acta Crystallographica Section E , 2009, DOI: 10.1107/s1600536809007521
Abstract: The asymmetric unit of the title compound, C14H14N4·2H2O consists of two half-molecules of the main molecule, each situated on an inversion center, and two molecules of water. One-dimensional chains of water molecules are built up by O—H...O hydrogen bonds which are then linked with the main molecule via O—H...N hydrogen bonds, forming a two-dimensional supramolecular network in the ac plane.
Opposition-based Cooperative Coevolutionary Differential Evolution Algorithm With Gaussian Mutation for Simplified Satellite Module Optimization
Yuan-Hui Wang,Yan-Jun Shi,Xiu-Kun Wang,Hong-Fei Teng
Information Technology Journal , 2012,
Abstract: Layout problem of satellite module is a NP-hard problem with performance constraints. An opposition-based Cooperative Coevolutionary Differential Evolution algorithm with Gaussian mutation (OCCDEG) is developed here to solve this problem. In the proposed algorithm, the whole population was divided into several subpopulations. Cooperating with each other, these subpopulations evolve together to search the optimal solution. The cooperative coevolution decreases the complexity of problems and improves the convergence rate of the algorithm. The Opposition-Based Learning (OBL), employed for population initialization and evolution, enhances the exploration capability of the algorithm and improves the convergence rate of the algorithm. The Gaussian mutation operator enhances the local search of the algorithm. The experimental results from a layout design of simplified satellite module show that, compared with other algorithms in this paper, OCCDEG obtains the competitive computational efficiency and precision.
A Micro Genetic Algorithm with Cauchy Mutation for Mechanical Optimization Design Problems
Zhuang-Cheng Liu,Xiao-Feng Lin,Yan-Jun Shi,Hong-Fei Teng
Information Technology Journal , 2011,
Abstract: This study develops a Micro Genetic Algorithm with Cauchy mutation(MGAC) for the mechanical optimization design problems. The mechanical optimization design problems are very important optimization problems in engineering, with the characteristics of multi-variables, complex objectives and non-linear constraints. In this algorithm, the MGAC firstly employed the blend crossover operator called BLX-a to increase the global searching ability of traditional Micro Genetic Algorithm; then, the MGAC selected the Cauchy mutation operator for keeping individual diversity and solving the premature convergence. In addition, the population pool was used to reduce the blindness of the individual regeneration in the re-initialization stage. The parameter optimization design of the planetary gears transmission showed the effectiveness of the MGAC algorithm.
A Modified Artificial Bee Colony Algorithm for Vehicle Routing Problems with Time Windows
Yan-Jun Shi,Fan-Wei Meng,Guo-Jiang Shen
Information Technology Journal , 2012,
Abstract: Vehicle routing problems with time windows (VRPTW for short) is an NP-hard problem and an extension of vehicle routing problems. This study presented a heuristic algorithm (ABC-T) to deal with vehicle routing problems with time windows. The ABC-T algorithm employed the artificial bee colony algorithm (known as ABC) and improved the global search capacity with tournament selection strategy. In this algorithm, the employed bees generated the new solutions by the neighborhood search; then, based on the tournament selection strategy, the food source selection probability was settled. Finally, the new solution was generated by the onlooker bees. The tournament selection strategy was used here to enhance the global search capacity of the ABC. Compared with the state-of-the-art algorithms available in the literature, the effectiveness of this approach was showed on the Solomon’s R102 problem.
A Layout Pattern Based Particle Swarm Optimization for Constrained Packing Problems
Shi Yan-Jun,Wang Yi-Shou,Wang Long,Teng Hong-Fei
Information Technology Journal , 2012,
Abstract: A Layout Pattern Based Particle Swarm Optimization algorithm (LPPSO) is presented herein for solving the two-dimensional packing problem with constraints. In the optimizing process of LPPSO, some individuals are constructed according to non-isomorphic layout pattern and these individuals are added into the current population of Particle Swarm Optimization (PSO) algorithm to replace the bad individuals, the new population is created as a result. Moreover, a non-isomorphic layout pattern is constructed based on exact boundary line approach to avoid premature convergence and improve the computational efficiency. This study also discussed the basic idea, key problem and the process of the proposed LPPSO algorithm. Two examples of constrained packing problems showed that LPPSO was feasible and effective in the experiments.
The Effects of N-(4-hydroxyphenyl) Retinamide on Proliferation and Apoptosis of Hela Cells
Xiao-Hong Han,Yan-Jun Xue,Shi-He Shao,Xian-Qian Li
International Journal of Biology , 2011, DOI: 10.5539/ijb.v3n3p161
Abstract: To investigate the effects of N-(4-hydroxyphenyl) retinamide (4HPR) on the proliferation and apoptosis of Hela cells, the cell growth was observed by SRB test, colony-forming test and nude mice carcinogenic test. Morphologic changes of apoptosis were observed under microscopes and the normal, apoptotic and necrotic cells were identified by fluorescence staining. The biochemical features and percentage of apoptosis were performed by flow cytometry (FCM) and DNA agarose gel electrophoresis. The results of SRB test, colony-forming test and nude mice carcinogenic test showed that 4HPR could inhibit the cells proliferation in vitro and in vivo (P<0.01). The apoptotic changes and apoptosis bodies could be observed under microscopes. The fluorescence staining revealed that 4HPR could induce the cells apoptosis, not necrosis. Typical DNA ladder appeared in 4HPR-treated cells and detected by FCM, the subdiploid nuclear peak appeared on the left of G1 peak and the apoptotic percentage was correlated with 4HPR in a dose and time dependent manner(P<0.01). All these results indicated that 4HPR could inhibit the proliferation of Hela cells and induce the cells apoptosis.
Page 1 /88276
Display every page Item


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