• Title/Summary/Keyword: Operation Set Time

Search Result 536, Processing Time 0.026 seconds

Hardware Approach to Fuzzy Inference―ASIC and RISC―

  • Watanabe, Hiroyuki
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1993.06a
    • /
    • pp.975-976
    • /
    • 1993
  • This talk presents the overview of the author's research and development activities on fuzzy inference hardware. We involved it with two distinct approaches. The first approach is to use application specific integrated circuits (ASIC) technology. The fuzzy inference method is directly implemented in silicon. The second approach, which is in its preliminary stage, is to use more conventional microprocessor architecture. Here, we use a quantitative technique used by designer of reduced instruction set computer (RISC) to modify an architecture of a microprocessor. In the ASIC approach, we implemented the most widely used fuzzy inference mechanism directly on silicon. The mechanism is beaded on a max-min compositional rule of inference, and Mandami's method of fuzzy implication. The two VLSI fuzzy inference chips are designed, fabricated, and fully tested. Both used a full-custom CMOS technology. The second and more claborate chip was designed at the University of North Carolina(U C) in cooperation with MCNC. Both VLSI chips had muliple datapaths for rule digital fuzzy inference chips had multiple datapaths for rule evaluation, and they executed multiple fuzzy if-then rules in parallel. The AT & T chip is the first digital fuzzy inference chip in the world. It ran with a 20 MHz clock cycle and achieved an approximately 80.000 Fuzzy Logical inferences Per Second (FLIPS). It stored and executed 16 fuzzy if-then rules. Since it was designed as a proof of concept prototype chip, it had minimal amount of peripheral logic for system integration. UNC/MCNC chip consists of 688,131 transistors of which 476,160 are used for RAM memory. It ran with a 10 MHz clock cycle. The chip has a 3-staged pipeline and initiates a computation of new inference every 64 cycle. This chip achieved an approximately 160,000 FLIPS. The new architecture have the following important improvements from the AT & T chip: Programmable rule set memory (RAM). On-chip fuzzification operation by a table lookup method. On-chip defuzzification operation by a centroid method. Reconfigurable architecture for processing two rule formats. RAM/datapath redundancy for higher yield It can store and execute 51 if-then rule of the following format: IF A and B and C and D Then Do E, and Then Do F. With this format, the chip takes four inputs and produces two outputs. By software reconfiguration, it can store and execute 102 if-then rules of the following simpler format using the same datapath: IF A and B Then Do E. With this format the chip takes two inputs and produces one outputs. We have built two VME-bus board systems based on this chip for Oak Ridge National Laboratory (ORNL). The board is now installed in a robot at ORNL. Researchers uses this board for experiment in autonomous robot navigation. The Fuzzy Logic system board places the Fuzzy chip into a VMEbus environment. High level C language functions hide the operational details of the board from the applications programme . The programmer treats rule memories and fuzzification function memories as local structures passed as parameters to the C functions. ASIC fuzzy inference hardware is extremely fast, but they are limited in generality. Many aspects of the design are limited or fixed. We have proposed to designing a are limited or fixed. We have proposed to designing a fuzzy information processor as an application specific processor using a quantitative approach. The quantitative approach was developed by RISC designers. In effect, we are interested in evaluating the effectiveness of a specialized RISC processor for fuzzy information processing. As the first step, we measured the possible speed-up of a fuzzy inference program based on if-then rules by an introduction of specialized instructions, i.e., min and max instructions. The minimum and maximum operations are heavily used in fuzzy logic applications as fuzzy intersection and union. We performed measurements using a MIPS R3000 as a base micropro essor. The initial result is encouraging. We can achieve as high as a 2.5 increase in inference speed if the R3000 had min and max instructions. Also, they are useful for speeding up other fuzzy operations such as bounded product and bounded sum. The embedded processor's main task is to control some device or process. It usually runs a single or a embedded processer to create an embedded processor for fuzzy control is very effective. Table I shows the measured speed of the inference by a MIPS R3000 microprocessor, a fictitious MIPS R3000 microprocessor with min and max instructions, and a UNC/MCNC ASIC fuzzy inference chip. The software that used on microprocessors is a simulator of the ASIC chip. The first row is the computation time in seconds of 6000 inferences using 51 rules where each fuzzy set is represented by an array of 64 elements. The second row is the time required to perform a single inference. The last row is the fuzzy logical inferences per second (FLIPS) measured for ach device. There is a large gap in run time between the ASIC and software approaches even if we resort to a specialized fuzzy microprocessor. As for design time and cost, these two approaches represent two extremes. An ASIC approach is extremely expensive. It is, therefore, an important research topic to design a specialized computing architecture for fuzzy applications that falls between these two extremes both in run time and design time/cost. TABLEI INFERENCE TIME BY 51 RULES {{{{Time }}{{MIPS R3000 }}{{ASIC }}{{Regular }}{{With min/mix }}{{6000 inference 1 inference FLIPS }}{{125s 20.8ms 48 }}{{49s 8.2ms 122 }}{{0.0038s 6.4㎲ 156,250 }} }}

  • PDF

