Patents by Inventor Mauricio Guilherme de Carvalho Resende
Mauricio Guilherme de Carvalho Resende has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 8730817Abstract: Methods and apparatus to determine network link weights are disclosed. An example method disclosed herein to determine link weights for routing in a communication network comprises iteratively updating a plurality of vectors using a genetic algorithm, the vectors including a plurality of individual values decodable into possible link weights, and decoding a first one of the vectors updated using the genetic algorithm into a first plurality of link weights providing a possible routing of a load through the communication network, the load to be split among a plurality of paths having respective path lengths determined from the plurality of link weights, at least two of the paths having different path lengths.Type: GrantFiled: December 7, 2010Date of Patent: May 20, 2014Assignees: AT&T Intellectual Property I, L.P., Universidade Federal do Rio Grande do sul—UFRGSInventors: Mauricio Guilherme de Carvalho Resende, Luciana Salete Buriol, Roger S. Reis, Marcus Ritt
-
Patent number: 8693871Abstract: A method for routing and wavelength assignment (RWA) in an optical network with improved heuristics for reducing the computational times required for the RWA. The method minimizes the number of wavelengths by packing the lightpaths using a minimum number of bins in a bin packing problem. Computational efficiency is enhanced by using several novel methods to determine shortest paths and eliminate arcs in a graph that represents the network topology.Type: GrantFiled: December 23, 2008Date of Patent: April 8, 2014Assignee: AT&T Intellectual Property I, L.P.Inventors: Mauricio Guilherme de Carvalho Resende, Thiago Ferreira de Noronha, Celso C. Ribeiro
-
Patent number: 8468043Abstract: Methods, systems, and products determine minimum cost networks. A k-fold coverage formulation is applied to potential network elements having cost and coverage parameters. Iterative heuristics are used to find an optimal solution to the k-set coverage formulation. The approximate solutions to the k-set coverage formulation are then used to select at least some of the potential network elements for use in a minimum cost network.Type: GrantFiled: April 13, 2009Date of Patent: June 18, 2013Assignee: AT&T Intellectual Property I, L.P.Inventors: Mauricio Guilherme de Carvalho Resende, Celso Carneiro Ribeiro, Luciana de Souza Pessôa
-
Publication number: 20120140636Abstract: Methods and apparatus to determine network link weights are disclosed. An example method disclosed herein to determine link weights for routing in a communication network comprises iteratively updating a plurality of vectors using a genetic algorithm, the vectors including a plurality of individual values decodable into possible link weights, and decoding a first one of the vectors updated using the genetic algorithm into a first plurality of link weights providing a possible routing of a load through the communication network, the load to be split among a plurality of paths having respective path lengths determined from the plurality of link weights, at least two of the paths having different path lengths.Type: ApplicationFiled: December 7, 2010Publication date: June 7, 2012Inventors: Mauricio Guilherme de Carvalho Resende, Luciana Salete Buriol, Roger S. Reis, Marcus Ritt
-
Patent number: 8185655Abstract: Methods, systems, and computer-readable media for maximizing diversity in a subset of elements selected from a set of elements are provided. An algorithm that combines the GRASP and path relinking heuristics is utilized to find an approximate solution to a max-min diversity problem modeled from the set of elements. The GRASP heuristic is applied to the set of elements for a number of iterations to generate a set of feasible solutions, and a best solution is determined from the set. The path relinking heuristic is then applied between a pair of solutions in the set of feasible solutions to generate a candidate solution. If the candidate solution is better than the best solution, then the best solution is replaced with the candidate solution, and the process is repeated until the path relinking heuristic has been applied between each pair of solutions in the set of feasible solutions.Type: GrantFiled: December 3, 2008Date of Patent: May 22, 2012Assignee: AT&T Intellectual Property I, L.P.Inventors: Mauricio Guilherme de Carvalho Resende, Abraham Duarte, Micael Gallego, Rafael Martí
-
Patent number: 8139502Abstract: A method of transforming an ordered list of nodes of a network into one of a plurality of elite ordered lists, the ordered list corresponding to a deloading sequence, the deloading sequence including a temporary capacity requirement, each of the elite ordered lists corresponding to an elite deloading sequence including an elite temporary capacity requirement by generating at least one intermediate ordered list corresponding to an intermediate deloading sequence including an intermediate temporary capacity requirement, selecting one of the intermediate ordered list and the ordered list based on a comparison of the intermediate temporary capacity requirement and the temporary capacity requirement and replacing one of the elite ordered lists with the one of the intermediate ordered list and the ordered list if a value corresponding to one of the intermediate temporary capacity requirement and the temporary capacity requirement is less than a lowest value of the elite temporary capacity requirements.Type: GrantFiled: December 31, 2007Date of Patent: March 20, 2012Assignee: AT & T Intellectual Property I, LPInventors: Mauricio Guilherme de Carvalho Resende, Diogo Vieira Andrade
-
Patent number: 8098679Abstract: A method and apparatus for composite link assignment are provided such that network capacity is sufficient to handle all the traffic (e.g., load) while an objective function, e.g., the total cost of the capacity is minimized. The present method receives a plurality of weights for a plurality of arcs and a load for the network. An objective function is selected for minimization, where the present method then determines the composite link assignment to handle the load while the objective function is minimized. In one embodiment, the composite link assignment comprises a plurality of different link types for the plurality of arcs.Type: GrantFiled: October 2, 2009Date of Patent: January 17, 2012Assignee: AT&T Intellectual Propery II, L.P.Inventors: Diogo Andrade, Luciana Buriol, Mauricio Guilherme de Carvalho Resende, Mikkel Thorup
-
Patent number: 7978629Abstract: A method determines an optimal or near-optimal conveyance network layout in which revenue from serviced customer locations is maximized while the cost of installing and/or maintaining the conveyance is minimized. The conveyance may, for example, be a fiber optic telecommunications cable or a power or utility distribution system. Algorithms in the method generate primal and dual bounds in a Prize-Collecting Steiner Tree Problem in Graphs (PCSPG). Those algorithms originate from a Lagrangian Non-Delayed Relax-and-Cut (NDRC) based approach and incorporate ingredients such as a new PCSPG reduction test, an effective Local Search procedure and a modification in the NDRC framework that allows additional reductions in duality gaps to be attained.Type: GrantFiled: February 23, 2009Date of Patent: July 12, 2011Assignee: AT&T Intellectual Property I, L.P.Inventors: Mauricio Guilherme De Carvalho Resende, Alexandre Salles da Cunha, Abilio Lucena, Nelson Maculan
-
Patent number: 7974816Abstract: Disclosed are method and apparatus for registering multiple sensors collecting data from multiple objects. Sensor registration is decomposed into a two-step procedure. The first step corrects systematic errors. The second step assigns objects measured by one sensor to objects measured by a second sensor. Systematic errors are corrected by generating the global minimum of a systematic error function. One embodiment for generating the global minimum uses a Continuous Greedy Randomized Adaptive Search Procedure.Type: GrantFiled: December 2, 2009Date of Patent: July 5, 2011Assignees: AT&T Intellectual Property II, L.P., Raytheon Company, University of Florida Research Foundation, Inc.Inventors: Mauricio Guilherme de Carvalho Resende, Michael Jacob Hirsch, Panagote Miltiades Pardalos
-
Patent number: 7924729Abstract: In one method for determining a minimum cost solution for resolving a covering-by-pairs problem, a plurality of covering nodes, a plurality of branch nodes, and a plurality of edges connecting the covering nodes and the branch nodes are given. A plurality of vectors are generated. For each vector in the plurality of vectors, it is determined whether the selected covering nodes cover the branch nodes. Responsive to determining that the selected covering nodes do not cover the branch nodes, each vector is completed so that the selected covering nodes cover the branch nodes. Responsive to determining that selected covering nodes cover the branch nodes or to completing the vector, redundant covering nodes are removed from each vector. The vectors are inserted into a current population. A new population is generated by evolving the current population for at least one generation.Type: GrantFiled: November 25, 2008Date of Patent: April 12, 2011Assignee: AT&T Intellectual Property I, L.P.Inventor: Mauricio Guilherme de Carvalho Resende
-
Patent number: 7826607Abstract: Certain exemplary embodiments can comprise a method that can comprise automatically modifying a schedule of a transfer of a plurality of groups of units from a first system to a second system. The method can comprise performing one or more recursive neighborhood searches on the schedule. The schedule can be determined initially via iterative determinations of a next unit to be transferred as a unit with a relatively low determined value of an objective function.Type: GrantFiled: April 4, 2006Date of Patent: November 2, 2010Assignee: AT & T Intellectual Property II, L.P.Inventors: Mauricio Guilherme de Carvalho Resende, Diogo Vieira Andrade
-
Publication number: 20100261481Abstract: Minimum cost networks, such as cellular networks, able to supply k-fold coverage to users, are obtained by defining potential network elements having cost and coverage parameters, and selecting from these available network elements using an iterative approximation method or system that first constructs a k-set coverage formulation incorporating the cost and coverage parameters of the available network elements, and then finds an optimal solution to the k-set coverage formulation using applications of GRASP (greedy randomized adaptive search procedure) and path-relinking heuristics. In one version, GRASP and path-relinking start from a random choice of a network element and build feasible solutions using greedy construction, local search and path-relinking heuristics that are iteratively applied to find an approximate solution.Type: ApplicationFiled: April 13, 2009Publication date: October 14, 2010Inventors: Mauricio Guilherme de Carvalho Resende, Celso Carneiro Ribeiro, Luciana de Souza Pessoa
-
Publication number: 20100214957Abstract: A method determines an optimal or near-optimal conveyance network layout in which revenue from serviced customer locations is maximized while the cost of installing and/or maintaining the conveyance is minimized. The conveyance may, for example, be a fiber optic telecommunications cable or a power or utility distribution system. Algorithms in the method generate primal and dual bounds in a Prize-Collecting Steiner Tree Problem in Graphs (PCSPG). Those algorithms originate from a Lagrangian Non-Delayed Relax-and-Cut (NDRC) based approach and incorporate ingredients such as a new PCSPG reduction test, an effective Local Search procedure and a modification in the NDRC framework that allows additional reductions in duality gaps to be attained.Type: ApplicationFiled: February 23, 2009Publication date: August 26, 2010Inventors: Mauricio Guilherme De Carvalho Resende, Alexandre Salles da Cunha, Abilio Lucena, Nelson Maculan
-
Publication number: 20100158528Abstract: A method for routing and wavelength assignment (RWA) in an optical network with improved heuristics for reducing the computational times required for the RWA. The method minimizes the number of wavelengths by packing the lightpaths using a minimum number of bins in a bin packing problem. Computational efficiency is enhanced by using several novel methods to determine shortest paths and eliminate arcs in a graph that represents the network topology.Type: ApplicationFiled: December 23, 2008Publication date: June 24, 2010Inventors: Mauricio Guilherme de Carvalho Resende, Thiago Ferreira de Noronha, Celso C. Ribeiro
-
Publication number: 20100138373Abstract: Methods, systems, and computer-readable media for maximizing diversity in a subset of elements selected from a set of elements are provided. An algorithm that combines the GRASP and path relinking heuristics is utilized to find an approximate solution to a max-min diversity problem modeled from the set of elements. The GRASP heuristic is applied to the set of elements for a number of iterations to generate a set of feasible solutions, and a best solution is determined from the set. The path relinking heuristic is then applied between a pair of solutions in the set of feasible solutions to generate a candidate solution. If the candidate solution is better than the best solution, then the best solution is replaced with the candidate solution, and the process is repeated until the path relinking heuristic has been applied between each pair of solutions in the set of feasible solutions.Type: ApplicationFiled: December 3, 2008Publication date: June 3, 2010Inventors: Mauricio Guilherme de Carvalho Resende, Abraham Duarte, Micael Gallego, Rafael Marti
-
Publication number: 20100128609Abstract: In one method for determining a minimum cost solution for resolving a covering-by-pairs problem, a plurality of covering nodes, a plurality of branch nodes, and a plurality of edges connecting the covering nodes and the branch nodes are given. A plurality of vectors are generated. For each vector in the plurality of vectors, it is determined whether the selected covering nodes cover the branch nodes. Responsive to determining that the selected covering nodes do not cover the branch nodes, each vector is completed so that the selected covering nodes cover the branch nodes. Responsive to determining that selected covering nodes cover the branch nodes or to completing the vector, redundant covering nodes are removed from each vector. The vectors are inserted into a current population. A new population is generated by evolving the current population for at least one generation.Type: ApplicationFiled: November 25, 2008Publication date: May 27, 2010Inventor: Mauricio Guilherme de Carvalho Resende
-
Publication number: 20100076726Abstract: Disclosed are method and apparatus for registering multiple sensors collecting data from multiple objects. Sensor registration is decomposed into a two-step procedure. The first step corrects systematic errors. The second step assigns objects measured by one sensor to objects measured by a second sensor. Systematic errors are corrected by generating the global minimum of a systematic error function. One embodiment for generating the global minimum uses a Continuous Greedy Randomized Adaptive Search Procedure.Type: ApplicationFiled: December 2, 2009Publication date: March 25, 2010Applicants: AT&T INTELLECTUAL PROPERTY II, L.P., UNIVERSITY OF FLORIDA RESEARCH FOUNDATION, INC., RAYTHEON COMPANYInventors: Mauricio Guilherme de Carvalho Resende, Michael Jacob Hirsch, Panagote Miltiades Pardalos
-
Patent number: 7653513Abstract: Disclosed are method and apparatus for registering multiple sensors collecting data from multiple objects. Sensor registration is decomposed into a two-step procedure. The first step corrects systematic errors. The second step assigns objects measured by one sensor to objects measured by a second sensor. Systematic errors are corrected by generating the global minimum of a systematic error function. One embodiment for generating the global minimum uses a Continuous Greedy Randomized Adaptive Search Procedure.Type: GrantFiled: June 20, 2007Date of Patent: January 26, 2010Assignees: AT&T Intellectual Property II, L.P., University of Florida Research Foundation, Inc., Raytheon CompanyInventors: Mauricio Guilherme de Carvalho Resende, Michael Jacob Hirsch, Panagote Miltiades Pardalos
-
Patent number: 7599385Abstract: A method and apparatus for composite link assignment are provided such that network capacity is sufficient to handle all the traffic (e.g., load) while an objective function, e.g., the total cost of the capacity is minimized. The present method receives a plurality of weights for a plurality of arcs and a load for the network. An objective function is selected for minimization, where the present method then determines the composite link assignment to handle the load while the objective function is minimized. In one embodiment, the composite link assignment comprises a plurality of different link types for the plurality of arcs.Type: GrantFiled: June 12, 2006Date of Patent: October 6, 2009Assignee: AT&T Corp.Inventors: Diogo Andrade, Luciana Buriol, Mauricio Guilherme de Carvalho Resende, Mikkel Thorup
-
Patent number: 7593341Abstract: A method and apparatus for updating a shortest path graph or a shortest path tree are disclosed. For example, an arc weight is changed for an arc in the network, where a plurality of affected nodes in the network is determined. The distance of each of the affected nodes is determined, where a subset of the plurality of affected nodes is then placed in a heap. One aspect of the present invention is that not all the affected nodes are placed in the heap. In one embodiment, the present reduced heap approach only applies the Dijkstra's algorithm to those affected nodes whose distances change in a smaller amount that the change in the arc weight. In turn, the shortest path graph or the shortest path tree is updated in accordance with the affected nodes placed in the heap.Type: GrantFiled: June 8, 2006Date of Patent: September 22, 2009Assignee: AT&T Corp.Inventors: Luciana Buriol, Mauricio Guilherme de Carvalho Resende, Mikkel Thorup