نتایج جستجو برای: epsilon constraint method
تعداد نتایج: 1698990 فیلتر نتایج به سال:
Poly(epsilon-caprolactone)-poly(ethylene glycol) (PECL) copolymers were synthesized from polyethylene glycol (PEG) and epsilon-caprolactone (epsilon-CL) using stannous octoate as catalyst at 160 degrees C by bulk polymerization. The effect of the molecular weight of PEG and the copolymer ratio on the properties of the copolymers was investigated by (1)H-NMR, IR, DSC and GPC. PCL and PECL micros...
We propose a machine learning framework based on sliding windows for glaucoma diagnosis. In digital fundus photographs, our method automatically localizes the optic cup, which is the primary structural image cue for clinically identifying glaucoma. This localization uses a bundle of sliding windows of different sizes to obtain cup candidates in each disc image, then extracts from each sliding w...
During the last decade, the stringent pressures from environmental and social requirements have spurred an interest in designing a reverse logistics (RL) network. The success of a logistics system may depend on the decisions of the facilities locations and vehicle routings. The location-routing problem (LRP) simultaneously locates the facilities and designs the travel routes for vehicles among ...
Inversion of magnetic data is an important step towards interpretation of the practical data. Smooth inversion is a common technique for the inversion of data. Physical bound constraint can improve the solution to the magnetic inverse problem. However, how to introduce the bound constraint into the inversion procedure is important. Imposing bound constraint makes the magnetic data inversion a n...
By defining functional defects in a congenital myasthenic syndrome (CMS), we show that two mutant residues, located in a binding site region of the acetylcholine receptor (AChR) epsilon subunit, exert opposite effects on ACh binding and suppress channel gating. Single channel kinetic analysis reveals that the first mutation, epsilon N182Y, increases ACh affinity for receptors in the resting clo...
Error bound analysis, which estimates the distance of a point to solution set an optimization problem4 using optimality residual, is powerful tool for analysis first-order algorithms. In this paper, we use global error study iteration complexity algorithm linearly constrained nonconvex minimization problem. We develop dual regularized version problem by novel “decomposition” technique. Equipped...
Abstract Intense competition in today’s market and quick change customer preferences, along with the rapid development of technology globalization, have forced companies to work as members a supply chain instead individual companies. The success depends on integration coordination all its institutions form an efficient network structure. An leads cost savings throughout helps it respond needs f...
We study a new method in reducing the roundo error in computing derivatives using Chebyshev collocation methods. By using a grid mapping derived by Koslo and Tal-Ezer, and the proper choice of the parameter , the roundo error of the k-th derivative can be reduced from O(N2k) to O((N jln j)k), where is the machine precision and N is the number of collocation points. This drastic reduction of rou...
We study a new method in reducing the roundo error in computing derivatives using Chebyshev collocation methods. By using a grid mapping derived by Koslo and Tal-Ezer, and the proper choice of the parameter , the roundo error of the k-th derivative can be reduced from O(N) to O((N jln j)k), where is the machine precision and N is the number of collocation points. This drastic reduction of round...
We study several sufficient conditions for the existence of a LévyKhinchin decomposition of generating functionals on unital involutive algebras with a fixed character. We show that none of these conditions are equivalent and we show that such a decomposition does not always exist.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید