**Commenced**in January 2007

**Frequency:**Monthly

**Edition:**International

**Paper Count:**46

# Search results for: bound

##### 46 Computing the Loop Bound in Iterative Data Flow Graphs Using Natural Token Flow

**Authors:**
Ali Shatnawi

**Abstract:**

**Keywords:**
Data flow graph,
Iteration period bound,
Rateoptimalscheduling,
Recursive DSP algorithms.

##### 45 Interaction of Low-Energy Positrons with Mg Atoms: Elastic Scattering, Bound States, and Annihilation

**Authors:**
Mahasen M. Abdel-Mageed,
H. S. Zaghloul

**Abstract:**

**Keywords:**
Bound wave function,
Positron Annihilation,
scattering phase shift,
scattering length.

##### 44 Pt(IV) Complexes with Polystrene-bound Schiff Bases as Antimicrobial Agent: Synthesis and Characterization

**Authors:**
Dilek Nartop,
Nurşen Sarı,
Hatice Öğütçü

**Abstract:**

**Keywords:**
Polymer-bound Schiff bases,
polystyrene-A-NH2,
Pt(IV) complexes,
biological activity.

##### 43 Spin-Dependent Transport Signatures of Bound States: From Finger to Top Gates

**Authors:**
Yun-Hsuan Yu,
Chi-Shung Tang,
Nzar Rauf Abdullah,
Vidar Gudmundsson

**Abstract:**

**Keywords:**
Spin-orbit,
Zeeman,
top-gate,
finger-gate,
bound state.

##### 42 An Implementation of MacMahon's Partition Analysis in Ordering the Lower Bound of Processing Elements for the Algorithm of LU Decomposition

**Authors:**
Halil Snopce,
Ilir Spahiu,
Lavdrim Elmazi

**Abstract:**

A lot of Scientific and Engineering problems require the solution of large systems of linear equations of the form bAx in an effective manner. LU-Decomposition offers good choices for solving this problem. Our approach is to find the lower bound of processing elements needed for this purpose. Here is used the so called Omega calculus, as a computational method for solving problems via their corresponding Diophantine relation. From the corresponding algorithm is formed a system of linear diophantine equalities using the domain of computation which is given by the set of lattice points inside the polyhedron. Then is run the Mathematica program DiophantineGF.m. This program calculates the generating function from which is possible to find the number of solutions to the system of Diophantine equalities, which in fact gives the lower bound for the number of processors needed for the corresponding algorithm. There is given a mathematical explanation of the problem as well. Keywordsgenerating function, lattice points in polyhedron, lower bound of processor elements, system of Diophantine equationsand : calculus.

**Keywords:**
generating function,
lattice points in polyhedron,
lower bound of processor elements,
system of Diophantine equations and calculus.

##### 41 Concept of a Pseudo-Lower Bound Solution for Reinforced Concrete Slabs

**Authors:**
M. De Filippo,
J. S. Kuang

**Abstract:**

**Keywords:**
Computational mechanics,
lower bound method,
reinforced concrete slabs,
yield-line.

##### 40 Upper Bound of the Generalize p-Value for the Behrens-Fisher Problem with a Known Ratio of Variances

**Authors:**
Rada Somkhuean,
Suparat Niwitpong,
Sa-aat Niwitpong

**Abstract:**

This paper presents the generalized p-values for testing the Behrens-Fisher problem when a ratio of variance is known. We also derive a closed form expression of the upper bound of the proposed generalized p-value.

**Keywords:**
Generalized p-value,
hypothesis testing,
ratio of variances,
upper bound.

##### 39 An Efficient Algorithm for Reliability Lower Bound of Distributed Systems

**Authors:**
Mohamed H. S. Mohamed,
Yang Xiao-zong,
Liu Hong-wei,
Wu Zhi-bo

**Abstract:**

**Keywords:**
Distributed systems,
probabilistic network,
residual
connectedness reliability,
lower bound.

##### 38 Jeffrey's Prior for Unknown Sinusoidal Noise Model via Cramer-Rao Lower Bound

**Authors:**
Samuel A. Phillips,
Emmanuel A. Ayanlowo,
Rasaki O. Olanrewaju,
Olayode Fatoki

**Abstract:**

