Search results for: matrix analytic methods

Authors: Gulnara Galeeva

Abstract:

The Analytic Hierarchy Process is widely used in the economic and financial studies, including the formation of investment portfolios. In this study, a generalized method of obtaining a vector of priorities for the case with separate pairwise comparisons of the expert opinion being presented as a set of several equal evaluations on a ratio scale is examined. The author claims that this method allows solving an important and up-to-date problem of excluding vagueness and ambiguity of the expert opinion in the decision making theory. The study describes the authentic wide pairwise comparison matrix. Its application in the formation of the efficient investment portfolio of intangible assets of a small business enterprise with limited funding is considered. The proposed method has been successfully approbated on the practical example of a functioning dental clinic. The result of the study confirms that the wide pairwise comparison matrix can be used as a simple and reliable method for forming the enterprise investment policy. Moreover, a comparison between the method based on the wide pairwise comparison matrix and the classical analytic hierarchy process was conducted. The results of the comparative analysis confirm the correctness of the method based on the wide matrix. The application of a wide pairwise comparison matrix also allows to widely use the statistical methods of experimental data processing for obtaining the vector of priorities. A new method is available for simple users. Its application gives about the same accuracy result as that of the classical hierarchy process. Financial directors of small and medium business enterprises get an opportunity to solve the problem of companies’ investments without resorting to services of analytical agencies specializing in such studies.

Keywords: analytic hierarchy process, decision processes, investment portfolio, intangible assets

Procedia PDF Downloads 265

Authors: X. L. Nguyen, T. Y. Chou, F. Y. Min, F. C. Lin, T. V. Hoang, Y. M. Huang

Abstract:

In Vietnam, land use planning is utilized as an efficient tool for the local government to adjust land use. However, planned locations are facing disapproval from people who live near these planned sites because of environmental problems. The selection of these locations is normally based on the subjective opinion of decision-makers and is not supported by any scientific methods. Many researchers have applied Multi-Criteria Analysis (MCA) methods in which Analytic Hierarchy Process (AHP) is the most popular techniques in combination with Fuzzy set theory for the subject of rationality assessment of land use planning locations. In this research, the Fuzzy set theory and Analytic Network Process (ANP) multi-criteria-based technique were used for the assessment process. The Fuzzy Analytic Hierarchy Process was also utilized, and the output results from two methods were compared to extract the differences. The 20 planned landfills in Hung Ha district, Thai Binh province, Vietnam was selected as a case study. The comparison results indicate that there are different between weights computed by AHP and ANP methods and the assessment outputs produced from these two methods also slight differences. After evaluation of existing planned sites, some potential locations were suggested to the local government for possibility of land use planning adjusts.

Keywords: Analytic Hierarchy Process, Analytic Network Process, Fuzzy set theory, land use planning

Procedia PDF Downloads 421

Authors: Muna Tabuni

Abstract:

The paper contains an investigation on the special properties of the zeros of the analytic representations of finite quantum systems. These zeros and their paths completely define the finite quantum system. The present paper studies the construction of the analytic representation from its zeros. The analytic functions of finite quantum systems are introduced. The zeros of the analytic theta functions and their paths have been studied. The analytic function f(z) have exactly d zeros. The analytic function has been constructed from its zeros.

Keywords: construction, analytic, representation, zeros

Procedia PDF Downloads 207

Authors: Mouhamadou Dosso

Abstract:

This paper presents methods of spectral dichotomy of a matrix which compute spectral projectors on the subspace associated with the eigenvalues external to the parabolas described by a general equation. These methods are modifications of the one proposed in [A. N. Malyshev and M. Sadkane, SIAM J. MATRIX ANAL. APPL. 18 (2), 265-278, 1997] which uses the spectral dichotomy method of a matrix with respect to the imaginary axis. Theoretical and algorithmic aspects of the methods are developed. Numerical results obtained by applying methods presented on matrices are reported.

Keywords: spectral dichotomy method, spectral projector, eigensubspaces, eigenvalue

Procedia PDF Downloads 94

Authors: Malika Yaici, Kamel Hariche

Abstract:

