Theoretical and Practical Bounds on the Initial Value of Skew-Compensated Clock for Clock Skew Compensation Algorithm Immune to Floating-Point Precision Loss
This document presents a paper on theoretical and practical bounds for the initial value of a skew-compensated clock used in clock skew compensation algorithms. It begins with background on clock skew compensation based on an extended Bresenham's algorithm. It then derives optimal error bounds for floating-point operations and uses these to extend the main theorem to provide tighter theoretical bounds on the initial clock value. It also loosens these bounds for practical implementation with limited precision. Numerical examples are provided to compare the derived bounds with results from single and double precision arithmetic. The paper aims to make clock skew compensation algorithms more robust to floating-point precision loss.
Kyeong Soo Kim, "Theoretical and Practical Bounds on the Initial Value of Skew-Compensated Clock for Clock Skew Compensation Algorithm Immune to Floating-Point Precision Loss (Extended Version)," Special lecture, Department of Mathematics, Chungnam National University (CNU), Daejoen, Korea, January 25, 2023.
Kyeong Soo Kim, "Clock skew compensation algorithm immune to floating-point precision loss," Invited talk, to be delivered at 2022 International Workshop on Mathematics and Its Applications, Chungnam National University (CNU), Daejoen, Korea, August 4-5, 2022.
Computation of Electromagnetic Fields Scattered from Dielectric Objects of Un...Alexander Litvinenko
We research how input uncertainties in the geometry shape propagate through the electromagnetic model to electro-magnetic fields. We use multi-level Monte Carlo methods.
This paper presents a design and implementation of FPGA based Bose, Chaudhuri and Hocquenghem (BCH) codes for wireless communication applications. The codes are written in VHDL (Very High Speed Hardware Description Language). Here BCH decoder (15, 5, and 3) is implemented and discussed. And decoder uses serial input and serial output architecture. BCH code forms a large class of powerful random error correcting cyclic codes. BCH operates over algebraic structure called finite fields and they are binary multiple error correcting codes. BCH decoder is implemented by syndrome calculation circuit, the BMA (Berlekamp-Massey algorithm) and Chien search circuit. The codecs are implemented over cyclone FPGA device.
We have implemented a multiple precision ODE solver based on high-order fully implicit Runge-Kutta(IRK) methods. This ODE solver uses any order Gauss type formulas, and can be accelerated by using (1) MPFR as multiple precision floating-point arithmetic library, (2) real tridiagonalization supported in SPARK3, of linear equations to be solved in simplified Newton method as inner iteration, (3) mixed precision iterative refinement method\cite{mixed_prec_iterative_ref}, (4) parallelization with OpenMP, and (5) embedded formulas for IRK methods. In this talk, we describe the reason why we adopt such accelerations, and show the efficiency of the ODE solver through numerical experiments such as Kuramoto-Sivashinsky equation.
In order to provide the design guidance for a multiple stage refrigerator for hosting a quantum computing device targeting for unmanned transportation platform. We provides a modeling analysis based on a preliminary single stage test data, by using Brain Storm Optimization algorithm.
This paper studies an approximate dynamic programming (ADP) strategy of a group of nonlinear switched systems, where the external disturbances are considered. The neural network (NN) technique is regarded to estimate the unknown part of actor as well as critic to deal with the corresponding nominal system. The training technique is simul-taneously carried out based on the solution of minimizing the square error Hamilton function. The closed system’s tracking error is analyzed to converge to an attraction region of origin point with the uniformly ultimately bounded (UUB) description. The simulation results are implemented to determine the effectiveness of the ADP based controller.
Kyeong Soo Kim, "Theoretical and Practical Bounds on the Initial Value of Skew-Compensated Clock for Clock Skew Compensation Algorithm Immune to Floating-Point Precision Loss (Extended Version)," Special lecture, Department of Mathematics, Chungnam National University (CNU), Daejoen, Korea, January 25, 2023.
Kyeong Soo Kim, "Clock skew compensation algorithm immune to floating-point precision loss," Invited talk, to be delivered at 2022 International Workshop on Mathematics and Its Applications, Chungnam National University (CNU), Daejoen, Korea, August 4-5, 2022.
Computation of Electromagnetic Fields Scattered from Dielectric Objects of Un...Alexander Litvinenko
We research how input uncertainties in the geometry shape propagate through the electromagnetic model to electro-magnetic fields. We use multi-level Monte Carlo methods.
This paper presents a design and implementation of FPGA based Bose, Chaudhuri and Hocquenghem (BCH) codes for wireless communication applications. The codes are written in VHDL (Very High Speed Hardware Description Language). Here BCH decoder (15, 5, and 3) is implemented and discussed. And decoder uses serial input and serial output architecture. BCH code forms a large class of powerful random error correcting cyclic codes. BCH operates over algebraic structure called finite fields and they are binary multiple error correcting codes. BCH decoder is implemented by syndrome calculation circuit, the BMA (Berlekamp-Massey algorithm) and Chien search circuit. The codecs are implemented over cyclone FPGA device.
We have implemented a multiple precision ODE solver based on high-order fully implicit Runge-Kutta(IRK) methods. This ODE solver uses any order Gauss type formulas, and can be accelerated by using (1) MPFR as multiple precision floating-point arithmetic library, (2) real tridiagonalization supported in SPARK3, of linear equations to be solved in simplified Newton method as inner iteration, (3) mixed precision iterative refinement method\cite{mixed_prec_iterative_ref}, (4) parallelization with OpenMP, and (5) embedded formulas for IRK methods. In this talk, we describe the reason why we adopt such accelerations, and show the efficiency of the ODE solver through numerical experiments such as Kuramoto-Sivashinsky equation.
In order to provide the design guidance for a multiple stage refrigerator for hosting a quantum computing device targeting for unmanned transportation platform. We provides a modeling analysis based on a preliminary single stage test data, by using Brain Storm Optimization algorithm.
This paper studies an approximate dynamic programming (ADP) strategy of a group of nonlinear switched systems, where the external disturbances are considered. The neural network (NN) technique is regarded to estimate the unknown part of actor as well as critic to deal with the corresponding nominal system. The training technique is simul-taneously carried out based on the solution of minimizing the square error Hamilton function. The closed system’s tracking error is analyzed to converge to an attraction region of origin point with the uniformly ultimately bounded (UUB) description. The simulation results are implemented to determine the effectiveness of the ADP based controller.
I am Grey Nolan. Currently associated with matlabassignmentexperts.com as an assignment helper. After completing my master's from the University of British Columbia, I was in search for an opportunity that expands my area of knowledge hence I decided to help students with their Signals and Systems assignments. I have written several assignments till date to help students overcome numerous difficulties they face in Signals and Systems Assignments.
On The Fundamental Aspects of DemodulationCSCJournals
When the instantaneous amplitude, phase and frequency of a carrier wave are modulated with the information signal for transmission, it is known that the receiver works on the basis of the received signal and a knowledge of the carrier frequency. The question is: If the receiver does not have the a priori information about the carrier frequency, is it possible to carry out the demodulation process? This tutorial lecture answers this question by looking into the very fundamental process by which the modulated wave is generated. It critically looks into the energy separation algorithm for signal analysis and suggests modification for distortionless demodulation of an FM signal, and recovery of sub-carrier signals
Sparse data formats and efficient numerical methods for uncertainties in nume...Alexander Litvinenko
Description of methodologies and overview of numerical methods, which we used for modeling and quantification of uncertainties in numerical aerodynamics
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
MATHEMATICAL MODELING OF COMPLEX REDUNDANT SYSTEM UNDER HEAD-OF-LINE REPAIREditor IJMTER
Suppose a composite system consisting of two subsystems designated as ‘P’ and
‘Q’ connected in series. Subsystem ‘P’ consists of N non-identical units in series, while the
subsystem ‘Q’ consists of three identical components in parallel redundancy.
Fuzzy clustering algorithm can not obtain good clustering effect when the sample characteristic is not obvious and need to determine the number of clusters firstly. For thi0s reason, this paper proposes an adaptive fuzzy kernel clustering algorithm. The algorithm firstly use the adaptive function of clustering number to calculate the optimal clustering number, then the samples of input space is mapped to highdimensional feature space using gaussian kernel and clustering in the feature space. The Matlab simulation results confirmed that the algorithm's performance has greatly improvement than classical clustering algorithm and has faster convergence speed and more accurate clustering results.
Fuzzy clustering algorithm can not obtain good clustering effect when the sample characteristic is not
obvious and need to determine the number of clusters firstly. For thi0s reason, this paper proposes an
adaptive fuzzy kernel clustering algorithm. The algorithm firstly use the adaptive function of clustering
number to calculate the optimal clustering number, then the samples of input space is mapped to highdimensional
feature space using gaussian kernel and clustering in the feature space. The Matlab simulation
results confirmed that the algorithm's performance has greatly improvement than classical clustering algorithm and has faster convergence speed and more accurate clustering results
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
N byte error detecting and correcting code using reed-solomon and cellular au...eSAT Journals
Abstract
Single and double byte errors are most common errors in memory systems. With the advancement of technologies, more information
bytes can be send over a transmission channel, but this increases the probability of more errors. Here we propose a methodology for
detecting and correcting N-byte errors in the information bytes based on cellular automata (CA) concept. Cellular automata already
accepted as an attractive structure for error detecting and correcting codes. In this paper, highly efficient, reliable and less complex
cellular automata based N-byte error correcting encoder and decoder has been proposed. The design is capable of adding 2N check
bytes corresponding to N information bytes at the encoder, which are used at the decoder section to detect and correct the byte errors.
Keywords— Cellular Automata (CA), Reed-Solomon (RS) code, Information Bytes (IB), Check Bytes (CB)
Numerical Evaluation of Complex Integrals of Analytic Functionsinventionjournals
A nine point degree nine quadrature rule with derivatives has been formulated for the numerical evaluation of integral of analytic function along a directed line segment in the complex plane. The truncation error associated with the method has been analyzed using the Taylors’ series expansion and also some particular cases have been discussed for enhancing the degree of precision of the rule and reducingthe number of function evaluations. The methods have been verified by considering standard examples.
This paper deals with the problem of undesired memory effects in nonlinear digital filters owing to the influence of past excitations on future outputs. The nonlinearities under consideration cover the usual types of overflow arithmetic employed in practice. Based on the Hankel norm performance, a new criterion is proposed to ensure the reduction of undesired memory effects in digital filters with overflow arithmetic. In absence of external input, the nonexistence of overflow oscillations is also confirmed by the proposed criterion. A numerical example together with simulation result showing the effectiveness of the criterion is given.
Kyeong Soo Kim, "Energy-efficient time synchronization in wireless sensor networks," Invited talk, 2019 Distinguished Lecture and International Interdisciplinary Workshop, Chungnam National University (CNU), Daejeon, Korea, August 5-9, 2019.
Kyeong Soo Kim, "Atomic scheduling of appliance energy consumption in residential smart grid," Invited talk, CNU International Workshop on Industrial Mathematics, Chungnam National University (CNU), Daejeon, Korea, Oct. 7, 2016.
More Related Content
Similar to Theoretical and Practical Bounds on the Initial Value of Skew-Compensated Clock for Clock Skew Compensation Algorithm Immune to Floating-Point Precision Loss
I am Grey Nolan. Currently associated with matlabassignmentexperts.com as an assignment helper. After completing my master's from the University of British Columbia, I was in search for an opportunity that expands my area of knowledge hence I decided to help students with their Signals and Systems assignments. I have written several assignments till date to help students overcome numerous difficulties they face in Signals and Systems Assignments.
On The Fundamental Aspects of DemodulationCSCJournals
When the instantaneous amplitude, phase and frequency of a carrier wave are modulated with the information signal for transmission, it is known that the receiver works on the basis of the received signal and a knowledge of the carrier frequency. The question is: If the receiver does not have the a priori information about the carrier frequency, is it possible to carry out the demodulation process? This tutorial lecture answers this question by looking into the very fundamental process by which the modulated wave is generated. It critically looks into the energy separation algorithm for signal analysis and suggests modification for distortionless demodulation of an FM signal, and recovery of sub-carrier signals
Sparse data formats and efficient numerical methods for uncertainties in nume...Alexander Litvinenko
Description of methodologies and overview of numerical methods, which we used for modeling and quantification of uncertainties in numerical aerodynamics
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
MATHEMATICAL MODELING OF COMPLEX REDUNDANT SYSTEM UNDER HEAD-OF-LINE REPAIREditor IJMTER
Suppose a composite system consisting of two subsystems designated as ‘P’ and
‘Q’ connected in series. Subsystem ‘P’ consists of N non-identical units in series, while the
subsystem ‘Q’ consists of three identical components in parallel redundancy.
Fuzzy clustering algorithm can not obtain good clustering effect when the sample characteristic is not obvious and need to determine the number of clusters firstly. For thi0s reason, this paper proposes an adaptive fuzzy kernel clustering algorithm. The algorithm firstly use the adaptive function of clustering number to calculate the optimal clustering number, then the samples of input space is mapped to highdimensional feature space using gaussian kernel and clustering in the feature space. The Matlab simulation results confirmed that the algorithm's performance has greatly improvement than classical clustering algorithm and has faster convergence speed and more accurate clustering results.
Fuzzy clustering algorithm can not obtain good clustering effect when the sample characteristic is not
obvious and need to determine the number of clusters firstly. For thi0s reason, this paper proposes an
adaptive fuzzy kernel clustering algorithm. The algorithm firstly use the adaptive function of clustering
number to calculate the optimal clustering number, then the samples of input space is mapped to highdimensional
feature space using gaussian kernel and clustering in the feature space. The Matlab simulation
results confirmed that the algorithm's performance has greatly improvement than classical clustering algorithm and has faster convergence speed and more accurate clustering results
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
N byte error detecting and correcting code using reed-solomon and cellular au...eSAT Journals
Abstract
Single and double byte errors are most common errors in memory systems. With the advancement of technologies, more information
bytes can be send over a transmission channel, but this increases the probability of more errors. Here we propose a methodology for
detecting and correcting N-byte errors in the information bytes based on cellular automata (CA) concept. Cellular automata already
accepted as an attractive structure for error detecting and correcting codes. In this paper, highly efficient, reliable and less complex
cellular automata based N-byte error correcting encoder and decoder has been proposed. The design is capable of adding 2N check
bytes corresponding to N information bytes at the encoder, which are used at the decoder section to detect and correct the byte errors.
Keywords— Cellular Automata (CA), Reed-Solomon (RS) code, Information Bytes (IB), Check Bytes (CB)
Numerical Evaluation of Complex Integrals of Analytic Functionsinventionjournals
A nine point degree nine quadrature rule with derivatives has been formulated for the numerical evaluation of integral of analytic function along a directed line segment in the complex plane. The truncation error associated with the method has been analyzed using the Taylors’ series expansion and also some particular cases have been discussed for enhancing the degree of precision of the rule and reducingthe number of function evaluations. The methods have been verified by considering standard examples.
This paper deals with the problem of undesired memory effects in nonlinear digital filters owing to the influence of past excitations on future outputs. The nonlinearities under consideration cover the usual types of overflow arithmetic employed in practice. Based on the Hankel norm performance, a new criterion is proposed to ensure the reduction of undesired memory effects in digital filters with overflow arithmetic. In absence of external input, the nonexistence of overflow oscillations is also confirmed by the proposed criterion. A numerical example together with simulation result showing the effectiveness of the criterion is given.
Similar to Theoretical and Practical Bounds on the Initial Value of Skew-Compensated Clock for Clock Skew Compensation Algorithm Immune to Floating-Point Precision Loss (20)
Kyeong Soo Kim, "Energy-efficient time synchronization in wireless sensor networks," Invited talk, 2019 Distinguished Lecture and International Interdisciplinary Workshop, Chungnam National University (CNU), Daejeon, Korea, August 5-9, 2019.
Kyeong Soo Kim, "Atomic scheduling of appliance energy consumption in residential smart grid," Invited talk, CNU International Workshop on Industrial Mathematics, Chungnam National University (CNU), Daejeon, Korea, Oct. 7, 2016.
Kyeong Soo Kim, Invited talk, 2016 International Conference on Internet of Things and 5G Mobile Technologies (2016 ICIOT-5GMT), Guangzhou University, Guangzhou, Nov. 27-28, 2016.
Kyeong Soo Kim, Centre for Smart Grid and Information Convergence (CeSGIC) 1st International Workshop on Smart Grid Technology and Data Processing
Xi'an Jiaotong-Liverpool University (XJTLU)
Suzhou, China
19 June 2015
Kyeong Soo Kim, Academic Weeks Videoconference Session with Pakistan COMSATS Institute of Information Technology (CIIT), Swansea University, Swansea, Wales UK, Dec. 14, 2010.
Tutorial at IEEE 802 LMSC Plenary Session, Dallas, TX, USA, Nov. 13, 2006 (with W. Steven Conner, Intel Corp., Jan Kruys, Cisco Systems, and Juan Carlos Zuniga, InterDigital Comm. Corp.).
- Seminar, Dept. of Electrical and Computer Eng., University of California, Davis, CA, USA, May 14, 2004.
- Seminar, Dept. of Electrical and Systems Eng., Washington University in St. Louis, St. Louis, MO, USA, Dec. 3, 2004.
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
Hierarchical Digital Twin of a Naval Power SystemKerry Sado
A hierarchical digital twin of a Naval DC power system has been developed and experimentally verified. Similar to other state-of-the-art digital twins, this technology creates a digital replica of the physical system executed in real-time or faster, which can modify hardware controls. However, its advantage stems from distributing computational efforts by utilizing a hierarchical structure composed of lower-level digital twin blocks and a higher-level system digital twin. Each digital twin block is associated with a physical subsystem of the hardware and communicates with a singular system digital twin, which creates a system-level response. By extracting information from each level of the hierarchy, power system controls of the hardware were reconfigured autonomously. This hierarchical digital twin development offers several advantages over other digital twins, particularly in the field of naval power systems. The hierarchical structure allows for greater computational efficiency and scalability while the ability to autonomously reconfigure hardware controls offers increased flexibility and responsiveness. The hierarchical decomposition and models utilized were well aligned with the physical twin, as indicated by the maximum deviations between the developed digital twin hierarchy and the hardware.
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...Amil Baba Dawood bangali
Contact with Dawood Bhai Just call on +92322-6382012 and we'll help you. We'll solve all your problems within 12 to 24 hours and with 101% guarantee and with astrology systematic. If you want to take any personal or professional advice then also you can call us on +92322-6382012 , ONLINE LOVE PROBLEM & Other all types of Daily Life Problem's.Then CALL or WHATSAPP us on +92322-6382012 and Get all these problems solutions here by Amil Baba DAWOOD BANGALI
#vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore#blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #blackmagicforlove #blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #Amilbabainuk #amilbabainspain #amilbabaindubai #Amilbabainnorway #amilbabainkrachi #amilbabainlahore #amilbabaingujranwalan #amilbabainislamabad
Final project report on grocery store management system..pdfKamal Acharya
In today’s fast-changing business environment, it’s extremely important to be able to respond to client needs in the most effective and timely manner. If your customers wish to see your business online and have instant access to your products or services.
Online Grocery Store is an e-commerce website, which retails various grocery products. This project allows viewing various products available enables registered users to purchase desired products instantly using Paytm, UPI payment processor (Instant Pay) and also can place order by using Cash on Delivery (Pay Later) option. This project provides an easy access to Administrators and Managers to view orders placed using Pay Later and Instant Pay options.
In order to develop an e-commerce website, a number of Technologies must be studied and understood. These include multi-tiered architecture, server and client-side scripting techniques, implementation technologies, programming language (such as PHP, HTML, CSS, JavaScript) and MySQL relational databases. This is a project with the objective to develop a basic website where a consumer is provided with a shopping cart website and also to know about the technologies used to develop such a website.
This document will discuss each of the underlying technologies to create and implement an e- commerce website.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...
Theoretical and Practical Bounds on the Initial Value of Skew-Compensated Clock for Clock Skew Compensation Algorithm Immune to Floating-Point Precision Loss
1. Theoretical and Practical Bounds on the Initial Value of
Skew-Compensated Clock for Clock Skew Compensation
Algorithm Immune to Floating-Point Precision Loss
Kyeong Soo (Joseph) Kim
(With Seungyeop Kang)
School of Advanced Technology
Xi’an Jiaotong-Liverpool University
2023 International Conference for Mathematics and Its Applications
Chungnam National University
January 16–18, 2023
1 / 36
2.
3. Outline
Background
Review of Clock Skew Compensation Based on Extended Bresenham’s
Algorithm
Clock Skew Compensation with Optimal Error Bounds
Numerical Examples
Conclusions
3 / 36
4. Next . . .
Background
Review of Clock Skew Compensation Based on Extended Bresenham’s
Algorithm
Clock Skew Compensation with Optimal Error Bounds
Numerical Examples
Conclusions
4 / 36
5. Target Environment: WSN/IoT Nodes
▶ Measuring data and/or detect events
with sensors and connected to a
WSN/Internet only through wireless
channels.
▶ Limited in processing and
battery-powered.
5 / 36
6. Target Environment: WSN/IoT Nodes
▶ Measuring data and/or detect events
with sensors and connected to a
WSN/Internet only through wireless
channels.
▶ Limited in processing and
battery-powered.
5 / 36
7. Effect of Clock Skew on Time Synchronization
Ideal
Clock
Faster
Clock
Slower
Clock
Local
Time
Reference
Time
Time
Synchronization
Error
6 / 36
8. Next . . .
Background
Review of Clock Skew Compensation Based on Extended Bresenham’s
Algorithm
Clock Skew Compensation with Optimal Error Bounds
Numerical Examples
Conclusions
7 / 36
9. Hardware Clock Model
▶ We confine our discussions to a network with one head node and one
sensor node WLOG, where we describe the hardware clock T of the
sensor node with respect to the reference clock t of the head node
using the first-order affine clock model1
:
T(t) = (1 + ϵ) t + θ, (1)
where ϵ∈R and θ∈R denote the clock skew and offset, respectively;
(1 + ϵ)∈R+ in (1) is called clock frequency ratio in the literature.
▶ As we focus on the clock skew compensation, we simplify (1) by
setting θ to 0 and obtain
T(t) = (1 + ϵ) t. (2)
1
R. T. Rajan and A.-J. van der Veen, Proc. CAMSAP 2011, Dec. 2011, pp. 297–300.
8 / 36
10. Logical Clock Model
Compensating for the clock skew from the hardware clock T in (2), we can
obtain the logical clock t̂ of the sensor node—i.e., the estimation of the
reference clock t given the hardware clock T—as follows: For
ti<t≤ti+1 (i=0, 1, . . .),
t̂
T(t)
= t̂
T(ti)
+
T(t) − T(ti)
1 + ϵ̂i
, (3)
where ti is the reference time for the ith synchronization and ϵ̂i is the
estimated clock skew from the ith synchronization.2
2
The sensor node does not know the reference clock t as such but only the hardware
clock corresponding to t—i.e., T(t)—during the operation.
9 / 36
11. Theory vs. Reality
5 10 15 20 25 30 35 40 45 50
Number of Messages
10−15
10−14
10−13
10−12
10−11
10−10
10−9
MSE
RLS
CR
Joint MLE
GMLLE (Two-Way)
LB for CR
CRLB for Joint MLE
LB for GMLLE
MSE of the estimated clock skews.a
a
K. S. Kim, S. Lee, and E. G. Lim, IEEE
Trans. Commun., vol. 65, no. 1, pp. 347–359,
Jan. 2017.
0 200 400 600 800 1000 1200 1400 1600 1800
Time [s]
-1E-04
-5E-05
0E+00
5E-05
1E-04
Measurement
Time
Estimation
Error
[s]
EE-ASCFR
Measurement time estimation errors of EE-ASCFR.a
a
X. Huan and K. S. Kim, Comput. Netw.,
vol. 166, pp. 1–8, Jan. 2020.
10 / 36
13. Extension of Bresenham’s Algorithm I
Lemma (boundedness of ▽i)
▽i satisfies the following inequality:
|▽i| 2∆a. (4)
Definition (valid point set)
Given a destination point
(∆a, ∆b), we define a valid point
set V (∆a, ∆b) as a set of the points
on a valid path from (0, 0) to
(∆a, ∆b) according to Bresenham’s
algorithm.
(6,4)
0,0 1 2
1
2
3
4
3 4 5 6
All possible paths from the origin to a given destination point
based on M1 and M2 movements.
12 / 36
14. Extension of Bresenham’s Algorithm II
Definition (backward-reachable set)
Given a point (i, j)∈V (∆a, ∆b), we define a backward-reachable set B(i, j) as
a set of the points that can reach (i, j) by any combination of the movements
M1 and M2 as follows:
B(i, j) ≜
(k, l)|0≤ki, max(0, k−∆a+∆b)≤l≤ min(k, j) . (5)
Definition (extension of ▽i)
For a point (i, j)∈B(∆a, ∆b), we define ▽i(j) as follows:
▽i(j) ≜ 2(i∆b − j∆a). (6)
13 / 36
15. Extension of Bresenham’s Algorithm - III
Lemma (reachability of ▽i(j))
A point (i, j)∈V (∆a, ∆b) is reachable from any point (k, l)∈B(i, j) if we apply
Bresenham’s algorithm using ▽·(·) instead of ▽·.
14 / 36
16. Extension of Bresenham’s Algorithm - IV
Theorem (Clock Skew Compensation Based on Extended
Bresenham’s Algorithm)
Given the hardware clock i, we can obtain its skew-compensated clock j as follows:
Case 1. D
A
1: The skew-compensated clock j satisfies
i
D
A
− 1 j i
D
A
+ 1. (7)
Unless iD
A
is an integer, there are two values satisfying (7). Due to the effect of
limited floating-point precision, however, we cannot know the exact value of iD
A
.
15 / 36
17. Extension of Bresenham’s Algorithm - IV
Theorem (Clock Skew Compensation Based on Extended
Bresenham’s Algorithm)
In this regard, (7) can be extended to include the effect of the precision loss:
i
D
A
− 1 − ε j i
D
A
+ 1 + ε, (8)
where ε(0) is the error due to the precision loss.
Let k, . . ., k+l be the candidate values of j satisfying (8). We determine j by starting
from the point (i−l, k) and applying Bresenham’s algorithm with ▽i−l(k) and on; j
is determined by the y coordinate of the valid point whose x coordinate is i.
15 / 36
18. Extension of Bresenham’s Algorithm - IV
Theorem (Clock Skew Compensation Based on Extended
Bresenham’s Algorithm)
Case 2. D
A
1: In this case, we can decompose the skew-compensated clock j into
two components as follows:
j = i
D
A
= i + i
D − A
A
. (9)
Now that D−A
A
1, we can apply the same procedure of Case 1 to the second
component in (9) by setting ∆a and ∆b to A and D−A, respectively. Let ¯
j be the
result from the procedure. The skew-compensated clock j is given by i+ ¯
j as per (9).
15 / 36
19. Clock Skew Compensation Example
− 4 − 3
+ 1
− 2 − 1
+ 2
+ 3
+ 4
An example of common starting points reaching all possible candidate points for the case of ∆b
∆a ≤1.
16 / 36
20. ̂
T
∆
∆
−
− ( )
1 + ̂
0,0
Eq. (8)
Clock skew compensation based on extended Bresenham’s algorithm.
17 / 36
21. Next . . .
Background
Review of Clock Skew Compensation Based on Extended Bresenham’s
Algorithm
Clock Skew Compensation with Optimal Error Bounds
Numerical Examples
Conclusions
18 / 36
22. Issues in The Clock Skew Compensation Based on
Extended Bresenham’s Algorithm
▶ The extended bounds on the value of skew-compensated clock, which
are closely related with the initial condition of the proposed algorithm,
include a term for floating-point operation error due to precision loss
(i.e., ε in (8)).
▶ The value of ε is not explicitly mentioned in the theorem but
approximately set for numerical examples based on the property of the
single-precision floating-point format as defined in the IEEE standard for
floating-point arithmetic (IEEE 754-2008) [1].
▶ We revisit the main theorem, therefore, and provide practical as well as
theoretical bounds based on a systematic analysis of the errors of
floating-point operations.
19 / 36
23. Relative Errors of Floating-Point Operations - I
▶ An associated set of floating point numbers F with a base β and a precision
p and no restriction on the exponent range is defined as follows:
F = {0} ∪
n
Mβe
M, e ∈ Z, βp−1
≤ |M| βp
o
. (10)
▶ Let fl : R → F denote a round-to-nearest function satisfying
|t − fl(t)| = min
f∈F
|t − f|, t ∈ R. (11)
Single-precision floating-point format based on IEEE 754 standard.3
3
“Single-precision floating-point format,” Wikipedia: The Free Encyclopedia,
Wikimedia Foundation, Accessed: Aug. 4, 2022.
20 / 36
24. Relative Errors of Floating-Point Operations - II
Based on F and fl, we can define two relative errors for t∈R and t,0:
E1(t) ≜
|t − fl(t)|
|t|
(12)
E2(t) ≜
|t − fl(t)|
|fl(t)|
, (13)
where E1 and E2 are the errors relative to t and fl(t), respectively.
21 / 36
25. Relative Errors of Floating-Point Operations - III
Table: Optimal relative error bounds 4.
t bound on E1(t) bound on E2(t)
real number u
1+u
u
xy u
1+u
u
x/y
u − 2u2
if β = 2,
u
1+u
if β 2
u−2u2
1+u−2u2 if β = 2,
u if β 2
▶ x, y∈F.
▶ u=1
2
β1−p
is the unit roundoff associated with fl and F.
4
C.-P. Jeannerod and S. M. Rump, Mathematics of computation, vol. 87, no. 310, pp.
803–819, 2018.
22 / 36
26. Bounds on The Initial Value of Skew-Compensated Clock
Lemma
For t=x
y
z
, where x, y, z∈R with x, y≥0 and z0, fl(t) satisfies
1 − u + 2u2
(1 + u)2(1 + 2u)
t ≤ fl(t) ≤
(1 + 2u)3
(1 + u − 2u2
)
(1 + u)2
t. (14)
▶ Note that ε (≥0) in (8) of the main theorem indicates the error due to
the precision loss in computing iD
A
.
▶ The above lemma provides the optimal bounds on the initial value of
skew-compensated clock based on the floating-point operations of
non-negative real numbers.
23 / 36
27. Extension of The Main Theorem
Now (8) of the main theorem can be extended as follows:
$
1−u+2u2
(1+u)2(1+2u)
t
%
≤ j ≤
(1 + 2u)3
(1+u−2u2
)
(1+u)2
t
'
, (15)
where t=iD
A
and u=2−p
.
24 / 36
28. Loosening Bounds for Practical Implementation I
▶ Though (15) provides theoretically-guaranteed lower and upper bounds
on the initial value of skew-compensated clock j, obtaining the exact
values of bounds—i.e., the lhs and the rhs—could be a challenge,
especially at resource-constrained sensor nodes with limited
floating-point precision.
▶ For its practical implementation based on limited floating-point
precision, therefore, we can loosen the lhs and the rhs of (15) as follows:
$
1−u+2u2
(1+u)2(1+2u)
t
%
≤ j ≤
(1 + 2u)3
(1+u−2u2
)
(1+u)2
t
'
,
$
1−u
(1+2u)3
t
%
≤ j ≤
l
(1 + 2u)3
t
m
. (16)
25 / 36
29. Loosening Bounds for Practical Implementation II
▶ Note that the lhs and the rhs of (16) consist only of the elements of F,
i.e.,
1 − u = (2p
− 1) 2−p
∈ F,
1 + 2u =
2p−1
+ 1
21−p
∈ F,
which eliminates the rounding errors for those terms not belonging to
F in (15).
26 / 36
30. Next . . .
Background
Review of Clock Skew Compensation Based on Extended Bresenham’s
Algorithm
Clock Skew Compensation with Optimal Error Bounds
Numerical Examples
Conclusions
27 / 36
31. Experimental Settings
▶ We fix D to 1, 000, 000 and generate one million samples of A whose
clock skews are uniformly distributed in the range of
[−100 ppm, 100 ppm].
▶ For the clock skew compensation by single and double-precision
floating-point arithmetic, we round down the results to obtain integer
values.
▶ The calculated bounds are compared to those based on binary512
floating-point format providing 489 precision in bits, which serve as a
reference for the comparison.
28 / 36
32. Comparison of Bounds
Bounds i
∆LB*
∆UB†
Min. Max. Avg. Min. Max. Avg.
1e6 0 0 0 0 0 0
Theoretical bounds of (15) 1e7 0 0 0 0 0 0
based on double precision 1e8 0 0 0 0 0 0
1e9 0 0 0 0 0 0
1e6 0 0 0 0 0 0
Theoretical bounds of (15) 1e7 −1 0 −5.0115e−1 0 1 2.2325e−1
based on single precision 1e8 -18 0 −7.9666 0 6 1.7206
1e9 -125 0 −4.7102e1 0 104 3.6533e1
1e6 0 0 0 0 0 0
Practical bounds of (16) 1e7 0 2 1.0023 0 1 2.2325e−1
based on single precision 1e8 0 12 5.9980 0 6 2.9912
1e9 0 120 5.9890e1 0 60 2.9880e1
1e6 0 1 4.9696e−1 0 0 0
Approximate bounds of (11) of [2] 1e7 −2 1 −5.0346e−1 −2 1 −2.8513e−1
based on single precision with ε=10−7
i 1e8 -20 10 −5.0063 -20 10 −4.8369
1e9 -199 100 −4.9669e1 -199 100 −4.9645e1
*
∆LB = LBbinary512 − LB, where LBbinary512 is the lower bound of (15) based on binary512.
†
∆UB = UB − UBbinary512, where UBbinary512 is the upper bound of (15) based on binary512.
29 / 36
33. Comparison of Algorithms
Algorithm i
Compensation error*
# of iterations
Min. Max. Avg. Min. Max. Avg.
Single precision†
1e6 0 0 0 – – –
1e7 0 0 0 – – –
1e8 −4 1 −1.9842 – – –
1e9 -19 44 1.2502e1 – – –
1e6 −1 0 −4.9663e−1 1 2 1.5034
Clock skew compensation with 1e7 −1 0 −4.9668e−1 1 8 4.5232
practical bounds of (16) 1e8 −1 0 −5.0220e−1 1 72 3.6710e1
1e9 −1 0 −4.9734e−1 1 832 4.1872e2
1e6 −1 0 −4.9663e−1 2 2 2
Clock skew compensation with 1e7 −1 0 −4.9668e−1 3 4 3.0050
approximate bounds of (11) of [2] 1e8 −1 0 −5.0220e−1 21 22 2.1005e1
1e9 −1 0 −4.9734e−1 201 202 2.0101e2
*
With respect to ⌊iD
A
⌋ based on double precision.
†
⌊iD
A
⌋ based on single precision.
30 / 36
34. Discussions: Comparison of Bounds
▶ Double precision is enough for the calculation of the theoretical
bounds of (15), while the results for both theoretical bounds of (15) and
the approximate bounds of [2] based on single precision violate the
reference bounds of (15) based on binary512 due to the floating-point
precision loss.
▶ This implies that the correctness of the results of the clock skew
compensation based on the main theorem with the approximate bounds
cannot be theoretically guaranteed.
▶ The loose practical bounds of (16) based on single precision do not
violate the reference bounds in spite of the limited floating-point
precision.
▶ It turns out that the loosening of the bounds counteracts the effect of
limited floating-point precision on the calculation of (16).
31 / 36
35. Discussions: Comparison of Bounds
▶ Double precision is enough for the calculation of the theoretical
bounds of (15), while the results for both theoretical bounds of (15) and
the approximate bounds of [2] based on single precision violate the
reference bounds of (15) based on binary512 due to the floating-point
precision loss.
▶ This implies that the correctness of the results of the clock skew
compensation based on the main theorem with the approximate bounds
cannot be theoretically guaranteed.
▶ The loose practical bounds of (16) based on single precision do not
violate the reference bounds in spite of the limited floating-point
precision.
▶ It turns out that the loosening of the bounds counteracts the effect of
limited floating-point precision on the calculation of (16).
31 / 36
36. Discussions: Comparison of Bounds
▶ Double precision is enough for the calculation of the theoretical
bounds of (15), while the results for both theoretical bounds of (15) and
the approximate bounds of [2] based on single precision violate the
reference bounds of (15) based on binary512 due to the floating-point
precision loss.
▶ This implies that the correctness of the results of the clock skew
compensation based on the main theorem with the approximate bounds
cannot be theoretically guaranteed.
▶ The loose practical bounds of (16) based on single precision do not
violate the reference bounds in spite of the limited floating-point
precision.
▶ It turns out that the loosening of the bounds counteracts the effect of
limited floating-point precision on the calculation of (16).
31 / 36
37. Discussions: Comparison of Bounds
▶ Double precision is enough for the calculation of the theoretical
bounds of (15), while the results for both theoretical bounds of (15) and
the approximate bounds of [2] based on single precision violate the
reference bounds of (15) based on binary512 due to the floating-point
precision loss.
▶ This implies that the correctness of the results of the clock skew
compensation based on the main theorem with the approximate bounds
cannot be theoretically guaranteed.
▶ The loose practical bounds of (16) based on single precision do not
violate the reference bounds in spite of the limited floating-point
precision.
▶ It turns out that the loosening of the bounds counteracts the effect of
limited floating-point precision on the calculation of (16).
31 / 36
38. Discussions: Comparison of Algorithms
▶ For the randomly-generated one million samples of A, the clock skew
compensation algorithm of [2] with both approximate and practical
bounds provides exactly the same bounded compensation errors
compared to the unbounded errors for the single-precision algorithm.
▶ The numbers of iterations with the practical bounds are larger than
those with the approximate bounds for i≥1e7.
▶ This indicates that the approximate bounds of [2] could provide valid
initial conditions for the cases considered in these examples with less
numbers of iterations than those for the practical bounds of (16) but at
the expense of the lack of theoretical guarantee.
32 / 36
39. Discussions: Comparison of Algorithms
▶ For the randomly-generated one million samples of A, the clock skew
compensation algorithm of [2] with both approximate and practical
bounds provides exactly the same bounded compensation errors
compared to the unbounded errors for the single-precision algorithm.
▶ The numbers of iterations with the practical bounds are larger than
those with the approximate bounds for i≥1e7.
▶ This indicates that the approximate bounds of [2] could provide valid
initial conditions for the cases considered in these examples with less
numbers of iterations than those for the practical bounds of (16) but at
the expense of the lack of theoretical guarantee.
32 / 36
40. Discussions: Comparison of Algorithms
▶ For the randomly-generated one million samples of A, the clock skew
compensation algorithm of [2] with both approximate and practical
bounds provides exactly the same bounded compensation errors
compared to the unbounded errors for the single-precision algorithm.
▶ The numbers of iterations with the practical bounds are larger than
those with the approximate bounds for i≥1e7.
▶ This indicates that the approximate bounds of [2] could provide valid
initial conditions for the cases considered in these examples with less
numbers of iterations than those for the practical bounds of (16) but at
the expense of the lack of theoretical guarantee.
32 / 36
41. Next . . .
Background
Review of Clock Skew Compensation Based on Extended Bresenham’s
Algorithm
Clock Skew Compensation with Optimal Error Bounds
Numerical Examples
Conclusions
33 / 36
42. Conclusions
▶ Revisit the main theorem of [2] and derive theoretical and practical
bounds on the initial value of skew-compensated clock based on a
systematic analysis of the errors of floating-point operations.
▶ The theoretical bounds provide a reference framework for the analysis
and comparison of bounds on the initial value of skew-compensated
clock.
▶ The practical bounds could replace the approximate bounds suggested
in [2] as an implementation option for limited floating-point precision.
▶ Demonstrate through numerical examples that the proposed practical
bounds based on single-precision floating-point format do not violate
the theoretical bounds and thereby can guarantee the correctness of
the clock skew compensation even on resource-constrained computing
platforms like WSN/IoT sensor nodes.
34 / 36
43. Conclusions
▶ Revisit the main theorem of [2] and derive theoretical and practical
bounds on the initial value of skew-compensated clock based on a
systematic analysis of the errors of floating-point operations.
▶ The theoretical bounds provide a reference framework for the analysis
and comparison of bounds on the initial value of skew-compensated
clock.
▶ The practical bounds could replace the approximate bounds suggested
in [2] as an implementation option for limited floating-point precision.
▶ Demonstrate through numerical examples that the proposed practical
bounds based on single-precision floating-point format do not violate
the theoretical bounds and thereby can guarantee the correctness of
the clock skew compensation even on resource-constrained computing
platforms like WSN/IoT sensor nodes.
34 / 36
44. Conclusions
▶ Revisit the main theorem of [2] and derive theoretical and practical
bounds on the initial value of skew-compensated clock based on a
systematic analysis of the errors of floating-point operations.
▶ The theoretical bounds provide a reference framework for the analysis
and comparison of bounds on the initial value of skew-compensated
clock.
▶ The practical bounds could replace the approximate bounds suggested
in [2] as an implementation option for limited floating-point precision.
▶ Demonstrate through numerical examples that the proposed practical
bounds based on single-precision floating-point format do not violate
the theoretical bounds and thereby can guarantee the correctness of
the clock skew compensation even on resource-constrained computing
platforms like WSN/IoT sensor nodes.
34 / 36
45. Conclusions
▶ Revisit the main theorem of [2] and derive theoretical and practical
bounds on the initial value of skew-compensated clock based on a
systematic analysis of the errors of floating-point operations.
▶ The theoretical bounds provide a reference framework for the analysis
and comparison of bounds on the initial value of skew-compensated
clock.
▶ The practical bounds could replace the approximate bounds suggested
in [2] as an implementation option for limited floating-point precision.
▶ Demonstrate through numerical examples that the proposed practical
bounds based on single-precision floating-point format do not violate
the theoretical bounds and thereby can guarantee the correctness of
the clock skew compensation even on resource-constrained computing
platforms like WSN/IoT sensor nodes.
34 / 36
46. References
[1] IEEE Computer Society, IEEE Std 754™-2008, IEEE Standard for
floating-point arithmetic, Std., Aug. 2008.
[2] K. S. Kim and S. Kang, “Clock skew compensation algorithm immune
to floating-point precision loss,” IEEE Commun. Lett., vol. 26, no. 4, pp.
902–906, Apr. 2022.
[3] S. Kang and K. S. Kim, “Theoretical and practical bounds on the initial
value of skew-compensated clock for clock skew compensation
algorithm immune to floating-point precision loss,” ArXiv e-prints,
2022. [Online]. Available: https://arxiv.org/abs/2208.11520
35 / 36
47. Thanks for your attention!
If you have any question, please contact me at
Kyeongsoo.Kim@xjtlu.edu.cn.