**Commenced**in January 2007

**Frequency:**Monthly

**Edition:**International

**Paper Count:**789

# Search results for: bound states

##### 789 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.

##### 788 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.

##### 787 An Approximation Method for Three Quark Systems in the Hyper-Spherical Approach

**Authors:**
B. Rezaei,
G. R. Boroun,
M. Abdolmaleki

**Abstract:**

The bound state energy of three quark systems is studied in the framework of a non- relativistic spin independent phenomenological model. The hyper- spherical coordinates are considered for the solution this system. According to Jacobi coordinate, we determined the bound state energy for (uud) and (ddu) quark systems, as quarks are flavorless mass, and it is restrict that choice potential at low and high range in nucleon bag for a bound state.

**Keywords:**
Adiabatic expansion,
grand angular momentum,
binding energy,
perturbation,
baryons.

##### 786 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.

##### 785 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.

##### 784 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.

##### 783 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.

##### 782 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.

##### 781 Bound State Solutions of the Schrödinger Equation for Hulthen-Yukawa Potential in D-Dimensions

**Authors:**
I. Otete,
A. I. Ejere,
I. S. Okunzuwa

**Abstract:**

In this work, we used the Hulthen-Yukawa potential to obtain the bound state energy eigenvalues of the Schrödinger equation in D-dimensions within the frame work of the Nikiforov-Uvarov (NU) method. We demonstrated the graphical behaviour of the Hulthen and the Yukawa potential and investigated how the screening parameter and the potential depth affected the structure and the nature of the bound state eigenvalues. The results we obtained showed that increasing the screening parameter lowers the energy eigenvalues. Also, the eigenvalues acted as an inverse function of the potential depth. That is, increasing the potential depth reduces the energy eigenvalues.

**Keywords:**
Schrödinger's equation,
bound state,
Hulthen-Yukawa potential,
Nikiforov-Uvarov,
D-dimensions

##### 780 Eigenvalues of Particle Bound in Single and Double Delta Function Potentials through Numerical Analysis

**Authors:**
Edward Aris D. Fajardo,
Hamdi Muhyuddin D. Barra

**Abstract:**

**Keywords:**
Double Delta Potential,
Eigenstates,
Eigenvalue,
Numerov Method,
Single Delta Potential

##### 779 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.

##### 778 All-Pairs Shortest-Paths Problem for Unweighted Graphs in O(n2 log n) Time

**Authors:**
Udaya Kumar Reddy K. R,
K. Viswanathan Iyer

**Abstract:**

Given a simple connected unweighted undirected graph G = (V (G), E(G)) with |V (G)| = n and |E(G)| = m, we present a new algorithm for the all-pairs shortest-path (APSP) problem. The running time of our algorithm is in O(n2 log n). This bound is an improvement over previous best known O(n2.376) time bound of Raimund Seidel (1995) for general graphs. The algorithm presented does not rely on fast matrix multiplication. Our algorithm with slight modifications, enables us to compute the APSP problem for unweighted directed graph in time O(n2 log n), improving a previous best known O(n2.575) time bound of Uri Zwick (2002).

**Keywords:**
Distance in graphs,
Dynamic programming,
Graphalgorithms,
Shortest paths.

##### 777 Graphs with Metric Dimension Two-A Characterization

**Authors:**
Sudhakara G,
Hemanth Kumar A.R

**Abstract:**

In this paper, we define distance partition of vertex set of a graph G with reference to a vertex in it and with the help of the same, a graph with metric dimension two (i.e. β (G) = 2 ) is characterized. In the process, we develop a polynomial time algorithm that verifies if the metric dimension of a given graph G is two. The same algorithm explores all metric bases of graph G whenever β (G) = 2 . We also find a bound for cardinality of any distance partite set with reference to a given vertex, when ever β (G) = 2 . Also, in a graph G with β (G) = 2 , a bound for cardinality of any distance partite set as well as a bound for number of vertices in any sub graph H of G is obtained in terms of diam H .

**Keywords:**
Metric basis,
Distance partition,
Metric dimension.

##### 776 Some New Inequalities for Eigenvalues of the Hadamard Product and the Fan Product of Matrices

**Authors:**
Jing Li,
Guang Zhou

**Abstract:**

Let A and B be nonnegative matrices. A new upper bound on the spectral radius ρ(A◦B) is obtained. Meanwhile, a new lower bound on the smallest eigenvalue q(AB) for the Fan product, and a new lower bound on the minimum eigenvalue q(B ◦A−1) for the Hadamard product of B and A−1 of two nonsingular M-matrices A and B are given. Some results of comparison are also given in theory. To illustrate our results, numerical examples are considered.

**Keywords:**
Hadamard product,
Fan product; nonnegative matrix,
M-matrix,
Spectral radius,
Minimum eigenvalue,
1-path cover.

