Abstract: Distributed Power generation has gained a lot of
attention in recent times due to constraints associated with
conventional power generation and new advancements in DG
technologies .The need to operate the power system economically
and with optimum levels of reliability has further led to an increase
in interest in Distributed Generation. However it is important to place
Distributed Generator on an optimum location so that the purpose of
loss minimization and voltage regulation is dully served on the
feeder. This paper investigates the impact of DG units installation on
electric losses, reliability and voltage profile of distribution networks.
In this paper, our aim would be to find optimal distributed
generation allocation for loss reduction subjected to constraint of
voltage regulation in distribution network. The system is further
analyzed for increased levels of Reliability. Distributed Generator
offers the additional advantage of increase in reliability levels as
suggested by the improvements in various reliability indices such as
SAIDI, CAIDI and AENS. Comparative studies are performed and
related results are addressed. An analytical technique is used in order
to find the optimal location of Distributed Generator. The suggested
technique is programmed under MATLAB software. The results
clearly indicate that DG can reduce the electrical line loss while
simultaneously improving the reliability of the system.
Abstract: The paper proposes the novel design of a 3T XOR gate combining complementary CMOS with pass transistor logic. The design has been compared with earlier proposed 4T and 6T XOR gates and a significant improvement in silicon area and power-delay product has been obtained. An eight transistor full adder has been designed using the proposed three-transistor XOR gate and its performance has been investigated using 0.15um and 0.35um technologies. Compared to the earlier designed 10 transistor full adder, the proposed adder shows a significant improvement in silicon area and power delay product. The whole simulation has been carried out using HSPICE.
Abstract: This paper is concerned with an improved algorithm
based on the piecewise-smooth Mumford and Shah (MS) functional
for an efficient and reliable segmentation. In order to speed up
convergence, an additional force, at each time step, is introduced
further to drive the evolution of the curves instead of only driven by
the extensions of the complementary functions u + and u - . In our
scheme, furthermore, the piecewise-constant MS functional is
integrated to generate the extra force based on a temporary image that
is dynamically created by computing the union of u + and u - during
segmenting. Therefore, some drawbacks of the original algorithm,
such as smaller objects generated by noise and local minimal problem
also are eliminated or improved. The resulting algorithm has been
implemented in Matlab and Visual Cµ, and demonstrated efficiently
by several cases.
Abstract: In the modern manufacturing systems, the use of
thermal cutting techniques using oxyfuel, plasma and laser have
become indispensable for the shape forming of high quality complex
components; however, the conventional chip removal production
techniques still have its widespread space in the manufacturing
industry. Both these types of machining operations require the
positioning of end effector tool at the edge where the cutting process
commences. This repositioning of the cutting tool in every machining
operation is repeated several times and is termed as non-productive
time or airtime motion. Minimization of this non-productive
machining time plays an important role in mass production with high
speed machining. As, the tool moves from one region to the other by
rapid movement and visits a meticulous region once in the whole
operation, hence the non-productive time can be minimized by
synchronizing the tool movements. In this work, this problem is
being formulated as a general travelling salesman problem (TSP) and
a genetic algorithm approach has been applied to solve the same. For
improving the efficiency of the algorithm, the GA has been
hybridized with a noble special heuristic and simulating annealing
(SA). In the present work a novel heuristic in the combination of GA
has been developed for synchronization of toolpath movements
during repositioning of the tool. A comparative analysis of new Meta
heuristic techniques with simple genetic algorithm has been
performed. The proposed metaheuristic approach shows better
performance than simple genetic algorithm for minimization of nonproductive
toolpath length. Also, the results obtained with the help of
hybrid simulated annealing genetic algorithm (HSAGA) are also
found better than the results using simple genetic algorithm only.
Abstract: Accurate loss minimization is the critical component
for efficient electrical distribution power flow .The contribution of
this work presents loss minimization in power distribution system
through feeder restructuring, incorporating DG and placement of
capacitor. The study of this work was conducted on IEEE
distribution network and India Electricity Board benchmark
distribution system. The executed experimental result of Indian
system is recommended to board and implement practically for
regulated stable output.
Abstract: In this paper newly reported Cosh window function is
used in the design of prototype filter for M-channel Near Perfect
Reconstruction (NPR) Cosine Modulated Filter Bank (CMFB). Local
search optimization algorithm is used for minimization of distortion
parameters by optimizing the filter coefficients of prototype filter.
Design examples are presented and comparison has been made with
Kaiser window based filterbank design of recently reported work.
The result shows that the proposed design approach provides lower
distortion parameters and improved far-end suppression than the
Kaiser window based design of recent reported work.
Abstract: A wireless sensor network with a large number of tiny sensor nodes can be used as an effective tool for gathering data in various situations. One of the major issues in wireless sensor networks is developing an energy-efficient routing protocol which has a significant impact on the overall lifetime of the sensor network. In this paper, we propose a novel hierarchical with static clustering routing protocol called Energy-Efficient Protocol with Static Clustering (EEPSC). EEPSC, partitions the network into static clusters, eliminates the overhead of dynamic clustering and utilizes temporary-cluster-heads to distribute the energy load among high-power sensor nodes; thus extends network lifetime. We have conducted simulation-based evaluations to compare the performance of EEPSC against Low-Energy Adaptive Clustering Hierarchy (LEACH). Our experiment results show that EEPSC outperforms LEACH in terms of network lifetime and power consumption minimization.
Abstract: An iterative definition of any n variable mean function is given in this article, which iteratively uses the two-variable form of the corresponding two-variable mean function. This extension method omits recursivity which is an important improvement compared with certain recursive formulas given before by Ando-Li-Mathias, Petz- Temesi. Furthermore it is conjectured here that this iterative algorithm coincides with the solution of the Riemann centroid minimization problem. Certain simulations are given here to compare the convergence rate of the different algorithms given in the literature. These algorithms will be the gradient and the Newton mehod for the Riemann centroid computation.