STAR TECHNOLOGY CHENNAI

SOFTWARE ENGINEERING PROJECTS

STAR TECHNOLOGY CHENNAI - +91 8870457435
 
SOFTWARE ENGINEERING – 2016
 
TITLE - 1 

A novel and fast connected component count algorithm based on graph theory
 
Abstract :A fast component-counting algorithm is proposed based on graph theory
 
in this paper. We derived a formulation to count faces in a plane given only the
 
vertices based on Euler polyhedron formula. Vertices with degree no more than two
 
are ineffective in counting components. With the derived formula, a graph
 
component counting algorithm is constructed based only on searching cross points
 
whose degree are no less than three. When applied to a two-dimensional binary
 
image, the proposed method divides an image into patches of same size and
 
decides which of them will be used in counting by searching the circumferential
 
pixels of each patch. If the number of component edges within the circumferential
 
pixels of a patch is no less than three, then the patch will be used in counting. After
 
determining all the vertices with degree no less than three, the number of
 
components can be calculated by the formula. Because only a small number of
 
pixels are investigated in the process, the computational time is very fast. The
 
disconnection of edges in an image is one of the main reasons which causes
 
miscounts for scanning-based algorithms. The difficulty, however, can be naturally
 
overcome by the proposed algorithm because disconnected points will be identified
 
as futile pixels in the algorithm. Experimental results show the algorithm is more
 
efficient than existing methods. When applied to images with disconnected edges,
 
the counted number given by scanning-based algorithms is much smaller than the
 
correct number whereas the proposed algorithm obtains satisfactory results.

TITLE - 2 

A novel fuzzy omni-directional gait planning algorithm for biped robot
 
Abstract:Aiming at the problems in gait planning of the biped robots, including the
 
complex model, low stability, etc., a novel fuzzy omni-directional gait planning
 
algorithm (FOGPA) is proposed. At first, this method puts forward a new separated
 
omni-directional gait planning model, which combines the straight walking planning
 
algorithm based on the improved Hermite interpolation and the rotation motion
 
together. And then, a fuzzy gait parameter adjustment algorithm is put forward to
 
control the gait parameters including the step size and rotation speed dynamically. At
 
last, the fuzzy control results are used to get the gait data of robot real-timely. The
 
experiment results show that the FOGPA improves the stability and robustness of
 
gait in a certain degree and also improves the adaptability to the complex
 
environment of the robot.

TITLE - 3 
 
Parallel image dehazing algorithm based on GPU using fuzzy system and

hybird evolution algorithm
 
Abstract:Haze is an atmospheric phenomenon that fogs the visibility of the scenes.
 
Removing the haze has been an important issue in image processing technologies.
 
Many image dehazing technologies with evolution algorithms have been proposed to
 
remove the fog in the image. However, these algorithms usually are compute-
 
intensive. In this paper, we propose a parallel hybrid evolution algorithm based on
 
GPU to enhance the computational performance. In traditional evolution algorithms,
 
the calculation of fitness function occupies the most of the computation time. In the
 
proposed method, we implement this part on GPU by using CUDA framework to
 
reduce the computational load. The experiment results show that the proposed
 
method can remove the haze efficiently and successfully.

TITLE - 4 
 
Network security risk assessment method based on HMM and attack graph
 
Abstract:The ever-increasing complexity of computer network and various new types
 
of bugs make the network security become an ever-growing serious challenge. In the
 
evaluation of network security risk, the cause-and- effect relationship between
 
multiple attack steps can be described well in an attack graph model. However, its
 
test result is uncertain. Focused on this issue, the method of fusing attack graph
 
model and Hidden Markov model (HMM) was proposed. Firstly, the network
 
environment and attacker's aggressive behavior were abstracted by the attack graph
 
model; Secondly, the probabilistic mapping that was between network observation
 
and attack status was established by the HMM; Finally, the Viterbi algorithm was
 
used to calculate the maximum probability state transition sequence. Experimental
 
results show that the maximum probability of the state transition sequence can be
 
effectively calculated and then the attack intention can be accurately inferred by this
 
dual model. This method provides a good configuration for network security
 
administrators.

TITLE - 5 
 
A novel microgrid based resilient Demand Response scheme in smart grid
 
Abstract:In the smart grid, as a large-scale distributed cyber-physical system,
 
Demand Response (DR) plays an important role in the electricity market. Various
 
demand response schemes have been developed to improve the efficiency and
 
economy of power utilization. Nonetheless, most existing schemes, including both
 
market-led and system-led schemes, do not carefully take the information security
 
into account in the DR process so that the power grid could suffer from cyber attacks
 
(data integrity attacks, etc.). To address this issue, in this paper we proposed a
 
resilient demand response scheme based on microgrids, which can achieve both
 
great effectiveness of energy use and security resilience against data integrity
 
attacks. In our scheme, the DR process considers two power distribution stages. In
 
the intra-microgrid stage, the DR providers generate the list of possible electricity
 
prices and schedules for power delivery. In the inter-microgrid stage, utilities select
 
the proper electricity price and the schedule for power delivery. In this way, the
 
damage impact of attacks on the power grid can be limited only within isolated
 
microgrids that are compromised, while other microgrids that are not compromised
 
can operate effectively. Our experimental results show that our scheme can not only
 
bring better benefits to all participants, but also achieve a greater security resilience
 
in the DR process in comparison with existing schemes.

TITLE  - 6 

Profiling and analysis of object lazy allocation in Java programs
 
Abstract:Lazy allocation strategy allows the memory management system to defer
 
the space allocation action of objects until they are being accessed. This paper
 
investigates the potential benefits of a lazy allocator for Java applications. A heap
 
tracing tool is implemented by instrumenting an existing Java virtual machine
 
HotSpot, which records useful object manipulating events at runtime. By profiling and
 
analyzing a large number of benchmarks, we show the potential dynamic memory
 
management optimization opportunity in Java programs. We also designed a
 
simulation system to demonstrate the actual effects of a lazy allocator.

This website was created for free with Own-Free-Website.com. Would you also like to have your own website?
Sign up for free