This paper employs the Jeffrey's prior technique in the process of estimating the periodograms and frequency of sinusoidal model for unknown noisy time variants or oscillating events (data) in a Bayesian setting. The non-informative Jeffrey's prior was adopted for the posterior trigonometric function of the sinusoidal model such that Cramer-Rao Lower Bound (CRLB) inference was used in carving-out the minimum variance needed to curb the invariance structure effect for unknown noisy time observational and repeated circular patterns. An average monthly oscillating temperature series measured in degree Celsius (0C) from 1901 to 2014 was subjected to the posterior solution of the unknown noisy events of the sinusoidal model via Markov Chain Monte Carlo (MCMC). It was not only deduced that two minutes period is required before completing a cycle of changing temperature from one particular degree Celsius to another but also that the sinusoidal model via the CRLB-Jeffrey's prior for unknown noisy events produced a miniature posterior Maximum A Posteriori (MAP) compare to a known noisy events.

**Keywords:**
Cramer-Rao Lower Bound (CRLB),
Jeffrey's prior,
Sinusoidal,
Maximum A Posteriori (MAP),
Markov Chain Monte
Carlo (MCMC),
Periodograms.

##### 37 Applying Branch-and-Bound and Petri Net Methods in Solving the Two-Sided Assembly Line Balancing Problem

**Authors:**
Nai-Chieh Wei,
I-Ming Chao,
Chin-Jung Liuand,
Hong Long Chen

**Abstract:**

This paper combines the branch-and-bound method and the petri net to solve the two-sided assembly line balancing problem, thus facilitating effective branching and pruning of tasks. By integrating features of the petri net, such as reachability graph and incidence matrix, the propose method can support the branch-and-bound to effectively reduce poor branches with systematic graphs. Test results suggest that using petri net in the branching process can effectively guide the system trigger process, and thus, lead to consistent results.

**Keywords:**
Branch-and-Bound Method,
Petri Net,
Two-Sided Assembly Line Balancing Problem.

##### 36 Parallel Branch and Bound Model Using Logarithmic Sampling (PBLS) for Symmetric Traveling Salesman Problem

**Authors:**
Sheikh Muhammad Azam,
Masood-ur-Rehman,
Adnan Khalid Bhatti,
Nadeem Daudpota

**Abstract:**

Very Large and/or computationally complex optimization problems sometimes require parallel or highperformance computing for achieving a reasonable time for computation. One of the most popular and most complicate problems of this family is “Traveling Salesman Problem". In this paper we have introduced a Branch & Bound based algorithm for the solution of such complicated problems. The main focus of the algorithm is to solve the “symmetric traveling salesman problem". We reviewed some of already available algorithms and felt that there is need of new algorithm which should give optimal solution or near to the optimal solution. On the basis of the use of logarithmic sampling, it was found that the proposed algorithm produced a relatively optimal solution for the problem and results excellent performance as compared with the traditional algorithms of this series.

**Keywords:**
Parallel execution,
symmetric traveling salesman problem,
branch and bound algorithm,
logarithmic sampling.

##### 35 A Branch and Bound Algorithm for Resource Constrained Project Scheduling Problem Subject to Cumulative Resources

**Authors:**
A. Shirzadeh Chaleshtari,
Sh. Shadrokh

**Abstract:**

Renewable and non-renewable resource constraints have been vast studied in theoretical fields of project scheduling problems. However, although cumulative resources are widespread in practical cases, the literature on project scheduling problems subject to these resources is scant. So in order to study this type of resources more, in this paper we use the framework of a resource constrained project scheduling problem (RCPSP) with finish-start precedence relations between activities and subject to the cumulative resources in addition to the renewable resources. We develop a branch and bound algorithm for this problem customizing precedence tree algorithm of RCPSP. We perform extensive experimental analysis on the algorithm to check its effectiveness and performance for solving different instances of the problem in question.

**Keywords:**
Resource constrained project scheduling problem,
cumulative resources,
branch and bound algorithm,
precedence tree.

##### 34 The Self-Energy of an Ellectron Bound in a Coulomb Field

**Authors:**
J. Zamastil,
V. Patkos

**Abstract:**