##### 775 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.

##### 774 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.

##### 773 Lower Bound of Time Span Product for a General Class of Signals in Fractional Fourier Domain

**Authors:**
Sukrit Shankar,
Chetana Shanta Patsa,
Jaydev Sharma

**Abstract:**

Fractional Fourier Transform is a generalization of the classical Fourier Transform which is often symbolized as the rotation in time- frequency plane. Similar to the product of time and frequency span which provides the Uncertainty Principle for the classical Fourier domain, there has not been till date an Uncertainty Principle for the Fractional Fourier domain for a generalized class of finite energy signals. Though the lower bound for the product of time and Fractional Fourier span is derived for the real signals, a tighter lower bound for a general class of signals is of practical importance, especially for the analysis of signals containing chirps. We hence formulate a mathematical derivation that gives the lower bound of time and Fractional Fourier span product. The relation proves to be utmost importance in taking the Fractional Fourier Transform with adaptive time and Fractional span resolutions for a varied class of complex signals.

**Keywords:**
Fractional Fourier Transform,
uncertainty principle,
Fractional Fourier Span,
amplitude,
phase.

##### 772 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

##### 771 Asymptotic Stability of Input-saturated System with Linear-growth-bound Disturbances via Variable Structure Control: An LMI Approach

**Authors:**
Yun Jong Choi,
Nam Woong,
PooGyeon Park

**Abstract:**

Variable Structure Control (VSC) is one of the most useful tools handling the practical system with uncertainties and disturbances. Up to now, unfortunately, not enough studies on the input-saturated system with linear-growth-bound disturbances via VSC have been presented. Therefore, this paper proposes an asymp¬totic stability condition for the system via VSC. The designed VSC controller consists of two control parts. The linear control part plays a role in stabilizing the system, and simultaneously, the nonlinear control part in rejecting the linear-growth-bound disturbances perfectly. All conditions derived in this paper are expressed with Linear Matrices Inequalities (LMIs), which can be easily solved with an LMI toolbox in MATLAB.

**Keywords:**
Input saturation,
linear-growth bounded disturbances,
linear matrix inequality (LMI),
variable structure control

##### 770 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.

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

**Authors:**
Sudipta Majumdar

**Abstract:**

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

##### 768 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.

##### 767 Parameter Selections of Fuzzy C-Means Based on Robust Analysis

**Authors:**
Kuo-Lung Wu

**Abstract:**

**Keywords:**
Fuzzy c-means,
robust,
fuzzifier.

##### 766 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.

##### 765 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.

##### 764 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

##### 763 Continuous Adaptive Robust Control for Nonlinear Uncertain Systems

**Authors:**
Dong Sang Yoo

**Abstract:**

We consider nonlinear uncertain systems such that a priori information of the uncertainties is not available. For such systems, we assume that the upper bound of the uncertainties is represented as a Fredholm integral equation of the first kind and we propose an adaptation law that is capable of estimating the upper bound and design a continuous robust control which renders nonlinear uncertain systems ultimately bounded.

**Keywords:**
Adaptive Control,
Estimation,
Fredholm Integral,
Uncertain System.

##### 762 Bounds on Reliability of Parallel Computer Interconnection Systems

**Authors:**
Ranjan Kumar Dash,
Chita Ranjan Tripathy

**Abstract:**

**Keywords:**
Parallel computer network,
reliability,
probabilisticgraph,
interconnection networks.

##### 761 Do Cultural Differences in Successful ERP Implementations Exist?

**Authors:**
Jaideep Motwani,
Asli Yagmur Akbulut

**Abstract:**

**Keywords:**
Critical Success Factors,
Culture,
Enterprise Resource Planning Systems,
India,
United States

##### 760 Volatility of Cu, Ni, Cr, Co, Pb, and As in Fluidised-Bed Combustion Chamber in Relation to Their Modes of Occurrence in Coal

**Authors:**
L. Bartoňová,
Z. Klika

**Abstract:**

Modes of occurrence of Pb, As, Cr, Co, Cu, and Ni in bituminous coal and lignite were determined by means of sequential extraction using NH4OAc, HCl, HF and HNO3 extraction solutions. Elemental affinities obtained were then evaluated in relation to volatility of these elements during the combustion of these coals in two circulating fluidised-bed power stations. It was found out that higher percentage of the elements bound in silicates brought about lower volatility, while higher elemental proportion with monosulphides association (or bound as exchangeable ion) resulted in higher volatility. The only exception was the behavior of arsenic, whose volatility depended on amount of limestone added during the combustion process (as desulphurisation additive) rather than to its association in coal.

**Keywords:**
Coal combustion,
sequential extraction,
trace elements,
volatility.