• Title/Summary/Keyword: convergence theorem.

Search Result 287, Processing Time 0.025 seconds

APPROXIMATION OF SOLUTIONS THROUGH THE FIBONACCI WAVELETS AND MEASURE OF NONCOMPACTNESS TO NONLINEAR VOLTERRA-FREDHOLM FRACTIONAL INTEGRAL EQUATIONS

  • Supriya Kumar Paul;Lakshmi Narayan Mishra
    • Korean Journal of Mathematics
    • /
    • v.32 no.1
    • /
    • pp.137-162
    • /
    • 2024
  • This paper consists of two significant aims. The first aim of this paper is to establish the criteria for the existence of solutions to nonlinear Volterra-Fredholm (V-F) fractional integral equations on [0, L], where 0 < L < ∞. The fractional integral is described here in the sense of the Katugampola fractional integral of order λ > 0 and with the parameter β > 0. The concepts of the fixed point theorem and the measure of noncompactness are used as the main tools to prove the existence of solutions. The second aim of this paper is to introduce a computational method to obtain approximate numerical solutions to the considered problem. This method is based on the Fibonacci wavelets with collocation technique. Besides, the results of the error analysis and discussions of the accuracy of the solutions are also presented. To the best knowledge of the authors, this is the first computational method for this generalized problem to obtain approximate solutions. Finally, two examples are discussed with the computational tables and convergence graphs to interpret the efficiency and applicability of the presented method.

Fuzzy sliding mode controller design for improving the learning rate (퍼지 슬라이딩 모드의 속도 향상을 위한 제어기 설계)

  • Hwang, Eun-Ju;Cho, Young-Wan;Kim, Eun-Tai;Park, Mignon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.16 no.6
    • /
    • pp.747-752
    • /
    • 2006
  • In this paper, the adaptive fuzzy sliding mode controller with two systems is designed. The existing sliding mode controller used to $approximation{\^{u}}(t)$ with discrete sgn function and sat function for keeping the state trajectories on the sliding surface[1]. The proposed controller decrease the disturbance for uncertain control gain and This paper is concerned with an Adaptive Fuzzy Sliding Mode Control(AFSMC) that the fuzzy systems ate used to approximate the unknown functions of nonlinear system. In the adaptive fuzzy system, we adopt the adaptive law to approximate the dynamics of the nonlinear plant and to adjust the parameters of AFSMC. The stability of the suggested control system is proved via Lyapunov stability theorem, and convergence and robustness properties ate demonstrated. Futhermore, fuzzy tuning improve tracking abilities by changing some sliding conditions. In the traditional sliding mode control, ${\eta}$ is a positive constant. The increase of ${\eta}$ has led to a significant decrease in the rise time. However, this has resulted in higher overshoot. Therefore the proposed ${\eta}$ tuning AFSMC improve the performances, so that the controller can track the trajectories faster and more exactly than ordinary controller. The simulation results demonstrate that the performance is improved and the system also exhibits stability.

Inter-device Mutual authentication and Formal Verification in M2M Environment (M2M 환경에서 장치간 상호 인증 및 정형검증)

  • Bae, WooSik
    • Journal of Digital Convergence
    • /
    • v.12 no.9
    • /
    • pp.219-223
    • /
    • 2014
  • In line with the advanced wireless communication technology, M2M (Machine-to-Machine) communication has drawn attention in industry. M2M communication features are installed and operated in the fields where human accessibility is highly limited such as disaster, safety, construction, health and welfare, climate, environment, logistics, culture, defense, medical care, agriculture and stockbreeding. In M2M communication, machine replaces people for automatic communication and countermeasures as part of unmanned information management and machine operation. Wireless M2M inter-device communication is likely to be exposed to intruders' attacks, causing security issues, which warrants proper security measures including cross-authentication of whether devices are legitimate. Therefore, research on multiple security protocols has been conducted. The present study applied SessionKey, HashFunction and Nonce to address security issues in M2M communication and proposed a safe protocol with reinforced security properties. Notably, unlike most previous studies arguing for the security of certain protocols based on mathematical theorem proving, the present study used the formal verification with Casper/FDR to prove the safety of the proposed protocol. In short, the proposed protocol was found to be safe and secure.

Verification of Safety in a RFID Security Authentication Protocol Using Session and Public Keys (세션키 및 공개키를 이용한 RFID 보안 인증 프로토콜의 안전성 검증)

  • Bae, Woo Sik;Lee, Jong Yun
    • Journal of Digital Convergence
    • /
    • v.10 no.10
    • /
    • pp.325-332
    • /
    • 2012
  • Due to its communication vulnerability resulting in a range of problems, e.g. eavesdropping, information exposure, traffic analysis and spoofing, RFID system becomes the target of attackers. Accordingly, many investigators have proposed various protocols to the extent of theorem proving or verification as the implementation is challenging. This paper thus proposes a safe RFID security protocol using public keys, session keys, hashes, XORs, and random numbers. Timestamps and hashes are applied to the most vulnerable section between readers and tags to detect attacks in attack signals with time difference. Also, to prevent tag information from being exposed in the last session, hash operation is adopted before communication. Finally, in this paper, we designed a RFID security protocol using public and session keys applicable to real systems and verified the security of the proposed protocol with a differentiated formal verification technique.