Recent progress in calculation of the one-loop selfenergy of the electron bound in the Coulomb field is summarized. The relativistic multipole expansion is introduced. This expansion is based on a single assumption: except for the part of the time component of the electron four-momentum corresponding to the electron rest mass, the exchange of four-momentum between the virtual electron and photon can be treated perturbatively. For non Sstates and normalized difference n3En −E1 of the S-states this itself yields very accurate results after taking the method to the third order. For the ground state the perturbation treatment of the electron virtual states with very high three-momentum is to be avoided. For these states one can always rearrange the pertinent expression in such a way that free-particle approximation is allowed. Combination of the relativistic multipole expansion and free-particle approximation yields very accurate result after taking the method to the ninth order. These results are in very good agreement with the previous results obtained by the partial wave expansion and definitely exclude the possibility that the uncertainity in determination of the proton radius comes from the uncertainity in the calculation of the one-loop selfenergy.

**Keywords:**
Hydrogen-like atoms,
self-energy.

##### 33 Identification of LTI Autonomous All Pole System Using Eigenvector Algorithm

**Authors:**
Sudipta Majumdar

**Abstract:**

**Keywords:**
MUSIC algorithm,
Cramer Rao bound,
frequency estimation.

##### 32 Behrens-Fisher Problem with One Variance Unknown

**Authors:**
Sa-aat Niwitpong,
Rada Somkhuean,
Suparat Niwitpong

**Abstract:**

This paper presents the generalized p-values for testing the Behrens-Fisher problem when one variance is unknown. We also derive a closed form expression of the upper bound of the proposed generalized p-value.

**Keywords:**
Generalized p-value,
hypothesis testing,
upper bound.

##### 31 Very-high-Precision Normalized Eigenfunctions for a Class of Schrödinger Type Equations

**Authors:**
Amna Noreen ,
Kare Olaussen

**Abstract:**

We demonstrate that it is possible to compute wave function normalization constants for a class of Schr¨odinger type equations by an algorithm which scales linearly (in the number of eigenfunction evaluations) with the desired precision P in decimals.

**Keywords:**
Eigenvalue problems,
bound states,
trapezoidal rule,
poisson resummation.

##### 30 Optimization Approaches for a Complex Dairy Farm Simulation Model

**Authors:**
Jagannath Aryal,
Don Kulasiri,
Dishi Liu

**Abstract:**

**Keywords:**
Genetic Algorithm,
Linux Cluster,
LipschitzBranch-and-Bound,
Optimization

##### 29 The Knapsack Sharing Problem: A Tree Search Exact Algorithm

**Authors:**
Mhand Hifi,
Hedi Mhalla

**Abstract:**

In this paper, we study the knapsack sharing problem, a variant of the well-known NP-Hard single knapsack problem. We investigate the use of a tree search for optimally solving the problem. The used method combines two complementary phases: a reduction interval search phase and a branch and bound procedure one. First, the reduction phase applies a polynomial reduction strategy; that is used for decomposing the problem into a series of knapsack problems. Second, the tree search procedure is applied in order to attain a set of optimal capacities characterizing the knapsack problems. Finally, the performance of the proposed optimal algorithm is evaluated on a set of instances of the literature and its runtime is compared to the best exact algorithm of the literature.

**Keywords:**
Branch and bound,
combinatorial optimization,
knap¬sack,
knapsack sharing,
heuristics,
interval reduction.

##### 28 Lower Bounds of Some Small Ramsey Numbers

**Authors:**
Decha Samana,
Vites Longani

**Abstract:**

**Keywords:**
Lower bound,
Ramsey numbers,
Graphs,
Distance line.

##### 27 Plastic Flow through Taper Dies: A Threedimensional Analysis

**Authors:**
Laxmi Narayan Patra,
Susanta Kumar Sahoo,
Mithun KumarMurmu

**Abstract:**

**Keywords:**
Extrusion,
Kinematically admissibly velocity fieldSpatial Elementary Rigid Region (SERR),
Upper Bound Analysis

##### 26 Calculation of Wave Function at the Origin (WFO) for Heavy Mesons by Numerical Solving of the Schrodinger Equation

**Authors:**
M. Momeni Feyli

**Abstract:**

**Keywords:**
Mesons,
Bound states,
Schrodinger equation,
Nonrelativistic
quark model.

##### 25 Application of Particle Image Velocimetry in the Analysis of Scale Effects in Granular Soil

**Authors:**
Zuhair Kadhim Jahanger,
S. Joseph Antony

