• Title/Summary/Keyword: 유연한 알고리즘

Search Result 443, Processing Time 0.028 seconds

Development of the Digital AVR for Ship Generator (선박발전기용 디지털 AVR 개발)

  • Kim, T.W.;Kim, S.W.;Lee, S.B.;Song, S.H.;Lee, S.J.;Kim, M.C.;Lee, S.D.
    • Proceedings of the KIEE Conference
    • /
    • 2003.07b
    • /
    • pp.828-830
    • /
    • 2003
  • AVR은 동기발전기의 출력전압을 부하변동에 관계없이 일정하게 제어하며 발전기 및 시스템 보호를 위한 각 종 제어 알고리즘을 구비하고 있다. 종래의 아나로그타입 AVR은 제어설정이 불편하고 제어신뢰성이 떨어지기 때문에 점차 디지털 타입으로 교체되고 있다. 본 연구는 선박발전기에 적용하기 위한 디지털 AVR 개발에 관한 것이다. TI사의 TMS320LF2407 CPU를 사용하여 제어 H/W를 개발했으며, 과여자/저여자제어, Droop제어, 무부하/역률제어 등 다양한 제어기능을 S/W로 구비하여 부하에 따른 적용의 유연성을 높였다. 그리고 전력회로는 IGBT를 사용하여 고속 스위칭 제어함으로써 SCR 방식에 비해 제어 속응성을 개선하였다. 개발 된 제품은 AVR, 직류전원공급장치 및 부하나 계통의 사고시 보호를 위한 전류부스트(CBS)기능을 포함하고 있다.

  • PDF

User-Information based Adaptive Service Management Algorithm (사용자 정보기반의 적응적인 서비스관리 알고리즘)

  • Park, Hea-Sook
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.8
    • /
    • pp.81-88
    • /
    • 2009
  • Many studies and policies are suggested for customer satisfaction to survive in multimedia content service markets. there are policies like a segregating the clients using the contents service and allocating the media server's resources distinctively by clusters using the cluster analysis method of CRM. The problem of this policy is fixed allocation of media server resources. It is inefficient for costly media server resource. To resolve the problem and enhance the utilization of media server resource, the ACRFA (Adaptive Client Request Filtering Algorithm) was suggested per cluster to allocate media server resources by flexible resource allocation method.

Building Korean Dependency Treebanks Reflected Chunking (구묶음을 반영한 한국어 의존 구조 말뭉치 생성)

  • Namgoong, Young;Kim, Chang-Hyun;Cheon, Min-Ah;Park, Ho-Min;Yoon, Ho;Choi, Min-Seok;Kim, Jae-Kyun;Kim, Jae-Hoon
    • Annual Conference on Human and Language Technology
    • /
    • 2019.10a
    • /
    • pp.133-138
    • /
    • 2019
  • 의존 구문 분석은 문장 구성 요소의 위치에 제약이 적고 생략에도 유연하게 대처할 수 있어 한국어 구문 분석에 적합하다. 하지만 의존 구문 분석을 수행할 때 지배소를 결정해야 할 노드 수가 많으면 계산의 복잡도가 올라가고, 각 노드의 지배소를 결정할 때 방향성 문제가 있어 구문 분석에 모호함을 더한다. 이때 지배소 후위 원칙을 엄격하게 적용할 경우 구문적 중심어와 의미적 중심어가 불일치하는 문제가 발생한다. 이러한 문제들을 해소하기 위해 구묶음을 수행한 문장으로 구문 분석을 수행할 수 있다. 따라서, 본 논문에서는 기존의 의존 구문 말뭉치를 말덩이 기반의 의존 구문 말뭉치로 변환하는 알고리즘을 기술하고, 이에 따라 구축한 말뭉치와 기존의 말뭉치를 정량적으로 비교한다.

  • PDF

Designed and Development of Location Tracking System by The Short-Range Radio Frequency Relay Algorithm (근거리 RF중계알고리즘에 의한 구내 위치추적시스템 연구)

  • Park, Sang-Min;Lee, Gong;Lee, Sang-Keun
    • Convergence Security Journal
    • /
    • v.8 no.3
    • /
    • pp.73-81
    • /
    • 2008
  • We can find easily about researches or technical development that deal with grasping the location of an object with GPS(Global Positioning System) in order to use them as a useful information. Most researches or technical development on application of tracing have been developed for the purpose of tracing objects in broad area as physical distribution or transportation, but recently, there are many researches on tracing materials in premise area as a fork lift, carts, or the equipment of work. In general, a system that utilizes location information of objects needs data communication network to transmit location data and it ensures data communication network by using common networks(SK, LG, KFT) or wireless LAN. However these two methods need monthly payment for the rental fee or require considerable amount of investment for the early stage so it is difficult to use them merely for tracing premise subjects. This study was conducted to build a tracing system for premise area by local area RF relay algorithm with low cost applying RF relay algorithm to local area wireless communication(ZIGBEE, 424MHz, Bluetooth, 900MHz) system in order to supplement these demerits and included relay algorithm, RF locating information terminal, local area RF gab-fillers, a plan for collection server of locating information, and the way of realization as they are needed in this system. I consider that this study would be applicable with flexibility in the industry area that needs tracing solution within a specific area or needs ensuring data communication network, to transmit data in ubiquitous environment, by easier and more rapid way with lower cost.

  • PDF

