• Title/Summary/Keyword: software algorithms

Search Result 1,093, Processing Time 0.024 seconds

An Efficient FTL Algorithm for Flash Memory (플래시 메모리를 위한 효율적인 사상 알고리즘)

  • Chung Tae-Sun;Park Hyung-Seok
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.9
    • /
    • pp.483-490
    • /
    • 2005
  • Recently, flash memory is widely used in embedded applications since it has strong points: non-volatility, fast access speed, shock resistance, and low power consumption. However, due to its hardware characteristics, it requires a software layer called FTL(flash translation layer). The main functionality of FTL is to convert logical addresses from the host to physical addresses of flash memory We present a new FTL algorithm called STAFF(State Transition Applied Fast Flash Translation Layer). Compared to the previous FTL algorithms, STAFF shows five times higher performance than basic block mapping scheme and requires less memory. We provide performance results based on our implementation of STAFF and previous FTL algorithms.

A Technique for Generating Semantic Trajectories by Using GPS Positions and POI Information (GPS 이동 궤적과 관심지점 정보를 이용한 시맨틱 궤적 생성 기법)

  • Jang, Yuhee;Lee, Juwon;Lim, Hyo-Sang
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.4 no.10
    • /
    • pp.439-446
    • /
    • 2015
  • Recently, semantic trajectories which combine GPS positions and POIs(Point of Interests) become more popular in order to expand location based services. To construct semantic trajectories, the existing algorithms exploit the extent information of POIs described as polygons and find overlapping regions between GPS positions and the extents. However, the algorithms are not applicable in the condition where the extent information is not provided such as in Google Map, Naver Map, OpenStreetMap and most of the open geographic information systems. In this paper, we provide a novel algorithm to construct semantic trajectories only with GPS positions and POI points but without POI extents.

NIST Lightweight Cryptography Standardization Process: Classification of Second Round Candidates, Open Challenges, and Recommendations

  • Gookyi, Dennis Agyemanh Nana;Kanda, Guard;Ryoo, Kwangki
    • Journal of Information Processing Systems
    • /
    • v.17 no.2
    • /
    • pp.253-270
    • /
    • 2021
  • In January 2013, the National Institute of Standards and Technology (NIST) announced the CAESAR (Competition for Authenticated Encryption: Security, Applicability, and Robustness) contest to identify authenticated ciphers that are suitable for a wide range of applications. A total of 57 submissions made it into the first round of the competition out of which 6 were announced as winners in March 2019. In the process of the competition, NIST realized that most of the authenticated ciphers submitted were not suitable for resource-constrained devices used as end nodes in the Internet-of-Things (IoT) platform. For that matter, the NIST Lightweight Cryptography Standardization Process was set up to identify authenticated encryption and hashing algorithms for IoT devices. The call for submissions was initiated in 2018 and in April 2019, 56 submissions made it into the first round of the competition. In August 2019, 32 out of the 56 submissions were selected for the second round which is due to end in the year 2021. This work surveys the 32 authenticated encryption schemes that made it into the second round of the NIST lightweight cryptography standardization process. The paper presents an easy-to-understand comparative overview of the recommended parameters, primitives, mode of operation, features, security parameter, and hardware/software performance of the 32 candidate algorithms. The paper goes further by discussing the challenges of the Lightweight Cryptography Standardization Process and provides some suitable recommendations.

The Effect of Bias in Data Set for Conceptual Clustering Algorithms

  • Lee, Gye Sung
    • International journal of advanced smart convergence
    • /
    • v.8 no.3
    • /
    • pp.46-53
    • /
    • 2019
  • When a partitioned structure is derived from a data set using a clustering algorithm, it is not unusual to have a different set of outcomes when it runs with a different order of data. This problem is known as the order bias problem. Many algorithms in machine learning fields try to achieve optimized result from available training and test data. Optimization is determined by an evaluation function which has also a tendency toward a certain goal. It is inevitable to have a tendency in the evaluation function both for efficiency and for consistency in the result. But its preference for a specific goal in the evaluation function may sometimes lead to unfavorable consequences in the final result of the clustering. To overcome this bias problems, the first clustering process proceeds to construct an initial partition. The initial partition is expected to imply the possible range in the number of final clusters. We apply the data centric sorting to the data objects in the clusters of the partition to rearrange them in a new order. The same clustering procedure is reapplied to the newly arranged data set to build a new partition. We have developed an algorithm that reduces bias effect resulting from how data is fed into the algorithm. Experiment results have been presented to show that the algorithm helps minimize the order bias effects. We have also shown that the current evaluation measure used for the clustering algorithm is biased toward favoring a smaller number of clusters and a larger size of clusters as a result.

