• Title/Summary/Keyword: network optimization

Search Result 2,239, Processing Time 0.033 seconds

Multiplication optimization technique for Elliptic Curve based sensor network security (Elliptic curve기반 센서네트워크 보안을 위한 곱셈 최적화 기법)

  • Seo, Hwa-Jeong;Kim, Ho-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.8
    • /
    • pp.1836-1842
    • /
    • 2010
  • Sensor network, which is technology to realize the ubiquitous environment, recently, could apply to the field of Mechanic & electronic Security System, Energy management system, Environment monitoring system, Home automation and health care application. However, feature of wireless networking of sensor network is vulnerable to eavesdropping and falsification about message. Presently, PKC(public key cryptography) technique using ECC(elliptic curve cryptography) is used to build up the secure networking over sensor network. ECC is more suitable to sensor having restricted performance than RSA, because it offers equal strength using small size of key. But, for high computation cost, ECC needs to enhance the performance to implement over sensor. In this paper, we propose the optimizing technique for multiplication, core operation in ECC, to accelerate the speed of ECC.

Design and Parameter Optimization of Virtual Storage Protocol (iATA) for Mobile Devices (모바일 기기를 위한 가상 스토리지 프로토콜(iATA)의 설계 및 파라메터 최적화)

  • Yeoh, Chee-Min;Lim, Hyo-Taek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.2
    • /
    • pp.267-276
    • /
    • 2009
  • Nowadays, numerous of valuable internet services are available not only for personal computer but also for mobile appliances in wireless network environment. Therefore, as the amount of contents is increased for those services, the storage limitation on mobile devices has became a significant issue. In this paper, we present a new block-level storage network protocol, iATA (Internet Advanced Technology Attachment) as a solution to the above problem. iATA is designed to transport ATA block-level data and command over the ubiquitous TCP/IP network. With iATA, a mobile appliance is able to access and control the ATA storage devices natively through network from anywhere and at anytime as if the storage devices is attached locally. We describe the concepts, design and diverse consideration of iATA protocol. Based on the benchmark experiments and application exploitation, we strongly believe that iATA as a light-weight protocol is efficient and cost-effective to be used as a storage network protocol on a resource limited device that utilizes common-off-the-shelf storage hardware and existing IP infrastructure.

Match Field based Algorithm Selection Approach in Hybrid SDN and PCE Based Optical Networks

  • Selvaraj, P.;Nagarajan, V.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.12
    • /
    • pp.5723-5743
    • /
    • 2018
  • The evolving internet-based services demand high-speed data transmission in conjunction with scalability. The next generation optical network has to exploit artificial intelligence and cognitive techniques to cope with the emerging requirements. This work proposes a novel way to solve the dynamic provisioning problem in optical network. The provisioning in optical network involves the computation of routes and the reservation of wavelenghs (Routing and Wavelength assignment-RWA). This is an extensively studied multi-objective optimization problem and its complexity is known to be NP-Complete. As the exact algorithms incurs more running time, the heuristic based approaches have been widely preferred to solve this problem. Recently the software-defined networking has impacted the way the optical pipes are configured and monitored. This work proposes the dynamic selection of path computation algorithms in response to the changing service requirements and network scenarios. A software-defined controller mechanism with a novel packet matching feature was proposed to dynamically match the traffic demands with the appropriate algorithm. A software-defined controller with Path Computation Element-PCE was created in the ONOS tool. A simulation study was performed with the case study of dynamic path establishment in ONOS-Open Network Operating System based software defined controller environment. A java based NOX controller was configured with a parent path computation element. The child path computation elements were configured with different path computation algorithms under the control of the parent path computation element. The use case of dynamic bulk path creation was considered. The algorithm selection method is compared with the existing single algorithm based method and the results are analyzed.

Estimation of bubble size distribution using deep ensemble physics-informed neural network (딥앙상블 물리 정보 신경망을 이용한 기포 크기 분포 추정)

  • Sunyoung Ko;Geunhwan Kim;Jaehyuk Lee;Hongju Gu;Kwangho Moon;Youngmin Choo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.42 no.4
    • /
    • pp.305-312
    • /
    • 2023
  • Physics-Informed Neural Network (PINN) is used to invert bubble size distributions from attenuation losses. By considering a linear system for the bubble population inversion, Adaptive Learned Iterative Shrinkage Thresholding Algorithm (Ada-LISTA), which has been solved linear systems in image processing, is used as a neural network architecture in PINN. Furthermore, a regularization based on the linear system is added to a loss function of PINN and it makes a PINN have better generalization by a solution satisfying the bubble physics. To evaluate an uncertainty of bubble estimation, deep ensemble is adopted. 20 Ada-LISTAs with different initial values are trained using the same training dataset. During test with attenuation losses different from those in the training dataset, the bubble size distribution and corresponding uncertainty are indicated by average and variance of 20 estimations, respectively. Deep ensemble Ada-LISTA demonstrate superior performance in inverting bubble size distributions than the conventional convex optimization solver of CVX.

