Analysis of neuronal functions based on feynman diagrams

A method to study some neuronal functions, based on the use of the Feynman diagrams, employed in many-body theory, is reported. An equation obtained from the neuron cable theory is the basis for the method. The Green's function for this equation is obtained under some simple boundary conditions. An excitatory signal, with different conditions concerning high and pulse duration, is employed as input signal. Different responses have been obtained

Dominance intensity measure within fuzzy weight oriented MAUT: an application

We introduce a dominance intensity measuring method to derive a ranking of alternatives to deal with incomplete information in multi-criteria decision-making problems on the basis of multi-attribute utility theory (MAUT) and fuzzy sets theory. We consider the situation where there is imprecision concerning decision-makers’ preferences, and imprecise weights are represented by trapezoidal fuzzy weights.The proposed method is based on the dominance values between pairs of alternatives. These values can be computed by linear programming, as an additive multi-attribute utility model is used to rate the alternatives. Dominance values are then transformed into dominance intensity measures, used to rank the alternatives under consideration. Distances between fuzzy numbers based on the generalization of the left and right fuzzy numbers are utilized to account for fuzzy weights. An example concerning the selection of intervention strategies to restore an aquatic ecosystem contaminated by radionuclides illustrates the approach. Monte Carlo simulation techniques have been used to show that the proposed method performs well for different imprecision levels in terms of a hit ratio and a rank-order correlation measure.

A new similarity function for generalized trapezoidal fuzzy numbers

Numerous authors have proposed functions to quantify the degree of similarity between two fuzzy numbers using various descriptive parameters, such as the geometric distance, the distance between the centers of gravity or the perimeter. However, these similarity functions have drawback for specific situations. We propose a new similarity measure for generalized trapezoidal fuzzy numbers aimed at overcoming such drawbacks. This new measure accounts for the distance between the centers of gravity and the geometric distance but also incorporates a new term based on the shared area between the fuzzy numbers. The proposed measure is compared against other measures in the literature.

A fuzzy MCDA framework for safety assessment in the remediation of a uranium mill tailings site in Ukraine

The Pridneprovsky Chemical Plant was one of the largest uranium processing enterprises in the former USSR, producing a huge amount of uranium residues. The Zapadnoe tailings site contains most of these residues. We propose a theoretical framework based on multicriteria decision analysis and fuzzy logic to analyze different remediation alternatives for the Zapadnoe tailings, which simultaneously accounts for potentially conflicting economic, social and environmental objectives. We build an objective hierarchy that includes all the relevant aspects. Fuzzy rather than precise values are proposed for use to evaluate remediation alternatives against the different criteria and to quantify preferences, such as the weights representing the relative importance of criteria identified in the objective hierarchy. Finally, we suggest that remediation alternatives should be evaluated by means of a fuzzy additive multi-attribute utility function and ranked on the basis of the respective trapezoidal fuzzy number representing their overall utility.

Contribución al estudio de las negaciones, autocontradicción, t-normas y t-conormas en los conjuntos borrosos de tipo 2

