• Title/Summary/Keyword: redundant data

Search Result 443, Processing Time 0.025 seconds

An Intelligent Framework for Feature Detection and Health Recommendation System of Diseases

  • Mavaluru, Dinesh
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.3
    • /
    • pp.177-184
    • /
    • 2021
  • All over the world, people are affected by many chronic diseases and medical practitioners are working hard to find out the symptoms and remedies for the diseases. Many researchers focus on the feature detection of the disease and trying to get a better health recommendation system. It is necessary to detect the features automatically to provide the most relevant solution for the disease. This research gives the framework of Health Recommendation System (HRS) for identification of relevant and non-redundant features in the dataset for prediction and recommendation of diseases. This system consists of three phases such as Pre-processing, Feature Selection and Performance evaluation. It supports for handling of missing and noisy data using the proposed Imputation of missing data and noise detection based Pre-processing algorithm (IMDNDP). The selection of features from the pre-processed dataset is performed by proposed ensemble-based feature selection using an expert's knowledge (EFS-EK). It is very difficult to detect and monitor the diseases manually and also needs the expertise in the field so that process becomes time consuming. Finally, the prediction and recommendation can be done using Support Vector Machine (SVM) and rule-based approaches.

Independent Firmware Design to Reduce Device Heterogeneity in LAN WAS for IoT Environment (IoT 환경을 위한 Local WAS에서 디바이스 이질성을 줄이는 독립적인 Firmware 설계)

  • Kyung-Ho Lee;Eun-Ah Moon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.18 no.5
    • /
    • pp.803-808
    • /
    • 2023
  • The IoT industry is growing at a record growth rate every year, but developers face practical problems such as security, data storage, and heterogeneity between devices before developing an IoT platform. In particular, heterogeneity between devices occurs due to network type and protocol, and device firmware must be changed or multiple IoT platforms must be used in some cases. In addition, data is wasted due to redundant sensing due to the overflow of indiscriminate IoT devices. In this paper, we propose a device-independent firmware design to solve the heterogeneity between devices in the IoT platform environment where Local WAS uses the MQTT protocol.

An Improvement of Still Image Quality Based on Error Resilient Entropy Coding for Random Error over Wireless Communications (무선 통신상 임의 에러에 대한 에러내성 엔트로피 부호화에 기반한 정지영상의 화질 개선)

  • Kim Jeong-Sig;Lee Keun-Young
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.3 s.309
    • /
    • pp.9-16
    • /
    • 2006
  • Many image and video compression algorithms work by splitting the image into blocks and producing variable-length code bits for each block data. If variable-length code data are transmitted consecutively over error-prone channel without any error protection technique, the receiving decoder cannot decode the stream properly. So the standard image and video compression algorithms insert some redundant information into the stream to provide some protection against channel errors. One of redundancies is resynchronization marker, which enables the decoder to restart the decoding process from a known state in the event of transmission errors, but its usage should be restricted not to consume bandwidth too much. The Error Resilient Entropy Code(EREC) is well blown method which can regain synchronization without any redundant information. It can work with the overall prefix codes, which many image compression methods use. This paper proposes EREREC method to improve FEREC(Fast Error-Resilient Entropy Coding). It first calculates initial searching position according to bit lengths of consecutive blocks. Second, initial offset is decided using statistical distribution of long and short blocks, and initial offset can be adjusted to insure all offset sequence values can be used. The proposed EREREC algorithm can speed up the construction of FEREC slots, and can improve the compressed image quality in the event of transmission errors. The simulation result shows that the quality of transmitted image is enhanced about $0.3{\sim}3.5dB$ compared with the existing FEREC when random channel error happens.

Mass Memory Operation for Telemetry Processing of LEO Satellite (저궤도위성 원격측정 데이터 처리를 위한 대용량 메모리 운용)

  • Chae, Dong-Seok;Yang, Seung-Eun;Cheon, Yee-Jin
    • Aerospace Engineering and Technology
    • /
    • v.11 no.2
    • /
    • pp.73-79
    • /
    • 2012
  • Because the contact time between satellite and ground station is very limited in LEO (Low Earth Orbit) satellite, all telemetry data generated on spacecraft bus are stored in a mass memory and downlinked to the ground together with real time data during the contact time. The mass memory is initialized in the first system initialization phase and the page status of each memory block is generated step by step. After the completion of the system initialization, the telemetry data are continuously stored and the stored data are played back to the ground by command. And the memory scrubbing is periodically performed for correction of single bit error which can be generated on harsh space environment. This paper introduces the mass memory operation method for telemetry processing of LEO satellite. It includes a general mass memory data structure, the methods of mass memory initialization, scrubbing, data storage and downlink, and mass memory management of primary and redundant mass memory.

Vehicle Trust Evaluation for Sharing Data among Vehicles in Social Internet of Things (소셜 사물 인터넷 환경에서 차량 간 정보 공유를 위한 신뢰도 판별)

  • Baek, Yeon-Hee;Bok, Kyoung-Soo;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.21 no.3
    • /
    • pp.68-79
    • /
    • 2021
  • On the Social Internet of Things (SIoT), social activities occur through which the vehicle generates a variety of data, shares them with other vehicles, and sends and receives feedbacks. In order to share reliable information between vehicles, it is important to determine the reliability of a vehicle. In this paper, we propose a vehicle trust evaluation scheme to share reliable information among vehicles. The proposed scheme calculates vehicle trust by considering user reputation and network trust based on inter-vehicle social behaviors. The vehicle may choose to scoring, ignoring, redistributing, etc. in the social activities inter vehicles. Thereby, calculating the user's reputation. To calculate network trust, distance from other vehicles and packet transmission rate are used. Using user reputation and network trust, local trust is calculated. It also prevents redundant distribution of data delivered during social activities. Data from the Road Side Unit (RSU) can be used to overcome local data limitations and global data can be used to calculate a vehicle trust more accurately. It is shown through various performance evaluations that the proposed scheme outperforms the existing schemes.

