• Title/Summary/Keyword: Systems approach

Search Result 10,031, Processing Time 0.036 seconds

A 200-MHz@2.5V 0.25-$\mu\textrm{m}$ CMOS Pipelined Adaptive Decision-Feedback Equalizer (200-MHz@2.5-V 0.25-$\mu\textrm{m}$ CMOS 파이프라인 적응 결정귀환 등화기)

  • 안병규;이종남;신경욱
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2000.05a
    • /
    • pp.465-469
    • /
    • 2000
  • This paper describes a single-chip full-custom implementation of pipelined adaptive decision-feedback equalizer (PADFE) using a 0.25-${\mu}{\textrm}{m}$ CMOS technology for wide-band wireless digital communication systems. To enhance the throughput rate of ADFE, two pipeline stage are inserted into the critical path of the ADFE by using delayed least-mean-square (DLMS) algorithm Redundant binary (RB) arithmetic is applied to all the data processing of the PADFE including filter taps and coefficient update blocks. When compared with conventional methods based on two's complement arithmetic, the proposed approach reduces arithmetic complexity, as well as results in a very simple complex-valued filter structure, thus suitable for VLSI implementation. The design parameters including pipeline stage, filter tap, coefficient and internal bit-width and equalization performance such as bit error rate (BER) and convergence speed are analyzed by algorithm-level simulation using COSSAP. The singl-chip PADFE contains about 205,000 transistors on an area of about 1.96$\times$1.35-$\textrm{mm}^2$. Simulation results show that it can safely operate with 200-MHz clock frequency at 2.5-V supply, and its estimated power dissipation is about 890-mW.

  • PDF

The U.S. Legal System in Telecommunication Standardization (미국의 정보통신 표준화 법체계 연구)

  • Sohn, Hong;Park, Ki-Shik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2000.05a
    • /
    • pp.50-55
    • /
    • 2000
  • The United States has had the superiority in the global trading market, and focused on the deregulation, decentralization, and often competitiveness. Also, it has adhered to pluralistic and uncoordinated systems for its various standard related activities. But with the WTO TBT entering into force late in 1990s, international standards have become more important in the global telecommunication market. So it has been recognized that the progressive standard activity would lead to keep the superiority of the nation in global telecommunication market. Specially, as the EU has been most active in building an agreed-upon technical standards among Its members, the US has faced with a serious problem that it has lack of agreed-upon infrastructure for standards. Hence, to keep the leadership in international telecommunications market, now it has been focusing on the national approach to standardization activities through the governmental support. For the implementation of above purposes, it amended 2 Acts. One is the Telecommunication Act of 1996. The other is NTTAA(National Technology Transfer and Advancement Art) of 1996, which was enacted according to the 1995 report "Standards, Conformity Assessment, and Trade into the 21 Century" by )TRC(National Research Council). In this paper, we analyse the US legal system in telecommunication standardization field including above arts and their Implementing plans. And we suggest the need for the active system of government in our telecommunication standardization.

  • PDF

A Study of the Local Administration Environment Change and 'Mobum Burak Development' in 5 · 16 Military Government Period (5 · 16 군정기 지방행정 환경변화와 모범부락조성사업에 대한 고찰)

  • Seo, Man Yong;Park, Su Young
    • Journal of Agricultural Extension & Community Development
    • /
    • v.20 no.3
    • /
    • pp.643-678
    • /
    • 2013
  • The purposes of study are to examine early appearance of rural village development that local administration firstly promoted through the 'Mobum Burak Development' promoted in environment change around the local government in 5 16 military government period and find implications of the current rural village development. During the military government period(1961~1963), rural administration showed lots of changes such as reorganization of administration system whose basic local government are si gun, introduction of national planning system and spread of si gun, reorganization of rural taxation system, diversification of extension caused by the establishment of rural facilities such as new Nong-hyup, RDA, etc. Thus, the main axis of development administration of counties was transferred from central government or American aid organization to local administration. According to the basic operation plan introduced after the 5 16 as a planning system, the Ministry of Home Affairs instructed to write and promote gun construction plan based on all conditions of gun as long-term general plan of rural development. Therefore, each do established general plans such as 'Nongdo Jeonbuk Geundaehwa Plan', 'Yakjin Gyeongbuk Plan', 'Jeonnam Miraesang', etc. and Mobum Burak Development was promoted by all kinds of titles such as 'Bogoganeun Maeul(Jeonbuk)', 'Bitnaneun Maeul(Chungnam)', 'Hyeokmyeong Chon(Gyeonggi)', 'Saemaeul geonseol(Gyeongnam)', etc. as a business of rural village development. But, business contents of gun's 'construction plan' couldn't be mutually connected although Mobum Burak Development and unit business contents were promoted by duplicated plan. It became useless general plan as times went by as business focusing on short-term outcomes rather than construction based on long-term region. Mobum Burak Development also borrowed contents community development business, but military government couldn't approach basic solution of village and regional agriculture by focusing on short-term outcome, without imitation of form and procedure. This study is judged to be utilized as basic data of following studies because rural village development companies focusing on national policies discovered unit rural companies and analyzed them by connecting to environment changes of rural administration.