Los conjuntos borrosos de tipo 2 (T2FSs) fueron introducidos por L.A. Zadeh en 1975 [65], como una extensión de los conjuntos borrosos de tipo 1 (FSs). Mientras que en estos últimos el grado de pertenencia de un elemento al conjunto viene determinado por un valor en el intervalo [0, 1], en el caso de los T2FSs el grado de pertenencia de un elemento es un conjunto borroso en [0,1], es decir, un T2FS queda determinado por una función de pertenencia μ : X → M, donde M = [0, 1][0,1] = Map([0, 1], [0, 1]), es el conjunto de las funciones de [0,1] en [0,1] (ver [39], [42], [43], [61]). Desde que los T2FSs fueron introducidos, se han generalizado a dicho conjunto (ver [39], [42], [43], [61], por ejemplo), a partir del “Principio de Extensión” de Zadeh [65] (ver Teorema 1.1), muchas de las definiciones, operaciones, propiedades y resultados obtenidos en los FSs. Sin embargo, como sucede en cualquier área de investigación, quedan muchas lagunas y problemas abiertos que suponen un reto para cualquiera que quiera hacer un estudio profundo en este campo. A este reto se ha dedicado el presente trabajo, logrando avances importantes en este sentido de “rellenar huecos” existentes en la teoría de los conjuntos borrosos de tipo 2, especialmente en las propiedades de autocontradicción y N-autocontradicción, y en las operaciones de negación, t-norma y t-conorma sobre los T2FSs. Cabe destacar que en [61] se justifica que las operaciones sobre los T2FSs (Map(X,M)) se pueden definir de forma natural a partir de las operaciones sobre M, verificando las mismas propiedades. Por tanto, por ser más fácil, en el presente trabajo se toma como objeto de estudio a M, y algunos de sus subconjuntos, en vez de Map(X,M). En cuanto a la operación de negación, en el marco de los conjuntos borrosos de tipo 2 (T2FSs), usualmente se emplea para representar la negación en M, una operación asociada a la negación estándar en [0,1]. Sin embargo, dicha operación no verifica los axiomas que, intuitivamente, debe verificar cualquier operación para ser considerada negación en el conjunto M. En este trabajo se presentan los axiomas de negación y negación fuerte en los T2FSs. También se define una operación asociada a cualquier negación suprayectiva en [0,1], incluyendo la negación estándar, y se estudia, junto con otras propiedades, si es negación y negación fuerte en L (conjunto de las funciones de M normales y convexas). Además, se comprueba en qué condiciones se cumplen las leyes de De Morgan para un extenso conjunto de pares de operaciones binarias en M. Por otra parte, las propiedades de N-autocontradicción y autocontradicción, han sido suficientemente estudiadas en los conjuntos borrosos de tipo 1 (FSs) y en los conjuntos borrosos intuicionistas de Atanassov (AIFSs). En el presente trabajo se inicia el estudio de las mencionadas propiedades, dentro del marco de los T2FSs cuyos grados de pertenencia están en L. En este sentido, aquí se extienden los conceptos de N-autocontradicción y autocontradicción al conjunto L, y se determinan algunos criterios para verificar tales propiedades. En cuanto a otras operaciones, Walker et al. ([61], [63]) definieron dos familias de operaciones binarias sobre M, y determinaron que, bajo ciertas condiciones, estas operaciones son t-normas (normas triangulares) o t-conormas sobre L. En este trabajo se introducen operaciones binarias sobre M, unas más generales y otras diferentes a las dadas por Walker et al., y se estudian varias propiedades de las mismas, con el objeto de deducir nuevas t-normas y t-conormas sobre L. ABSTRACT Type-2 fuzzy sets (T2FSs) were introduced by L.A. Zadeh in 1975 [65] as an extension of type-1 fuzzy sets (FSs). Whereas for FSs the degree of membership of an element of a set is determined by a value in the interval [0, 1] , the degree of membership of an element for T2FSs is a fuzzy set in [0,1], that is, a T2FS is determined by a membership function μ : X → M, where M = [0, 1][0,1] is the set of functions from [0,1] to [0,1] (see [39], [42], [43], [61]). Later, many definitions, operations, properties and results known on FSs, have been generalized to T2FSs (e.g. see [39], [42], [43], [61]) by employing Zadeh’s Extension Principle [65] (see Theorem 1.1). However, as in any area of research, there are still many open problems which represent a challenge for anyone who wants to make a deep study in this field. Then, we have been dedicated to such challenge, making significant progress in this direction to “fill gaps” (close open problems) in the theory of T2FSs, especially on the properties of self-contradiction and N-self-contradiction, and on the operations of negations, t-norms (triangular norms) and t-conorms on T2FSs. Walker and Walker justify in [61] that the operations on Map(X,M) can be defined naturally from the operations onMand have the same properties. Therefore, we will work onM(study subject), and some subsets of M, as all the results are easily and directly extensible to Map(X,M). About the operation of negation, usually has been employed in the framework of T2FSs, a operation associated to standard negation on [0,1], but such operation does not satisfy the negation axioms on M. In this work, we introduce the axioms that a function inMshould satisfy to qualify as a type-2 negation and strong type-2 negation. Also, we define a operation on M associated to any suprajective negation on [0,1], and analyse, among others properties, if such operation is negation or strong negation on L (all normal and convex functions of M). Besides, we study the De Morgan’s laws, with respect to some binary operations on M. On the other hand, The properties of self-contradiction and N-self-contradiction have been extensively studied on FSs and on the Atanassov’s intuitionistic fuzzy sets (AIFSs). Thereon, in this research we begin the study of the mentioned properties on the framework of T2FSs. In this sense, we give the definitions about self-contradiction and N-self-contradiction on L, and establish the criteria to verify these properties on L. Respect to the t-norms and t-conorms, Walker et al. ([61], [63]) defined two families of binary operations on M and found that, under some conditions, these operations are t-norms or t-conorms on L. In this work we introduce more general binary operations on M than those given by Walker et al. and study which are the minimum conditions necessary for these operations satisfy each of the axioms of the t-norm and t-conorm.

