917 resultados para Inverse Problem in Optics


Relevância:

100.00% 100.00%

Publicador:

Resumo:

Optical networks based on passive-star couplers and employing WDM have been proposed for deployment in local and metropolitan areas. These networks suffer from splitting, coupling, and attenuation losses. Since there is an upper bound on transmitter power and a lower bound on receiver sensitivity, optical amplifiers are usually required to compensate for the power losses mentioned above. Due to the high cost of amplifiers, it is desirable to minimize their total number in the network. However, an optical amplifier has constraints on the maximum gain and the maximum output power it can supply; thus, optical amplifier placement becomes a challenging problem. In fact, the general problem of minimizing the total amplifier count is a mixed-integer nonlinear problem. Previous studies have attacked the amplifier-placement problem by adding the “artificial” constraint that all wavelengths, which are present at a particular point in a fiber, be at the same power level. This constraint simplifies the problem into a solvable mixed integer linear program. Unfortunately, this artificial constraint can miss feasible solutions that have a lower amplifier count but do not have the equally powered wavelengths constraint. In this paper, we present a method to solve the minimum amplifier- placement problem, while avoiding the equally powered wavelength constraint. We demonstrate that, by allowing signals to operate at different power levels, our method can reduce the number of amplifiers required.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Survivable traffic grooming (STG) is a promising approach to provide reliable and resource-efficient multigranularity connection services in wavelength-division-multiplexing (WDM) optical networks. In this paper, we study the STG problem in WDM mesh optical networks employing path protection at the connection level. Both dedicated-protection and shared-protection schemes are considered. Given network resources, the objective of the STG problem is to maximize network throughput. To enable survivability under various kinds of single failures, such as fiber cut and duct cut, we consider the general shared-risklink- group (SRLG) diverse routing constraints. We first resort to the integer-linear-programming (ILP) approach to obtain optimal solutions. To address its high computational complexity, we then propose three efficient heuristics, namely separated survivable grooming algorithm (SSGA), integrated survivable grooming algorithm (ISGA), and tabu-search survivable grooming algorithm (TSGA). While SSGA and ISGA correspond to an overlay network model and a peer network model, respectively, TSGA further improves the grooming results from SSGA and ISGA by incorporating the effective tabu-search (TS) method. Numerical results show that the heuristics achieve comparable solutions to the ILP approach, which uses significantly longer running times than the heuristics.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Dynamic conferencing refers to a scenario wherein any subset of users in a universe of users form a conference for sharing confidential information among themselves. The key distribution (KD) problem in dynamic conferencing is to compute a shared secret key for such a dynamically formed conference. In literature, the KD schemes for dynamic conferencing either are computationally unscalable or require communication among users, which is undesirable. The extended symmetric polynomial based dynamic conferencing scheme (ESPDCS) is one such KD scheme which has a high computational complexity that is universe size dependent. In this paper we present an enhancement to the ESPDCS scheme to develop a KD scheme called universe-independent SPDCS (UI-SPDCS) such that its complexity is independent of the universe size. However, the UI-SPDCS scheme does not scale with the conference size. We propose a relatively scalable KD scheme termed as DH-SPDCS that uses the UI-SPDCS scheme and the tree-based group Diffie- Hellman (TGDH) key exchange protocol. The proposed DH-SPDCS scheme provides a configurable trade-off between computation and communication complexity of the scheme.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

