Predicting cave initiation and propagation

The most widely used method for predicting the onset of continuous caving is Laubscher's caving chart. A detailed examination of this method was undertaken which concluded that it had limitations which may impact on results, particularly when dealing with stronger rock masses that are outside current experience. These limitations relate to inadequate guidelines for adjustment factors to rock mass rating (RMR), concerns about the position on the chart of critical case history data, undocumented changes to the method and an inadequate number of data points to be confident of stability boundaries. A review was undertaken on the application and reliability of a numerical method of assessing cavability. The review highlighted a number of issues, which at this stage, make numerical continuum methods problematic for predicting cavability. This is in particular reference to sensitivity to input parameters that are difficult to determine accurately and mesh dependency. An extended version of the Mathews method for open stope design was developed as an alternative method of predicting the onset of continuous caving. A number of caving case histories were collected and analyzed and a caving boundary delineated statistically on the Mathews stability graph. The definition of the caving boundary was aided by the existence of a large and wide-ranging stability database from non-caving mines. A caving rate model was extrapolated from the extended Mathews stability graph but could only be partially validated due to a lack of reliable data.

The tree cut and merge algorithm for estimation of network reliability

This article presents Monte Carlo techniques for estimating network reliability. For highly reliable networks, techniques based on graph evolution models provide very good performance. However, they are known to have significant simulation cost. An existing hybrid scheme (based on partitioning the time space) is available to speed up the simulations; however, there are difficulties with optimizing the important parameter associated with this scheme. To overcome these difficulties, a new hybrid scheme (based on partitioning the edge set) is proposed in this article. The proposed scheme shows orders of magnitude improvement of performance over the existing techniques in certain classes of network. It also provides reliability bounds with little overhead.

Decompositions of complete graphs into theta graphs with fewer than ten edges

A theta graph is a graph consisting of three pairwise internally disjoint paths with common end points. Methods for decomposing the complete graph K-nu into theta graphs with fewer than ten edges are given.

Mapping the royal road and other hierarchical functions

In this paper we present a technique for visualising hierarchical and symmetric, multimodal fitness functions that have been investigated in the evolutionary computation literature. The focus of this technique is on landscapes in moderate-dimensional, binary spaces (i.e., fitness functions defined over {0, 1}(n), for n less than or equal to 16). The visualisation approach involves an unfolding of the hyperspace into a two-dimensional graph, whose layout represents the topology of the space using a recursive relationship, and whose shading defines the shape of the cost surface defined on the space. Using this technique we present case-study explorations of three fitness functions: royal road, hierarchical-if-and-only-if (H-IFF), and hierarchically decomposable functions (HDF). The visualisation approach provides an insight into the properties of these functions, particularly with respect to the size and shape of the basins of attraction around each of the local optima.

Estudo do efeito da adição de gás condensado sobre o ponto de fluidez e a viscosidade de petróleos pesados