An Iterative Two-Dimensional Equalizer for Bit Patterned Media Storage Systems Based on Contraction Mapping (비트 패턴 미디어 저장장치를 위한 축약사상 기반의 반복적 2차원 등화기)

  • Moon, Woosik;Im, Sungbin;Park, Sehwang
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.6
    • /
    • pp.3-8
    • /
    • 2013
  • Bit patterned media (BPM) storage is one of the promising technologies to overcome the limitations of the conventional magnetic recording. However, there are some problems in a high areal density BPM storage, inter-track interference, inter-symbol interference and noise which are severely degrading performance of the system with reducing the bit error rate. In this paper, we present a simple iterative two-dimensional equalizer based on the contraction mapping theorem to mitigate these adverse effects. Furthermore, we examine that the channel characteristics of the proposed two-dimensional equalizer satisfies the convergence conditions. In the simulation we demonstrate the bit separation characteristics of the one-dimensional equalizer and the two-dimensional equalizer and evaluate the BER performance of the proposed equalizer comparing with the conventional equalizers. According to the results of experiments, the proposed equalizer is an promising equalizer with maintaining proper complexity for a high areal density BPM storage.

The Nonlinear Motions of Cylinders(II) - Translating and Heaving Problem, Body Motion in Waves - (주상체의 비선형 운동(II) -전진동요문제, 파랑중의 운동-)

  • H.Y. Lee;J.H. Hwang
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.30 no.1
    • /
    • pp.45-64
    • /
    • 1993
  • This paper dealt with the application of a numerical method developed by the authors using the matching method proposed in the previous paper on "The Nonlinear motions of cylinders(I)[16]", and Cauchy's theorem to the problems associated with hydrodynamic forces acting on a heaving cylinders translating in a calm water and also motions of cylinders in waves. In spectral method. body boundary condition in submerged case is satisfied exactly but one in floating case is not satisfied exactly. In the numerical code developed here, the boundary condition at the free-surface and body surface is satisfied exactly at its instaneous position. It is of interest to note that the present scheme could be applied to a free-surface-piercing body without experiencing a difficulty in the numerical convergence. The computed results are compared with other results([6], [12]).

  • PDF

A Lower Bound for Performance of Group Testing Problems (그룹검사 문제에 대한 성능 하한치)

  • Seong, Jin-Taek
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.11 no.5
    • /
    • pp.572-578
    • /
    • 2018
  • This paper considers Group Testing as one of combinatorial problems. The group testing first began to inspect soldier's syphilis infection during World War II and have long established an academic basis. Recently, there has been much interest in related areas because of the rediscovery of the value of the group testing. The group testing is the same as finding a few defect samples out of a large number of samples, which is similar to the inverse problem of Compressed Sensing. In this paper, we introduce the definition of the group testing, and specify the classes of the group testing and the bounds on performance of the group testing. In addition, we show a lower bound for the number of tests required to find defective samples using the theoretical theorem which is mainly used for relationship between conditional entropy and the probability of error in the information theory. We see how our result can be different from other related results.

A Study on the Cryptography Technology for Computing Stored and Encrypted Information without Key Leakage (키 유출 없이 저장되고 암호화된 정보를 계산할 수 있는 암호기술에 관한 연구)

  • Mun, Hyung-Jin;Hwang, Yoon-Cheol
    • Journal of Industrial Convergence
    • /
    • v.17 no.1
    • /
    • pp.1-6
    • /
    • 2019
  • Various cryptographic technologies have been proposed from ancient times and are developing in various ways to ensure the confidentiality of information. Due to exponentially increasing computer power, the encryption key is gradually increasing for security. Technology are being developed; however, security is guaranteed only in a short period of time. With the advent of the 4th Industrial Revolution, encryption technology is required in various fields. Recently, encryption technology using homomorphic encryption has attracted attention. Security threats arise due to the exposure of keys and plain texts used in the decryption processing for the operation of encrypted information. The homomorphic encryption can compute the data of the cipher text and secure process the information without exposing the plain text. When using the homomorphic encryption in processing big data like stored personal information in various services, security threats can be avoided because there is no exposure to key usage and decrypted information.

Duplex Control for Consensus of Multi-agent Systems with Input Saturations (입력포화가 존재하는 다중 에이전트 시스템의 일치를 위한 이종제어)

  • Lim, Young-Hun
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.14 no.4
    • /
    • pp.284-291
    • /
    • 2021
  • In this paper, we study the consensus problem for multi-agent systems with input saturations. The goal of consensus is to achieve a swarming behavior of multi-agent systems by reaching the agreement through information exchange. This paper considers agents modeled by first-order dynamics with input saturations. In order to guarantee the global convergence of the agents, it is assumed that the agents are stable. Moreover, considering the disturbances, we propose the PI based duplex control method to achieve the consensus. The proposed P controller and I controller are composed of different information network. Then, we investigate the conditions of the information networks and the control gains of P, I controllers to achieve the consensus applying the Lyapunov stability theorem and the Lasalle's Invariance Principle. Finally, we conduct the simulations to validate the theoretical results.

Using Tabu Search for L(2,1)-coloring Problem of Graphs with Diameter 2 (Tabu Search를 이용한 지름이 2인 그래프에 대한 L(2,1)-coloring 문제 해결)

  • Kim, SoJeong;Kim, ChanSoo;Han, KeunHee
    • Journal of Digital Convergence
    • /
    • v.20 no.2
    • /
    • pp.345-351
    • /
    • 2022
  • For simple undirected graph G=(V,E), L(2,1)-coloring of G is a nonnegative real-valued function f : V → [0,1,…,k] such that whenever vertices x and y are adjacent in G then |f(x)-f(y)|≥ 2 and whenever the distance between x and y is 2, |f(x)-f(y)|≥ 1. For a given L(2,1)-coloring c of graph G, the c-span is λ(c) = max{|c(v)-c(v)||u,v∈V}. L(2,1)-coloring number λ(G) = min{λ(c)} where the minimum is taken over all L(2,1)-coloring c of graph G. In this paper, based on Harary's Theorem, we use Tabu Search to figure out the existence of Hamiltonian Path in a complementary graph and confirmed that if λ(G) is equal to n(=|V|).