三维姿态监测技术在地震测井中的应用

在地震测井施工中,为监测地下检波器的运动特征,需应用三维监测技术。首先从映射几何的角度深入分析OpenGL的三维监测技术,建立OpenGL虚拟场景,然后分析检波器模型内外方位元素的表达,利用三维绘图技术建立检波器的立体模型,最后对所获取的坐标数据进行快速的三维绘图技术处理,形成实时可靠的立体模拟界面。实验结果表明:检波器的方位角模拟精确度能保证在1°以内,满足后期简化数据处理的要求。该技术应用在地震测井中时,具有远程、可靠、无损检测等特点,为操作人员提供直观可靠的观测决策平台,并且结合实际需求能够扩展多种功能模块,可广泛应用于测井过程中方位数据的获取。     

Annular‐ring slot antenna designs with circular polarization radiation

The design of a microstrip‐fed annular‐ring slot antenna (ARSA) with circular polarization (CP) radiation is initially studied. To obtain CP radiation with broad 3‐dB axial ratio (AR) bandwidth that can cover the WiMAX 2.3 GHz (2305–2320 MHz, 2345–2360 MHz) and WLAN 2.4 GHz (2400–2480 MHz) bands, a novel technique of extending an inverted L‐shaped slot from the bottom section of the annular‐ring is proposed. To suppress the harmonic modes induced by the CP ARSA, the technique of integrating a defected ground structure into the annular‐ring slot is further introduced. From the measured results, 10‐dB impedance bandwidth and 3‐dB AR bandwidth of 44.86 and 9.68% were achieved by the proposed harmonic suppressed CP ARSA. Furthermore, average gain and radiation efficiency of ～4.7 dBic and 71%, respectively, were also exhibited across the bands of interest. © 2014 Wiley Periodicals, Inc. Int J RF and Microwave CAE 25:337–345, 2015.     

Frequency Insertion Strategy for Channel Assignment Problem

This paper presents a new heuristic method for quickly finding a good feasible solution to the channel assignment problem (CAP). Like many other greedy-type heuristics for CAP, the proposed method also assigns a frequency to a call, one at a time. Hence, the method requires computational time that increases only linear to the number of calls. However, what distinguishes the method from others is that it starts with a narrow enough frequency band so as to provoke violations of constraints that we need to comply with in order to avoid radio interference. Each violation is then resolved by inserting frequencies at the most appropriate positions so that the band of frequencies expands minimally. An extensive computational experiment using a set of randomly generated problems as well as the Philadelphia benchmark instances shows that the proposed method perform statistically better than existing methods of its kind and even yields optimum solutions to most of Philadelphia benchmark instances among which two cases are reported for the first time ever, in this paper. Won-Young Shin was born in Busan, Korea in 1978. He received B.S. in industrial engineering from Pohang University of Science and Technology (POSTECH) in 2001 and M.S in operation research and applied statistics from POSTECH in 2003. Since 2003 he has been a researcher of Agency for Defense Development (ADD) in Korea. He is interested in optimization of communication system and applied statistics. Soo Y. Chang is an associate professor in the Department of Industrial Engineering at Pohang University of Science and Technology (POSTECH), Pohang, Korea. He teaches linear programming, discrete optimization, network flows and operations research courses. His research interests include mathematical programming and scheduling. He has published in several journals including Discrete Applied Mathematics, Computers and Mathematics with Application, IIE Transactions, International Journal of Production Research, and so on. He is a member of Korean IIE, and ORMSS. Jaewook Lee is an assistant professor in the Department of Industrial Engineering at Pohang University of Science and Technology (POSTECH), Pohang, Korea. He received the B.S. degree in mathematics with honors from Seoul National University, and the Ph.D. degree from Cornell University in applied mathematics in 1993 and 1999, respectively. He is currently an assistant professor in the department of industrial engineering at the Pohang University of Science and Technology (POSTECH). His research interests include nonlinear systems, neural networks, nonlinear optimization, and their applications to data mining and financial engineering. Chi-Hyuck Jun was born in Seoul, Korea in 1954. He received B.S. in mineral and petroleum engineering from Seoul National University in 1977, M.S. in industrial engineering from Korea Advanced Institute of Science and Technology in 1979 and Ph.D. in operations research from University of California, Berkeley, in 1986. Since 1987 he has been with the department of industrial engineering, Pohang University of Science and Technology (POSTECH) and he is now a professor and the department head. He is interested in performance analysis of communication and production systems. He has published in several journals including IIE Transactions, IEEE Transactions, Queueing Systems and Chemometrics and Intelligent Laboratory Systems. He is a member of IEEE, INFORMS and ASQ.     

Fast handoff with reducing waste rate approach for wireless resources management in UMTS mobile networks

3G Wideband CDMA systems adopt the Orthogonal Variable Spreading Factor code tree as the channelization codes management for achieving high data rate transmission in personal multimedia communications. It assigns a single channelization code for each accepted connection. Nevertheless, it wastes the system capacity when the required rate is not powers of two of the basic rate. One good solution is to assign multiple codes for each accepted connection but it causes two inevitable drawbacks: long handoff delay and new call setup delay due to high complexity of processing with multiple channelization codes, and high cost of using more number of rake combiners. Especially, long handoff delay may result in more call dropping probability and higher Grade of Service, which will degrade significantly the utilization and revenue of the 3G cellular systems. Therefore, we propose herein an adaptive efficient codes determination algorithm based on the Markov Decision Process analysis approach to reduce the waste rate and reassignments significantly while providing fast handoff. Numerical results demonstrate that the proposed approach yields several advantages, including the lowest GOS, the least waste rate, and the least number of reassignments. Meanwhile, the optimal number of rake combiners is also analyzed in this paper. This research was supported in part by the National Science Council of Taiwan, ROC, under contract NSC-93-2213-E-324-018.