• Title/Summary/Keyword: U.A.V

Search Result 1,745, Processing Time 0.035 seconds

QUASILINEAR SCHRÖDINGER EQUATIONS FOR THE HEISENBERG FERROMAGNETIC SPIN CHAIN

  • Yongkuan Cheng;Yaotian Shen
    • Bulletin of the Korean Mathematical Society
    • /
    • v.61 no.2
    • /
    • pp.541-556
    • /
    • 2024
  • In this paper, we consider a model problem arising from a classical planar Heisenberg ferromagnetic spin chain $-{\Delta}u+V(x)u-{\frac{u}{\sqrt{1-u^2}}}{\Delta}{\sqrt{1-u^2}}={\lambda}{\mid}u{\mid}^{p-2}u$, x ∈ ℝN, where 2 ≤ p < 2*, N ≥ 3. By the Ekeland variational principle, the cut off technique, the change of variables and the L estimate, we study the existence of positive solutions. Here, we construct the L estimate of the solution in an entirely different way. Particularly, all the constants in the expression of this estimate are so well known.

Factor Rank and Its Preservers of Integer Matrices

  • Song, Seok-Zun;Kang, Kyung-Tae
    • Kyungpook Mathematical Journal
    • /
    • v.46 no.4
    • /
    • pp.581-589
    • /
    • 2006
  • We characterize the linear operators which preserve the factor rank of integer matrices. That is, if $\mathcal{M}$ is the set of all $m{\times}n$ matrices with entries in the integers and min($m,n$) > 1, then a linear operator T on $\mathcal{M}$ preserves the factor rank of all matrices in $\mathcal{M}$ if and only if T has the form either T(X) = UXV for all $X{\in}\mathcal{M}$, or $m=n$ and T(X)=$UX^tV$ for all $X{\in}\mathcal{M}$, where U and V are suitable nonsingular integer matrices. Other characterizations of factor rank-preservers of integer matrices are also given.

  • PDF

Excess Volumes, Speeds of Sound, Isentropic Compressibilities and Viscosities of Binary Mixtures of N-Ethyl Aniline with Some Aromatic Ketones at 303.15 K

  • Gowrisankar, M.;Sivarambabu, S.;Venkateswarlu, P.;Kumar, K. Siva
    • Bulletin of the Korean Chemical Society
    • /
    • v.33 no.5
    • /
    • pp.1686-1692
    • /
    • 2012
  • Densities (${\rho}$), Viscosities (${\eta}$) and ultrasonic speeds (u) of pure acetophenone (AP), propiophenone (PP), $p$-methyl acetophenone ($p$-MeAP), $p$-chloroacetophenone ($p$-ClAP) and those of their binary mixtures with $N$-ethyl aniline ($N$-EA) as a common component, were measured at 303.15 K over the entire composition range. These experimental data were used to calculate the excess volume $V^E$, deviation in ultrasonic speeds ${\Delta}u$, isentropic compressibility $K_s$, intermolecular free length $L_f$, acoustic impedance Z, deviations in isentropic compressibility ${\Delta}K_s$, deviation in viscosity ${\Delta}{\eta}$ and excess Gibbs free energy of activation of viscous flow ($G^{*E}$) at all mole fractions of $N$-ethyl aniline. These parameters, especially excess functions, are found to be quite sensitive towards the intermolecular interactions between component molecules. Theoretical values of viscosity of the binary mixtures were calculated using different empirical relations and theories. The relative merits of these relations and theories were discussed. The experimental results were correlated by using the polynomial proposed by Redlich-Kister equation.

