Gravitational field of a straight cosmic string in the framework of higher-derivative gravity

The gravitational properties of a straight cosmic string are studied in the linear approximation of higher-derivative gravity. These properties are shown to be very different from those found using linearized Einstein gravity: there exists a short range gravitational (anti-gravitational) force in the nonrelativistic limit; in addition, the derection angle of a light ray moving in a plane orthogonal to the string depends on the impact parameter.

Optimal Path Searching through Specified Routes using different Algorithms

To connect different electrical, network and data devices with the minimum cost and shortest path, is a complex job. In huge buildings, where the devices are placed at different locations on different floors and only some specific routes are available to pass the cables and buses, the shortest path search becomes more complex. The aim of this thesis project is, to develop an application which indentifies the best path to connect all objects or devices by following the specific routes.To address the above issue we adopted three algorithms Greedy Algorithm, Simulated Annealing and Exhaustive search and analyzed their results. The given problem is similar to Travelling Salesman Problem. Exhaustive search is a best algorithm to solve this problem as it checks each and every possibility and give the accurate result but it is an impractical solution because of huge time consumption. If no. of objects increased from 12 it takes hours to search the shortest path. Simulated annealing is emerged with some promising results with lower time cost. As of probabilistic nature, Simulated annealing could be non optimal but it gives a near optimal solution in a reasonable duration. Greedy algorithm is not a good choice for this problem. So, simulated annealing is proved best algorithm for this problem. The project has been implemented in C-language which takes input and store output in an Excel Workbook

Experimental performance of a string module in a CPC reflector cavity

The purpose of the work is to develop a cost effective semistationary CPC concentrator for a string PV-module. A novel method of using annual irradiation distribution diagram projected in a north-south vertical plane is developed. This method allows us easily to determine the optimum acceptance angle of the concentrator and the required number of annual tilts. Concentration ranges of 2-5x are investigated with corresponding acceptance angles between 5 and 15°. The concentrator should be tilted 2-6 times per year. Experiments has been performed on a string module of 10 cells connected in a series and equipped with a compound parabolic concentrator with C = 3.3X. Measurement show that the output will increase with a factor of 2-2.5 for the concentrator module, compared to a reference module without concentrator. If very cheap aluminium reflectors are used the costs for the PV-module can be decreased nearly by a factor of two.

A stopping rule while searching for optimal solution of facility-location

Solutions to combinatorial optimization, such as p-median problems of locating facilities, frequently rely on heuristics to minimize the objective function. The minimum is sought iteratively and a criterion is needed to decide when the procedure (almost) attains it. However, pre-setting the number of iterations dominates in OR applications, which implies that the quality of the solution cannot be ascertained. A small branch of the literature suggests using statistical principles to estimate the minimum and use the estimate for either stopping or evaluating the quality of the solution. In this paper we use test-problems taken from Baesley's OR-library and apply Simulated Annealing on these p-median problems. We do this for the purpose of comparing suggested methods of minimum estimation and, eventually, provide a recommendation for practioners. An illustration ends the paper being a problem of locating some 70 distribution centers of the Swedish Post in a region.

Searching for Invariants Using Temporal Resolution

In this paper, we show how the clausal temporal resolution technique developed for temporal logic provides an effective method for searching for invariants, and so is suitable for mechanising a wide class of temporal problems. We demonstrate that this scheme of searching for invariants can be also applied to a class of multi-predicate induction problems represented by mutually recursive definitions. Completeness of the approach, examples of the application of the scheme, and overview of the implementation are described.