• Title/Summary/Keyword: fixed point problem

Search Result 353, Processing Time 0.026 seconds

A Model of Location Decisions of Natural Gas Filling Station Considering Spatial Coverage and Travel Cost (공간적 접근성 및 통행비용을 고려한 천연가스 충전소 최적 입지선정 모형)

  • Yu, Jeong-Whon;Lee, Mu-Young;Oh, Sei-Chang
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.3
    • /
    • pp.145-153
    • /
    • 2008
  • This study proposes a facility location model in consideration of spatial coverage and travel cost as an effort to make objective and effective decisions of natural gas filling stations. The proposed model is developed for fixed stations and consists of two stages. The first stage employs a heuristic algorithm to find a set of locations which satisfy the spatial coverage constraints determined by the maximum travel distance between the filling stations and bus depots. In the second stage, the optimal location of filling stations is determined based on the minimum travel cost estimated by using a modified transportation problem as well as the construction and maintenance costs of the filling stations. The applicability of the model is analyzed through finding the optimal location of filling stations for the city of Anyang, a typical medium-sized city in metropolitan Seoul, based on the demand of natural gas buses. This study is expected to help promote the spread of natural gas buses by providing a starting point of a objective and reasonable methodological perspective to address the filling station location problem.

A Sequence of the Extreme Vertices ova Moving Regular Polyhedron Using Spherical Voronoi Diagrams (구면 보로노이 다이아그램을 이용한 움직이는 정규 다면체의 근점 알고리즘)

  • 김형석
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.3
    • /
    • pp.298-308
    • /
    • 2000
  • We present an efficient algorithm for finding the sequence of extreme vortices of a moving regular convex polyhedron of with respect to a fixed plane H.. The algorithm utilizes the spherical Voronoi diagram that results from the outward unit normal vectors nF$_{i}$ 's of faces of P. It is well-known that the Voronoi diagram of n sites in the plane can be computed in 0(nlogn) time, and this bound is optimal. However. exploiting the convexity of P, we are able to construct the spherical Voronoi diagram of nF$_{i}$ ,'s in O(n) time. Using the spherical Voronoi diagram, we show that an extreme vertex problem can be transformed to a spherical point location problem. The extreme vertex problem can be solved in O(logn) time after O(n) time and space preprocessing. Moreover, the sequence of extreme vertices of a moving regular convex polyhedron with respect to H can be found in (equation omitted) time, where m$^{j}$ $_{k}$ (1$\leq$j$\leq$s) is the number of edges of a spherical Voronoi region sreg(equation omitted) such that (equation omitted) gives one or more extreme vertices.

  • PDF