In control engineering, systems described by matrix fractions are studied through properties of block roots, also called solvents. These solvents are usually dealt with in a block Vandermonde matrix form. Inverses and determinants of Vandermonde matrices and block Vandermonde matrices are used in solving problems of numerical analysis in many domains but require costly computations. Even though Vandermonde matrices are well known and method to compute inverse and determinants are many and, generally, based on interpolation techniques, methods to compute the inverse and determinant of a block Vandermonde matrix have not been well studied. In this paper, some properties of these matrices and iterative algorithms to compute the determinant and the inverse of a block Vandermonde matrix are given. These methods are deducted from the partitioned matrix inversion and determinant computing methods. Due to their great size, parallelization may be a solution to reduce the computations cost, so a parallelization of these algorithms is proposed and validated by a comparison using algorithmic complexity.

Keywords: block vandermonde matrix, solvents, matrix polynomial, matrix inverse, matrix determinant, parallelization

Procedia PDF Downloads 240

Authors: Gak-Gyu Kim, Won Il Jung

Abstract:

According to a remarkable development of science and technology, function and role of the system of engineering fields has recently been diversified. The system has become increasingly more complex and precise, and thus, system designers intended to maximize reliability concentrate more effort at the design stage. This study deals with the reliability redundancy optimization problem (RROP) for k-out-of-n: G system configuration with cold standby and warm standby components. This paper further intends to present the optimal mathematical model through which the following three elements of (i) multiple components choices, (ii) redundant components quantity and (iii) the choice of redundancy strategies may be combined in order to maximize the reliability of the system. Therefore, we focus on the following three issues. First, we consider RROP that there exists warm standby state as well as cold standby state of the component. Second, as eliminating an approximation approach of the previous RROP studies, we construct a precise model for system reliability. Third, given transition time when the state of components changes, we present not simply a workable solution but the advanced method. For the wide applicability of RROPs, moreover, we use absorbing continuous time Markov chain and matrix analytic methods in the suggested mathematical model.

Keywords: RROP, matrix analytic methods, k-out-of-n: G system, MTTF, absorbing continuous time Markov Chain

Procedia PDF Downloads 254

Authors: Tulin Coskun

Abstract:

We investigate the approximation of analytic functions of several variables in polydisc by the sequences of linear k-positive operators in Gadjiev sence. The approximation of analytic functions of complex variable by linear k-positive operators was tackled, and k-positive operators and formulated theorems of Korovkin's type for these operators in the space of analytic functions on the unit disc were introduced in the past. Recently, very general results on convergence of the sequences of linear k-positive operators on a simply connected bounded domain within the space of analytic functions were proved. In this presentation, we extend some of these results to the approximation of analytic functions of several complex variables by sequences of linear k-positive operators.

Keywords: analytic functions, approximation of analytic functions, Linear k-positive operators, Korovkin type theorems

Procedia PDF Downloads 338

Authors: Anas Hourani, Batool Ahmad

Abstract:

Software applications play an important role inside any institute. They are employed to manage all processes and store entities-related data in the computer. Therefore, choosing the right software product that meets institute requirements is not an easy decision in view of considering multiple criteria, different points of views, and many standards. As a case study, Mutah University, located in Jordan, is in essential need of customized software, and several companies presented their software products which are very similar in quality. In this regard, an analytic hierarchy process (AHP) and a fuzzy analytic hierarchy process (Fuzzy-AHP) models are proposed in this research to identify the most suitable and best-fit software product that meets the institute requirements. The results indicate that both modules are able to help the decision-makers to make a decision, especially in complex decision problems.

Keywords: analytic hierarchy process, decision modeling, fuzzy analytic hierarchy process, software product

Procedia PDF Downloads 392

Authors: Alfi Y. Zakiyyah, Hanni Garminia, M. Salman, A. N. Irawati

Abstract:

In the terminology of the hypergraph, there is a relation with the terminology graph. In the theory of graph, the edges connected two vertices. In otherwise, in hypergraph, the edges can connect more than two vertices. There is representation matrix of a graph such as adjacency matrix, Laplacian matrix, and incidence matrix. The adjacency matrix is symmetry matrix so that all eigenvalues is real. This matrix is a nonnegative matrix. The all diagonal entry from adjacency matrix is zero so that the trace is zero. Another representation matrix of the graph is the Laplacian matrix. Laplacian matrix is symmetry matrix and semidefinite positive so that all eigenvalues are real and non-negative. According to the spectral study in the graph, some that result is generalized to hypergraph. A hypergraph can be represented by a matrix such as adjacency, incidence, and Laplacian matrix. Throughout for this term, we use Laplacian matrix to represent a complete tripartite hypergraph. The aim from this research is to determine second smallest eigenvalues from this matrix and find a relation this eigenvalue with the connectivity of that hypergraph.

Keywords: connectivity, graph, hypergraph, Laplacian matrix

Procedia PDF Downloads 488

Authors: Pin-Ju Juan, Peng-Yu Juan, Yi-Shan Chen

Abstract:

The main purpose of this paper is to present a fuzzy Analytic Network Process (ANP) model for the hostel organizational performance selection. In this article, we created 39 criteria for selecting hostel organizational performance acquired from literature's review and experts method practical investigations, and the methods of fuzzy analytic network process are used to consolidate decision-makers’ assessments about criteria weightings. Finally, we selected organizational performance of a hostel in Taiwan to determine the effectiveness of the proposed evaluation model in this paper.

Keywords: Fuzzy ANP, hostel, organizational performance, strategy management

Procedia PDF Downloads 200

Authors: Elham Allahmoradi, Bahman Allahmoradi, Ali Bonyadi Naeini

Abstract:

Complex systems have many aspects. A variety of methods have been developed to analyze these systems. The most efficient of these methods should not only be simple, but also provide useful and comprehensive information about many aspects of the system. Matrix methods are considered the most commonly methods used to analyze and design systems. Each matrix method can examine a particular aspect of the system. If these methods are combined, managers can access to more comprehensive and broader information about the system. This study was conducted in four steps. In the first step, a process model of a real project has been extracted through IDEF3. In the second step, activity levels have been attained by writing a process model in the form of a design structure matrix (DSM) and sorting it through triangulation algorithm (TA). In the third step, sub-processes have been obtained by writing the process model in the form of an interface structure matrix (ISM) and clustering it through cluster identification algorithm (CIA). In the fourth step, a mixed model has been developed to provide a unified picture of the project structure through the simultaneous presentation of activities and sub-processes. Finally, the paper is completed with a conclusion.

Keywords: integrated definition for process description capture (IDEF3) method, design structure matrix (DSM), interface structure matrix (ism), mixed matrix model, activity level, sub-process

Procedia PDF Downloads 494

Authors: Kunpeng Wang, Hongchun, Wu, Liangzhi Cao, Chuanqi Zhao

Abstract:

The distributions of homogeneous neutron flux within a node were expanded into a set of analytic basis functions which satisfy the diffusion equation at any point in a triangular-z node for each energy group, and nodes were coupled with each other with both the zero- and first-order partial neutron current moments across all the interfaces of the triangular prism at the same time. Based this method, a code TABFEN has been developed and applied to solve the neutron diffusion equation in a complicated geometry. In addition, after a series of numerical derivation, one can get the neutron adjoint diffusion equations in matrix form which is the same with the neutron diffusion equation; therefore, it can be solved by TABFEN, and the low-high scan strategy is adopted to improve the efficiency. Four benchmark problems are tested by this method to verify its feasibility, the results show good agreement with the references which demonstrates the efficiency and feasibility of this method.

Keywords: analytic basis function expansion method, arbitrary triangular-z node, adjoint neutron flux, complicated geometry

Procedia PDF Downloads 445

Authors: Ric Joseph R. Murillo, Edna N. Gueco, Dennis I. Merino

Abstract:

Let F be C or R, where C and R are the set of complex numbers and real numbers, respectively, and n be a natural number. An n-by-n matrix A over the field F is called an α-involutory matrix or an α-involution if there exists an α in the field such that the square of the matrix is equal to αI, where I is the n-by-n identity matrix. If α is a complex number or a nonnegative real number, then an n-by-n matrix A over the field F can be written as a sum of n-by-n α-involutory matrices over the field F if and only if the trace of that matrix is an integral multiple of the square root of α. Meanwhile, if α is a negative real number, then a 2n-by-2n matrix A over R can be written as a sum of 2n-by-2n α-involutory matrices over R if and only the trace of the matrix is zero. Some other properties of α-involutory matrices are also determined

Keywords: α-involutory Matrices, sum of α-involutory Matrices, Trace, Matrix Theory

Procedia PDF Downloads 198

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

Procedia PDF Downloads 292

Authors: Muna Tabuni

Abstract:

The paper contains an investigation of the behavior of the Zeros of Bargmann functions for one and two-mode systems. A brief introduction to Harmonic oscillator formalism for one and two-mode is given. The Bargmann analytic representation for one and two-mode has been studied. The zeros of Bargmann analytic function for one-mode are considered. The Q Husimi functions are introduced. The Bargmann functions and the Husimi functions have the same zeros. The Bargmann functions f(z) have exactly q zeros. The evolution time of the zeros are discussed. The zeros of Bargmann analytic functions for two-mode are introduced. Various examples have been given.

Keywords: Bargmann functions, two-mode, zeros, harmonic oscillator

Procedia PDF Downloads 570

Authors: Iva Košek Bartošová, Andrea Jokešová, Eva Kozlová, Helena Matějová

Abstract:

The paper presents results of a research team from Faculty of Education, University of Hradec Králové in the Czech Republic. It introduces with the most reading methods used in the 1^st classes of a primary school and presents results of a pilot research focused on mastering reading techniques and the quality of reading comprehension of pupils in the first half of a school year during training in teaching reading by an analytic-synthetic method and by a genetic method. These methods of practicing reading skills are the most used ones in the Czech Republic. During the school year 2015/16 there has been a measurement made of two groups of pupils of the 1^st year and monitoring of quantitative and qualitative parameters of reading pupils’ outputs by several methods. Both of these methods are based on different theoretical basis and each of them has a specific educational and methodical procedure. This contribution represents results during a piloting project and draws pilot conclusions which will be verified in the subsequent broader research at the end of the school year of the first class of primary school.

Keywords: analytic-synthetic method of reading, genetic method of reading, reading comprehension, reading literacy, reading methods, reading speed

Procedia PDF Downloads 258

Authors: Latif Yanar, Muammer Kaçan

Abstract:

Decision support systems are getting more important in many fields of science and technology and used effectively especially when the problems to be solved are complicated with many criteria. In this kind of problems one of the main challenges for the decision makers are that sometimes they cannot produce a countable data for evaluating the criteria but the knowledge and sense of experts. In recent years, fuzzy set theory and fuzzy logic based decision models gaining more place in literature. In this study, a decision support model to determine a country to build naval base is proposed and the application of the model is performed, considering Turkish Navy by the evaluations of Turkish Navy officers and academicians of international relations departments of various Universities located in Istanbul. The results achieved from the evaluations made by the experts in our model are calculated by a decision support tool named DESTEC 1.0, which is developed by the authors using C Sharp programming language. The tool gives advices to the decision maker using Analytic Hierarchy Process, Analytic Network Process, Fuzzy Analytic Hierarchy Process and Fuzzy Analytic Network Process all at once. The calculated results for five foreign countries are shown in the conclusion.

Keywords: decision support system, analytic hierarchy process, fuzzy analytic hierarchy process, analytic network process, fuzzy analytic network process, naval base, country selection, international relations

Procedia PDF Downloads 591

Authors: M. Hadji, N. Chiker, Y. Hadji, A. Haddad

Abstract:

In this paper, we report for the first time on the synthesis and characterization of novel MAX phases (Ti3SiC2, Ti2AlC) reinforced Ni-matrix and Ti2AlC reinforced Al-matrix. The stability of MAX phases in Al-matrix and Ni-matrix at a temperature of 985°C has been investigated. All the composites were cold pressed and sintered at a temperature of 985°C for 20min in H2 environment, except (Ni/Ti3SiC2) who was sintered at 1100°C for 1h.Microstructure analysis by scanning electron microscopy and phase analysis by X-Ray diffraction confirmed that there was minimal interfacial reaction between MAX particles and Ni, thus Al/MAX samples shown that MAX phases was totally decomposed at 985°C.The Addition of MAX enhanced the Al-matrix and Ni-matrix.

Keywords: MAX phase, microstructures, composites, hardness, SEM

Procedia PDF Downloads 347

Authors: Renata Masarova, Bohuslava Juhasova, Martin Juhas, Zuzana Sutova

Abstract:

In dynamic system theory a mathematical model is often used to describe their properties. In order to find a transfer matrix of a dynamic system we need to calculate an inverse matrix. The paper contains the fusion of the classical theory and the procedures used in the theory of automated control for calculating the inverse matrix. The final part of the paper models the given problem by the Matlab.

Keywords: dynamic system, transfer matrix, inverse matrix, modeling

Procedia PDF Downloads 516

Authors: Cristina-Maria Păcurar

Abstract:

