VRS-DB:preserve confidentiality of users'data using encryption approach

We focus on security and privacy problems within a cloud database framework,exploiting the DataBase as a Service(DBaaS).In this framework,an information proprietor drives out its information to a cloud database professional company.The Data-Owner(DO)encrypts the delicate information before transmission at the cloud database professional company end to offer information security.Current encryption ideas,nonetheless,are just halfway homomorphic as all of them intend to enable an explicit kind of calculation,which is accomplished on scrambled information.These current plans can't be coordinated to solve genuine functional queries that include activities of various types.We propose and evaluate a Verifiable Reliable Secure-DataBase(VRS-DB)framework on shared tables along with many primary operations on scrambled information,which enables information interoperability,and permits an extensive possibility of Structured Query Language(SQL)queries to be prepared by the service provider on the encoded data.We show that our security and privacy idea is protected from two forms of threats and are fundamentally proficient.

An Agent-Based Solution Framework for Inter-Block Yard Crane Scheduling Problems

The efficiency of yard operations is critical to the overall productivity of a container terminal because the yard serves as the interface between the landside and waterside operations.Most container terminals use yard cranes to transfer containers between the yard and trucks(both external and internal).To facilitate vessel operations,an efficient work schedule for the yard cranes is necessary given varying work volumes among yard blocks with different planning periods.This paper investigated an agent-based approach to assign and relocate yard cranes among yard blocks based on the forecasted work volumes.The goal of our study is to reduce the work volume that remains incomplete at the end of a planning period.We offered several preference functions for yard cranes and blocks which are modeled as agents.These preference functions are designed to find effective schedules for yard cranes.In addition,we examined various rules for the initial assignment of yard cranes to blocks.Our analysis demonstrated that our model can effectively and efficiently reduce the percentage of incomplete work volume for any real-world sized problem.