AUX Model for restoring and analyzing Associative User Experience informations (연상된 사용자 경험정보 축척 및 분석을 위한 AUX 모델)

  • Ryu, Chun-Yeol;Yang, Hae-Sool
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.12
    • /
    • pp.586-596
    • /
    • 2011
  • In the IT industry, processing units of IT applications are getting smaller and high efficient. Furthermore, the realization of various smart functions is highly feasible now due to advances in sensing technology. The service infrastructures on high efficient and compact mobile devices are applied to various areas. These also could be possessed by users and is built into the devices. Currently, studies on the UX(User Experience) field to attempt an analysis and prediction of user's information are continuing with reference to the UI(User Interface). However, research on the common framework of classification and storing the user-information, and standardization of form has not been attempted yet. In this study, we proposed the AUX(Associative user Experience) model and process structure to store various empirical data by users. The AUX model expressed a diversity of user's empirical data using extended E-TCPN model. And also, we expressed the data structure using XML with reference to the application of AUX model. This expressed model and separation of process structure guarantee its specialty, productivity and flexibility through the humanistic characteristics of users and the independence of technical process structure. The AUX model maps out the AUX information process architecture and expressed the process with the improved MPP algorithm, to analyze of its performance. The simulation of movements applying to MPP traffic allocation of VOD is used to analyze of its performance. The playback deviation of MPP Graphic Allocation Algorism where the AUX model was applied was improved by 10.41% more than the one where it was not applied. As a result of that, playback performance has improved due to the conversion of AUX with accessing media, content of users and dynamic traffic allocation such as MPI and CPI.

Gait Pattern Generation of S-link Biped Robot Based on Trajectory Images of Human's Center of Gravity (인간의 COG 궤적의 분석을 통한 5-link 이족 로봇의 보행 패턴 생성)

  • Kim, Byoung-Hyun;Han, Young-Joon;Hahn, Hern-Soo
    • Journal of KIISE:Software and Applications
    • /
    • v.36 no.2
    • /
    • pp.131-143
    • /
    • 2009
  • Based on the fact that a human being walks naturally and stably with consuming a minimum energy, this paper proposes a new method of generating a natural gait of 5-link biped robot like human by analyzing a COG (Center Of Gravity) trajectory of human's gait. In order to generate a natural gait pattern for 5-link biped robot, it considers the COG trajectory measured from human's gait images on the sagittal and frontal plane. Although the human and 5-link biped robot are similar in the side of the kinematical structure, numbers of their DOFs(Degree Of Freedom) are different. Therefore, torques of the human's joints cannot are applied to robot's ones directly. In this paper, the proposed method generates the gait pattern of the 5-link biped robot from the GA algorithm which utilize human's ZMP trajectory and torques of all joints. Since the gait pattern of the 5-link biped robot model is generated from human's ones, the proposed method creates the natural gait pattern of the biped robot that minimizes an energy consumption like human. In the side of visuality and energy efficiency, the superiority of the proposed method have been improved by comparative experiments with a general method that uses a inverse kinematics.

Discovering Association Rules using Item Clustering on Frequent Pattern Network (빈발 패턴 네트워크에서 아이템 클러스터링을 통한 연관규칙 발견)

  • Oh, Kyeong-Jin;Jung, Jin-Guk;Ha, In-Ay;Jo, Geun-Sik
    • Journal of Intelligence and Information Systems
    • /
    • v.14 no.1
    • /
    • pp.1-17
    • /
    • 2008
  • Data mining is defined as the process of discovering meaningful and useful pattern in large volumes of data. In particular, finding associations rules between items in a database of customer transactions has become an important thing. Some data structures and algorithms had been proposed for storing meaningful information compressed from an original database to find frequent itemsets since Apriori algorithm. Though existing method find all association rules, we must have a lot of process to analyze association rules because there are too many rules. In this paper, we propose a new data structure, called a Frequent Pattern Network (FPN), which represents items as vertices and 2-itemsets as edges of the network. In order to utilize FPN, We constitute FPN using item's frequency. And then we use a clustering method to group the vertices on the network into clusters so that the intracluster similarity is maximized and the intercluster similarity is minimized. We generate association rules based on clusters. Our experiments showed accuracy of clustering items on the network using confidence, correlation and edge weight similarity methods. And We generated association rules using clusters and compare traditional and our method. From the results, the confidence similarity had a strong influence than others on the frequent pattern network. And FPN had a flexibility to minimum support value.

  • PDF