Neste trabalho foi estudado o comportamento de quatro óleos pesados, com densidade API variando de 13,7 a 21,6, frente à adição de gás condensado, com o objetivo de se obter informações relevantes para o processo de escoamento destes óleos. Assim, foi analisado o comportamento da densidade à 20 °C, pontos de fluidez máximo e mínimo, e viscosidade dinâmica à 50 °C dos óleos contendo diferentes concentrações de gás condensado. Também foi analisado o efeito da variação da temperatura sobre a viscosidade dos óleos crus, e, adicionalmente, após o estudo do efeito do gás condensado sobre os óleos, foi avaliado o comportamento da viscosidade dinâmica dos mesmos com a adição de diferentes solventes orgânicos (querosene, aguarrás e tolueno). Os resultados obtidos indicaram que o gás condensado foi eficiente para a redução da densidade, dos pontos de fluidez máximo e mínimo e da viscosidade dos quatros óleos analisados. O óleo A apresentou uma taxa de decaimento da densidade mais baixa do que os outros óleos e foi o que apresentou o comportamento mais próximo de mistura ideal. A amostra de óleo mais pesada (óleo D) foi a que apresentou as maiores variações nos valores dos pontos de fluidez máximo e mínimo com a adição de condensado, chegando a reduzir um total de 19 °C no ponto de fluidez máximo e um total de 21 °C no ponto de fluidez mínimo com a adição de apenas 10,7% v/v de gás condensado. Nos resultados obtidos nas análises da viscosidade dinâmica observou-se que a grande maioria das misturas preparadas apresentou um comportamento de fluido newtoniano. Todas as amostras apresentaram uma notável diminuição da sua viscosidade, chegando a atingir valores percentuais de redução de viscosidade que variaram entre 75 e 91%, na concentração de 14% v/v de gás condensado. A partir desta concentração a viscosidade continua a decair, porém de forma mais atenuada, e o uso do condensado acima desta concentração pode significar gastos desnecessários com o solvente com a finalidade de se reduzir a viscosidade de óleos pesados. O óleo D foi o que apresentou os maiores percentuais de redução da viscosidade enquanto o óleo B foi o que apresentou os mais baixos valores. Comparando o gás condensado aos outros três solventes orgânicos testados, o condensado apresentou um comportamento bem semelhante ao tolueno quando analisadas as suas capacidades de redução da viscosidade dos óleos estudados.

Perfil do manejo da cultura de milho no sudoeste do Paraná

Esse trabalho teve por objetivo caracterizar o sistema produtivo da cultura do milho no sudoeste do Paraná, para subsidiar programas de Pesquisa & Desenvolvimento, além de transferência de tecnologias regionais. A pesquisa foi realizada durante os anos de 2007 e 2008, sendo baseada na aplicação de um questionário para 305 produtores de milho e residentes em alguns municípios da região sudoeste do Paraná. Os questionários possuíam questões referentes às características do manejo da cultura e sobre a propriedade rural. Verificou-se que muitos agricultores não realizam todas as práticas adequadas de manejo, necessárias para um desenvolvimento sustentável da cultura do milho. Os principais manejos que interferem na produção de milho são a deficiência hídrica e controle de plantas daninhas, pragas e doenças. Como aspectos positivos aparece a aquisição de sementes certificadas pela maioria dos agricultores; porém, o nível tecnológico não acompanha as exigências genéticas das bases genéticas dos híbridos mais escolhidos pelos agricultores. Contudo, os agricultores estão interessados na realização de cursos de capacitação e na integração com a Universidade e com os órgãos de extensão.

GUI Inspection from Source Code Analysis

Graphical user interfaces (GUIs) are critical components of todays software. Given their increased relevance, correctness and usability of GUIs are becoming essential. This paper describes the latest results in the development of our tool to reverse engineer the GUI layer of interactive computing systems. We use static analysis techniques to generate models of the user interface behaviour from source code. Models help in graphical user interface inspection by allowing designers to concentrate on its more important aspects. One particularly type of model that the tool is able to generate is state machines. The paper shows how graph theory can be useful when applied to these models. A number of metrics and algorithms are used in the analysis of aspects of the user interface's quality. The ultimate goal of the tool is to enable analysis of interactive system through GUIs source code inspection.

Program slicing by calculation

Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful in the areas of reverse engineering, program understanding, testing and software maintenance. Most slicing methods, usually oriented towards the imperative or object paradigms, are based on some sort of graph structure representing program dependencies. Slicing techniques amount, therefore, to (sophisticated) graph transversal algorithms. This paper proposes a completely different approach to the slicing problem for functional programs. Instead of extracting program information to build an underlying dependencies’ structure, we resort to standard program calculation strategies, based on the so-called Bird-Meertens formalism. The slicing criterion is specified either as a projection or a hiding function which, once composed with the original program, leads to the identification of the intended slice. Going through a number of examples, the paper suggests this approach may be an interesting, even if not completely general, alternative to slicing functional programs

