RNS derivation of N-point disk amplitudes from the revisited S-matrix approach

Recently, in [7] we proposed a revisited S-matrix approach to efficiently find the bosonic terms of the open superstring low energy effective lagrangian (OSLEEL). This approach allows to compute the alpha'(N) terms of the OSLEEL using open superstring n-point amplitudes in which n is considerably lower than (N + 2) (which is the order of the required amplitude to obtain those alpha'(N) terms by means of the conventional S-matrix approach). In this work we use our revisited S-matrix approach to examine the structure of the scattering amplitudes, arriving at a closed form for them. This is a RNS derivation of the formula first found by Mafra, Schlotterer and Stieberger [21], using the pure spinor formalism. We have succeeded doing this for the 5, 6 and 7-point amplitudes. In order to achieve these results we have done a careful analysis of the kinematical structure of the amplitudes, finding as a by-product a purely kinematical derivation of the BCJ relations (for N = 4, 5, 6 and 7). Also, following the spirit of the revisited S-matrix approach, we have found the alpha' expansions for these amplitudes up to alpha'(6) order in some cases, by only using the well known open superstring 4-point amplitude, cyclic symmetry and tree level unitarity: we have not needed to compute any numerical series or any integral involving polylogarithms, at any moment. (C) 2014 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/3.0/).

Planeamiento y análisis integral del paisaje de la cuenca hidrográfica del río buenavista provincia de Manabí-Ecuador para la implementación de políticas de incentivos a la restauración de ecosistemas con fines de conservación (programa socio Bosque-Ecuador)

Pós-graduação em Geografia - FCT

Cálculo diferencial e integral no movimento dos planetas

Pós-graduação em Matemática em Rede Nacional - IBILCE

Influence of alternative drying aids on water sorption of spray dried mango mix powders: a thermodynamic approach

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Multidisciplinary approach in the teaching of dental sculpture and anatomy

The purpose of the Dental Sculpture and Anatomy discipline is to introduce undergraduate students to the study of the anatomic and morphological characteristics of permanent and primary human dentition, through classes, books and cognitive and psychomotor activities. This discipline supports the teaching of specific knowledge necessary for a more extensive education, involving interdisciplinarity as a means of knowledge exchange among several areas of dentistry, to achieve comprehensive professional education. Students must recognize the dental morphology from samples of preserved teeth, and reproduce the morphology through three-dimensional models made of stone or wax blocks. In this article, the authors describe the process for producing teeth collars and macro dental models made of stone, their importance and benefits of utilization. The purpose of the study was to encourage the teaching of Dental Sculpture and Anatomy toundergraduate students of the Bauru School of Dentistry, University of Sao Paulo, through activities that would associate theory, practice and the development of manual skills.

Introdução a noções de cálculo diferencial e integral no ensino médio no contexto das TIC: implicações para prática do professor que ensina matemática

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

A comparison about evolutionary algorithms for optimum-path forest clustering optimization

In this paper we deal with the problem of boosting the Optimum-Path Forest (OPF) clustering approach using evolutionary-based optimization techniques. As the OPF classifier performs an exhaustive search to find out the size of sample's neighborhood that allows it to reach the minimum graph cut as a quality measure, we compared several optimization techniques that can obtain close graph cut values to the ones obtained by brute force. Experiments in two public datasets in the context of unsupervised network intrusion detection have showed the evolutionary optimization techniques can find suitable values for the neighborhood faster than the exhaustive search. Additionally, we have showed that it is not necessary to employ many agents for such task, since the neighborhood size is defined by discrete values, with constrain the set of possible solution to a few ones.

Resumo escolar no ensino médio técnico integrado integral: uma experiência de leitura e escrita em uma abordagem sócio-retórica

Pós-graduação em Estudos Linguísticos - IBILCE

Survivable Lightpath Provisioning in WDM Mesh Networks Under Shared Path Protection and Signal Quality Constraints

This paper addresses the problem of survivable lightpath provisioning in wavelength-division-multiplexing (WDM) mesh networks, taking into consideration optical-layer protection and some realistic optical signal quality constraints. The investigated networks use sparsely placed optical–electrical–optical (O/E/O) modules for regeneration and wavelength conversion. Given a fixed network topology with a number of sparsely placed O/E/O modules and a set of connection requests, a pair of link-disjoint lightpaths is established for each connection. Due to physical impairments and wavelength continuity, both the working and protection lightpaths need to be regenerated at some intermediate nodes to overcome signal quality degradation and wavelength contention. In the present paper, resource-efficient provisioning solutions are achieved with the objective of maximizing resource sharing. The authors propose a resource-sharing scheme that supports three kinds of resource-sharing scenarios, including a conventional wavelength-link sharing scenario, which shares wavelength links between protection lightpaths, and two new scenarios, which share O/E/O modules between protection lightpaths and between working and protection lightpaths. An integer linear programming (ILP)-based solution approach is used to find optimal solutions. The authors also propose a local optimization heuristic approach and a tabu search heuristic approach to solve this problem for real-world, large mesh networks. Numerical results show that our solution approaches work well under a variety of network settings and achieves a high level of resource-sharing rates (over 60% for O/E/O modules and over 30% for wavelength links), which translate into great savings in network costs.

