Volume 05 Issue 06, November 2017

Application of Operation Research in Logistics and Warehouse Optimization

Hrithik Shukla, Jainam Chhadva, Jasika Arora, Karan Sheth, Kartik Malhotra

Page no:1-07

Abstract

Logistics and warehouse problems are ill structured and real- world problems. The main reason behind conducting this research is the high degree of application of operation research required to solve these disordered problems. Operation research has a long tradition in reducing costs and improving solutions. Logistics and warehouse optimization is commonly required in most of the industries like automobile, FMCG, container terminals, defence, etc. This paper will provide an overview of the inbound and outbound transportation in warehouses, problematic issues faced, the mathematical methods used by the firms to minimize the transportation cost, application of queueing theory, as well as the limitations of the current system. The first part of the paper will deal with application of network optimization network and queueing theory to predict the waiting time of the trucks for loading/unloading purposes whereas, the second part would deal with problems like selecting the transport route to minimize the time and cost of transportation.
 

A DTN ROUTING BASED ON A ADAPTIVE DYNAMIC AGING FACTOR IN URBAN ENVIRONMENTS

Tingwei Fu ,Wenzao Li, Yang Liu, Zhan Wen

Page no: 08-13

Abstract

Delay Tolerant Network(DTN) is an important part of future smart city development. There are corresponding routing algorithms for different scenarios. In urban environments, the Prophet is a more reliable routing method than others for DNT due to changing rules of periodic life. However, the delivery predictability is calculated by an aging constant in the Prophet algorithm, then probabilities aging rate of less-active nodes are also the same with active nodes. Therefore, the Prophet will result in inconspicuous probabilities of nodes. Finally, the whole network is not efficient due to the Prophet. To fight with challenge we have proposed an Adaptive Dynamic Aging Factor (ADAF) method. ADAF routing algorithm can effectively improve the performance of the entire DNT in urban scenarios, so that each node can effectively distinguish active degree of nodes. Results of simulation verified the performance of proposed ADAF under an urban scenario, and the results suggest that the ADAF outperforms the Prophet routing algorithm in delivery ratio and network overhead ratio.

 DESIGN OF A CYBER THREAT INTELLIGENCE FRAMEWORK

NakHyun Kim,Byung-ik Kim,Seulgi Lee,Hyeisun Cho,Jun-hyung Park

Page no:14-19

Abstract

This paper reviews the trends of cyber threat intelligence (CTI) technology that enables preemptive detection of cyber attacks and threats, which become intelligent and advanced, and responds to them effectively; and analyzes CIT-related products, standards, and frameworks. Based on the review and analysis, this paper provides comprehensive information on the components and structure of CTI technology to enterprises and researchers that want to introduce and develop CTI technology by proposing a cyber threat intelligence framework that can express various types of CTI structures. Cyber threat intelligence is a technology that creates intelligence to respond to cyber attacks and threats that occur now, will occur, or can occur (potential), based on large amounts and heterogeneous data related to cyber incidents and threats. Cyber threat intelligence is emerging as a technology that can effectively respond to cyber incidents that are on the rise in terms of quality and quantity.

DETECTION OF SIMILARITIES IN CYBER THREATS THROUGH OSINT

Seulgi Lee, NakHyun Kim, Hyeisun Cho,Byung-ik Kim,Jun-hyung Park

Page no:20-25

Abstract

The real condition is that infringement incidents are automated and intelligent with the rapidly growing number of cyber threats. There are double-sided characteristics that attack tools used for infringement incidents share, but the characteristics of the tool are different for each attacker. As a result, demand on cyber threats information sharing increases, so that the whole world can respond to cyber threats instead of local respond to infringement incidents. This paper proposes a method of calculating a level of similarity by graph kernels among cyber threat information that is shared. And we also propose several techniques for facilitating development based on the proposed method. For example, in selecting targets for comparison, we have limited the input values to execute the delta function in original graph kernels. In order to make similarity more reliable, we adopt a pre-processing procedures by types of threat information shared. This system provides some insight into planning that cyber threats information can be grouped according to characteristics.

CYBER THREAT ANALYSIS AND QUANTIFICATION BASED ON INDICATOR OF COMPROMISE

Hyeisun Cho,Seulgi Lee,Nakhyun Kim,Byung-ik Kim, Jun-hyung Park

Page no:26-31

Abstract

As a large quantity of new and varied attacks occur in Ko-rea, it is difficult to analyze and respond to them with lim-ited security experts and existing equipment. This paper pro-poses a method of analyzing the threat of Indicator of Com-promise (IoC) used for cyber incidents and calculating it as a quantitative value Threat Level of IoC (TL_IoC) in order to check the analysis priority of cyber incidents that occur in large quantities. Using this method, a large quantity of cyber incidents can be efficiently responded to by checking the TL_IoC objectively to quickly determine the response level of the cyber incident and actively analyze cyber incidents with high threat levels.

Enhancement Low Power Static Random Access Memory: A Review

Akanksha Kanday, Dr. Vibha Tiwari

Page no:32-35

Abstract

Memories are the crucial a part of any digital system and no digital system may be completed without memories. Compact devices and embedded systems are emerging, therefore the low power consumption is extremely essential to the architectural system design .Optimization of the ability at the logical level is one amongst the foremost necessary task to reduce the ability. Performance in terms of speed and power dissipation is that the major areas of concern in today’s memory technology. During this paper SRAM cells supported 6T and 8T configurations are compared on the idea of performance for browse and write operations. During this paper survey on completely different static random access memory is designed so as to high power, high performance circuit and therefore the intensive survey on options of various static random access memory (SRAM) designs was reported. During this paper survey a strong traditional SRAM is designed however our aim is to use change circuits to induce best throughput for SRAM are often achieved. Projected design is designed victimization change principles. Projected SRAM is tested on micro wind tool.