Protocols for listing threatened species can forecast extinction

Risk-ranking protocols are used widely to classify the conservation status of the world's species. Here we report on the first empirical assessment of their reliability by using a retrospective study of 18 pairs of bird and mammal species (one species extinct and the other extant) with eight different assessors. The performance of individual assessors varied substantially, but performance was improved by incorporating uncertainty in parameter estimates and consensus among the assessors. When this was done, the ranks from the protocols were consistent with the extinction outcome in 70-80% of pairs and there were mismatches in only 10-20% of cases. This performance was similar to the subjective judgements of the assessors after they had estimated the range and population parameters required by the protocols, and better than any single parameter. When used to inform subjective judgement, the protocols therefore offer a means of reducing unpredictable biases that may be associated with expert input and have the advantage of making the logic behind assessments explicit. We conclude that the protocols are useful for forecasting extinctions, although they are prone to some errors that have implications for conservation. Some level of error is to be expected, however, given the influence of chance on extinction. The performance of risk assessment protocols may be improved by providing training in the application of the protocols, incorporating uncertainty in parameter estimates and using consensus among multiple assessors, including some who are experts in the application of the protocols. Continued testing and refinement of the protocols may help to provide better absolute estimates of risk, particularly by re-evaluating how the protocols accommodate missing data.

Hybrid knowledge representation in a blackboard KBS for liquid retaining structure design

This paper highlights the importance of design expertise, for designing liquid retaining structures, including subjective judgments and professional experience. Design of liquid retaining structures has special features different from the others. Being more vulnerable to corrosion problem, they have stringent requirements against serviceability limit state of crack. It is the premise of the study to transferring expert knowledge in a computerized blackboard system. Hybrid knowledge representation schemes, including production rules, object-oriented programming, and procedural methods, are employed to express engineering heuristics and standard design knowledge during the development of the knowledge-based system (KBS) for design of liquid retaining structures. This approach renders it possible to take advantages of the characteristics of each method. The system can provide the user with advice on preliminary design, loading specification, optimized configuration selection and detailed design analysis of liquid retaining structure. It would be beneficial to the field of retaining structure design by focusing on the acquisition and organization of expert knowledge through the development of recent artificial intelligence technology. (C) 2003 Elsevier Ltd. All rights reserved.

An expert system on design of liquid-retaining structures with blackboard architecture

The design of liquid-retaining structures involves many decisions to be made by the designer based on rules of thumb, heuristics, judgement, codes of practice and previous experience. Structural design problems are often ill structured and there is a need to develop programming environments that can incorporate engineering judgement along with algorithmic tools. Recent developments in artificial intelligence have made it possible to develop an expert system that can provide expert advice to the user in the selection of design criteria and design parameters. This paper introduces the development of an expert system in the design of liquid-retaining structures using blackboard architecture. An expert system shell, Visual Rule Studio, is employed to facilitate the development of this prototype system. It is a coupled system combining symbolic processing with traditional numerical processing. The expert system developed is based on British Standards Code of Practice BS8007. Explanations are made to assist inexperienced designers or civil engineering students to learn how to design liquid-retaining structures effectively and sustainably in their design practices. The use of this expert system in disseminating heuristic knowledge and experience to practitioners and engineering students is discussed.

QRT: A Qr-based tridiagonalization algorithm for nonsymmetric matrices

The stable similarity reduction of a nonsymmetric square matrix to tridiagonal form has been a long-standing problem in numerical linear algebra. The biorthogonal Lanczos process is in principle a candidate method for this task, but in practice it is confined to sparse matrices and is restarted periodically because roundoff errors affect its three-term recurrence scheme and degrade the biorthogonality after a few steps. This adds to its vulnerability to serious breakdowns or near-breakdowns, the handling of which involves recovery strategies such as the look-ahead technique, which needs a careful implementation to produce a block-tridiagonal form with unpredictable block sizes. Other candidate methods, geared generally towards full matrices, rely on elementary similarity transformations that are prone to numerical instabilities. Such concomitant difficulties have hampered finding a satisfactory solution to the problem for either sparse or full matrices. This study focuses primarily on full matrices. After outlining earlier tridiagonalization algorithms from within a general framework, we present a new elimination technique combining orthogonal similarity transformations that are stable. We also discuss heuristics to circumvent breakdowns. Applications of this study include eigenvalue calculation and the approximation of matrix functions.