Comparing fuzzy type-1 and -2 in semi-active control with TMD considering uncertainties

  • Ramezani, Meysam;Bathaei, Akbar;Zahrai, Seyed Mehdi
    • Smart Structures and Systems
    • /
    • v.23 no.2
    • /
    • pp.155-171
    • /
    • 2019
  • In this study, Semi-active Tuned Mass Dampers (STMDs) are employed in order to cover the prevailing uncertainties and promote the efficiency of the Tuned Mass Dampers (TMDs) to mitigate undesirable structural vibrations. The damping ratio is determined using type-1 and type-2 Fuzzy Logic Controllers (T1 and T2 FLC) based on the response of the structure. In order to increase the efficiency of the FLC, the output membership functions are optimized using genetic algorithm. The results show that the proposed FLC can reduce the sensitivity of STMD to excitation records. The obtained results indicate the best operation for T1 FLC among the other control systems when the uncertainties are neglected. According to the irrefutable uncertainties, three supplies for these uncertainties such as time delay, sensors measurement noises and the differences between real and software model, are investigated. Considering these uncertainties, the efficiencies of T1 FLC, ground-hook velocity-based, displacement-based and TMD reduce significantly. The reduction rates for these algorithms are 12.66%, 26.43%, 20.98% and 21.77%, respectively. However, due to nonlinear behavior and considering a range of uncertainties in membership functions, T2 FLC with 7.2% reduction has robust performance against uncertainties compared to other controlling systems. Therefore, it can be used in actual applications more confidently.

Adaptive Success Rate-based Sensor Relocation for IoT Applications

  • Kim, Moonseong;Lee, Woochan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.9
    • /
    • pp.3120-3137
    • /
    • 2021
  • Small-sized IoT wireless sensing devices can be deployed with small aircraft such as drones, and the deployment of mobile IoT devices can be relocated to suit data collection with efficient relocation algorithms. However, the terrain may not be able to predict its shape. Mobile IoT devices suitable for these terrains are hopping devices that can move with jumps. So far, most hopping sensor relocation studies have made the unrealistic assumption that all hopping devices know the overall state of the entire network and each device's current state. Recent work has proposed the most realistic distributed network environment-based relocation algorithms that do not require sharing all information simultaneously. However, since the shortest path-based algorithm performs communication and movement requests with terminals, it is not suitable for an area where the distribution of obstacles is uneven. The proposed scheme applies a simple Monte Carlo method based on relay nodes selection random variables that reflect the obstacle distribution's characteristics to choose the best relay node as reinforcement learning, not specific relay nodes. Using the relay node selection random variable could significantly reduce the generation of additional messages that occur to select the shortest path. This paper's additional contribution is that the world's first distributed environment-based relocation protocol is proposed reflecting real-world physical devices' characteristics through the OMNeT++ simulator. We also reconstruct the three days-long disaster environment, and performance evaluation has been performed by applying the proposed protocol to the simulated real-world environment.

Low-area DNN Core using data reuse technique (데이터 재사용 기법을 이용한 저 면적 DNN Core)

  • Jo, Cheol-Won;Lee, Kwang-Yeob;Kim, Chi-Yong
    • Journal of IKEEE
    • /
    • v.25 no.1
    • /
    • pp.229-233
    • /
    • 2021
  • NPU in an embedded environment performs deep learning algorithms with few hardware resources. By using a technique that reuses data, deep learning algorithms can be efficiently computed with fewer resources. In previous studies, data is reused using a shifter in ScratchPad for data reuse. However, as the ScratchPad's bandwidth increases, the shifter also consumes a lot of resources. Therefore, we present a data reuse technique using the Buffer Round Robin method. By using the Buffer Round Robin method presented in this paper, the chip area could be reduced by about 4.7% compared to the conventional method.

