A Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network

Assigning cells to switches in a cellular mobile network is known as an NP-hard optimization problem. This means that the alternative for the solution of this type of problem is the use of heuristic methods, because they allow the discovery of a good solution in a very satisfactory computational time. This paper proposes a Beam Search method to solve the problem of assignment cell in cellular mobile networks. Some modifications in this algorithm are also presented, which allows its parallel application. Computational results obtained from several tests confirm the effectiveness of this approach and provide good solutions for large scale problems.

Problem of assignment cells to switches in a cellular mobile network via beam search method

The problem of assigning cells to switches in a cellular mobile network is an NP-hard optimization problem. So, real size mobile networks could not be solved by using exact methods. The alternative is the use of the heuristic methods, because they allow us to find a good quality solution in a quite satisfactory computational time. This paper proposes a Beam Search method to solve the problem of assignment cell in cellular mobile networks. Some modifications in this algorithm are also presented, which allows its parallel application. Computational results obtained from several tests confirm the effectiveness of this approach to provide good solutions for medium- and large-sized cellular mobile network.

Resolução do problema de carregamento e descarregamento de contêineres em terminais portuários via Beam Search

One problem that has been happening frequently in port terminals is the poor planning of the loading and unloading of containers. The reason of this problem is the lack of an efficient method that provides the best means of these operations. The main goal of this work is, to implement a method that provides the best ways to perform the loading and unloading of containers, at each port and thus bring a great saving for these terminals, since the number of moves is directly proportional to cost. To carry out this program was used the idea that the containers are placed in vertical stacks, where the access can be done only by the top of the stack, so the ship was treated as an matrix and to fill it, two rules were created for loading and two for unloading. To obtain the best sequence of rules was used Beam Search method, which is an enumeration type implicit method that analyzes only the best solution of the tree generated. Thus, the program developed in the Java language, provides the best way to perform the loading and unloading ports and the way as the ship leaves each port using a graphical interface

Atribuição de turmas para professores via Beam Search em Java

In the universities, before the start of each school year, is held the distribution of classes among available teachers. Therefore, it is necessary to consider the maximum workweek for each teacher and their preferences for each discipline, to prevent a teacher to give lessons in two separate locations at the same time and to avoid some teachers to become overloaded while others with large clearance. This process, manually performed, is time consuming and does not allow the visualization of other combinations of assignment of teachers to classes, besides being liable to error. This work aims to develop a decision support tool for the problem of assigning teachers to classes in college. The project encompasses the development of a computer program using the concepts of object orientation and a tree search algorithm of a combinatorial nature called Beam Search. The programming language used is Java and the program has a graphical interface for entering and manipulating data of the problem. Once obtained the schedule data of classes and teachers is possible, by means of the tool, perform various simulations and manual adjustments to achieve the final result. It is an efficient method of class scheduling, considering the speed of task execution and the fact that it generates only feasible results

Railway junction conflict resolution by local search method

This study investigates the application of local search methods on the railway junction traffic conflict-resolution problem, with the objective of attaining a quick and reasonable solution. A procedure based on local search relies on finding a better solution than the current one by a search in the neighbourhood of the current one. The structure of neighbourhood is therefore very important to an efficient local search procedure. In this paper, the formulation of the structure of the solution, which is the right-of-way sequence assignment, is first described. Two new neighbourhood definitions are then proposed and the performance of the corresponding local search procedures is evaluated by simulation. It has been shown that they provide similar results but they can be used to handle different traffic conditions and system requirements.

Location of concentrators in a computer communication network: a stochastic automation search method

