• Title/Summary/Keyword: a mapping

Search Result 6,673, Processing Time 0.037 seconds

Review of Cave Surveying Techniques

  • Worthington, Steve
    • Journal of the speleological society of Korea
    • /
    • no.5
    • /
    • pp.79-95
    • /
    • 1997
  • The main purpose of this article is to compare different mapping techniques, so that an appropriate one may be chosen for a particular cave. Ultra-accurate techniques such as using tripods are not discussed here, as their application is limited to a small minority of caves. Most modem mapping is carried out under time restraints, due to the shortness of an expedition or the difficulty of a cave; thus, rapid mapping techniques are emphasized here.(omitted)

  • PDF

Neural Networks which Approximate One-to-Many Mapping

  • Lee, Choon-Young;Lee, Ju-Jang
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.41.5-41
    • /
    • 2001
  • A novel method is introduced for determining the weights of a regularization network which approximates one-to-many mapping. A conventional neural network will converges to the average value when outputs are multiple for one input. The capability of proposed network is demonstrated by an example of learning inverse mapping.

  • PDF

Development of Mobile System Based on Android for Tunnel Face Mapping (터널 막장 매핑을 위한 안드로이드 기반의 모바일 시스템 개발)

  • Park, Sung Wook;Kim, Hong Gyun;Bae, Sang Woo;Kim, Chang Yong;Yoo, Wan Kyu;Lee, Jin Duk
    • The Journal of Engineering Geology
    • /
    • v.24 no.3
    • /
    • pp.343-351
    • /
    • 2014
  • Tunnel face mapping plays an important role in risk analysis and infrastructure support decisions during tunnel construction. In this study, a digital mapping system using a mobile device is employed instead of existing face-mapping methods that rely upon face mapping sheets. The mobile device is then connected to the main server in the field, where a tunnel-specific database is compiled automatically. This information provides real-time feedback on the tunnel face to construction personnel and engineers, thus allowing for rapid assessment of tunnel face stability and infrastructure needs. The Douglas-Peucker algorithm, among others, is employed to resolve problems arising from the detailed mapping and speed problem by data accumulation. This system is expected to raise program optimization through field verification and additional functional improvements.

A Study on System Integration between Community Mapping and Drone Mapping for Disaster Safety Management (재난안전 관리를 위한 커뮤니티매핑과 드론매핑의 연계방안 연구)

  • Lee, JongHoon;Pyo, KyungSoo;Kim, SeongSam
    • Korean Journal of Remote Sensing
    • /
    • v.35 no.5_2
    • /
    • pp.873-881
    • /
    • 2019
  • There are limitations to the manager's investigation of all damage sites and establishment of management plan in terms of manpower and cost. Community mapping can be used to overcome these problems with the information. However, it is difficult to make decisions when multiple information are registered in multiple areas of damage. Because community mapping information are registered only with pictures and simple contents, it is so difficult for the manager to clearly understand the site situation. This study suggests a methodology to support decision-making processes during disaster management through system integration between the community mapping and the drone mapping. By applying the proposed method, decision makers can make a timely judgment effectively on the damage situation. It is expected that the proposed method will save time, manpower, and cost in the recovery phase.

ON ASYMPTOTICALLY DEMICONTRACTIVE MAPPINGS IN ARBITRARY BANACH SPACES

  • Rafiq, Arif;Lee, Byung Soo
    • East Asian mathematical journal
    • /
    • v.28 no.5
    • /
    • pp.569-578
    • /
    • 2012
  • In this paper, the necessary and sufficient conditions for the strong convergence of a modified Mann iteration process to a fixed point of an asymptotically demicontractive mapping in real Banach spaces are considered. Presented results improve and extend the results of Igbokwe [3], Liu [4], Moore and Nnoli [6] and Osilike [7].

MULTIDIMENSIONAL COINCIDENCE POINT RESULTS FOR CONTRACTION MAPPING PRINCIPLE

  • Handa, Amrish
    • The Pure and Applied Mathematics
    • /
    • v.26 no.4
    • /
    • pp.277-288
    • /
    • 2019
  • The main objective of this article is to establish some coincidence point theorem for g-non-decreasing mappings under contraction mapping principle on a partially ordered metric space. Furthermore, we constitute multidimensional results as a simple consequences of our unidimensional coincidence point theorem. Our results improve and generalize various known results.

Camera Calibration with Two Calibration Planes and Oblique Coordinate Mapping (두 보정면과 사교좌표 매핑을 이용한 카메라 보정법)

  • Ahn, Jeong-Ho
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.16 no.7
    • /
    • pp.119-124
    • /
    • 1999
  • A method to find the line of sight ray in space which corresponds to a point in an image plane is presented. The line of sight ray is defined by two points which are the intersections between the two calibration planes and the sight ray. The intersection point is found by the oblique coordinate mapping between the image plane and the calibration plane in the space. The proposed oblique coordinate mapping method has advantages over the transformation matrix method in the required memory space and computation time.

  • PDF

APPROXIMATING FIXED POINTS OF NONEXPANSIVE TYPE MAPPINGS IN BANACH SPACES WITHOUT UNIFORM CONVEXITY

  • Sahu, Daya Ram;Khan, Abdul Rahim;Kang, Shin Min
    • Bulletin of the Korean Mathematical Society
    • /
    • v.50 no.3
    • /
    • pp.1007-1020
    • /
    • 2013
  • Approximate fixed point property problem for Mann iteration sequence of a nonexpansive mapping has been resolved on a Banach space independent of uniform (strict) convexity by Ishikawa [Fixed points and iteration of a nonexpansive mapping in a Banach space, Proc. Amer. Math. Soc. 59 (1976), 65-71]. In this paper, we solve this problem for a class of mappings wider than the class of asymptotically nonexpansive mappings on an arbitrary normed space. Our results generalize and extend several known results.

A CLB based CPLD Low-power Technology Mapping Algorithm (CLB 구조의 CPLD 저전력 기술 매핑 알고리즘)

  • 김재진;윤충모;인치호;김희석
    • Proceedings of the IEEK Conference
    • /
    • 2003.07b
    • /
    • pp.1165-1168
    • /
    • 2003
  • In this paper, a CLB-based CPLD low-power technology mapping algorithm is proposed. To perform low power technology mapping for CPLD, a given Boolean network have to be represented to DAG. The proposed algorithm are consist of three step. In the first step, TD(Transition Density) calculation have to be performed. In the second step, the feasible clusters are generated by considering the following conditions: the number of output, the number of input and the number of OR-terms for CLB(Common Logic Block) within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low power technology mapping based on the CLBs is packing the feasible clusters into the several proper CLBs. Therefore the proposed algorithm is proved an efficient algorithm for a low power CPLD technology mapping.

  • PDF