نتایج جستجو برای: e gap

تعداد نتایج: 1149212  

2007
Gruia Calinescu Chandra Chekuri Martin Pál Jan Vondrák

Let f : 2 → R be a non-decreasing submodular set function, and let (N, I) be a matroid. We consider the problem maxS∈I f(S). It is known that the greedy algorithm yields a 1/2-approximation [9] for this problem. It is also known, via a reduction from the max-k-cover problem, that there is no (1− 1/e+ )-approximation for any constant > 0, unless P = NP [6]. In this paper, we improve the 1/2-appr...

2014
LEI RUAN XIAOQING QUAN LIANDONG LI RONG BAI MINGKE NI RENDE XU CUNTAI ZHANG

Drug-induced torsades de pointes (TdP) is common with class III antiarrhythmic drugs. Increased transmural dispersion of repolarization (TDR) contributes significantly to the development of TdP. Gap junctions play an important role in maintaining TDR in long QT syndrome. The present study examined the effect of a gap junction enhancer, antiarrhythmic peptide 10 (AAP10), on ibutilide-induced TdP...

Journal: :IJOPCD 2015
Chiung-Wei Huang Eric Zhi-Feng Liu

The authors examine e-tutor perceptions of the star rural area e-learning project, service learning. The study employed 125 volunteer e-tutors twice per week for one semester. A survey found that e-tutors had the most positive perceptions towards teaching preparation. The results showed that only e-tutors from different grades reflected various perceptions of the star rural area e-learning proj...

2008
JR Hardy

1. What are the important gaps between evidence and clinical practice identified in the networks area of interest? .......................................................... 2 2. What is the gap between evidence and practice that the network would propose to address first?..................................................................................... 2 a) What is the best available eviden...

2012
Roni F. Banaszewski Heitor S. Lopes Cesar A. Tacla Jean M. Simão

This paper presents a comparative study among default implementations of Genetic Algorithm, Differential Evolution and Particle Swarm Optimization for load balancing, a specific case of the Generalized Assignment Problem (GAP). Differential Evolution was found the best algorithm, and it was further tested with harder GAP instances to determine its best configuration, so as to be applied to othe...

Introduction: One of the most important and challenging areas under the influence of information technology is the field of health. This pervasive influence has led to the development of electronic health (e-health) networks with a variety of services of different qualities. The issue of security management, maintaining confidentiality and data integrity, and exchanging it in a secure environme...

2002
I. Vekhter

We analyse the behavior of the density of states in a singlet s-wave superconductor with weak magnetic impurities in the clean limit by using the method of optimal fluctuation. We show that the density of states varies as lnN(E) ∝ −|E −∆0| near the mean field gap edge ∆0 in a d-dimensional superconductor. The optimal fluctuation in d > 1 is strongly anisotropic. We compare the density of states...

Journal: :Nanoscale 2010
Xi Zhang Jer-lai Kuo Mingxia Gu Ping Bai Chang Q Sun

An edge-modified tight-binding (TB) approximation has been developed, enabling us to clarify the energetic origin of the width-dependent band gap (E(G)) expansion of the armchaired and the reconstructed zigzag-edged graphene nanoribbons with and without hydrogen termination. Consistency between the TB and the density-function theory calculations affirmed that: (i) the E(G) expansion originates ...

2013
Noorihan Abdul Rahman Shamsul Sahibuddin

Problem-Based Learning (PBL) is a learning technique that involves learners with problem-solving skills and it is known to motivate learners to collaborate among themselves to work together for the best solution. This technique requires effective social interaction in order to produce the best outcome from each discussion in the learning process. Social interaction issue becomes more interestin...

Journal: :Oper. Res. Lett. 2011
Monique Laurent Antonios Varvitsiotis

Given a graph G = ([n], E) and w ∈ R , consider the integer program maxx∈{±1}n ∑ ij∈E wijxixj and its canonical semidefinite programming relaxation max ∑ ij∈E wijv T i vj , where the maximum is taken over all unit vectors vi ∈ R. The integrality gap of this relaxation is known as the Grothendieck constant κ(G) of G. We present a closed-form formula for the Grothendieck constant of K5-minor free...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید