Mathematical Models For Treatment Time Of Pathogenic Infection In Blood After Antibiotics Administration,
2017
Faculty of Science
Mathematical Models For Treatment Time Of Pathogenic Infection In Blood After Antibiotics Administration, Panit Suavansri
Chulalongkorn University Theses and Dissertations (Chula ETD)
The objective in this thesis is to create a mathematical model to predict the period of time needed to clear out the pathogens from the bloodstream after the patient receives certain antibiotics. The result will lead to the time where the drug administration can be terminated. This research is to compute the densities of bacteria and malaria in bloodstream at any given time and to compare this level with the actual results of the patient's blood sampling, which was sent to the laboratory for investigation. The laboratory process of the blood sampling will usually take more than 2-3 days to …
Explicit Formula For Conditional Expectations Of Product Of Polynomial And Exponential Function Of Affine Transform Of Extended Cox-Ingersoll-Ross Process,
2017
Faculty of Science
Explicit Formula For Conditional Expectations Of Product Of Polynomial And Exponential Function Of Affine Transform Of Extended Cox-Ingersoll-Ross Process, Phiraphat Sutthimat
Chulalongkorn University Theses and Dissertations (Chula ETD)
In this thesis an explicit formula for conditional expectations of the product of polynomial and exponential function of an affine transform is derived under the extended function of an transform is derived under the extended Cox-Ingersoll-Ross (ECIR) process. By applying the Feynman-Kac theorem, the explicit formula is revealed from the solution of the corresponding partial differential equation. To support the validity of the obtained results, we, herein, conduct Monte Carlo simulations to investigate the accuracy of the explicit formula.
Cuckoo Search And Enhanced Artificial Bee Colony Heuristic Methods For Vehicle Routing Problem With Backhaul And Time Window Constraints,
2017
Faculty of Science
Cuckoo Search And Enhanced Artificial Bee Colony Heuristic Methods For Vehicle Routing Problem With Backhaul And Time Window Constraints, Tanawat Worawattawechai
Chulalongkorn University Theses and Dissertations (Chula ETD)
The vehicle routing problem with backhauls and time windows (VRPBTW) aims to find a feasible vehicle route that minimizes the total traveling distance while imposing capacity, backhaul, and time-window constraints. In this dissertation, a mathematical model of VRPBTW is introduced to obtain an optimal solution. The heuristics, namely the nearest urgent candidate (NUC), which applies the urgency priority and candidate techniques, and the nearest neighbor with roulette wheel selection (NNRW) which is a combination of a roulette wheel selection method and the improved nearest neighbor heuristic, are also presented to solve this problem. Moreover, two metaheuristic methods are presented to …
Global Well-Posedness Of Reaction-Diffusion Equations With Non-Radial Kernel Function,
2017
Faculty of Science
Global Well-Posedness Of Reaction-Diffusion Equations With Non-Radial Kernel Function, Apassara Suechoei
Chulalongkorn University Theses and Dissertations (Chula ETD)
In this thesis, we study the following reaction-diffusion equation:[Equation] where f is a continuously differentiable function on R , α > 0 is a constant, [sumbol] is a continuous function and is non-radial kernel function. We establish the corresponding comparison principle. Then, we prove the local existence and uniqueness result based on the monotone iteration sequence technique. Finally, certain sufficient conditions on the local nonlinear term that guarantee the existence and uniqueness of global solution are specified.
Boundedness Of Green Operators For Nonlocal Equations On Weighted Lebesgue Spaces,
2017
Faculty of Science
Boundedness Of Green Operators For Nonlocal Equations On Weighted Lebesgue Spaces, Itthinat Nuntajittanond
Chulalongkorn University Theses and Dissertations (Chula ETD)
In this research. we establish the local existence and uniqueness of solutions for the Cauchy problem of the nonlocal equation of the form ∂ₜU(x.t) = ∫R n J(x.Y)U(Y,t)dY – U (x.t) + (In(e + I x I2)) U p (x,t) where p > 1 and ∂ > 0 are constants. In this research, the kernel / of the nonlocal term may not radially symmetric. We investigate the Cauchy problem on weighted Lebesgue spaces with a logarithmic weight. One of the most important results in this thesis is the boundedness of the corresponding Green operator on the weight Lebesgue spaces. We also establish …
F-Cs-Rickart Modules,
2017
Faculty of Science
F-Cs-Rickart Modules, Julalak Kaewwangsakoon
Chulalongkorn University Theses and Dissertations (Chula ETD)
No abstract provided.
Quotients Induced From Exponents Of Finite Commutative Rings,
2017
Faculty of Science
Quotients Induced From Exponents Of Finite Commutative Rings, Kantapong Wannatong
Chulalongkorn University Theses and Dissertations (Chula ETD)
We use the concept of exponent of finite commutative rings to define the Carmichael quotients and the Carmichael quotients of degree d over polynomial rings over finite local rings, and then we give some congruence relations of these quotients. Moreover, we define the Carmichael quotients and the Wilson quotients over the ring of integers of number fields and study some congruence relations between them.
Non-Uniform Bounds On Normal Approximation Via Stein's Method And Exchangeable Pair,
2017
Faculty of Science
Non-Uniform Bounds On Normal Approximation Via Stein's Method And Exchangeable Pair, Kantapong Wannatong
Chulalongkorn University Theses and Dissertations (Chula ETD)
This dissertation consists of two parts. In the first, we improve the technique of Chuntee and Neammanee (2017) to obtain an exponential non-uniform bound on normal approximation for any random variables whose exchangeable pair can be constructed. Moreover, we give applications of the theorem to obtain non-uniform exponential bounds of normal approximations for sums of bounded independent random variables, the numbers of descents and inversions of permutation and combinatorial central limit theorem for real numbers. In the second part, we construct a new version of the Rosenthal inequality and improve the technique of Simcharoen and Neammanee (2016) to obtain a …
Anomalous Assemblage Detection Using Nearest Neighbor Distance,
2017
Faculty of Science
Anomalous Assemblage Detection Using Nearest Neighbor Distance, Kayyasit Singkarn
Chulalongkorn University Theses and Dissertations (Chula ETD)
The outlierness of an instance in this thesis is defined based on the distance between two instances. For some datasets, outliers may not be isolated and formed small clusters. C-anomalous assemblage is a group of associated outliers having the number of instances less than or equal to C percent of the total instances. This thesis presents the anomalous assemblage detection algorithm called CND using a nearest neighbor distance for an anomalous score. The algorithm computes the index k equal to floor function of C percent times the total number of instances and uses the k-nearest neighbor distance for representing an …
Extreme Anomalous Clustering Algorithm,
2017
Faculty of Science
Extreme Anomalous Clustering Algorithm, Panuruk Lisuwan
Chulalongkorn University Theses and Dissertations (Chula ETD)
A clustering algorithm is a process of dividing data points into disjoint clusters according to the similarity of the data points. Many researchers have presented and developed the clustering algorithms to be suitable for the different characteristics of the datasets. Therefore, the concept of the identifying anomaly data points in the dataset was adopted in this thesis to explain the similarity of the data points. The main idea is to calculate the minimum distance between data points to identify the extreme anomalous score of all data points. In this thesis, a novel clustering algorithm is proposed called the Extreme Anomalous …
Measurement For Disordered Proteins Affecting Scale-Free Network,
2017
Faculty of Science
Measurement For Disordered Proteins Affecting Scale-Free Network, Satanat Kitsiranuwat
Chulalongkorn University Theses and Dissertations (Chula ETD)
No abstract provided.
Clifford Algebra-Valued Segal-Bargmann Transform,
2017
Faculty of Science
Clifford Algebra-Valued Segal-Bargmann Transform, Sorawit Eaknipitsari
Chulalongkorn University Theses and Dissertations (Chula ETD)
A classical Segal-Bargmann transform maps square-integrable functions on R to holomorphic square-integrable functions on C with respect to some Gaussian measure. In this work, we extend the classical Segal-Bargmann transform to functions taking values in a Clifford algebra. We establish that in this setting, the generalized Segal-Bargmann transform is a unitary isomorphism mapping Clifford algebra-valued square-integrable functions on Rⁿ with respect to some Gaussian measure to monogenic square-integrable functions on Rⁿ⁺¹ with respect to another Gaussian measure. We also discuss about the differential and multiplication operators in the monogenic functions space as well as certain properties of their domains.
Complete Convergence For Sequences Of Coordinatewise Widely Orthant Dependent Random Vectors In Hilbert Spaces,
2017
Faculty of Science
Complete Convergence For Sequences Of Coordinatewise Widely Orthant Dependent Random Vectors In Hilbert Spaces, Teerayut Phutthanukool
Chulalongkorn University Theses and Dissertations (Chula ETD)
In this thesis, we introduce a new dependence concept for a sequence of random vectors taking values in real separable Hilbert spaces called coordinate-wise widely orthant dependence and extend the Baum-Katz Theorem to obtain complete convergence and complete moment convergence for a sequence of co-ordinatewise widely orthant dependent random vectors taking values in Hilbert spaces.
Strategies For Playing Closing Octagons Game In Some Situations,
2017
Faculty of Science
Strategies For Playing Closing Octagons Game In Some Situations, Thitiphut Leelathanakit
Chulalongkorn University Theses and Dissertations (Chula ETD)
Closing Octagons game is a combinatorial game for two players that we modify from Dots and Boxes game and Dots and Hexagons game. The game starts with an m × n array of octagons such that every two adjacent octagons has one common side and 0 points for both players. Two players alternately turn by the following rules. (i) A player moves by coloring one side of an octagon. (ii) A player who colors the eighth side of k octagons earns k points and takes one more move. The game ends when every side of octagons has been colored and …
Patterns Of Lines Intersecting On Plane,
2017
Faculty of Science
Patterns Of Lines Intersecting On Plane, Wongtawan Chamnan
Chulalongkorn University Theses and Dissertations (Chula ETD)
In this work, we are interested in patterns of n lines on the plane such that lines produce M intersecting points. One famous related problem is called Fourier's 17 line problem. Although there are only a few known necessary conditions for realization, some arrangements may not even drawable. Consequently, we try to find more necessary conditions for this problem that can lead to possible arrangements and realize the arrangements. We provide a systematic algorithm to draw the possible arrangements. We establish lemmas for the direct drawing and find some certain cases of arrangements which are drawable. We also provide another …
การวิเคราะห์การคำนวณเมคสแปนสำหรับปัญหาการจัดตารางการผลิตแบบตามสั่ง,
2017
คณะวิทยาศาสตร์
การวิเคราะห์การคำนวณเมคสแปนสำหรับปัญหาการจัดตารางการผลิตแบบตามสั่ง, วันเฉลิม โฮชิน
Chulalongkorn University Theses and Dissertations (Chula ETD)
เมคสแปนในปัญหาการจัดตารางการผลิตแบบตามสั่งเป็นค่าที่สำคัญในการหาค่าผลเฉลยใกล้เคียงของการค้นหาแบบทาบู อย่างไรก็ตามขั้นตอนการหาค่าผลเฉลยใกล้เคียงเป็นส่วนที่ใช้เวลาประมวลผลนานที่สุด วิทยานิพนธ์เล่มนี้ทำการปรับปรุงเทคนิคการหาค่าผลเฉลยใกล้เคียงด้วยค่าเมคสแปนที่ถูกเสนอโดย Nowicki และ Smutnicki (2005) และเปรียบเทียบความซับซ้อนของเวลาของวิธีการหาค่าผลเฉลยใกล้เคียง ระหว่างวิธีการของ Nowicki และ Smutnicki และวิธีการที่ได้ปรับปรุงขึ้น ความแตกต่างที่สำคัญของทั้งสองวิธีการคือการหาตำแหน่งสำคัญบางตำแหน่งบนลำดับโทโพโลยีของผลเฉลยเมล็ดพันธุ์ ทั้งสองวิธีการใช้ปัญหามาตรฐานที่มีจำนวนโอเปอเรชันไม่เกิน 400 โอเปอเรชัน ในการทดสอบ ผลการทดลองพบว่า ขั้นตอนวิธีการค้นหาแบบทาบูที่ใช้ขั้นตอนการหาค่าผลเฉลยใกล้เคียงด้วยวิธีการที่ได้ปรับปรุงขึ้น ใช้เวลาประมวลผลน้อยกว่าวิธีการค้นหาแบบทาบูที่ใช้ขั้นตอนการหาค่าผลเฉลยใกล้เคียงด้วยวิธีการของ Nowicki และ Smutnicki
Developing Conceptual Understanding And Procedural Fluency In Algebra For High School Students With Intellectual Disability,
2017
Virginia Commonwealth University
Developing Conceptual Understanding And Procedural Fluency In Algebra For High School Students With Intellectual Disability, Andrew J. Wojcik
Theses and Dissertations
Teaching students with Intellectual Disability (ID) is a relatively new endeavor. Beginning in 2001 with the passage of the No Child Left Behind Act, the general education curriculum integrated algebra across the K-12 curriculum (Kendall, 2011; National Governors Association Center for Best Practices & Council of Chief State School Officers, 2010), and expansion of the curriculum included five intertwined skills (productive disposition, procedural fluency, strategic competence, adaptive reasoning, and conceptual understanding) (Kilpatrick, Swafford, & Findell, 2001). Researchers are just beginning to explore the potential of students with ID with algebra (Browder, Spooner, Ahlgrim-Delzell, Harris & Wakeman, 2008; Creech-Galloway, Collins, Knight, …
Series Solutions Of Polarized Gowdy Universes,
2017
Virginia Commonwealth University
Series Solutions Of Polarized Gowdy Universes, Doniray Brusaferro
Theses and Dissertations
Einstein's field equations are a system of ten partial differential equations. For a special class of spacetimes known as Gowdy spacetimes, the number of equations is reduced due to additional structure of two dimensional isometry groups with mutually orthogonal Killing vectors. In this thesis, we focus on a particular model of Gowdy spacetimes known as the polarized T3 model, and provide an explicit solution to Einstein's equations.
Stochastic Modelling For Levy Distributed Systems,
2017
Technological University Dublin
Stochastic Modelling For Levy Distributed Systems, Jonathan Blackledge, T Raja Rani
Articles
The purpose of this paper is to examine a range of results that can be derived from Einstein’s evolution equation focusing on (but not in an exclusive sense) the effect of introducing a L´evy distribution. In this context, we examine the derivation (as derived from the Einstein’s evolution equation) of the classical and fractional diffusion equations, the classical and generalised Kolmogorov-Feller equations, the evolution of self-affine stochastic fields through the fractional diffusion equation and the fractional Schr¨odinger equation, the fractional Poisson equation (for the time independent case), and, a derivation of the Lyapunov exponent. In this way, we provide a …
Information Hiding With Data Diffusion Using Convolutional Encoding For Super-Encryption,
2017
Technological University Dublin
Information Hiding With Data Diffusion Using Convolutional Encoding For Super-Encryption, Jonathan Blackledge, Paul Tobin, J. Myeza, C.M. Adolfo
Articles
The unification of data encryption with information hiding methods continues to receive significant attention because of the importance of protecting encrypted information by making it covert. This is because one of the principal limitations in any cryptographic system is that encrypted data flags the potential importance of the data (i.e. the plaintext information that has been encrypted) possibly leading to the launch of an attack which may or may not be successful. Information hiding overcomes this limitation by making the data (which may be the plaintext or the encrypted plaintext) imperceptible, the security of the hidden information being compromised if …