A study on the performance improvement of the quality prediction neural network of injection molded products reflecting the process conditions and quality characteristics of molded products by process step based on multi-tasking learning structure (다중 작업 학습 구조 기반 공정단계별 공정조건 및 성형품의 품질 특성을 반영한 사출성형품 품질 예측 신경망의 성능 개선에 대한 연구)

  • Hyo-Eun Lee;Jun-Han Lee;Jong-Sun Kim;Gu-Young Cho
    • Design & Manufacturing
    • /
    • v.17 no.4
    • /
    • pp.72-78
    • /
    • 2023
  • Injection molding is a process widely used in various industries because of its high production speed and ease of mass production during the plastic manufacturing process, and the product is molded by injecting molten plastic into the mold at high speed and pressure. Since process conditions such as resin and mold temperature mutually affect the process and the quality of the molded product, it is difficult to accurately predict quality through mathematical or statistical methods. Recently, studies to predict the quality of injection molded products by applying artificial neural networks, which are known to be very useful for analyzing nonlinear types of problems, are actively underway. In this study, structural optimization of neural networks was conducted by applying multi-task learning techniques according to the characteristics of the input and output parameters of the artificial neural network. A structure reflecting the characteristics of each process step was applied to the input parameters, and a structure reflecting the quality characteristics of the injection molded part was applied to the output parameters using multi-tasking learning. Building an artificial neural network to predict the three qualities (mass, diameter, height) of injection-molded product under six process conditions (melt temperature, mold temperature, injection speed, packing pressure, pacing time, cooling time) and comparing its performance with the existing neural network, we observed enhancements in prediction accuracy for mass, diameter, and height by approximately 69.38%, 24.87%, and 39.87%, respectively.