Fuzzy MCDA for remediation of a uranium tailing

The Pridneprovsky Chemical Plant was a largest uranium processing enterprises, producing a huge amount of uranium residues. The Zapadnoe tailings site contains the majority of these residues. We propose a theoretical framework based on Multi-Criteria Decision Analysis and fuzzy logic to analyse different remediation alternatives for the Zapadnoe tailings, in which potentially conflicting economic, radiological, social and environmental objectives are simultaneously taken into account. An objective hierarchy is built that includes all the relevant aspects. Fuzzy rather than precise values are proposed for use to evaluate remediation alternatives against the different criteria and to quantify preferences, such as the weights representing the relative importance of criteria identified in the objective hierarchy. Finally, it is proposed that remediation alternatives should be evaluated by means of a fuzzy additive multi-attribute utility function and ranked on the basis of the respective trapezoidal fuzzy number representing their overall utility.

Biometric authentication of users through iris by using key binding and similarity preserving hash functions = Autenticación biométrica de usuarios a través del iris mediante la ocultación de claves y funciones resumen que preservan la similitud

El extraordinario auge de las nuevas tecnologías de la información, el desarrollo de la Internet de las Cosas, el comercio electrónico, las redes sociales, la telefonía móvil y la computación y almacenamiento en la nube, han proporcionado grandes beneficios en todos los ámbitos de la sociedad. Junto a éstos, se presentan nuevos retos para la protección y privacidad de la información y su contenido, como la suplantación de personalidad y la pérdida de la confidencialidad e integridad de los documentos o las comunicaciones electrónicas. Este hecho puede verse agravado por la falta de una frontera clara que delimite el mundo personal del mundo laboral en cuanto al acceso de la información. En todos estos campos de la actividad personal y laboral, la Criptografía ha jugado un papel fundamental aportando las herramientas necesarias para garantizar la confidencialidad, integridad y disponibilidad tanto de la privacidad de los datos personales como de la información. Por otro lado, la Biometría ha propuesto y ofrecido diferentes técnicas con el fin de garantizar la autentificación de individuos a través del uso de determinadas características personales como las huellas dáctilares, el iris, la geometría de la mano, la voz, la forma de caminar, etc. Cada una de estas dos ciencias, Criptografía y Biometría, aportan soluciones a campos específicos de la protección de datos y autentificación de usuarios, que se verían enormemente potenciados si determinadas características de ambas ciencias se unieran con vistas a objetivos comunes. Por ello es imperativo intensificar la investigación en estos ámbitos combinando los algoritmos y primitivas matemáticas de la Criptografía con la Biometría para dar respuesta a la demanda creciente de nuevas soluciones más técnicas, seguras y fáciles de usar que potencien de modo simultáneo la protección de datos y la identificacíón de usuarios. En esta combinación el concepto de biometría cancelable ha supuesto una piedra angular en el proceso de autentificación e identificación de usuarios al proporcionar propiedades de revocación y cancelación a los ragos biométricos. La contribución de esta tesis se basa en el principal aspecto de la Biometría, es decir, la autentificación segura y eficiente de usuarios a través de sus rasgos biométricos, utilizando tres aproximaciones distintas: 1. Diseño de un esquema criptobiométrico borroso que implemente los principios de la biometría cancelable para identificar usuarios lidiando con los problemas acaecidos de la variabilidad intra e inter-usuarios. 2. Diseño de una nueva función hash que preserva la similitud (SPHF por sus siglas en inglés). Actualmente estas funciones se usan en el campo del análisis forense digital con el objetivo de buscar similitudes en el contenido de archivos distintos pero similares de modo que se pueda precisar hasta qué punto estos archivos pudieran ser considerados iguales. La función definida en este trabajo de investigación, además de mejorar los resultados de las principales funciones desarrolladas hasta el momento, intenta extender su uso a la comparación entre patrones de iris. 3. Desarrollando un nuevo mecanismo de comparación de patrones de iris que considera tales patrones como si fueran señales para compararlos posteriormente utilizando la transformada de Walsh-Hadarmard. Los resultados obtenidos son excelentes teniendo en cuenta los requerimientos de seguridad y privacidad mencionados anteriormente. Cada uno de los tres esquemas diseñados han sido implementados para poder realizar experimentos y probar su eficacia operativa en escenarios que simulan situaciones reales: El esquema criptobiométrico borroso y la función SPHF han sido implementados en lenguaje Java mientras que el proceso basado en la transformada de Walsh-Hadamard en Matlab. En los experimentos se ha utilizado una base de datos de imágenes de iris (CASIA) para simular una población de usuarios del sistema. En el caso particular de la función de SPHF, además se han realizado experimentos para comprobar su utilidad en el campo de análisis forense comparando archivos e imágenes con contenido similar y distinto. En este sentido, para cada uno de los esquemas se han calculado los ratios de falso negativo y falso positivo. ABSTRACT The extraordinary increase of new information technologies, the development of Internet of Things, the electronic commerce, the social networks, mobile or smart telephony and cloud computing and storage, have provided great benefits in all areas of society. Besides this fact, there are new challenges for the protection and privacy of information and its content, such as the loss of confidentiality and integrity of electronic documents and communications. This is exarcebated by the lack of a clear boundary between the personal world and the business world as their differences are becoming narrower. In both worlds, i.e the personal and the business one, Cryptography has played a key role by providing the necessary tools to ensure the confidentiality, integrity and availability both of the privacy of the personal data and information. On the other hand, Biometrics has offered and proposed different techniques with the aim to assure the authentication of individuals through their biometric traits, such as fingerprints, iris, hand geometry, voice, gait, etc. Each of these sciences, Cryptography and Biometrics, provides tools to specific problems of the data protection and user authentication, which would be widely strengthen if determined characteristics of both sciences would be combined in order to achieve common objectives. Therefore, it is imperative to intensify the research in this area by combining the basics mathematical algorithms and primitives of Cryptography with Biometrics to meet the growing demand for more secure and usability techniques which would improve the data protection and the user authentication. In this combination, the use of cancelable biometrics makes a cornerstone in the user authentication and identification process since it provides revocable or cancelation properties to the biometric traits. The contributions in this thesis involve the main aspect of Biometrics, i.e. the secure and efficient authentication of users through their biometric templates, considered from three different approaches. The first one is designing a fuzzy crypto-biometric scheme using the cancelable biometric principles to take advantage of the fuzziness of the biometric templates at the same time that it deals with the intra- and inter-user variability among users without compromising the biometric templates extracted from the legitimate users. The second one is designing a new Similarity Preserving Hash Function (SPHF), currently widely used in the Digital Forensics field to find similarities among different files to calculate their similarity level. The function designed in this research work, besides the fact of improving the results of the two main functions of this field currently in place, it tries to expand its use to the iris template comparison. Finally, the last approach of this thesis is developing a new mechanism of handling the iris templates, considering them as signals, to use the Walsh-Hadamard transform (complemented with three other algorithms) to compare them. The results obtained are excellent taking into account the security and privacy requirements mentioned previously. Every one of the three schemes designed have been implemented to test their operational efficacy in situations that simulate real scenarios: The fuzzy crypto-biometric scheme and the SPHF have been implemented in Java language, while the process based on the Walsh-Hadamard transform in Matlab. The experiments have been performed using a database of iris templates (CASIA-IrisV2) to simulate a user population. The case of the new SPHF designed is special since previous to be applied i to the Biometrics field, it has been also tested to determine its applicability in the Digital Forensic field comparing similar and dissimilar files and images. The ratios of efficiency and effectiveness regarding user authentication, i.e. False Non Match and False Match Rate, for the schemes designed have been calculated with different parameters and cases to analyse their behaviour.