Research on Science DMZ scalability for the high performance research data networking (연구데이터의 고성능 네트워킹을 위한 Science DMZ 확장성 연구)

  • Lee, Chankyun;Jang, Minseok;Noh, Minki;Seok, Woojin
    • KNOM Review
    • /
    • v.22 no.2
    • /
    • pp.22-28
    • /
    • 2019
  • A Science DeMilitarized Zone (DMZ) is an optimized network technology tailored to research data nature. The Science DMZ guarantees end-to-end network performance by forming a closed research network without redundant networking and security devices for the authorized researchers. Data Transfer Node (DTN) is an essential component for the high performance and security of the Science DMZ, since only transfer functions of research data are allowed to the DTN without any security- and performance-threatening functions such as commercial internet service. Current Science DMZ requires per-user DTN server installation which turns out a scalability limitation of the networks in terms of management overhead, entry barrier of the user, and networks-wise CAPEX. In order to relax the aforementioned scalability issues, this paper suggests a centralized DTN design where end users in a group can share the centralized DTN. We evaluate the effectiveness of the suggested sharable DTN design by comparing CAPEX against to that of current design with respect to the diverse network load and the state-of-the-art computing machine.

Feature selection for text data via sparse principal component analysis (희소주성분분석을 이용한 텍스트데이터의 단어선택)

  • Won Son
    • The Korean Journal of Applied Statistics
    • /
    • v.36 no.6
    • /
    • pp.501-514
    • /
    • 2023
  • When analyzing high dimensional data such as text data, if we input all the variables as explanatory variables, statistical learning procedures may suffer from over-fitting problems. Furthermore, computational efficiency can deteriorate with a large number of variables. Dimensionality reduction techniques such as feature selection or feature extraction are useful for dealing with these problems. The sparse principal component analysis (SPCA) is one of the regularized least squares methods which employs an elastic net-type objective function. The SPCA can be used to remove insignificant principal components and identify important variables from noisy observations. In this study, we propose a dimension reduction procedure for text data based on the SPCA. Applying the proposed procedure to real data, we find that the reduced feature set maintains sufficient information in text data while the size of the feature set is reduced by removing redundant variables. As a result, the proposed procedure can improve classification accuracy and computational efficiency, especially for some classifiers such as the k-nearest neighbors algorithm.

An event-driven intelligent failure analysis for marine diesel engines (이벤트 기반 지능형 선박엔진 결함분석)

  • Lee, Yang-Ji;Kim, Duck-Young;Hwang, Min-Soon;Cheong, Young-Soo
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.17 no.4
    • /
    • pp.71-85
    • /
    • 2012
  • This paper aims to develop an event-driven failure analysis and prognosis system that is able to monitor ship status in real time, and efficiently react unforeseen system failures. In general, huge amount of recorded sensor data must be effectively interpreted for failure analysis, but unfortunately noise and redundant information in the gathered sensor data are obstacles to a successful analysis. This paper therefore applies 'Equal-frequency binning' and 'Entropy' techniques to extract only important information from the raw sensor data while minimizing information loss. The efficiency of the developed failure analysis system is demonstrated with the collected sensor data from a marine diesel engine.

Data Reusable Search Scan Methods for Low Power motion Estimation (저전력 움직임 추정을 위한 데이터 재사용 스캔 방법)

  • Kim, Tae Sun;SunWoo, Myung Hoon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.9
    • /
    • pp.85-91
    • /
    • 2013
  • This paper proposes the data reusable search scan methods for full search and fast search to implement low power Motion Estimation (ME). The proposed Optimized Sub-region Partitioning (OSP) method which divide search region into several sub-region can reduce the number of the required Reconfigurable Register Array (RRA) by half compared to the existing smart snake scan method for the same data reusability. In addition, the proposed Center Biased Search Scan method (CBSS) for various fast search algorithms can improve the data reusability. The performance comparisons show that the proposed search scan methods can reduce the average redundant data loading about 26.9% and 16.1% compared with the existing rater scan and snake scan methods, respectively. Due to the reduction of memory accesses, the proposed search scan methods are quite suitable for low power and high performance ME implementation.

Cluster-based Energy-aware Data Sharing Scheme to Support a Mobile Sink in Solar-Powered Wireless Sensor Networks (태양 에너지 수집형 센서 네트워크에서 모바일 싱크를 지원하기 위한 클러스터 기반 에너지 인지 데이터 공유 기법)

  • Lee, Hong Seob;Yi, Jun Min;Kim, Jaeung;Noh, Dong Kun
    • Journal of KIISE
    • /
    • v.42 no.11
    • /
    • pp.1430-1440
    • /
    • 2015
  • In contrast with battery-based wireless sensor networks (WSNs), solar-powered WSNs can operate for a longtime assuming that there is no hardware fault. Meanwhile, a mobile sink can save the energy consumption of WSN, but its ineffective movement may incur so much energy waste of not only itself but also an entire network. To solve this problem, many approaches, in which a mobile sink visits only on clustering-head nodes, have been proposed. But, the clustering scheme also has its own problems such as energy imbalance and data instability. In this study, therefore, a cluster-based energy-aware data-sharing scheme (CE-DSS) is proposed to effectively support a mobile sink in a solar-powered WSN. By utilizing the redundant energy efficiently, CE-DSS shares the gathered data among cluster-heads, while minimizing the unexpected black-out time. The simulation results show that CE-DSS increases the data reliability as well as conserves the energy of the mobile sink.