نتایج جستجو برای: computation capacity

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

Journal: :مهندسی عمران فردوسی 0
وحیدرضا کوهستانی محمود حسنلوراد محمدرضا بازرگان لاری

bearing capacity prediction of shallow foundation is one of the most important problems in geotechnical engineering practices, with a wide variety range of methods which have been introduced to forecast it accurately. recently, soft computing methods such as artificial neural networks (anns) and support vector machines (svms) have been used for prediction of the ultimate bearing capacity of sha...

2006
ANIMESH KUMAR

We propose to study the algebraic coding problem in computing a logical-function through an unreliable logical gate-network, where unreliable means a small probability of failure at each logical-gate. We focus on suitable encoding of the input data to a probabilistic logic network such that the noisy output can be used to decode the actual output. This is very similar to the channel coding prob...

Journal: :amirkabir international journal of electrical & electronics engineering 2013
m. badiei khuzani gh. moradi

this paper introduces a new method for accelerating current sluggish fem and improving memory demand in fem problems with high node resolution or bulky structures. like most of the numerical methods, fem results to a matrix equation which normally has huge dimension. breaking the main matrix equation into several smaller size matrices, the solving procedure can be accelerated. for implementing ...

Journal: :CoRR 2014
Kyunghyun Cho Yoshua Bengio

Many state-of-the-art results obtained with deep networks are achieved with the largest models that could be trained, and if more computation power was available, we might be able to exploit much larger datasets in order to improve generalization ability. Whereas in learning algorithms such as decision trees the ratio of capacity (e.g., the number of parameters) to computation is very favorable...

Journal: :IEICE Transactions 2011
Yuyuan Chang Kiyomichi Araki

In multiple-input multiple-output (MIMO) systems, the multiuser MIMO (MU-MIMO) systems have the potential to provide higher channel capacity owing to multiuser and spatial diversity. Block diagonalization (BD) is one of the techniques to realize MU-MIMO systems, where multiuser interference can be completely cancelled and therefore several users can be supported simultaneously. When the number ...

2014
Bo Zhang Zhenhua Huang Ziming Zheng

This paper proposes a self-organized service negotiation method for CDM in intelligent and automatic manners. It mainly includes three phases: semantic-based capacity evaluation for the CDM sponsor, trust computation of the CDM organization, and negotiation selection of the decision-making service provider (DMSP). In the first phase, the CDM sponsor produces the formal semantic description of t...

Journal: :IEICE Transactions 2005
Vicent Pla Jorge Martínez-Bauset Vicente Casares Giner

SUMMARY In this paper we propose a new algorithm for computing the optimal configuration of the Multiple Fractional Guard Channel (MFGC) admission policy in multiservice mobile wireless networks. The optimal configuration maximizes the offered traffic that the system can handle while meeting certain QoS requirements. The proposed algorithm is shown to be more efficient than previous algorithms ...

2012
Romain D. Cazé Mark D. Humphries Boris S. Gutkin

The integration of excitatory inputs in dendrites is non-linear: multiple excitatory inputs can produce a local depolarization departing from the arithmetic sum of each input’s response taken separately. If this depolarization is bigger than the arithmetic sum, the dendrite is spiking; if the depolarization is smaller, the dendrite is saturating. Decomposing a dendritic tree into independent de...

Journal: :IEEE Trans. Information Theory 1972
Richard E. Blahut

A&r&-By defining mutual information as a maximum over an appropriate space, channel capacities can be defined as double maxima and rate-distortion functions as double minima. This approach yields valuable new insights regarding the computation of channel capacities and rate-distortion functions. In particular, it suggests a simple algorithm for computing channel capacity that consists of a mapp...

2005
Justin Dauwels

We extend the Blahut-Arimoto algorithm to continuous memoryless channels by means of sequential Monte Carlo integration in conjunction with steepest descent. As an illustration, we consider the peak power constrained AWGN channel.

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

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