The paper presents an original Python-based application that outlines the advantages of combining some elementary notions of mathematics with the study of a programming language. The application support refers to some of the first lessons of analytic geometry, meaning conics and quadrics and their reduction to a standard form, as well as some related notions. The chosen programming language is Python, not only for its closer to an everyday language syntax – and therefore, enhanced readability – but also for its highly reusable code, which is of utmost importance for a mathematician that is accustomed to exploit already known and used problems to solve new ones. The purpose of this paper is, on one hand, to support the idea that one of the most appropriate means to initiate one into programming is throughout mathematics, and reciprocal, one of the most facile and handy ways to assimilate some basic knowledge in the study of mathematics is to apply them in a personal project. On the other hand, besides being a mean of learning both programming and analytic geometry, the application subject to this paper is itself a useful tool for it can be seen as an independent original Python package for analytic geometry.

Keywords: analytic geometry, conics, python, quadrics

Procedia PDF Downloads 292

Authors: Xiaoqian Cheng, Jon Kleppe, Ole Torsæter

Abstract:

The properties of rocks have effects on efficiency of surfactant. One objective of this study is to analyze the effects of rock properties (permeability, porosity, initial water saturation) on surfactant spontaneous imbibition at laboratory scale. The other objective is to evaluate existing upscaling methods and establish a modified upscaling method. A core is put in a container that is full of surfactant solution. Assume there is no space between the bottom of the core and the container. The core is modelled as a cuboid matrix with a length of 3.5 cm, a width of 3.5 cm, and a height of 5 cm. The initial matrix, brine and oil properties are set as the properties of Ekofisk Field. The simulation results of matrix permeability show that the oil recovery rate has a strong positive linear relationship with matrix permeability. Higher oil recovery is obtained from the matrix with higher permeability. One existing upscaling method is verified by this model. The study on matrix porosity shows that the relationship between oil recovery rate and matrix porosity is a negative power function. However, the relationship between ultimate oil recovery and matrix porosity is a positive power function. The initial water saturation of matrix has negative linear relationships with ultimate oil recovery and enhanced oil recovery. However, the relationship between oil recovery and initial water saturation is more complicated with the imbibition time because of the transition of dominating force from capillary force to gravity force. Modified upscaling methods are established. The work here could be used as a reference for the surfactant application in fractured reservoirs. And the description of the relationships between properties of matrix and the oil recovery rate and ultimate oil recovery helps to improve upscaling methods.

Keywords: initial water saturation, permeability, porosity, surfactant EOR

Procedia PDF Downloads 162

Authors: Boris Melnikov, Dmitrii Chaikovskii, Elena Melnikova

Abstract:

The traveling salesman problem (TSP) is a well-known optimization problem that seeks to find the shortest possible route that visits a set of points and returns to the starting point. In this paper, we apply some heuristics of the TSP for the task of restoring the DNA matrix. This restoration problem is often considered in biocybernetics. For it, we must recover the matrix of distances between DNA sequences if not all the elements of the matrix under consideration are known at the input. We consider the possibility of using this method in the testing of distance calculation algorithms between a pair of DNAs to restore the partially filled matrix.

Keywords: optimization problems, DNA matrix, partially filled matrix, traveling salesman problem, heuristic algorithms

Procedia PDF Downloads 150

Authors: Celina Pestano-Gabino, Concepcion Gonzalez-Concepcion, M. Candelaria Gil-Fariña

Abstract:

Some estimation methods for VARMA models, and Multivariate Time Series Models in general, rely on the use of a Hankel matrix. It is known that if the data sample is populous enough and the dimension of the Hankel matrix is unnecessarily large, this may result in an unnecessary number of computations as well as in numerical problems. In this sense, the aim of this paper is two-fold. First, we provide some theoretical results for these matrices which translate into a lower dimension for the matrices normally used in the algorithms. This contribution thus serves to improve those methods from a numerical and, presumably, statistical point of view. Second, we have chosen an estimation algorithm to illustrate in practice our improvements. The results we obtained in a simulation of VARMA models show that an increase in the size of the Hankel matrix beyond the theoretical bound proposed as valid does not necessarily lead to improved practical results. Therefore, for future research, we propose conducting similar studies using any of the linear system estimation methods that depend on Hankel matrices.

Keywords: covariances Hankel matrices, Kronecker indices, system identification, VARMA models

Procedia PDF Downloads 243

Authors: Akash Verma, Sujit Kumar Samanta

Abstract:

