1000 resultados para Elliptic functions.
Resumo:
In this work we will look at connections between aggregation functions and optimization. There are two such connections: 1) aggregation functions are used to transform a multiobjective optimization problem into a single objective problem by aggregating several criteria into one, and 2) construction of aggregation functions often involves an optimization problem.
Resumo:
This paper presents some results on the global exponential stabilization for neural networks with various activation functions and time-varying continuously distributed delays. Based on augmented time-varying Lyapunov-Krasovskii functionals, new delay-dependent conditions for the global exponential stabilization are obtained in terms of linear matrix inequalities. A numerical example is given to illustrate the feasibility of our results.
Resumo:
This study found that a majority of Australian accounting firms either currently oursource accounting services or are considering outsourcing, and identified the significance of outsourcing contracts. It established that most firms outsource their core services. The study provided important information regarding ethical issues and the relinquishment of professional status.
Resumo:
Most dispute resolution is settled by negotiation rather than litigation. However, such bargaining often occurs in the shadow of the law. To help support interest-based negotiation, we explore the use of utility functions to support negotiation analysis. We discuss in detail a utility function we have developed in the area of family-law mediation. This function is currently being used as the basis of an online dispute resolution system.
Resumo:
In this work we propose a definition of weak local reduction operators and an algorithm that uses such operators to reduce images. We show how to construct local reduction operators by means of different aggregation functions. We also present several experimental results obtained using these aggregation functions-based reduction operators.
Resumo:
A key component of many decision making processes is the aggregation step, whereby a set of numbers is summarised with a single representative value. This research showed that aggregation functions can provide a mathematical formalism to deal with issues like vagueness and uncertainty, which arise naturally in various decision contexts.
Resumo:
EGF domains are extracellular protein modules cross-linked by three intradomain disulfides. Past studies suggest the existence of two types of EGF domain with three-disulfides, human EGF-like (hEGF) domains and complement C1r-like (cEGF) domains, but to date no functional information has been related to the two different types, and they are not differentiated in sequence or structure databases. We have developed new sequence patterns based on the different C-termini to search specifically for the two types of EGF domains in sequence databases. The exhibited sensitivity and specificity of the new pattern-based method represents a significant advancement over the currently available sequence detection techniques. We re-annotated EGF sequences in the latest release of Swiss-Prot looking for functional relationships that might correlate with EGF type. We show that important post-translational modifications of three-disulfide EGFs, including unusual forms of glycosylation and post-translational proteolytic processing, are dependent on EGF subtype. For example, EGF domains that are shed from the cell surface and mediate intercellular signaling are all hEGFs, as are all human EGF receptor family ligands. Additional experimental data suggest that functional specialization has accompanied subtype divergence. Based on our structural analysis of EGF domains with three-disulfide bonds and comparison to laminin and integrin-like EGF domains with an additional interdomain disulfide, we propose that these hEGF and cEGF domains may have arisen from a four-disulfide ancestor by selective loss of different cysteine residues.
Independent functions of yeast Pcf11p in pre-mRNA 3´ end processing and in transcription termination
Resumo:
Pcf11p, an essential subunit of the yeast cleavage factor IA, is required for pre-mRNA 3' end processing, binds to the C-terminal domain (CTD) of the largest subunit of RNA polymerase II (RNAP II) and is involved in transcription termination. We show that the conserved CTD interaction domain (CID) of Pcf11p is essential for cell viability. Interestingly, the CTD binding and 3' end processing activities of Pcf11p can be functionally uncoupled from each other and provided by distinct Pcf11p fragments in trans. Impaired CTD binding did not affect the 3' end processing activity of Pcf11p and a deficiency of Pcf11p in 3' end processing did not prevent CTD binding. Transcriptional run-on analysis with the CYC1 gene revealed that loss of cleavage activity did not correlate with a defect in transcription termination, whereas loss of CTD binding did. We conclude that Pcf11p is a bifunctional protein and that transcript cleavage is not an obligatory step prior to RNAP II termination.
Resumo:
The Saccharomyces cerevisiae WD-40 repeat protein Swd2p associates with two functionally distinct multiprotein complexes: the cleavage and polyadenylation factor (CPF) that is involved in pre-mRNA and snoRNA 3′ end formation and the SET1 complex (SET1C) that methylates histone 3 lysine 4. Based on bioinformatic analysis we predict a seven-bladed β-propeller structure for Swd2p proteins. Northern, transcriptional run-on and in vitro 3′ end cleavage analyses suggest that temperature sensitive swd2 strains were defective in 3′ end formation of specific mRNAs and snoRNAs. Protein–protein interaction studies support a role for Swd2p in the assembly of 3′ end formation complexes. Furthermore, histone 3 lysine 4 di-and tri-methylation were adversely affected and telomeres were shortened in swd2 mutants. Underaccumulation of the Set1p methyltransferase accounts for the observed loss of SET1C activity and suggests a requirement for Swd2p for the stability or assembly of this complex. We also provide evidence that the roles of Swd2p as component of CPF and SET1C are functionally independent. Taken together, our results establish a dual requirement for Swd2p in 3′ end formation and histone tail modification.
Resumo:
In this work we present the concept of penalty function over a Cartesian product of lattices. To build these mappings, we make use of restricted dissimilarity functions and distances between fuzzy sets. We also present an algorithm that extends the weighted voting method for a fuzzy preference relation.
Resumo:
In this work we introduce the definition of restricted dissimilarity functions and we link it with some other notions, such as metrics. In particular, we also show how restricted dissimilarity functions can be used to build penalty functions.
Resumo:
In this work we present a new image thresholding algorithm for the segmentation of MRI brain images into two classes: gray matter and white matter. The proposed algorithm is based on the concept of incomparability proposed by Fodor and Roubens for fuzzy preference relations. We test our algorithm for local and global segmentation of brain images. We proof that global segmentation performs better results than local segmentation and improves the results obtained by other thresholding algorithm.