نتایج جستجو برای: bound ary value problems

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

F. Moeen Moghadas

We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 queueing system. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these ...

In this paper, the new notions of ``belongingness ($in_{gamma}$)"and ``quasi-coincidence ($q_delta$)"  of a fuzzy point with a fuzzyset are  introduced. By means of this new idea, the  concept of$(alpha,beta)$-fuzzy $n$-ary subhypergroup of an $n$-aryhypergroup is given, where $alpha,betain{in_{gamma}, q_{delta},in_{gamma}wedge q_{delta}, ivq}$,  andit is shown that, in 16 kinds of $(alpha,beta...

2014
Zhaneta Tasheva

One of the most important problems in the sequence design is to find sequences with good correlation properties. Recently, expect for the binary Pseudo-Random Sequences (PRSs), much progress has been obtained for ternary and p-ary PRSs. In this paper a short survey of p-ary PRSs and their properties is made. As a result their classification is suggested without claiming its full completeness.

Fuzzy rough n-ary subhypergroups are introduced and characterized.

2004
Chih-Chun Wang Sanjeev R. Kulkarni H. Vincent Poor

This paper focuses on finite-dimensional upper and lower bounds on decodable thresholds of Z m and binary LDPC codes, assuming belief propagation decoding on memoryless channels. Two noise measures will be considered: the Bhattacharyya noise parameter and the soft bit value for a MAP decoder on the uncoded channel. For Z m LDPC codes, an iterative m-dimensional bound is derived for m-ary-input/...

2006
R. Ahlswede H. Aydinian L. H. Khachatrian

q–ary codes capable of correcting all unidirectional errors of certain level 1 ≤ l ≤ q − 2 are considered. We also discuss some related extremal combinatorial problems.

In this paper a robust and accurate algorithm based on Haar wavelet collocation method (HWCM) is proposed for solving eighth order boundary value problems. We used the Haar direct method for calculating multiple integrals of Haar functions. To illustrate the efficiency and accuracy of the concerned method, few examples are considered which arise in the mathematical modeling of fluid dynamics an...

پایان نامه :وزارت علوم، تحقیقات و فناوری - پژوهشگاه دانشهای بنیادی (مرکز تحقیقات فیزیک نظری و 1387

we show that when both sources ( lepton flavor violation sources and cp-violating phases) are present, the electric dipole moment of the electron, $d_e$, receives a contribution from the phase of the trilinear $a$-term of staus, $phi_{a_ au}$. for $phi_{a_ au}=pi/2$, the value of $d_e$, depending on the ratios of the lfv mass elements, can range between zero and three orders of magnitude a...

Journal: :international journal of mathematical modelling and computations 0
omar el khayyari faculty of science and technology university hassan first, settat morocco morocco abdellah lamnii faculty of science and technology, university hassan first, settat morocco jaoud dabounou faculty of science and technology, university hassan first, settat morocco

by using the trigonometric uniform splines of order 3 with a real tension factor, a numericalmethod is developed for solving a linear second order boundary value problems (2vbp) withdirichlet, neumann and cauchy types boundary conditions. the moment at the knots isapproximated by central finite-difference method. the order of convergence of the methodand the theory is illustrated by solving tes...

2004
Ruud Pellikaan Xin-Wen Wu

The q-ary Reed-Muller codes RMq(u,m) of length n = q are a generalization of Reed-Solomon codes, which use polynomials in m variables to encode messages through functional encoding. Using an idea of reducing the multivariate case to the univariate case, randomized list-decoding algorithms for Reed-Muller codes were given in [1] and [15]. The algorithm in [15] is an improvement of the algorithm ...

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

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