A Combined Random Scalar Multiplication Algorithm Resistant to Power Analysis on Elliptic Curves (전력분석 공격에 대응하는 타원곡선 상의 결합 난수 스칼라 곱셈 알고리즘)

  • Jung, Seok Won
    • Journal of Internet of Things and Convergence
    • /
    • v.6 no.2
    • /
    • pp.25-29
    • /
    • 2020
  • The elliptic curve crypto-algorithm is widely used in authentication for IoT environment, since it has small key size and low communication overhead compare to the RSA public key algorithm. If the scalar multiplication, a core operation of the elliptic curve crypto-algorithm, is not implemented securely, attackers can find the secret key to use simple power analysis or differential power analysis. In this paper, an elliptic curve scalar multiplication algorithm using a randomized scalar and an elliptic curve point blinding is suggested. It is resistant to power analysis but does not significantly reduce efficiency. Given a random r and an elliptic curve random point R, the elliptic scalar multiplication kP = u(P+R)-vR is calculated by using the regular variant Shamir's double ladder algorithm, where l+20-bit u≡rn+k(modn) and v≡rn-k(modn) using 2lP=∓cP for the case of the order n=2l±c.

Apoptosis Induction in Human Leukemic Promyelocytic HL-60 and Monocytic U937 Cell Lines by Goniothalamin

  • Petsophonsakul, Ploingarm;Pompimon, Wilart;Banjerdpongchai, Ratana
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.14 no.5
    • /
    • pp.2885-2889
    • /
    • 2013
  • Goniothalamin is an active compound extracted from Goniothalamus griffithii, a local plant found in northern Thailand. Goniothalamin inhibits cancer cell growth but is also toxic to normal cells. The aims of this study were to identify the cytotoxic effect of goniothalamin and the mechanism of cell death in human HL-60 and U937 cells. Cytotoxicity was determined by MTT assay and cell cycle profiles were demonstrated by staining with propidium iodide (PI) and flow cytometry. Apoptosis was confirmed by staining with annexin V-FITC/propidium iodide (PI) and flow cytometry. Reduction of mitochondrial transmembrane potential was determined by staining with dihexyloxacarbocyanine iodide and flow cytometry and expression of Smac, caspase-8 and -9 was demonstrated by Western blotting. Goniothalamin inhibited growth of HL-60 and U937 cell lines. An increase of SubG1 phase was found in their cell cycle profiles, indicating apoptosis as the mode of cell death. Apoptosis was confirmed by the flip-flop of phosphatidylserine using annexin V-FITC/PI assay in HL60 and U937 cells in a dose response manner. Furthermore, reduction of mitochondrial transmembrane potential was found in both cell types while expression of caspase-8, -9 and Smac/Diablo was increased in HL-60 cells. Taken together, our results indicate that goniothalamin-treated human leukemic cells undergo apoptosis via intrinsic and extrinsic pathways.