**Abstract:**

The available studies in the literature which dealt with the scale effects of strip footings on different sand packing systematically still remain scarce. In this research, the variation of ultimate bearing capacity and deformation pattern of soil beneath strip footings of different widths under plane-strain condition on the surface of loose, medium-dense and dense sand have been systematically studied using experimental and noninvasive methods for measuring microscopic deformations. The presented analyses are based on model scale compression test analysed using Particle Image Velocimetry (PIV) technique. Upper bound analysis of the current study shows that the maximum vertical displacement of the sand under the ultimate load increases for an increase in the width of footing, but at a decreasing rate with relative density of sand, whereas the relative vertical displacement in the sand decreases for an increase in the width of the footing. A well agreement is observed between experimental results for different footing widths and relative densities. The experimental analyses have shown that there exists pronounced scale effect for strip surface footing. The bearing capacity factors *Nγ* rapidly decrease up to footing widths *B*=0.25 m, 0.35 m, and 0.65 m for loose, medium-dense and dense sand respectively, after that there is no significant decrease in *Nγ*. The deformation modes of the soil as well as the ultimate bearing capacity values have been affected by the footing widths. The obtained results could be used to improve settlement calculation of the foundation interacting with granular soil.

**Keywords:**
PIV,
granular mechanics,
scale effect,
upper bound analysis.

##### 24 Stability Bound of Ruin Probability in a Reduced Two-Dimensional Risk Model

**Authors:**
Zina Benouaret,
Djamil Aissani

**Abstract:**

**Keywords:**
Markov chain,
risk models,
ruin probabilities,
strong
stability analysis.

##### 23 The Accuracy of the Flight Derivative Estimates Derived from Flight Data

**Authors:**
Jung-hoon Lee,
Eung Tai Kim,
Byung-hee Chang,
In-hee Hwang,
Dae-sung Lee

**Abstract:**

**Keywords:**
Light Aircraft,
Flight Test,
Accuracy,
Engineering Judgment,
Scatter,
Cramer-Rao Bound

##### 22 Systematic Unit-Memory Binary Convolutional Codes from Linear Block Codes over F2r + vF2r

**Authors:**
John Mark Lampos,
Virgilio Sison

**Abstract:**

**Keywords:**
Convolutional codes,
semi-local ring,
free distance,
Heller bound.

##### 21 Long-Term Monitoring and Seasonal Analysis of PM10-Bound Benzo(a)pyrene in the Ambient Air of Northwestern Hungary

**Authors:**
Zs. Csanádi,
A. Szabó Nagy,
J. Szabó,
J. Erdős

**Abstract:**

**Keywords:**
Air quality,
benzo(a)pyrene,
PAHs,
polycyclic aromatic hydrocarbons.

##### 20 Temporal Variation of PM10-Bound Benzo(a)pyrene Concentration in an Urban and a Rural Site of Northwestern Hungary

**Authors:**
Zs. Csanádi,
A. Szabó Nagy,
J. Szabó,
J. Erdős

**Abstract:**

**Keywords:**
Air quality,
benzo(a)pyrene,
PAHs,
polycyclic
aromatic hydrocarbons.

##### 19 Two New Relative Efficiencies of Linear Weighted Regression

**Authors:**
Shuimiao Wan,
Chao Yuan,
Baoguang Tian

**Abstract:**

**Keywords:**
Linear weighted regression,
Relative efficiency,
Lower bound,
Parameter estimation.

##### 18 Evaluation of the ANN Based Nonlinear System Models in the MSE and CRLB Senses

**Authors:**
M.V Rajesh,
Archana R,
A Unnikrishnan,
R Gopikakumari,
Jeevamma Jacob

**Abstract:**

**Keywords:**
Multilayer neural networks,
Radial Basis Functions,
Clustering algorithm,
Back Propagation training,
Extended Kalmanfiltering,
Mean Square Error,
Nonlinear Modeling,
Cramer RaoLower Bound.

##### 17 A Comparison of SVM-based Criteria in Evolutionary Method for Gene Selection and Classification of Microarray Data

**Authors:**
Rameswar Debnath,
Haruhisa Takahashi

**Abstract:**

**Keywords:**
support vector machine,
generalization error-bound,
feature selection,
evolutionary algorithm,
microarray data