Volume 1 Issue 1
Authors: Priti Kumar Roy; Amar Nath Chatterjee; Sutapa Biswas Majee
Abstract: Long-term infection by Human Immunodeficiency Virus produces a multitude of clinical symptoms resulting in total suppression of the immune system dominated by depletion in CD4+ T cell count and reduction in density of Human Immunodeficiency Virus specific Cytotoxic T-Lymphocyte immune responses. Since the dynamics between viral infection and replication parameters and the host immunity system changes from short-term to long-term chronic infection, mathematical modeling of long-term dynamics necessitates incorporation of negative feedback control mechanism. By applying optimal control theory approach to the administration of combination therapy of reverse transcriptase inhibitor and interleukin 2 in the same model, the most cost-effective strategy has been established where maximum recovery of CD4+ T cell population is attained.
Keywords: Human Immunodeficiency Virus; Host Immune System; Negative Feedback Control; Optimal Control
Authors: Fabrício Yutaka K. Takigawa; Erlon Cristian Finardi; Edson Luiz da Silva
Abstract: The Short-Term Hydrothermal Scheduling – STHS problem is addressed in this paper. In this problem, hydro and thermal plants must be coordinated in order to supply the demand at a minimum cost and comply with a set of constraints, concerning the system and the plants themselves, in the short-term planning horizon (from one day to one week). Given the nonlinearities associated with the problem, the large number of decision variables and constraints coupled in time periods, the STHS problem results in a complex mathematical programming problem. The Lagrangian Relaxation – LR method is the most widespread procedure for solving this problem. This work presents two strategies to solve STHS, which are based on different decomposition schemes of the primal problem. These strategies make it possible to define, for large-scale problems, the most appropriate decomposition scheme, which is particularly important for power systems with high proportion of hydraulic generation. The studies were accomplished using a reduced system composed of five reservoirs, 22 hydro and two thermal units of the Brazilian Hydrothermal Power System.
Keywords: Hydrothermal Systems; Short-Term Scheduling; Lagrangian Relaxation
Authors: K. K. Mishra; Prince Bhatia; Shailesh Tiwari; A. K. Misra
Abstract: To generate a big prime number is a very complex task. Researchers in Cryptography are involved in generating new methods so that they can generate new primes easily, although many algorithms have been proposed yet they are not very efficient. In this paper we will propose a new algorithm for generating bigger primes. Experimental analysis shows that our algorithm is very efficient in generating new primes.
Keywords: Prime Number; Cryptography; Public Key, Genetic Algorithm, Primality Test
Authors: Chiuwei Pan; Zhao Wang; Carl Sechen
Abstract: A high speed and power efficient compression algorithm for an arbitrarily shaped array of partial products and vectors is presented. Since the full-adder cell is a cornerstone for the carry-save adder (CSA) tree, the most power efficient full-adder cells for building CSA trees for a wide range of delays were ascertained. A minimum hard-ware usage algorithm for an arbitrarily shaped array of vectors was developed. Finally, a new delay-based adder-type selection and CSA-tree wiring algorithm is proposed. This new compression network synthesis (CNS) algorithm was tested on several industrial DSP blocks for a variety of process technologies. CNS produces DSP blocks that consume 20-40% less power for the same delay (throughput) compared to other state-of-the-art designs and compared to the leading commercial synthesis tool.
Keywords: Partial Product Compression; DSP Networks; Networks of Additions and Multiplications; Accelerators
Authors: Liu Yonghe; Feng Jinming; Shao Yuehong
Abstract: A simple sweep-line algorithm for constructing 2D Delaunay triangulation is proposed in this paper. It includes following steps: sort the given points according to x coordinates or y coordinates, then link a point each time into the triangulation sequentially, and legalize the new triangles using Lawson’s method. Each point is processed by constructing triangles linking the point with all valid edges on the border – the convex hull of points passed by the sweep-line. The border edges are collected using a linked list and the point in it can be searched without consuming much time, since usually only 20-30 edges are in it. The algorithm is faster than incremental insertion algorithm and Fortune’s sweep-line algorithm. It is slower than the Zalik’s sweep-like algorithm, but is simpler and easier to implement, and can be regarded as another alternative choice to the Zalik’s algorithm or the divide-and-conquer algorithm.
Keywords: Delaunay Triangulation; Sweep-line Algorithm; Digital Elevation Models; Triangulated Irregular Networks