A knowledge-based system for liquid retaining structure design with blackboard architecture

Owing to the high degree of vulnerability of liquid retaining structures to corrosion problems, there are stringent requirements in its design against cracking. In this paper, a prototype knowledge-based system is developed and implemented for the design of liquid retaining structures based on the blackboard architecture. A commercially available expert system shell VISUAL RULE STUDIO working as an ActiveX Designer under the VISUAL BASIC programming environment is employed. Hybrid knowledge representation approach with production rules and procedural methods under object-oriented programming are used to represent the engineering heuristics and design knowledge of this domain. It is demonstrated that the blackboard architecture is capable of integrating different knowledge together in an effective manner. The system is tailored to give advice to users regarding preliminary design, loading specification and optimized configuration selection of this type of structure. An example of application is given to illustrate the capabilities of the prototype system in transferring knowledge on liquid retaining structure to novice engineers. (C) 2004 Elsevier Ltd. All rights reserved.

Economics and psychology in the twenty-first century

This paper begins by exploring four different possible forms of relationship between economics and psychology, which have different connotations in terms of the relative status of the two disciplines. It then focuses on the future for one of these, psychological economics. After setting out the hardcore axioms and positive and negative heuristics of a research programme in psychological economics, it explores institutional and psychological barriers to the success of such a research programme in the context of both research and teaching.

Prioritizing global conservation efforts

One of the most pressing issues facing the global conservation community is how to distribute limited resources between regions identified as priorities for biodiversity conservation(1-3). Approaches such as biodiversity hotspots(4), endemic bird areas(5) and ecoregions(6) are used by international organizations to prioritize conservation efforts globally(7). Although identifying priority regions is an important first step in solving this problem, it does not indicate how limited resources should be allocated between regions. Here we formulate how to allocate optimally conservation resources between regions identified as priorities for conservation - the 'conservation resource allocation problem'. Stochastic dynamic programming is used to find the optimal schedule of resource allocation for small problems but is intractable for large problems owing to the curse of dimensionality(8). We identify two easy- to- use and easy- to- interpret heuristics that closely approximate the optimal solution. We also show the importance of both correctly formulating the problem and using information on how investment returns change through time. Our conservation resource allocation approach can be applied at any spatial scale. We demonstrate the approach with an example of optimal resource allocation among five priority regions in Wallacea and Sundaland, the transition zone between Asia and Australasia.

Extending the theory of Owicki and Gries with asynchronous message passing

We describe an extension of the theory of Owicki and Gries (1976) to a programming language that supports asynchronous message passing based on unconditional send actions and conditional receive actions. The focus is on exploring the fitness of the extension for distributed program derivation. A number of experiments are reported, based on a running example problem, and with the aim of exploring design heuristics and of streamlining derivations and progress arguments.

FINANÇAS COMPORTAMENTAIS EM DECISÕES DE JOGOS DE EMPRESA NA GRADUAÇÃO DA UMESP

Os 799 discentes presenciais cursando entre o 5º a 8º semestre que utilizam os jogos de empresas, inclusos nas 225 empresas ativas distribuídas entre os cursos de Administração geral; Comércio exterior; Administração financeira; Ciências contábeis e Ciências econômicas no campus Rudge Ramos da Universidade Metodista de São Paulo, foram submetidos a 6 cenários virtuais, com diferentes graus de complexidade, onde suas decisões foram investigadas sob a ótica dos aspectos heurísticos, contidos em finanças comportamentais, validando a hipótese de que suas decisões não são tomadas utilizando a teoria de mercado eficiente contida nas finanças tradicionais, modelo este que pressupõe que seus agentes são racionais e maximizadores de benefícios esperados, mas as tomam através das heurísticas comportamentais de efeito certeza, reflexão e isolamento, existentes no questionário da Teoria do Prospecto, Nobel de economia em 2002 por introduzir os insights da pesquisa psicológica na ciência econômica, especialmente no que diz respeito as avaliações e tomada de decisão sob incerteza, sugerindo uma mudança na função linear da predileção de perdas à ganhos, constantes em finanças tradicionais, para uma concavidade da função utilidade para ganhos e convexas para perdas, utilizadas em heurísticas comportamentais de Kahneman e Tversky (1979). Foi também efetuada uma análise de processos das 56 empresas virtuais contidas no 1º quartil, escalonadas em ordem decrescente, gerando duas proxys de confirmação dos resultados tabulados. Foi constatado uma superestimação de resultados possíveis ao invés de resultados prováveis, demonstrando fantasias das habilidades dos jogadores, equiparáveis com os resultados de Weinstein (1980), em até 71% acreditando serem melhores do que realmente são. Além de análise Qui-Quadrática que confirmaram que os resultados da teoria do prospecto são equiprováveis e equilibrados com o trabalho original, além do Teste-t entre amostras de variâncias equivalentes que geraram significância estatística, reforçando o modelo. Também foi efetuado uma análise das decisões por gênero nas respostas, para comprovar a irrelevância proposta por Hanna, Gutter e Fan (2001) quanto a predileção e aceitação ao risco.