Development of a heuristic algorithm for the effective design of military information networks (국방 전산망의 효율적인 설계를 위한 휴리스틱 알고리듬 개발)

  • U, Hun-Sik;Yoon, Dong-Won
    • Journal of National Security and Military Science
    • /
    • s.1
    • /
    • pp.345-360
    • /
    • 2003
  • To build an information oriented armed forces, the Korean military telecommunication networks adopt TCP/IP standard communication infrastructures based on ATM packet switched networks. Utilizing this network infrastructure, the Korean armed forces also applies to the areas of battleship management for efficient operation command controls and resource management for efficient resource allocations. In this military communication networks, it is essential to determine the least cost network topology under equal performance and reliability constraints. Basically, this type of communication network design problem is known in the literature as an NP Hard problem. As the number of network node increases, it is very hard to obtain an optimal solution in polynomial time. Therefore, it is reasonable to use a heuristic algorithm which provides a good solution with minimal computational efforts. In this study, we developed a simulated annealing based heuristic algorithm which can be utilized for the design of military communication networks. The developed algorithm provides a good packet switched network topology which satisfies a given set of performance and reliability constraints with reasonable computation times.

  • PDF

Designing Container Blocks with Automated Rail-Mounted Gantry Cranes in Container Terminals (컨테이너 터미널에서 자동화 야드 크레인이 설치된 블록의 설계)

  • Lee, Byung-Kwon;Kim, Kap-Hwan
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.35 no.1
    • /
    • pp.73-86
    • /
    • 2009
  • This paper discusses a method of determining the optimal design of a block. A horizontal layout of blocks is assumed in which transfer points are located at a side of the block. Each block has several transfer points (TPs) each of which is assigned to a group of adjacent bays and located at the center of the assigned group. The goal is to find the optimal size of a block and the optimal number of TPs while minimizing the total cost consisting of the fixed and operational cost of yard cranes (YCs), the operational cost of internal trucks, and the installation cost of TPs. Constraints on the maximum expected system time of trucks are imposed for the optimization. Formulas for estimating handling operation cycle times of a YC are derived analytically. Numerical experiments are conducted to illustrate optimal block designs for a given set of data.

Quick Order Acceptance Evaluation System with due dates in mold manufacturing factory (금형공장에서의 납기에 의한 신속 수주 평가시스템)

  • Lee, Moo-Seong;Rho, Hyung-Min;Lee, Soon-Yo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.20 no.4
    • /
    • pp.181-192
    • /
    • 1994
  • In an order-oriented production system such as mold manufacturing, the production starts with an order acceptance, and the production planning is set up according to the accepted order information. Such a work can be done through a dynamic process management system which can reflect shop floor situation dynamically. In this paper, so called the Quick order acceptance evaluation system that can investigate order confirmation quickly, is discussed. When an order is asked, this system must consider the time constraint to determine whether to accept or not, and must be reliable when the determined results are used in the shop floor. For this system, firstly, we simplified the machines by grouping based on their operation capabilities, secondly, we conducted load analysis to calculate available capacities during given periods using heuristic method instead of mathematical algorithm, thirdly, expert can input his experienced knowledge into the system interactively when simulation results don't meet the required due dates. As a case study, we applied this system to an injection mold manufacturing factory.

  • PDF

A Path Planning of Mobile Robot using Distribution Density (분포 밀도를 이용한 이동 로봇의 최적 경로)

  • Kwak, Jae-Hyuk;Lim, Joon-Hong
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.520-522
    • /
    • 2004
  • In this paper, we propose the algorithm of path planning and obstacle avoidance for mobile robot. We call the proposed method Random Access Sequence(RAS) method. In the proposed method, a small region is set first and numbers are assigned to its neighbors, then the path is selected using these numbers. It has an advantage of fast planning and simple operation. This means that new path selection may be possible within short time and that helps a robot to avoid obstacle in any direction. When a robot meets moving obstacles, it avoids obstacles in a random direction. Sonar ranger is useful to get obstacle information and RAS may be a good solution for path planning.

  • PDF

