Survey on security issues in file management in cloud computing environment

Cloud computing has pervaded through every aspect of Information technology in past decade. It has become easier to process plethora of data, generated by various devices in real time, with the advent of cloud networks. The privacy of users data is maintained by data centers around the world and hence it has become feasible to operate on that data from lightweight portable devices. But with ease of processing comes the security aspect of the data. One such security aspect is secure file transfer either internally within cloud or externally from one cloud network to another. File management is central to cloud computing and it is paramount to address the security concerns which arise out of it. This survey paper aims to elucidate the various protocols which can be used for secure file transfer and analyze the ramifications of using each protocol.Comment: 5 pages, 1 tabl

Secure management of logs in internet of things

Ever since the advent of computing, managing data has been of extreme importance. With innumerable devices getting added to network infrastructure, there has been a proportionate increase in the data which needs to be stored. With the advent of Internet of Things (IOT) it is anticipated that billions of devices will be a part of the internet in another decade. Since those devices will be communicating with each other on a regular basis with little or no human intervention, plethora of real time data will be generated in quick time which will result in large number of log files. Apart from complexity pertaining to storage, it will be mandatory to maintain confidentiality and integrity of these logs in IOT enabled devices. This paper will provide a brief overview about how logs can be efficiently and securely stored in IOT devices.Comment: 6 pages, 1 tabl

MMORPGs and Their Effect on Players

The purpose of this essay is to explore the popularity and effects of video games in the MMORPG genre. Games and play have been a part of human culture for an exceptionally long time, and in the recent decades video games have a become a large medium to continue this. Studying how video games, such as MMORPGs, can be used in order to advance life skills is important to understand the future of human development. By researching other studies done on various topics of related to MMORPG, I developed the idea that this genre of video games could be very impactful on future human development. The skills taught while playing a MMORPG can have real world applications and have shown preliminary success in doing so. Such skills include rapid decision making, civic responsibility, and social skills have been shown to improve as players play in this fantasy world. As such, further research into the full impact of MMORPGs needs to be done to fully understand the full scope of skills being utilized and developed during this form of play

Finding kk Simple Shortest Paths and Cycles

The problem of finding multiple simple shortest paths in a weighted directed graph $G=(V,E)$ has many applications, and is considerably more difficult than the corresponding problem when cycles are allowed in the paths. Even for a single source-sink pair, it is known that two simple shortest paths cannot be found in time polynomially smaller than $n^3$ (where $n=|V|$) unless the All-Pairs Shortest Paths problem can be solved in a similar time bound. The latter is a well-known open problem in algorithm design. We consider the all-pairs version of the problem, and we give a new algorithm to find $k$ simple shortest paths for all pairs of vertices. For $k=2$, our algorithm runs in $O(mn + n^2 \log n)$ time (where $m=|E|$), which is almost the same bound as for the single pair case, and for $k=3$ we improve earlier bounds. Our approach is based on forming suitable path extensions to find simple shortest paths; this method is different from the `detour finding' technique used in most of the prior work on simple shortest paths, replacement paths, and distance sensitivity oracles. Enumerating simple cycles is a well-studied classical problem. We present new algorithms for generating simple cycles and simple paths in $G$ in non-decreasing order of their weights; the algorithm for generating simple paths is much faster, and uses another variant of path extensions. We also give hardness results for sparse graphs, relative to the complexity of computing a minimum weight cycle in a graph, for several variants of problems related to finding $k$ simple paths and cycles.Comment: The current version includes new results for undirected graphs. In Section 4, the notion of an (m,n) reduction is generalized to an f(m,n) reductio

Biomimetic Algorithms for Coordinated Motion: Theory and Implementation

Drawing inspiration from flight behavior in biological settings (e.g. territorial battles in dragonflies, and flocking in starlings), this paper demonstrates two strategies for coverage and flocking. Using earlier theoretical studies on mutual motion camouflage, an appropriate steering control law for area coverage has been implemented in a laboratory test-bed equipped with wheeled mobile robots and a Vicon high speed motion capture system. The same test-bed is also used to demonstrate another strategy (based on local information), termed topological velocity alignment, which serves to make agents move in the same direction. The present work illustrates the applicability of biological inspiration in the design of multi-agent robotic collectives