• Title/Summary/Keyword: operator space

Search Result 972, Processing Time 0.023 seconds

Numerical Simulation of Impact and Dynamic Deformation Based on Two-Step Eulerian Method (Two-Step Eulerian 기법 기반 충돌 및 동적 변형 해석)

  • 백승훈;이민형;김승조
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.34 no.8
    • /
    • pp.47-54
    • /
    • 2006
  • In this paper, numerical algorithms applied in two-step eulerian scheme are investigated and implemented. Element quantities are advected with donor or van Leer algorithm. Nodal quantities are advected with Simplifed ALE [SALE] algorithm. Material interfaces are determined with Simple Line Interface Calculation [SLIC] algorithm. Practical aspects considered for code development are addressed in detail. The results of developed two-step Eulerian code are verified by comparing with those from pure lagrangian scheme and commercial code.

Quantum Secret Sharing Scheme with Credible Authentication based on Quantum Walk

  • Li, Xue-Yang;Chang, Yan;Zhang, Shi-Bin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.7
    • /
    • pp.3116-3133
    • /
    • 2020
  • Based on the teleportation by quantum walk, a quantum secret sharing scheme with credible authentication is proposed. Using the Hash function and quantum local operation, combined with the two-step quantum walks circuit on the line, the identity authentication and the teleportation of the secret information in distribution phase are realized. Participants collaborate honestly to recover secret information based on particle measurement results, preventing untrusted agents and external attacks from obtaining useful information. Due to the application of quantum walk, the sender does not need to prepare the necessary entangled state in advance, simply encodes the information to be sent in the coin state, and applies the conditional shift operator between the coin space and the position space to produce the entangled state necessary for quantum teleportation. Security analysis shows that the protocol can effectively resist intercept/resend attacks, entanglement attacks, participant attacks, and impersonation attacks. In addition, the quantum walk circuit used has been implemented in many different physical systems and experiments, so this quantum secret sharing scheme may be achievable in the future.

Mission Planning and Control Analysis Algorithms for the Safe Flight of an Unmanned Aerial Vehicle (무인항공기의 안전한 운항을 위한 임무계획/통제 분석 기법)

  • Ryu, Chul-Hyung;Ra, Sung-Woong
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.33 no.3
    • /
    • pp.71-77
    • /
    • 2005
  • An unmanned aerial vehicle (UAV) is generally flied via a pre-planned flight path or real-time commands by an operator. To succeed in an assigned mission, analysis such as the line-of-sight analysis for communication between UAV and a ground data terminal should be performed. In this paper, various analysis algorithms which are performed by a ground control station in pre-flight and in-flight phases, are proposed for the safe flight of UAV. Note that the proposed algorithms can be applied to most UAV systems.