Efficient Algorithms for Multicommodity Network Flow Problems Applied to Communications Networks (다품종 네트워크의 효율적인 알고리즘 개발 - 정보통신 네트워크에의 적용 -)

  • 윤석진;장경수
    • The Journal of Information Technology
    • /
    • v.3 no.2
    • /
    • pp.73-85
    • /
    • 2000
  • The efficient algorithms are suggested in this study for solving the multicommodity network flow problems applied to Communications Systems. These problems are typical NP-complete optimization problems that require integer solution and in which the computational complexity increases numerically in appropriate with the problem size. Although the suggested algorithms are not absolutely optimal, they are developed for computationally efficient and produce near-optimal and primal integral solutions. We supplement the traditional Lagrangian method with a price-directive decomposition. It proceeded as follows. First, A primal heuristic from which good initial feasible solutions can be obtained is developed. Second, the dual is initialized using marginal values from the primal heuristic. Generally, the Lagrangian optimization is conducted from a naive dual solution which is set as ${\lambda}=0$. The dual optimization converged very slowly because these values have sort of gaps from the optimum. Better dual solutions improve the primal solution, and better primal bounds improve the step size used by the dual optimization. Third, a limitation that the Lagrangian decomposition approach has Is dealt with. Because this method is dual based, the solution need not converge to the optimal solution in the multicommodity network problem. So as to adjust relaxed solution to a feasible one, we made efficient re-allocation heuristic. In addition, the computational performances of various versions of the developed algorithms are compared and evaluated. First, commercial LP software, LINGO 4.0 extended version for LINDO system is utilized for the purpose of implementation that is robust and efficient. Tested problem sets are generated randomly Numerical results on randomly generated examples demonstrate that our algorithm is near-optimal (< 2% from the optimum) and has a quite computational efficiency.

  • PDF

A Hybrid Search Method of A* and Dijkstra Algorithms to Find Minimal Path Lengths for Navigation Route Planning (내비게이션 경로설정에서 최단거리경로 탐색을 위한 A*와 Dijkstra 알고리즘의 하이브리드 검색법)

  • Lee, Yong-Hu;Kim, Sang-Woon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.10
    • /
    • pp.109-117
    • /
    • 2014
  • In navigation route planning systems using A* algorithms, the cardinality of an Open list, which is a list of candidate nodes through which a terminal node can be accessed, increases as the path length increases. In this paper, a method of alternately utilizing the Dijkstra's algorithm and the A* algorithm to reduce the cardinality of the Open list is investigated. In particular, by employing a depth parameter, named Level, the two algorithms are alternately performed depending on the Level's value. Using the hybrid searching approach, the Open list constructed in the Dijkstra's algorithm is transferred into the Open list of the A* algorithm, and consequently, the unconstricted increase of the cardinality of the Open list of the former algorithm can be avoided and controlled appropriately. In addition, an optimal or nearly optimal path similar to the Dijkstra's route, but not available in the A* algorithm, can be found. The experimental results, obtained with synthetic and real-life benchmark data, demonstrate that the computational cost, measured with the number of nodes to be compared, was remarkably reduced compared to the traditional searching algorithms, while maintaining the similar distance to those of the latter algorithms. Here, the values of Level were empirically selected. Thus, a study on finding the optimal Level values, while taking into consideration the actual road conditions remains open.

