http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Peripheral Defocus and Myopia Management: A Mini-Review
Nir Erdinest(Nir Erdinest ),Naomi London(Naomi London ),Itay Lavy(Itay Lavy ),David Berkow(David Berkow ),David Landau(David Landau ),Yair Morad(Yair Morad ),Nadav Levinger(Nadav Levinger ) 대한안과학회 2023 Korean Journal of Ophthalmology Vol.37 No.1
Myopia is the most common refractive error in the world, and its’ prevalence continually increases. The potential pathological and visual complications of progressive myopia have inspired researchers to study the sources of myopia, axial elongation, and explore modalities to arrest progression. Considerable attention has been given over the past few years to the myopia risk factor known as hyperopic peripheral blur, the focus of this review. The primary theories currently believed to be the cause of myopia, the parameters considered to contribute and influence the effect of peripheral blur, such as the surface retinal area or depth of blur will be discussed. The currently available optical devices designed to provide peripheral myopic defocus will be discussed, including bifocal and progressive addition ophthalmic lenses, peripheral defocus single vision ophthalmic lenses, orthokeratology lenses, and bifocal or multifocal center distance soft lenses, as well as their effectivity as mentioned in the literature to date.
Efficient algorithms for consensus string problems minimizing both distance sum and radius
Amir, Amihood,Landau, Gad M.,Na, Joong Chae,Park, Heejin,Park, Kunsoo,Sim, Jeong Seop Elsevier 2011 Theoretical computer science Vol.412 No.39
<P><B>Abstract</B></P><P>The consensus (string) problem is finding a representative string, called a consensus, of a given set S of strings. In this paper we deal with consensus problems considering both distance sum and radius, where the distance sum is the sum of (Hamming) distances from the strings in S to the consensus and the radius is the longest (Hamming) distance from the strings in S to the consensus. Although there have been results considering either distance sum or radius, there have been no results considering both, to the best of our knowledge.</P><P>We present the first algorithms for two consensus problems considering both distance sum and radius for three strings: one problem is to find an optimal consensus minimizing both distance sum and radius. The other problem is to find a bounded consensus such that the distance sum is at most s and the radius is at most r for given constants s and r. Our algorithms are based on characterization of the lower bounds of distance sum and radius, and thus they solve the problems efficiently. Both algorithms run in linear time.</P>
Julio Wainstein,Zohar Landau,Yosefa Bar Dayan,Daniela Jakubowicz,Torsten Grothe,Tania Perrinjaquet-Moccetti,Mona Boaz 한국식품영양과학회 2016 Journal of medicinal food Vol.19 No.2
Purslane extract (PE) is derived from Portulaca oleracea L., a medicinal plant used in traditional medicine for its antidiabetic properties. This randomized, placebo-controlled clinical trial was designed to evaluate the efficacy and safety of PE in improving glucose control, blood pressure, and lipid profile in adults with type 2 diabetes mellitus (T2DM) treated with a single oral hypoglycemic agent at baseline. Subjects were randomized to treatment with three capsules of PE/day or a matched placebo. Change from baseline to the week 12 end-of-follow-up visit measures of glucose homeostasis, hemodynamics, and lipid profile was compared by treatment assignment. In addition, these measures were evaluated in a subgroup of ‘‘responders,’’ defined as patients whose week 12 HbA1c was lower than baseline values, regardless of treatment assignment. This group was further assessed in subgroups of baseline oral hypoglycemic treatment. A total of 63 participants were treated with either PE (n = 31, 11 females, mean age 52.4 ± 7.9 years) or matched placebo (n = 32, 11 females, mean age 58.3 ± 10.8 years). In the total cohort, systolic blood pressure declined significantly more in the PE group than the placebo group: -7.5 ± 5.0 versus -0.01 ± 0.3 mmHg, P < .0001. In the responders’ subgroup, HbA1c declined significantly more in the PE group than the placebo group: -0.8% ± 0.4% versus -0.6% ± 0.5%, P = .03. Few adverse events were reported. These were mild and did not differ by treatment assignment. PE appears to be a safe, adjunct treatment for T2DM, significantly reducing systolic blood pressure in the total cohort and HbA1c in the subgroup of responders.
Hen Ohayon Dahan,Miron V. Landau,Moti Herskowitz 한국공업화학회 2021 Journal of Industrial and Engineering Chemistry Vol.95 No.-
ZnxZryOz and modified MuZnxZryOz (M = Si, W, Sc, Mg)/ Zn/(W-Zr) catalysts were studied in conversion ofhydrous (4 wt% H2O) ethanol at P =15 bar, T = 450 C and WHSV = 0.8-7.9 h-1. The basicity of the catalystschanged from 0.015 to 0.66 mmol/g and the acidity from 0.07 to 0.24 mmol/g resulting in a wide range ofbasicity/acidity ratio (R) of 1.3 to 7.3. Measurements of the catalysts activity, selectivity and stabilityindicate a strong dependency on the R-value. The yield of organic liquid C5-C11 increased from 17 wt% to59 wt% while the yield of light olefins C2-C4 decreased from 60 wt% to 14 wt%, as R increased from 1.3 to7.3. The content of C5-C11 iso-olefins and aromatics in organic liquid on ZnxZryOz (R = 3.9), WuZnxZryOz(R = 2.0) and MguZnxZryOz (R = 7.3) increased significantly with the residence time. ZnxZryOz was stableup to 360 h on stream, while the activity and selectivity of MguZnxZryOz and WuZnxZryOz altered after90 h on stream due to coke deposition blocking the acid and basic sites. It was proposed a comprehensivescheme of ethanol transformations routes consistent with the measured effects of the residence time,catalysts R-value and time on stream on the products distribution.
Computing similarity of run-length encoded strings with affine gap penalty
Kim, J.W.,Amir, A.,Landau, G.M.,Park, K. North-Holland Pub. Co ; Elsevier Science Ltd 2008 Theoretical computer science Vol.395 No.2
The problem of computing the similarity of two run-length encoded strings has been studied for various scoring metrics. Many algorithms have been developed for the longest common subsequence metric and some algorithms for the Levenshtein distance metric and the weighted edit distance metric. In this paper we consider similarity based on the affine gap penalty metric which is a more general and rather complicated scoring metric than the weighted edit distance. To compute the similarity in this model efficiently, we convert the problem into a path problem on a directed acyclic graph and use some properties of maximum paths in this graph. We present an O(nm<SUP>'</SUP>+n<SUP>'</SUP>m) time algorithm for computing the similarity of two run-length encoded strings in the affine gap penalty model, where n and m are the lengths of given two strings whose run-length encoded lengths are n<SUP>'</SUP> and m<SUP>'</SUP>, respectively.
Federated Filter Approach for GNSS Network Processing
Xiaoming Chen,Ulrich Vollath,Herbert Landau 한국항해항만학회 2006 한국항해항만학회 학술대회논문집 Vol.1 No.-
Abstract A large number of service providers in countries all over the world have established GNSS reference station networks in the last years and are using network software today to provide a correction stream to the user as a routine service. In current GNSS network processing, all the geometric related information such as ionospheric free carrier phase ambiguities from all stations and satellites, tropospheric effects, orbit errors, receiver and satellite clock errors are estimated in one centralized Kalman filter. Although this approach provides an optimal solution to the estimation problem, however, the processing time increases cubically with the number of reference stations in the network. Until now one single Personal Computer with Pentium 3.06 GHz CPU can only process data from a network consisting of no more than 50 stations in real time. In order to process data for larger networks in real time and to lower the computational load, a federated filter approach can be considered. The main benefit of this approach is that each local filter runs with reduced number of states and the computation time for the whole system increases only linearly with the number of local sensors, thus significantly reduces the computational load compared to the centralized filter approach. This paper presents the technical aspect and performance analysis of the federated filter approach. Test results show that for a network of 100 reference stations, with the centralized approach, the network processing including ionospheric modeling and network ambiguity fixing needs approximately 60 hours to process 24 hours network data in a 3.06 GHz computer, which means it is impossible to run this network in real time. With the federated filter approach, only less than 1 hour is needed, 66 times faster than the centralized filter approach. The availability and reliability of network processing remain at the same high level.