A molecular basis for nitric oxide sensing by soluble guanylate cyclase

Nitric oxide (NO) functions as a signaling agent by activation of the soluble isoform of guanylate cyclase (sGC), a heterodimeric hemoprotein. NO binds to the heme of sGC and triggers formation of cGMP from GTP. Here we report direct kinetic measurements of the multistep binding of NO to sGC and correlate these presteady state events with activation of enzyme catalysis. NO binds to sGC to form a six-coordinate, nonactivated, intermediate (kon > 1.4 × 108 M−1⋅s−1 at 4°C). Subsequent release of the axial histidine heme ligand is shown to be the molecular step responsible for activation of the enzyme. The rate at which this step proceeds also depends on NO concentration (k = 2.4 × 105 M−1⋅s−1 at 4°C), thus identifying a novel mode of regulation by NO. NO binding to the isolated heme domain of sGC was also rapid (k = 7.1 ± 2 × 108 M−1⋅s−1 at 4°C); however, no intermediate was observed. The data show that sGC acts as an extremely fast, specific, and highly efficient trap for NO and that cleavage of the iron-histidine bond provides the driving force for activation of sGC. In addition, the kinetic data indicate that transport or stabilization of NO is not necessary for effective signal transmission.

Assembly of a Novel Cartilage Matrix Protein Filamentous Network: Molecular Basis of Differential Requirement of von Willebrand Factor A Domains