BERGMAN TYPE OPERATORS ON SOME GENERALIZED CARTAN-HARTOGS DOMAINS

  • He, Le;Tang, Yanyan;Tu, Zhenhan
    • Journal of the Korean Mathematical Society
    • /
    • v.58 no.6
    • /
    • pp.1347-1365
    • /
    • 2021
  • For µ = (µ1, …, µt) (µj > 0), ξ = (z1, …, zt, w) ∈ ℂn1 × … × ℂnt × ℂm, define $${\Omega}({\mu},t)=\{{\xi}{\in}\mathbb{B}_{n_1}{\times}{\cdots}{\times}\mathbb{B}_{n_t}{\times}\mathbb{C}^m:{\parallel}w{\parallel}^2 where $\mathbb{B}_{n_j}$ is the unit ball in ℂnj (1 ≤ j ≤ t), C(χ, µ) is a constant only depending on χ = (n1, …, nt) and µ = (µ1, …, µt), which is a special type of generalized Cartan-Hartogs domain. We will give some sufficient and necessary conditions for the boundedness of some type of operators on Lp(Ω(µ, t), ω) (the weighted Lp space of Ω(µ, t) with weight ω, 1 < p < ∞). This result generalizes the works from certain classes of generalized complex ellipsoids to the generalized Cartan-Hartogs domain Ω(µ, t).

Geostationary Satellite Station Keeping Robustness to Loss of Ground Control

  • Woo, Hyung Je;Buckwalter, Bjorn
    • Journal of Astronomy and Space Sciences
    • /
    • v.38 no.1
    • /
    • pp.65-82
    • /
    • 2021
  • For the vast majority of geostationary satellites currently in orbit, station keeping activities including orbit determination and maneuver planning and execution are ground-directed and dependent on the availability of ground-based satellite control personnel and facilities. However, a requirement linked to satellite autonomy and survivability in cases of interrupted ground support is often one of the stipulated provisions on the satellite platform design. It is especially important for a geostationary military-purposed satellite to remain within its designated orbital window, in order to provide reliable uninterrupted telecommunications services, in the absence of ground-based resources due to warfare or other disasters. In this paper we investigate factors affecting the robustness of a geostationary satellite's orbit in terms of the maximum duration the satellite's station keeping window can be maintained without ground intervention. By comparing simulations of orbit evolution, given different initial conditions and operations strategies, a variation of parameters study has been performed and we have analyzed which factors the duration is most sensitive to. This also provides valuable insights into which factors may be worth controlling by a military or civilian geostationary satellite operator. Our simulations show that the most beneficial factor for maximizing the time a satellite will remain in the station keeping window is the operational practice of pre-emptively loading East-West station keeping maneuvers for automatic execution on board the satellite should ground control capability be lost. The second most beneficial factor is using short station keeping maneuver cycle durations.

Development of Forklift-Type Automated Guided Vehicle(AGV) with Dual Steering Drive Unit (듀얼 조향구동 장치를 갖는 포크리프트 타입 무인운반차(AGV)의 개발)

  • Won, Chang-Yeon;Kang, Seon-Mo;Nahm, Yoon-Eui
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.44 no.4
    • /
    • pp.145-153
    • /
    • 2021
  • Automated Guided Vehicle (AGV) is commonly used in manufacturing plant, warehouse, distribution center, and terminal. AGV is self-driven vehicle used to transport material between workstations in the shop floor without the help of an operator, and AGV includes a material transfer system located on the top and driving system at the bottom to move the vehicle as desired. For navigation, AGV mostly uses lane paths, signal paths or signal beacons. Various predominant sensors are also used in the AGV. However, in the conventional AGV, there is a problem of not turning or damaging nearby objects or AGV in a narrow space. In this paper, a new driving system is proposed to move the vehicle in a narrow space. In the proposed driving system, two sets of the combined steering-drive unit are adopted to solve the above problem. A prototype of AGV with the new driving system is developed for the comparative analysis with the conventional AGV. In addition, the experimental result shows the improved performance of the new driving system in the maximum speed, braking distance and positioning precision tests.

Collision Avoidance Sensor System for Mobile Crane (전지형 크레인의 인양물 충돌방지를 위한 환경탐지 센서 시스템 개발)

  • Kim, Ji-Chul;Kim, Young Jea;Kim, Mingeuk;Lee, Hanmin
    • Journal of Drive and Control
    • /
    • v.19 no.4
    • /
    • pp.62-69
    • /
    • 2022
  • Construction machinery is exposed to accidents such as collisions, narrowness, and overturns during operation. In particular, mobile crane is operated only with the driver's vision and limited information of the assistant worker. Thus, there is a high risk of an accident. Recently, some collision avoidance device using sensors such as cameras and LiDAR have been applied. However, they are still insufficient to prevent collisions in the omnidirectional 3D space. In this study, a rotating LiDAR device was developed and applied to a 250-ton crane to obtain a full-space point cloud. An algorithm that could provide distance information and safety status to the driver was developed. Also, deep-learning segmentation algorithm was used to classify human-worker. The developed device could recognize obstacles within 100m of a 360-degree range. In the experiment, a safety distance was calculated with an error of 10.3cm at 30m to give the operator an accurate distance and collision alarm.

A Robust Staff Line Height and Staff Line Space Estimation for the Preprocessing of Music Score Recognition (악보인식 전처리를 위한 강건한 오선 두께와 간격 추정 방법)

  • Na, In-Seop;Kim, Soo-Hyung;Nquyen, Trung Quy
    • Journal of Internet Computing and Services
    • /
    • v.16 no.1
    • /
    • pp.29-37
    • /
    • 2015
  • In this paper, we propose a robust pre-processing module for camera-based Optical Music Score Recognition (OMR) on mobile device. The captured images likely suffer for recognition from many distortions such as illumination, blur, low resolution, etc. Especially, the complex background music sheets recognition are difficult. Through any symbol recognition system, the staff line height and staff line space are used many times and have a big impact on recognition module. A robust and accurate staff line height and staff line space are essential. Some staff line height and staff line space are proposed for binary image. But in case of complex background music sheet image, the binarization results from common binarization algorithm are not satisfactory. It can cause incorrect staff line height and staff line space estimation. We propose a robust staff line height and staff line space estimation by using run-length encoding technique on edge image. Proposed method is composed of two steps, first step, we conducted the staff line height and staff line space estimation based on edge image using by Sobel operator on image blocks. Each column of edge image is encoded by run-length encoding algorithm Second step, we detect the staff line using by Stable Path algorithm and removal the staff line using by adaptive Line Track Height algorithm which is to track the staff lines positions. The result has shown that robust and accurate estimation is possible even in complex background cases.

Nonlinear semigroups on locally convex spaces

  • Hyeon, Son-Kuk
    • East Asian mathematical journal
    • /
    • v.6 no.1
    • /
    • pp.111-121
    • /
    • 1990
  • Let E be a locally convex Hausdorff space and let $\Gamma$ be a calibration for E. In this note we proved that if E is sequentially complete and a multi-vaiued operaturA in E is $\Gamma$-accretive such that $D(A){\subset}Re$ (I+$\lambda$A) for all sufficiently small positive $\lambda$, then A generates a nonlinear $\Gamma$-contraction semiproup {T(t) ; t>0}. We also proved that if E is complete, $Gamma$ is a dually uniformly convex calibration, and an operator A is m-$\Gamma$-accretive, then the initial value problem $$\{{\frac{d}{dt}u(t)+Au(t)\;\ni\;0,\;t >0,\atop u(0)=x}\.$$ has a solution $u:[0,\infty){\rightarrow}E$ given by $u(t)=T(t)x={lim}\limit_{n\rightarrow\infty}(I+\frac{t}{n}A)^{-n}x$ each $x{\varepsilon}D(A)$.

  • PDF

STRONG CONVERGENCE OF AN ITERATIVE METHOD FOR FINDING COMMON ZEROS OF A FINITE FAMILY OF ACCRETIVE OPERATORS

  • Jung, Jong-Soo
    • Communications of the Korean Mathematical Society
    • /
    • v.24 no.3
    • /
    • pp.381-393
    • /
    • 2009
  • Strong convergence theorems on viscosity approximation methods for finding a common zero of a finite family accretive operators are established in a reflexive and strictly Banach space having a uniformly G$\hat{a}$teaux differentiable norm. The main theorems supplement the recent corresponding results of Wong et al. [29] and Zegeye and Shahzad [32] to the viscosity method together with different control conditions. Our results also improve the corresponding results of [9, 16, 18, 19, 25] for finite nonexpansive mappings to the case of finite pseudocontractive mappings.