Survivable Traffic Grooming With Path Protection at the Connection Level in WDM Mesh Networks

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.

A load-balancing spare capacity reallocation approach in service-rich SONET metro mesh networks

The next-generation SONET metro network is evolving into a service-rich infrastructure. At the edge of such a network, multi-service provisioning platforms (MSPPs) provide efficient data mapping enabled by Generic Framing Procedure (GFP) and Virtual Concatenation (VC). The core of the network tends to be a meshed architecture equipped with Multi-Service Switches (MSSs). In the context of these emerging technologies, we propose a load-balancing spare capacity reallocation approach to improve network utilization in the next-generation SONET metro networks. Using our approach, carriers can postpone network upgrades, resulting in increased revenue with reduced capital expenditures (CAPEX). For the first time, we consider the spare capacity reallocation problem from a capacity upgrade and network planning perspective. Our approach can operate in the context of shared-path protection (with backup multiplexing) because it reallocates spare capacity without disrupting working services. Unlike previous spare capacity reallocation approaches which aim at minimizing total spare capacity, our load-balancing approach minimizes the network load vector (NLV), which is a novel metric that reflects the network load distribution. Because NLV takes into consideration both uniform and non-uniform link capacity distribution, our approach can benefit both uniform and non-uniform networks. We develop a greedy loadbalancing spare capacity reallocation (GLB-SCR) heuristic algorithm to implement this approach. Our experimental results show that GLB-SCR outperforms a previously proposed algorithm (SSR) in terms of established connection capacity and total network capacity in both uniform and non-uniform networks.

A Two-phase Approach for Dynamic Lightpath Scheduling in WDM Optical Networks

Lightpath scheduling is an important capability in next-generation wavelength-division multiplexing (WDM) optical networks to reserve resources in advance for a specified time period while provisioning end-to-end lightpaths. In a dynamic environment, the end user requests for dynamic scheduled lightpath demands (D-SLDs) need to be serviced without the knowledge of future requests. Even though the starting time of the request may be hours or days from the current time, the end-user however expects a quick response as to whether the request could be satisfied. We propose a two-phase approach to dynamically schedule and provision D-SLDs. In the first phase, termed the deterministic lightpath scheduling phase, upon arrival of a lightpath request, the network control plane schedules a path with guaranteed resources so that the user can get a quick response with a deterministic lightpath schedule. In the second phase, termed the lightpath re-optimization phase, we re-provision some already scheduled lightpaths to re-optimize for improving network performance. We study two reoptimization scenarios to reallocate network resources while maintaining the existing lightpath schedules. Experimental results show that our proposed two-phase dynamic lightpath scheduling approach can greatly reduce network blocking.

Survivable Traffic Grooming with Path Protection at the Connection Level in WDM Mesh Networks

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.

Levy stable distributions via associated integral transform

We present a method of generation of exact and explicit forms of one-sided, heavy-tailed Levy stable probability distributions g(alpha)(x), 0 <= x < infinity, 0 < alpha < 1. We demonstrate that the knowledge of one such a distribution g a ( x) suffices to obtain exactly g(alpha)p ( x), p = 2, 3, .... Similarly, from known g(alpha)(x) and g(beta)(x), 0 < alpha, beta < 1, we obtain g(alpha beta)( x). The method is based on the construction of the integral operator, called Levy transform, which implements the above operations. For a rational, alpha = l/k with l < k, we reproduce in this manner many of the recently obtained exact results for g(l/k)(x). This approach can be also recast as an application of the Efros theorem for generalized Laplace convolutions. It relies solely on efficient definite integration. (C) 2012 American Institute of Physics. [http://dx.doi.org/10.1063/1.4709443]

Intelligence systems methodology: a systemic approach to the organizational intelligence function

Organizational intelligence can be seen as a function of the viable structure of an organization. With the integration of the Viable System Model and Soft Systems Methodology (systemic approaches of organizational management) focused on the role of the intelligence function, it is possible to elaborate a model of action with a structured methodology to prospect, select, treat and distribute information to the entire organization that improves the efficacy and efficiency of all processes. This combination of methodologies is called Intelligence Systems Methodology (ISM) whose assumptions and dynamics are delimited in this paper. The ISM is composed of two simultaneous activities: the Active Environmental Mapping and the Stimulated Action Cycle. The elaboration of the formal ISM description opens opportunities for applications of the methodology on real situations, offering a new path for this specific issue of systems thinking: the intelligence systems. Knowledge Management Research & Practice (2012) 10, 141-152. doi:10.1057/kmrp.2011.44