Cartilage matrix protein (CMP) is the prototype of the newly discovered matrilin family, all of which contain von Willebrand factor A domains. Although the function of matrilins remain unclear, we have shown that, in primary chondrocyte cultures, CMP (matrilin-1) forms a filamentous network, which is made up of two types of filaments, a collagen-dependent one and a collagen-independent one. In this study, we demonstrate that the collagen-independent CMP filaments are enriched in pericellular compartments, extending directly from chondrocyte membranes. Their morphology can be distinguished from that of collagen filaments by immunogold electron microscopy, and mimicked by that of self-assembled purified CMP. The assembly of CMP filaments can occur from transfection of a wild-type CMP transgene alone in skin fibroblasts, which do not produce endogenous CMP. Conversely, assembly of endogenous CMP filaments by chondrocytes can be inhibited specifically by dominant negative CMP transgenes. The two A domains within CMP serve essential but different functions during network formation. Deletion of the A2 domain converts the trimeric CMP into a mixture of monomers, dimers, and trimers, whereas deletion of the A1 domain does not affect the trimeric configuration. This suggests that the A2 domain modulates multimerization of CMP. Absence of either A domain from CMP abolishes its ability to form collagen-independent filaments. In particular, Asp22 in A1 and Asp255 in A2 are essential; double point mutation of these residues disrupts CMP network formation. These residues are part of the metal ion–dependent adhesion sites, thus a metal ion–dependent adhesion site–mediated adhesion mechanism may be applicable to matrilin assembly. Taken together, our data suggest that CMP is a bridging molecule that connects matrix components in cartilage to form an integrated matrix network.