Finanças comportamentais: Diferenças da aversão à perda entre alunos de administração de empresas e gestão financeira

O objetivo desta dissertação é analisar aversão à perda dos estudantes do curso de administração de empresas e do curso de tecnologia em gestão financeira, usando a reprodução do trabalho desenvolvido por Kahneman e Tversky (1979). Para tanto, foi realizada uma pesquisa em campo com estudantes em uma faculdade particular, localizada da cidade de São Paulo, onde pode ser aplicado o questionário no modelo original proposto pelos pesquisadores Kahneman e Tversky (1979) e através dos resultados obtidos, foi recriada a teoria dos prospectos e constatou que um grupo de estudantes tem uma aversão à perda menor. Neste trabalho, foi feita uma revisão bibliográfica sobre as principais mudanças na área financeira desde 1920 até atualidade, destacando a Teoria sobre Finanças Modernas, a Hipótese de Mercados Eficientes, Finanças Comportamentais, Heurísticas e Teoria do Prospecto. Os resultados apontam para a existência dos efeitos certeza, reflexo e isolamento. Foi possível confirmar a existência de um comportamento diferente para o grupo de estudantes de administração. Dentre as principais conclusões, os estudantes de administração, estão reagindo de forma diferente que os estudantes de gestão financeira. A formação dos respondentes mostrou-se um fator de diferenciação entre os dois grupos. Os alunos de administração tem uma base de estudos sobre finanças menor comparada com os estudantes de gestão financeira e uma base de estudos maior em outras áreas. Esse conhecimento mais abrangente na área financeira, não trouxe nenhum diferencial para os estudantes de gestão financeira, isso pode se dar por essa amostra ser basicamente de pessoas muito jovem que acabaram de sair do ensino médio e com pouca experiência e entendimento do mercado financeiro.

A robustness framework for monitoring real options under uncertainty

This paper presents a problem structuring methodology to assess real option decisions in the face of unpredictability. Based on principles of robustness analysis and scenario planning, we demonstrate how decision-aiding can facilitate participation in projects setting and achieve effective decision making through the use of real options reasoning. We argue that robustness heuristics developed in earlier studies can be practical proxies for real options performance, hence indicators of efficient flexible planning. The developed framework also highlights how to integrate real options solutions in firms’ strategic plans and operating actions. The use of the methodology in a location decision application is provided for illustration.

Integrated analytic hierarchy process and its applications:a literature review

Due to its wide applicability and ease of use, the analytic hierarchy process (AHP) has been studied extensively for the last 20 years. Recently, it is observed that the focus has been confined to the applications of the integrated AHPs rather than the stand-alone AHP. The five tools that commonly combined with the AHP include mathematical programming, quality function deployment (QFD), meta-heuristics, SWOT analysis, and data envelopment analysis (DEA). This paper reviews the literature of the applications of the integrated AHPs. Related articles appearing in the international journals from 1997 to 2006 are gathered and analyzed so that the following three questions can be answered: (i) which type of the integrated AHPs was paid most attention to? (ii) which area the integrated AHPs were prevalently applied to? (iii) is there any inadequacy of the approaches? Based on the inadequacy, if any, some improvements and possible future work are recommended. This research not only provides evidence that the integrated AHPs are better than the stand-alone AHP, but also aids the researchers and decision makers in applying the integrated AHPs effectively.

Component scheduling for chip shooter machines: a hybrid genetic algorithm approach

