• 제목/요약/키워드: common zero

검색결과 237건 처리시간 0.026초

Successful Treatment of Brugia pahangi in Naturally Infected Cats with Ivermectin

  • Taweethavonsawat, Piyanan;Chungpivat, Sudchit
    • Parasites, Hosts and Diseases
    • /
    • 제51권6호
    • /
    • pp.759-761
    • /
    • 2013
  • Lymphatic filariasis is a common parasitic disease of cats in tropical regions including Thailand. The objective of this study was to determine the efficacy of ivermectin against microfilariae of Brugia pahangi in naturally infected cats. Eight cats naturally infected with B. pahangi were divided into control (untreated) and treated groups. Cats in the latter group were given ivermectin injection at 400 ${\mu}g/kg$ weekly for 2 months. Microfilariae were counted every week until 48 weeks. Microfilaremia was significantly decreased in the treated group 4 weeks after starting the treatment and become zero at week 9 and afterwards. On the other hand, cats in the control group had high microfilaremia throughout the study. It was successful to treat and control B. pahangi infection in naturally infected cats using ivermectin.

A Constrained Single Machine Scheduling Model with Earliness/Tardiness and Flow Time Measures

  • Joo, Un-Gi;Sung, Chang-Sup
    • 한국경영과학회지
    • /
    • 제20권1호
    • /
    • pp.115-130
    • /
    • 1995
  • This paper considers a single machine nonpreemptive scheduling problem with a given common due date. In the problem, the optimal job sequence is sought to minimize the sum of earliness/tardiness and flow time measures in the situation where all jobs are available at time zero, and weights per unit length of earliness/tardiness and flow time are V and W, respectively. Some dominant solution properties are characterized to deriva both an optimal starting time for an arbitrary sequence and sequence improvement rules. The optimal schedule is found to the case W .geq. V/. By the way, it is difficult to find the optimal schedule for the case W < V. Therefore, the derived properties are put on together to construct a heuristic solution algorithm for the case W < V, and its effectiveness is rated at the mean relative error of about 3% on randomly generated numerical problems.

  • PDF

개선된 가딩(Guarding) 회로를 사용한 트랜스콘덕턴스 DRL 회로 (A Transconductance Driven-Right-Leg Circuit with Improved Guarding Circuit)

  • 황인덕
    • 전기학회논문지
    • /
    • 제58권8호
    • /
    • pp.1644-1650
    • /
    • 2009
  • An improved guarding circuit is applied to a transconductance driven-right-leg circuit to decrease common-mode current at measurement electrodes due to power-line interference. After showing conventional guarding circuit is instable due to gain-peaking when used with a transconductance DRL circuit, the effect of the proposed guarding circuit modified to suppress the gain-peaking by inserting a series resistor between shields and a shield driver was analyzed. It is shown that, besides stability, the proposed guarding circuit provides two other advantages: 1) The gain of the shield driver can be set to be unit nominally. 2) The loop gain of the transconductance DRL loop can be increased due to pole-zero canceling. The proposed circuit was implemented and the advantages were confirmed.

SOME GEOMERTIC SOLVABILITY THEOREMS IN TOPOLOGICAL VECTOR SPACES

  • Ben-El-Mechaiekh, H.;Isac, G.
    • 대한수학회보
    • /
    • 제34권2호
    • /
    • pp.273-285
    • /
    • 1997
  • The aim of this paper is to present theorems on the exitence of zeros for mappings defined on convex subsets of topological vector spaces with values in a vector space. In addition to natural assumptions of continuity, convexity, and compactness, the mappings are subject to some geometric conditions. In the first theorem, the mapping satisfies a "Darboux-type" property expressed in terms of an auxiliary numerical function. Typically, this functions is, in this case, related to an order structure on the target space. We derive an existence theorem for "obtuse" quasiconvex mappings with values in an ordered vector space. In the second theorem, we prove the existence of a "common zero" for an arbitrary (not necessarily countable) family of mappings satisfying a general "inwardness" condition againg expressed in terms of numerical functions (these numerical functions could be duality pairings (more generally, bilinear forms)). Our inwardness condition encompasses classical inwardness conditions of Leray-Schauder, Altman, or Bergman-Halpern types.

  • PDF

RANKS OF SUBMATRICES IN A GENERAL SOLUTION TO A QUATERNION SYSTEM WITH APPLICATIONS

  • Zhang, Hua-Sheng;Wang, Qing-Wen
    • 대한수학회보
    • /
    • 제48권5호
    • /
    • pp.969-990
    • /
    • 2011
  • Assume that X, partitioned into $2{\times}2$ block form, is a solution of the system of quaternion matrix equations $A_1XB_1$ = $C_1,A_2XB_2=C_2$. We in this paper give the maximal and minimal ranks of the submatrices in X, and establish necessary and sufficient conditions for the submatrices to be zero, unique as well as independent. As applications, we consider the common inner inverse G, partitioned into $2{\times}2$ block form, of two quaternion matrices M and N. We present the formulas of the maximal and minimal ranks of the submatrices of G, and describe the properties of the submatrices of G as well. The findings of this paper generalize some known results in the literature.