We investigate the problem of waveband switching (WBS) in a wavelength-division multiplexing (WDM) mesh network with dynamic traffic requests. To solve the WBS problem in a homogeneous dynamic WBS network, where every node is a multi-granular optical cross-connect (MG-OXC), we construct an auxiliary graph. Based on the auxiliary graph, we develop two heuristic on-line WBS algorithms with different grouping policies, namely the wavelength-first WBS algorithm based on the auxiliary graph (WFAUG) and the waveband-first WBS algorithm based on the auxiliary graph (BFAUG). Our results show that the WFAUG algorithm outperforms the BFAUG algorithm.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Survivable traffic grooming (STG) is a promising approach to provide reliable and resource-efficient multigranularity connection services in wavelength division multiplexing (WDM) optical networks. In this paper, we study the STG problem in WDM mesh optical networks employing path protection at the connection level. Both dedicated protection and shared protection schemes are considered. Given the network resources, the objective of the STG problem is to maximize network throughput. To enable survivability under various kinds of single failures such as fiber cut and duct cut, we consider the general shared risk link group (SRLG) diverse routing constraints. We first resort to the integer linear programming (ILP) approach to obtain optimal solutions. To address its high computational complexity, we then propose three efficient heuristics, namely separated survivable grooming algorithm (SSGA), integrated survivable grooming algorithm (ISGA) and tabu search survivable grooming algorithm (TSGA). While SSGA and ISGA correspond to an overlay network model and a peer network model respectively, TSGA further improves the grooming results from SSGA and ISGA by incorporating the effective tabu search method. Numerical results show that the heuristics achieve comparable solutions to the ILP approach, which uses significantly longer running times than the heuristics.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Wavelength division multiplexing (WDM) offers a solution to the problem of exploiting the large bandwidth on optical links; it is the current favorite multiplexing technology for optical communication networks. Due to the high cost of an optical amplifier, it is desirable to strategically place the amplifiers throughout the network in a way that guarantees that all the signals are adequately amplified while minimizing the total number amplifiers being used. Previous studies all consider a star-based network. This paper demonstrates an original approach for solving the problem in switch-based WDM optical network assuming the traffic matrix is always the permutation of the nodes. First we formulate the problem by choosing typical permutations which can maximize traffic load on individual links; then a GA (Genetic Algorithm) is used to search for feasible amplifier placements. Finally, by setting up all the lightpaths without violating the power constaints we confirm the feasibility of the solution.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Sparse traffic grooming is a practical problem to be addressed in heterogeneous multi-vendor optical WDM networks where only some of the optical cross-connects (OXCs) have grooming capabilities. Such a network is called as a sparse grooming network. The sparse grooming problem under dynamic traffic in optical WDM mesh networks is a relatively unexplored problem. In this work, we propose the maximize-lightpath-sharing multi-hop (MLS-MH) grooming algorithm to support dynamic traffic grooming in sparse grooming networks. We also present an analytical model to evaluate the blocking performance of the MLS-MH algorithm. Simulation results show that MLSMH outperforms an existing grooming algorithm, the shortest path single-hop (SPSH) algorithm. The numerical results from analysis show that it matches closely with the simulation. The effect of the number of grooming nodes in the network on the blocking performance is also analyzed.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

