A Unified Approach to Encoding and Classification Using Bimodal Projection-Based Features

In general the objective of accurately encoding the input data and the objective of extracting good features to facilitate classification are not consistent with each other. As a result, good encoding methods may not be effective mechanisms for classification. In this paper, an earlier proposed unsupervised feature extraction mechanism for pattern classification has been extended to obtain an invertible map. The method of bimodal projection-based features was inspired by the general class of methods called projection pursuit. The principle of projection pursuit concentrates on projections that discriminate between clusters and not faithful representations. The basic feature map obtained by the method of bimodal projections has been extended to overcome this. The extended feature map is an embedding of the input space in the feature space. As a result, the inverse map exists and hence the representation of the input space in the feature space is exact. This map can be naturally expressed as a feedforward neural network.

Effective contrast recovery in rapid dynamic near-infrared diffuse optical tomography using l(1)-norm-based linear image reconstruction method

Traditional image reconstruction methods in rapid dynamic diffuse optical tomography employ l(2)-norm-based regularization, which is known to remove the high-frequency components in the reconstructed images and make them appear smooth. The contrast recovery in these type of methods is typically dependent on the iterative nature of method employed, where the nonlinear iterative technique is known to perform better in comparison to linear techniques (noniterative) with a caveat that nonlinear techniques are computationally complex. Assuming that there is a linear dependency of solution between successive frames resulted in a linear inverse problem. This new framework with the combination of l(1)-norm based regularization can provide better robustness to noise and provide better contrast recovery compared to conventional l(2)-based techniques. Moreover, it is shown that the proposed l(1)-based technique is computationally efficient compared to its counterpart (l(2)-based one). The proposed framework requires a reasonably close estimate of the actual solution for the initial frame, and any suboptimal estimate leads to erroneous reconstruction results for the subsequent frames.

PROTEIN DISULFIDE ANALYSIS AND DESIGN

The significant contribution of naturally occurring disulfide bonds to protein stability has encouraged development of methods to engineer non-native disulfides in proteins. These have yielded mixed results. We summarize applications of the program MODIP for disulfide engineering. The program predicts sites in proteins where disulfides can be stably introduced. The program has also been used as an aid in conformational analysis of naturally occurring disulfides in a-helices, antiparallel and parallel beta-strands. Disulfides in a-helices occur only at N-termini, where the first cysteine residue is the N-cap residue of the helix. The disulfide occurs as a CXXC motif and can possess redox activity. In antiparallel beta-strands, disulfides occur exclusively at non-hydrogen bonded (NHB) registered pairs of antiparallel beta-sheets with only 1 known natural example occurring at a hydrogen bonded (HB) registered pair. Conformational analysis suggests that disulfides between HB residue pairs are under torsional strain. A similar analysis to characterize disulfides in parallel beta-strands was carried out. We observed that only 9 instances of cross-strand disulfides exist in a non-redundant dataset. Stereochemical analysis shows that while tbe chi(square) angles are similar to those of other disulfides, the chi(1) and chi(2) angles show more variation and that one of tbe strands is generally an edge strand.

Discovering Math APIs by Mining Unit Tests

In today's API-rich world, programmer productivity depends heavily on the programmer's ability to discover the required APIs. In this paper, we present a technique and tool, called MATHFINDER, to discover APIs for mathematical computations by mining unit tests of API methods. Given a math expression, MATHFINDER synthesizes pseudo-code to compute the expression by mapping its subexpressions to API method calls. For each subexpression, MATHFINDER searches for a method such that there is a mapping between method inputs and variables of the subexpression. The subexpression, when evaluated on the test inputs of the method under this mapping, should produce results that match the method output on a large number of tests. We implemented MATHFINDER as an Eclipse plugin for discovery of third-party Java APIs and performed a user study to evaluate its effectiveness. In the study, the use of MATHFINDER resulted in a 2x improvement in programmer productivity. In 96% of the subexpressions queried for in the study, MATHFINDER retrieved the desired API methods as the top-most result. The top-most pseudo-code snippet to implement the entire expression was correct in 93% of the cases. Since the number of methods and unit tests to mine could be large in practice, we also implement MATHFINDER in a MapReduce framework and evaluate its scalability and response time.

Synthesizing Racy Tests

Subtle concurrency errors in multithreaded libraries that arise because of incorrect or inadequate synchronization are often difficult to pinpoint precisely using only static techniques. On the other hand, the effectiveness of dynamic race detectors is critically dependent on multithreaded test suites whose execution can be used to identify and trigger races. Usually, such multithreaded tests need to invoke a specific combination of methods with objects involved in the invocations being shared appropriately to expose a race. Without a priori knowledge of the race, construction of such tests can be challenging. In this paper, we present a lightweight and scalable technique for synthesizing precisely these kinds of tests. Given a multithreaded library and a sequential test suite, we describe a fully automated analysis that examines sequential execution traces, and produces as its output a concurrent client program that drives shared objects via library method calls to states conducive for triggering a race. Experimental results on a variety of well-tested Java libraries yield 101 synthesized multithreaded tests in less than four minutes. Analyzing the execution of these tests using an off-the-shelf race detector reveals 187 harmful races, including several previously unreported ones.

Pattern Recognition With Weighted Complex Networks

In this paper we introduce a weighted complex networks model to investigate and recognize structures of patterns. The regular treating in pattern recognition models is to describe each pattern as a high-dimensional vector which however is insufficient to express the structural information. Thus, a number of methods are developed to extract the structural information, such as different feature extraction algorithms used in pre-processing steps, or the local receptive fields in convolutional networks. In our model, each pattern is attributed to a weighted complex network, whose topology represents the structure of that pattern. Based upon the training samples, we get several prototypal complex networks which could stand for the general structural characteristics of patterns in different categories. We use these prototypal networks to recognize the unknown patterns. It is an attempt to use complex networks in pattern recognition, and our result shows the potential for real-world pattern recognition. A spatial parameter is introduced to get the optimal recognition accuracy, and it remains constant insensitive to the amount of training samples. We have discussed the interesting properties of the prototypal networks. An approximate linear relation is found between the strength and color of vertexes, in which we could compare the structural difference between each category. We have visualized these prototypal networks to show that their topology indeed represents the common characteristics of patterns. We have also shown that the asymmetric strength distribution in these prototypal networks brings high robustness for recognition. Our study may cast a light on understanding the mechanism of the biologic neuronal systems in object recognition as well.

钝体尾流控制机理及方法研究进展

首先从涡脱落生成理论出发对钝体尾流控制方法进行了分类,并简单介绍r国内尾流控制研究情况.之后介绍r我们用窄条或小方柱取代小圆柱后,对Strykowsky和Sreenivasan控制方法的改进及其在高雷诺数下对圆柱和方柱尾流涡脱落的有效抑制情况,并探讨了控制件钝度对抑制效果的影响.第3部分用实验数据对各个涡脱落生成模型做了分析与检验,指出控制件方法的机理与改变钝体分离位置、减小钝体背压吸力、改变流动的腱向相关性、防止钝体两侧剪切层相互作用等无关,而与钝体近尾流速度剖面的局部修正及其稳定性的改变有关.最后简单介绍了控制件方法今后研究工作展望及其工程应用前景.

Métodos cuantitativos versus métodos cualitativos en la economía de los Negocios. ¿Es una metodología reconciliable?

Changes in the organizational environment over the last three decades have increasingly led to traditional theories being called into question, by stimulating the search for new models suited to the new realities of business economics, generating a crisis or scientific revolution that may result in the appearance of a new paradigm. The positivism-phenomenology duality provokes an “epistemological crisis” in research in management sciences. But the existence of both approaches does not imply the election of one scientific orientation in frontal opposition to the other. From these two conceptions of research procedure, the methods applied can be classed into groups, quantitative and qualitative. The quantitative methodologies places great confidence in the ability of data and measurement to represent opinions or concepts, while qualitative methodologies focus on words and relations to describe a reality or situation. While the diversity of methods contribute to its development and indicates the maturity of an area, the methods must be suitably implemented to obtain significant, valid results. The methodology to be used is not going to depend solely on the type of study or the reality under examination, but also on the stage the research process has reached.

在役设备材料断裂力学参数测定方法综述——小冲杆实验力学研究进展之二

