**Commenced**in January 2007

**Frequency:**Monthly

**Edition:**International

**Paper Count:**456

# Search results for: Upper bound

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

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

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

**Authors:**
Kuo-Lung Wu

**Abstract:**

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

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

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

##### 451 Some New Upper Bounds for the Spectral Radius of Iterative Matrices

**Authors:**
Guangbin Wang,
Xue Li,
Fuping Tan

**Abstract:**

**Keywords:**
doubly α diagonally dominant matrix,
eigenvalue,
iterative matrix,
spectral radius,
upper bound.

##### 450 Limit Analysis of FGM Circular Plates Subjected to Arbitrary Rotational Symmetric Loads

**Authors:**
Kargarnovin M.H.,
Faghidian S. A,
Arghavani J.

**Abstract:**

**Keywords:**
Circular plate,
FGM circular plate,
Limit analysis,
Lower and Upper bound theorems.

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

##### 448 The Study of Relative Efficiency in Growth Curve Model

**Authors:**
Nan Chen,
Baoguang Tian

**Abstract:**

In this paper, some relative efficiency have been discussed, including the LSE estimate with respect to BLUE in curve model. Four new kinds of relative efficiency have defined, and their upper bounds have been discussed.

**Keywords:**
Relative efficiency,
LSE estimate,
BLUE estimate,
Upper bound,
Curve model.

##### 447 Extreme Temperature Forecast in Mbonge, Cameroon through Return Level Analysis of the Generalized Extreme Value (GEV) Distribution

**Authors:**
Nkongho Ayuketang Arreyndip,
Ebobenow Joseph

**Abstract:**

**Keywords:**
Return level,
Generalized extreme value (GEV),
Meteorology,
Forecasting.

##### 446 Usage-based Traffic Control for P2P Content Delivery

**Authors:**
Megumi Shibuya,
Tomohiko Ogishi

**Abstract:**

**Keywords:**
P2P,
traffic control,
traffic localization,
ALTO.

##### 445 The Relative Efficiency of Parameter Estimation in Linear Weighted Regression

**Authors:**
Baoguang Tian,
Nan Chen

**Abstract:**

A new relative efficiency in linear model in reference is instructed into the linear weighted regression, and its upper and lower bound are proposed. In the linear weighted regression model, for the best linear unbiased estimation of mean matrix respect to the least-squares estimation, two new relative efficiencies are given, and their upper and lower bounds are also studied.

**Keywords:**
Linear weighted regression,
Relative efficiency,
Mean matrix,
Trace.

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

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

**Abstract:**

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

##### 443 New Delay-Dependent Stability Criteria for Neural Networks With Two Additive Time-varying Delay Components

**Authors:**
Xingyuan Qu,
Shouming Zhong

**Abstract:**

In this paper, the problem of stability criteria of neural networks (NNs) with two-additive time-varying delay compenents is investigated. The relationship between the time-varying delay and its lower and upper bounds is taken into account when estimating the upper bound of the derivative of Lyapunov functional. As a result, some improved delay stability criteria for NNs with two-additive time-varying delay components are proposed. Finally, a numerical example is given to illustrate the effectiveness of the proposed method.

**Keywords:**
Delay-dependent stability,
time-varying delays,
Lyapunov functional,
linear matrix inequality (LMI).

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

##### 441 Discovering Liouville-Type Problems for p-Energy Minimizing Maps in Closed Half-Ellipsoids by Calculus Variation Method

**Authors:**
Lina Wu,
Jia Liu,
Ye Li

**Abstract:**

**Keywords:**
Bochner Formula,
Stokes’ Theorem,
Cauchy-Schwarz
Inequality,
first and second variation formulas,
Hardy-Sobolev type
inequalities,
Liouville-type problem,
p-harmonic map.

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

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

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

##### 437 Subclasses of Bi-Univalent Functions Associated with Hohlov Operator

**Authors:**
Rashidah Omar,
Suzeini Abdul Halim,
Aini Janteng

**Abstract:**

The coefficients estimate problem for Taylor-Maclaurin series is still an open problem especially for a function in the subclass of bi-univalent functions. A function *f *ϵ* A *is said to be bi-univalent in the open unit disk *D* if both *f *and *f ^{-1}* are univalent in

*D*. The symbol

*A*denotes the class of all analytic functions

*f*in

*D*and it is normalized by the conditions

*f*(0) =

*f’*(0) – 1=0. The class of bi-univalent is denoted by The subordination concept is used in determining second and third Taylor-Maclaurin coefficients. The upper bound for second and third coefficients is estimated for functions in the subclasses of bi-univalent functions which are subordinated to the function φ. An analytic function

*f*is subordinate to an analytic function

*g*if there is an analytic function

*w*defined on

*D*with

*w*(0) = 0 and |

*w*(z)| < 1 satisfying

*f*(

*z*) =

*g*[

*w*(

*z*)]. In this paper, two subclasses of bi-univalent functions associated with Hohlov operator are introduced. The bound for second and third coefficients of functions in these subclasses is determined using subordination. The findings would generalize the previous related works of several earlier authors.

**Keywords:**
Analytic functions,
bi-univalent functions,
Hohlov operator,
subordination.

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

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

##### 434 A Hyperbolic Characterization of Projective Klingenberg Planes

**Authors:**
Basri Çelik

**Abstract:**

**Keywords:**
Hyperbolic planes,
Klingenberg planes,
Projective
planes.

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

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

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

##### 430 The Extremal Graph with the Largest Merrifield-Simmons Index of (n, n + 2)-graphs

**Authors:**
M. S. Haghighat,
A. Dolati,
M. Tabari,
E. Mohseni

**Abstract:**

The Merrifield-Simmons index of a graph G is defined as the total number of its independent sets. A (n, n + 2)-graph is a connected simple graph with n vertices and n + 2 edges. In this paper we characterize the (n, n+2)-graph with the largest Merrifield- Simmons index. We show that its Merrifield-Simmons index i.e. the upper bound of the Merrifield-Simmons index of the (n, n+2)-graphs is 9 × 2n-5 +1 for n ≥ 5.

**Keywords:**
Merrifield-Simmons index,
(n,
n+2)-graph.

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

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

##### 427 Estimation of the Upper Tail Dependence Coefficient for Insurance Loss Data Using an Empirical Copula-Based Approach

**Authors:**
Adrian O’Hagan,
Robert McLoughlin

**Abstract:**

Considerable focus in the world of insurance risk quantification is placed on modeling loss values from lines of business (LOBs) that possess upper tail dependence. Copulas such as the Joe, Gumbel and Student-t copula may be used for this purpose. The copula structure imparts a desired level of tail dependence on the joint distribution of claims from the different LOBs. Alternatively, practitioners may possess historical or simulated data that already exhibit upper tail dependence, through the impact of catastrophe events such as hurricanes or earthquakes. In these circumstances, it is not desirable to induce additional upper tail dependence when modeling the joint distribution of the loss values from the individual LOBs. Instead, it is of interest to accurately assess the degree of tail dependence already present in the data. The empirical copula and its associated upper tail dependence coefficient are presented in this paper as robust, efficient means of achieving this goal.

**Keywords:**
Empirical copula,
extreme events,
insurance loss reserving,
upper tail dependence coefficient.