Coverage and invariability in fuzzy systems

This paper presents a new complex system systemic. Here, we are working in a fuzzy environment, so we have to adapt all the previous concepts and results that were obtained in a non-fuzzy environment, for this fuzzy case. The direct and indirect influences between variables will provide the basis for obtaining fuzzy and/or non-fuzzy relationships, so that the concepts of coverage and invariability between sets of variables will appear naturally. These two concepts and their interconnections will be analyzed from the viewpoint of algebraic properties of inclusion, union and intersection (fuzzy and non-fuzzy), and also for the loop concept, which, as we shall see, will be of special importance.

Cyclobutadiene automerization and rotation of ethylene: Energetics of the barriers by using Spin-polarized wave functions

Spin-projected spin polarized Møller–Plesset and spin polarized coupled clusters calculations have been made to estimate the cyclobutadiene automerization, the ethylene torsion barriers in their ground state, and the gap between the singlet and triplet states of ethylene. The results have been obtained optimizing the geometries at MP4 and/or CCSD levels, by an extensive Gaussian basis set. A comparative analysis with more complex calculations, up to MP5 and CCSDTQP, together with others from the literature, have also been made, showing the efficacy of using spin-polarized wave functions as a reference wave function for Møller–Plesset and coupled clusters calculations, in such problems.

Invariability, orbits and fuzzy attractors

In this paper, we present a generalization of a new systemic approach to abstract fuzzy systems. Using a fuzzy relations structure will retain the information provided by degrees of membership. In addition, to better suit the situation to be modelled, it is advisable to use T-norm or T-conorm distinct from the minimum and maximum, respectively. This gain in generality is due to the completeness of the work on a higher level of abstraction. You cannot always reproduce the results obtained previously, and also sometimes different definitions with different views are obtained. In any case this approach proves to be much more effective when modelling reality.

The Economic Basis of Attitudes towards the European Community: Familiarity Breeds Content. Institute for Advanced Studies Political Science Series, 12 April 1994

The purpose of this paper is to analyse the economic basis of mass support for, and opposition to the European Community. In other words the main question is: to what extent, and in what ways, is popular support or opposition to the EC dependent upon economic circumstances and considerations? Behind this research question lies the matter of the legitimacy of the EC in the eyes of citizens across Europe. In some respects the results of this study are frustrating and inconclusive. In other respects, however, the results suggest some clear generalizations and conclusions. First, we have found rather little evidence that the EC or European unification are evaluated in primarily economic terms. Secondly, support seems to be associated more strongly with social and attitudinal variables of a non-economic kind. Thirdly, the figures suggest that diffuse and somewhat idealistic reasons for supporting unification and EC membership tend to outweigh more specific reasons. Fourthly, a solid foundation of inertia, custom, and national tradition seem to maintain support and make it grow.

Determinant representations of correlation functions for the supersymmetric t-J model

Working in the F-basis provided by the factorizing F-matrix, the scalar products of Bethe states for the supersymmetric t-J model are represented by determinants. By means of these results, we obtain determinant representations of correlation functions for the model.

On the construction of correlation functions for the integrable supersymmetric fermion models

We review the recent progress on the construction of the determinant representations of the correlation functions for the integrable supersymmetric fermion models. The factorizing F-matrices (or the so-called F-basis) play an important role in the construction. In the F-basis, the creation (and the annihilation) operators and the Bethe states of the integrable models are given in completely symmetric forms. This leads to the determinant representations of the scalar products of the Bethe states for the models. Based on the scalar products, the determinant representations of the correlation functions may be obtained. As an example, in this review, we give the determinant representations of the two-point correlation function for the U-q(gl(2 vertical bar 1)) (i.e. q-deformed) supersymmetric t-J model. The determinant representations are useful for analyzing physical properties of the integrable models in the thermodynamical limit.