Discovering coordination patterns

A large and growing amount of software systems rely on non-trivial coordination logic for making use of third party services or components. Therefore, it is of outmost importance to understand and capture rigorously this continuously growing layer of coordination as this will make easier not only the veri cation of such systems with respect to their original speci cations, but also maintenance, further development, testing, deployment and integration. This paper introduces a method based on several program analysis techniques (namely, dependence graphs, program slicing, and graph pattern analysis) to extract coordination logic from legacy systems source code. This process is driven by a series of pre-de ned coordination patterns and captured by a special purpose graph structure from which coordination speci cations can be generated in a number of di erent formalisms

Slicing for architectural analysis

Current software development often relies on non-trivial coordination logic for combining autonomous services, eventually running on different platforms. As a rule, however, such a coordination layer is strongly woven within the application at source code level. Therefore, its precise identification becomes a major methodological (and technical) problem and a challenge to any program understanding or refactoring process. The approach introduced in this paper resorts to slicing techniques to extract coordination data from source code. Such data are captured in a specific dependency graph structure from which a coordination model can be recovered either in the form of an Orc specification or as a collection of code fragments corresponding to the identification of typical coordination patterns in the system. Tool support is also discussed

Domain-Specific Language for Coordination patterns

The integration and composition of software systems requires a good architectural design phase to speed up communications between (remote) components. However, during implementation phase, the code to coordinate such components often ends up mixed in the main business code. This leads to maintenance problems, raising the need for, on the one hand, separating the coordination code from the business code, and on the other hand, providing mechanisms for analysis and comprehension of the architectural decisions once made. In this context our aim is at developing a domain-specific language, CoordL, to describe typical coordination patterns. From our point of view, coordination patterns are abstractions, in a graph form, over the composition of coordination statements from the system code. These patterns would allow us to identify, by means of pattern-based graph search strategies, the code responsible for the coordination of the several components in a system. The recovering and separation of the architectural decisions for a better comprehension of the software is the main purpose of this pattern language

The role of coordination analysis in software integration projects

What sort of component coordination strategies emerge in a software integration process? How can such strategies be discovered and further analysed? How close are they to the coordination component of the envisaged architectural model which was supposed to guide the integration process? This paper introduces a framework in which such questions can be discussed and illustrates its use by describing part of a real case-study. The approach is based on a methodology which enables semi-automatic discovery of coordination patterns from source code, combining generalized slicing techniques and graph manipulation

Slicing functional programs by calculation

Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful in the areas of reverse engineering, program understanding, testing and software maintenance. Most slicing methods, usually targeting either the imperative or the object oriented paradigms, are based on some sort of graph structure representing program dependencies. Slicing techniques amount, therefore, to (sophisticated) graph transversal algorithms. This paper proposes a completely different approach to the slicing problem for functional programs. Instead of extracting program information to build an underlying dependencies’ structure, we resort to standard program calculation strategies, based on the so-called Bird- Meertens formalism. The slicing criterion is specified either as a projection or a hiding function which, once composed with the original program, leads to the identification of the intended slice. Going through a number of examples, the paper suggests this approach may be an interesting, even if not completely general alternative to slicing functional programs

Analysis of computing open source systems

Graphical user interfaces (GUIs) are critical components of today's open source software. Given their increased relevance, the correctness and usability of GUIs are becoming essential. This paper describes the latest results in the development of our tool to reverse engineer the GUI layer of interactive computing open source systems. We use static analysis techniques to generate models of the user interface behavior from source code. Models help in graphical user interface inspection by allowing designers to concentrate on its more important aspects. One particular type of model that the tool is able to generate is state machines. The paper shows how graph theory can be useful when applied to these models. A number of metrics and algorithms are used in the analysis of aspects of the user interface's quality. The ultimate goal of the tool is to enable analysis of interactive system through GUIs source code inspection.