Hybrid Buffer Structured Optical Packet Switch with the Limited Numbers of Tunable Wavelength Converters and Internal Wavelengths (제한된 수의 튜닝 가능한 파장변환기와 내부파장을 갖는 하이브리드 버퍼 구조의 광 패킷 스위치)

  • Lim, Huhn-Kuk
    • Journal of Internet Computing and Services
    • /
    • v.10 no.2
    • /
    • pp.171-177
    • /
    • 2009
  • Optical packet switching(OPS) is a strong candidate for the next-generation internet, since it has a fine switching granularity at the packet level for providing flexible bandwidth, and provides seamless integration between WDM layer and IP layer. Optical packet switching have been studied in two categories: OPS in synchronous and OPS in asynchronous networks. In this article we are focused on contention resolution of OPS in asynchronous networks. The hybrid buffer have been addressed, to reduce packet loss further as one of the alternative buffer structures for contention resolution of asynchronous and variable length packets, which consists of the FDL buffer and the electronic buffer. The OPS design issue for the limited number of TWCs and internal wavelengths is important in the aspect of switch cost and resource efficiency. Therefore, an hybrid buffer structured optical packet switch and its scheduling algorithm is presented for considering the limited number of TWCs and internal wavelengths, for contention resolution of asynchronous and variable length packets. The proposed algorithm could lead to the packet loss improvement compared to the legacy LAUC-VF algorithm with only the FDL buffer.

  • PDF

A Study on the Traffic Simulation for Autonomous Vehicles Considering Weather Environment (기상 환경을 고려한 자율주행 차량용 교통 시뮬레이션에 관한 연구)

  • Seo-Young Lee;Sung-Jung Yong;Hyo-Gyeong Park;Yeon-Hwi You;Il-Young Moon
    • Journal of Advanced Navigation Technology
    • /
    • v.27 no.1
    • /
    • pp.36-42
    • /
    • 2023
  • The development of autonomous vehicles are currently being actively carried out by various companies and research institutes. Expectations for commercialization in daily life as well as specific industries are also rising. Simulators for autonomous vehicles are an essential element in algorithm development and execution considering stability and cost. In this need, various simulators and platforms for simulators are emerging, but research on simulations that reflect various meteorological environmental factors in the real world is still insufficient. This paper proposes a traffic simulation for autonomous vehicles that can consider the weather environment. The weather environment that can be set is largely classified into four categories, and an improved collision prevention algorithm to apply them is presented. Simulation development was conducted through Carla's Python API, a development tool for autonomous driving, and the performance results were compared with existing collision algorithms. Through this, we tried to propose improvements for the development of advanced self-driving vehicle simulations that can reflect various weather environmental factors in real life.

Closed Integral Form Expansion for the Highly Efficient Analysis of Fiber Raman Amplifier (라만증폭기의 효율적인 성능분석을 위한 라만방정식의 적분형 전개와 수치해석 알고리즘)

  • Choi, Lark-Kwon;Park, Jae-Hyoung;Kim, Pil-Han;Park, Jong-Han;Park, Nam-Kyoo
    • Korean Journal of Optics and Photonics
    • /
    • v.16 no.3
    • /
    • pp.182-190
    • /
    • 2005
  • The fiber Raman amplifier(FRA) is a distinctly advantageous technology. Due to its wider, flexible gain bandwidth, and intrinsically lower noise characteristics, FRA has become an indispensable technology of today. Various FRA modeling methods, with different levels of convergence speed and accuracy, have been proposed in order to gain valuable insights for the FRA dynamics and optimum design before real implementation. Still, all these approaches share the common platform of coupled ordinary differential equations(ODE) for the Raman equation set that must be solved along the long length of fiber propagation axis. The ODE platform has classically set the bar for achievable convergence speed, resulting exhaustive calculation efforts. In this work, we propose an alternative, highly efficient framework for FRA analysis. In treating the Raman gain as the perturbation factor in an adiabatic process, we achieved implementation of the algorithm by deriving a recursive relation for the integrals of power inside fiber with the effective length and by constructing a matrix formalism for the solution of the given FRA problem. Finally, by adiabatically turning on the Raman process in the fiber as increasing the order of iterations, the FRA solution can be obtained along the iteration axis for the whole length of fiber rather than along the fiber propagation axis, enabling faster convergence speed, at the equivalent accuracy achievable with the methods based on coupled ODEs. Performance comparison in all co-, counter-, bi-directionally pumped multi-channel FRA shows more than 102 times faster with the convergence speed of the Average power method at the same level of accuracy(relative deviation < 0.03dB).