A Non-Periodic Synchronization Algorithm using Address Field of Point-to-Point Protocol in CDMA Mobile Network (CDMA이동망에서 점대점 프로토콜의 주소영역을 이용한 비주기적 동기 알고리즘)

  • Hong, Jin-Geun;Yun, Jeong-O;Yun, Jang-Heung;Hwang, Chan-Sik
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.8
    • /
    • pp.918-929
    • /
    • 1999
  • 동기식 스트림 암호통신 방식을 사용하는 암호통신에서는 암/복호화 과정 수행시 암호통신 과정에서 발생하는 사이클슬립으로 인해 키수열의 동기이탈 현상이 발생되고 이로 인해 오복호된 데이타를 얻게된다. 이러한 위험성을 감소하기 위한 방안으로 현재까지 암호문에 동기신호와 세션키를 주기적으로 삽입하여 동기를 이루는 주기적인 동기암호 통신방식을 사용하여 왔다. 본 논문에서는 CDMA(Cellular Division Multiple Access) 이동망에서 데이타서비스를 제공할 때 사용되는 점대점 프로토콜의 주소영역의 특성을 이용하여 단위 측정시간 동안 측정된 주소비트 정보와 플래그 패턴의 수신률을 이용하여 문턱 값보다 작은경우 동기신호와 세션키를 전송하는 비주기적인 동기방식을 사용하므로써 종래의 주기적인 동기방식으로 인한 전송효율성 저하와 주기적인 상이한 세션키 발생 및 다음 주기까지의 동기이탈 상태의 지속으로 인한 오류확산 등의 단점을 해결하였다. 제안된 알고리즘을 링크계층의 점대점 프로토콜(Point to Point Protocol)을 사용하는 CDMA 이동망에서 동기식 스트림 암호 통신방식에 적용시 동기이탈율 10-7의 환경에서 주기가 1sec인 주기적인 동기방식에서 요구되는 6.45x107비트에 비해 3.84x105비트가 소요됨으로써 전송율측면에서의 성능향상과 오복호율과 오복호 데이타 비트측면에서 성능향상을 얻었다. Abstract In the cipher system using the synchronous stream cipher system, encryption / decryption cause the synchronization loss (of key arrangement) by cycle slip, then it makes incorrect decrypted data. To lessen the risk, we have used a periodic synchronous cipher system which achieve synchronization at fixed timesteps by inserting synchronization signal and session key. In this paper, we solved the problem(fault) like the transfer efficiency drops by a periodic synchronous method, the periodic generations of different session key, and the incorrectness increases by continuing synchronization loss in next time step. They are achieved by the transfer of a non-periodic synchronous signal which carries synchronous signal and session key when it is less than the threshold value, analyzing the address field of point-to-point protocol, using the receiving rate of address bits information and flag patterns in the decision duration, in providing data services by CDMA mobile network. When the proposed algorithm is applied to the synchronous stream cipher system using point-to-point protocol, which is used data link level in CDMA mobile network, it has advanced the result in Rerror and Derror and in transmission rate, by the use of 3.84$\times$105bits, not 6.45$\times$107bits required in periodic synchronous method, having lsec time step, in slip rate 10-7.

User Profile Based Seamless Framework under HTTP Adaptive Streaming Environment (HTTP Streaming 환경에서 User Profile 기반 Seamless Framework 제공방법)

  • Kim, Jung-Han;Lee, Jang-Won;Kim, Kyu-Heon;Suh, Doug-Young
    • Journal of Broadcast Engineering
    • /
    • v.16 no.1
    • /
    • pp.155-173
    • /
    • 2011
  • Recently, with the digitalization of a broadcasting system and the development of a communication technology, the existing trend of consuming media contents throughout the fixed-displayer and the dedicated channel is being changed. The existing user only could consume media contents under limited time and places because of the fixed-displayer and the dedicated channel. However, with advent of the IP-based terminals and HTTP adaptive streaming which transfer the media sequence according to the user's transmission condition, users become possible to enjoy the media content anytime anywhere. As the result of the alteration of the broadcasting surrounding, users can enjoy the media content while changing his terminals according to their preferences and circumstances. However, in case that users try to consume consecutively the content from last view-point ended in the previous terminal under current HTTP adaptive streaming environment, a user has to remember the last view-point, and then has to apply the view-point to the changed terminal. Thus, for solving this problem, this paper defines "User Profile" for describing the metadata for the chained content consume environment between the terminals. Also, for proving the proposed method, this paper try to demonstrate the proposed method throughout the realization of the system based on Smooth Streaming from Microsoft.

Implementation of Random Controlling of Convergence Point in VR Image Content Production (VR 영상콘텐츠 제작을 위한 컨버전스 포인트 임의조절 구현)

  • Jin, Hyung Woo;Baek, Gwang Ho;Kim, Mijin
    • Smart Media Journal
    • /
    • v.4 no.4
    • /
    • pp.111-119
    • /
    • 2015
  • As a variety of HMD(Head Mounted Display) has come out, the production of 3D images onto which VR(Virtual Reality) technologies are grafted has been contributed to activating the production of image contents depending on a tangible or immersing type. VR-based image contents have enlarged their applicability across the entertainment industry from animation and game to realistic images. At the same time, the solution development for producing VR image contents has also gained elasticity. However, among those production solutions which have been used until now, fixed stereo camera based photographing has a limit that the binocular disparity of a user is fixed. This does not only restrict a way of expression a producer intends to direct, but also may cause the effect of 3D or space not to be sensed enough as view condition is not considered enough in a user's side. This study is aimed at resolving with skills applying in the latter part of 3D image production the problem that convergence points may be adjusted with restriction, which tends to happen at the time of the production of VR image contents. The later stage of the 3D imaging work analyzes and applies to game engines the significance of adjusting convergence points through the visualization of binocular disparity so that it is available to implement a function that the points could be controlled at random by a user.