A chip shooter machine for electronic component assembly has a movable feeder carrier, a movable X–Y table carrying a printed circuit board (PCB), and a rotary turret with multiple assembly heads. This paper presents a hybrid genetic algorithm (HGA) to optimize the sequence of component placements and the arrangement of component types to feeders simultaneously for a chip shooter machine, that is, the component scheduling problem. The objective of the problem is to minimize the total assembly time. The GA developed in the paper hybridizes different search heuristics including the nearest-neighbor heuristic, the 2-opt heuristic, and an iterated swap procedure, which is a new improved heuristic. Compared with the results obtained by other researchers, the performance of the HGA is superior in terms of the assembly time. Scope and purpose When assembling the surface mount components on a PCB, it is necessary to obtain the optimal sequence of component placements and the best arrangement of component types to feeders simultaneously in order to minimize the total assembly time. Since it is very difficult to obtain the optimality, a GA hybridized with several search heuristics is developed. The type of machines being studied is the chip shooter machine. This paper compares the algorithm with a simple GA. It shows that the performance of the algorithm is superior to that of the simple GA in terms of the total assembly time.

A hybrid genetic algorithm for component sequencing and feeder arrangement

This paper presents a hybrid genetic algorithm to optimize the sequence of component placements on a printed circuit board and the arrangement of component types to feeders simultaneously for a pick-and-place machine with multiple stationary feeders, a fixed board table and a movable placement head. The objective of the problem is to minimize the total travelling distance, or the travelling time, of the placement head. The genetic algorithm developed in the paper hybrisizes different search heuristics including the nearest neighbor heuristic, the 2-opt heuristic, and an iterated swap procedure, which is a new improving heuristic. Compared with the results obtained by other researchers, the performance of the hybrid genetic algorithm is superior to others in terms of the distance travelled by the placement head.

Lexical database enrichment through semi-automated morphological analysis

Derivational morphology proposes meaningful connections between words and is largely unrepresented in lexical databases. This thesis presents a project to enrich a lexical database with morphological links and to evaluate their contribution to disambiguation. A lexical database with sense distinctions was required. WordNet was chosen because of its free availability and widespread use. Its suitability was assessed through critical evaluation with respect to specifications and criticisms, using a transparent, extensible model. The identification of serious shortcomings suggested a portable enrichment methodology, applicable to alternative resources. Although 40% of the most frequent words are prepositions, they have been largely ignored by computational linguists, so addition of prepositions was also required. The preferred approach to morphological enrichment was to infer relations from phenomena discovered algorithmically. Both existing databases and existing algorithms can capture regular morphological relations, but cannot capture exceptions correctly; neither of them provide any semantic information. Some morphological analysis algorithms are subject to the fallacy that morphological analysis can be performed simply by segmentation. Morphological rules, grounded in observation and etymology, govern associations between and attachment of suffixes and contribute to defining the meaning of morphological relationships. Specifying character substitutions circumvents the segmentation fallacy. Morphological rules are prone to undergeneration, minimised through a variable lexical validity requirement, and overgeneration, minimised by rule reformulation and restricting monosyllabic output. Rules take into account the morphology of ancestor languages through co-occurrences of morphological patterns. Multiple rules applicable to an input suffix need their precedence established. The resistance of prefixations to segmentation has been addressed by identifying linking vowel exceptions and irregular prefixes. The automatic affix discovery algorithm applies heuristics to identify meaningful affixes and is combined with morphological rules into a hybrid model, fed only with empirical data, collected without supervision. Further algorithms apply the rules optimally to automatically pre-identified suffixes and break words into their component morphemes. To handle exceptions, stoplists were created in response to initial errors and fed back into the model through iterative development, leading to 100% precision, contestable only on lexicographic criteria. Stoplist length is minimised by special treatment of monosyllables and reformulation of rules. 96% of words and phrases are analysed. 218,802 directed derivational links have been encoded in the lexicon rather than the wordnet component of the model because the lexicon provides the optimal clustering of word senses. Both links and analyser are portable to an alternative lexicon. The evaluation uses the extended gloss overlaps disambiguation algorithm. The enriched model outperformed WordNet in terms of recall without loss of precision. Failure of all experiments to outperform disambiguation by frequency reflects on WordNet sense distinctions.