Calculating the Best Dual Bound for Problems with Multiple Lagrangian Relaxations

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Aggregation in the generalized transportation problem

Aggregation disaggregation is used to reduce the analysis of a large generalized transportation problem to a smaller one. Bounds for the actual difference between the aggregated objective and the original optimal value are used to quantify the error due to aggregation and estimate the quality of the aggregation. The bounds can be calculated either before optimization of the aggregated problem (a priori) or after (a posteriori). Both types of the bounds are derived and numerically compared. A computational experiment was designed to (a) study the correlation between the bounds and the actual error and (b) quantify the difference of the error bounds from the actual error. The experiment shows a significant correlation between some a priori bounds, the a posteriori bounds and the actual error. These preliminary results indicate that calculating the a priori error bound is a useful strategy to select the appropriate aggregation level, since the a priori bound varies in the same way that the actual error does. After the aggregated problem has been selected and optimized, the a posteriori bound provides a good quantitative measure for the error due to aggregation.

CONTROL OF UNCERTAIN DYNAMIC-SYSTEMS USING STRICTLY POSITIVE REAL SYSTEMS

This paper presents necessary and sufficient conditions to turn a linear time-invariant system with p outputs, m inputs, p greater-than-or-equal-to m and using only inputs and outputs measurements into a Strictly Positive Real (SPR).Two results are presented. In the first, the system compensation is made by two static compensators, one of which forward feeds the outputs and the second back feeds the outputs of the nominal system.The second result presents conditions for the Walcott and Zak variable structure observer-controller synthesis. In this problem, if the nominal system is given by {A,B,C}, then the compensated system is given by {A+GC,B,FC} where F and G are the constant compensation matrices. These results are useful in the control system with uncertainties.

Studying properties of Lagrangian bounds for many-to-many assignment problems

Classical and modified Lagrangian bounds for the optimal value of optimization problems with a double decomposable structure are studied. For the class of many-to-many assignment problems, this property of constraints is used to design a subgradient algorithm for solving the modified dual problem. Numerical results are presented to compare the quality of classical and modified bounds, as well as the properties of the corresponding Lagrangian solutions.

3D semantic models for dental education

This paper explores the benefits of using immersive and interactive virtual reality environments to teach Dentistry. We present a tool for educators to manipulate and edit virtual models. One of the main contributions is that multimedia information can be semantically associated with parts of the model, through an ontology, enriching the experience; for example, videos can be linked to each tooth demonstrating how to extract them. The use of semantic information gives a greater flexibility to the models, since filters can be applied to create temporary models that show subsets of the original data in a human friendly way. We also explain how the software was written to run in arbitrary multi-projection environments. © 2011 Springer-Verlag.

Model of a game for improving integrated decisions in production management

This paper presents the results obtained with a business game whose model represents the decision making process related to two moments at an industrial company. The first refers to the project of the industrial plant, and the second to its management. The game model was conceived so the player's first decision would establish capacity and other parameters such as quantities of each product to produce, marketing expenses, research and development, quality, advertising, salaries, if purchases will be made in installments or in cash, if there will be credit sales and how many installments will be allowed and the number of workers in the assembly area. An experiment was conducted with employees of a Brazilian company. Data obtained indicate that the players have lack of contents, especially in finances. Although these results cannot be generalized, they confirm prior results with undergraduate and graduate students and they indicate the need for reinforcement in this undergraduate area. © 2012 Springer-Verlag.

Performance evaluation of the fuzzy ARTMAP for network intrusion detection

Recently, considerable research work have been conducted towards finding fast and accurate pattern classifiers for training Intrusion Detection Systems (IDSs). This paper proposes using the so called Fuzzy ARTMAT classifier to detect intrusions in computer network. Our investigation shows, through simulations, how efficient such a classifier can be when used as the learning mechanism of a typical IDS. The promising evaluation results in terms of both detection accuracy and training duration indicate that the Fuzzy ARTMAP is indeed viable for this sort of application.

On a model for the growth of an invasive avascular tumor

This paper is devoted to study the 1D model of invasive avascular tumor growth, which takes into account cell division, death, and motility, proposed by Kolobov and collaborators in 2009. First, we examine the existence and uniqueness of the solution to this model. Second, we studied qualitatively and numerically the traveling wave solutions. Finally, we show some numerical simulations for the cell density and nutrient concentration. © 2013 NSP Natural Sciences Publishing Cor.

MR-Radix: a multi-relational data mining algorithm

Background: Once multi-relational approach has emerged as an alternative for analyzing structured data such as relational databases, since they allow applying data mining in multiple tables directly, thus avoiding expensive joining operations and semantic losses, this work proposes an algorithm with multi-relational approach. Methods: Aiming to compare traditional approach performance and multi-relational for mining association rules, this paper discusses an empirical study between PatriciaMine - an traditional algorithm - and its corresponding multi-relational proposed, MR-Radix. Results: This work showed advantages of the multi-relational approach in performance over several tables, which avoids the high cost for joining operations from multiple tables and semantic losses. The performance provided by the algorithm MR-Radix shows faster than PatriciaMine, despite handling complex multi-relational patterns. The utilized memory indicates a more conservative growth curve for MR-Radix than PatriciaMine, which shows the increase in demand of frequent items in MR-Radix does not result in a significant growth of utilized memory like in PatriciaMine. Conclusion: The comparative study between PatriciaMine and MR-Radix confirmed efficacy of the multi-relational approach in data mining process both in terms of execution time and in relation to memory usage. Besides that, the multi-relational proposed algorithm, unlike other algorithms of this approach, is efficient for use in large relational databases.