نتایج جستجو برای: accelerated
تعداد نتایج: 61781 فیلتر نتایج به سال:
The iterative hard thresholding algorithm (IHT) is a powerful and versatile algorithm for compressed sensing and other sparse inverse problems. The standard IHT implementation faces two challenges when applied to practical problems. The step size parameter has to be chosen appropriately and, as IHT is based on a gradient descend strategy, convergence is only linear. Whilst the choice of the ste...
We present an O(n) algorithm for minimizing the number of bends in an orthogonal drawing of a plane graph. It has been posed as a long standing open problem at Graph Drawing 2003, whether the bound of O(n7/4√logn) shown by Garg and Tamassia in 1996 could be improved. To answer this question, we show how to solve the uncapacitated min-cost flow problem on a planar bidirected graph with bounded c...
Gastric body mucosal proliferation was quantified and localised under conditions of increased gastrin drive using a variety of techniques. Rats were given omeprazole 400 mumol/kg/day by gavage and after 30 days mean serum gastrin rose 11-fold (p < 0.001). Total mucosal polyamines rose 220% from 15.9 to 50.9 nmol/mg protein (p < 0.001). This was associated with a 238% increase in crypt cell prod...
Sunlight is an important cause of damage to plastics, textiles, paints, and other organic materials. Short wavelength ultraviolet light has long been recognized as being responsible for most of this damage2. Spectroradiometric measurements were made to quantify the wide variations in UV content of sunlight under the following conditions: direct summer sunlight, winter sunlight, sunlight filtere...
For Stu dents En ter ing the Oklahoma State System for Higher Ed u ca tion Sum mer 2015 through Spring 2016 GEN ERAL RE QUIRE MENTS In dus trial and Systems Engineering: Analytics A529 Bach e lor of Sci ence in In dust rial and Systems En gi neer ing/Mas ter of Sci ence (Ind. Engr.) F529 Tot al Credit Hours . . . . . . . . . . . . . . . . . . . . . . . . 152• Min i mum Re ten tion/Grad u a tion...
The time to develop new cultivars and introduce them into cultivation is an issue of major importance in plant breeding. This is because plant breeders have an urgent need to help provide solutions to feed a growing world population, while in parallel, time savings are linked to profitability. Plant breeding processes may in general be broken down into the following five key elements: (1) germp...
Drug development for life-threatening diseases is still a process in evolution. In oncology, as drugs have become more targeted, the regulatory path to drug approval has shortened, with increasing reliance on the Accelerated Approval pathway to provide early access to active agents. However, this approach is not without risks, as illustrated by the recent experience with ponatinib, a promising ...
Network embedding is to learn low-dimensional vector representations for nodes in a network. It has shown to be effective in a variety of tasks such as node classification and link prediction. While embedding algorithms on pure networks have been intensively studied, in many real-world applications, nodes are often accompanied with a rich set of attributes or features, aka attributed networks. ...
Fast corner-detector algorithms are important for achieving real time in different computer vision applications. In this paper, we present new algorithm implementations for corner detection that make use of graphics processing units (GPU) provided by commodity hardware. The programmable capabilities of modern GPUs allow speeding up counterpart CPU algorithms. In the case of corner-detector algo...
22 Accelerated forgetting in TEA 2 Transient Epileptic Amnesia (TEA) is a form of temporal lobe epilepsy associated with 23 ictal and interictal memory disturbance. Some patients with TEA exhibit Accelerated 24 Long-term Forgetting (ALF), in which memory for verbal and non-verbal material is 25 retained normally over short delays but fades at an unusually rapid rate over days to 26 weeks. This ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید