Uma técnica híbrida para geração de rotas em espaço geográfico com obstáculos.

Este trabalho está inserido no campo da Geomática e se concentra, mais especificamente, no estudo de métodos para exploração e seleção de rotas em espaços geográficos sem delimitação prévia de vias trafegáveis. As atividades que poderiam se beneficiar de estudos desse tipo estão inseridas em áreas da engenharia, logística e robótica. Buscou-se, com as pesquisas realizadas nesse trabalho, elaborar um modelo computacional capaz de consultar as informações de um terreno, explorar uma grande quantidade de rotas viáveis e selecionar aquelas rotas que oferecessem as melhores condições de trajetória entre dois pontos de um mapa. Foi construído um sistema a partir do modelo computacional proposto para validar sua eficiência e aplicabilidade em diferentes casos de estudo. Para que esse sistema fosse construído, foram combinados conceitos de sistemas baseados em agentes, lógica nebulosa e planejamento de rotas em robótica. As informações de um terreno foram organizadas, consumidas e apresentadas pelo sistema criado, utilizando mapas digitais. Todas as funcionalidades do sistema foram construídas por meio de software livre. Como resultado, esse trabalho de pesquisa disponibiliza um sistema eficiente para o estudo, o planejamento ou a simulação de rotas sobre mapas digitais, a partir de um módulo de inferência nebuloso aplicado à classificação de rotas e um módulo de exploração de rotas baseado em agentes autônomos. A perspectiva para futuras aplicações utilizando o modelo computacional apresentado nesse trabalho é bastante abrangente. Acredita-se que, a partir dos resultados alcançados, esse sistema possa ajudar a reduzir custos e automatizar equipamentos em diversas atividades humanas.

Design and optimization of planar mesa termination for diamond Schottky barrier diodes

In this paper, we present planar mesa termination structure with high k dielectric Al2O3 for high-voltage diamond Schottky barrier diode. Analysis, design, and optimization are carried out by simulations using finite element technology computer-aided design (TCAD) Sentaurus Device software. The performances of planar mesa termination structure are compared to those of conventional field plate termination structure. It is found that optimum geometry of planar mesa terminated diode requires shorter metal plate extension (1/3 of the field plate terminated diode). Consequently, planar mesa terminated diode can be designed with bigger Schottky contact to increase its current carrying capability. Breakdown performance of field plate termination structure is limited at 1480 V due to peak electric field at the corner of Schottky contact (no oxide breakdown occurs). In contrast, peak electric field in planar mesa termination structure only occurs in the field oxide such that its breakdown performance is highly dependent on the oxide material. Due to Al2O3 breakdown, planar mesa termination structure suffers premature breakdown at 1440 V. Considering no oxide breakdown occurs, planar mesa termination structure can realize higher breakdown voltage of 1751 V. Therefore, to fully realize the potential of planar mesa terminated diode, it is important to choose suitable high k dielectric material with sufficient breakdown electric field for the field oxide. © 2013 Elsevier B.V.

基于ISO9000的软件质量保证模型

IEEE; IEEE Computer Society; IEEE Computer Society Technical Council on Software Engineering

effect of staffing pattern on software project: an empirical analysis

Univ SE Calif, Ctr Syst & Software Engn, ABB, Microsoft Res, IEEE, ACMSIGSOFT, N Carolina State Univ Comp Sci

the role of software process simulation modeling in software risk management: a systematic review

Univ SE Calif, Ctr Syst & Software Engn, ABB, Microsoft Res, IEEE, ACMSIGSOFT, N Carolina State Univ Comp Sci

Behavioral responses of tilapia (Oreochromis niloticus) to acute fluctuations in dissolved oxygen levels as monitored by computer vision

Behavioral and ventilatory parameters have the possibility of predicting the stress state of fish in vivo and in situ. This paper presents a new image-processing algorithm for quantifying the average swimming speed of a fish school in an aquarium. This method is based on the alteration in projected area caused by the movement of individual fish during frame sequences captured at given time intervals. The image enhancement method increases the contrast between fish and background, and is thus suitable for use in turbid aquaculture water. Behavioral parameters (swimming activity and distribution parameters) and changes in ventilation frequency (VF) of tilapia (Oreochromis niloticus) responded to acute fluctuations in dissolved oxygen (DO) which were monitored continuously in the course of normoxia, falling DO level, maintenance of hypoxia (three levels of 1.5, 0.8 and 0.3 mg l(-1)) and subsequent recovery to normoxia. These parameters responded sensitively to acute variations in DO level; they displayed significant changes (P < 0.05) during severe hypoxia (0.8 and 0.3 mg l(-1) level) compared with normoxic condition, but there was no significant difference under conditions of mild hypoxia (1.5 mg l(-1) level). There was no significant difference in VF between two levels of severe hypoxia 0.8 and 0.3 mg l(-1) level during the low DO condition. The activity and distribution parameters displayed distinguishable differences between the 0.8 and 0.3 mg l(-1) levels. The behavioral parameters are thus capable of distinguishing between different degrees of severe hypoxia, though there were relatively large fluctuations. (c) 2006 Elsevier B.V. All rights reserved.

用计算机辅助创新软件解决产品技术创新问题的研究

本文简要介绍了发明问题解决理论TRIZ和机算机辅助创新软件Pro/Innovator的主要内容,建立了基于创新理论TRIZ和CAI软件的创新问题解决流程模型,作为特例建立了Pro/Innovator1.0的简化流程图,最后用软件完成了一个工程实例问题的创新设计。

CIMS信息集成环境下轧钢企业财务管理系统的实现

以鞍钢冷轧厂计算机集成制造系统开发为背景 ,介绍了基于Client/Server方式 ,以OR ACLE为后台数据库的财务管理系统的设计与实现。运用软件工程和数据库理论 ,结合ORACLERDBMS的特点 ,并对实现方法做了比较全面地论述。最后 ,探讨了通向财务信息集成的途径

The Definition and Implementation of a Computer Programming Language Based on Constraints

The constraint paradigm is a model of computation in which values are deduced whenever possible, under the limitation that deductions be local in a certain sense. One may visualize a constraint 'program' as a network of devices connected by wires. Data values may flow along the wires, and computation is performed by the devices. A device computes using only locally available information (with a few exceptions), and places newly derived values on other, locally attached wires. In this way computed values are propagated. An advantage of the constraint paradigm (not unique to it) is that a single relationship can be used in more than one direction. The connections to a device are not labelled as inputs and outputs; a device will compute with whatever values are available, and produce as many new values as it can. General theorem provers are capable of such behavior, but tend to suffer from combinatorial explosion; it is not usually useful to derive all the possible consequences of a set of hypotheses. The constraint paradigm places a certain kind of limitation on the deduction process. The limitations imposed by the constraint paradigm are not the only one possible. It is argued, however, that they are restrictive enough to forestall combinatorial explosion in many interesting computational situations, yet permissive enough to allow useful computations in practical situations. Moreover, the paradigm is intuitive: It is easy to visualize the computational effects of these particular limitations, and the paradigm is a natural way of expressing programs for certain applications, in particular relationships arising in computer-aided design. A number of implementations of constraint-based programming languages are presented. A progression of ever more powerful languages is described, complete implementations are presented and design difficulties and alternatives are discussed. The goal approached, though not quite reached, is a complete programming system which will implicitly support the constraint paradigm to the same extent that LISP, say, supports automatic storage management.

Issues in the Design and Implementation of Act 2

Act2 is a highly concurrent programming language designed to exploit the processing power available from parallel computer architectures. The language supports advanced concepts in software engineering, providing high-level constructs suitable for implementing artificially-intelligent applications. Act2 is based on the Actor model of computation, consisting of virtual computational agents which communicate by message-passing. Act2 serves as a framework in which to integrate an actor language, a description and reasoning system, and a problem-solving and resource management system. This document describes issues in Act2's design and the implementation of an interpreter for the language.

Computer technology in detection and staging of prostate carcinoma: a review

Y. Zhu, S. Williams and R. Zwiggelaar, 'Computer technology in detection and staging of prostate carcinoma: a review', Medical Image Analysis 10 (2), 178-199 (2006)

A cognitive approach to identifying measurable milestones for programming skill acquisition

Mead, J., Gray, S., Hamer, J., James, R., Sorva, J., Clair, C. S., and Thomas, L. 2006. A cognitive approach to identifying measurable milestones for programming skill acquisition. SIGCSE Bull. 38, 4 (Dec. 2006), 182-194.