Study of the semi-segregation algorithms of the incompressible Navier-Stokes equations using P2P1 finite element formulation (P2P1 유한요소 공식을 이용한 비압축성 Navier-Stokes 방정식의 반-분리 해법에 관한 연구)

  • Cho, Myung-H.;Choi, Hyoung-G.;Yoo, Jung-Y.;Park, Jae-I.
    • 유체기계공업학회:학술대회논문집
    • /
    • 2006.08a
    • /
    • pp.349-352
    • /
    • 2006
  • The conventional segregated finite element formulation produces a small and simple matrix at each step than in an integrated formulation. And the memory and cost requirements of computations are significantly reduced because the pressure equation for the mass conservation of the Navier-Stokes equations is constructed only once if the mesh is fixed. However, segregated finite element formulation solves Poisson equation of elliptic type so that it always needs a pressure boundary condition along a boundary even when physical information on pressure is not provided. On the other hand, the conventional integrated finite element formulation in which the governing equations are simultaneously treated has an advantage over a segregated formulation in the sense that it can give a more robust convergence behavior because all variables are implicitly combined. Further it needs a very small number of iterations to achieve convergence. However, the saddle-paint-type matrix (SPTM) in the integrated formulation is assembled and preconditioned every time step, so that it needs a large memory and computing time. Therefore, we newly proposed the P2PI semi-segregation formulation. In order to utilize the fact that the pressure equation is assembled and preconditioned only once in the segregated finite element formulation, a fixed symmetric SPTM has been obtained for the continuity constraint of the present semi-segregation finite element formulation. The momentum equation in the semi-segregation finite element formulation will be separated from the continuity equation so that the saddle-point-type matrix is assembled and preconditioned only once during the whole computation as long as the mesh does not change. For a comparison of the CPU time, accuracy and condition number between the two methods, they have been applied to the well-known benchmark problem. It is shown that the newly proposed semi-segregation finite element formulation performs better than the conventional integrated finite element formulation in terms of the computation time.

  • PDF

Analysis on sharing between terrestrial FS and FSS of 40GHz bands, related with HDFSS identification (우리나라 HD-FSS 주파수 분배에 대비한 40GHz 지상망과의 간섭영향 분석)

  • 이일용;성향숙
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.2A
    • /
    • pp.181-186
    • /
    • 2004
  • Analysis on sharing between GSO FSS and terrestrial system in the 40㎓ band, related with the problem for sharing between terrestrial services and FSS and identification of HDFSS downlink bands in World Radiocommunication Conference 2003, was practiced by assuming that both systems are operated in Korea. According to results from simulation using the characteristic parameters of GSO FSS and terrestrial FS system in 40 ㎓ described in ITU-R Recommendations, in case that elevation and azimuth angle of antenna of FS station are adjusted to point directly to the geostationary satellite, the GSO system can cause the worst interference to the FS system. This situation is possible to occur in the installation of 40 GHz FS station in urban area where there are high-rise buildings. If high-density FS stations in 40 ㎓ band are operated in the future, interference mitigation techniques to avoid GSO arc should be considered.

