• Progress in Superconductivity and Cryogenics
• /
• v.17 no.2
• /
• pp.31-35
• /
• 2015

Mapping is a useful tool in the magnetic field analysis and design. In some specific research area, such as the nuclear magnetic resonance (NMR) or the magnetic resonance imaging (MRI), it is important to map the magnetic field in the interesting space with high accuracy. In this paper, an indirect mapping method in the center volume of an air-core solenoid is presented, based on the solution of the Laplace's equation for the field. Through the mathematical analysis on the mapping calculation, we know that the condition number of the matrix, generated by the measurement points, can greatly affect the error of mapping result. Two different arrangement methods of the measurement points in field mapping are described in this paper: helical cylindrical line (HCL) method and parallel cylindrical line (PCL) method. According to the condition number, the HCL method is recommended to measure the field components using one probe. As a simple example, we mapped the magnetic fields in a MRI main magnet system. Comparing the results in the different methods, it is feasible and convenient to apply the condition number to reduce the error in the field mapping calculation. Finally, some guidelines were presented for the magnetic field mapping in the center volume of the air-core solenoid.

• 한국정보통신설비학회:학술대회논문집
• /
• 2009.08a
• /
• pp.91-96
• /
• 2009

In Public Switched Telephone Networks(PSTN) number portability is implemented by utilizing Intelligent Network(IN) functions for number mapping. And voice over IP(VoIP) and IP Multimedia Subsystem(IMS) networks can deploy number portability by using E.164 Number Mapping(ENUM). This paper discuss the possibility of using E.164 Number Mapping(ENUM) for number portability in voice over IP/IP Multimedia Subsystem and Public Switched Telephone Networks, eliminating the need for Number Portability Database(NPDB) for number portability routing data in Public Switched Telephone Networks.

• Journal of information and communication convergence engineering
• /
• v.5 no.1
• /
• pp.59-63
• /
• 2007

In this paper, a CLB-based CPLD low-power technology mapping algorithm considered a Trade-off is proposed. To perform low-power technology mapping for CPLDs, a given Boolean network has to be represented in a DAG. The proposed algorithm consists of three steps. In the first step, TD(Transition Density) calculation has to be performed. Total power consumption is obtained by calculating the switching activity of each node in a DAG. In the second step, the feasible clusters are generated by considering the following conditions: the number of inputs and outputs, the number of OR terms for CLB 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 packs the feasible clusters. The proposed algorithm is examined using SIS benchmarks. When the number of OR terms is five, the experiment results show that power consumption is reduced by 30.73% compared with TEMPLA, and by 17.11 % compared with PLA mapping.

• Journal of information and communication convergence engineering
• /
• v.5 no.2
• /
• pp.131-135
• /
• 2007

In this paper, The proposed algorithm consists of three steps. In the first step, TD(Transition Density) calculation has to be performed. a CLB-based CPLD low-power technology mapping algorithm considered a Trade-off is proposed. To perform low-power technology mapping for CPLDs, a given Boolean network has to be represented in a DAG. Total power consumption is obtained by calculating the switching activity of each node in a DAG. In the second step, the feasible clusters are generated by considering the following conditions: the number of inputs and outputs, the number of OR terms for CLB 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 packs the feasible clusters. The proposed algorithm is examined using SIS benchmarks. When the number of OR terms is five, the experiment results show that power consumption is reduced by 30.73% compared with TEMPLA, and by 17.11 % compared with PLA mapping.

• ETRI Journal
• /
• v.20 no.4
• /
• pp.327-345
• /
• 1998

This paper deals with the problem of one-to-one mapping of 2$^n$ task modules of a parallel program to an n-dimensional hypercube multicomputer so as to minimize the total communication cost during the execution of the task. The problem of finding an optimal mapping has been proven to be NP-complete. First we show that the mapping problem in a hypercube multicomputer can be transformed into the problem of finding a set of maximum cutsets on a given task graph using a graph modification technique. Then we propose a repeated mapping scheme, using an existing graph bipartitioning algorithm, for the effective mapping of task modules onto the processors of a hypercube multicomputer. The repeated mapping scheme is shown to be highly effective on a number of test task graphs; it increasingly outperforms the greedy and recursive mapping algorithms as the number of processors increases. Our repeated mapping scheme is shown to be very effective for regular graphs, such as hypercube-isomorphic or 'almost' isomorphic graphs and meshes; it finds optimal mappings on almost all the regular task graphs considered.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2006.05a
• /
• pp.438-442
• /
• 2006

Reasonably accurate estimation of the exposed population to the distinct levels of noise is essential to the efficient management of urban environmental noise. This study proposes a method of calculating the number of exposed people to industrial noise by using GIS tool and noise mapping. The exposed population of noise based on estimation of the number of people that lived in each building in urban area is compared with the one based on density of population. This study suggests the six step method that consists of gathering the fundamental data, extracting the property from the digital map, noise mapping based on the three dimensional topography, estimating population that lives in each building, merging the various results with GIS tool, and estimating exposed population to industrial noise through analyzing the noise map with GIS tools

• 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.

• International Journal of Internet, Broadcasting and Communication
• /
• v.9 no.3
• /
• pp.1-8
• /
• 2017

Recently, the development of the head mounted display (HMD) device has attracted a great deal of attention to the actual contents. Especially, Augmented Reality (AR), which is a mixture of actual information and virtual world information, is focused on. AR HMD is able to interact by arranging virtual objects in real space through spatial recognition using depth camera. In order to naturally mix virtual space with real space, it is necessary to develop a technology for realizing spatial mapping information with high accuracy. The purpose of this paper is to evaluate the optimal configuration of augmented reality application program by realizing accurate spatial mapping information when mapping a real space and an object placement environment using HoloLens. To do this, we changed the spatial mapping information in real space to three levels, which are the number of meshes used in cubic meters to scan step by step. After that, it was compared with the 3D model obtained by changing the actual space and mesh number. Experimental result shows that the higher the number of meshes used in cubic meters, the higher the accuracy between real space and spatial mapping. This paper is expected to be applied to augmented reality application programs that require scanning of highly mapped spatial mapping information.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.7B
• /
• pp.818-826
• /
• 2011

This paper proposes a novel FTL (Flash Translation Layer) algorithm employing sector-level mapping technique based on locality to reduce the number of erase operations in flash memory accesses. Sector-level mapping technique shows higher performance than other mapping techniques, even if it requires a large mapping table. The proposed algorithm reduces the size of mapping table by employing dynamic table update, processes sequential writes by exploiting sequential locality and extracts hot sector in random writes. Experimental results show that the number of erase operations has been reduced by 75.4%, 65.8%, and 10.3% respectively when compared with well-known BAST, FAST and sector mapping algorithms.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.11 no.4
• /
• pp.209-218
• /
• 2016

This paper proposes a new lifetime aware buffer mapping method of a synchronous dataflow (SDF) graph on a hybrid memory system with DRAM and PRAM. Since the number of write operations on PRAM is limited, the number of written samples on PRAM is minimized to maximize the lifetime of PRAM. We improve the utilization of DRAM by mapping more buffers on DRAM through buffer sharing. The problem is formulated formally and solved by an optimal approach of an answer set programming. In experiment, the buffer mapping method with buffer sharing improves the PRAM lifetime by 63%.