Data Mining for Detection of Diabetic Retinopathy

  • Moskowitz, Samuel E.
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.09a
    • /
    • pp.372-375
    • /
    • 2003
  • The incidence of blindness resulting from diabetic retinopathy has significantly increased despite the intervention of insulin to control diabetes mellitus. Early signs are microaneurysms, exudates, intraretinal hemorrhages, cotton wool patches, microvascular abnormalities, and venous beading. Advanced stages include neovascularization, fibrous formations, preretinal and vitreous microhemorrhages, and retinal detachment. Microaneurysm count is important because it is an indicator of retinopathy progression. The purpose of this paper is to apply data mining to detect diabetic retinopathy patterns in routine fundus fluorescein angiography. Early symptoms are of principal interest and therefore the emphasis is on detecting microaneurysms rather than vessel tortuosity. The analysis does not involve image-recognition algorithms. Instead, mathematical filtering isolates microaneurysms, microhemorrhages, and exudates as objects of disconnected sets. A neural network is trained on their distribution to return fractal dimension. Hausdorff and box counting dimensions grade progression of the disease. The field is acquired on fluorescein angiography with resolution superior to color ophthalmoscopy, or on patterns produced by physical or mathematical simulations that model viscous fingering of water with additives percolated through porous media. A mathematical filter and neural network perform the screening process thereby eliminating the time consuming operation of determining fractal set dimension in every case.

  • PDF

A Study on Deducing Quality Improvement Candidate Factors of IT Service Management System Based on SLA (SLA기반 IT서비스관리시스템의 품질개선 후보요인 도출방안 연구 : K사를 중심으로)

  • Jung, Sang-Chul;Kim, Myung-Seuk
    • Journal of Information Technology Applications and Management
    • /
    • v.15 no.4
    • /
    • pp.103-121
    • /
    • 2008
  • Service Providers need to monitor the level of consumer's satisfaction on service they provide continuously and they use appropriate method to measure their operating status. They have to make a plan on their resource and infrastructure to provide their service in the right place at the right time whenever they need. Most previous studies on IT service quality are mainly focused on criteria or levels of quality measurement even though those criteria and levels should be set by considering consumer's needs. And considering for consumer's needs with managerial factors was not found on those studies. So, we suggest deducing quality factors for continuous improvement of IT service management system in this paper as identify the relative priority using QFD method which consider consumers' voices and managerial factors when decide quality factors of IT service management system introduced SLA. We also confirm that our suggestion is practicable and applicable for current operation by case study.

  • PDF

AUTOMATIC LEVELING CONTROL SYSTEM FOR COMBINE

  • Lee, S. S.;K. S. Oh;H. Hwang;Park, D. Y.
    • Proceedings of the Korean Society for Agricultural Machinery Conference
    • /
    • 2000.11c
    • /
    • pp.684-689
    • /
    • 2000
  • In harvesting rice and barley using combine, the inclination of the body caused by the irregular surface condition of the field and the soil sinking from the unbalanced weight during the grain collection used to make harvesting operation difficult and even impossible. To overcome such a problem, automatic leveling control system for a combine has been developed and tested. The system was composed of the sensor for measuring left and right inclination of the combine chassis and the hydraulic control system. The adaptability of the control system was investigated by analyzing system response in time domain. And the limit angle of the leveling control was set up to be +/- 7$^{\circ}$. The proposed control and hydraulic power system was implemented to the prototype combine. The prototype combine was designed and built as a separable structure with chassis and track. This paper shows results of the leveling performance tested in the laboratory and the grain field.

  • PDF

ADS-B based Trajectory Prediction and Conflict Detection for Air Traffic Management

  • Baek, Kwang-Yul;Bang, Hyo-Choong
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.13 no.3
    • /
    • pp.377-385
    • /
    • 2012
  • The Automatic Dependent Surveillance Broadcast (ADS-B) system is a key component of CNS/ATM recommended by the International Civil Aviation Organization (ICAO) as the next generation air traffic control system. ADS-B broadcasts identification, positional data, and operation information of an aircraft to other aircraft, ground vehicles and ground stations in the nearby region. This paper explores the ADS-B based trajectory prediction and the conflict detection algorithm. The multiple-model based trajectory prediction algorithm leads accurate predicted conflict probability at a future forecast time. We propose an efficient and accurate algorithm to calculate conflict probability based on approximation of the conflict zone by a set of blocks. The performance of proposed algorithms is demonstrated by a numerical simulation of two aircraft encounter scenarios.

a linear system approach

  • 이태억
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1993.10a
    • /
    • pp.118-118
    • /
    • 1993
  • We consider a discrete event dynamic system called periodic job shop, where an identical mixture of items called minimal part set(MPS) is repetitively produced in the same processing order and the primary performance measure is the cycle time. The precedence relationships among events(starts of operations) are represented by a directed graph with rocurront otructure. When each operation starts as soon as all its preceding operations complete(called earliest starting), the occurrences of events are modeled in a linear system using a special algebra called minimax algebra. By investigating the eigenvalues and the eigenvectors, we develop conditions on the directed graph for which a stable steady state or a finite eigenvector exists. We demonstrate that each finite eigenvector, characterized as a finite linear combination of a class of eigenvalue, is the minimum among all the feasible schedules and an identical schedule pattern repeats every MPS. We develop an efficient algorithm to find a schedule among such schedules that minimizes a secondary performance measure related to work-in-process inventory. As a by-product of the linear system approach, we also propose a way of characterizing stable steady states of a class of discrete event dynamic systems.

  • PDF