Experimental Study on Dry Waterproofing Technology Using Synthetic Polymer Sheet Comprised of Synthetic Resin Metal Sheets and Tri-Layered Filler (합성수지 메탈시트와 3면겹침용 채움재가 공법화된 합성고분자계 시트를 이용한 건식화 방수기술에 대한 실험적 연구)

  • Koo, Ja-Ung;Kim, Bum-Soo;Lee, Jung-Hun;Song, Je-Young;Oh, Sang-Keun
    • Proceedings of the Korean Institute of Building Construction Conference
    • /
    • 2017.11a
    • /
    • pp.139-140
    • /
    • 2017
  • This technology employs a method of forming a single-ply PLUS waterproofing sheet layer comprised of applying a single-ply synthetic polymer layer on a vibrating structure (steel frame, RC) or an inclined surface by using a T joint lap-filling coil and an embedded metal coated sheet. The T - joint reinforcing lap-filling coil was used to block the ingress channel of the rainwater by applying the material in the vulnerable area where the three sides of the waterproof sheet overlapped. Conventional waterproofing techniques have a problem in that the waterproof sheet is pierced because the end portion of the waterproof sheet applied to the vertical portion is fixed by a nail, and the sealant applied to the end portion of the sheet cannot easily secure long-term waterproof durability due to the influence of the external environment. Therefore, the developed technology secured the waterproof durability against the vertical part by using the embedded metal sheet. In addition, automatic hot-air fusing is used to improve the quality of waterproof construction and point fixation method using fixed hardware. This is a technology that is not significantly restricted in the high degradation level regions of domestic waterproof construction environments in Korea such as low-temperature environment, wet floor.

  • PDF

Propulsion System Design and Optimization for Ground Based Interceptor using Genetic Algorithm

  • Qasim, Zeeshan;Dong, Yunfeng;Nisar, Khurram
    • Proceedings of the Korean Society of Propulsion Engineers Conference
    • /
    • 2008.03a
    • /
    • pp.330-339
    • /
    • 2008
  • Ground-based interceptors(GBI) comprise a major element of the strategic defense against hostile targets like Intercontinental Ballistic Missiles(ICBM) and reentry vehicles(RV) dispersed from them. An optimum design of the subsystems is required to increase the performance and reliability of these GBI. Propulsion subsystem design and optimization is the motivation for this effort. This paper describes an effort in which an entire GBI missile system, including a multi-stage solid rocket booster, is considered simultaneously in a Genetic Algorithm(GA) performance optimization process. Single goal, constrained optimization is performed. For specified payload and miss distance, time of flight, the most important component in the optimization process is the booster, for its takeoff weight, time of flight, or a combination of the two. The GBI is assumed to be a multistage missile that uses target location data provided by two ground based RF radar sensors and two low earth orbit(LEO) IR sensors. 3Dimensional model is developed for a multistage target with a boost phase acceleration profile that depends on total mass, propellant mass and the specific impulse in the gravity field. The monostatic radar cross section (RCS) data of a three stage ICBM is used. For preliminary design, GBI is assumed to have a fixed initial position from the target launch point and zero launch delay. GBI carries the Kill Vehicle(KV) to an optimal position in space to allow it to complete the intercept. The objective is to design and optimize the propulsion system for the GBI that will fulfill mission requirements and objectives. The KV weight and volume requirements are specified in the problem definition before the optimization is computed. We have considered only continuous design variables, while considering discrete variables as input. Though the number of stages should also be one of the design variables, however, in this paper it is fixed as three. The elite solution from GA is passed on to(Sequential Quadratic Programming) SQP as near optimal guess. The SQP then performs local convergence to identify the minimum mass of the GBI. The performance of the three staged GBI is validated using a ballistic missile intercept scenario modeled in Matlab/SIMULINK.

  • PDF

Control of a mobile robot supporting a task robot on the top

  • Lee, Jang M.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10a
    • /
    • pp.1-7
    • /
    • 1996
  • This paper addresses the control problem of a mobile robot supporting a task robot with needs to be positioned precisely. The main difficulty residing in the precise control of a mobile robot supporting a task robot is providing an accurate and stable base for the task robot. That is, the end-plate of the mobile robot which is the base of the task robot can not be positioned accurately without external position sensors. This difficulty is resolved in this paper through the vision information obtained from the camera attached at the end of a task robot. First of all, the camera parameters were measured by using the images of a fixed object captured by the camera. The measured parameters include the rotation, the position, the scale factor, and the focal length of the camera. These parameters could be measured by using the features of each vertex point for a hexagonal object and by using the pin-hole model of a camera. Using the measured pose(position and orientation) of the camera and the given kinematics of the task robot, we calculate a pose of the end-plate of the mobile robot, which is used for the precise control of the mobile robot. Experimental results for the pose estimations are shown.

  • PDF