20多年以来, 用小型试件的小冲杆实验技术来测量在役设备材料的各种力学参数已经取得了很大进展. 小冲杆实验的试样虽然还没有标准, 但一般均采用直径为3～10mm,厚度为0.1～0.5mm的圆片试样.这个方法已经用来确定材料的弹性模量、屈服强度、塑性性能、抗拉强度、断裂形态转变温度、断裂韧性、蠕变性能以及表示塑性硬化和韧性损伤的微观力学参数和黏塑性性能等各种力学性能.该方法兼具取样方便和几乎无损的优点,非常适用于那些无法取出传统试样或取样不经济的场合,因此引起科技界和工业界的关注.本文综述了小冲杆试验的测量技术及从测量数据来确定材料断裂形态转变温度、断裂韧性和主曲线的移动温度的各种计算方法研究进展.

Otimização multimodal através de novas técnicas baseadas em clusterização nebulosa

Neste trabalho, é proposta uma nova família de métodos a ser aplicada à otimização de problemas multimodais. Nestas técnicas, primeiramente são geradas soluções iniciais com o intuito de explorar o espaço de busca. Em seguida, com a finalidade de encontrar mais de um ótimo, estas soluções são agrupadas em subespaços utilizando um algoritmo de clusterização nebulosa. Finalmente, são feitas buscas locais através de métodos determinísticos de otimização dentro de cada subespaço gerado na fase anterior com a finalidade de encontrar-se o ótimo local. A família de métodos é formada por seis variantes, combinando três esquemas de inicialização das soluções na primeira fase e dois algoritmos de busca local na terceira. A fim de que esta nova família de métodos possa ser avaliada, seus constituintes são comparados com outras metodologias utilizando problemas da literatura e os resultados alcançados são promissores.

Nitrates - loss processes in raw water

This project investigated the production of nitrate (nitrification) by bacteria in lakes. The work was undertaken as nitrification is a key process in the nitrogen cycle and previous estimates of rates of nitrification were unreliable. When different methods were used to estimate rates of nitrification within sediment deposits different results were obtained. Investigation' of specific aspects of these methodologies has allowed some rationalization of these observations and also enabled comparisons of previously published data which, beforehand, was not possible. However, it was not clear which methods gave the most reliable rate estimates. Calculation of a nitrate budget for Grasmere lake indicated that the use of methods which involved the mixing of surface sediments (and therefore disrupted preformed nutrient gradients) overestimated the rate of nitrification. The study concludes that slight changes in the method used to prepare sediment slurries can result in large changes, in the measured nitrifying activity. This makes comparisons between studies, using different methods, extremely difficult. Methods to study sediment nitrification processes which do not disrupt preformed substrate gradients within the sediment provide the most reliable rate estimates.

图像处理在光路自动准直系统中的应用

光路自动准直系统应用于惯性约束聚变的高功率激光装置中的光束自动调整。图像处理是光路自动准直的关键技术之一。针对神光Ⅲ原型装置，结合阈值化、重心法、中值滤波和圆拟合等多种不同的图像处理方法设计了一套合理的准直方案，并且在模拟实验平台上进行了实验验证。实验结果表明，光路自动准直系统能够在15min之内顺利完成光路的自动调整，光束近场调整精度优于近场光斑的±0．5％，光束远场调整精度≤±0．3″，满足了原型装置的总体要求。

Proposição e análise de modelos híbridos para o problema de escalonamento de produção em oficina de máquinas

