• Title/Summary/Keyword: computer arithmetic

Search Result 252, Processing Time 0.024 seconds

An α-cut Automatic Set based on Fuzzy Binarization Using Fuzzy Logic (퍼지논리를 이용한 α-cut 자동 설정 기반 퍼지 이진화)

  • Lee, Ho Chang;Kim, Kwang Baek;Park, Hyun Jun;Cha, Eui-Young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.12
    • /
    • pp.2924-2932
    • /
    • 2015
  • Image binarization is a process to divide the image into objects and backgrounds, widely applied to the fields of image analysis and its recognition. In the existing method of binarization, there is some uncertainty when there is insufficient brightness gap between objects and backgrounds in setting threshold. The method of fuzzy binarization has improved the features of objects efficiently. However, since this method sets ${\alpha}$-cut value statically, there remain some problems that important features of objects can be lost during binarization. Therefore, in this paper, we propose a binarization method which does not set ${\alpha}$-cut value statically. The proposed method uses fuzzy membership functions calculated by thresholds of mean, iterative, and Otsu binarization. Experiment results show the proposed method binaries various images with less loss than the existing methods.

A New Design of High-Speed 1-Bit Full Adder Cell Using 0.18${\mu}m$ CMOS Process (0.18${\mu}m$ CMOS 공정을 이용한 새로운 고속 1-비트 전가산기 회로설계)

  • Kim, Young-Woon;Seo, Hea-Jun;Cho, Tae-Won
    • Journal of IKEEE
    • /
    • v.12 no.1
    • /
    • pp.1-7
    • /
    • 2008
  • With the recent development of portable system such as mobile communication and multimedia. Full adders are important components in applications such as digital signal processors and microprocessors. Thus It is important to improve the power dissipation and operating speed for designing a full adder. We propose a new adder with modified version of conventional Ratioed logic and Pass Transistor logic. The proposed adder has the advantages over the conventional CMOS, TGA, 14T logic. The delay time is improved by 13% comparing to the average value and PDP(Power Delay Product) is improved by 9% comparing to the average value. Layouts have been carried out using a 0.18um CMOS design rule for evaluation purposes. The physical design has been evaluated using HSPICE.

  • PDF

Personalized Recommendation System using Level of Cosine Similarity of Emotion Word from Social Network (소셜 네트워크에서 감정단어의 단계별 코사인 유사도 기법을 이용한 추천시스템)

  • Kwon, Eungju;Kim, Jongwoo;Heo, Nojeong;Kang, Sanggil
    • Journal of Information Technology and Architecture
    • /
    • v.9 no.3
    • /
    • pp.333-344
    • /
    • 2012
  • This paper proposes a system which recommends movies using information from social network services containing personal interest and taste. Method for establishing data is as follows. The system gathers movies' information from web sites and user's information from social network services such as Facebook and twitter. The data from social network services is categorized into six steps of emotion level for more accurate processing following users' emotional states. Gathered data will be established into vector space model which is ideal for analyzing and deducing the information with the system which is suggested in this paper. The existing similarity measurement method for movie recommendation is presentation of vector information about emotion level and similarity measuring method on the coordinates using Cosine measure. The deducing method suggested in this paper is two-phase arithmetic operation as follows. First, using general cosine measurement, the system establishes movies list. Second, using similarity measurement, system decides recommendable movie list by vector operation from the coordinates. After Comparative Experimental Study on the previous recommendation systems and new one, it turned out the new system from this study is more helpful than existing systems.

Problem Analysis and Recommendations of CPU Contents in Korean Middle School Informatics Textbooks (중학교 정보 교과서에 제시된 중앙처리장치 내용 문제점 분석 및 개선 방안)

  • Lee, Sangwook;Suh, Taeweon
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.4
    • /
    • pp.143-150
    • /
    • 2013
  • The School Curriculum amend in 2007 mandates the contents from which students can learn the principles and concepts of computer science. Computer Science is one of the most rapidly changing subjects, and the Informatics textbook should accurately explain the basic principles and concepts based on the latest technology. However, we found that the middle school textbooks in circulation lack accuracy and consistency in describing CPU. This paper attempted to discover the root-cause of the fallacy and suggest timely and appropriate explanation based on the historical and technical analysis. According to our study, it is appropriate to state that CPU is composed of datapath and control unit. The Datapath performs operations on data and holds data temporarily, and it is composed of the hardware components such as memory, register, ALU and adder. The Control unit decides the operation types of datapath elements, main memory and I/O devices. Nevertheless, considering the technological literacy of middle school students, we suggest the terms, 'arithmetic part' and 'control part' instead of datapath and control unit.

Efficient Hardware Implementation of ${\eta}_T$ Pairing Based Cryptography (${\eta}_T$ Pairing 알고리즘의 효율적인 하드웨어 구현)

  • Lee, Dong-Geoon;Lee, Chul-Hee;Choi, Doo-Ho;Kim, Chul-Su;Choi, Eun-Young;Kim, Ho-Won
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.20 no.1
    • /
    • pp.3-16
    • /
    • 2010
  • Recently in the field of the wireless sensor network, many researchers are attracted to pairing cryptography since it has ability to distribute keys without additive communication. In this paper, we propose efficient hardware implementation of ${\eta}_T$ pairing which is one of various pairing scheme. we suggest efficient hardware architecture of ${\eta}_T$ pairing based on parallel processing and register/resource optimization, and then we present the result of our FPGA implementation over GF($2^{239}$). Our implementation gives 15% better result than others in Area Time Product.