To many people, California is synonomous with Disneyland, freeways, Los Angeles smog, Yosemite, the California missions, or for you bird aficionados, the California Condor. But do you think about California when you eat strawberry shortcake? You should -- California leads the nation in strawberry production. How about artichokes? California produces over 98% of the artichokes raised in the United States. Dates? California produces over 99% of the dates in the United States. Yes, California is all of these, and it is much more. California may well be the most diverse state in the United States. Within its 100.2 million acres, California has the lowest place in the U.S. in Death Valley and one of the highest mountains with Mt. Whitney. Because California is such a diverse state and has a wide variety of micro- climates, it supports a uniquely diverse agriculture. Agriculture uses only about 36 million acres of its total 100.2 million acres, and most of the cash return from crops is produced on 8,6 million acres that are irrigated. California produces about 250 crops and livestock commodities (excluding nursery crops) and provides the U.S. with about 25% of its table foods. California leads the nation in the production of 46 commercial crops and livestock commodities; its farmers and ranchers marketed $8.6 billion of crop and livestock products in 1975, and the state’s harvested farm production in 1975 set a new record at 51.1 million tons. HISTORY OF BIRD PROBLEMS Records such as this are not achieved without some risk. Crops growing in Cali- fornia have always had competition from many types of vertebrate pests. The wide variety of crops grown in California and the varied climates and situations in which they are grown has resulted in many different species of birds damaging crops. Birds have compet- ed with man for his crops since the dawn of agriculture. McAtee (1932) cited examples of bird damage that occurred in a wide variety of crops in California during the early 1900s. During the 1920s, many requests for Information and relief from damage caused by a wide variety of birds, culminated in the assignment, in May 1929, of two biologists, S. E. Piper and Johnson Neff, of the former U.S. Bio- logical Survey, to initiate field studies in California. In cooperation with the Cali- fornia Department of Food and Agriculture and County Agricultural Commissioners, the study was to determine the problems and devise control procedures relative to bird depredations. Piper and Neff found such damage as Horned Larks pulling sprouting crops, House Finches disbudding deciduous fruit trees and devouring mature fruit. Blackbirds were a problem in the rice crop. Early controls were varied and, for the most part, lacked effectiveness. Flagging of fields was common to deter Horned Larks. Windmill devices were tried to frighten birds. Shooting to kill birds was common; scarecrows were.used. The six-year study brought forth the basis of most of the depredating bird control techniques still in use in California. At the end of the study, these two biologists compiled a book called “Procedure and Methods in Controlling Birds Injurious to Crops in California.” This was and still is the “Bible” for bird damage control techniques used in California. The thorough investigations conducted by these biologists resulted in techniques that have remained valid in California for over 40 years.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Bird damage to commercial fruits has long been a problem in many coun- tries, but the true magnitude of the damage incurred is difficult to determine objectively. Often the opinions of fruit growers provide the only measure of importance. In 1972, the U.S. Fish and Wildlife Service, the Michigan Department of Agriculture, and the Statistical Reporting Service of the U.S. Department of Agriculture obtained quantitative information on bird damage to tart cherries (Prunus mahalob) in Michigan. The results of the survey are presented in this paper.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Fogging of ReJeX-iT7 TP-40 offers a very efficient method for the control and dispersal of nuisance birds from many diverse areas. The amount of the repellent is greatly reduced over any other control method. The method is direct and is independent of the activity of the birds. The applications with any fogger, thermal or mechanical, that can deliver droplets of less than 20 microns, can be manually or fully automated and pose only minimal risks to operators or animals. All birds that became a nuisance and safety problem in the hangars of TWA and AA at LaGuardia, and TWA warehouse at Newark Airport were successfully driven out by fogging ReJeX-iT7 TP-40 with a Curtis Dyna-Fog AGolden Eagle@ thermal fogger.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This paper reports the reconstruction of the contamination history of a large South American industrial coastal area (Santos Estuary, Brazil) using linear alkylbenzenes (LABs). Three sediment cores were dated by (137)Cs Concentrations in surficial layers were comparable to the midrange concentrations reported for coastal sediments worldwide LAB concentrations increased towards the surface. indicating increased waste discharges into the estuary in recent decades. The highest concentration values occurred in the early 1970s, a time of intense industrial activity and marked population growth. The decreased LAB concentration, in the late 1970s was assumed to be the result of the world oil crisis Treatment of industrial effluents, which began in 1984, was represented by decreased LAB levels Microbial degradation of LABs may be more intense in the industrial area sediments. The results show that industrial and domestic waste discharges are a historical problem in the area. (C) 2010 Elsevier Ltd. All rights reserved.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