Enhanced Healing of Rat Calvarial Bone Defects with Hypoxic Conditioned Medium from Mesenchymal Stem Cells through Increased Endogenous Stem Cell Migration via Regulation of ICAM-1 Targeted-microRNA-221

  • Chang, Woochul;Kim, Ran;Park, Sang In;Jung, Yu Jin;Ham, Onju;Lee, Jihyun;Kim, Ji Hyeong;Oh, Sekyung;Lee, Min Young;Kim, Jongmin;Park, Moon-Seo;Chung, Yong-An;Hwang, Ki-Chul;Maeng, Lee-So
    • Molecules and Cells
    • /
    • v.38 no.7
    • /
    • pp.643-650
    • /
    • 2015
  • The use of conditioned medium from mesenchymal stem cells may be a feasible approach for regeneration of bone defects through secretion of various components of mesenchymal stem cells such as cytokines, chemokines, and growth factors. Mesenchymal stem cells secrete and accumulate multiple factors in conditioned medium under specific physiological conditions. In this study, we investigated whether the conditioned medium collected under hypoxic condition could effectively influence bone regeneration through enhanced migration and adhesion of endogenous mesenchymal stem cells. Cell migration and adhesion abilities were increased through overexpression of intercellular adhesion molecule-1 in hypoxic conditioned medium treated group. Intercellular adhesion molecule-1 was upregulated by microRNA-221 in mesenchymal stem cells because microRNAs are key regulators of various biological functions via gene expression. To investigate the effects in vivo, evaluation of bone regeneration by computed tomography and histological assays revealed that osteogenesis was enhanced in the hypoxic conditioned medium group relative to the other groups. These results suggest that behavioral changes of endogenous mesenchymal stem cells through microRNA-221 targeted-intercellular adhesion molecule-1 expression under hypoxic conditions may be a potential treatment for patients with bone defects.

A Novel Compressed Sensing Technique for Traffic Matrix Estimation of Software Defined Cloud Networks

  • Qazi, Sameer;Atif, Syed Muhammad;Kadri, Muhammad Bilal
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.10
    • /
    • pp.4678-4702
    • /
    • 2018
  • Traffic Matrix estimation has always caught attention from researchers for better network management and future planning. With the advent of high traffic loads due to Cloud Computing platforms and Software Defined Networking based tunable routing and traffic management algorithms on the Internet, it is more necessary as ever to be able to predict current and future traffic volumes on the network. For large networks such origin-destination traffic prediction problem takes the form of a large under- constrained and under-determined system of equations with a dynamic measurement matrix. Previously, the researchers had relied on the assumption that the measurement (routing) matrix is stationary due to which the schemes are not suitable for modern software defined networks. In this work, we present our Compressed Sensing with Dynamic Model Estimation (CS-DME) architecture suitable for modern software defined networks. Our main contributions are: (1) we formulate an approach in which measurement matrix in the compressed sensing scheme can be accurately and dynamically estimated through a reformulation of the problem based on traffic demands. (2) We show that the problem formulation using a dynamic measurement matrix based on instantaneous traffic demands may be used instead of a stationary binary routing matrix which is more suitable to modern Software Defined Networks that are constantly evolving in terms of routing by inspection of its Eigen Spectrum using two real world datasets. (3) We also show that linking this compressed measurement matrix dynamically with the measured parameters can lead to acceptable estimation of Origin Destination (OD) Traffic flows with marginally poor results with other state-of-art schemes relying on fixed measurement matrices. (4) Furthermore, using this compressed reformulated problem, a new strategy for selection of vantage points for most efficient traffic matrix estimation is also presented through a secondary compression technique based on subset of link measurements. Experimental evaluation of proposed technique using real world datasets Abilene and GEANT shows that the technique is practical to be used in modern software defined networks. Further, the performance of the scheme is compared with recent state of the art techniques proposed in research literature.