함정용 레이더의 표적 속도 보상 방법 (A Method of Velocity Compensation of Target for the Naval Radar System)

  • 조원민
    • 한국군사과학기술학회지
    • /
    • 제12권4호
    • /
    • pp.508-515
    • /
    • 2009
  • In the naval environment, a naval radar has many obstructions of velocity, such as rotation and velocity of ship. In the common situation, the rotations such as roll, pitch and yaw don't influence the velocity of the target. But because the naval radar is located on the top of the mast, there is some influence to the target velocity. When we trace the target, radar controller doesn't use hits whose doppler banks are zero. So, we must compensate the target velocity for the velocity error. This paper suggests a method of velocity compensation of target by the velocity vector and how to apply to the stack beam radar if we don't know the height of the target.

광디스크 드라이브에서의 트랙 점프 안정도 향상 (Enhanced Track Jump Stability in Optical Disc Drives)

  • 유정래;도태용
    • 제어로봇시스템학회논문지
    • /
    • 제15권7호
    • /
    • pp.683-687
    • /
    • 2009
  • Track jump control is a random access strategy for short distance movement. The most common track jump scheme is a bang-bang control of a kick and brake manner. In a conventional track jump scheme, a track-following compensator is turned off during kick and brake periods, and restarted at a target track for track pull-in. The inevitable controller switching with non-zero initial condition results in undesirable transient response, and excessive overshoot in the transient response causes track pull-in failure. In this paper, a new track jump scheme is proposed for enhancing track jump stability. Instead of control switching, internal states of a track-following controller are artificially manipulated for kick and brake actions in a digital control environment. Experimental results are provided in comparison with conventional track jumps.

다중버퍼를 이용한 경계영역 블록의 화소 재조합 (Pixel Reconstruction of Edge Boundary Block using Multi-Buffer)

  • 한병준;손창훈;김응성;이근영
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 1999년도 추계종합학술대회 논문집
    • /
    • pp.1117-1120
    • /
    • 1999
  • The main purpose of padding methods is to extend the boundary segments of arbitrarily shaped objects to a regular grid so that the common block based coding technique, such as 8${\times}$8 DCT, can be applied. In the conventional padding methods used in MPEG-4: LPE and zero padding, the main process is based on 8${\times}$8 blocks. On the contrary, we propose a new padding method based on pixel-by-pixel. The proposed method puts pixels into a multi-busier using the typical value of each boundary blocks and reproduces new boundary blocks. Simulation results show that the proposed method reduces the conventional padding method and improves the coding efficiency of the conventional padding method.

  • PDF

정규 크리깅보간법을 이용한 응력특이문제의 p-적응적 유한요소해석 (p-Adaptive Finite Element Analysis of Stress Singularity Problems by Ordinary Kriging Interpolation)

  • 우광성;박미영;박진환;한상현
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 2006년도 정기 학술대회 논문집
    • /
    • pp.849-856
    • /
    • 2006
  • This paper is to examine the applicability of ordinary Kriging interpolation(OK) to the p-adaptivity of the finite element analysis that is based on variogram. In the p-refinement, the analytical domain has to be refined automatically to obtain an acceptable level of accuracy by increasing the p-level non-uniformly or selectively. In case of non-uniform p-distribution, the continuity between elements with different polynomial orders is achieved by assigning zero higher-order derivatives associated with the edge in common with the lower-order derivatives. It is demonstrated that the validity of the proposed approach by analyzing results for stress singularity problem.

  • PDF

탄성파반자료자료의 경사보정 연구 (A Study on Dip-Moveout of Seismic Reflection Data)

  • 양승진
    • 자원환경지질
    • /
    • 제32권5호
    • /
    • pp.495-502
    • /
    • 1999
  • Common-mid-point (CMP) seismic data on a dipping layer have have a stacking different from a horizontal layer velocity and the reflection points on data are dispersed to many positions. Therefore, the CMP data are not stacked well by the conventional stacking method using the horizontal layer velocity. The CMP gather can ideally stacked by applying dip-moveout(DMO) processing. Hence, modern seismic processing indludes DMO as an essential routine step. DMO processing techniques are broadly categorized by two, Fourier transform and integral methods, each of which has many different computational schemes. In this study, the dip-decomposition technique of the Fourier transform method is used to test the DMO effect on the synthetic scismic data generated for dipping structures. Each of constnat offset sections NMO corrected by using the layer velocity of the model and DMO processed. The resulting zero-offset sections for many offsets are stacked. The stacked sections with DMO processing show the structural boundaries of the models much better than those without DMO processing.

  • PDF