Design and Implementation of Intelligent Medical Service System Based on Classification Algorithm

  • Yu, Linjun;Kang, Yun-Jeong;Choi, Dong-Oun
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.13 no.3
    • /
    • pp.92-103
    • /
    • 2021
  • With the continuous acceleration of economic and social development, people gradually pay attention to their health, improve their living environment, diet, strengthen exercise, and even conduct regular health examination, to ensure that they always understand the health status. Even so, people still face many health problems, and the number of chronic diseases is increasing. Recently, COVID-19 has also reminded people that public health problems are also facing severe challenges. With the development of artificial intelligence equipment and technology, medical diagnosis expert systems based on big data have become a topic of concern to many researchers. At present, there are many algorithms that can help computers initially diagnose diseases for patients, but they want to improve the accuracy of diagnosis. And taking into account the pathology that varies from person to person, the health diagnosis expert system urgently needs a new algorithm to improve accuracy. Through the understanding of classic algorithms, this paper has optimized it, and finally proved through experiments that the combined classification algorithm improved by latent factors can meet the needs of medical intelligent diagnosis.

A Binary Classifier Using Fully Connected Neural Network for Alzheimer's Disease Classification

  • Prajapati, Rukesh;Kwon, Goo-Rak
    • Journal of Multimedia Information System
    • /
    • v.9 no.1
    • /
    • pp.21-32
    • /
    • 2022
  • Early-stage diagnosis of Alzheimer's Disease (AD) from Cognitively Normal (CN) patients is crucial because treatment at an early stage of AD can prevent further progress in the AD's severity in the future. Recently, computer-aided diagnosis using magnetic resonance image (MRI) has shown better performance in the classification of AD. However, these methods use a traditional machine learning algorithm that requires supervision and uses a combination of many complicated processes. In recent research, the performance of deep neural networks has outperformed the traditional machine learning algorithms. The ability to learn from the data and extract features on its own makes the neural networks less prone to errors. In this paper, a dense neural network is designed for binary classification of Alzheimer's disease. To create a classifier with better results, we studied result of different activation functions in the prediction. We obtained results from 5-folds validations with combinations of different activation functions and compared with each other, and the one with the best validation score is used to classify the test data. In this experiment, features used to train the model are obtained from the ADNI database after processing them using FreeSurfer software. For 5-folds validation, two groups: AD and CN are classified. The proposed DNN obtained better accuracy than the traditional machine learning algorithms and the compared previous studies for AD vs. CN, AD vs. Mild Cognitive Impairment (MCI), and MCI vs. CN classifications, respectively. This neural network is robust and better.

Development of Multiple RLS and Actuator Performance Index-based Adaptive Actuator Fault-Tolerant Control and Detection Algorithms for Longitudinal Autonomous Driving (다중 순환 최소 자승 및 성능 지수 기반 종방향 자율주행을 위한 적응형 구동기 고장 허용 제어 및 탐지 알고리즘 개발)

  • Oh, Sechan;Lee, Jongmin;Oh, Kwangseok;Yi, Kyongsu
    • Journal of Auto-vehicle Safety Association
    • /
    • v.14 no.2
    • /
    • pp.26-38
    • /
    • 2022
  • This paper proposes multiple RLS and actuator performance index-based adaptive actuator fault-tolerant control and detection algorithms for longitudinal autonomous driving. The proposed algorithm computes the desired acceleration using feedback law for longitudinal autonomous driving. When actuator fault or performance degradation exists, it is designed that the desired acceleration is adjusted with the calculated feedback gains based on multiple RLS and gradient descent method for fault-tolerant control. In order to define the performance index, the error between the desired and actual accelerations is used. The window-based weighted error standard deviation is computed with the design parameters. Fault level decision algorithm that can represent three fault levels such as normal, warning, emergency levels is proposed in this study. Performance evaluation under various driving scenarios with actuator fault was conducted based on co-simulation of Matlab/Simulink and commercial software (CarMaker).