This study examines a discrete-time Geo/G/1 queueing-inventory system attached with (s, Q) inventory policy. Assume that the customers follow the Bernoulli process on arrival. Each customer demands a single item with arbitrarily distributed service time. The inventory is replenished by an outside supplier, and the lead time for the replenishment is determined by a geometric distribution. There is a single server and infinite waiting space in this facility. Demands must wait in the specified waiting area during a stock-out period. The customers are served on a first-come-first-served basis. With the help of the embedded Markov chain technique, we determine the joint probability distributions of the number of customers in the system and the number of items in stock at the post-departure epoch using the Matrix Analytic approach. We relate the system length distribution at post-departure and outside observer's epochs to determine the joint probability distribution at the outside observer's epoch. We use probability distributions at random epochs to determine the waiting time distribution. We obtain the performance measures to construct the cost function. The optimum values of the order quantity and reordering point are found numerically for the variety of model parameters.

Keywords: discrete-time queueing inventory model, matrix analytic method, waiting-time analysis, cost optimization

Procedia PDF Downloads 42

Authors: Narissara Nuthammachot, Dimitris Stratoulias

Abstract:

Fire is one of the main causes of environmental and ecosystem change. Therefore, it is a challenging task for fire risk assessment fire potential mapping. The study area is Hua Sai district, Nakorn Sri Thammarat province, which covers in a part of peat swamp forest areas. 55 fire points in peat swamp areas were reported from 2012 to 2016. Analytic Hierarchy Process (AHP) and Geographic Information System (GIS) methods were selected for this study. The risk fire area map was arranged on these factors; elevation, slope, aspect, precipitation, distance from the river, distance from town, and land use. The results showed that the predicted fire risk areas are found to be in appreciable reliability with past fire events. The fire risk map can be used for the planning and management of fire areas in the future.

Keywords: analytic hierarchy process, fire risk assessment, geographic information system, peat swamp forest

Procedia PDF Downloads 211

Authors: Ahmed Abdel Sattar Khalil, Hazem Omar

Abstract:

Background: Image-guided hepatic interventions are integral to the management of infective and neoplastic liver lesions. Over the past decades, 2D ultrasound was used for guidance of hepatic interventions; with the recent advances in ultrasound technology, 3D ultrasound was used to guide hepatic interventions. The aim of this study was to illustrate the added value of 3D image guided hepatic interventions by x matrix technology. Patients and Methods: This prospective study was performed on 100 patients who were divided into two groups; group A included 50 patients who were managed by 2D ultrasonography probe guidance, and group B included 50 patients who were managed by 3D X matrix ultrasonography probe guidance. Thermal ablation was done for 70 patients, 40 RFA (20 by the 2D probe and 20 by the 3D x matrix probe), and 30 MWA (15 by the 2D probe and 15 by the 3D x matrix probe). Chemical ablation (PEI) was done on 20 patients (10 by the 2D probe and 10 by the 3D x matrix probe). Drainage of hepatic collections and biopsy from undiagnosed hepatic focal lesions was done on 10 patients (5 by the 2D probe and 5 by the 3D x matrix probe). Results: The efficacy of ultrasonography-guided hepatic interventions by 3D x matrix probe was higher than the 2D probe but not significantly higher, with a p-value of 0.705, 0.5428 for RFA, MWA respectively, 0.5312 for PEI, 0.2918 for drainage of hepatic collections and biopsy. The complications related to the use of the 3D X matrix probe were significantly lower than the 2D probe, with a p-value of 0.003. The timing of the procedure was shorter by the usage of 3D x matrix probe in comparison to the 2D probe with a p-value of 0.08,0.34 for RFA and PEI and significantly shorter for MWA, and drainage of hepatic collection, biopsy with a P-value of 0.02,0.001 respectively. Conclusions: 3D ultrasonography-guided hepatic interventions by  x matrix probe have better efficacy, less complication, and shorter time of procedure than the 2D ultrasonography-guided hepatic interventions.

Keywords: 3D, X matrix, 2D, ultrasonography, MWA, RFA, PEI, drainage of hepatic collections, biopsy

Procedia PDF Downloads 95

Authors: Serifenur Cebesoy, Yelda Aygar, Elgiz Bairamov

Abstract:

In this study, we examine some spectral properties of non-selfadjoint matrix-valued difference equations consisting of a polynomial type Jost solution. The aim of this study is to investigate the eigenvalues and spectral singularities of the difference operator L which is expressed by the above-mentioned difference equation. Firstly, thanks to the representation of polynomial type Jost solution of this equation, we obtain asymptotics and some analytical properties. Then, using the uniqueness theorems of analytic functions, we guarantee that the operator L has a finite number of eigenvalues and spectral singularities.