The following problem is considered. Given the locations of the Central Processing Unit (ar;the terminals which have to communicate with it, to determine the number and locations of the concentrators and to assign the terminals to the concentrators in such a way that the total cost is minimized. There is alao a fixed cost associated with each concentrator. There is ail upper limit to the number of terminals which can be connected to a concentrator. The terminals can be connected directly to the CPU also In this paper it is assumed that the concentrators can bo located anywhere in the area A containing the CPU and the terminals. Then this becomes a multimodal optimization problem. In the proposed algorithm a stochastic automaton is used as a search device to locate the minimum of the multimodal cost function . The proposed algorithm involves the following. The area A containing the CPU and the terminals is divided into an arbitrary number of regions (say K). An approximate value for the number of concentrators is assumed (say m). The optimum number is determined by iteration later The m concentrators can be assigned to the K regions in (mk) ways (m > K) or (km) ways (K>m).(All possible assignments are feasible, i.e. a region can contain 0,1,…, to concentrators). Each possible assignment is assumed to represent a state of the stochastic variable structure automaton. To start with, all the states are assigned equal probabilities. At each stage of the search the automaton visits a state according to the current probability distribution. At each visit the automaton selects a 'point' inside that state with uniform probability. The cost associated with that point is calculated and the average cost of that state is updated. Then the probabilities of all the states are updated. The probabilities are taken to bo inversely proportional to the average cost of the states After a certain number of searches the search probabilities become stationary and the automaton visits a particular state again and again. Then the automaton is said to have converged to that state Then by conducting a local gradient search within that state the exact locations of the concentrators are determined This algorithm was applied to a set of test problems and the results were compared with those given by Cooper's (1964, 1967) EAC algorithm and on the average it was found that the proposed algorithm performs better.

Low temperature and self catalytic growth of ultrafine ITO nanowires by electron beam evaporation method and their optical and electrical properties

We report the self catalytic growth of Sn-doped indium oxide (ITO) nanowires (NWs) over a large area glass and silicon substrates by electron beam evaporation method at low substrate temperatures of 250-400 degrees C. The ITO NWs growth was carried out without using an additional reactive oxygen gas and a metal catalyst particle. Ultrafine diameter (similar to 10-15 nm) and micron long ITO NWs growth was observed in a temperature window of 300-400 degrees C. Transmission electron microscope studies confirmed single crystalline nature of the NWs and energy dispersive spectroscopy studies on the NWs confirmed that the NWs growth proceeds via self catalytic vapor-liquid-solid (VLS) growth mechanism. ITO nanowire films grown on glass substrates at a substrate temperature of 300-400 degrees C have shown similar to 2-6% reflection and similar to 70-85% transmission in the visible region. Effect of deposition parameters was systematically investigated. The large area growth of ITO nanowire films would find potential applications in the optoelectronic devices. (C) 2014 Elsevier Ltd. All rights reserved.

Biocompatible and Antibacterial SnO2 Nanowire Films Synthesized by E-Beam Evaporation Method

In this work, the biocompatibility and antibacterial activities of novel SnO2 nanowire coatings prepared by electron-beam (E-Beam) evaporation process at low temperatures were studied. The nanowire coatings were characterized by scanning electron microscopy (SEM), energy dispersive X-ray analysis (EDX), and X-ray diffraction (XRD) methods. The results of in vitro cytotoxicity and cell proliferation assays suggested that the SnO2 nanowire coatings were nontoxic and promoted the proliferation of C2C12 and L929 cells (> 90% viability). Cellular activities, cell adhesion, and lactate dehydrogenase activities were consistent with the superior biocompatibility of the nanowire materials. Notably, the nanowire coating showed potent antibacterial activity against six different bacterial strains. The antibacterial activity of the SnO2 material was attributed to the photocatalytic nature of SnO2. The antibacterial activity and biocompatibility of the newly developed SnO2 nanowire coatings may enable their use as coating materials for biomedical implants.

Finite element beam propagation method for analysis of plasmonic waveguide

The basic idea of the finite element beam propagation method (FE-BPM) is described. It is applied to calculate the fundamental mode of a channel plasmonic polariton (CPP) waveguide to confirm its validity. Both the field distribution and the effective index of the, fundamental mode are given by the method. The convergence speed shows the advantage and stability of this method. Then a plasmonic waveguide with a dielectric strip deposited on a metal substrate is investigated, and the group velocity is negative for the fundamental mode of this kind of waveguide. The numerical result shows that the power flow direction is reverse to that of phase velocity.

Single-mode behaviour judgment of optical waveguides by imaginary-distance beam propagation method under perfectly matched layer boundary condition

Imaginary-distance beam propagation method under the perfectly matched layer boundary condition is applied to judge single-mode behaviour of optical waveguides, for the first time to our knowledge. A new kind of silicon-on-insulator-based rib structures with half-circle cross-section is presented. The single-mode behaviour of this kind of waveguide with radius 2mum is investigated by this method. It is single-mode when the slab height is not smaller than the radius.

A highly efficient beam propagation method for modeling step-index waveguides with tilt interface

Based on a new finite-difference scheme and Runge-Kutta method together with transparent boundary conditions (TBCs), a novel beam propagation method to model step-index waveguides with tilt interfaces is presented. The modified scheme provides an precies description of the tilt interface of the nonrectangular waveguide structure, showing a much better efficiency and accuracy comparing with the previously presented formulas.

A new beam propagation method based on least-squares expansion approximating

A new finite difference wide-angle beam propagation method is developed by introducing the least-squares expansion approximant in the propagator expansion. In this new method it is not necessary to select the reference index point because of the whole region approaching the lease-square expansion. This method avoids the problems induced by error selection of the reference index in the old methods based on Taylor or Pade expansion. Several typical structures are simulated by the new method and the results prove the validity of it.