OBJETIVO: Determinar a relação da síndrome metabólica (SM) com o nível socioeconômico, hábitos comportamentais, condições de saúde, antecedentes familiares de morbidades e áreas de residência. MÉTODOS: Trata-se de um estudo de corte transversal. A amostra aleatória foi constituída por usuários de duas Unidades Básicas de Saúde da cidade de São Paulo - Jardim Comercial (UBS1) e Jardim Germânia (UBS2) -, totalizando 452. Para o diagnóstico de SM utilizou-se o critério do Third Report of the National Cholesterol Education Program Expert Panel on Detection, Evaluation and Treatment of High Blood Cholesterol in Adults (NCEP-ATP III). Na avaliação antropométrica foram aferidas medidas de peso, estatura, circunferências abdominal e do quadril. Foi utilizado questionário geral para obtenção de dados sociodemográficos, socioeconómicos, antecedentes familiares e pessoais de morbidades, hábitos comportamentais como tabagismo, etilismo e nível de atividade física. Foi estabelecida associação entre as variáveis explicativas de interesse e SM, empregando-se a regressão logística multivariada. RESULTADOS: Na UBS1, o percentual de SM foi de 56,1% e na UBS2, de 34,0%. Houve associação direta e significativa entre SM e idade, sexo feminino, cor, tabagismo, etilismo, nível de atividade física, estresse e antecedentes familiares de doença cardíaca e de diabetes mellitus. A escolaridade apresentou associação inversa: morar no bairro de menor nível socioeconómico aumentou a chance de SM. CONCLUSÃO: Os resultados sugerem que as morbidades que compõem a SM são um grave problema de saúde pública nessa população.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Leprosy is an ancient disease that remains endemic and continues to be a major public health problem in some tropical countries, where it has been internationally recognized as being linked to the underdevelopment conditions. The natural course of the disease covers a wide variety of clinical conditions with systemic involvement. In this paper, we review the findings obtained in studies of the pathological mechanisms of leprosy, including a survey of the literature and of our own work. The understanding and control of the wide variety of clinical conditions should help improve patient care and thus prevent the onset of physical impairment and the stigma of the disease.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Leao RM, Li S, Doiron B, Tzounopoulos T. Diverse levels of an inwardly rectifying potassium conductance generate heterogeneous neuronal behavior in a population of dorsal cochlear nucleus pyramidal neurons. J Neurophysiol 107: 3008-3019, 2012. First published February 29, 2012; doi:10.1152/jn.00660.2011.-Homeostatic mechanisms maintain homogeneous neuronal behavior among neurons that exhibit substantial variability in the expression levels of their ionic conductances. In contrast, the mechanisms, which generate heterogeneous neuronal behavior across a neuronal population, remain poorly understood. We addressed this problem in the dorsal cochlear nucleus, where principal neurons exist in two qualitatively distinct states: spontaneously active or not spontaneously active. Our studies reveal that distinct activity states are generated by the differential levels of a Ba2+-sensitive, inwardly rectifying potassium conductance (K-ir). Variability in K-ir maximal conductance causes variations in the resting membrane potential (RMP). Low K-ir conductance depolarizes RMP to voltages above the threshold for activating subthreshold-persistent sodium channels (Na-p). Once Na-p channels are activated, the RMP becomes unstable, and spontaneous firing is triggered. Our results provide a biophysical mechanism for generating neural heterogeneity, which may play a role in the encoding of sensory information.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This report aims at giving a general overview on the classification of the maximal subgroups of compact Lie groups (not necessarily connected). In the first part, it is shown that these fall naturally into three types: (1) those of trivial type, which are simply defined as inverse images of maximal subgroups of the corresponding component group under the canonical projection and whose classification constitutes a problem in finite group theory, (2) those of normal type, whose connected one-component is a normal subgroup, and (3) those of normalizer type, which are the normalizers of their own connected one-component. It is also shown how to reduce the classification of maximal subgroups of the last two types to: (2) the classification of the finite maximal Sigma-invariant subgroups of centerfree connected compact simple Lie groups and (3) the classification of the Sigma-primitive subalgebras of compact simple Lie algebras, where Sigma is a subgroup of the corresponding outer automorphism group. In the second part, we explicitly compute the normalizers of the primitive subalgebras of the compact classical Lie algebras (in the corresponding classical groups), thus arriving at the complete classification of all (non-discrete) maximal subgroups of the compact classical Lie groups.