Nas últimas décadas, o problema de escalonamento da produção em oficina de máquinas, na literatura referido como JSSP (do inglês Job Shop Scheduling Problem), tem recebido grande destaque por parte de pesquisadores do mundo inteiro. Uma das razões que justificam tamanho interesse está em sua alta complexidade. O JSSP é um problema de análise combinatória classificado como NP-Difícil e, apesar de existir uma grande variedade de métodos e heurísticas que são capazes de resolvê-lo, ainda não existe hoje nenhum método ou heurística capaz de encontrar soluções ótimas para todos os problemas testes apresentados na literatura. A outra razão basea-se no fato de que esse problema encontra-se presente no diaa- dia das indústrias de transformação de vários segmento e, uma vez que a otimização do escalonamento pode gerar uma redução significativa no tempo de produção e, consequentemente, um melhor aproveitamento dos recursos de produção, ele pode gerar um forte impacto no lucro dessas indústrias, principalmente nos casos em que o setor de produção é responsável por grande parte dos seus custos totais. Entre as heurísticas que podem ser aplicadas à solução deste problema, o Busca Tabu e o Multidão de Partículas apresentam uma boa performance para a maioria dos problemas testes encontrados na literatura. Geralmente, a heurística Busca Tabu apresenta uma boa e rápida convergência para pontos ótimos ou subótimos, contudo esta convergência é frequentemente interrompida por processos cíclicos e a performance do método depende fortemente da solução inicial e do ajuste de seus parâmetros. A heurística Multidão de Partículas tende a convergir para pontos ótimos, ao custo de um grande esforço computacional, sendo que sua performance também apresenta uma grande sensibilidade ao ajuste de seus parâmetros. Como as diferentes heurísticas aplicadas ao problema apresentam pontos positivos e negativos, atualmente alguns pesquisadores começam a concentrar seus esforços na hibridização das heurísticas existentes no intuito de gerar novas heurísticas híbridas que reúnam as qualidades de suas heurísticas de base, buscando desta forma diminuir ou mesmo eliminar seus aspectos negativos. Neste trabalho, em um primeiro momento, são apresentados três modelos de hibridização baseados no esquema geral das Heurísticas de Busca Local, os quais são testados com as heurísticas Busca Tabu e Multidão de Partículas. Posteriormente é apresentada uma adaptação do método Colisão de Partículas, originalmente desenvolvido para problemas contínuos, onde o método Busca Tabu é utilizado como operador de exploração local e operadores de mutação são utilizados para perturbação da solução. Como resultado, este trabalho mostra que, no caso dos modelos híbridos, a natureza complementar e diferente dos métodos Busca Tabu e Multidão de Partículas, na forma como são aqui apresentados, da origem à algoritmos robustos capazes de gerar solução ótimas ou muito boas e muito menos sensíveis ao ajuste dos parâmetros de cada um dos métodos de origem. No caso do método Colisão de Partículas, o novo algorítimo é capaz de atenuar a sensibilidade ao ajuste dos parâmetros e de evitar os processos cíclicos do método Busca Tabu, produzindo assim melhores resultados.

O ZEP Framework: um framework para a criação de métodos para envolvimento de stakeholders no desenvolvimento de soluções de software.

A especificação dos requisitos de software pressupõe que se conheçam os requisitos do sistema do que será parte. Os requisitos do sistema, por sua vez, pressupõem o conhecimento do negócio (business) onde o sistema será utilizado. Para que estes conhecimentos sejam obtidos é importante o envolvimento dos stakeholders tanto no nível de sistema quanto no nível de negócio. As literaturas sobre Engenharia de Requisitos, Engenharia de Software e Engenharia de Sistemas concordam que o envolvimento dos stakeholders é fundamental. O tratamento dispensado ao assunto, no entanto, é pequeno, dada a importância do tema. Esta dissertação, utilizando conceitos da Engenharia de Métodos Situacionais e de Design Science, apresenta o ZEP Framework, um artefato, produzido com o software EPF Composer, que permite a criação de métodos para envolver o stakeholder. Estes métodos, para serem criados, devem levar em consideração as peculiaridades da organização, dos recursos disponíveis e do projeto em si. São apresentados, ainda, alguns cenários, na área de Turismo, como exemplos da utilização do framework.

Selección de métodos de análisis de fatiga para ejes de transmisiones de máquinas.

[ES]Existe un elevado número de métodos para cálculos de fatiga en piezas sometidas a estados de tensiones multiaxiales. Cada método tiene un campo óptimo de aplicación: para materiales dúctiles, frágiles, estados con y sin tensiones medias, etc. En este Trabajo de Fin de Grado se trata de estudiar la precisión que proporcionan diferentes métodos de enfoque global (no de plano crítico) y comparar sus resultados a fin de decidir cuáles son los idóneos para los casos de carga más frecuentes en los ejes de transmisiones en automóviles.