Search results for: weak convergence.
581 Challenges to Technological Advancement in Economically Weak Countries: An Assessment of the Nigerian Educational Situation
Authors: Iyabosola B. Oronti, Adeoluwawale A. Adewusi, Israel O. Megbowon
Abstract:
Nigeria is considered as one of the many countries in sub-Saharan Africa with a weak economy and gross deficiencies in technology and engineering. Available data from international monitoring and regulatory organizations show that technology is pivotal to determining the economic strengths of nations all over the world. Education is critical to technology acquisition, development, dissemination and adaptation. Thus, this paper seeks to critically assess and discuss issues and challenges facing technological advancement in Nigeria, particularly in the education sector, and also proffers solutions to resuscitate the Nigerian education system towards achieving national technological and economic sustainability such that Nigeria can compete favourably with other technologicallydriven economies of the world in the not-too-distant future.Keywords: Economically weak countries, education, globalization and competition, technological advancement.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3505580 Social Anthropology of Convergence and Nomadic Computing
Authors: Emilia Nercissians
Abstract:
The paper attempts to contribute to the largely neglected social and anthropological discussion of technology development on the one hand, and to redirecting the emphasis in anthropology from primitive and exotic societies to problems of high relevance in contemporary era and how technology is used in everyday life. It draws upon multidimensional models of intelligence and ideal type formation. It is argued that the predominance of computational and cognitive cosmovisions have led to technology alienation. Injection of communicative competence in artificially intelligent systems and identity technologies in the coming information society are analyzedKeywords: convergence, nomadic computing, solidarity, status.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1488579 On Algebraic Structure of Improved Gauss-Seidel Iteration
Authors: O. M. Bamigbola, A. A. Ibrahim
Abstract:
Analysis of real life problems often results in linear systems of equations for which solutions are sought. The method to employ depends, to some extent, on the properties of the coefficient matrix. It is not always feasible to solve linear systems of equations by direct methods, as such the need to use an iterative method becomes imperative. Before an iterative method can be employed to solve a linear system of equations there must be a guaranty that the process of solution will converge. This guaranty, which must be determined apriori, involve the use of some criterion expressible in terms of the entries of the coefficient matrix. It is, therefore, logical that the convergence criterion should depend implicitly on the algebraic structure of such a method. However, in deference to this view is the practice of conducting convergence analysis for Gauss- Seidel iteration on a criterion formulated based on the algebraic structure of Jacobi iteration. To remedy this anomaly, the Gauss- Seidel iteration was studied for its algebraic structure and contrary to the usual assumption, it was discovered that some property of the iteration matrix of Gauss-Seidel method is only diagonally dominant in its first row while the other rows do not satisfy diagonal dominance. With the aid of this structure we herein fashion out an improved version of Gauss-Seidel iteration with the prospect of enhancing convergence and robustness of the method. A numerical section is included to demonstrate the validity of the theoretical results obtained for the improved Gauss-Seidel method.
Keywords: Linear system of equations, Gauss-Seidel iteration, algebraic structure, convergence.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2917578 An Efficient Separation for Convolutive Mixtures
Authors: Salah Al-Din I. Badran, Samad Ahmadi, Dylan Menzies, Ismail Shahin
Abstract:
This paper describes a new efficient blind source separation method; in this method we uses a non-uniform filter bank and a new structure with different sub-bands. This method provides a reduced permutation and increased convergence speed comparing to the full-band algorithm. Recently, some structures have been suggested to deal with two problems: reducing permutation and increasing the speed of convergence of the adaptive algorithm for correlated input signals. The permutation problem is avoided with the use of adaptive filters of orders less than the full-band adaptive filter, which operate at a sampling rate lower than the sampling rate of the input signal. The decomposed signals by analysis bank filter are less correlated in each sub-band than the input signal at full-band, and can promote better rates of convergence.
Keywords: Blind source separation (BSS), estimates, full-band, mixtures, Sub-band.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1771577 Parallel Alternating Two-stage Methods for Solving Linear System
Authors: Guangbin Wang, Ning Zhang, Fuping Tan
Abstract:
In this paper, we present parallel alternating two-stage methods for solving linear system Ax = b, where A is a monotone matrix or an H-matrix. And we give some convergence results of these methods for nonsingular linear system.
Keywords: Parallel, alternating two-stage, convergence, linear system.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1139576 Analysis of Blind Decision Feedback Equalizer Convergence: Interest of a Soft Decision
Authors: S. Cherif, S. Marcos, M. Jaidane
Abstract:
In this paper the behavior of the decision feedback equalizers (DFEs) adapted by the decision-directed or the constant modulus blind algorithms is presented. An analysis of the error surface of the corresponding criterion cost functions is first developed. With the intention of avoiding the ill-convergence of the algorithm, the paper proposes to modify the shape of the cost function error surface by using a soft decision instead of the hard one. This was shown to reduce the influence of false decisions and to smooth the undesirable minima. Modified algorithms using the soft decision during a pseudo-training phase with an automatic switch to the properly tracking phase are then derived. Computer simulations show that these modified algorithms present better ability to avoid local minima than conventional ones.Keywords: Blind DFEs, decision-directed algorithm, constant modulus algorithm, cost function analysis, convergence analysis, soft decision.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1876575 A Novel Logarithmic Current-Controlled Current Amplifier (LCCA)
Authors: Karama M. AL-Tamimi, Munir A. Al-Absi
Abstract:
A new OTA-based logarithmic-control variable gain current amplifier (LCCA) is presented. It consists of two Operational Transconductance Amplifier (OTA) and two PMOS transistors biased in weak inversion region. The circuit operates from 0.6V DC power supply and consumes 0.6 μW. The linear-dB controllable output range is 43 dB with maximum error less than 0.5dB. The functionality of the proposed design was confirmed using HSPICE in 0.35μm CMOS process technology.Keywords: LCCA, OTA, Logarithmic, VGA, Weak inversion, Current-mode
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2011574 Increasing The Speed of Convergence of an Artificial Neural Network based ARMA Coefficients Determination Technique
Authors: Abiodun M. Aibinu, Momoh J. E. Salami, Amir A. Shafie, Athaur Rahman Najeeb
Abstract:
In this paper, novel techniques in increasing the accuracy and speed of convergence of a Feed forward Back propagation Artificial Neural Network (FFBPNN) with polynomial activation function reported in literature is presented. These technique was subsequently used to determine the coefficients of Autoregressive Moving Average (ARMA) and Autoregressive (AR) system. The results obtained by introducing sequential and batch method of weight initialization, batch method of weight and coefficient update, adaptive momentum and learning rate technique gives more accurate result and significant reduction in convergence time when compared t the traditional method of back propagation algorithm, thereby making FFBPNN an appropriate technique for online ARMA coefficient determination.Keywords: Adaptive Learning rate, Adaptive momentum, Autoregressive, Modeling, Neural Network.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1488573 Preconditioned Jacobi Method for Fuzzy Linear Systems
Authors: Lina Yan, Shiheng Wang, Ke Wang
Abstract:
A preconditioned Jacobi (PJ) method is provided for solving fuzzy linear systems whose coefficient matrices are crisp Mmatrices and the right-hand side columns are arbitrary fuzzy number vectors. The iterative algorithm is given for the preconditioned Jacobi method. The convergence is analyzed with convergence theorems. Numerical examples are given to illustrate the procedure and show the effectiveness and efficiency of the method.
Keywords: preconditioning, M-matrix, Jacobi method, fuzzy linear system (FLS).
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1894572 Effect of Implementation of Nonlinear Sequence Transformations on Power Series Expansion for a Class of Non-Linear Abel Equations
Authors: Javad Abdalkhani
Abstract:
Convergence of power series solutions for a class of non-linear Abel type equations, including an equation that arises in nonlinear cooling of semi-infinite rods, is very slow inside their small radius of convergence. Beyond that the corresponding power series are wildly divergent. Implementation of nonlinear sequence transformation allow effortless evaluation of these power series on very large intervals..Keywords: Nonlinear transformation, Abel Volterra Equations, Mathematica
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1290571 Convergence of National Regulations with IFRS for SMEs: Empirical Evidences in the Case of Romania
Authors: Mădălina Maria Gîrbină, Cătălin Nicolae Albu, Nadia Albu
Abstract:
The IFRS for Small and Medium-sized Entities (SMEs) was issued in July 2009 and currently regulators are considering various implementation strategies of this standard. Romania is a member of the European Union since 2007, thus accounting regulations were issued in order to ensure compliance with the European Accounting Directives. As the European Commission rejected recently the mandatory use of IFRS for SMEs, regulatory bodies from the Member States have to decide if the standard will affect or not the accounting practices of SMEs from their countries. Recently IASB invited stakeholders to discuss the revision of IFRS for SMEs. Empirical studies on the differences and similarities between national standards and IFRS for SMEs could inform decision makers on the actual level of convergence in different countries. The purpose of this paper is to provide empirical evidences on the convergence of the Romanian regulations with IFRS for SMEs analyzing the results in the context of the last revisions proposed to the EU Accounting Directives.Keywords: EU Accounting Directives, IFRS for SMEs, national regulations
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2839570 Crank-Nicolson Difference Scheme for the Generalized Rosenau-Burgers Equation
Authors: Kelong Zheng, Jinsong Hu,
Abstract:
In this paper, numerical solution for the generalized Rosenau-Burgers equation is considered and Crank-Nicolson finite difference scheme is proposed. Existence of the solutions for the difference scheme has been shown. Stability, convergence and priori error estimate of the scheme are proved. Numerical results demonstrate that the scheme is efficient and reliable.
Keywords: Generalized Rosenau-Burgers equation, difference scheme, stability, convergence.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1848569 Study of Measures to Secure Video Phone Service Safety through a Preliminary Evaluationof the Information Security of the New IT Service
Authors: DongHoon Shin, Yunmook Nah, HoSeong Kim, Gang Shin Lee, Jae-Il Lee
Abstract:
The rapid advance of communication technology is evolving the network environment into the broadband convergence network. Likewise, the IT services operated in the individual network are also being quickly converged in the broadband convergence network environment. VoIP and IPTV are two examples of such new services. Efforts are being made to develop the video phone service, which is an advanced form of the voice-oriented VoIP service. However, the new IT services will be subject to stability and reliability vulnerabilities if the relevant security issues are not answered during the convergence of the existing IT services currently being operated in individual networks within the wider broadband network environment. To resolve such problems, this paper attempts to analyze the possible threats and identify the necessary security measures before the deployment of the new IT services. Furthermore, it measures the quality of the encryption algorithm application example to describe the appropriate algorithm in order to present security technology that will have no negative impact on the quality of the video phone service.Keywords: BcN, Security Measures, Video Phone.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1429568 An Axisymmetric Finite Element Method for Compressible Swirling Flow
Authors: Raphael Zanella, Todd A. Oliver, Karl W. Schulz
Abstract:
This work deals with the finite element approximation of axisymmetric compressible flows with swirl velocity. We are interested in problems where the flow, while weakly dependent on the azimuthal coordinate, may have a strong azimuthal velocity component. We describe the approximation of the compressible Navier-Stokes equations with H1-conformal spaces of axisymmetric functions. The weak formulation is implemented in a C++ solver with explicit time marching. The code is first verified with a convergence test on a manufactured solution. The verification is completed by comparing the numerical and analytical solutions in a Poiseuille flow case and a Taylor-Couette flow case. The code is finally applied to the problem of a swirling subsonic air flow in a plasma torch geometry.
Keywords: Axisymmetric problem, compressible Navier- Stokes equations, continuous finite elements, swirling flow.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 325567 A Modified Inexact Uzawa Algorithm for Generalized Saddle Point Problems
Authors: Shu-Xin Miao
Abstract:
In this note, we discuss the convergence behavior of a modified inexact Uzawa algorithm for solving generalized saddle point problems, which is an extension of the result obtained in a recent paper [Z.H. Cao, Fast Uzawa algorithm for generalized saddle point problems, Appl. Numer. Math., 46 (2003) 157-171].
Keywords: Saddle point problem, inexact Uzawa algorithm, convergence behavior.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1473566 A Transform Domain Function Controlled VSSLMS Algorithm for Sparse System Identification
Authors: Cemil Turan, Mohammad Shukri Salman
Abstract:
The convergence rate of the least-mean-square (LMS) algorithm deteriorates if the input signal to the filter is correlated. In a system identification problem, this convergence rate can be improved if the signal is white and/or if the system is sparse. We recently proposed a sparse transform domain LMS-type algorithm that uses a variable step-size for a sparse system identification. The proposed algorithm provided high performance even if the input signal is highly correlated. In this work, we investigate the performance of the proposed TD-LMS algorithm for a large number of filter tap which is also a critical issue for standard LMS algorithm. Additionally, the optimum value of the most important parameter is calculated for all experiments. Moreover, the convergence analysis of the proposed algorithm is provided. The performance of the proposed algorithm has been compared to different algorithms in a sparse system identification setting of different sparsity levels and different number of filter taps. Simulations have shown that the proposed algorithm has prominent performance compared to the other algorithms.Keywords: Adaptive filtering, sparse system identification, VSSLMS algorithm, TD-LMS algorithm.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 984565 Nonfactorizable Contributions to Weak D →ππ Decay Modes
Authors: K. K. Sharma, A. C. Katoch
Abstract:
We investigate nonfactorizable contributions to D → ¤Ç¤Ç decay modes. We perform isospin analysis of the nonfactorizable contributions to these decays. Obtaining the factorizable contributions from spectator-quark diagrams using = 3 C N , we determine nonfactorizable amplitudes for these decays and predict their branching ratios.Keywords: Mesons, Branching Ratios, Decay Amplitudes, Heavy Flavor Mesons, Nonfactorizable Contributions, Weak Decays.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2511564 Two Fourth-order Iterative Methods Based on Continued Fraction for Root-finding Problems
Authors: Shengfeng Li, Rujing Wang
Abstract:
In this paper, we present two new one-step iterative methods based on Thiele-s continued fraction for solving nonlinear equations. By applying the truncated Thiele-s continued fraction twice, the iterative methods are obtained respectively. Analysis of convergence shows that the new methods are fourth-order convergent. Numerical tests verifying the theory are given and based on the methods, two new one-step iterations are developed.Keywords: Iterative method, Fixed-point iteration, Thiele's continued fraction, Order of convergence.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1869563 Non-Polynomial Spline Solution of Fourth-Order Obstacle Boundary-Value Problems
Authors: Jalil Rashidinia, Reza Jalilian
Abstract:
In this paper we use quintic non-polynomial spline functions to develop numerical methods for approximation to the solution of a system of fourth-order boundaryvalue problems associated with obstacle, unilateral and contact problems. The convergence analysis of the methods has been discussed and shown that the given approximations are better than collocation and finite difference methods. Numerical examples are presented to illustrate the applications of these methods, and to compare the computed results with other known methods.Keywords: Quintic non-polynomial spline, Boundary formula, Convergence, Obstacle problems.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1803562 Budget and the Performance of Public Enterprises: A Study of Selected Public Enterprises in Nasarawa State Nigeria (2009-2013)
Authors: Dalhatu, Musa Yusha’u, Shuaibu Sidi Safiyanu, Haliru Musa Hussaini
Abstract:
This study examined budget and performance of public enterprises in Nasarawa State, Nigeria in a period of 2009-2013. The study utilized secondary sources of data obtained from four selected parastatals’ budget allocation and revenue generation for the period under review. The simple correlation coefficient was used to analyze the extent of the relationship between budget allocation and revenue generation of the parastatals. Findings revealed varying results. There was positive (0.21) and weak correlation between expenditure and revenue of Nasarawa Investment and Property Development Company (NIPDC). However, the study further revealed that there was strong and weak negative relationship in the revenue and expenditure of the following parastatals over the period under review. Viz: Nasarawa State Water Board, -0.27 (weak), Nasarawa State Broadcasting Service, -0.52 (Strong) and Nasarawa State College of Agriculture, -0.36 (weak). The study therefore, recommends that government should increase its investments in NIPDC to enhance efficiency and profitability. It also recommends that government should strengthen its fiscal responsibility, accountability and transparency in public parastatals.
Keywords: Allocation, Budget, Public Enterprises, Parastatals, Performance.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 976561 Applying Element Free Galerkin Method on Beam and Plate
Authors: Mahdad M’hamed, Belaidi Idir
Abstract:
This paper develops a meshless approach, called Element Free Galerkin (EFG) method, which is based on the weak form Moving Least Squares (MLS) of the partial differential governing equations and employs the interpolation to construct the meshless shape functions. The variation weak form is used in the EFG where the trial and test functions are approximated bye the MLS approximation. Since the shape functions constructed by this discretization have the weight function property based on the randomly distributed points, the essential boundary conditions can be implemented easily. The local weak form of the partial differential governing equations is obtained by the weighted residual method within the simple local quadrature domain. The spline function with high continuity is used as the weight function. The presently developed EFG method is a truly meshless method, as it does not require the mesh, either for the construction of the shape functions, or for the integration of the local weak form. Several numerical examples of two-dimensional static structural analysis are presented to illustrate the performance of the present EFG method. They show that the EFG method is highly efficient for the implementation and highly accurate for the computation. The present method is used to analyze the static deflection of beams and plate holeKeywords: Numerical computation, element-free Galerkin, moving least squares, meshless methods.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2425560 Comparison of Newton Raphson and Gauss Seidel Methods for Power Flow Analysis
Authors: H. Abaali, T. Talbi, R.Skouri
Abstract:
This paper presents a comparative study of the Gauss Seidel and Newton-Raphson polar coordinates methods for power flow analysis. The effectiveness of these methods are evaluated and tested through a different IEEE bus test system on the basis of number of iteration, computational time, tolerance value and convergence.
Keywords: Convergence time, Gauss-Seidel Method, Newton-Raphson Method, number of iteration, power flow analysis.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2515559 Improved Artificial Immune System Algorithm with Local Search
Authors: Ramin Javadzadeh., Zahra Afsahi, MohammadReza Meybodi
Abstract:
The Artificial immune systems algorithms are Meta heuristic optimization method, which are used for clustering and pattern recognition applications are abundantly. These algorithms in multimodal optimization problems are more efficient than genetic algorithms. A major drawback in these algorithms is their slow convergence to global optimum and their weak stability can be considered in various running of these algorithms. In this paper, improved Artificial Immune System Algorithm is introduced for the first time to overcome its problems of artificial immune system. That use of the small size of a local search around the memory antibodies is used for improving the algorithm efficiently. The credibility of the proposed approach is evaluated by simulations, and it is shown that the proposed approach achieves better results can be achieved compared to the standard artificial immune system algorithmsKeywords: Artificial immune system, Cellular Automata, Cellular learning automata, Cellular learning automata, , Local search, Optimization.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1878558 Turbulence Modeling of Source and Sink Flows
Authors: Israt Jahan Eshita
Abstract:
Flows developed between two parallel disks have many engineering applications. Two types of non-swirling flows can be generated in such a domain. One is purely source flow in disc type domain (outward flow). Other is purely sink flow in disc type domain (inward flow). This situation often appears in some turbo machinery components such as air bearings, heat exchanger, radial diffuser, vortex gyroscope, disc valves, and viscosity meters. The main goal of this paper is to show the mesh convergence, because mesh convergence saves time, and economical to run and increase the efficiency of modeling for both sink and source flow. Then flow field is resolved using a very fine mesh near-wall, using enhanced wall treatment. After that we are going to compare this flow using standard k-epsilon, RNG k-epsilon turbulence models. Lastly compare some experimental data with numerical solution for sink flow. The good agreement of numerical solution with the experimental works validates the current modeling.
Keywords: Hydraulic diameter, k-epsilon model, meshes convergence, Reynolds number, RNG model, sink flow, source flow and wall y+.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2519557 Proximal Parallel Alternating Direction Method for Monotone Structured Variational Inequalities
Abstract:
In this paper, we focus on the alternating direction method, which is one of the most effective methods for solving structured variational inequalities(VI). In fact, we propose a proximal parallel alternating direction method which only needs to solve two strongly monotone sub-VI problems at each iteration. Convergence of the new method is proved under mild assumptions. We also present some preliminary numerical results, which indicate that the new method is quite efficient.
Keywords: structured variational inequalities, proximal point method, global convergence
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1309556 New Subband Adaptive IIR Filter Based On Polyphase Decomposition
Authors: Young-Seok Choi
Abstract:
We present a subband adaptive infinite-impulse response (IIR) filtering method, which is based on a polyphase decomposition of IIR filter. Motivated by the fact that the polyphase structure has benefits in terms of convergence rate and stability, we introduce the polyphase decomposition to subband IIR filtering, i.e., in each subband high order IIR filter is decomposed into polyphase IIR filters with lower order. Computer simulations demonstrate that the proposed method has improved convergence rate over conventional IIR filters.
Keywords: Subband adaptive filter, IIR filtering. Polyphase decomposition.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2487555 Histochemistry of Intestinal Enzymes of Juvenile Dourado Salminus brasiliensis Fed Bovine Colostrum
Authors: Debora B. Moretti, Wiolene M. Nordi, Thaline Maira P. Cruz, José Eurico P. Cyrino, Raul Machado-Neto
Abstract:
Enzyme activity was evaluated in the intestine of juvenile dourado (Salminus brasiliensis) fed with diets containing 0, 10 or 20% of lyophilized bovine colostrum (LBC) inclusion for either 30 or 60 days. The intestinal enzymes acid and alkaline phosphatase (ACP and ALP, respectively), non-specific esterase (NSE), lipase (LIP), dipeptidyl aminopeptidase IV (DAP IV) and leucine aminopeptidase (LAP) were studied using histochemistry in four intestinal segments (S1, S2, S3 and posterior intestine). Weak proteolitic activity was observed in all intestinal segments for DAP IV and LAP. The activity of NSE and LIP was also weak in all intestines, except for the moderate activity of NSE in the S2 of 20% LBC group after 30 days and in the S1 of 0% LBC group after 60 days. The ACP was detected only in the S2 and S3 of the 10% LBC group after 30 days. Moderate and strong staining was observed in the first three intestinal segments for ALP and weak activity in the posterior intestine. The activity of DAP IV, LAP and ALP were also present in the cytoplasm of the enterocytes. In the present results, bovine colostrum feeding did not cause alterations in activity of intestinal enzymes.
Keywords: Carnivorous fish, enterocyte, intestinal epithelium, teleost.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1998554 Evaluation of Total Cross Section of Photo-Ionization of Helium in Weak Field on Base of Trajectory Method
Authors: Alexander B. Bichkov, Valery V. Smirnov
Abstract:
Total cross section of helium atom photo-ionization by weak short pulse is calculated using the variant of trajectory method, developed in our earlier work. The method enables simple estimation of total ionization probability (or cross section) without integration of differential one.
Keywords: Evaluation of Photo-Ionization, Helium, Trajectory Method
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1873553 Fixed Point of Lipschitz Quasi Nonexpansive Mappings
Authors: M. Moosavi, H. Khatibzadeh
Abstract:
In this article, we study demiclosed and strongly quasi-nonexpansive of a sequence generated by the proximal point algorithm for a finite family of quasi-nonexpansive mappings in Hadamard spaces. Δ-convergence of iterations for the sequence of strongly quasi-nonexpansive mappings as well as the strong convergence of the Halpern type regularization of them to a common fixed point of sequence are also established. Our results generalize and improve several previously known results of the existing literature.
Keywords: Fixed point, Hadamard space, proximal point algorithm, quasi-nonexpansive sequence of mappings, resolvent.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 163552 Approximating Fixed Points by a Two-Step Iterative Algorithm
Authors: Safeer Hussain Khan
Abstract:
In this paper, we introduce a two-step iterative algorithm to prove a strong convergence result for approximating common fixed points of three contractive-like operators. Our algorithm basically generalizes an existing algorithm..Our iterative algorithm also contains two famous iterative algorithms: Mann iterative algorithm and Ishikawa iterative algorithm. Thus our result generalizes the corresponding results proved for the above three iterative algorithms to a class of more general operators. At the end, we remark that nothing prevents us to extend our result to the case of the iterative algorithm with error terms.
Keywords: Contractive-like operator, iterative algorithm, fixed point, strong convergence.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2010