Deep Learning Architectures and Applications (딥러닝의 모형과 응용사례)

  • Ahn, SungMahn
    • Journal of Intelligence and Information Systems
    • /
    • v.22 no.2
    • /
    • pp.127-142
    • /
    • 2016
  • Deep learning model is a kind of neural networks that allows multiple hidden layers. There are various deep learning architectures such as convolutional neural networks, deep belief networks and recurrent neural networks. Those have been applied to fields like computer vision, automatic speech recognition, natural language processing, audio recognition and bioinformatics where they have been shown to produce state-of-the-art results on various tasks. Among those architectures, convolutional neural networks and recurrent neural networks are classified as the supervised learning model. And in recent years, those supervised learning models have gained more popularity than unsupervised learning models such as deep belief networks, because supervised learning models have shown fashionable applications in such fields mentioned above. Deep learning models can be trained with backpropagation algorithm. Backpropagation is an abbreviation for "backward propagation of errors" and a common method of training artificial neural networks used in conjunction with an optimization method such as gradient descent. The method calculates the gradient of an error function with respect to all the weights in the network. The gradient is fed to the optimization method which in turn uses it to update the weights, in an attempt to minimize the error function. Convolutional neural networks use a special architecture which is particularly well-adapted to classify images. Using this architecture makes convolutional networks fast to train. This, in turn, helps us train deep, muti-layer networks, which are very good at classifying images. These days, deep convolutional networks are used in most neural networks for image recognition. Convolutional neural networks use three basic ideas: local receptive fields, shared weights, and pooling. By local receptive fields, we mean that each neuron in the first(or any) hidden layer will be connected to a small region of the input(or previous layer's) neurons. Shared weights mean that we're going to use the same weights and bias for each of the local receptive field. This means that all the neurons in the hidden layer detect exactly the same feature, just at different locations in the input image. In addition to the convolutional layers just described, convolutional neural networks also contain pooling layers. Pooling layers are usually used immediately after convolutional layers. What the pooling layers do is to simplify the information in the output from the convolutional layer. Recent convolutional network architectures have 10 to 20 hidden layers and billions of connections between units. Training deep learning networks has taken weeks several years ago, but thanks to progress in GPU and algorithm enhancement, training time has reduced to several hours. Neural networks with time-varying behavior are known as recurrent neural networks or RNNs. A recurrent neural network is a class of artificial neural network where connections between units form a directed cycle. This creates an internal state of the network which allows it to exhibit dynamic temporal behavior. Unlike feedforward neural networks, RNNs can use their internal memory to process arbitrary sequences of inputs. Early RNN models turned out to be very difficult to train, harder even than deep feedforward networks. The reason is the unstable gradient problem such as vanishing gradient and exploding gradient. The gradient can get smaller and smaller as it is propagated back through layers. This makes learning in early layers extremely slow. The problem actually gets worse in RNNs, since gradients aren't just propagated backward through layers, they're propagated backward through time. If the network runs for a long time, that can make the gradient extremely unstable and hard to learn from. It has been possible to incorporate an idea known as long short-term memory units (LSTMs) into RNNs. LSTMs make it much easier to get good results when training RNNs, and many recent papers make use of LSTMs or related ideas.

Potential Anomaly Separation and Archeological Site Localization Using Genetically Trained Multi-level Cellular Neural Networks

  • Bilgili, Erdem;Goknar, I. Cem;Albora, Ali Muhittin;Ucan, Osman Nuri
    • ETRI Journal
    • /
    • v.27 no.3
    • /
    • pp.294-303
    • /
    • 2005
  • In this paper, a supervised algorithm for the evaluation of geophysical sites using a multi-level cellular neural network (ML-CNN) is introduced, developed, and applied to real data. ML-CNN is a stochastic image processing technique based on template optimization using neighborhood relationships of the pixels. The separation/enhancement and border detection performance of the proposed method is evaluated by various interesting real applications. A genetic algorithm is used in the optimization of CNN templates. The first application is concerned with the separation of potential field data of the Dumluca chromite region, which is one of the rich reserves of Turkey; in this context, the classical approach to the gravity anomaly separation method is one of the main problems in geophysics. The other application is the border detection of archeological ruins of the Hittite Empire in Turkey. The Hittite civilization sites located at the Sivas-Altinyayla region of Turkey are among the most important archeological sites in history, one reason among others being that written documentation was first produced by this civilization.

  • PDF

A new meta-heuristic optimization algorithm using star graph

  • Gharebaghi, Saeed Asil;Kaveh, Ali;Ardalan Asl, Mohammad
    • Smart Structures and Systems
    • /
    • v.20 no.1
    • /
    • pp.99-114
    • /
    • 2017
  • In cognitive science, it is illustrated how the collective opinions of a group of individuals answers to questions involving quantity estimation. One example of this approach is introduced in this article as Star Graph (SG) algorithm. This graph describes the details of communication among individuals to share their information and make a new decision. A new labyrinthine network of neighbors is defined in the decision-making process of the algorithm. In order to prevent getting trapped in local optima, the neighboring networks are regenerated in each iteration of the algorithm. In this algorithm, the normal distribution is utilized for a group of agents with the best results (guidance group) to replace the existing infeasible solutions. Here, some new functions are introduced to provide a high convergence for the method. These functions not only increase the local and global search capabilities but also require less computational effort. Various benchmark functions and engineering problems are examined and the results are compared with those of some other algorithms to show the capability and performance of the presented method.

QoE-aware Energy Efficiency Maximization Based Joint User Access Selection and Power Allocation for Heterogeneous Network

  • Ji, Shiyu;Tang, Liangrui;Xu, Chen;Du, Shimo;Zhu, Jiajia;Hu, Hailin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.10
    • /
    • pp.4680-4697
    • /
    • 2017
  • In future, since the user experience plays a more and more important role in the development of today's communication systems, quality of experience (QoE) becomes a widely used metric, which reflects the subjective experience of end users for wireless service. In addition, the energy efficiency is an increasingly important problem with the explosive growth in the amount of wireless terminals and nodes. Hence, a QoE-aware energy efficiency maximization based joint user access selection and power allocation approach is proposed to solve the problem. We transform the joint allocation process to an optimization of energy efficiency by establishing an energy efficiency model, and then the optimization problem is solved by chaotic clone immune algorithm (CCIA). Numerical simulation results indicate that the proposed algorithm can efficiently and reliably improve the QoE and ensure high energy efficiency of networks.

AFSO: An Adaptative Frame Size Optimization Mechanism for 802.11 Networks

  • Ge, Xiaohu;Wang, Cheng-Xiang;Yang, Yang;Shu, Lei;Liu, Chuang;Xiang, Lin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.3
    • /
    • pp.205-223
    • /
    • 2010
  • In this paper, we analyze the impact of different frame types on self-similarity and burstiness characteristics of the aggregated frame traffic from a real 802.11 wireless local area network. We find that characteristics of aggregated frame traffic are affected by both mean frame size and the proportion of specified frame types. Based on this new knowledge, an adaptative frame size optimization (AFSO) mechanism is proposed to improve the transmission efficiency by adaptively adjusting data frame size according to the proportions of different frame types. Simulation results show that our proposed mechanism can effectively regulate the burstiness of aggregated frame traffic and improve the successful delivery rate of data frames when a fixed throughput target is set for 802.11 wireless networks.