• Nuclear Engineering and Technology
• /
• v.28 no.3
• /
• pp.339-348
• /
• 1996

Plant monitoring algorithm developments seem to be saturated which means that display system to show the results from the algorithm should be the well-defined and interactive tools for operator's diagnosing, controlling, restoring the abnormal plant situations. On the other hand, very little generalized display design concepts and evaluations are available. Events that are unfamiliar to operators and that has not been anticipated by designers may cause great threats to the nuclear power plant system safety operation. The abstraction hierarchy, considered most popular display design methodology but not generalized for nuclear power plant design space, has ken proposed as a representation frame work that can be adopted to design interfaces and supports operators in diagnosing overlooked events that should have been considered to operate plant safely. However most practical plant display systems do not fully stick to this design concept but partially rely on their philosophy from design experiences. Abstraction hierarchy display design concept will be do scribed and the trend of Advanced Control Room(ACR) CRT design will also be presented with the conventional display for the several type of plants. Consequently this complementary material should be of interest to designer and regulators concerned with nuclear power plant.

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.5
• /
• pp.995-1009
• /
• 2021

Many iterative algorithms like that Picard, Mann, Ishikawa and S-iteration are very useful to elucidate the fixed point problems of a nonlinear operators in various topological spaces. The recent trend for elucidate the fixed point via inertial iterative algorithm, in which next iterative depends on more than one previous terms. The purpose of the paper is to establish convergence theorems of new inertial Picard normal S-iteration algorithm for nonexpansive mapping in Hilbert spaces. The comparison of convergence of InerNSP and InerPNSP is done with InerSP (introduced by Phon-on et al. [25]) and MSP (introduced by Suparatulatorn et al. [27]) via numerical example.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.573-576
• /
• 2011

Research on 4A(Any-time, Any-where, Any-device, Any-contents) services for the next-generation multimedia services is developed with the trend of the integration of wire and wireless networks and the convergence of telecommunications and broadcasting. In this paper we proposed a design of SVC(Scalable Video Coding) overlay multicast mechanism which can provide typical next-generation multimedia services such as SVC streaming. A novel overlay multicast algorithm called ACK-Flow tree optimization algorithm is proposed to guarantee SVC streaming with high efficiency.

• International Journal of Computer Science & Network Security
• /
• v.23 no.7
• /
• pp.49-60
• /
• 2023

The amount of data generated by electronic systems through e-commerce, social networks, and data computation has risen. However, the security of data has always been a challenge. The problem is not with the quantity of data but how to secure the data by ensuring its confidentiality and privacy. Though there are several research on cloud data security, this study proposes a security scheme with the lowest execution time. The approach employs a non-linear time complexity to achieve data confidentiality and privacy. A symmetric algorithm dubbed the Non-Deterministic Cryptographic Scheme (NCS) is proposed to address the increased execution time of existing cryptographic schemes. NCS has linear time complexity with a low and unpredicted trend of execution times. It achieves confidentiality and privacy of data on the cloud by converting the plaintext into Ciphertext with a small number of iterations thereby decreasing the execution time but with high security. The algorithm is based on Good Prime Numbers, Linear Congruential Generator (LGC), Sliding Window Algorithm (SWA), and XOR gate. For the implementation in C, thirty different execution times were performed and their average was taken. A comparative analysis of the NCS was performed against AES, DES, and RSA algorithms based on key sizes of 128kb, 256kb, and 512kb using the dataset from Kaggle. The results showed the proposed NCS execution times were lower in comparison to AES, which had better execution time than DES with RSA having the longest. Contrary, to existing knowledge that execution time is relative to data size, the results obtained from the experiment indicated otherwise for the proposed NCS algorithm. With data sizes of 128kb, 256kb, and 512kb, the execution times in milliseconds were 38, 711, and 378 respectively. This validates the NCS as a Non-Deterministic Cryptographic Algorithm. The study findings hence are in support of the argument that data size does not determine the execution.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.10
• /
• pp.2473-2492
• /
• 2012

Energy conservation is a vital issue in wireless sensor networks. Recently, employing mobile sinks for data gathering become a pervasive trend to deal with this problem. The sink can follow stochastic or pre-defined paths; however the controlled mobility pattern nowadays is taken more into consideration. In this method, the sink moves across the network autonomously and changes its position based on the energy factors. Although the sink mobility would reduce nodes' energy consumption and enhance the network lifetime, the overhead caused by topological changes could waste unnecessary power through the sensor field. In this paper, we proposed EEDARS, an energy-efficient dual-sink algorithm with role switching mechanism which utilizes both static and mobile sinks. The static sink is engaged to avoid any periodic flooding for sink localization, while the mobile sink adaptively moves towards the event region for data collection. Furthermore, a role switching mechanism is applied to the protocol in order to send the nearest sink to the recent event area, hence shorten the path. This algorithm could be employed in event-driven and multi-hop scenarios. Analytical model and extensive simulation results for EEDARS demonstrate a significant improvement on the network metrics especially the lifetime, the load and the end-to-end delay.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.5023-5038
• /
• 2017