Keywords: asymptotics, continuous spectrum, difference equations, eigenvalues, jost functions, spectral singularities

Procedia PDF Downloads 446

Authors: Boris Melnikov, Ye Zhang, Dmitrii Chaikovskii

Abstract:

We continue to consider one of the cybernetic methods in computational biology related to the study of DNA chains. Namely, we are considering the problem of reconstructing the not fully filled distance matrix of DNA chains. When applied in a programming context, it is revealed that with a modern computer of average capabilities, creating even a small-sized distance matrix for mitochondrial DNA sequences is quite time-consuming with standard algorithms. As the size of the matrix grows larger, the computational effort required increases significantly, potentially spanning several weeks to months of non-stop computer processing. Hence, calculating the distance matrix on conventional computers is hardly feasible, and supercomputers are usually not available. Therefore, we started publishing our variants of the algorithms for calculating the distance between two DNA chains; then, we published algorithms for restoring partially filled matrices, i.e., the inverse problem of matrix processing. In this paper, we propose an algorithm for restoring the distance matrix for DNA chains, and the primary focus is on enhancing the algorithms that shape the greedy function within the branches and boundaries method framework.

Keywords: DNA chains, distance matrix, optimization problem, restoring algorithm, greedy algorithm, heuristics

Procedia PDF Downloads 118

Authors: Hee-Jae Suh, Kyung-Su Kim, Min-Ji Kim, Yeon-Seong Jeong, Ok-Hwan Lee, Jae-Wook Shin, Hyang-Sook Chun, Chan Lee

Abstract:

Canthaxanthin is keto-carotenoid produced from beta-carotene and it has been approved to be used in many countries as a food coloring agent. Canthaxanthin has been analyzed using High Performance Liquid Chromatography (HPLC) system with various ways of pretreatment methods. Four official methods for verification of canthaxanthin at FSA (UK), AOAC (US), EFSA (EU) and MHLW (Japan) were compared to improve its analytical and the pretreatment method. The Linearity, the limit of detection (LOD), the limit of quantification (LOQ), the accuracy, the precision and the recovery ratio were determined from each method with modification in pretreatment method. All HPLC methods exhibited correlation coefficients of calibration curves for canthaxanthin as 0.9999. The analysis methods from FSA, AOAC, and MLHW showed the LOD of 0.395 ppm, 0.105 ppm, and 0.084 ppm, and the LOQ of 1.196 ppm, 0.318 ppm, 0.254 ppm, respectively. Among tested methods, HPLC method of MHLW with modification in pretreatments was finally selected for the analysis of canthaxanthin in lab, because it exhibited the resolution factor of 4.0 and the selectivity of 1.30. This analysis method showed a correlation coefficients value of 0.9999 and the lowest LOD and LOQ. Furthermore, the precision ratio was lower than 1 and the accuracy was almost 100%. The method presented the recovery ratio of 90-110% with modification in pretreatment method. The cross-validation of coefficient variation was 5 or less among tested three institutions in Korea.

Keywords: analytic method, canthaxanthin, food colorants, pretreatment method

Procedia PDF Downloads 683

Authors: Sandeep Santosh, O. P. Sahu

Abstract:

In this paper, performance comparison of wideband covariance matrix sparse representation (W-CMSR) method with other existing wideband Direction of Arrival (DOA) estimation methods has been made.W-CMSR relies less on a priori information of the incident signal number than the ordinary subspace based methods.Consider the perturbation free covariance matrix of the wideband array output. The diagonal covariance elements are contaminated by unknown noise variance. The covariance matrix of array output is conjugate symmetric i.e its upper right triangular elements can be represented by lower left triangular ones.As the main diagonal elements are contaminated by unknown noise variance,slide over them and align the lower left triangular elements column by column to obtain a measurement vector.Simulation results for W-CMSR are compared with simulation results of other wideband DOA estimation methods like Coherent signal subspace method (CSSM), Capon, l1-SVD, and JLZA-DOA. W-CMSR separate two signals very clearly and CSSM, Capon, L1-SVD and JLZA-DOA fail to separate two signals clearly and an amount of pseudo peaks exist in the spectrum of L1-SVD.

Keywords: W-CMSR, wideband direction of arrival (DOA), covariance matrix, electrical and computer engineering

Procedia PDF Downloads 471