Assessment of Classification Accuracy of fNIRS-Based Brain-computer Interface Dataset Employing Elastic Net-Based Feature Selection (Elastic net 기반 특징 선택을 적용한 fNIRS 기반 뇌-컴퓨터 인터페이스 데이터셋 분류 정확도 평가)

  • Shin, Jaeyoung
    • Journal of Biomedical Engineering Research
    • /
    • v.42 no.6
    • /
    • pp.268-276
    • /
    • 2021
  • Functional near-infrared spectroscopy-based brain-computer interface (fNIRS-based BCI) has been receiving much attention. However, we are practically constrained to obtain a lot of fNIRS data by inherent hemodynamic delay. For this reason, when employing machine learning techniques, a problem due to the high-dimensional feature vector may be encountered, such as deteriorated classification accuracy. In this study, we employ an elastic net-based feature selection which is one of the embedded methods and demonstrate the utility of which by analyzing the results. Using the fNIRS dataset obtained from 18 participants for classifying brain activation induced by mental arithmetic and idle state, we calculated classification accuracies after performing feature selection while changing the parameter α (weight of lasso vs. ridge regularization). Grand averages of classification accuracy are 80.0 ± 9.4%, 79.3 ± 9.6%, 79.0 ± 9.2%, 79.7 ± 10.1%, 77.6 ± 10.3%, 79.2 ± 8.9%, and 80.0 ± 7.8% for the various values of α = 0.001, 0.005, 0.01, 0.05, 0.1, 0.2, and 0.5, respectively, and are not statistically different from the grand average of classification accuracy estimated with all features (80.1 ± 9.5%). As a result, no difference in classification accuracy is revealed for all considered parameter α values. Especially for α = 0.5, we are able to achieve the statistically same level of classification accuracy with even 16.4% features of the total features. Since elastic net-based feature selection can be easily applied to other cases without complicated initialization and parameter fine-tuning, we can be looking forward to seeing that the elastic-based feature selection can be actively applied to fNIRS data.

Efficient Semi-systolic Montgomery multiplier over GF(2m)

  • Keewon, Kim
    • Journal of the Korea Society of Computer and Information
    • /
    • v.28 no.2
    • /
    • pp.69-75
    • /
    • 2023
  • Finite field arithmetic operations play an important role in a variety of applications, including modern cryptography and error correction codes. In this paper, we propose an efficient multiplication algorithm over finite fields using the Montgomery multiplication algorithm. Existing multipliers can be implemented using AND and XOR gates, but in order to reduce time and space complexity, we propose an algorithm using NAND and NOR gates. Also, based on the proposed algorithm, an efficient semi-systolic finite field multiplier with low space and low latency is proposed. The proposed multiplier has a lower area-time complexity than the existing multipliers. Compared to existing structures, the proposed multiplier over finite fields reduces space-time complexity by about 71%, 66%, and 33% compared to the multipliers of Chiou et al., Huang et al., and Kim-Jeon. As a result, our multiplier is proper for VLSI and can be successfully implemented as an essential module for various applications.

A Constructing the Efficiency Multiple Output Switching Function of the Combinational Logic Systems (조합논리시스템의 효율적인 다중출력스위칭함수 구성)

  • Park, Chun-Myoung
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.54 no.1
    • /
    • pp.41-45
    • /
    • 2017
  • This paper presents a method of constructing the efficiency multiple output switching function of the combinational logic systems. The proposed method reduce the optimized input variable pair and output variable pair after we obtained the final multiple output switching function which was time based multiplexing and obtained the common multiple end node extension logic decision diagram. Also the proposed method have an advantage of the cost, input-output node number, circuit simplification, increment of the arithmetic speed, and more regularity and extensibility compare with previous method.

Prediction of the Onset of Significant Void in Forced-Convection Subcooled Boiling (강제대류 아냉각비등에서 급격한 기포발생점의 예측)

  • 이상천;남상철
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.18 no.3
    • /
    • pp.681-689
    • /
    • 1994
  • A model to predict the onset of significant void (OSV) in vertical flow between parallel plates has been developed. The model was compared to the experimental data of Whittle and Forgan (1967) and Dougherty et al. (1990), showing excellent agreement. The model was also compared with the Saha-Zuber(1974) correlation, which has been widely used in computer codes for nuclear safety analysis. The present theory is more conservative than this correlation, and further shows that, contrary to this correlation, the Stanton number is not solely related to the Peclet number. This may explain the large error margins required for the Saha-Zuber correlation, and also the scatter beyond the error margins specified by the authors. The steady-state OSV heat fluxes for equal and unequal heating cases between parallel plates were compared. The arithmetic mean of heat fluxes for unequal heating cases is less than the heat flux for equal heating cases. The result may imply that OSV is controlled by local thermal parameters rather than bulk parameters.

Design and Implementation of Relational Database model Using Fuzzy-rough Sets (퍼지-라프 집합을 이용한 관계 데이터베이스 구성)

  • Gang, Jeon-Geun;Jeong, Hwan-Muk
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.1
    • /
    • pp.1-10
    • /
    • 1997
  • In this paper, for useful administration of the data which have ambiguities meaningfully and hard to treat, a new relation database model using an integrated fuzzy sets and rough sets relational database one. After proposing Fuzzy-rough relational database model on the base of integrated Fuzzy and Rough sets, Application of the examples of arithmetic is analyzed through the Access DBMS and the visual basic by composing and representing database based on fuzzy and rough sets which are characterized as fuzzy sets and rough sets on Pentium computer(166Mhz). This paper was induced to reduce the data incompleteness.

  • PDF