Acquisition, Processing and Image Generation System for Camera Data Onboard Spacecraft

  • C.V.R Subbaraya Sastry;G.S Narayan Rao;N Ramakrishna;V.K Hariharan
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.3
    • /
    • pp.94-100
    • /
    • 2023
  • The primary goal of any communication spacecraft is to provide communication in variety of frequency bands based on mission requirements within the Indian mainland. Some of the spacecrafts operating in S-band utilizes a 6m or larger aperture Unfurlable Antenna (UFA for S-band links and provides coverage through five or more S-band spot beams over Indian mainland area. The Unfurlable antenna is larger than the satellite and so the antenna is stowed during launch. Upon reaching the orbit, the antenna is deployed using motors. The deployment status of any deployment mechanism will be monitored and verified by the telemetered values of micro-switch position before the start of deployment, during the deployment and after the completion of the total mechanism. In addition to these micro switches, a camera onboard will be used for capturing still images during primary and secondary deployments of UFA. The proposed checkout system is realized for validating the performance of the onboard camera as part of Integrated Spacecraft Testing (IST) conducted during payload checkout operations. It is designed for acquiring the payload data of onboard camera in real-time, followed by archiving, processing and generation of images in near real-time. This paper presents the architecture, design and implementation features of the acquisition, processing and Image generation system for Camera onboard spacecraft. Subsequently this system can be deployed in missions wherever similar requirement is envisaged.

A Study on the Construction Process of u-City IT Infrastructure (u-City IT인프라 구축 절차에 관한 연구)

  • Kim, Jeong-Uk;Kim, Il-Jung
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.58 no.3
    • /
    • pp.291-296
    • /
    • 2009
  • "The Act on Ubiquitous City Construction and etc." stipulates the regulations on the planning, construction and management of the u-City. As its national-level law system is about to take its effects, future new city developments are expected to have its legal basis to be built to meet u-City requirements. Also, it is anticipated that such needs would require much more planning techniques and strategies. In reaction to those upcoming needs, this study is to search for new IT infrastructure construction process of the u-City in reality. It is also to supply with the each step framework to execute the u-City projects in more structuralize and systemize manner. Therefore, with the u-City IT infra construction guide line v1.0, purpose of the establishment of comprehensive IT infrastructure construction process.

The Minimum number of Mobile Guards Algorithm for Art Gallery Problem (화랑 문제의 최소 이동 경비원 수 알고리즘)

  • Lee, Sang-Un;Choi, Myeong-Bok
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.3
    • /
    • pp.63-69
    • /
    • 2012
  • Given art gallery P with n vertices, the maximum (sufficient) number of mobile guards is${\lfloor}n/4{\rfloor}$ for simple polygon and${\lfloor}(3n+4)/16{\rfloor}$ for simple orthogonal polygon. However, there is no polynomial time algorithm for minimum number of mobile guards. This paper suggests polynomial time algorithm for the minimum number of mobile guards. Firstly, we obtain the visibility graph which is connected all edges if two vertices can be visible each other. Secondly, we select vertex u with ${\Delta}(G)$ and v with ${\Delta}(G)$ in $N_G(u)$ and delete visible edges from u,v and incident edges. Thirdly, we select $w_i$ in partial graphs and select edges that is the position of mobile guards. This algorithm applies various art galley problems with simple polygons and orthogonal polygons art gallery. As a results, the running time of proposed algorithm is linear time complexity and can be obtain the minimum number of mobile guards.

Processing the Data from the uTSN of Uninterrupted Traffic Flow (연속류 uTSN 수집 데이터 가공 방안)

  • Park, Eun-Mi;Suh, Euy-Hyun
    • Journal of Intelligence and Information Systems
    • /
    • v.16 no.1
    • /
    • pp.57-69
    • /
    • 2010
  • The ubiquitous transportation system environments make it possible to collect each vehicle's position and velocity data and to perform more sophisticated traffic flow management at individual vehicle or platoon level through V2V and V2I communication. It is necessary to develop a new data processing methodology to take advantage of the ubiquitous transportation system environments. This paper proposed to build 3-dimension data profiles to maintain the detailed traffic flow information contained in the individual vehicles' data and at the same time to keep the profiles from the meaningless fluctuations. Also methods to build the platoon profile and the shock wave speed profile are proposed, which have not been possible under ITS(Intelligent Transportation System) environments.

THE C-M DIAGRAM OF THE GLOBULAR CLUSTER, NGC 6752

  • Lee, See-Woo;Cannon, R.D.
    • Journal of The Korean Astronomical Society
    • /
    • v.13 no.1
    • /
    • pp.15-26
    • /
    • 1980
  • The BV-photographic photometry was made for 1714 stars (V<19.5) in NGC 6752. The C-M diagram of this cluster shows an unusually extended blue horizontal branch $(V=13.5{\sim}17.8)$ with a wide gap $(V=16{\sim}16.7)$ and the well defined giant branch with gaps at V=13.85 and 16.2. The turnoff point is defined at $V=17.25{\pm}0.15$ and (B-V) = $0.46{\pm}0.02$. If we take $V_{HB}=13.85$ for NGC 6752, then ${\Delta}V=2.80,\;(B-V)_{0,g}=0.76\;and\;{\Delta}V_{TO}=3.40$ and the chemical abundance is estimated to be [Fe/H]=-1.67 or $Z=4.3{\times}10^{-4}\;and\;Y=0.26$. Some other physical parameters of this cluster are derived and compared with those for the well observed clusters M 3, M 13, M 15 and M 92.

  • PDF