Big data is an emerging technology which deals with wide range of data sets with sizes beyond the ability to work with software tools which is commonly used for processing of data. When we consider a huge network, we have to process a large amount of network information generated, which consists of both normal and abnormal activity logs in large volume of multi-dimensional data. Intrusion Detection System (IDS) is required to monitor the network and to detect the malicious nodes and activities in the network. Massive amount of data makes it difficult to detect threats and attacks. Sequential Pattern mining may be used to identify the patterns of malicious activities which have been an emerging popular trend due to the consideration of quantities, profits and time orders of item. Here we propose a sequential pattern mining algorithm with fuzzy logic feature selection and fuzzy weighted support for huge volumes of network logs to be implemented in Apache Hadoop YARN, which solves the problem of speed and time constraints. Fuzzy logic feature selection selects important features from the feature set. Fuzzy weighted supports provide weights to the inputs and avoid multiple scans. In our simulation we use the attack log from NS-2 MANET environment and compare the proposed algorithm with the state-of-the-art sequential Pattern Mining algorithm, SPADE and Support Vector Machine with Hadoop environment.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.319-322
• /
• 1995

As a trend toward multi-product batch processes is increasing in Chemical Process Industry (CPI), multi-product batch scheduling has been actively studied. But the optimal production scheduling problems for multi-product batch processes are known as NP-complete. Recently Ku and Karimi [5] have studied Simulated Annealing(SA) and Jung et al.[6] have developed Modified Simulated Annealing (MSA) method which was composed of two stage search algorithms for scheduling of batch processes with UIS and NIS. Jung et al.[9] also have studied the Common Intermediate Storage(CIS) policy which have accepted as a high efficient intermediate storage policy. It can be also applied to pipeless mobile intermediate storage pacilities. In spite of these above researches, there have been no contribution of scheduling of CIS policy for chemical batch processes. In this paper, we have developed another MSA for scheduling chemical batch processes with searching the suitable control parameters for CIS policy and have tested the this algorithm with randomly generated various scheduling problems. From these tests, MSA is outperformed to general SA for CIS batch process system.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.13 no.1
• /
• pp.1-8
• /
• 1989

A general and efficient algorithm is proposed for the analyses of multibody elastic contact problems. It is presumed that there exists negligible friction between the bodies. It utilizes a simplex type algorithm with a modified entry rule and incoporates finite element method to obtain flexibility matrices for arbitrarily shaped bodies. The multibody contact problem of a vehicle support on an elastic foundation is considered first to show the effictiveness of the suggested algorithm. Its solution is compared favorably with the existing solution. A contact problem among inner race, rollers and outer race is analyzed and the distribution of load, rigid body movements and contact pressure distributions are obtained. The trend of contact characteristics is compared with that of the idealized Hertzian solutions for two separate two-body contact problems. The numerical results obtained by directly treating a multibody contact are believed to be more exact than the Hertzian solution for the idealized two separate two-body contact problems.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.121-129
• /
• 2014

The trend of an increasing demand for a high-quality user experience, coupled with a shortage of radio resources, has necessitated more advanced wireless techniques to cooperatively achieve the required quality-of-experience enhancement. In this study, we investigate the critical problem of rate splitting in heterogeneous cellular networks, where concurrent transmission, for instance, the coordinated multipoint transmission and reception of LTE-A systems, shows promise for improvement of network-wide capacity and the user experience. Unlike most current studies, which only deal with spectral efficiency enhancement, we implement an optimal rate splitting strategy to improve both spectral efficiency and energy efficiency by exploring and exploiting cooperation diversity. First, we introduce the motivation for our proposed algorithm, and then employ the typical cooperative bargaining game to formulate the problem. Next, we derive the best response function by analyzing the dual problem of the defined primal problem. The existence and uniqueness of the proposed cooperative bargaining equilibrium are proved, and more importantly, a distributed algorithm is designed to approach the optimal unique solution under mild conditions. Finally, numerical results show a performance improvement for our proposed distributed cooperative rate splitting algorithm.

• Journal of Information Technology Services
• /
• v.21 no.5
• /
• pp.81-94
• /
• 2022

This study sets the research goal of reducing energy consumption which 'H' University Industry-University Cooperation Foundation and resident companies are concerned with, as well as conducting policy research and data analysis. We tried to present a solution to the problem using the technique. The algorithm showing the greatest reliability in the power of the model for the analysis algorithm of this paper was selected, and the power consumption trend curves per minute and hour were confirmed through predictive analysis while applying the algorithm, as well as confirming the singularity of excessive energy consumption. Through an additional sub-sensor analysis, the singularity of energy consumption of the unit was identified more precisely in the facility rather than in the building unit. Through this, this paper presents a system building model for real-time monitoring of campus power usage, and expands the data center and model for implementation. Furthermore, by presenting the possibility of expanding the field through research on the integration of mobile applications and IoT hardware, this study will provide school authorities and resident companies with specific solutions necessary to continuously solve data-based field problems.