3,153 research outputs found

    Modified Kedem-Katchalsky equations for osmosis through nano-pore

    Full text link
    This work presents a modified Kedem-Katchalsky equations for osmosis through nano-pore. osmotic reflection coefficient of a solute was found to be chiefly affected by the entrance of the pore while filtration reflection coefficient can be affected by both the entrance and the internal structure of the pore. Using an analytical method, we get the quantitative relationship between osmotic reflection coefficient and the molecule size. The model is verified by comparing the theoretical results with the reported experimental data of aquaporin osmosis. Our work is expected to pave the way for a better understanding of osmosis in bio-system and to give us new ideas in designing new membranes with better performance.Comment: 19 pages, 4 figure

    On Feedback Vertex Set: New Measure and New Structures

    Full text link
    We present a new parameterized algorithm for the {feedback vertex set} problem ({\sc fvs}) on undirected graphs. We approach the problem by considering a variation of it, the {disjoint feedback vertex set} problem ({\sc disjoint-fvs}), which finds a feedback vertex set of size kk that has no overlap with a given feedback vertex set FF of the graph GG. We develop an improved kernelization algorithm for {\sc disjoint-fvs} and show that {\sc disjoint-fvs} can be solved in polynomial time when all vertices in GFG \setminus F have degrees upper bounded by three. We then propose a new branch-and-search process on {\sc disjoint-fvs}, and introduce a new branch-and-search measure. The process effectively reduces a given graph to a graph on which {\sc disjoint-fvs} becomes polynomial-time solvable, and the new measure more accurately evaluates the efficiency of the process. These algorithmic and combinatorial studies enable us to develop an O(3.83k)O^*(3.83^k)-time parameterized algorithm for the general {\sc fvs} problem, improving all previous algorithms for the problem.Comment: Final version, to appear in Algorithmic

    First Evaluation of the Climatological Calibration Algorithm in the Real-time TMPA Precipitation Estimates over Two Basins at High and Low Latitudes

    Get PDF
    The TRMM Multi-satellite Precipitation Analysis (TMPA) system underwent a crucial upgrade in early 2009 to include a climatological calibration algorithm (CCA) to its realtime product 3B42RT, and this algorithm will continue to be applied in the future Global Precipitation Measurement era constellation precipitation products. In this study, efforts are focused on the comparison and validation of the Version 6 3B42RT estimates before and after the climatological calibration is applied. The evaluation is accomplished using independent rain gauge networks located within the high-latitude Laohahe basin and the low-latitude Mishui basin, both in China. The analyses indicate the CCA can effectively reduce the systematic errors over the low-latitude Mishui basin but misrepresent the intensity distribution pattern of medium-high rain rates. This behavior could adversely affect TMPA's hydrological applications, especially for extreme events (e.g., floods and landslides). Results also show that the CCA tends to perform slightly worse, in particular, during summer and winter, over the high-latitude Laohahe basin. This is possibly due to the simplified calibration-processing scheme in the CCA that directly applies the climatological calibrators developed within 40 degrees latitude to the latitude belts of 40 degrees N-50 degrees N. Caution should therefore be exercised when using the calibrated 3B42RT for heavy rainfall-related flood forecasting (or landslide warning) over high-latitude regions, as the employment of the smooth-fill scheme in the CCA bias correction could homogenize the varying rainstorm characteristics. Finally, this study highlights that accurate detection and estimation of snow at high latitudes is still a challenging task for the future development of satellite precipitation retrievals
    corecore