oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2019 ( 12 )

2018 ( 8 )

2017 ( 7 )

2016 ( 7 )

Custom range...

Search Results: 1 - 10 of 4309 matches for " Minghao Sim "
All listed articles are free for downloading (OA Articles)
Page 1 /4309
Display every page Item
Carbon Nanotubes Based Glucose Needle-type Biosensor
Jinyan Jia,Wenjun Guan,Minghao Sim,Yongquan Li,Hong Li
Sensors , 2008, DOI: 10.3390/s8031712
Abstract: A novel needle-type biosensor based on carbon nanotubes is reported. Thebiosensor was prepared by packing a mixture of multi-wall carbon nanotubes (MWCNTs),graphite powder and glucose oxidase (Gox) freeze-dried powder into a glass capillary of 0.5mm inner diameter. The resulting amperometric biosensor was characterizedelectrochemically using amperometry in the presence of hydrogen peroxide and in thepresence of glucose. The glucose biosensor sensitivity was influenced by the glucoseoxidase concentration within the MWCNTs mixture. The optimized glucose needle-typebiosensor displayed better sensitivity and stability, and a detected range of up to 20 mM.Based on its favorable stability, the needle biosensor was first time used in real-timemonitoring system as a kind of online glucose detector. The decay of current response isless than 10% after 24-hour continuous observation.
Carbon Nanotubes Based Glucose Needle-type Biosensor
Jinyan Jia,Wenjun Guan,Minghao Sim,Yongquan Li
Sensors , 2008,
Abstract: A novel needle-type biosensor based on carbon nanotubes is reported. Thebiosensor was prepared by packing a mixture of multi-wall carbon nanotubes (MWCNTs),graphite powder and glucose oxidase (Gox) freeze-dried powder into a glass capillary of 0.5mm inner diameter. The resulting amperometric biosensor was characterizedelectrochemically using amperometry in the presence of hydrogen peroxide and in thepresence of glucose. The glucose biosensor sensitivity was influenced by the glucoseoxidase concentration within the MWCNTs mixture. The optimized glucose needle-typebiosensor displayed better sensitivity and stability, and a detected range of up to 20 mM.Based on its favorable stability, the needle biosensor was first time used in real-timemonitoring system as a kind of online glucose detector. The decay of current response isless than 10% after 24-hour continuous observation.
Worst-Case Upper Bound for (1, 2)-QSAT
Minghao Yin
Computer Science , 2011,
Abstract: The rigorous theoretical analysis of the algorithm for a subclass of QSAT, i.e. (1, 2)-QSAT, has been proposed in the literature. (1, 2)-QSAT, first introduced in SAT'08, can be seen as quantified extended 2-CNF formulas. Until now, within our knowledge, there exists no algorithm presenting the worst upper bound for (1, 2)-QSAT. Therefore in this paper, we present an exact algorithm to solve (1, 2)-QSAT. By analyzing the algorithms, we obtain a worst-case upper bound O(1.4142m), where m is the number of clauses.
Hybrid Differential Evolution with Biogeography-Based Optimization for Design of a Reconfigurable Antenna Array with Discrete Phase Shifters
Xiangtao Li,Minghao Yin
International Journal of Antennas and Propagation , 2011, DOI: 10.1155/2011/685629
Abstract: Multibeam antenna arrays have important applications in communications and radar. This paper presents a new method of designing a reconfigurable antenna with quantized phase excitations using a new hybrid algorithm, called DE/BBO. The reconfigurable design problem is to find the element excitation that will result in a sector pattern main beam with low sidelobes with additional requirement that the same excitation amplitudes applied to the array with zero-phase should be in a high directivity, low sidelobe pencil-shaped main beam. In order to reduce the effect of mutual coupling between the antenna-array elements, the dynamic range ratio is minimized. Additionally, compared with the continuous realization and subsequent quantization, experimental results indicate that the performance of the discrete realization of the phase excitation value can be improved. In order to test the performances of hybrid differential evolution with biogeography-based optimization, the results of some state-of-art algorithms are considered, for the purposed of comparison. Experiment results indicate the better performance of the DE/BBO. 1. Introduction The problem of reconfigurable antenna arrays involves radiating multiple patterns using a single power-divided network. In the past decades, this problem has been one of the most active and prolific research areas since the pioneering work of Bucci et al. [1, 2]. Moreover, this problem has also been a central and well-studied problem with a strong engineering background in the field of manufacturing and telecommunications science [3, 4]. In order to solve this problem, many methodologies have been proposed to obtain the multipattern arrays in previous literature [4–8]. Traditionally, exact algorithms such as branch and bound method and mixed-integer linear programming method have been widely used in early days to solve the problem. However, because the computational time of these methods is always unacceptable, these methods can only solve problems of relatively small size. On the other hand, evolutionary algorithms perform population-based probabilistic searches with a high speed of convergence rate and have been proved very successful in solving problems of large scale. When it comes to solving reconfigurable antenna problems, compared with traditional algorithms, evolutionary algorithms have the ability of obtaining excitation phases and amplitudes that can be practically implemented more easily by imposing additional constraints. So it is not uncommon, in the past decade, to see that different kinds of evolutionary
Design of a Reconfigurable Antenna Array with Discrete Phase Shifters Using Differential Evolution Algorithm
Xiangtao Li;Minghao Yin
PIER B , 2011, DOI: 10.2528/PIERB11032902
Abstract: The reconfigurable design problem is to find the element that will result in a sector pattern main beam with side lobes. The same excitation amplitudes apply to the array with zero-phase that should be in a high directivity, low side lobe pencil shaped main beam. Multi-beam antenna arrays have important applications in communications and radar. This paper presents a new method of designing a reconfigurable antenna array with quantized phase excitations using a new evolutionary algorithm called differential evolution (DE). In order to reduce the effect of mutual coupling among the antenna-array elements, the dynamic range ratio is minimized. Additionally, compared with the continuous realization and subsequent quantization, experimental results indicate better performance of the discrete realization of the phase-excitation value of the proposed algorithm.
SoccerCode: A Game System for Introductory Programming Courses in Computer Science
Minghao Wang,Xiaolin Hu
Lecture Notes in Engineering and Computer Science , 2011,
Abstract:
Application of Differential Evolution Algorithm on Self-Potential Data
Xiangtao Li, Minghao Yin
PLOS ONE , 2012, DOI: 10.1371/journal.pone.0051199
Abstract: Differential evolution (DE) is a population based evolutionary algorithm widely used for solving multidimensional global optimization problems over continuous spaces, and has been successfully used to solve several kinds of problems. In this paper, differential evolution is used for quantitative interpretation of self-potential data in geophysics. Six parameters are estimated including the electrical dipole moment, the depth of the source, the distance from the origin, the polarization angle and the regional coefficients. This study considers three kinds of data from Turkey: noise-free data, contaminated synthetic data, and Field example. The differential evolution and the corresponding model parameters are constructed as regards the number of the generations. Then, we show the vibration of the parameters at the vicinity of the low misfit area. Moreover, we show how the frequency distribution of each parameter is related to the number of the DE iteration. Experimental results show the DE can be used for solving the quantitative interpretation of self-potential data efficiently compared with previous methods.
Spectral tuning of multimode three-dimensional photonic crystal cavities for enhanced anti-Stokes Raman scattering
Jing Ouyang,Minghao Qi
Physics , 2010,
Abstract: Multimode hollow microcavities in three-dimensional (3D) photonic crystals (PhCs) are designed for achieving enhanced coherent anti-Stokes Raman scattering, which requires a cavity to have three high quality-factor (Q) modes with equally spaced resonant frequencies. Cavities in 3D PhCs allows more flexibility in design and tuning than their 2D slab counterparts, since radiation loss that degrades Q can be suppressed by the 3D photonic band gap. We first tune all the mode frequencies simultaneously by changing the material and geometry of the cavity based on perturbation theory. Spectral spacings between the multiple modes are adjusted according to the symmetry, volume and field distribution of their mode profiles. The frequency and field distribution of the resonant modes are computed by solving Maxwell's equations in the frequency domain.
Phase Transitions of Plan Modification in Conformant Planning
Junping Zhou,Minghao Yin
Computer Science , 2010,
Abstract: We explore phase transitions of plan modification, which mainly focus on the conformant planning problems. By analyzing features of plan modification in conformant planning problems, quantitative results are obtained. If the number of operators is less than, almost all conformant planning problems can't be solved with plan modification. If the number of operators is more than, almost all conformant planning problems can be solved with plan modification. The results of the experiments also show that there exists an experimental threshold of density (ratio of number of operators to number of propositions), which separates the region where almost all conformant planning problems can't be solved with plan modification from the region where almost all conformant planning problems can be solved with plan modification.
New Worst-Case Upper Bound for X3SAT
Junping Zhou,Minghao Yin
Computer Science , 2011,
Abstract: The rigorous theoretical analyses of algorithms for exact 3-satisfiability (X3SAT) have been proposed in the literature. As we know, previous algorithms for solving X3SAT have been analyzed only regarding the number of variables as the parameter. However, the time complexity for solving X3SAT instances depends not only on the number of variables, but also on the number of clauses. Therefore, it is significant to exploit the time complexity from the other point of view, i.e. the number of clauses. In this paper, we present algorithms for solving X3SAT with rigorous complexity analyses using the number of clauses as the parameter. By analyzing the algorithms, we obtain the new worst-case upper bounds O(1.15855m), where m is the number of clauses.
Page 1 /4309
Display every page Item


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