CFI Approach to Defend against GOT Overwrite Attacks (CFI(Control Flow Integrity) 적용을 통한 GOT(Global Offset Table) 변조 공격 방지 방안 연구)

  • Jeong, Seunghoon;Hwang, Jaejoon;Kwon, Hyukjin;Shin, Dongkyoo
    • Journal of Internet Computing and Services
    • /
    • v.21 no.1
    • /
    • pp.179-190
    • /
    • 2020
  • In the Unix-like system environment, the GOT overwrite attack is one of the traditional control flow hijacking techniques for exploiting software privileges. Several techniques have been proposed to defend against the GOT overwrite attack, and among them, the Full Relro(Relocation Read only) technique, which blocks GOT overwrites at runtime by arranging the GOT section as read-only in the program startup, has been known as the most effective defense technique. However, it entails loading delay, which limits its application to a program sensitive to startup performance, and it is not currently applied to the library due to problems including a chain loading delay problem caused by nested library dependency. Also, many compilers, including LLVM, do not apply the Full Relro technique by default, so runtime programs are still vulnerable to GOT attacks. In this paper, we propose a GOT protection scheme using the Control Flow Integrity(CFI) technique, which is currently recognized as the most suitable technique for defense against code reuse attacks. We implemented this scheme based on LLVM and applied it to the binutils-gdb program group to evaluate security, performance and compatibility. The GOT protection scheme with CFI is difficult to bypass, fast, and compatible with existing library programs.

Automatic Generation Method of Road Data based on Spatial Information (공간정보에 기반한 도로 데이터 자동생성 방법)

  • Joo, In-Hak;Choi, Kyoung-Ho;Yoo, Jae-Jun;Hwang, Tae-Hyun;Lee, Jong-Hun
    • Journal of Korea Spatial Information System Society
    • /
    • v.4 no.2 s.8
    • /
    • pp.55-64
    • /
    • 2002
  • VEfficient generation of road data is one of the most important issues in GIS (Geographic Information System). In this paper, we propose a hybrid approach for automatic generation of road data by combining mobile mapping and image processing techniques. Mobile mapping systems have a form of vehicle equipped with CCD camera, GPS, and INS. They can calculate absolute position of objects that appear in acquired image by photogrammetry, but it is labor-intensive and time-consuming. Automatic road detection methods have been studied also by image processing technology. However, the methods are likely to fail because of obstacles and exceptive conditions in the real world. To overcome the problems, we suggest a hybrid method for automatic road generation, by exploiting both GPS/INS data acquired by mobile mapping system and image processing algorithms. We design an estimator to estimate 3-D coordinates of road line and corresponding location in an image. The estimation process reduces complicated image processing operations that find road line. The missing coordinates of road line due to failure of estimation are obtained by cubic spline interpolation. The interpolation is done piecewise, separated by rapid change such as road intersection. We present experimental results of the suggested estimation and interpolation methods with image sequences acquired by mobile mapping system, and show that the methods are effective in generation of road data.

  • PDF

Development of a Model and Methodology for the Analysis of the $CO_2$ Emissions Reduction Effect through the Introduction of the G2B Systems in e-government : ECRE Approach (전자정부 G2B 시스템 도입에 따른 탄소저감효과 분석을 위한 모델 및 방법론 개발)

  • Lim, Gyoo-Gun;Lee, Dae-Chul;Lim, Mi-Hwa;Moon, Jong-In
    • The Journal of Society for e-Business Studies
    • /
    • v.15 no.3
    • /
    • pp.163-181
    • /
    • 2010
  • As a part of efforts to reduce the global emissions of greenhouse gases, the Kyoto Protocol was signed by major developed countries ("Annex I" countries). According to the Kyoto protocol, the Emission Trading Scheme that derives a trading market of the $CO_2$ emission rights is appeared. It causes that business institutions give lots of efforts to reduce $CO_2$ by using new environmentally sound technologies or increasing efficiency in production. On the while there have been several studies trying to develop a methodology to measure the effect of $CO_2$ reduction and its monetary value. In this research we suggest ECRE (Evaluation of $CO_2$ Reduction in E-transformation) model which can measure the $CO_2$ reduction effect through the introduction of G2B system. ECRC model was developed based on the IPCC methodology. ECRC model measures the two major effects of the $CO_2$ reduction which are '$CO_2$ reduction effect from transportation' and '$CO_2$ reduction effect from the decrease of paper use'. In this paper, we calculate the economic effect of $CO_2$ reduction with the case of the G2B system in Korea. This research suggests a basic methodology to measure the $CO_2$ reduction performance for the e-transformed institution.